Algorithm Patterns

Arrays & Hashing

Master the fundamentals of arrays and hash-based data structures for O(1) lookups.

8 problems

Two Pointers

Learn to solve problems efficiently using the two-pointer technique.

5 problems

Stack

Understand LIFO data structure and its applications in parsing and backtracking.

7 problems

Sliding Window

Optimize subarray and substring problems with the sliding window pattern.

6 problems

Binary Search

Divide and conquer with logarithmic time complexity.

7 problems

Linked List

Navigate node-based data structures with pointer manipulation.

8 problems

Trees

Traverse and manipulate hierarchical data structures.

8 problems

Tries

Efficiently store and search strings with prefix trees.

3 problems

Backtracking

Explore all possibilities with systematic trial and error.

8 problems

Heap / Priority Queue

Maintain priority with heap-based data structures.

7 problems

Graphs

Model relationships and connections between entities.

8 problems

Advanced Graphs

Master complex graph algorithms like shortest paths and minimum spanning trees.

6 problems

1-D DP

Solve optimization problems with one-dimensional dynamic programming.

8 problems

2-D DP

Tackle grid and matrix problems with two-dimensional DP.

8 problems

Greedy

Make locally optimal choices for globally optimal solutions.

8 problems

Intervals

Handle overlapping ranges and scheduling problems.

6 problems

Bit Manipulation

Leverage binary operations for space and time efficiency.

7 problems

Math & Geometry

Apply mathematical concepts to algorithmic problems.

8 problems