Question Name Link Topic Solved

Contains D[Link] Core Arrays + Subarrays

Remove Dup [Link] Core Arrays + Subarrays
Find the D [Link] Core Arrays + Subarrays
Two Sum [Link] Searching Pairs
Two Sum II[Link] Searching Pairs Yes
Find Pivot [Link] Searching Pairs
Majority E [Link] Frequency & Majority
Maximum Su [Link] Frequency & Majority
Largest Su [Link] Subarray with Given Sum Yes
Longest Su[Link] Subarray with Given Sum
Subarray S[Link] Prefix Sum / XOR Yes
Count Suba[Link] Prefix Sum / XOR Yes
Maximum P[Link] Product + Sliding Window
Minimum Si[Link] Product + Sliding Window Yes
3Sum [Link] Triplets & Revision
Container [Link] Triplets & Revision Yes
Next Permu[Link] Tricky Transformations
Sort Colors[Link] Tricky Transformations Yes
Set Mismat[Link] Tricky Transformations
Set Matrix [Link] 2D Matrix Basics
Spiral Matr[Link] 2D Matrix Basics
Rotate Ima[Link] Rotation & Merge
Merge Sort[Link] Rotation & Merge
Best Time t[Link] Greedy Stock
Max Consec [Link] Greedy Stock
Sliding W [Link] Advanced Patterns Yes
Longest Co[Link] Advanced Patterns
Valid Anag[Link] Strings Basics + Hashing
Isomorphic[Link] Strings Basics + Hashing
Group Ana[Link] Strings Basics + Hashing
Valid Pali [Link] Strings Basics + Hashing Yes
Reverse Str[Link] Strings Two Pointers
Reverse Wor [Link] Strings Two Pointers
Valid Palin [Link] Strings Two Pointers
Longest Pa[Link] Strings Two Pointers Yes
Longest Su[Link] Strings Sliding Window I
Minimum W [Link] Strings Sliding Window I
Permutation [Link] Strings Sliding Window I
Find All An[Link] Strings Sliding Window II
Longest Re[Link] Strings Sliding Window II Yes
Longest Sub [Link] Strings Sliding Window II
Valid Pare [Link] Strings Stack + Pattern Matching
Remove All[Link] Strings Stack + Pattern Matching
Decode Str[Link] Strings Stack + Pattern Matching Yes
Implement[Link]
s String Building + Greedy
Multiply St[Link] String Building + Greedy
Remove K D [Link] String Building + Greedy
Count and [Link] Expression Evaluation Yes
Basic Calcul[Link] Evaluation
Binary Sea [Link] Binary Search Essentials Yes
Find Peak [Link] Binary Search Essentials
Search Inse[Link] Binary Search Essentials
Search in R[Link] Rotated Arrays
Find Minim[Link] Rotated Arrays
Single Elem[Link] Rotated Arrays
Search a 2 [Link] Matrix-Based Search
Matrix Med[Link] Matrix-Based Search
Time Based[Link] Matrix-Based Search
Koko Eatin[Link] Binary Search Advanced
Capacity T [Link] Binary Search Advanced
Minimum N[Link] Binary Search Advanced
Median of [Link] K-th & Median
K-th Eleme[Link] K-th & Median
Nth Root of[Link] K-th & Median
Insert Inte [Link] K-th & Median
Merge Inte[Link] K-th & Median
Allocate M[Link] Problems
Book Alloc [Link] Problems
Aggressive[Link] Problems
Reverse Lin[Link] Lists Basics
Middle of t[Link] Linked Lists Basics
Merge Two[Link] Linked Lists Basics
Remove Nth [Link] Deletion & Intersection
Delete Node [Link] Deletion & Intersection Yes
Intersectio[Link] & Intersection Yes
Linked List [Link] & Palindrome Yes
Linked List [Link] & Palindrome Yes
Palindrome[Link] Cycle & Palindrome
Add Two N[Link] Arithmetic + Reordering
Reorder Lis[Link] Arithmetic + Reordering
Rotate List[Link] Arithmetic + Reordering
Reverse Lin[Link] Reversal
Reverse No[Link] Group Reversal
Copy List [Link] Advanced Pointers
LRU Cache[Link] Advanced Pointers Yes
LFU Cache [Link] Advanced Pointers
Merge k Sor [Link] Mix & Test Yes
Find the Du[Link] Mix & Test
Binary Tre [Link] & Test Yes
Min Stack [Link] Stack Basics
Implement[Link] Stack Basics
Valid Pare [Link] Stack Basics Yes
Implement[Link] Queue & Eval
Evaluate R [Link] Queue & Eval Yes
Daily Temp[Link] Queue & Eval Yes
Next Great[Link] NGE Patterns
Next Greate[Link] NGE Patterns Yes
Next Small[Link] NGE Patterns
Stock Span[Link] NGE Patterns
Sliding W [Link] Sliding Window
First Negat[Link] Window
Maximum of [Link] Sliding Window Yes
Largest Re [Link] Interview-Classics Yes
Trapping R[Link] Interview-Classics Yes
Minimum Ad [Link] Interview-Classics Yes
Remove K D [Link] Greedy Stack
Decode Str[Link] Greedy Stack
Simplify Pa[Link] Greedy Stack Yes
LRU Cache[Link] System Design Style Yes
LFU Cache [Link] System Design Style
Insert Del [Link] System Design Style
Binary Tree[Link] Trees & BSTs Traversals Yes
Binary Tree[Link] Trees & BSTs Traversals
Binary Tree[Link] Trees & BSTs Traversals
Binary Tree[Link] Trees & BSTs Traversals
Binary Tree[Link] & BSTs Traversals Yes
Binary Tree[Link] & BSTs Views Yes
Binary Tree[Link] Trees & BSTs Views
Left View o[Link] Trees & BSTs Views
Top View o[Link] Trees & BSTs Views
Bottom Vie[Link] Trees & BSTs Views
Boundary Tr[Link] Trees & BSTs Views
Maximum Wi [Link] Tree Properties
Maximum De [Link] Tree Properties Yes
Diameter o[Link] Tree Properties Yes
Validate Bi[Link] Tree Properties
Balanced B[Link] Balance & Mirror
Same Tree[Link] Balance & Mirror
Symmetric [Link] Balance & Mirror
Invert Bina[Link] Balance & Mirror
Lowest Com [Link] LCA & Search
Lowest Com [Link] LCA & Search
Search in a[Link] LCA & Search Yes
Construct B[Link] Construction Yes
Construct B[Link] Construction
Construct B[Link] Construction
Flatten Bin[Link] Yes
Binary Tre [Link] Special Topics
Inorder Suc[Link] Special Topics Yes
Populating[Link] Special Topics
Print All [Link] Special Topics
Kth Smalles[Link] BST Kth & Iterator
Kth Larges [Link] BST Kth & Iterator Yes
Binary Sear[Link] BST Kth & Iterator
Serialize a [Link] + Subtree
Subtree of [Link] Serialize + Subtree
Count Good [Link] Serialize + Subtree
Range Min[Link] Trees
Segment Tr[Link] Trees
Implement[Link]
T Trie Yes
Design Add[Link] Trie
Word Sear[Link] Word Search Variants
Word Searc[Link] Word Search Variants
Binary Tr [Link] Advanced Trees Yes
Super Egg [Link] Advanced
Regular Ex [Link] Advanced
Burst Ballo[Link] Advanced
Climbing St[Link] Recurrence Basics
Minimum Co [Link] Recurrence Basics
Jump Gam[Link] Recurrence Basics Yes
Jump Game[Link] Recurrence Basics
Coin Chang[Link] Coin Change
Coin Change [Link] Coin Change
House Robb [Link] Robbery & Colors Yes
Paint Hous[Link] Robbery & Colors
Triangle [Link] Path + Decode
Decode Wa[Link] Path + Decode
Word Brea[Link] Path + Decode
Word Break[Link] Path + Decode
Longest In [Link] Subsequences
Maximum P[Link] Subsequences
Palindromi[Link] Subsequences
Longest Pa[Link] Subsequences
Unique Pat[Link] Grid Problems
Minimum P[Link] Grid Problems Yes
Target Sum[Link] Subset & Partition
Partition [Link] Subset & Partition
Palindrome[Link] Subset & Partition
Palindrome[Link] Subset & Partition
Longest C [Link] LCS & Edit
Edit Distan[Link] LCS & Edit
Ones and Z[Link] Knapsack
Rod Cuttin [Link]
Longest Inc[Link] Matrix/Graph Paths
Super Egg [Link] Advanced
Regular Ex [Link] Advanced
Burst Ballo[Link] Advanced
Find Media[Link] Streaming & Median
Sliding Wi [Link] Streaming & Median
LFU Cache [Link] Design & Greedy
LRU Cache[Link] Design & Greedy
IPO [Link] Design & Greedy
Smallest R [Link] Bonus Problems
Meeting Ro[Link] Bonus Problems
Minimum Co [Link] Bonus Problems
Depth-Firs [Link] Graphs Traversals Yes
Breadth-Fir[Link] Graphs Traversals
Detect Cyc[Link] Cycle (Undirected)
Detect Cycl[Link] Cycle (Directed)
Course Sch[Link] Cycle (Directed)
Topological[Link] Topological Sort
Course Sch[Link] Topological Sort
Course Sche [Link] Topological Sort Yes
Number of[Link] Islands + Components
Max Area o[Link] Islands + Components
Number of[Link] Islands + Components
Surrounded[Link] Advanced BFS/DFS
Pacific Atl [Link] Advanced BFS/DFS
Rotting Or [Link] Advanced BFS/DFS
Flood Fill [Link] & Flood Fill
Is Graph Bi[Link] Coloring & Flood Fill
Word Ladd[Link] Word Ladder
Word Ladde [Link] Word Ladder
Clone Grap[Link] Cloning + Alien Yes
Alien Dicti [Link] Cloning + Alien Yes
Dijkstra's [Link] Shortest Paths
Cheapest Fl[Link] Shortest Paths
Word Ladde [Link] Hard Practice
Alien Dicti [Link] Hard Practice
M-Coloring[Link] Hard Practice
Review all graph concRevision