How to LeetCode — LeetCode Study Plan

Stop the grind. Study with plan! Here’s the patterns that covers 95% of the questions you’ll see on LeetCode.

Binary Search

Sorted Array

Implicitly Sorted Array

Depth First Search

DFS on Tree

Backtracking

Combinatorial Search

Memoization

Pruning

Dedup

Additional Practices

Breadth First Search

BFS on Tree

Graph

BFS on trees

Matrix as Graph

Directed Graph / Topological Sort

Two Pointers

Same Direction

Opposite Direction

Sliding Window

Prefix Sum

Cycle Finding

Priority Queue / Heap

Top K

Moving Best

Multiple Heaps

Dynamic Programming

Sequence

Grid

Dynamic number of subproblems

Partition

Interval

Two Sequences

Game Theory

0–1 Knapsack

Bitmask

Disjoint Set Union | Union Find

Monotonic Stack

Trie

Line Sweep

Interval

Data Structure Design

Composite Patterns

--

--

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store