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

Overview

Sorted Array

Implicitly Sorted Array

Depth First Search

Introduction

DFS on Tree

Backtracking

Combinatorial Search

Memoization

Pruning

Dedup

Additional Practices

Breadth First Search

Introduction

BFS on Tree

Graph

Introduction

BFS on trees

Matrix as Graph

Directed Graph / Topological Sort

Two Pointers

Introduction

Same Direction

Opposite Direction

Sliding Window

Prefix Sum

Cycle Finding

Priority Queue / Heap

Introduction

Top K

Moving Best

Multiple Heaps

Dynamic Programming

Introduction

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

10x your algorithm interview prep speed. Take the 5-minute quiz: https://algo.monster/evaluator