DSA Doctor

DSA Doctor

Diagnose company-wise DSA prep with smart filters, roadmaps, and revision signals.

πŸ“‘ DSA Master Sheet

All 502 questions from all 9 phases, organized topic-wise with difficulty, links, status, revisit, and notes.

502Total Questions
9Phases
0Done
0To Revisit
0%Progress
502 of 502 questions
PHASE 1 : FUNDAMENTALS & LINEAR DATA STRUCTURES64 questions
#TopicSubtopicProblem NameLinkDifficultyStatusRevisitNotes
1ArraysArray BasicsFind Element at a Given Indexβ˜…β˜…β˜…β˜…β˜…
2Min and Max in Arrayβ˜…β˜†β˜†β˜†β˜†
3Sum of Arrayβ˜…β˜†β˜†β˜†β˜†
4Sum of Digitsβ˜…β˜†β˜†β˜†β˜†
5Check If Array is Sortedβ˜…β˜†β˜†β˜†β˜†
6Alternates In Arrayβ˜…β˜†β˜†β˜†β˜†
7Core ManipulationsRemove Duplicates from Arrayβ˜…β˜…β˜†β˜†β˜†
8Second Largest in Arrayβ˜…β˜…β˜†β˜†β˜†
9Reverse an Arrayβ˜…β˜…β˜†β˜†β˜†
10Missing Numberβ˜…β˜…β˜†β˜†β˜†
11Segregate 0s and 1sβ˜…β˜…β˜…β˜…β˜…
12Maximum Consecutive Onesβ˜…β˜…β˜†β˜†β˜†
13Palindromic Arrayβ˜…β˜…β˜†β˜†β˜†
14Move Zeroes to Endβ˜…β˜…β˜†β˜†β˜†
15Sort array with 0's 1's and 2's (Dutch Flag)β˜…β˜…β˜†β˜†β˜†
16Intermediate ProblemsEquilibrium Pointβ˜…β˜…β˜…β˜†β˜†
17Reverse Integerβ˜…β˜…β˜…β˜†β˜†
18Leaders in Arrayβ˜…β˜…β˜…β˜†β˜†
19Increasing Arrayβ˜…β˜…β˜…β˜†β˜†
20Rearrange Array Elements by Signβ˜…β˜…β˜…β˜†β˜†
21Rotate Array by Oneβ˜…β˜…β˜…β˜†β˜†
22Majority Element I (Boyer - Moore)β˜…β˜…β˜…β˜†β˜†
23Advanced ProblemsRotate Array by K stepsβ˜…β˜…β˜…β˜…β˜†
24Wiggle Sort IIβ˜…β˜…β˜…β˜…β˜†
25Majority Element IIβ˜…β˜…β˜…β˜…β˜†
26Best Time to Buy and Sell Stockβ˜…β˜…β˜…β˜…β˜†
27Next Permutationβ˜…β˜…β˜…β˜…β˜†
28Maximum Value Of Expressionβ˜…β˜…β˜…β˜…β˜†
29First Missing Positiveβ˜…β˜…β˜…β˜…β˜…
✓ Arrays completed — 29 questions
302D ArraysMatrix BasicsSum of elements in a matrixβ˜…β˜…β˜†β˜†β˜†
31Count Number Of Zeroesβ˜…β˜…β˜†β˜†β˜†
32Count Negative Numbers in a matrixβ˜…β˜…β˜†β˜†β˜†
33Matrix Diagonal Sumβ˜…β˜…β˜†β˜†β˜†
34Matrix OperationsAddition of Two Square Matrixβ˜…β˜…β˜…β˜†β˜†
35Multiply Matricesβ˜…β˜…β˜…β˜†β˜†
36Transpose Matrixβ˜…β˜…β˜…β˜†β˜†
37Advanced MatrixSpiral Matrixβ˜…β˜…β˜…β˜…β˜†
38ZigZag Matrixβ˜…β˜…β˜…β˜…β˜†
39Rotate Matrix (90Β°)β˜…β˜…β˜…β˜…β˜†
40Determine Whether matrix can be obtained by rotationβ˜…β˜…β˜…β˜…β˜†
41Set Matrix Zeroesβ˜…β˜…β˜…β˜…β˜…
✓ 2D Arrays completed — 12 questions
42Basic MathsNumber Theory BasicsCheck if a number is Armstrongβ˜…β˜†β˜†β˜†β˜†
43Print all Divisors of a Numberβ˜…β˜†β˜†β˜†β˜†
44Check if a number is Primeβ˜…β˜†β˜†β˜†β˜†
45GCD / HCF of 2 numbersβ˜…β˜†β˜†β˜†β˜†
46Prime Factorisation of a Numberβ˜…β˜…β˜†β˜†β˜†
47Count Primes in range L to Rβ˜…β˜…β˜…β˜†β˜†
✓ Basic Maths completed — 6 questions
48StringsString FundamentalsMaximum Occuring Characterβ˜…β˜†β˜†β˜†β˜†
49Remove Spacesβ˜…β˜†β˜†β˜†β˜†
50Print first letter of every word in the stringβ˜…β˜…β˜†β˜†β˜†
51Remove Consecutive Charactersβ˜…β˜…β˜†β˜†β˜†
52Valid Palindromeβ˜…β˜…β˜†β˜†β˜†
53Valid Anagramβ˜…β˜…β˜†β˜†β˜†
54Isomorphic Stringsβ˜…β˜…β˜†β˜†β˜†
55String ManipulationDelete Characters To Make Fancy Stringβ˜…β˜…β˜…β˜†β˜†
56Reverse Words in a Stringβ˜…β˜…β˜…β˜†β˜†
57String to integer (atoi)β˜…β˜…β˜…β˜†β˜†
58Roman to integerβ˜…β˜…β˜…β˜†β˜†
59Rotate Stringβ˜…β˜…β˜…β˜†β˜†
60Longest common prefixβ˜…β˜…β˜…β˜†β˜†
61Advanced ProblemsLongest palindromic substringβ˜…β˜…β˜…β˜…β˜†
62Multiply Two Stringsβ˜…β˜…β˜…β˜…β˜†
63Maximum Nesting Depth of the Parenthesesβ˜…β˜…β˜…β˜…β˜†
64Beauty Of All substringsβ˜…β˜…β˜…β˜…β˜†
✓ Strings completed — 17 questions
PHASE 2 : SEARCHING ALGORITHM37 questions
#TopicSubtopicProblem NameLinkDifficultyStatusRevisitNotes
65Binary SearchBS on 1D Array BasicsSearch X in sorted arrayβ˜…β˜…β˜†β˜†β˜†
66Lower Boundβ˜…β˜…β˜†β˜†β˜†
67Upper Boundβ˜…β˜…β˜†β˜†β˜†
68Search insert positionβ˜…β˜…β˜†β˜†β˜†
69Floor In Sorted Arrayβ˜…β˜…β˜†β˜†β˜†
70Ceil In Sorted Arrayβ˜…β˜…β˜†β˜†β˜†
71Guess Number Higher or Lower APIβ˜…β˜…β˜†β˜†β˜†
72First 1 in a Sorted Binary Arrayβ˜…β˜…β˜†β˜†β˜†
73Kth Missing Positive Numberβ˜…β˜…β˜†β˜†β˜†
74Find minimum in Rotated Sorted Arrayβ˜…β˜…β˜†β˜†β˜†
75BS on 1D Array IntermediateFirst and last occurrenceβ˜…β˜…β˜…β˜†β˜†
76Search in rotated sorted array-Iβ˜…β˜…β˜…β˜†β˜†
77Search in rotated sorted array-IIβ˜…β˜…β˜…β˜†β˜†
78Single element in a Sorted Arrayβ˜…β˜…β˜…β˜†β˜†
79Find kth Rotationβ˜…β˜…β˜…β˜†β˜†
80Find Peak Elementβ˜…β˜…β˜…β˜†β˜†
81BS on 2D ArraysCount Negative Numbers in a Sorted Matrixβ˜…β˜…β˜†β˜†β˜†
82Find row with maximum 1'sβ˜…β˜…β˜†β˜†β˜†
83Search a 2D Matrix Iβ˜…β˜…β˜†β˜†β˜†
84Search a 2D Matrix IIβ˜…β˜…β˜…β˜†β˜†
85Find Peak Element - IIβ˜…β˜…β˜…β˜…β˜†
86Median in a row-wise sorted Matrixβ˜…β˜…β˜…β˜…β˜†
87BS on AnswerSqrt (x)β˜…β˜…β˜†β˜†β˜†
88Valid Perfect Squareβ˜…β˜…β˜†β˜†β˜†
89Find Nth root of a numberβ˜…β˜…β˜…β˜†β˜†
90Koko eating bananasβ˜…β˜…β˜…β˜†β˜†
91Find the Smallest Divisor Given a Thresholdβ˜…β˜…β˜…β˜†β˜†
92Minimum Speed to Arrive on Timeβ˜…β˜…β˜…β˜†β˜†
93Minimum days to make M bouquetsβ˜…β˜…β˜…β˜†β˜†
94Capacity to Ship Packages Within D Daysβ˜…β˜…β˜…β˜†β˜†
95Book Allocation Problemβ˜…β˜…β˜…β˜†β˜†
96Split Array Largest Sumβ˜…β˜…β˜…β˜…β˜†
97Painter's Partition Problemβ˜…β˜…β˜…β˜…β˜†
98K-th element of two sorted Arraysβ˜…β˜…β˜…β˜…β˜†
99Aggressive Cowsβ˜…β˜…β˜…β˜…β˜…
100Minimize Max Distance to Gas Stationβ˜…β˜…β˜…β˜…β˜…
101Median of Two Sorted Arraysβ˜…β˜…β˜…β˜…β˜…
✓ Binary Search completed — 37 questions
PHASE 3 : ALGORITHMIC THINKING19 questions
#TopicSubtopicProblem NameLinkDifficultyStatusRevisitNotes
102RecursionIntroduction to RecursionPrint 1 to N without using loopsβ˜…β˜†β˜†β˜†β˜†
103Print N to 1 without loopβ˜…β˜†β˜†β˜†β˜†
104Sum of first N numbersβ˜…β˜†β˜†β˜†β˜†
105Factorial of a given numberβ˜…β˜†β˜†β˜†β˜†
106Fibonacci Numberβ˜…β˜†β˜†β˜†β˜†
107Recursion on Arrays & MathReverse an arrayβ˜…β˜…β˜†β˜†β˜†
108Pow(x, n)β˜…β˜…β˜†β˜†β˜†
109Count Good Numbersβ˜…β˜…β˜†β˜†β˜†
110Recursive Implementation of atoi()β˜…β˜…β˜…β˜†β˜†
111Recursion On stringsGenerate Binary Strings Without Consecutive 1sβ˜…β˜…β˜…β˜†β˜†
✓ Recursion completed — 10 questions
112SortingSorting FundamentalsLinear Searchβ˜…β˜†β˜†β˜†β˜†
113Sort An Array (Implement Merge / Quick Sort)β˜…β˜…β˜†β˜†β˜†
114Sort Array By Parityβ˜…β˜…β˜†β˜†β˜†
115Maximum Gapβ˜…β˜…β˜…β˜†β˜†
116Custom Comparator SortingSort Elements by Decreasing Frequencyβ˜…β˜…β˜…β˜†β˜†
117Reorder Data In Log Filesβ˜…β˜…β˜…β˜…β˜†
118Advanced SortingMerge Intervalsβ˜…β˜…β˜…β˜†β˜†
119Count Inversions (Merge Sort)β˜…β˜…β˜…β˜…β˜…
120Reverse Pairs (Merge Sort)β˜…β˜…β˜…β˜…β˜…
✓ Sorting completed — 9 questions
PHASE 4 : OBJECT ORIENTED CONCEPTS6 questions
#TopicSubtopicProblem NameLinkDifficultyStatusRevisitNotes
121OOPSOOPS FundamentalsClasses, Objects & Constructorsβ˜…β˜†β˜†β˜†β˜†
122Inheritance & Polymorphismβ˜…β˜…β˜†β˜†β˜†
123Encapsulation & Abstractionβ˜…β˜…β˜†β˜†β˜†
124Interfaces & Abstract Classesβ˜…β˜…β˜…β˜†β˜†
125Design PatternsSingleton Patternβ˜…β˜…β˜…β˜†β˜†
126Factory Patternβ˜…β˜…β˜…β˜…β˜†
✓ OOPS completed — 6 questions
PHASE 5 : ADVANCED LINEAR DATA STRUCTURES81 questions
#TopicSubtopicProblem NameLinkDifficultyStatusRevisitNotes
127LinkedlistFoundationArray to Linked Listβ˜…β˜†β˜†β˜†β˜†
128Count Nodes / Find Length of Linked Listβ˜…β˜†β˜†β˜†β˜†
129Search in a Linked Listβ˜…β˜†β˜†β˜†β˜†
130Insertion and DeletionInsert Node at Head / Tailβ˜…β˜…β˜†β˜†β˜†
131Insert in Middle of Linked Listβ˜…β˜…β˜†β˜†β˜†
132Remove Linked List Elements (By Value)β˜…β˜…β˜†β˜†β˜†
133Remove Duplicates from Sorted Listβ˜…β˜…β˜†β˜†β˜†
134Delete Node in a Linked List (Given only node ref)β˜…β˜…β˜…β˜†β˜†
135Remove Duplicates from Unsorted Listβ˜…β˜…β˜…β˜†β˜†
136Delete the Middle Node of a Linked Listβ˜…β˜…β˜…β˜†β˜†
137Fast and Slow PointerMiddle of the Linked Listβ˜…β˜…β˜†β˜†β˜†
138Linked List Cycleβ˜…β˜…β˜†β˜†β˜†
139Intersection of Two Linked Listsβ˜…β˜…β˜†β˜†β˜†
140Length of Loop in Linked Listβ˜…β˜…β˜…β˜†β˜†
141Linked List Cycle II (Find Starting Point)β˜…β˜…β˜…β˜†β˜†
142Remove Loop in Linked Listβ˜…β˜…β˜…β˜†β˜†
143Remove Nth Node From End of Listβ˜…β˜…β˜…β˜†β˜†
144Reversals and RotationsReverse a Linked List (Iterative & Recursive)β˜…β˜…β˜†β˜†β˜†
145Palindrome Linked Listβ˜…β˜…β˜†β˜†β˜†
146Swap Nodes in Pairsβ˜…β˜…β˜…β˜†β˜†
147Odd Even Linked List (By Index)β˜…β˜…β˜…β˜†β˜†
148Reorder Listβ˜…β˜…β˜…β˜…β˜†
149Rotate Listβ˜…β˜…β˜…β˜…β˜†
150Math in Linked ListAdd One to a Number Represented by LLβ˜…β˜…β˜…β˜†β˜†
151Add Two Numbers (Reverse Order)β˜…β˜…β˜…β˜†β˜†
152Add Two Numbers II (Forward Order)β˜…β˜…β˜…β˜…β˜†
153Sorting, Merging & SegregatingMerge Two Sorted Listsβ˜…β˜…β˜†β˜†β˜†
154Sort a Linked List of 0s, 1s, and 2sβ˜…β˜…β˜…β˜†β˜†
155Segregate Even and Odd Nodes (By Value)β˜…β˜…β˜…β˜†β˜†
156Partition Listβ˜…β˜…β˜…β˜…β˜†
157Insertion Sort Listβ˜…β˜…β˜…β˜…β˜†
158Sort List (Merge Sort on LL)β˜…β˜…β˜…β˜…β˜…
159Doubly Linked Lists (DLL)Array to Doubly Linked Listβ˜…β˜†β˜†β˜†β˜†
160Insert/Delete in a Doubly Linked Listβ˜…β˜…β˜†β˜†β˜†
161Reverse a Doubly Linked Listβ˜…β˜…β˜†β˜†β˜†
162Remove Duplicates from Sorted DLLβ˜…β˜…β˜†β˜†β˜†
163Insert in Sorted way in a Sorted DLLβ˜…β˜…β˜…β˜†β˜†
164Delete all occurrences of a key in DLLβ˜…β˜…β˜…β˜†β˜†
165Find Pairs with Given Sum in a DLLβ˜…β˜…β˜…β˜†β˜†
166Advanced ProblemsCopy List with Random Pointer (Clone LL)β˜…β˜…β˜…β˜…β˜†
167Flattening a Linked Listβ˜…β˜…β˜…β˜…β˜†
168Reverse Linked List in Groups of Size Kβ˜…β˜…β˜…β˜…β˜…
169Reverse Alternate K Nodesβ˜…β˜…β˜…β˜…β˜…
✓ Linkedlist completed — 43 questions
170StacksCore ImplementationImplement Stack using Arraysβ˜…β˜†β˜†β˜†β˜†
171Implement Stack using Linked Listβ˜…β˜†β˜†β˜†β˜†
172Parentheses & String ParsingValid Parenthesesβ˜…β˜…β˜†β˜†β˜†
173Remove Outermost Parenthesesβ˜…β˜…β˜†β˜†β˜†
174Remove All Adjacent Duplicates In Stringβ˜…β˜…β˜†β˜†β˜†
175Minimum Add to Make Parentheses Validβ˜…β˜…β˜†β˜†β˜†
176Minimum Remove to Make Valid Parenthesesβ˜…β˜…β˜…β˜†β˜†
177Evaluate Reverse Polish Notationβ˜…β˜…β˜…β˜†β˜†
178Recursion Based Stack ProblemsSort a Stack Using Recursionβ˜…β˜…β˜…β˜†β˜†
179Reverse a Stack (Using Recursion)β˜…β˜…β˜…β˜†β˜†
180Expression ConversionsInfix to Postfix Conversionβ˜…β˜…β˜†β˜†β˜†
181Prefix to Infix Conversionβ˜…β˜…β˜†β˜†β˜†
182Postfix to Prefix Conversionβ˜…β˜…β˜†β˜†β˜†
183Infix to Prefix Conversionβ˜…β˜…β˜…β˜†β˜†
184The Monotonic Stack PatternNext Greater Element Iβ˜…β˜…β˜†β˜†β˜†
185Next Smaller Element / Help Classmatesβ˜…β˜…β˜…β˜†β˜†
186Next Greater Element II (Circular Array)β˜…β˜…β˜…β˜†β˜†
187Stock Span Problemβ˜…β˜…β˜…β˜†β˜†
188Number of Greater Elements to the Rightβ˜…β˜…β˜…β˜†β˜†
189Asteroid Collisionβ˜…β˜…β˜…β˜†β˜†
190Remove K Digitsβ˜…β˜…β˜…β˜…β˜†
191Remove Duplicate Lettersβ˜…β˜…β˜…β˜…β˜†
192Advanced Monotonic Stack & ApplicationsLargest Rectangle in Histogramβ˜…β˜…β˜…β˜…β˜†
193Sum of Subarray Minimumsβ˜…β˜…β˜…β˜…β˜†
194Sum of Subarray Rangesβ˜…β˜…β˜…β˜…β˜†
195Maximal Rectangle (2D Grid)β˜…β˜…β˜…β˜…β˜…
196Classic Design ProblemsMin Stack (Design a stack with O(1) getMin)β˜…β˜…β˜…β˜†β˜†
197The Celebrity Problem (Elimination via Stack)β˜…β˜…β˜…β˜†β˜†
✓ Stacks completed — 28 questions
198QueuesQueue ImplementationImplement Queue using Arraysβ˜…β˜†β˜†β˜†β˜†
199Implement Queue using Linked Listβ˜…β˜†β˜†β˜†β˜†
200Implement Queue using Stacksβ˜…β˜…β˜†β˜†β˜†
201Implement Stack using Queuesβ˜…β˜…β˜†β˜†β˜†
202Reverse First K elements of Queueβ˜…β˜…β˜†β˜†β˜†
203Queue ApplicationsNumber of Students Unable to Eat Lunchβ˜…β˜…β˜†β˜†β˜†
204First non-repeating character in a streamβ˜…β˜…β˜…β˜†β˜†
205Deque & Sliding Window MaxSliding Window Maximumβ˜…β˜…β˜…β˜…β˜†
206Longest Continuous Subarray With Abs Diff ≀ Limitβ˜…β˜…β˜…β˜…β˜†
207Constrained Subsequence Sumβ˜…β˜…β˜…β˜…β˜…
✓ Queues completed — 10 questions
PHASE 6 - HIERARCHIAL DATA STRUCTURES57 questions
#TopicSubtopicProblem NameLinkDifficultyStatusRevisitNotes
208Binary TreesTraversals & Views (Fundamentals)Preorder Traversal (Recursive & Iterative)β˜…β˜…β˜…β˜†β˜†
209Inorder Traversal (Recursive & Iterative)β˜…β˜…β˜…β˜†β˜†
210Postorder Traversal (Recursive & Iterative)β˜…β˜…β˜…β˜†β˜†
211Binary Tree Level Order Traversalβ˜…β˜…β˜…β˜…β˜†
212Binary Tree Zigzag Level Order Traversalβ˜…β˜…β˜…β˜…β˜†
213Left / Right View of Binary Treeβ˜…β˜…β˜…β˜…β˜†
214Top / Bottom View of Binary Treeβ˜…β˜…β˜…β˜…β˜†
215Boundary Traversal of Binary Treeβ˜…β˜…β˜…β˜…β˜†
216Diagonal Traversal of Binary Treeβ˜…β˜…β˜…β˜…β˜†
217Vertical Order Traversal of a Binary Treeβ˜…β˜…β˜…β˜…β˜…
218Tree Properties & DimensionsMaximum Depth of Binary Treeβ˜…β˜…β˜…β˜†β˜†
219Same Treeβ˜…β˜…β˜…β˜†β˜†
220Invert Binary Treeβ˜…β˜…β˜…β˜†β˜†
221Symmetric Treeβ˜…β˜…β˜…β˜…β˜†
222Maximum Width of Binary Treeβ˜…β˜…β˜…β˜…β˜†
223Count Complete Tree Nodesβ˜…β˜…β˜…β˜…β˜†
224Diameter of Binary Treeβ˜…β˜…β˜…β˜…β˜…
225Balanced Binary Treeβ˜…β˜…β˜…β˜…β˜…
226Paths, Sums & LCAPath Sum Iβ˜…β˜…β˜…β˜†β˜†
227Path Sum IIβ˜…β˜…β˜…β˜…β˜†
228Sum Root to Leaf Numbersβ˜…β˜…β˜…β˜…β˜†
229Maximum Difference Between Node and Ancestorβ˜…β˜…β˜…β˜…β˜†
230Lowest Common Ancestor of a Binary Treeβ˜…β˜…β˜…β˜…β˜…
231Binary Tree Maximum Path Sumβ˜…β˜…β˜…β˜…β˜…
232Path Sum IIIβ˜…β˜…β˜…β˜…β˜…
233Graph-Like Traversals in TreesMinimum time taken to burn the BTβ˜…β˜…β˜…β˜…β˜†
234All Nodes Distance K in Binary Treeβ˜…β˜…β˜…β˜…β˜…
235Step-By-Step Directions From a Binary Tree Node to Anotherβ˜…β˜…β˜…β˜…β˜…
236Structural Modifications & ConstructionMerge Two Binary Treesβ˜…β˜…β˜…β˜†β˜†
237Children Sum Property in a Binary Treeβ˜…β˜…β˜…β˜†β˜†
238Construct Binary Tree from Preorder and Inorder Traversalβ˜…β˜…β˜…β˜…β˜…
239Construct Binary Tree from Inorder and Postorder Traversalβ˜…β˜…β˜…β˜…β˜†
240Flatten Binary Tree to Linked Listβ˜…β˜…β˜…β˜…β˜†
241Serialize and Deserialize Binary Treeβ˜…β˜…β˜…β˜…β˜…
✓ Binary Trees completed — 34 questions
242Binary Search TreesCore Properties & SearchSearch in a Binary Search Treeβ˜…β˜…β˜†β˜†β˜†
243Find Minimum/Maximum in BSTβ˜…β˜…β˜†β˜†β˜†
244Insert into a Binary Search Treeβ˜…β˜…β˜…β˜†β˜†
245Floor and Ceil in a BSTβ˜…β˜…β˜…β˜†β˜†
246Inorder Successor in BSTβ˜…β˜…β˜…β˜…β˜†
247Lowest Common Ancestor of a Binary Search Treeβ˜…β˜…β˜…β˜…β˜†
248Validate Binary Search Treeβ˜…β˜…β˜…β˜…β˜…
249Kth Smallest Element in a BSTβ˜…β˜…β˜…β˜…β˜…
250Standard Modifications & DeletionsDelete Node in a BSTβ˜…β˜…β˜…β˜…β˜†
251Two Sum IV - Input is a BSTβ˜…β˜…β˜…β˜…β˜…
252Construction & Advanced OperationsConvert Sorted Array to Binary Search Treeβ˜…β˜…β˜…β˜†β˜†
253Construct BST from Preorder Traversalβ˜…β˜…β˜…β˜…β˜†
254Balance a Binary Search Treeβ˜…β˜…β˜…β˜…β˜†
255Merge Two Balanced Binary Search Treesβ˜…β˜…β˜…β˜…β˜†
256Recover Binary Search Treeβ˜…β˜…β˜…β˜…β˜…
257Largest BST in a Binary Treeβ˜…β˜…β˜…β˜…β˜…
✓ Binary Search Trees completed — 16 questions
258TriesImplementation & String SearchImplement Trie (Prefix Tree)β˜…β˜…β˜…β˜…β˜†
259Design Add and Search Words Data Structureβ˜…β˜…β˜…β˜…β˜†
260Longest Word with All Prefixesβ˜…β˜…β˜…β˜…β˜†
261Number of Distinct Substrings in a Stringβ˜…β˜…β˜…β˜…β˜†
262Word Search IIβ˜…β˜…β˜…β˜…β˜…
263Bitwise Tries (Advanced)Maximum XOR of Two Numbers in an Arrayβ˜…β˜…β˜…β˜…β˜…
264Maximum XOR With an Element From Arrayβ˜…β˜…β˜…β˜…β˜…
✓ Tries completed — 7 questions
PHASE 7 : CORE DATA STRUCTURES AND TECHNIQUES84 questions
#TopicSubtopicProblem NameLinkDifficultyStatusRevisitNotes
265HashmapsHashmap FundamentalsContains Duplicateβ˜…β˜†β˜†β˜†β˜†
266Valid Anagram (Hashmap Approach)β˜…β˜†β˜†β˜†β˜†
267Unique Number of Occurrencesβ˜…β˜†β˜†β˜†β˜†
268Find distinct elements / Find the Frequencyβ˜…β˜†β˜†β˜†β˜†
269Two Sumβ˜…β˜…β˜†β˜†β˜†
270Intersection of Two Arraysβ˜…β˜…β˜†β˜†β˜†
271Count Number of Pairs With Absolute Difference Kβ˜…β˜…β˜†β˜†β˜†
272Design HashMapβ˜…β˜…β˜…β˜†β˜†
273Intermediate Hashmap ProblemsGroup Anagramsβ˜…β˜…β˜…β˜†β˜†
274Longest Consecutive Sequenceβ˜…β˜…β˜…β˜†β˜†
275Subarray Sum Equals Kβ˜…β˜…β˜…β˜†β˜†
276Contiguous Array / Largest subarray with 0 sumβ˜…β˜…β˜…β˜†β˜†
277Count subarrays with given XORβ˜…β˜…β˜…β˜†β˜†
278Subarray Sums Divisible by Kβ˜…β˜…β˜…β˜†β˜†
279Continuous Subarray Sumβ˜…β˜…β˜…β˜†β˜†
280Advanced / Multi ConceptMaximum Size Subarray Sum Equals kβ˜…β˜…β˜…β˜†β˜†
281Top K Frequent Elementsβ˜…β˜…β˜…β˜†β˜†
282LRU Cache (Least Recently Used)β˜…β˜…β˜…β˜…β˜†
283LFU Cache (Least Frequently Used)β˜…β˜…β˜…β˜…β˜…
✓ Hashmaps completed — 19 questions
284Heaps / Priority QueuesHeap FundamentalsCheck if an array represents a min heapβ˜…β˜…β˜†β˜†β˜†
285Convert Min Heap to Max Heapβ˜…β˜…β˜†β˜†β˜†
286Implement Min/Max Heapβ˜…β˜…β˜…β˜†β˜†
287The Top-K PatternLast Stone Weightβ˜…β˜…β˜…β˜†β˜†
288Kth Largest Element in an Arrayβ˜…β˜…β˜…β˜…β˜†
289K Closest Points to Originβ˜…β˜…β˜…β˜…β˜†
290Sort a K Sorted Array / Nearly Sorted Algorithmβ˜…β˜…β˜…β˜…β˜†
291Top K Frequent Elements (Heap Approach)β˜…β˜…β˜…β˜…β˜†
292Merging & CombinationsMinimum Cost of Ropesβ˜…β˜…β˜…β˜…β˜†
293Merge K Sorted Listsβ˜…β˜…β˜…β˜…β˜…
294Kth Smallest Element in a Sorted Matrixβ˜…β˜…β˜…β˜…β˜†
295Advanced / Two-Heaps / SchedulingTask Schedulerβ˜…β˜…β˜…β˜…β˜…
296Reorganize Stringβ˜…β˜…β˜…β˜…β˜…
297Minimum Number of Refueling Stopsβ˜…β˜…β˜…β˜…β˜…
298Find Median from Data Streamβ˜…β˜…β˜…β˜…β˜…
✓ Heaps / Priority Queues completed — 15 questions
299Prefix Sum1d Prefix SumRunning Sum of 1D Arrayβ˜…β˜†β˜†β˜†β˜†
300Find the Highest Altitudeβ˜…β˜…β˜†β˜†β˜†
301Find Pivot Indexβ˜…β˜…β˜†β˜†β˜†
302Range Sum Query - Immutableβ˜…β˜…β˜†β˜†β˜†
303Product of Array Except Selfβ˜…β˜…β˜…β˜†β˜†
304Corporate Flight Bookingsβ˜…β˜…β˜…β˜…β˜†
305Trapping Rain Water (Prefix Max / Min)β˜…β˜…β˜…β˜…β˜†
3062d Prefix SumRange Sum Query 2D - Immutableβ˜…β˜…β˜…β˜†β˜†
307Matrix Block Sumβ˜…β˜…β˜…β˜†β˜†
308Maximum Sum of a 2D Subgrid of size K x Kβ˜…β˜…β˜…β˜…β˜†
✓ Prefix Sum completed — 10 questions
309Two Pointers & Sliding WindowTwo Pointers BasicsMove Zeroes (Two Pointer Intution)β˜…β˜†β˜†β˜†β˜†
310Valid Palindrome (Two Pointers)β˜…β˜†β˜†β˜†β˜†
311Two Sum II - Input Array Is Sortedβ˜…β˜…β˜†β˜†β˜†
312Sort Colors (Dutch National Flag)β˜…β˜…β˜†β˜†β˜†
313Container With Most Waterβ˜…β˜…β˜…β˜†β˜†
3143Sumβ˜…β˜…β˜…β˜†β˜†
315Fixed Size Slding WindowMaximum Average Subarray Iβ˜…β˜…β˜†β˜†β˜†
316Max Sum Subarray of size Kβ˜…β˜…β˜†β˜†β˜†
317Number of Sub-arrays of Size K and Average Greater than or Equal to Thresholdβ˜…β˜…β˜†β˜†β˜†
318Minimum Consecutive Cards to Pick Upβ˜…β˜…β˜†β˜†β˜†
319Maximum Points You Can Obtain from Cardsβ˜…β˜…β˜…β˜†β˜†
320Variable Size Sliding WindowFind All Anagrams in a Stringβ˜…β˜…β˜…β˜†β˜†
321Permutation in Stringβ˜…β˜…β˜…β˜†β˜†
322Minimum Size Subarray Sumβ˜…β˜…β˜…β˜†β˜†
323Longest Substring Without Repeating Charactersβ˜…β˜…β˜…β˜†β˜†
324Longest Repeating Character Replacementβ˜…β˜…β˜…β˜†β˜†
325Max Consecutive Ones IIIβ˜…β˜…β˜…β˜†β˜†
326Fruit Into Basketsβ˜…β˜…β˜…β˜†β˜†
327Maximum Erasure Valueβ˜…β˜…β˜…β˜†β˜†
328Number of Substrings Containing All Three Charactersβ˜…β˜…β˜…β˜†β˜†
329Advanced Sliding Window / Counting / Atmost KBinary Subarrays With Sumβ˜…β˜…β˜…β˜†β˜†
330Count Number of Nice Subarraysβ˜…β˜…β˜…β˜†β˜†
331Subarrays with K Different Integersβ˜…β˜…β˜…β˜…β˜†
332Minimum Window Subsequenceβ˜…β˜…β˜…β˜…β˜†
333Minimum Window Substringβ˜…β˜…β˜…β˜…β˜…
✓ Two Pointers & Sliding Window completed — 25 questions
334Bit ManipulationBit Basics & PropertiesK-th Bit is Set or Notβ˜…β˜†β˜†β˜†β˜†
335Check if a Number is Odd or Notβ˜…β˜†β˜†β˜†β˜†
336Check If Number Power of 2 or Notβ˜…β˜…β˜†β˜†β˜†
337Number Of Even and Odd Bitsβ˜…β˜…β˜†β˜†β˜†
338Minimum Bit Flips To Convert Numberβ˜…β˜…β˜…β˜†β˜†
339XOR TricksSwap Two Numbers (XOR Trick)β˜…β˜…β˜†β˜†β˜†
340Single Number Iβ˜…β˜…β˜†β˜†β˜†
341Is Binary Number Multiple of 3β˜…β˜…β˜†β˜†β˜†
342Find the repeating and missing numberβ˜…β˜…β˜…β˜†β˜†
343Single Number IIβ˜…β˜…β˜…β˜…β˜†
344Single Number IIIβ˜…β˜…β˜…β˜…β˜…
345Bit Counting & AdvancedCount Set Bits From 1 to Nβ˜…β˜…β˜…β˜…β˜†
346Bleak Numbersβ˜…β˜…β˜…β˜…β˜†
347Minimum Xor Pairβ˜…β˜…β˜…β˜…β˜†
348Divide Two Integers (Bit Shifting)β˜…β˜…β˜…β˜…β˜†
✓ Bit Manipulation completed — 15 questions
PHASE 8 : STANDARD ALGORITHMS77 questions
#TopicSubtopicProblem NameLinkDifficultyStatusRevisitNotes
349GreedyBasics & Array ManipulationAssign Cookiesβ˜…β˜†β˜†β˜†β˜†
350Lemonade Changeβ˜…β˜…β˜†β˜†β˜†
351Maximize Sum of Array After K Negationsβ˜…β˜…β˜†β˜†β˜†
352Shortest Job Firstβ˜…β˜…β˜†β˜†β˜†
353Activity Selection / N Meetings in One Roomβ˜…β˜…β˜†β˜†β˜†
354Intervals & SchedulingMerge Intervals (Greedy View)β˜…β˜…β˜…β˜†β˜†
355Insert Intervalβ˜…β˜…β˜…β˜†β˜†
356Non-overlapping Intervalsβ˜…β˜…β˜…β˜†β˜†
357Minimum Number of Arrows to Burst Balloonsβ˜…β˜…β˜…β˜†β˜†
358Job Sequencing Problemβ˜…β˜…β˜…β˜†β˜†
359Minimum Platforms required for a railwayβ˜…β˜…β˜…β˜†β˜†
360Maximum Meetings in One Roomβ˜…β˜…β˜…β˜†β˜†
361Task Scheduler (Greedy Approach)β˜…β˜…β˜…β˜†β˜†
362Array & Jump GreedyJump Gameβ˜…β˜…β˜…β˜†β˜†
363Valid Parenthesis Stringβ˜…β˜…β˜…β˜†β˜†
364Gas Stationβ˜…β˜…β˜…β˜†β˜†
365Jump Game IIβ˜…β˜…β˜…β˜†β˜†
366Advanced GreedyMinimize the Heights IIβ˜…β˜…β˜…β˜…β˜†
367Candyβ˜…β˜…β˜…β˜…β˜†
368Huffman Decoding / Codingβ˜…β˜…β˜…β˜…β˜†
369Minimum Number of Taps to Open to Water a Gardenβ˜…β˜…β˜…β˜…β˜†
370Course Schedule IIIβ˜…β˜…β˜…β˜…β˜…
✓ Greedy completed — 22 questions
371GraphsGraphs Fundamentals & TraversalsBFS of Graphβ˜…β˜†β˜†β˜†β˜†
372DFS of Graphβ˜…β˜†β˜†β˜†β˜†
373Find if Path Exists in Graphβ˜…β˜…β˜†β˜†β˜†
374Number of Provincesβ˜…β˜…β˜†β˜†β˜†
375Clone Graphβ˜…β˜…β˜…β˜†β˜†
376Is Graph Bipartite?β˜…β˜…β˜…β˜†β˜†
377Matrix / Grid BFS ProblemsFlood Fillβ˜…β˜…β˜†β˜†β˜†
378Max Area of Islandβ˜…β˜…β˜†β˜†β˜†
379Number of Islandsβ˜…β˜…β˜…β˜†β˜†
380Rotting Orangesβ˜…β˜…β˜…β˜†β˜†
38101 Matrix / Distance of nearest cell having 1β˜…β˜…β˜…β˜†β˜†
382Surrounded Regionsβ˜…β˜…β˜…β˜†β˜†
383Number of Enclavesβ˜…β˜…β˜…β˜†β˜†
384Shortest Path in Binary Matrixβ˜…β˜…β˜…β˜†β˜†
385Swim in Rising Waterβ˜…β˜…β˜…β˜…β˜†
386Making A Large Islandβ˜…β˜…β˜…β˜…β˜†
387Cycle DetectionCycle Detection in Undirected Graphβ˜…β˜…β˜†β˜†β˜†
388Detect Cycle in a Directed Graphβ˜…β˜…β˜…β˜†β˜†
389Find Eventual Safe Statesβ˜…β˜…β˜…β˜†β˜†
390Topological Sorting (Kahn's Algorithm)Topological Sortβ˜…β˜…β˜†β˜†β˜†
391Course Scheduleβ˜…β˜…β˜…β˜†β˜†
392Course Schedule IIβ˜…β˜…β˜…β˜†β˜†
393Alien Dictionaryβ˜…β˜…β˜…β˜…β˜†
394Parallel Courses IIIβ˜…β˜…β˜…β˜…β˜†
395Shortest Path Algorithms (Dijkstra, Bellman-Ford, Floyd-Warshall)Shortest Path in Undirected Graph (Unit Weights)β˜…β˜…β˜†β˜†β˜†
396Shortest Path in DAGβ˜…β˜…β˜†β˜†β˜†
397Dijkstra's Algorithmβ˜…β˜…β˜…β˜†β˜†
398Network Delay Timeβ˜…β˜…β˜…β˜†β˜†
399Path With Minimum Effortβ˜…β˜…β˜…β˜†β˜†
400Cheapest Flights Within K Stopsβ˜…β˜…β˜…β˜†β˜†
401Path with Maximum Probabilityβ˜…β˜…β˜…β˜†β˜†
402Bellman-Ford Algorithmβ˜…β˜…β˜…β˜†β˜†
403Floyd Warshall Algorithmβ˜…β˜…β˜…β˜†β˜†
404Find the City With the Smallest Number of Neighborsβ˜…β˜…β˜…β˜†β˜†
405Minimum Multiplications to Reach Endβ˜…β˜…β˜…β˜†β˜†
406Number of Ways to Arrive at Destinationβ˜…β˜…β˜…β˜†β˜†
407Minimum Spanning Tree (MST)Minimum Spanning Treeβ˜…β˜…β˜†β˜†β˜†
408Prim's Algorithmβ˜…β˜…β˜…β˜†β˜†
409Min Cost to Connect All Points (Kruskal)β˜…β˜…β˜…β˜†β˜†
410Disjoint Set Union (DSU) / Union FindDisjoint Setβ˜…β˜…β˜†β˜†β˜†
411Number of Operations to Make Network Connectedβ˜…β˜…β˜…β˜†β˜†
412Accounts Mergeβ˜…β˜…β˜…β˜†β˜†
413Most Stones Removed with Same Row or Columnβ˜…β˜…β˜…β˜†β˜†
414Redundant Connectionβ˜…β˜…β˜…β˜†β˜†
415Evaluate Divisionβ˜…β˜…β˜…β˜…β˜†
416Number of Islands IIβ˜…β˜…β˜…β˜…β˜†
417Bridges, Articulation Points & Strongly Connected ComponentsKosaraju's Algorithmβ˜…β˜…β˜…β˜…β˜†
418Tarjan's Algorithm / Bridges in Graphβ˜…β˜…β˜…β˜…β˜†
419Articulation Point in Graphβ˜…β˜…β˜…β˜…β˜†
420Critical Connections in a Networkβ˜…β˜…β˜…β˜…β˜†
421Advanced Graphs ProblemsSnake and Ladder Problemβ˜…β˜…β˜…β˜†β˜†
422Word Ladderβ˜…β˜…β˜…β˜…β˜†
423Reorder Routes to Make All Paths Lead to the City Zeroβ˜…β˜…β˜…β˜…β˜†
424Word Ladder IIβ˜…β˜…β˜…β˜…β˜…
425Escape the Spreading Fireβ˜…β˜…β˜…β˜…β˜…
✓ Graphs completed — 55 questions
PHASE 9 : EXHAUSTIVE SEARCH & OPTIMISATION77 questions
#TopicSubtopicProblem NameLinkDifficultyStatusRevisitNotes
426BacktrackingSubsequence & Subset FundamentalsCheck if subsequence with sum K Existsβ˜…β˜…β˜†β˜†β˜†
427Count all subsequences with sum Kβ˜…β˜…β˜†β˜†β˜†
428Subsets / Power Setβ˜…β˜…β˜…β˜†β˜†
429Subsets II (With Duplicates)β˜…β˜…β˜…β˜†β˜†
430Subset Sumsβ˜…β˜…β˜…β˜†β˜†
431CombinationsCombination Sum Iβ˜…β˜…β˜…β˜†β˜†
432Combination Sum IIβ˜…β˜…β˜…β˜†β˜†
433Combination Sum IIIβ˜…β˜…β˜…β˜†β˜†
434N Digit numbers with digits in increasing orderβ˜…β˜…β˜…β˜†β˜†
435PermutationsPermutations II (With Duplicates)β˜…β˜…β˜…β˜†β˜†
436Letter Combinations of a Phone Numberβ˜…β˜…β˜…β˜†β˜†
437Generate Parenthesesβ˜…β˜…β˜…β˜†β˜†
438String BackTrackingPalindrome Partitioningβ˜…β˜…β˜…β˜…β˜†
439Word Breakβ˜…β˜…β˜…β˜…β˜†
440Remove Invalid Parenthesesβ˜…β˜…β˜…β˜…β˜…
441Expression Add Operatorsβ˜…β˜…β˜…β˜…β˜…
442Grid & Maze BacktrackingRat in a Mazeβ˜…β˜…β˜…β˜…β˜†
443Word Searchβ˜…β˜…β˜…β˜…β˜†
444M-Coloring Problemβ˜…β˜…β˜…β˜…β˜†
445N-Queensβ˜…β˜…β˜…β˜…β˜…
446N-Queens IIβ˜…β˜…β˜…β˜…β˜…
447Sudoku Solverβ˜…β˜…β˜…β˜…β˜…
✓ Backtracking completed — 22 questions
448Dynamic Programming1D DP (Intro to State & Transitions)Fibonacci Numberβ˜…β˜†β˜†β˜†β˜†
449Climbing Stairsβ˜…β˜†β˜†β˜†β˜†
450Min Cost Climbing Stairsβ˜…β˜…β˜†β˜†β˜†
451Frog Jumpβ˜…β˜…β˜†β˜†β˜†
452Frog Jump with K Distancesβ˜…β˜…β˜†β˜†β˜†
453House Robberβ˜…β˜…β˜†β˜†β˜†
454House Robber IIβ˜…β˜…β˜…β˜†β˜†
455Decode Waysβ˜…β˜…β˜…β˜†β˜†
4562D Grids & PathsUnique Pathsβ˜…β˜…β˜†β˜†β˜†
457Unique Paths IIβ˜…β˜…β˜…β˜†β˜†
458Minimum Path Sumβ˜…β˜…β˜…β˜†β˜†
459Triangleβ˜…β˜…β˜…β˜†β˜†
460Minimum Falling Path Sumβ˜…β˜…β˜…β˜†β˜†
461Dungeon Gameβ˜…β˜…β˜…β˜…β˜†
462Cherry Pickup II / Ninja and his Friendsβ˜…β˜…β˜…β˜…β˜†
4630/1 Knapsack & SubsetsSubset Sum Problemβ˜…β˜…β˜†β˜†β˜†
464Partition Equal Subset Sumβ˜…β˜…β˜…β˜†β˜†
465Count Subsets with Sum Kβ˜…β˜…β˜…β˜†β˜†
466Target Sumβ˜…β˜…β˜…β˜†β˜†
467Count Partitions with Given Differenceβ˜…β˜…β˜…β˜†β˜†
4680/1 Knapsack Problemβ˜…β˜…β˜…β˜†β˜†
469Partition Array Into Two Arrays to Minimize Sum Differenceβ˜…β˜…β˜…β˜…β˜†
470Last Stone Weight IIβ˜…β˜…β˜…β˜…β˜†
471Unbounded KnapsackRod Cutting Problemβ˜…β˜…β˜…β˜†β˜†
472Coin Changeβ˜…β˜…β˜…β˜†β˜†
473Coin Change IIβ˜…β˜…β˜…β˜†β˜†
474Perfect Squaresβ˜…β˜…β˜…β˜†β˜†
475DP on Strings (LCS & Edit Distance Patterns)Longest Common Subsequenceβ˜…β˜…β˜…β˜†β˜†
476Print Longest Common Subsequenceβ˜…β˜…β˜…β˜†β˜†
477Longest Common Substringβ˜…β˜…β˜…β˜†β˜†
478Longest Palindromic Subsequenceβ˜…β˜…β˜…β˜†β˜†
479Minimum Insertions to Make String Palindromeβ˜…β˜…β˜…β˜†β˜†
480Delete Operation for Two Stringsβ˜…β˜…β˜…β˜†β˜†
481Shortest Common Supersequenceβ˜…β˜…β˜…β˜…β˜†
482Distinct Subsequencesβ˜…β˜…β˜…β˜…β˜†
483Edit Distanceβ˜…β˜…β˜…β˜…β˜†
484Wildcard Matchingβ˜…β˜…β˜…β˜…β˜†
485Regular Expression Matchingβ˜…β˜…β˜…β˜…β˜…
486DP on StocksBest Time to Buy and Sell Stockβ˜…β˜†β˜†β˜†β˜†
487Best Time to Buy and Sell Stock IIβ˜…β˜…β˜†β˜†β˜†
488Best Time to Buy and Sell Stock with Cooldownβ˜…β˜…β˜†β˜†β˜†
489Best Time to Buy and Sell Stock with Transaction Feeβ˜…β˜…β˜…β˜†β˜†
490Best Time to Buy and Sell Stock IIIβ˜…β˜…β˜…β˜…β˜†
491Best Time to Buy and Sell Stock IVβ˜…β˜…β˜…β˜…β˜†
492Longest Increasing Subsequence (LIS)Longest Increasing Subsequenceβ˜…β˜…β˜…β˜†β˜†
493Print Longest Increasing Subsequenceβ˜…β˜…β˜…β˜†β˜†
494Largest Divisible Subsetβ˜…β˜…β˜…β˜†β˜†
495Longest String Chainβ˜…β˜…β˜…β˜†β˜†
496Longest Bitonic Subsequenceβ˜…β˜…β˜…β˜…β˜†
497Number of Longest Increasing Subsequencesβ˜…β˜…β˜…β˜…β˜†
498Russian Doll Envelopesβ˜…β˜…β˜…β˜…β˜…
499Partition DP & Matrix Chain Multiplication (MCM)Matrix Chain Multiplicationβ˜…β˜…β˜…β˜…β˜†
500Minimum Cost to Cut a Stickβ˜…β˜…β˜…β˜…β˜†
501Burst Balloonsβ˜…β˜…β˜…β˜…β˜…
502Palindrome Partitioning IIβ˜…β˜…β˜…β˜…β˜…
✓ Dynamic Programming completed — 55 questions