patternlens©
01Home02Patterns03Questions04Cheatsheet05Notes06Roadmaps07Dashboard

© 2026 PatternLens

patternlens©
Explore
HomePatternsQuestionsCheatsheetNotes
patternlens©
01Home02Patterns03Questions04Cheatsheet05Notes06Roadmaps07Dashboard

© 2026 PatternLens

patternlens©
Explore
HomePatternsQuestionsCheatsheetNotes

01 — the pattern library

master the patterns.
solve the unseen.

Visual guides for the 59 key DSA patterns that form the building blocks of 99% of LeetCode questions. Understand the pattern, recognize it in the interview, and write the solution.

Patterns: 59Curated Problems: 300
ArraysTwo PointersBFSDFSDP
01

Arrays.

4 easy5 med1 hard10 problems
02

Strings.

3 easy2 med1 hard6 problems
03

Linked List.

1 easy9 med10 problems
04

Stacks.

2 easy5 med1 hard8 problems
05

Queues.

2 easy1 med3 problems
06

Hash Tables.

6 easy7 med13 problems
07

Prefix Sum.

1 easy4 med5 problems
08

Two Pointers.

1 easy3 med1 hard5 problems
09

Fast and Slow Pointers.

2 easy1 med3 problems
10

Sliding Window - Fixed Size.

1 easy3 med1 hard5 problems
11

Sliding Window - Dynamic Size.

4 med1 hard5 problems
12

Kadane's Algorithm.

4 med4 problems
13

Recursion.

1 easy2 med3 problems
14

Binary Search.

1 easy7 med2 hard10 problems
15

Bucket Sort.

3 med3 problems
16

Merge Sort.

1 med1 hard2 problems
17

QuickSort / QuickSelect.

2 med2 problems
18

Divide and Conquer.

3 med3 problems
19

LinkedList In-place Reversal.

2 easy1 med1 hard4 problems
20

Tree Traversal - Level Order.

5 med5 problems
21

Tree Traversal - Pre Order.

6 easy4 med1 hard11 problems
22

Tree Traversal - In Order.

3 easy3 med6 problems
23

Tree Traversal - Post-Order.

3 easy5 med1 hard9 problems
24

BST / Ordered Set.

4 med4 problems
25

Tries.

5 med1 hard6 problems
26

Heaps.

3 med3 problems
27

Two Heaps.

3 hard3 problems
28

Top K Elements.

1 easy2 med3 problems
29

K-Way Merge.

2 med2 hard4 problems
30

Intervals.

5 med5 problems
31

Matrix (2D Array).

5 med5 problems
32

Depth First Search (DFS).

9 med1 hard10 problems
33

Breadth First Search (BFS).

3 med3 hard6 problems
34

Topological Sort.

3 med1 hard4 problems
35

Union Find.

3 med1 hard4 problems
36

Minimum Spanning Tree.

1 med1 problems
37

Shortest Path.

4 med1 hard5 problems
38

Eulerian Circuit.

2 hard2 problems
39

Backtracking.

7 med1 hard8 problems
40

Monotonic Stack.

1 easy3 med2 hard6 problems
41

Monotonic Queue.

2 med2 hard4 problems
42

Data Structure Design.

7 med1 hard8 problems
43

Greedy.

4 med3 hard7 problems
44

1-D DP.

2 easy2 med4 problems
45

0/1 Knapsack.

3 med3 problems
46

Unbounded Knapsack.

3 med3 problems
47

Longest Increasing Subsequence (LIS).

2 med1 hard3 problems
48

2D Grid DP.

5 med4 hard9 problems
49

String DP.

6 med3 hard9 problems
50

Tree / Graph DP.

3 med2 hard5 problems
51

Bitmask DP.

2 med1 hard3 problems
52

Digit DP.

1 med2 hard3 problems
53

Probability DP.

3 med3 problems
54

State Machine DP.

1 med1 hard2 problems
55

Maths / Geometry.

1 easy4 med1 hard6 problems
56

Bit Manipulation.

4 easy3 med7 problems
57

String Matching.

1 med2 hard3 problems
58

Binary Indexed Tree / Segment Tree.

1 med1 hard2 problems
59

Line Sweep.

2 hard2 problems

patternlens.

See the patterns. Master the algorithms. Ace the interviews.

Visual DSA pattern library built to turn complex algorithms into clear, intuitive structures.

Learn

  • Patterns
  • Questions
  • Notes
  • Cheatsheet

Build

  • Roadmaps
  • Notes

© 2026 PatternLens. All rights reserved.

Designed & built with care

FAQsPrivacy PolicyCookies Policy