450 DSA Tracker & Striver A2Z Sheet — Striver 450, 190 & Babbar

🗺️ Roadmap

Account: Guest (Local)

Saved locally (0/1464 solved)

1464

Total

—

Easy

—

Medium

—

Hard

Done ✓

🧮

Step 1: Learn the Basics

Step 151 problems▼

#	Problem	Diff	Platform
1	User Input / Output cin, cout basics in C++	Easy	GFG
2	Data Types in C++ int, long, float, double, char, bool	Easy	GFG
3	If-Else Statements Conditional logic and branching	Easy	GFG
4	Switch Statement switch-case with break and default	Easy	GFG
5	Arrays & Strings Declaring, indexing, and traversing arrays	Easy	LC
6	For Loops Iteration and nested loops	Easy	LC
7	While Loops while and do-while loops	Easy	GFG
8	Functions (Pass by Ref & Value) Function declarations, call by value vs reference	Easy	GFG
9	Time & Space Complexity Big-O notation, best/worst case analysis	Easy	TUF
10	Pattern 1: Right-Angled Triangle Nested loops for star patterns	Easy	GFG
11	Pattern 2: Right-Angled Number Pyramid Print row number i, i times	Easy	GFG
12	Pattern 3: Right-Angled Number Pyramid II Print 1 to i in each row	Easy	GFG
13	Pattern 4: Inverted Right Pyramid Decreasing stars per row	Easy	GFG
14	Pattern 5: Inverted Number Pyramid Decreasing numbers per row	Easy	GFG
15	Pattern 6: Inverted Number Pyramid II Decreasing 1 to n per row	Easy	GFG
16	Pattern 7: Star Pyramid Spaces + stars for pyramid shape	Easy	GFG
17	Pattern 8: Inverted Star Pyramid Decreasing pyramid with spaces	Easy	GFG
18	Pattern 9: Diamond Star Pattern Pyramid + Inverted Pyramid	Easy	GFG
19	Pattern 10: Half Diamond Increasing then decreasing rows	Easy	GFG
20	Pattern 11: Binary Triangle Alternating 0s and 1s per row	Easy	GFG
21	Pattern 12: Number Crown Number increasing from both sides	Easy	GFG
22	Pattern 13: Increasing Number Triangle Continuously increasing numbers	Easy	GFG
23	Pattern 14: Increasing Letter Triangle Print A to the i-th letter per row	Easy	GFG
24	Pattern 15: Inverted Letter Triangle Decreasing letter rows	Easy	GFG
25	Pattern 16: Alpha Ramp Print same letter for all columns in a row	Easy	GFG
26	Pattern 17: Alpha Hill Mirrored letter pyramid	Easy	GFG
27	Pattern 18: Alpha Triangle Letters from Z going left per row	Easy	GFG
28	Pattern 19: Symmetric Void Stars with space in the middle	Easy	GFG
29	Pattern 20: Symmetric Butterfly Butterfly shape with mirrored halves	Easy	GFG
30	Pattern 21: Hollow Rectangle Stars only on the border of rectangle	Easy	GFG
31	Pattern 22: Full Star Diamond Full diamond shape of stars	Easy	GFG
32	C++ STL (Containers & Algorithms) vector, set, map, pair, sort, etc.	Easy	GFG
33	Count Digits Modulo % and division /	Easy	LC
34	Reverse a Number Overflow checking during reversal	Easy	LC
35	Check Palindrome Number Reversing half or full number	Easy	LC
36	GCD / HCF Euclidean Algorithm: gcd(a,b) = gcd(b, a%b)	Easy	LC
37	Armstrong Numbers Power and digit extraction	Easy	LC
38	Print all Divisors Iterate up to sqrt(n)	Easy	GFG
39	Check for Prime sqrt(n) time complexity	Easy	LC
40	Recursion — Print 1 to N Recursive call with base case n==0	Easy	GFG
41	Recursion — Print N to 1 Recursive call before printing	Easy	GFG
42	Recursion — Sum of First N Numbers f(n) = n + f(n-1)	Easy	GFG
43	Recursion — Factorial of N f(n) = n * f(n-1), base f(0)=1	Easy	GFG
44	Recursion — Reverse an Array Swap arr[l] and arr[r], recurse inward	Easy	LC
45	Recursion — Check String Palindrome Compare s[i] and s[n-1-i] recursively	Easy	LC
46	Fibonacci Number f(n) = f(n-1) + f(n-2), memoize	Easy	LC
47	Hashing Theory unordered_map / array hashing concept	Easy	TUF
48	Counting Frequencies of Array Elements C++ unordered_map or array hashing	Easy	LC
49	Find Highest/Lowest Frequency Element Track max/min frequency in hash map	Easy	LC
50	Longest Subarray with Sum K (Positives) Prefix sum hash map for positive and negative	Medium	LC
51	Longest Subarray with Sum 0 Prefix sum + hash map for zero-sum	Medium	GFG
1353	Excel Sheet Column Title Math & Geometry · NeetCode	Easy	LC
1354	Greatest Common Divisor of Strings Math & Geometry · NeetCode	Easy	LC
1355	Count Odd Numbers in an Interval Range Math & Geometry · NeetCode	Easy	LC
1356	Matrix Diagonal Sum Math & Geometry · NeetCode	Easy	LC
1357	Calculate Money in Leetcode Bank Math & Geometry · NeetCode	Easy	LC
1358	Transpose Matrix Math & Geometry · NeetCode	Easy	LC
1359	Image Smoother Math & Geometry · NeetCode	Easy	LC
1360	Count of Matches in Tournament Math & Geometry · NeetCode	Easy	LC
1361	Water Bottles Math & Geometry · NeetCode	Easy	LC
1362	Largest Local Values in a Matrix Math & Geometry · NeetCode	Easy	LC
1363	Power of Four Math & Geometry · NeetCode	Easy	LC
1364	Lucky Numbers in a Matrix Math & Geometry · NeetCode	Easy	LC
1365	Count Substrings with Only One Distinct Letter Math & Geometry · NeetCode	Easy	LC
1366	Guess the Majority in a Hidden Array Math & Geometry · NeetCode	Medium	LC
1367	Maximum Number of Ones Math & Geometry · NeetCode	Hard	LC
1368	Maximum Points on a Line Math & Geometry · NeetCode	Hard	LC
1369	Magic Squares In Grid Math & Geometry · NeetCode	Medium	LC
1370	Spiral Matrix II Math & Geometry · NeetCode	Medium	LC
1371	Spiral Matrix III Math & Geometry · NeetCode	Medium	LC
1372	Spiral Matrix IV Math & Geometry · NeetCode	Medium	LC
1373	Happy Number Math & Geometry · NeetCode	Easy	LC
1374	Plus One Math & Geometry · NeetCode	Easy	LC
1375	Ugly Number Math & Geometry · NeetCode	Easy	LC
1376	Convert 1D Array Into 2D Array Math & Geometry · NeetCode	Easy	LC
1377	Shift 2D Grid Math & Geometry · NeetCode	Easy	LC
1378	Integer to Roman Math & Geometry · NeetCode	Medium	LC
1379	Find the Punishment Number of an Integer Math & Geometry · NeetCode	Medium	LC
1380	Check if Number is a Sum of Powers of Three Math & Geometry · NeetCode	Medium	LC
1381	Multiply Strings Math & Geometry · NeetCode	Medium	LC
1382	Detect Squares Math & Geometry · NeetCode	Medium	LC
1383	Robot Bounded In Circle Math & Geometry · NeetCode	Medium	LC
1384	Walking Robot Simulation Math & Geometry · NeetCode	Medium	LC
1385	Zigzag Conversion Math & Geometry · NeetCode	Medium	LC
1386	Rotating the Box Math & Geometry · NeetCode	Medium	LC
1387	Sum of Square Numbers Math & Geometry · NeetCode	Medium	LC
1388	Find Missing Observations Math & Geometry · NeetCode	Medium	LC
1389	Minimum Time Difference Math & Geometry · NeetCode	Medium	LC
1390	Minimum Operations to Make a Uni-Value Grid Math & Geometry · NeetCode	Medium	LC
1391	Largest Submatrix With Rearrangements Math & Geometry · NeetCode	Medium	LC
1392	Wildest Vertical Area Between Two Points Containing No Points Math & Geometry · NeetCode	Easy	LC
1393	Tuple with Same Product Math & Geometry · NeetCode	Medium	LC
1394	Lexicographical Numbers Math & Geometry · NeetCode	Medium	LC
1395	Find the Winner of the Circular Game Math & Geometry · NeetCode	Medium	LC
1396	Count Total Number of Colored Cells Math & Geometry · NeetCode	Medium	LC
1397	Prime Subtraction Operation Math & Geometry · NeetCode	Medium	LC
1398	Closest Prime Numbers in Range Math & Geometry · NeetCode	Medium	LC
1399	Distribute Candies Among Children II Math & Geometry · NeetCode	Medium	LC
1400	Line Reflection Math & Geometry · NeetCode	Medium	LC
1401	Minimum Number of One Bit Operations to Make Integers Zero Math & Geometry · NeetCode	Hard	LC
1402	K-th Smallest in Lexicographical Order Math & Geometry · NeetCode	Hard	LC
1403	Integer to English Words Math & Geometry · NeetCode	Hard	LC
1404	Best Meeting Point Math & Geometry · NeetCode	Hard	LC
1426	Create Hello World Function JavaScript · NeetCode	Easy	LC
1427	Counter JavaScript · NeetCode	Easy	LC
1428	Counter II JavaScript · NeetCode	Easy	LC
1429	Apply Transform over each Element in Array JavaScript · NeetCode	Easy	LC
1430	Filter Elements from Array JavaScript · NeetCode	Easy	LC
1431	Array Reduce Transformation JavaScript · NeetCode	Easy	LC
1432	Function Composition JavaScript · NeetCode	Easy	LC
1433	Allow One Function Call JavaScript · NeetCode	Easy	LC
1434	Memoize JavaScript · NeetCode	Medium	LC
1435	Curry JavaScript · NeetCode	Medium	LC
1436	Sleep JavaScript · NeetCode	Easy	LC
1437	Promise Time Limit JavaScript · NeetCode	Easy	LC
1438	Promise Pool JavaScript · NeetCode	Medium	LC
1439	Cache With Time Limit JavaScript · NeetCode	Medium	LC
1440	Debounce JavaScript · NeetCode	Medium	LC
1441	Throttle JavaScript · NeetCode	Medium	LC
1442	JSON Deep Equal JavaScript · NeetCode	Medium	LC
1443	Convert Object to JSON String JavaScript · NeetCode	Medium	LC
1444	Array of Objects to Matrix JavaScript · NeetCode	Medium	LC
1445	Difference Between Two Objects JavaScript · NeetCode	Medium	LC
1446	Chunk Array JavaScript · NeetCode	Easy	LC
1447	Flatten Deeply Nested Array JavaScript · NeetCode	Medium	LC
1448	Array Prototype Last JavaScript · NeetCode	Easy	LC
1449	Group By JavaScript · NeetCode	Medium	LC
1450	Check if Object Instance of Class JavaScript · NeetCode	Medium	LC
1451	Call Function with Custom Context JavaScript · NeetCode	Medium	LC
1452	Event Emitter JavaScript · NeetCode	Medium	LC
1453	Array Wrapper JavaScript · NeetCode	Easy	LC
1454	Generate Fibonacci Sequence JavaScript · NeetCode	Easy	LC
1455	Nested Array Generator JavaScript · NeetCode	Medium	LC

🔃

Step 2: Sorting Techniques

Step 25 problems▼

#	Problem	Diff	Platform
52	Selection Sort Find min and swap	Easy	GFG
53	Bubble Sort Recursively bubble the largest element to end	Easy	GFG
54	Insertion Sort Sort first n-1 elements, insert n-th	Easy	LC
55	Merge Sort Divide & Conquer / O(N log N)	Medium	LC
56	Quick Sort Pivot partitioning / O(N log N) average	Medium	GFG

📦

Step 3: Arrays [Easy → Medium → Hard]

Step 363 problems▼

#	Problem	Diff	Platform
57	Largest Element in Array Linear scan	Easy	LC
58	Second Largest Element Two variables tracking max and second max	Easy	LC
59	Check if Array is Sorted Count drops in monotonic sequence	Easy	LC
60	Remove Duplicates from Sorted Array Two pointer approach (i and j)	Easy	LC
61	Left Rotate Array by One Place	Easy	LC
62	Left Rotate Array by D Places Reversal Algorithm: reverse(0,k), reverse(k,n)	Easy	LC
63	Move Zeros to End Two pointers tracking zero position	Easy	LC
64	Linear Search	Easy	GFG
65	Union of Two Sorted Arrays	Easy	LC
66	Missing Number in Array Sum formula N*(N+1)/2 or XOR ^	Easy	LC
67	Max Consecutive Ones	Easy	LC
68	Find the Single Number XOR all elements	Easy	LC
69	Two Sum C++ unordered_map	Easy	LC
70	Sort Colors (Dutch National Flag) Dutch National Flag Algorithm	Medium	LC
71	Majority Element (>N/2) Moore's Voting Algorithm	Medium	LC
72	Kadane's Algorithm (Max Subarray Sum) Carry forward positive sums	Medium	LC
73	Best Time to Buy & Sell Stock I Track min price	Easy	LC
74	Rearrange Array by Sign Two separate indices for pos/neg	Medium	LC
75	Next Permutation Find dip, swap, reverse right half	Medium	LC
76	Longest Consecutive Sequence HashSet unordered_set / O(N)	Medium	LC
77	Set Matrix Zeroes Use first row/col as hash array	Medium	LC
78	Rotate Image (Matrix) Transpose matrix, then reverse rows	Medium	LC
79	Spiral Matrix 4 boundary pointers (top, bottom, left, right)	Medium	LC
80	Subarray Sum Equals K	Medium	LC
81	Pascal's Triangle nCr math generation	Easy	LC
82	Majority Element II (>N/3) Extended Moore's Voting (2 tracking vars)	Hard	LC
83	3 Sum Sort + Two Pointers	Medium	LC
84	4 Sum Sort + Loop + Loop + Two Pointers	Medium	LC
85	Merge Overlapping Intervals Sort by start time, merge if end >= next_start	Medium	LC
86	Merge Two Sorted Arrays Without Extra Space Gap method / Shell sort logic	Hard	LC
87	Missing & Repeating Number Math equations (Sum & Sum of Squares) or XOR	Hard	LC
88	Count Inversions Modified Merge Sort	Hard	GFG
89	Reverse Pairs Modified Merge Sort	Hard	LC
90	Maximum Product Subarray	Medium	LC
91	Find the Duplicate Number	Medium	LC
92	Max Sum Rectangle in Matrix	Hard	LC
93	3-Sum Closest to Target	Medium	LC
94	4-Sum Count (4 Arrays)	Medium	LC
95	Subarray with XOR = K	Medium	GFG
96	Count Pairs with Given Sum	Easy	GFG
97	Reverse the array Love Babbar DSA Sheet. [GFG Link]	Easy	LC
98	Find the maximum and minimum element in an array Love Babbar DSA Sheet.	Easy	LC
99	Move all the negative elements to one side of the array Love Babbar DSA Sheet. [GFG Link]	Medium	LC
100	Find the Union and Intersection of the two sorted arrays. Love Babbar DSA Sheet.	Easy	LC
101	Minimise the maximum difference between heights [V.IMP] Love Babbar DSA Sheet. [GFG Link]	Medium	GFG
102	Count Inversion Love Babbar DSA Sheet. [GFG Link]	Medium	LC
103	find all pairs on integer array whose sum is equal to given number Love Babbar DSA Sheet. [GFG Link]	Medium	LC
104	find common elements In 3 sorted arrays Love Babbar DSA Sheet. [GFG Link]	Medium	GFG
105	Rearrange the array in alternating positive and negative items with O(1) extra space Love Babbar DSA Sheet. [GFG Link]	Medium	LC
106	Find factorial of a large number Love Babbar DSA Sheet. [GFG Link]	Medium	GFG
107	Find whether an array is a subset of another array Love Babbar DSA Sheet. [GFG Link]	Medium	GFG
108	Chocolate Distribution problem Love Babbar DSA Sheet. [GFG Link]	Medium	GFG
109	Smallest Subarray with sum greater than a given value Love Babbar DSA Sheet. [GFG Link]	Medium	LC
110	Three way partitioning of an array around a given value Love Babbar DSA Sheet. [GFG Link]	Medium	GFG
111	Find row with maximum no. of 1's Love Babbar DSA Sheet.	Medium	GFG
112	Print elements in sorted order using row-column wise sorted matrix Love Babbar DSA Sheet. [GFG Link]	Medium	GFG
113	Find a specific pair in matrix Love Babbar DSA Sheet. [GFG Link]	Medium	GFG
114	Kth smallest element in a row-cpumn wise sorted matrix Love Babbar DSA Sheet. [GFG Link]	Medium	GFG
115	Common elements in all rows of a given matrix Love Babbar DSA Sheet. [GFG Link]	Medium	LC
116	Largest number by joining numbers Love Babbar DSA Sheet.	Medium	LC
117	Bonus: Wiggle Sort Love Babbar DSA Sheet.	Medium	LC
118	Bonus: Minumum swaps to make strings equal Love Babbar DSA Sheet.	Medium	LC
119	Find row with maximum no. of 1's O(m+n) solution Love Babbar DSA Sheet.	Medium	GFG
747	Repeat & missing number Apna College Placement Series	Easy	LeetCode
748	Container with most water Apna College Placement Series	Medium	LeetCode
749	3Sum Apna College Placement Series	Medium	LeetCode
750	4Sum Apna College Placement Series	Medium	LeetCode
751	Count Inversions Apna College Placement Series	Hard	LeetCode
787	Concatenation of Array Arrays & Hashing · NeetCode	Easy	LC
788	Contains Duplicate Arrays & Hashing · NeetCode	Easy	LC
789	Is Subsequence Arrays & Hashing · NeetCode	Easy	LC
790	Append Characters to String to Make Subsequence Arrays & Hashing · NeetCode	Medium	LC
791	Score of a String Arrays & Hashing · NeetCode	Easy	LC
792	Length of Last Word Arrays & Hashing · NeetCode	Easy	LC
793	Valid Word Square Arrays & Hashing · NeetCode	Easy	LC
794	Confusing Number Arrays & Hashing · NeetCode	Easy	LC
795	Find Anagram Mappings Arrays & Hashing · NeetCode	Easy	LC
796	Sentence Similarity Arrays & Hashing · NeetCode	Easy	LC
797	Largest Unique Number Arrays & Hashing · NeetCode	Easy	LC
798	Single-Row Keyboard Arrays & Hashing · NeetCode	Easy	LC
799	Palindrome Permutation Arrays & Hashing · NeetCode	Easy	LC
800	Counting Elements Arrays & Hashing · NeetCode	Easy	LC
801	Perform String Shifts Arrays & Hashing · NeetCode	Easy	LC
802	Design Compressed String Iterator Arrays & Hashing · NeetCode	Easy	LC
803	Logger Rate Limiter Arrays & Hashing · NeetCode	Easy	LC
804	Group Shifted Strings Arrays & Hashing · NeetCode	Medium	LC
805	Moving Average from Data Stream Arrays & Hashing · NeetCode	Easy	LC
806	Maximum Distance in Arrays Arrays & Hashing · NeetCode	Medium	LC
807	Lonely Pixel I Arrays & Hashing · NeetCode	Medium	LC
808	Candy Crush Arrays & Hashing · NeetCode	Medium	LC
809	Find Smallest Common Element in All Rows Arrays & Hashing · NeetCode	Medium	LC
810	One Edit Distance Arrays & Hashing · NeetCode	Medium	LC
811	Reverse Words in a String II Arrays & Hashing · NeetCode	Medium	LC
812	Shortest Way to Form String Arrays & Hashing · NeetCode	Medium	LC
813	First Unique Number Arrays & Hashing · NeetCode	Medium	LC
814	Design Tic-Tac-Toe Arrays & Hashing · NeetCode	Medium	LC
815	Design Snake Game Arrays & Hashing · NeetCode	Medium	LC
816	Zigzag Iterator Arrays & Hashing · NeetCode	Medium	LC
817	Design A Leaderboard Arrays & Hashing · NeetCode	Medium	LC
818	Number of Senior Citizens Arrays & Hashing · NeetCode	Easy	LC
819	Remove Element Arrays & Hashing · NeetCode	Easy	LC
820	Unique Email Addresses Arrays & Hashing · NeetCode	Easy	LC
821	Can Place Flowers Arrays & Hashing · NeetCode	Easy	LC
822	Maximum Difference Between Even and Odd Frequency I Arrays & Hashing · NeetCode	Easy	LC
823	Longest Strictly Increasing or Strictly Decreasing Subarray Arrays & Hashing · NeetCode	Easy	LC
824	Maximum Ascending Subarray Sum Arrays & Hashing · NeetCode	Easy	LC
825	Find Pivot Index Arrays & Hashing · NeetCode	Easy	LC
826	Kth Distinct String in an Array Arrays & Hashing · NeetCode	Easy	LC
827	Range Sum Query - Immutable Arrays & Hashing · NeetCode	Easy	LC
828	Find All Numbers Disappeared in An Array Arrays & Hashing · NeetCode	Easy	LC
829	Maximum Number of Balloons Arrays & Hashing · NeetCode	Easy	LC
830	Word Pattern Arrays & Hashing · NeetCode	Easy	LC
831	Design HashSet Arrays & Hashing · NeetCode	Easy	LC
832	Design HashMap Arrays & Hashing · NeetCode	Easy	LC
833	Height Checker Arrays & Hashing · NeetCode	Easy	LC
834	Find Lucky Integer in an Array Arrays & Hashing · NeetCode	Easy	LC
835	Special Array I Arrays & Hashing · NeetCode	Easy	LC
836	Monotonic Array Arrays & Hashing · NeetCode	Easy	LC
837	Divide Array Into Equal Pairs Arrays & Hashing · NeetCode	Easy	LC
838	Number of Good Pairs Arrays & Hashing · NeetCode	Easy	LC
839	Pascal's Triangle II Arrays & Hashing · NeetCode	Easy	LC
840	Find Words That Can Be Formed by Characters Arrays & Hashing · NeetCode	Easy	LC
841	Count the Number of Consistent Strings Arrays & Hashing · NeetCode	Easy	LC
842	Ransom Note Arrays & Hashing · NeetCode	Easy	LC
843	Largest 3-Same-Digit Number in String Arrays & Hashing · NeetCode	Easy	LC
844	Destination City Arrays & Hashing · NeetCode	Easy	LC
845	Maximum Product Difference Between Two Pairs Arrays & Hashing · NeetCode	Easy	LC
846	Circular Sentence Arrays & Hashing · NeetCode	Easy	LC
847	Maximum Score After Splitting a String Arrays & Hashing · NeetCode	Easy	LC
848	Path Crossing Arrays & Hashing · NeetCode	Easy	LC
849	Redistribute Characters to Make All Strings Equal Arrays & Hashing · NeetCode	Easy	LC
850	Longest Palindrome Arrays & Hashing · NeetCode	Easy	LC
851	Largest Substring Between Two Equal Characters Arrays & Hashing · NeetCode	Easy	LC
852	Set Mismatch Arrays & Hashing · NeetCode	Easy	LC
853	Number of Students Unable to Eat Lunch Arrays & Hashing · NeetCode	Easy	LC
854	Special Array with X Elements Greater than or Equal X Arrays & Hashing · NeetCode	Easy	LC
855	Array Transformation Arrays & Hashing · NeetCode	Easy	LC
856	Shortest Word Distance Arrays & Hashing · NeetCode	Easy	LC
857	Count Vowel Strings in Ranges Arrays & Hashing · NeetCode	Medium	LC
858	Average Waiting Time Arrays & Hashing · NeetCode	Medium	LC
859	Relative Sort Array Arrays & Hashing · NeetCode	Easy	LC
860	Sort the People Arrays & Hashing · NeetCode	Easy	LC
861	Sort Array by Increasing Frequency Arrays & Hashing · NeetCode	Easy	LC
862	Custom Sort String Arrays & Hashing · NeetCode	Medium	LC
863	Encode and Decode Strings Arrays & Hashing · NeetCode	Medium	LC
864	Range Sum Query 2D Immutable Arrays & Hashing · NeetCode	Medium	LC
865	Analyze User Website Visit Pattern Arrays & Hashing · NeetCode	Medium	LC
866	Minimum Number of Operations to Move All Balls to Each Box Arrays & Hashing · NeetCode	Medium	LC
867	Valid Sudoku Arrays & Hashing · NeetCode	Medium	LC
868	Encode and Decode TinyURL Arrays & Hashing · NeetCode	Medium	LC
869	Brick Wall Arrays & Hashing · NeetCode	Medium	LC
870	Minimum Index of a Valid Split Arrays & Hashing · NeetCode	Medium	LC
871	Subarray Sums Divisible by K Arrays & Hashing · NeetCode	Medium	LC
872	Make Sum Divisible by P Arrays & Hashing · NeetCode	Medium	LC
873	Unique Length 3 Palindromic Subsequences Arrays & Hashing · NeetCode	Medium	LC
874	Number of Sub-arrays With Odd Sum Arrays & Hashing · NeetCode	Medium	LC
875	Minimum Number of Swaps to Make The String Balanced Arrays & Hashing · NeetCode	Medium	LC
876	Number of Pairs of Interchangeable Rectangles Arrays & Hashing · NeetCode	Medium	LC
877	Maximum Product of The Length of Two Palindromic Subsequences Arrays & Hashing · NeetCode	Medium	LC
878	Grid Game Arrays & Hashing · NeetCode	Medium	LC
879	Find All Anagrams in a String Arrays & Hashing · NeetCode	Medium	LC
880	Wiggle Sort Arrays & Hashing · NeetCode	Medium	LC
881	Continuous Subarray Sum Arrays & Hashing · NeetCode	Medium	LC
882	Push Dominoes Arrays & Hashing · NeetCode	Medium	LC
883	Repeated DNA Sequences Arrays & Hashing · NeetCode	Medium	LC
884	Insert Delete Get Random O(1) Arrays & Hashing · NeetCode	Medium	LC
885	Check if a String Contains all Binary Codes of Size K Arrays & Hashing · NeetCode	Medium	LC
886	Non Decreasing Array Arrays & Hashing · NeetCode	Medium	LC
887	Number of Ways to Split Array Arrays & Hashing · NeetCode	Medium	LC
888	Sign of the Product of an Array Arrays & Hashing · NeetCode	Easy	LC
889	Find the Difference of Two Arrays Arrays & Hashing · NeetCode	Easy	LC
890	Uncommon Words from Two Sentences Arrays & Hashing · NeetCode	Easy	LC
891	Design Parking System Arrays & Hashing · NeetCode	Easy	LC
892	Shifting Letters II Arrays & Hashing · NeetCode	Medium	LC
893	Number of Zero-Filled Subarrays Arrays & Hashing · NeetCode	Medium	LC
894	Word Subsets Arrays & Hashing · NeetCode	Medium	LC
895	Optimal Partition of String Arrays & Hashing · NeetCode	Medium	LC
896	Design Underground System Arrays & Hashing · NeetCode	Medium	LC
897	Minimum Penalty for a Shop Arrays & Hashing · NeetCode	Medium	LC
898	Champagne Tower Arrays & Hashing · NeetCode	Medium	LC
899	Design a Food Rating System Arrays & Hashing · NeetCode	Medium	LC
900	Convert an Array Into a 2D Array With Conditions Arrays & Hashing · NeetCode	Medium	LC
901	Minimum Number of Operations to Make Array Empty Arrays & Hashing · NeetCode	Medium	LC
902	Divide Array Into Arrays With Max Difference Arrays & Hashing · NeetCode	Medium	LC
903	Sequential Digits Arrays & Hashing · NeetCode	Medium	LC
904	Sort the Jumbled Numbers Arrays & Hashing · NeetCode	Medium	LC
905	Find Polygon with the Largest Perimeter Arrays & Hashing · NeetCode	Medium	LC
906	Minimum Remove to Make Valid Parentheses Arrays & Hashing · NeetCode	Medium	LC
907	Contiguous Array Arrays & Hashing · NeetCode	Medium	LC
908	Count Number of Bad Pairs Arrays & Hashing · NeetCode	Medium	LC
909	Find All Duplicates in an Array Arrays & Hashing · NeetCode	Medium	LC
910	Find the Length of the Longest Common Prefix Arrays & Hashing · NeetCode	Medium	LC
911	Count Unguarded Cells in the Grid Arrays & Hashing · NeetCode	Medium	LC
912	Design Hit Counter Arrays & Hashing · NeetCode	Medium	LC
913	Shortest Word Distance II Arrays & Hashing · NeetCode	Medium	LC
914	Dot Product of Two Sparse Vectors Arrays & Hashing · NeetCode	Medium	LC
915	Brightest Position on Street Arrays & Hashing · NeetCode	Medium	LC
916	Apply Substitutions Arrays & Hashing · NeetCode	Medium	LC
917	The Earliest Moment When Everyone Become Friends Arrays & Hashing · NeetCode	Medium	LC
918	Range Sum Query 2D - Mutable Arrays & Hashing · NeetCode	Medium	LC
919	Synonymous Sentences Arrays & Hashing · NeetCode	Medium	LC
920	Split Concatenated Strings Arrays & Hashing · NeetCode	Medium	LC
921	Design Log Storage System Arrays & Hashing · NeetCode	Medium	LC
922	Text Justification Arrays & Hashing · NeetCode	Hard	LC
923	Naming a Company Arrays & Hashing · NeetCode	Hard	LC
924	Number of Submatrices that Sum to Target Arrays & Hashing · NeetCode	Hard	LC
925	First Missing Positive Arrays & Hashing · NeetCode	Hard	LC
926	Number of Ships in a Rectangle Arrays & Hashing · NeetCode	Hard	LC
927	Time Taken to Cross the Door Arrays & Hashing · NeetCode	Hard	LC
928	Design Excel Sum Formula Arrays & Hashing · NeetCode	Hard	LC
1337	Missing Ranges Intervals · NeetCode	Easy	LC
1338	Remove Interval Intervals · NeetCode	Medium	LC
1339	Add Bold Tag in String Intervals · NeetCode	Medium	LC
1340	Interval List Intersections Intervals · NeetCode	Medium	LC
1341	Meeting Rooms Intervals · NeetCode	Easy	LC
1342	Meeting Rooms II Intervals · NeetCode	Medium	LC
1343	Meeting Rooms III Intervals · NeetCode	Hard	LC
1344	Divide Intervals Into Minimum Number of Groups Intervals · NeetCode	Medium	LC
1345	Remove Covered Intervals Intervals · NeetCode	Medium	LC
1346	The Number of the Smallest Unoccupied Chair Intervals · NeetCode	Medium	LC
1347	Check if Grid can be Cut into Sections Intervals · NeetCode	Medium	LC
1348	My Calendar II Intervals · NeetCode	Medium	LC
1349	Count Days Without Meetings Intervals · NeetCode	Medium	LC
1350	Minimum Interval to Include Each Query Intervals · NeetCode	Hard	LC
1351	Data Stream as Disjoint Intervals Intervals · NeetCode	Hard	LC
1352	Employee Free Time Intervals · NeetCode	Hard	LC
1464	Watering Plants II Day 34 : Miscellaneous · Apna College	Medium	LC

🔍

Step 4: Binary Search [1D, 2D, Search Space]

Step 453 problems▼

#	Problem	Diff	Platform
120	Binary Search Iterative low, high, mid	Easy	LC
121	Lower Bound std::lower_bound in C++ / Custom implementation	Easy	LC
122	Upper Bound	Easy	LC
123	Search Insert Position	Easy	LC
124	First & Last Occurrence Two separate binary searches	Medium	LC
125	Count Occurrences in Sorted Array	Easy	GFG
126	Search in Rotated Sorted Array I Identify which half is sorted	Medium	LC
127	Search in Rotated Sorted Array II Handle duplicates by shrinking space low++, high--	Medium	LC
128	Find Minimum in Rotated Sorted Array Pivot identification	Medium	LC
129	Find Out How Many Times Array Rotated	Easy	GFG
130	Single Element in Sorted Array Odd/Even index checking	Medium	LC
131	Find Peak Element Slope checking: arr[mid] > arr[mid+1]	Medium	LC
132	Sqrt(x) BS on Answer range [1, x]	Easy	LC
133	Nth Root of M BS on Answer / Handling overflow	Medium	LC
134	Koko Eating Bananas BS on Answer (Min capacity)	Medium	LC
135	Minimum Days to Make M Bouquets BS on Answer	Medium	LC
136	Find the Smallest Divisor	Medium	LC
137	Capacity to Ship Packages in D Days BS on Answer	Medium	LC
138	Kth Missing Positive Number	Easy	LC
139	Aggressive Cows BS on max of minimum distances	Hard	LC
140	Allocate Books BS on min of maximum pages	Hard	LC
141	Split Array Largest Sum Identical logic to Allocate Books	Hard	LC
142	Painter's Partition	Hard	GFG
143	Minimize Max Distance to Gas Station	Hard	LC
144	Median of Two Sorted Arrays	Hard	LC
145	Kth Element of Two Sorted Arrays	Medium	GFG
146	Find Row with Maximum 1s	Easy	LC
147	Search in 2D Matrix Treat 2D as 1D: matrix[mid/m][mid%m]	Medium	LC
148	Search in 2D Matrix II Start from top-right or bottom-left	Medium	LC
149	Find Peak Element II	Hard	LC
150	Matrix Median	Hard	GFG
151	Find a Fixed Point (Value equal to index) in a given array Love Babbar DSA Sheet.	Easy	GFG
152	square root of an integer Love Babbar DSA Sheet. [GFG Link]	Medium	LC
153	Maximum and minimum of an array using minimum number of comparisons Love Babbar DSA Sheet. [GFG Link]	Easy	GFG
154	Optimum location of point to minimize total distance Love Babbar DSA Sheet. [GFG Link]	Medium	GFG
155	Searching in an array where adjacent differ by at most k Love Babbar DSA Sheet. [GFG Link]	Medium	GFG
156	find a pair with a given difference Love Babbar DSA Sheet. [GFG Link]	Medium	LC
157	Product array Puzzle Love Babbar DSA Sheet. [GFG Link]	Medium	LC
158	Sort array according to count of set bits Love Babbar DSA Sheet. [GFG Link]	Medium	LC
159	minimum no. of swaps required to sort the array Love Babbar DSA Sheet. [GFG Link]	Medium	LC
160	Bishu and Soldiers Love Babbar DSA Sheet. [GFG Link]	Medium	LC
161	Rasta and Kheshtak Love Babbar DSA Sheet. [GFG Link]	Medium	LC
162	EKOSPOJ: Love Babbar DSA Sheet. [GFG Link]	Medium	LC
163	Job Scheduling Algo Love Babbar DSA Sheet. [GFG Link]	Medium	LC
164	Missing Number in AP Love Babbar DSA Sheet. [GFG Link]	Medium	LC
165	ROTI-Prata SPOJ Love Babbar DSA Sheet. [GFG Link]	Medium	GFG
166	DoubleHelix SPOJ Love Babbar DSA Sheet. [GFG Link]	Medium	LC
167	Subset Sums Love Babbar DSA Sheet. [GFG Link]	Medium	GFG
168	Implement Merge-sort in-place Love Babbar DSA Sheet. [GFG Link]	Medium	LC
169	Partitioning and Sorting Arrays with Many Repeated Entries Love Babbar DSA Sheet. [GFG Link]	Medium	LC
170	Find a Fixed Point (Value equal to index) in a given array (too easy) Love Babbar DSA Sheet.	Easy	GFG
171	K-th Element of Two Sorted Arrays (similar to Median of Two Sorted Arrays) Love Babbar DSA Sheet.	Medium	LC
172	Bonus: Minimum speed to Arrive on time Love Babbar DSA Sheet.	Medium	LC
752	Peak index in mountain array Apna College Placement Series	Medium	LeetCode
753	Allocate Minimum Pages (Book Allocation) Apna College Placement Series	Medium	GFG
754	Painter’s Partition Apna College Placement Series	Medium	LeetCode
755	Aggressive cows Apna College Placement Series	Medium	SPOJ
1006	Guess Number Higher Or Lower Binary Search · NeetCode	Easy	LC
1007	Valid Perfect Square Binary Search · NeetCode	Easy	LC
1008	Check If a Number Is Majority Element in a Sorted Array Binary Search · NeetCode	Easy	LC
1009	Missing Element in Sorted Array Binary Search · NeetCode	Medium	LC
1010	Find the Index of the Large Integer Binary Search · NeetCode	Medium	LC
1011	Divide Chocolate Binary Search · NeetCode	Hard	LC
1012	Maximum Average Subarray II Binary Search · NeetCode	Hard	LC
1013	Maximum Candies Allocated to K Children Binary Search · NeetCode	Medium	LC
1014	House Robber IV Binary Search · NeetCode	Medium	LC
1015	Minimized Maximum of Products Distributed to Any Store Binary Search · NeetCode	Medium	LC
1016	Minimum Limit of Balls in a Bag Binary Search · NeetCode	Medium	LC
1017	Minimum Time to Repair Cars Binary Search · NeetCode	Medium	LC
1018	Time Based Key Value Store Binary Search · NeetCode	Medium	LC
1019	Maximum Number of Removable Characters Binary Search · NeetCode	Medium	LC
1020	Most Beautiful Item for Each Query Binary Search · NeetCode	Medium	LC
1021	Random Pick with Weight Binary Search · NeetCode	Medium	LC
1022	Search Suggestions System Binary Search · NeetCode	Medium	LC
1023	Count the Number of Fair Pairs Binary Search · NeetCode	Medium	LC
1024	Binary Searchable Numbers in an Unsorted Array Binary Search · NeetCode	Medium	LC
1025	Leftmost Column With at Least a One Binary Search · NeetCode	Medium	LC
1026	Find K-th Smallest Pair Distance Binary Search · NeetCode	Hard	LC
1027	Find in Mountain Array Binary Search · NeetCode	Hard	LC
1028	Kth Smallest Product of Two Sorted Arrays Binary Search · NeetCode	Hard	LC

🔤

Step 5: Strings [Basic & Medium]

Step 535 problems▼

#	Problem	Diff	Platform
173	Remove Outermost Parentheses Counter tracking depth	Easy	LC
174	Reverse Words in a String Stringstream / Stack / Two Pointers	Medium	LC
175	Largest Odd Number in String Find rightmost odd digit	Easy	LC
176	Longest Common Prefix Sort strings, compare first and last	Easy	LC
177	Isomorphic Strings Two Hash Maps	Easy	LC
178	Check if Strings are Rotations Check if s2 is substring of s1+s1	Easy	LC
179	Valid Anagram Character frequency counting	Easy	LC
180	Sort Characters by Frequency Hash Map + Priority Queue / Bucket Sort	Medium	LC
181	Maximum Nesting Depth of Parentheses Max open brackets counter	Easy	LC
182	Roman to Integer Hash Map, subtract if s[i] < s[i+1]	Easy	LC
183	String to Integer (atoi) Sign checking, overflow handling	Medium	LC
184	Count Substrings with Same Start & End	Medium	GFG
185	Longest Palindromic Substring	Medium	LC
186	Sum of Beauty of All Substrings	Medium	LC
187	Minimum Characters to Add to Make Palindrome	Hard	LC
188	Find Duplicate characters in a string Love Babbar DSA Sheet. [GFG Link]	Medium	GFG
189	Why strings are immutable in Java? > Love Babbar DSA Sheet.	Medium	LC
190	Find Longest Recurring Subsequence in String Love Babbar DSA Sheet. [GFG Link]	Medium	GFG
191	Print all Subsequences of a string. Love Babbar DSA Sheet. [GFG Link]	Medium	GFG
192	Word Wrap Problem [VERY IMP]. Love Babbar DSA Sheet.	Hard	GFG
193	Rabin Karp Algo Love Babbar DSA Sheet. [GFG Link]	Medium	LC
194	Minimum number of bracket reversals needed to make an expression balanced. Love Babbar DSA Sheet. [GFG Link]	Medium	GFG
195	Count All Palindromic Subsequence in a given String. Love Babbar DSA Sheet. [GFG Link]	Medium	GFG
196	Search a Word in a 2D Grid of characters. Love Babbar DSA Sheet.	Medium	LC
197	Number of flips to make binary string alternate Love Babbar DSA Sheet. [GFG Link]	Medium	LC
198	Find the first repeated word in string. Love Babbar DSA Sheet. [GFG Link]	Medium	GFG
199	Minimum number of swaps for bracket balancing. Love Babbar DSA Sheet. [GFG Link]	Medium	GFG
200	Program to generate all possible valid IP addresses from given string. Love Babbar DSA Sheet. [GFG Link]	Medium	LC
201	Rearrange characters in a string such that no two adjacent are same Love Babbar DSA Sheet. [GFG Link]	Medium	LC
202	Given a sequence of words, print all anagrams together Love Babbar DSA Sheet. [GFG Link]	Easy	LC
203	Recursively remove all adjacent duplicates Love Babbar DSA Sheet. [GFG Link]	Medium	LC
204	String matching where one string contains wildcard characters Love Babbar DSA Sheet. [GFG Link]	Hard	LC
205	Function to find Number of customers who could not get a computer Love Babbar DSA Sheet. [GFG Link]	Medium	GFG
206	Transform One String to Another using Minimum Number of Given Operation Love Babbar DSA Sheet. [GFG Link]	Medium	GFG
207	Recursively print all sentences that can be formed from list of word lists Love Babbar DSA Sheet. [GFG Link]	Medium	GFG
756	Remove All Occurrences of String Apna College Placement Series	Medium	LeetCode
757	Permutation in String Apna College Placement Series	Medium	LeetCode
758	String Compression Apna College Placement Series	Medium	LeetCode
759	Robin Karp Apna College Placement Series	Hard	LeetCode

🔗

Step 6: Linked List [Single, Double, Hard]

Step 647 problems▼

#	Problem	Diff	Platform
208	Introduction to Linked List Structs / Classes in C++	Easy	LC
209	Insert at End of Linked List	Easy	GFG
210	Delete Last Node of Linked List	Easy	GFG
211	Find Length of Linked List	Easy	GFG
212	Search in Linked List	Easy	GFG
213	Introduction to Doubly Linked List	Easy	LC
214	Insert in Doubly Linked List Managing prev and next pointers	Easy	LC
215	Delete in Doubly Linked List Safe deletion without memory leaks	Easy	LC
216	Reverse a Doubly Linked List Swapping prev and next at each node	Easy	LC
217	Find Pairs with Given Sum in DLL Two pointers (Head and Tail)	Medium	LC
218	Remove Duplicates from Sorted DLL Sequential checking	Easy	LC
219	Middle of Linked List Slow & Fast Pointers	Easy	LC
220	Reverse Linked List Prev, Curr, Next pointers	Easy	LC
221	Detect Cycle in LL (Floyd's) Floyd's Tortoise and Hare	Easy	LC
222	Find Length of Loop Freeze slow, move fast to count	Easy	LC
223	Check if Palindrome LL Find mid, reverse right half, compare	Easy	LC
224	Segregate Odd/Even Nodes Odd/Even dummy heads	Medium	LC
225	Remove Nth Node from Back Fast pointer lead by N	Medium	LC
226	Delete Node Without Head Copy next node value, delete next node	Easy	LC
227	Sort LL of 0s 1s 2s	Easy	GFG
228	Add 1 to Number Represented as LL	Medium	GFG
229	Add Two Numbers Carry tracking	Medium	LC
230	Intersection of Two Linked Lists Align lengths / Dual traversal	Easy	LC
231	Starting Point of Cycle Move slow to head, advance both by 1	Medium	LC
232	Reverse LL in Groups of K Group counting and modular reversal	Hard	LC
233	Rotate a Linked List Connect tail to head, break at len - k%len	Medium	LC
234	Clone LL with Random Pointer Insert copy nodes in-between original nodes	Hard	LC
235	Flatten a Linked List Merge logic applied recursively	Hard	LC
236	Sort Linked List (Merge Sort)	Medium	LC
237	Delete All Occurrences of Key in DLL	Medium	GFG
238	Merge K Sorted Linked Lists Min-Heap holding node pointers	Hard	LC
239	Reverse a Linked List in group of Given Size. [Very Imp] Love Babbar DSA Sheet. [GFG Link]	Easy	LC
240	Write a program to Delete loop in a linked list. Love Babbar DSA Sheet. [GFG Link]	Easy	GFG
241	Remove Duplicates in a sorted Linked List. Love Babbar DSA Sheet. [GFG Link]	Easy	LC
242	Remove Duplicates in a Un-sorted Linked List. Love Babbar DSA Sheet. [GFG Link]	Easy	GFG
243	Add two numbers represented by linked lists. Love Babbar DSA Sheet. [GFG Link]	Medium	LC
244	Split a Circular linked list into two halves. Love Babbar DSA Sheet. [GFG Link]	Medium	GFG
245	Find pairs with a given sum in a DLL. Love Babbar DSA Sheet. [GFG Link]	Medium	GFG
246	Count triplets in a sorted DLL whose sum is equal to given value “X”. Love Babbar DSA Sheet. [GFG Link]	Medium	LC
247	Sort a “k”sorted Doubly Linked list.[Very IMP] Love Babbar DSA Sheet. [GFG Link]	Medium	GFG
248	Rotate a Doubly Linked list in group of Given Size.[Very IMP] Love Babbar DSA Sheet. [GFG Link]	Medium	GFG
249	Can we reverse a linked list in less than O(n) ? > Love Babbar DSA Sheet.	Easy	LC
250	Why Quicksort is preferred for Arrays and Merge Sort for LinkedLists ? > Love Babbar DSA Sheet.	Medium	LC
251	Sort a LL of 0's, 1's and 2's Love Babbar DSA Sheet. [GFG Link]	Medium	GFG
252	Multiply 2 no. represented by LL Love Babbar DSA Sheet. [GFG Link]	Medium	GFG
253	Delete nodes which have a greater value on right side Love Babbar DSA Sheet. [GFG Link]	Medium	LC
254	Find the first non-repeating character from a stream of characters Love Babbar DSA Sheet. [GFG Link]	Medium	GFG
763	Merge 2 Sorted LL Apna College Placement Series	Easy	LeetCode
764	Clone LL with Random Pointers Apna College Placement Series	Medium	LeetCode
765	Reverse Nodes in K Groups Apna College Placement Series	Hard	LeetCode
1029	Remove Linked List Elements Linked List · NeetCode	Easy	LC
1030	Delete N Nodes After M Nodes of a Linked List Linked List · NeetCode	Easy	LC
1031	Insert into a Sorted Circular Linked List Linked List · NeetCode	Medium	LC
1032	Plus One Linked List Linked List · NeetCode	Medium	LC
1033	Print Immutable Linked List in Reverse Linked List · NeetCode	Medium	LC
1034	Merge in Between Linked Lists Linked List · NeetCode	Medium	LC
1035	Merge Nodes in Between Zeros Linked List · NeetCode	Medium	LC
1036	Find the Minimum and Maximum Number of Nodes Between Critical Points Linked List · NeetCode	Medium	LC
1037	Reorder List Linked List · NeetCode	Medium	LC
1038	Maximum Twin Sum Of A Linked List Linked List · NeetCode	Medium	LC
1039	Delete Nodes From Linked List Present in Array Linked List · NeetCode	Medium	LC
1040	Swapping Nodes in a Linked List Linked List · NeetCode	Medium	LC
1041	Design Linked List Linked List · NeetCode	Medium	LC
1042	Design Browser History Linked List · NeetCode	Medium	LC
1043	Swap Nodes In Pairs Linked List · NeetCode	Medium	LC
1044	Partition List Linked List · NeetCode	Medium	LC
1045	Design Circular Queue Linked List · NeetCode	Medium	LC
1046	Split Linked List in Parts Linked List · NeetCode	Medium	LC

🌀

Step 7: Recursion [Pattern-Wise]

Step 736 problems▼

#	Problem	Diff	Platform
255	Recursion — Print Name N Times	Easy	GFG
256	Recursion — Sum of First N Numbers	Easy	GFG
257	Pow(x, n) — Fast Exponentiation Binary Exponentiation	Medium	LC
258	Count Good Numbers	Medium	LC
259	Sort a Stack using Recursion	Medium	LC
260	Reverse a Stack using Recursion	Medium	LC
261	Generate All Subsequences	Medium	LC
262	Combination Sum I Unbounded pick	Medium	LC
263	Combination Sum II Single-use pick with duplicates	Medium	LC
264	Subset Sum I	Medium	LC
265	Subset Sum II (Unique) Sorting to avoid duplicates	Medium	LC
266	Combination Sum III Size K limit	Medium	LC
267	Letter Combinations of Phone Number Mapping string to digits	Medium	LC
268	Permutations I	Medium	LC
269	Permutations II	Medium	LC
270	N-Queens Hashing diagonals for O(1) checks	Hard	LC
271	Sudoku Solver Exhaustive 1-9 validation	Hard	LC
272	Word Search Grid Backtracking (DFS)	Medium	LC
273	Palindrome Partitioning Check palindrome prefix, recurse rest	Medium	LC
274	Rat in a maze Problem Love Babbar DSA Sheet. [GFG Link]	Medium	GFG
275	Printing all solutions in N-Queen Problem Love Babbar DSA Sheet. [GFG Link]	Hard	LC
276	Word Break Problem using Backtracking Love Babbar DSA Sheet. [GFG Link]	Medium	LC
277	Remove Invalid Parentheses Love Babbar DSA Sheet. [GFG Link]	Medium	LC
278	m Coloring Problem Love Babbar DSA Sheet. [GFG Link]	Medium	LC
279	Print all palindromic partitions of a string Love Babbar DSA Sheet. [GFG Link]	Medium	LC
280	Subset Sum Problem Love Babbar DSA Sheet. [GFG Link]	Medium	LC
281	The Knight’s tour problem Love Babbar DSA Sheet. [GFG Link]	Medium	LC
282	Tug of War Love Babbar DSA Sheet. [GFG Link]	Medium	GFG
283	Find shortest safe route in a path with landmines Love Babbar DSA Sheet. [GFG Link]	Medium	GFG
284	Combinational Sum Love Babbar DSA Sheet. [GFG Link]	Medium	LC
285	Find Maximum number possible by doing at-most K swaps Love Babbar DSA Sheet. [GFG Link]	Medium	GFG
286	Find if there is a path of more than k length from a source Love Babbar DSA Sheet. [GFG Link]	Medium	LC
287	Longest Possible Route in a Matrix with Hurdles Love Babbar DSA Sheet. [GFG Link]	Medium	LC
288	Print all possible paths from top left to bottom right of a mXn matrix Love Babbar DSA Sheet. [GFG Link]	Medium	LC
289	Partition of a set intoK subsets with equal sum Love Babbar DSA Sheet. [GFG Link]	Medium	LC
290	Find the K-th Permutation Sequence of first N natural numbers Love Babbar DSA Sheet. [GFG Link]	Medium	LC
760	Knights Tour Apna College Placement Series	Medium	LeetCode
761	M Coloring Apna College Placement Series	Medium	GFG
762	Count Inversions Apna College Placement Series	Hard	LeetCode
1123	Sum of All Subsets XOR Total Backtracking · NeetCode	Easy	LC
1124	Combinations Backtracking · NeetCode	Medium	LC
1125	Generate Parentheses Backtracking · NeetCode	Medium	LC
1126	Letter Tile Possibilities Backtracking · NeetCode	Medium	LC
1127	The k-th Lexicographical String of All Happy Strings of Length n Backtracking · NeetCode	Medium	LC
1128	Matchsticks to Square Backtracking · NeetCode	Medium	LC
1129	Splitting a String Into Descending Consecutive Values Backtracking · NeetCode	Medium	LC
1130	Construct Smallest Number From DI String Backtracking · NeetCode	Medium	LC
1131	Find Unique Binary String Backtracking · NeetCode	Medium	LC
1132	Split a String Into the Max Number of Unique Substrings Backtracking · NeetCode	Medium	LC
1133	Maximum Length of a Concatenated String With Unique Characters Backtracking · NeetCode	Medium	LC
1134	The Number of Beautiful Subsets Backtracking · NeetCode	Medium	LC
1135	Different Ways to Add Parentheses Backtracking · NeetCode	Medium	LC
1136	Construct the Lexicographically Largest Valid Sequence Backtracking · NeetCode	Medium	LC
1137	Count Number of Maximum Bitwise-OR Subsets Backtracking · NeetCode	Medium	LC
1138	Strobogrammatic Number II Backtracking · NeetCode	Medium	LC
1139	Factor Combinations Backtracking · NeetCode	Medium	LC
1140	Brace Expansion Backtracking · NeetCode	Medium	LC
1141	Word Pattern II Backtracking · NeetCode	Medium	LC
1142	Android Unlock Patterns Backtracking · NeetCode	Medium	LC
1143	N Queens II Backtracking · NeetCode	Hard	LC
1144	Maximum Score Words Formed By Letters Backtracking · NeetCode	Hard	LC
1145	Word Break II Backtracking · NeetCode	Hard	LC
1146	Robot Room Cleaner Backtracking · NeetCode	Hard	LC

🔢

Step 8: Bit Manipulation

Step 821 problems▼

#	Problem	Diff	Platform
291	Check if ith Bit is Set (n & (1 << i)) != 0	Easy	LC
292	Check if Number is Odd or Even	Easy	GFG
293	Check if Number is Power of Two (n & (n-1)) == 0	Easy	LC
294	Count Set Bits (Kernighan's Algorithm) Kernighan's Algorithm: n = n & (n-1)	Easy	LC
295	Set/Unset the Rightmost Unset Bit	Easy	GFG
296	Swap Two Numbers using XOR	Easy	GFG
297	Divide Two Integers Without /	Medium	LC
298	Single Number II Bit buckets / Math logic	Medium	LC
299	Single Number III Find rightmost set bit XOR mask	Medium	LC
300	Find XOR from L to R	Medium	LC
301	XOR Queries of Subarray	Medium	LC
302	Count Total Set Bits from 1 to N	Medium	GFG
303	Find the Minimum XOR Pair	Medium	LC
304	Reverse Bits	Easy	LC
305	Counting Bits (DP + Bit)	Easy	LC
306	Generate Subsets using Bitmask Pick / Not-Pick Tree	Medium	LC
307	Power Set	Medium	LC
308	Count number of bits to be flipped to convert A to B Love Babbar DSA Sheet.	Medium	LC
309	Copy set bits in a range Love Babbar DSA Sheet. [GFG Link]	Medium	GFG
310	Calculate square of a number without using *, / and pow() Love Babbar DSA Sheet. [GFG Link]	Medium	LC
311	Count number of bits to be flipped to convert A to B (original question's answer is to just xor and count bits) Love Babbar DSA Sheet.	Medium	LC
1405	Count Triplets with Even XOR Set Bits I Bit Manipulation · NeetCode	Easy	LC
1406	Add Binary Bit Manipulation · NeetCode	Easy	LC
1407	Shuffle the Array Bit Manipulation · NeetCode	Easy	LC
1408	Add to Array-Form of Integer Bit Manipulation · NeetCode	Easy	LC
1409	Find the Difference Bit Manipulation · NeetCode	Easy	LC
1410	Sum of Two Integers Bit Manipulation · NeetCode	Medium	LC
1411	Bitwise XOR of All Pairings Bit Manipulation · NeetCode	Medium	LC
1412	Largest Combination With Bitwise AND Greater Than Zero Bit Manipulation · NeetCode	Medium	LC
1413	Maximum XOR for Each Query Bit Manipulation · NeetCode	Medium	LC
1414	Neighboring Bitwise XOR Bit Manipulation · NeetCode	Medium	LC
1415	Shortest Subarray With OR at Least K II Bit Manipulation · NeetCode	Medium	LC
1416	Bitwise AND of Numbers Range Bit Manipulation · NeetCode	Medium	LC
1417	Find Kth Bit in Nth Binary String Bit Manipulation · NeetCode	Medium	LC
1418	Count Triplets That Can Form Two Arrays of Equal XOR Bit Manipulation · NeetCode	Medium	LC
1419	Minimum Array End Bit Manipulation · NeetCode	Medium	LC
1420	Find if Array Can Be Sorted Bit Manipulation · NeetCode	Medium	LC
1421	Longest Subarray With Maximum Bitwise AND Bit Manipulation · NeetCode	Medium	LC
1422	Longest Nice Subarray Bit Manipulation · NeetCode	Medium	LC
1423	Find the Longest Substring Containing Vowels in Even Counts Bit Manipulation · NeetCode	Medium	LC
1424	Minimize XOR Bit Manipulation · NeetCode	Medium	LC
1425	IP to CIDR Bit Manipulation · NeetCode	Medium	LC
1463	XOR Beauty of Array Day 34 : Miscellaneous · Apna College	Medium	LC

📚

Step 9: Stack & Queues

Step 959 problems▼

#	Problem	Diff	Platform
312	Implement Stack using Arrays top pointer	Easy	LC
313	Implement Queue using Arrays front, rear pointers	Easy	LC
314	Implement Stack using Queue Single queue logic	Easy	LC
315	Implement Queue using Stack Two stacks (Input/Output)	Easy	LC
316	Implement Stack using Linked List	Easy	LC
317	Implement Queue using Linked List	Easy	LC
318	Valid Parentheses Stack matching brackets	Easy	LC
319	Infix to Postfix Conversion	Easy	GFG
320	Prefix to Infix Conversion	Easy	GFG
321	Postfix to Infix Conversion	Easy	GFG
322	Next Greater Element I Monotonic Decreasing Stack	Easy	LC
323	Next Greater Element II Monotonic Stack with array doubling logic	Medium	LC
324	Next Smaller Element	Medium	LC
325	Sum of Subarray Minimums Previous Less Element + Next Less Element	Medium	LC
326	Asteroid Collision Stack simulation	Medium	LC
327	Sum of Subarray Ranges Subarray Maxes - Subarray Mins	Medium	LC
328	Remove K Digits Monotonic Increasing Stack	Medium	LC
329	132 Pattern	Medium	LC
330	Maximum Width Ramp	Medium	LC
331	Stock Span Problem Monotonic Stack of pairs	Medium	LC
332	Min Stack Storing Pairs (val, min_so_far)	Medium	LC
333	LRU Cache unordered_map + Doubly Linked List	Hard	LC
334	LFU Cache Maps of DLLs (freq -> DLL)	Hard	LC
335	The Celebrity Problem Stack elimination O(N)	Medium	LC
336	Trapping Rain Water Pre-computation (Prefix/Suffix Max) or Two Pointers	Hard	LC
337	Largest Rectangle in Histogram Left Smallest & Right Smallest bounds	Hard	LC
338	Maximal Rectangle Apply "Largest Rectangle in Histogram" on rows	Hard	LC
339	Sliding Window Maximum std::deque / Monotonic Queue	Hard	LC
340	Maximum Frequency Stack	Hard	LC
341	Number of Visible People in Queue	Hard	LC
342	Implement Stack from Scratch Love Babbar DSA Sheet. [GFG Link]	Medium	LC
343	Implement Queue from Scratch Love Babbar DSA Sheet. [GFG Link]	Medium	LC
344	Implement 2 stack in an array Love Babbar DSA Sheet. [GFG Link]	Medium	GFG
345	find the middle element of a stack Love Babbar DSA Sheet. [GFG Link]	Medium	GFG
346	Implement "N" stacks in an Array Love Babbar DSA Sheet. [GFG Link]	Medium	LC
347	Reverse a String using Stack Love Babbar DSA Sheet. [GFG Link]	Easy	GFG
348	Design a Stack that supports getMin() in O(1) time and O(1) extra space. Love Babbar DSA Sheet. [GFG Link]	Medium	LC
349	Find the next Greater element Love Babbar DSA Sheet. [GFG Link]	Medium	LC
350	Arithmetic Expression evaluation Love Babbar DSA Sheet. [GFG Link]	Medium	LC
351	Evaluation of Postfix expression Love Babbar DSA Sheet. [GFG Link]	Medium	LC
352	Implement a method to insert an element at its bottom without using any other data structure. Love Babbar DSA Sheet. [GFG Link]	Medium	LC
353	Largest rectangular Area in Histogram Love Babbar DSA Sheet. [GFG Link]	Medium	LC
354	Length of the Longest Valid Substring Love Babbar DSA Sheet. [GFG Link]	Medium	LC
355	Expression contains redundant bracket or not Love Babbar DSA Sheet. [GFG Link]	Medium	GFG
356	Implement Stack using Deque Love Babbar DSA Sheet. [GFG Link]	Medium	GFG
357	Stack Permutations (Check if an array is stack permutation of other) Love Babbar DSA Sheet. [GFG Link]	Medium	LC
358	Implement "n" queue in an array Love Babbar DSA Sheet. [GFG Link]	Medium	LC
359	Implement a Circular queue Love Babbar DSA Sheet. [GFG Link]	Medium	LC
360	LRU Cache Implementationa Love Babbar DSA Sheet. [GFG Link]	Medium	LC
361	Reverse a Queue using recursion Love Babbar DSA Sheet. [GFG Link]	Easy	LC
362	Reverse the first “K” elements of a queue Love Babbar DSA Sheet. [GFG Link]	Easy	GFG
363	Interleave the first half of the queue with second half Love Babbar DSA Sheet. [GFG Link]	Medium	LC
364	Find the first circular tour that visits all Petrol Pumps Love Babbar DSA Sheet. [GFG Link]	Medium	LC
365	Minimum time required to rot all oranges Love Babbar DSA Sheet. [GFG Link]	Medium	LC
366	Distance of nearest cell having 1 in a binary matrix Love Babbar DSA Sheet. [GFG Link]	Medium	LC
367	First negative integer in every window of size “k” Love Babbar DSA Sheet. [GFG Link]	Medium	GFG
368	Check if all levels of two trees are anagrams or not. Love Babbar DSA Sheet. [GFG Link]	Easy	LC
369	Sum of minimum and maximum elements of all subarrays of size “k”. Love Babbar DSA Sheet. [GFG Link]	Medium	LC
370	Minimum sum of squares of character counts in a given string after removing “k” characters. Love Babbar DSA Sheet. [GFG Link]	Medium	LC
766	1st Non Repeating in Stream Apna College Placement Series	Easy	LeetCode
767	Time needed to Buy Tickets Apna College Placement Series	Easy	LeetCode
768	Previous Smaller Element Apna College Placement Series	Medium	LeetCode
769	Circular Tour / Gas Station Apna College Placement Series	Medium	LeetCode
770	Stock Span Apna College Placement Series	Medium	LeetCode
984	Crawler Log Folder Stack · NeetCode	Easy	LC
985	Baseball Game Stack · NeetCode	Easy	LC
986	Final Prices With a Special Discount in a Shop Stack · NeetCode	Easy	LC
987	Make The String Great Stack · NeetCode	Easy	LC
988	Removing Stars From a String Stack · NeetCode	Medium	LC
989	Daily Temperatures Stack · NeetCode	Medium	LC
990	Car Fleet Stack · NeetCode	Medium	LC
991	Simplify Path Stack · NeetCode	Medium	LC
992	Decode String Stack · NeetCode	Medium	LC
993	Remove All Adjacent Duplicates In String II Stack · NeetCode	Medium	LC
994	Reverse Substrings Between Each Pair of Parentheses Stack · NeetCode	Medium	LC
995	Ternary Expression Parser Stack · NeetCode	Medium	LC
996	Find Permutation Stack · NeetCode	Medium	LC
997	Basic Calculator III Stack · NeetCode	Hard	LC
998	Minimum String Length After Removing Substrings Stack · NeetCode	Easy	LC
999	Clear Digits Stack · NeetCode	Easy	LC
1000	Basic Calculator II Stack · NeetCode	Medium	LC
1001	Flatten Nested List Iterator Stack · NeetCode	Medium	LC
1002	Robot Collisions Stack · NeetCode	Hard	LC
1003	Shortest Subarray with Sum at Least K Stack · NeetCode	Hard	LC
1004	Parsing A Boolean Expression Stack · NeetCode	Hard	LC
1005	Number of Atoms Stack · NeetCode	Hard	LC
1457	Sort a Stack Day 15 : Stacks & Queues (Part 3) · Apna College	Medium	GFG

🪟

Step 10: Sliding Window & Two Pointers

Step 1011 problems▼

#	Problem	Diff	Platform
371	Longest Substring Without Repeating Chars Hash Map tracking indices	Medium	LC
372	Max Consecutive Ones III Shrink window if zero count > K	Medium	LC
373	Fruits into Baskets At most 2 distinct characters	Medium	LC
374	Longest Repeating Character Replacement len - max_freq <= K	Medium	LC
375	Binary Subarrays with Sum atMost(goal) - atMost(goal-1) pattern	Medium	LC
376	Count Nice Subarrays Odd numbers converted to 1, apply sum logic	Medium	LC
377	Substrings with All 3 Characters Tracking last seen indices	Medium	LC
378	Subarrays with K Different Integers atMost(K) - atMost(K-1)	Hard	LC
379	Minimum Window Substring Hash map tracking required chars + Two Pointers	Hard	LC
380	Minimum Window Subsequence Two pointer string matching	Hard	LC
381	Maximum Points from Cards	Medium	LC
785	Fractional Knapsack Apna College Placement Series	Medium	LeetCode
786	Activity Selection Apna College Placement Series	Medium	LeetCode
929	Valid Palindrome II Two Pointers · NeetCode	Easy	LC
930	Valid Word Abbreviation Two Pointers · NeetCode	Easy	LC
931	Merge Strings Alternately Two Pointers · NeetCode	Easy	LC
932	Merge Two 2D Arrays by Summing Values Two Pointers · NeetCode	Easy	LC
933	Squares of a Sorted Array Two Pointers · NeetCode	Easy	LC
934	Find First Palindromic String in the Array Two Pointers · NeetCode	Easy	LC
935	Reverse Words in a String III Two Pointers · NeetCode	Easy	LC
936	Backspace String Compare Two Pointers · NeetCode	Easy	LC
937	Check If Two String Arrays are Equivalent Two Pointers · NeetCode	Easy	LC
938	Apply Operations to an Array Two Pointers · NeetCode	Easy	LC
939	Strobogrammatic Number Two Pointers · NeetCode	Easy	LC
940	Two Sum Less Than K Two Pointers · NeetCode	Easy	LC
941	Adding Spaces to a String Two Pointers · NeetCode	Medium	LC
942	Remove Duplicates From Sorted Array II Two Pointers · NeetCode	Medium	LC
943	Partition Array According to Given Pivot Two Pointers · NeetCode	Medium	LC
944	Two Sum II Input Array Is Sorted Two Pointers · NeetCode	Medium	LC
945	Number of Subsequences That Satisfy The Given Sum Condition Two Pointers · NeetCode	Medium	LC
946	Array With Elements Not Equal to Average of Neighbors Two Pointers · NeetCode	Medium	LC
947	Divide Players Into Teams of Equal Skill Two Pointers · NeetCode	Medium	LC
948	Boats to Save People Two Pointers · NeetCode	Medium	LC
949	K-th Symbol in Grammar Two Pointers · NeetCode	Medium	LC
950	Minimum Time To Make Rope Colorful Two Pointers · NeetCode	Medium	LC
951	Bag of Tokens Two Pointers · NeetCode	Medium	LC
952	Minimum Length of String after Deleting Similar Ends Two Pointers · NeetCode	Medium	LC
953	Sentence Similarity III Two Pointers · NeetCode	Medium	LC
954	Meeting Scheduler Two Pointers · NeetCode	Medium	LC
955	Product of Two Run Length Encoded Arrays Two Pointers · NeetCode	Medium	LC
956	Sort Transformed Array Two Pointers · NeetCode	Medium	LC
957	3Sum Smaller Two Pointers · NeetCode	Medium	LC
958	Contains Duplicate II Sliding Window · NeetCode	Easy	LC
959	Minimum Recolors to Get K Consecutive Black Blocks Sliding Window · NeetCode	Easy	LC
960	Minimum Difference Between Highest And Lowest of K Scores Sliding Window · NeetCode	Easy	LC
961	Number of Sub Arrays of Size K and Avg Greater than or Equal to Threshold Sliding Window · NeetCode	Medium	LC
962	Grumpy Bookstore Owner Sliding Window · NeetCode	Medium	LC
963	Max Consecutive Ones II Sliding Window · NeetCode	Medium	LC
964	Longest Substring with At Most Two Distinct Characters Sliding Window · NeetCode	Medium	LC
965	Longest Substring with At Most K Distinct Characters Sliding Window · NeetCode	Medium	LC
966	Find K-Length Substrings With No Repeated Characters Sliding Window · NeetCode	Medium	LC
967	Alternating Groups II Sliding Window · NeetCode	Medium	LC
968	Frequency of The Most Frequent Element Sliding Window · NeetCode	Medium	LC
969	Maximum Number of Vowels in a Substring of Given Length Sliding Window · NeetCode	Medium	LC
970	Minimum Number of Flips to Make The Binary String Alternating Sliding Window · NeetCode	Medium	LC
971	Defuse the Bomb Sliding Window · NeetCode	Easy	LC
972	Find K Closest Elements Sliding Window · NeetCode	Medium	LC
973	Minimum Operations to Reduce X to Zero Sliding Window · NeetCode	Medium	LC
974	Get Equal Substrings Within Budget Sliding Window · NeetCode	Medium	LC
975	Find the Power of K-Size Subarrays I Sliding Window · NeetCode	Medium	LC
976	Maximum Sum of Distinct Subarrays With Length K Sliding Window · NeetCode	Medium	LC
977	Length of Longest Subarray With at Most K Frequency Sliding Window · NeetCode	Medium	LC
978	Count Subarrays Where Max Element Appears at Least K Times Sliding Window · NeetCode	Medium	LC
979	Maximum Beauty of an Array After Applying Operation Sliding Window · NeetCode	Medium	LC
980	Take K of Each Character From Left and Right Sliding Window · NeetCode	Medium	LC
981	Count of Substrings Containing Every Vowel and K Consonants II Sliding Window · NeetCode	Medium	LC
982	Minimum Number of Operations to Make Array Continuous Sliding Window · NeetCode	Hard	LC
983	Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit Sliding Window · NeetCode	Medium	LC

⛰️

Step 11: Heaps / Priority Queue

Step 1129 problems▼

#	Problem	Diff	Platform
382	Introduction to Heaps	Easy	LC
383	Kth Largest Element in Stream	Easy	LC
384	Kth Largest Element in Array Min-Heap of size K	Medium	LC
385	Kth Smallest Element	Medium	LC
386	Sort K-Sorted (Nearly Sorted) Array	Medium	GFG
387	Merge K Sorted Arrays	Hard	GFG
388	Replace Element with Greatest on Right	Easy	LC
389	Task Scheduler Max-Heap + Queue for cooldown	Medium	LC
390	Hand of Straights Map/Min-Heap grouping by size W	Medium	LC
391	Top K Frequent Elements Min-Heap of Pairs (freq, val)	Medium	LC
392	Sum of Elements Between K1 & K2 Smallest	Medium	LC
393	Find Median from Data Stream Max-Heap (left) + Min-Heap (right)	Hard	LC
394	K Closest Points to Origin	Medium	LC
395	Maximum Sum Combination	Medium	GFG
396	Find K Pairs with Smallest Sums	Medium	LC
397	Smallest Range Covering K Lists	Hard	LC
398	Implement a Maxheap/MinHeap using arrays and recursion. Love Babbar DSA Sheet. [GFG Link]	Medium	LC
399	Sort an Array using heap. (HeapSort) Love Babbar DSA Sheet. [GFG Link]	Medium	LC
400	Maximum of all subarrays of size k. Love Babbar DSA Sheet. [GFG Link]	Medium	LC
401	“k” largest element in an array Love Babbar DSA Sheet. [GFG Link]	Medium	LC
402	Kth smallest and largest element in an unsorted array Love Babbar DSA Sheet. [GFG Link]	Medium	LC
403	Merge “K” sorted arrays. [ IMP ] Love Babbar DSA Sheet. [GFG Link]	Medium	LC
404	Merge 2 Binary Max Heaps Love Babbar DSA Sheet. [GFG Link]	Medium	GFG
405	Kth largest sum continuous subarrays Love Babbar DSA Sheet. [GFG Link]	Medium	LC
406	Smallest range in “K” Lists Love Babbar DSA Sheet. [GFG Link]	Medium	LC
407	Check if a Binary Tree is Heap Love Babbar DSA Sheet. [GFG Link]	Medium	LC
408	Convert BST to Min Heap Love Babbar DSA Sheet. [GFG Link]	Medium	GFG
409	Convert min heap to max heap Love Babbar DSA Sheet. [GFG Link]	Medium	LC
410	Minimum sum of two numbers formed from digits of an array Love Babbar DSA Sheet. [GFG Link]	Medium	GFG
1096	Last Stone Weight Heap / Priority Queue · NeetCode	Easy	LC
1097	Take Gifts From the Richest Pile Heap / Priority Queue · NeetCode	Easy	LC
1098	Final Array State After K Multiplication Operations I Heap / Priority Queue · NeetCode	Easy	LC
1099	High Five Heap / Priority Queue · NeetCode	Easy	LC
1100	Minimum Cost to Connect Sticks Heap / Priority Queue · NeetCode	Medium	LC
1101	Campus Bikes Heap / Priority Queue · NeetCode	Medium	LC
1102	Rearrange String k Distance Apart Heap / Priority Queue · NeetCode	Hard	LC
1103	Design Twitter Heap / Priority Queue · NeetCode	Medium	LC
1104	Least Number of Unique Integers after K Removal Heap / Priority Queue · NeetCode	Medium	LC
1105	Furthest Building You Can Reach Heap / Priority Queue · NeetCode	Medium	LC
1106	Minimize Deviation in Array Heap / Priority Queue · NeetCode	Hard	LC
1107	Maximum Subsequence Score Heap / Priority Queue · NeetCode	Medium	LC
1108	Single Threaded CPU Heap / Priority Queue · NeetCode	Medium	LC
1109	Seat Reservation Manager Heap / Priority Queue · NeetCode	Medium	LC
1110	Process Tasks Using Servers Heap / Priority Queue · NeetCode	Medium	LC
1111	Find The Kth Largest Integer In The Array Heap / Priority Queue · NeetCode	Medium	LC
1112	Longest Happy String Heap / Priority Queue · NeetCode	Medium	LC
1113	Car Pooling Heap / Priority Queue · NeetCode	Medium	LC
1114	Range Sum of Sorted Subarray Sums Heap / Priority Queue · NeetCode	Medium	LC
1115	Maximum Transactions Without Negative Balance Heap / Priority Queue · NeetCode	Medium	LC
1116	Path With Maximum Minimum Value Heap / Priority Queue · NeetCode	Medium	LC
1117	Maximum Performance of a Team Heap / Priority Queue · NeetCode	Hard	LC
1118	IPO Heap / Priority Queue · NeetCode	Hard	LC
1119	Minimum Cost to Hire K Workers Heap / Priority Queue · NeetCode	Hard	LC
1120	Number of Flowers in Full Bloom Heap / Priority Queue · NeetCode	Hard	LC
1121	Constrained Subsequence Sum Heap / Priority Queue · NeetCode	Hard	LC
1122	Find Building Where Alice and Bob Can Meet Heap / Priority Queue · NeetCode	Hard	LC

⚡

Step 12: Greedy Algorithms

Step 1248 problems▼

#	Problem	Diff	Platform
411	Assign Cookies Sort both arrays, two pointers	Easy	LC
412	Fractional Knapsack Sort by value/weight ratio	Medium	GFG
413	Greedy Minimum Coins Start subtracting from highest denomination	Easy	LC
414	Lemonade Change Track 5s and 10s counts	Easy	LC
415	Valid Parenthesis String	Medium	LC
416	N Meetings in One Room Sort by ending time	Medium	LC
417	Minimum Platforms Sort arrivals and departures separately	Medium	LC
418	Job Sequencing Problem Sort by profit, schedule at max deadline	Medium	LC
419	Candy Left to right pass, then right to left pass	Hard	LC
420	Jump Game I Track max reachable index	Medium	LC
421	Jump Game II Track current jump end and farthest jump	Medium	LC
422	Insert Interval Linear scan, merge overlaps	Medium	LC
423	Non-Overlapping Intervals	Medium	LC
424	Minimum Number of Arrows to Burst Balloons Sort by end time	Medium	LC
425	Page Faults in LRU	Medium	LC
426	Gas Station	Medium	LC
427	Activity Selection Problem Love Babbar DSA Sheet. [GFG Link]	Medium	GFG
428	Huffman Coding Love Babbar DSA Sheet. [GFG Link]	Medium	GFG
429	Water Connection Problem Love Babbar DSA Sheet. [GFG Link]	Medium	GFG
430	Fractional Knapsack Problem Love Babbar DSA Sheet. [GFG Link]	Medium	GFG
431	Greedy Algorithm to find Minimum number of Coins Love Babbar DSA Sheet. [GFG Link]	Medium	LC
432	Maximum trains for which stoppage can be provided Love Babbar DSA Sheet. [GFG Link]	Medium	LC
433	Minimum Platforms Problem Love Babbar DSA Sheet. [GFG Link]	Medium	GFG
434	Buy Maximum Stocks if i stocks can be bought on i-th day Love Babbar DSA Sheet. [GFG Link]	Medium	GFG
435	Find the minimum and maximum amount to buy all N candies Love Babbar DSA Sheet. [GFG Link]	Medium	LC
436	Minimize Cash Flow among a given set of friends who have borrowed money from each other Love Babbar DSA Sheet. [GFG Link]	Medium	LC
437	Minimum Cost to cut a board into squares Love Babbar DSA Sheet. [GFG Link]	Medium	GFG
438	Check if it is possible to survive on Island Love Babbar DSA Sheet. [GFG Link]	Medium	GFG
439	Find maximum meetings in one room Love Babbar DSA Sheet. [GFG Link]	Medium	LC
440	Maximum product subset of an array Love Babbar DSA Sheet. [GFG Link]	Medium	LC
441	Maximize array sum after K negations Love Babbar DSA Sheet. [GFG Link]	Medium	LC
442	Maximize the sum of arr[i]*i Love Babbar DSA Sheet. [GFG Link]	Medium	LC
443	Maximum sum of absolute difference of an array Love Babbar DSA Sheet. [GFG Link]	Medium	LC
444	Maximize sum of consecutive differences in a circular array Love Babbar DSA Sheet. [GFG Link]	Medium	LC
445	Minimum sum of absolute difference of pairs of two arrays Love Babbar DSA Sheet. [GFG Link]	Medium	LC
446	Program for Shortest Job First (or SJF) CPU Scheduling Love Babbar DSA Sheet. [GFG Link]	Medium	LC
447	Program for Least Recently Used (LRU) Page Replacement algorithm Love Babbar DSA Sheet. [GFG Link]	Medium	LC
448	Smallest subset with sum greater than all other elements Love Babbar DSA Sheet. [GFG Link]	Medium	LC
449	DEFKIN -Defense of a Kingdom Love Babbar DSA Sheet. [GFG Link]	Medium	SPOJ
450	DIEHARD -DIE HARD Love Babbar DSA Sheet. [GFG Link]	Medium	SPOJ
451	GERGOVIA -Wine trading in Gergovia Love Babbar DSA Sheet. [GFG Link]	Medium	LC
452	Picking Up Chicks Love Babbar DSA Sheet. [GFG Link]	Medium	LC
453	CHOCOLA –Chocolate Love Babbar DSA Sheet. [GFG Link]	Medium	LC
454	ARRANGE -Arranging Amplifiers Love Babbar DSA Sheet. [GFG Link]	Medium	LC
455	K Centers Problem Love Babbar DSA Sheet. [GFG Link]	Hard	LC
456	Minimum Cost of ropes Love Babbar DSA Sheet. [GFG Link]	Medium	LC
457	Find smallest number with given number of digits and sum of digits Love Babbar DSA Sheet. [GFG Link]	Medium	LC
458	Find maximum sum possible equal sum of three stacks Love Babbar DSA Sheet. [GFG Link]	Medium	LC
1283	Buy Two Chocolates Greedy · NeetCode	Easy	LC
1284	Minimum Number of Moves to Seat Everyone Greedy · NeetCode	Easy	LC
1285	Maximum Odd Binary Number Greedy · NeetCode	Easy	LC
1286	Check if One String Swap Can Make Strings Equal Greedy · NeetCode	Easy	LC
1287	How Many Apples Can You Put into the Basket Greedy · NeetCode	Easy	LC
1288	Minimum Operations to Make Binary Array Elements Equal to One I Greedy · NeetCode	Medium	LC
1289	Buildings With an Ocean View Greedy · NeetCode	Medium	LC
1290	Minimum Length of String After Operations Greedy · NeetCode	Medium	LC
1291	Construct K Palindrome Strings Greedy · NeetCode	Medium	LC
1292	Separate Black and White Balls Greedy · NeetCode	Medium	LC
1293	Minimum Increment to Make Array Unique Greedy · NeetCode	Medium	LC
1294	Maximum Absolute Sum of Any Subarray Greedy · NeetCode	Medium	LC
1295	Maximum Sum Circular Subarray Greedy · NeetCode	Medium	LC
1296	Minimum Swaps to Group All 1's Together II Greedy · NeetCode	Medium	LC
1297	Longest Turbulent Subarray Greedy · NeetCode	Medium	LC
1298	Jump Game VII Greedy · NeetCode	Medium	LC
1299	Minimum Number of Changes to Make Binary String Beautiful Greedy · NeetCode	Medium	LC
1300	Minimize Maximum of Array Greedy · NeetCode	Medium	LC
1301	Maximize Y-Sum by Picking a Triplet of Distinct X-Values Greedy · NeetCode	Medium	LC
1302	Minimum Difference Between Largest and Smallest Value in Three Moves Greedy · NeetCode	Medium	LC
1303	Maximum Total Importance of Roads Greedy · NeetCode	Medium	LC
1304	Minimum Number of Pushes to Type Word II Greedy · NeetCode	Medium	LC
1305	Dota2 Senate Greedy · NeetCode	Medium	LC
1306	Merge Triplets to Form Target Triplet Greedy · NeetCode	Medium	LC
1307	Partition Labels Greedy · NeetCode	Medium	LC
1308	Check if a Parentheses String Can Be Valid Greedy · NeetCode	Medium	LC
1309	Eliminate Maximum Number of Monsters Greedy · NeetCode	Medium	LC
1310	Two City Scheduling Greedy · NeetCode	Medium	LC
1311	Best Sightseeing Pair Greedy · NeetCode	Medium	LC
1312	Make Lexicographically Smallest Array by Swapping Elements Greedy · NeetCode	Medium	LC
1313	Minimum Deletions to Make Character Frequencies Unique Greedy · NeetCode	Medium	LC
1314	Minimum Deletions to Make String Balanced Greedy · NeetCode	Medium	LC
1315	Remove Colored Pieces if Both Neighbors are the Same Color Greedy · NeetCode	Medium	LC
1316	Maximum Score From Removing Substrings Greedy · NeetCode	Medium	LC
1317	Maximum Element After Decreasing and Rearranging Greedy · NeetCode	Medium	LC
1318	Number of Laser Beams in a Bank Greedy · NeetCode	Medium	LC
1319	Reveal Cards In Increasing Order Greedy · NeetCode	Medium	LC
1320	Construct String With Repeat Limit Greedy · NeetCode	Medium	LC
1321	Find Valid Matrix Given Row and Column Sums Greedy · NeetCode	Medium	LC
1322	Score After Flipping Matrix Greedy · NeetCode	Medium	LC
1323	Flip Columns For Maximum Number of Equal Rows Greedy · NeetCode	Medium	LC
1324	Maximum Matrix Sum Greedy · NeetCode	Medium	LC
1325	Make Two Arrays Equal by Reversing Subarrays Greedy · NeetCode	Easy	LC
1326	Shortest Subarray to be Removed to Make Array Sorted Greedy · NeetCode	Medium	LC
1327	Max Chunks To Make Sorted Greedy · NeetCode	Medium	LC
1328	Maximum Swap Greedy · NeetCode	Medium	LC
1329	Maximal Score After Applying K Operations Greedy · NeetCode	Medium	LC
1330	Maximum Frequency After Subarray Operation Greedy · NeetCode	Medium	LC
1331	Put Boxes Into the Warehouse I Greedy · NeetCode	Medium	LC
1332	Put Marbles in Bags Greedy · NeetCode	Hard	LC
1333	Maximum Score of a Good Subarray Greedy · NeetCode	Hard	LC
1334	Find the Maximum Sum of Node Values Greedy · NeetCode	Hard	LC
1335	Minimum Number of Increments on Subarrays to Form a Target Array Greedy · NeetCode	Hard	LC
1336	Apply Operations to Maximize Score Greedy · NeetCode	Hard	LC
1461	Indian Coins Day 33 : Greedy · Apna College	Easy	GFG
1462	Job Scheduling Day 33 : Greedy · Apna College	Medium	GFG

🌳

Step 13: Binary Trees

Step 1354 problems▼

#	Problem	Diff	Platform
459	Binary Tree: Preorder Traversal Root -> Left -> Right	Easy	LC
460	Binary Tree: Inorder Traversal O(1) space using Threaded Binary Tree logic	Easy	LC
461	Binary Tree: Postorder Traversal Left -> Right -> Root	Easy	LC
462	Level Order Traversal BFS using std::queue	Medium	LC
463	Pre-In-Post Traversal in One Pass	Medium	LC
464	Iterative Postorder Traversal (1 Stack)	Hard	LC
465	Maximum Depth of Binary Tree 1 + max(left, right)	Easy	LC
466	Check Balanced Binary Tree Return -1 if unbalanced, else height	Easy	LC
467	Diameter of Binary Tree Update max during height calculation	Easy	LC
468	Binary Tree Maximum Path Sum Ignore negative branches max(0, val)	Hard	LC
469	Same Tree Simultaneous traversal	Easy	LC
470	Zig-Zag Level Order Traversal BFS with leftToRight boolean flag	Medium	LC
471	Boundary Traversal Left boundary + Leaves + Right boundary (reversed)	Medium	LC
472	Vertical Order Traversal Map<Vertical, Map<Level, Multiset>>	Hard	LC
473	Top View of Binary Tree BFS + Map (Store only first node at vertical)	Medium	LC
474	Bottom View of Binary Tree BFS + Map (Continuously update vertical)	Medium	LC
475	Right/Left Side View of BT Recursive depth checking if(level == ds.size())	Medium	LC
476	Symmetric Tree Compare node1->left with node2->right	Easy	LC
477	Lowest Common Ancestor (LCA) Return non-null child	Medium	LC
478	Children Sum Property Modify tree values going down, correct going up	Medium	LC
479	All Nodes at Distance K Parent Pointers mapping + BFS	Medium	LC
480	Minimum Time to Burn Tree Parent Pointers + Multi-source BFS	Hard	LC
481	Count Complete Tree Nodes O(log²N) using left/right height comparison	Medium	LC
482	Construct BT from Preorder & Inorder Hash map for Inorder indices + Recursion	Medium	LC
483	Construct BT from Inorder & Postorder Postorder root is at the end	Medium	LC
484	Serialize & Deserialize Binary Tree String stream and BFS	Hard	LC
485	Flatten BT to Linked List Reverse Postorder traversal trick	Medium	LC
486	Find Duplicate Subtrees	Medium	LC
487	Path Sum II (All Root-to-Leaf Paths)	Medium	LC
488	Sum Root to Leaf Numbers	Medium	LC
489	Maximum Width of Binary Tree	Medium	LC
490	Check Mirror in N-Ary Trees	Easy	GFG
491	Kth Ancestor of a Tree Node	Hard	LC
492	Maximum Difference Between Node and Ancestor	Medium	LC
493	Binary Tree Cameras	Hard	LC
494	Reverse Level Order traversal Love Babbar DSA Sheet. [GFG Link]	Easy	LC
495	Height of a tree Love Babbar DSA Sheet. [GFG Link]	Medium	LC
496	Mirror of a tree Love Babbar DSA Sheet. [GFG Link]	Medium	LC
497	Top View of a tree Love Babbar DSA Sheet. [GFG Link]	Medium	LC
498	Bottom View of a tree Love Babbar DSA Sheet. [GFG Link]	Medium	LC
499	Diagnol Traversal of a Binary tree Love Babbar DSA Sheet. [GFG Link]	Medium	LC
500	Boundary traversal of a Binary tree Love Babbar DSA Sheet. [GFG Link]	Medium	LC
501	Construct Binary Tree from String with Bracket Representation Love Babbar DSA Sheet. [GFG Link]	Medium	LC
502	Convert Binary tree into Sum tree Love Babbar DSA Sheet.	Medium	LC
503	Check if Binary tree is Sum tree or not Love Babbar DSA Sheet. [GFG Link]	Medium	LC
504	Check if all leaf nodes are at same level or not Love Babbar DSA Sheet. [GFG Link]	Medium	LC
505	Sum of Nodes on the Longest path from root to leaf node Love Babbar DSA Sheet. [GFG Link]	Medium	LC
506	Check if given graph is tree or not. [ IMP ] Love Babbar DSA Sheet.	Medium	LC
507	Find Largest subtree sum in a tree Love Babbar DSA Sheet. [GFG Link]	Medium	LC
508	Maximum Sum of nodes in Binary tree such that no two are adjacent Love Babbar DSA Sheet. [GFG Link]	Medium	LC
509	Kth Ancestor of node in a Binary tree Love Babbar DSA Sheet. [GFG Link]	Medium	LC
510	Tree Isomorphism Problem Love Babbar DSA Sheet. [GFG Link]	Hard	LC
511	Convert Binary tree into Sum tree (and a Duplicate) Love Babbar DSA Sheet.	Medium	LC
512	Bonus: Number of nodes that are K distance apart Love Babbar DSA Sheet.	Medium	LC
771	Minimum Distance between Nodes Apna College Placement Series	Easy	LeetCode
772	Subtree of Another Tree Apna College Placement Series	Easy	LeetCode
773	Kth Level of Tree Apna College Placement Series	Medium	LeetCode
1047	N-ary Tree Postorder Traversal Trees · NeetCode	Easy	LC
1048	Merge Two Binary Trees Trees · NeetCode	Easy	LC
1050	Evaluate Boolean Binary Tree Trees · NeetCode	Easy	LC
1052	Binary Tree Vertical Order Traversal Trees · NeetCode	Medium	LC
1053	Binary Tree Longest Consecutive Sequence Trees · NeetCode	Medium	LC
1054	Binary Tree Longest Consecutive Sequence II Trees · NeetCode	Medium	LC
1055	Count Univalue Subtrees Trees · NeetCode	Medium	LC
1056	Maximum Average Subtree Trees · NeetCode	Medium	LC
1057	Find Leaves of Binary Tree Trees · NeetCode	Medium	LC
1060	Clone N-ary Tree Trees · NeetCode	Medium	LC
1061	Find Root of N-Ary Tree Trees · NeetCode	Medium	LC
1062	Diameter of N-Ary Tree Trees · NeetCode	Medium	LC
1063	Nested List Weight Sum II Trees · NeetCode	Medium	LC
1065	Serialize and Deserialize N-ary Tree Trees · NeetCode	Hard	LC
1066	Encode N-ary Tree to Binary Tree Trees · NeetCode	Hard	LC
1067	Create Binary Tree From Descriptions Trees · NeetCode	Medium	LC
1068	Lowest Common Ancestor of a Binary Tree III Trees · NeetCode	Medium	LC
1069	Reverse Odd Levels of Binary Tree Trees · NeetCode	Medium	LC
1070	Minimum Number of Operations to Sort a Binary Tree by Level Trees · NeetCode	Medium	LC
1071	Kth Largest Sum in a Binary Tree Trees · NeetCode	Medium	LC
1072	Cousins in Binary Tree II Trees · NeetCode	Medium	LC
1073	Linked List in Binary Tree Trees · NeetCode	Medium	LC
1074	Construct Quad Tree Trees · NeetCode	Medium	LC
1075	Time Needed to Inform All Employees Trees · NeetCode	Medium	LC
1076	Count Good Nodes In Binary Tree Trees · NeetCode	Medium	LC
1077	Construct Binary Tree from Preorder and Postorder Traversal Trees · NeetCode	Medium	LC
1079	Flip Equivalent Binary Trees Trees · NeetCode	Medium	LC
1080	Operations On Tree Trees · NeetCode	Medium	LC
1081	All Possible Full Binary Trees Trees · NeetCode	Medium	LC
1083	Validate Binary Tree Nodes Trees · NeetCode	Medium	LC
1084	Find Largest Value in Tree Row Trees · NeetCode	Medium	LC
1085	Pseudo-Palindromic Paths in a Binary Tree Trees · NeetCode	Medium	LC
1086	Even Odd Tree Trees · NeetCode	Medium	LC
1087	Smallest String Starting From Leaf Trees · NeetCode	Medium	LC
1088	Delete Leaves With a Given Value Trees · NeetCode	Medium	LC
1089	Delete Nodes And Return Forest Trees · NeetCode	Medium	LC
1090	Distribute Coins in Binary Tree Trees · NeetCode	Medium	LC
1091	Step-By-Step Directions From a Binary Tree Node to Another Trees · NeetCode	Medium	LC
1093	Tree Diameter Trees · NeetCode	Medium	LC
1094	Binary Tree Upside Down Trees · NeetCode	Medium	LC
1095	Recover a Tree From Preorder Traversal Trees · NeetCode	Hard	LC

🌲

Step 14: Binary Search Trees (BST)

Step 1430 problems▼

#	Problem	Diff	Platform
513	Introduction to BST Move left if < val, right if > val	Easy	LC
514	Find Min/Max in BST Traverse absolute left/right	Easy	LC
515	Floor/Ceil in BST	Medium	LC
516	Insert into BST Find leaf position	Medium	LC
517	Delete from BST Reattach children logic	Medium	LC
518	Kth Smallest in BST Inorder traversal is always sorted	Medium	LC
519	Kth Largest in BST	Medium	LC
520	Validate BST Range passing [min, max]	Medium	LC
521	LCA in BST First point where branches split	Easy	LC
522	Construct BST from Preorder Upper bound limit approach	Medium	LC
523	Inorder Successor in BST	Medium	LC
524	BST Iterator Stack pushing left boundaries	Medium	LC
525	Two Sum IV — Input is BST	Easy	LC
526	Recover BST (Two Swapped Nodes) Track prev, first, middle, last in Inorder	Hard	LC
527	Largest BST in Binary Tree Postorder returning (size, min, max)	Hard	LC
528	Serialize/Deserialize BST	Medium	LC
529	Find min and max value in a BST Love Babbar DSA Sheet. [GFG Link]	Medium	GFG
530	Find inorder successor and inorder predecessor in a BST Love Babbar DSA Sheet.	Medium	LC
531	Populate Inorder successor of all nodes Love Babbar DSA Sheet. [GFG Link]	Medium	LC
532	Convert Binary tree into BST Love Babbar DSA Sheet. [GFG Link]	Medium	LC
533	Convert a normal BST into a Balanced BST Love Babbar DSA Sheet. [GFG Link]	Medium	GFG
534	Merge two BST [ V.V.V>IMP ] Love Babbar DSA Sheet. [GFG Link]	Medium	GFG
535	Count pairs from 2 BST whose sum is equal to given value "X" Love Babbar DSA Sheet. [GFG Link]	Medium	GFG
536	Find the median of BST in O(n) time and O(1) space Love Babbar DSA Sheet. [GFG Link]	Medium	LC
537	Count BST ndoes that lie in a given range Love Babbar DSA Sheet. [GFG Link]	Medium	GFG
538	Given "n" appointments, find the conflicting appointments Love Babbar DSA Sheet. [GFG Link]	Medium	LC
539	Check preorder is valid or not Love Babbar DSA Sheet. [GFG Link]	Medium	LC
540	Check whether BST contains Dead end Love Babbar DSA Sheet. [GFG Link]	Medium	LC
541	Largest BST in a Binary Tree [ V.V.V.V.V IMP ] Love Babbar DSA Sheet. [GFG Link]	Medium	GFG
542	Bonus: Unique BSTs Love Babbar DSA Sheet.	Medium	LC
774	Sorted Array to Balanced BST Apna College Placement Series	Easy	LeetCode
775	Populate Next Right Pointers Apna College Placement Series	Medium	LeetCode
776	Flatten BST to Sorted list Apna College Placement Series	Medium	LeetCode
777	Largest BST in BT Apna College Placement Series	Hard	LeetCode
778	Merge 2 BSTS Apna College Placement Series	Hard	LeetCode
1049	Range Sum of BST Trees · NeetCode	Easy	LC
1051	Closest Binary Search Tree Value Trees · NeetCode	Easy	LC
1058	Verify Preorder Sequence in Binary Search Tree Trees · NeetCode	Medium	LC
1059	Two Sum BSTs Trees · NeetCode	Medium	LC
1064	Closest Binary Search Tree Value II Trees · NeetCode	Hard	LC
1078	Unique Binary Search Trees II Trees · NeetCode	Medium	LC
1082	Trim a Binary Search Tree Trees · NeetCode	Medium	LC
1092	Inorder Successor in BST II Trees · NeetCode	Medium	LC

🕸️

Step 15: Graphs [Concepts & Problems]

Step 1584 problems▼

#	Problem	Diff	Platform
543	Graph Representation (Adj List/Matrix)	Easy	GFG
544	BFS Traversal Queue + Visited Array	Easy	GFG
545	DFS Traversal Recursion + Visited Array	Easy	GFG
546	Number of Provinces Connected Components via Traversal	Medium	LC
547	Number of Islands	Medium	LC
548	Flood Fill Algorithm Matrix DFS	Easy	LC
549	Rotten Oranges Multi-source BFS	Medium	LC
550	Detect Cycle — Undirected (BFS) if (adjNode != parent)	Medium	LC
551	0-1 Matrix (Shortest Distance from 0)	Medium	LC
552	Check Bipartite Graph Coloring using 0 and 1	Medium	LC
553	Detect Cycle — Directed (DFS) pathVisited array	Medium	LC
554	Eventual Safe States	Medium	LC
555	Topological Sort (DFS Stack) DFS Stack OR Kahn's Algo (Indegree)	Medium	LC
556	Course Schedule I Kahn's Algorithm / Cycle Detection	Medium	LC
557	Course Schedule II	Medium	LC
558	Alien Dictionary	Hard	LC
559	Shortest Path in Undirected Graph	Medium	LC
560	Shortest Path in DAG Topo Sort + Relaxation	Medium	LC
561	Dijkstra's Algorithm Priority Queue (dist, node)	Medium	LC
562	Shortest Path in Binary Matrix	Medium	LC
563	Path with Minimum Effort	Medium	LC
564	Cheapest Flights within K Stops Queue (stops, node, dist)	Medium	LC
565	Network Delay Time Dijkstra's Algorithm	Medium	LC
566	Number of Ways to Arrive at Destination Dijkstra tracking ways[]	Medium	LC
567	Minimum Multiplications to Reach End Dijkstra with modulo states	Medium	LC
568	Bellman Ford Algorithm Relax all edges N-1 times	Medium	LC
569	Floyd Warshall Algorithm Multi-source shortest path matrix[i][j]	Medium	LC
570	Find City with Smallest Neighbors Floyd Warshall	Medium	LC
571	Minimum Spanning Tree (Prim's) Sort edges + Disjoint Set	Medium	LC
572	Disjoint Set (Union by Rank & Path Compression) Path Compression + Union by Rank/Size	Medium	LC
573	Number of Operations to Connect Network	Medium	LC
574	Accounts Merge	Medium	LC
575	Number of Islands II	Hard	LC
576	Making a Large Island Disjoint Set, change one 0 to 1	Hard	LC
577	Swim in Rising Water Min-Heap / Dijkstra on Grid	Hard	LC
578	Bridges in Graph (Tarjan's) tin[] and low[] time arrays	Hard	LC
579	Articulation Points low[it] >= tin[node] logic	Hard	LC
580	Strongly Connected Components (Kosaraju's) Sort by finish time, reverse graph, DFS	Hard	LC
581	Word Ladder I BFS with char replacement a to z	Hard	LC
582	Word Ladder II BFS for shortest path + DFS to backtrack	Hard	LC
583	Number of Distinct Islands	Medium	LC
584	Redundant Connection	Medium	LC
585	Pacific Atlantic Water Flow	Medium	LC
586	Steps by Knight	Medium	GFG
587	Bipartite Graph Check (DSU)	Medium	LC
588	Most Stones Removed	Medium	LC
589	Satisfiability of Equality Equations	Medium	LC
590	Optimize Water Distribution	Hard	LC
591	Minimum Cost to Connect All Points	Medium	LC
592	Create a Graph, print it Love Babbar DSA Sheet. [GFG Link]	Medium	LC
593	Implement BFS algorithm Love Babbar DSA Sheet. [GFG Link]	Medium	LC
594	Implement DFS Algo Love Babbar DSA Sheet. [GFG Link]	Medium	LC
595	Detect Cycle in Directed Graph using BFS/DFS Algo Love Babbar DSA Sheet. [GFG Link]	Medium	LC
596	Detect Cycle in UnDirected Graph using BFS/DFS Algo Love Babbar DSA Sheet. [GFG Link]	Medium	LC
597	Minimum Step by Knight Love Babbar DSA Sheet. [GFG Link]	Medium	LC
598	Clone a graph Love Babbar DSA Sheet. [GFG Link]	Medium	LC
599	Dijkstra algo Love Babbar DSA Sheet. [GFG Link]	Medium	LC
600	Implement Topological Sort Love Babbar DSA Sheet. [GFG Link]	Medium	LC
601	Minimum time taken by each job to be completed given by a Directed Acyclic Graph Love Babbar DSA Sheet. [GFG Link]	Medium	GFG
602	Find whether it is possible to finish all tasks or not from given dependencies Love Babbar DSA Sheet. [GFG Link]	Medium	LC
603	Find the no. of Isalnds Love Babbar DSA Sheet. [GFG Link]	Medium	LC
604	Given a sorted Dictionary of an Alien Language, find order of characters Love Babbar DSA Sheet. [GFG Link]	Medium	LC
605	Implement Kruksal’sAlgorithm Love Babbar DSA Sheet. [GFG Link]	Medium	LC
606	Implement Prim’s Algorithm Love Babbar DSA Sheet. [GFG Link]	Medium	LC
607	Total no. of Spanning tree in a graph Love Babbar DSA Sheet. [GFG Link]	Medium	LC
608	Implement Bellman Ford Algorithm Love Babbar DSA Sheet. [GFG Link]	Medium	LC
609	Implement Floyd warshallAlgorithm Love Babbar DSA Sheet. [GFG Link]	Medium	LC
610	Travelling Salesman Problem Love Babbar DSA Sheet. [GFG Link]	Hard	LC
611	Graph ColouringProblem Love Babbar DSA Sheet. [GFG Link]	Medium	LC
612	Snake and Ladders Problem Love Babbar DSA Sheet. [GFG Link]	Medium	LC
613	Find bridge in a graph Love Babbar DSA Sheet. [GFG Link]	Hard	LC
614	Count Strongly connected Components(Kosaraju Algo) Love Babbar DSA Sheet. [GFG Link]	Hard	LC
615	Check whether a graph is Bipartite or Not Love Babbar DSA Sheet. [GFG Link]	Medium	LC
616	Detect Negative cycle in a graph Love Babbar DSA Sheet. [GFG Link]	Medium	GFG
617	Longest path in a Directed Acyclic Graph Love Babbar DSA Sheet. [GFG Link]	Medium	LC
618	Journey to the Moon Love Babbar DSA Sheet. [GFG Link]	Medium	LC
619	Oliver and the Game Love Babbar DSA Sheet. [GFG Link]	Medium	LC
620	Water Jug problem using BFS Love Babbar DSA Sheet. [GFG Link]	Hard	LC
621	Minimum edges to reverse o make path from source to destination Love Babbar DSA Sheet. [GFG Link]	Easy	LC
622	Paths to travel each nodes using each edge(Seven Bridges) Love Babbar DSA Sheet. [GFG Link]	Hard	LC
623	Vertex Cover Problem Love Babbar DSA Sheet. [GFG Link]	Medium	LC
624	Chinese Postman or Route Inspection Love Babbar DSA Sheet. [GFG Link]	Medium	LC
625	Number of Triangles in a Directed and Undirected Graph Love Babbar DSA Sheet. [GFG Link]	Medium	LC
626	Two Clique Problem Love Babbar DSA Sheet. [GFG Link]	Medium	LC
780	Detect cycle in directed using BFS Apna College Placement Series	Medium	LeetCode
781	Kosaraju Strongly Connected Components Apna College Placement Series	Medium	LeetCode
782	Dijkstra's Algorithm Apna College Placement Series	Hard	LeetCode
783	Unbounded Knapsack Apna College Placement Series	Medium	LeetCode
784	Longest Common Substring Apna College Placement Series	Medium	LeetCode
1155	Island Perimeter Graphs · NeetCode	Easy	LC
1156	Find the Town Judge Graphs · NeetCode	Easy	LC
1157	Count Servers that Communicate Graphs · NeetCode	Medium	LC
1158	Find Champion II Graphs · NeetCode	Medium	LC
1159	Max Area of Island Graphs · NeetCode	Medium	LC
1160	Maximum Number of Fish in a Grid Graphs · NeetCode	Medium	LC
1161	Walls And Gates Graphs · NeetCode	Medium	LC
1162	Count Sub Islands Graphs · NeetCode	Medium	LC
1163	Surrounded Regions Graphs · NeetCode	Medium	LC
1164	Reorder Routes to Make All Paths Lead to The City Zero Graphs · NeetCode	Medium	LC
1165	Open The Lock Graphs · NeetCode	Medium	LC
1166	Course Schedule IV Graphs · NeetCode	Medium	LC
1167	Shortest Bridge Graphs · NeetCode	Medium	LC
1168	Find Closest Node to Given Two Nodes Graphs · NeetCode	Medium	LC
1169	As Far from Land as Possible Graphs · NeetCode	Medium	LC
1170	Shortest Path with Alternating Colors Graphs · NeetCode	Medium	LC
1171	Minimum Fuel Cost to Report to the Capital Graphs · NeetCode	Medium	LC
1172	Minimum Score of a Path Between Two Cities Graphs · NeetCode	Medium	LC
1173	Number of Closed Islands Graphs · NeetCode	Medium	LC
1174	Number of Enclaves Graphs · NeetCode	Medium	LC
1175	Regions Cut By Slashes Graphs · NeetCode	Medium	LC
1176	Minimum Number of Vertices to Reach all Nodes Graphs · NeetCode	Medium	LC
1177	Count the Number of Complete Components Graphs · NeetCode	Medium	LC
1178	Evaluate Division Graphs · NeetCode	Medium	LC
1179	Detonate the Maximum Bombs Graphs · NeetCode	Medium	LC
1180	Find All Possible Recipes from Given Supplies Graphs · NeetCode	Medium	LC
1181	Shortest Distance After Road Addition Queries I Graphs · NeetCode	Medium	LC
1182	Most Profitable Path in a Tree Graphs · NeetCode	Medium	LC
1183	Kill Process Graphs · NeetCode	Medium	LC
1184	All Paths from Source Lead to Destination Graphs · NeetCode	Medium	LC
1185	Web Crawler Graphs · NeetCode	Medium	LC
1186	Parallel Courses Graphs · NeetCode	Medium	LC
1187	The Maze Graphs · NeetCode	Medium	LC
1188	The Maze II Graphs · NeetCode	Medium	LC
1189	Minimum Knight Moves Graphs · NeetCode	Medium	LC
1190	The Maze III Graphs · NeetCode	Hard	LC
1191	Shortest Distance from All Buildings Graphs · NeetCode	Hard	LC
1192	Nested List Weight Sum Graphs · NeetCode	Medium	LC
1193	Maximum Number of Points From Grid Queries Graphs · NeetCode	Hard	LC
1194	Maximum Number of K-Divisible Components Graphs · NeetCode	Hard	LC
1195	Sliding Puzzle Graphs · NeetCode	Hard	LC
1196	Largest Color Value in a Directed Graph Graphs · NeetCode	Hard	LC
1197	Minimum Number of Days to Eat N Oranges Graphs · NeetCode	Hard	LC
1198	Find All People With Secret Graphs · NeetCode	Hard	LC
1199	Parallel Courses III Graphs · NeetCode	Hard	LC
1200	Number of Distinct Islands II Graphs · NeetCode	Hard	LC
1201	Sentence Similarity II Graphs · NeetCode	Medium	LC
1202	Path with Maximum Probability Advanced Graphs · NeetCode	Medium	LC
1203	Find the Safest Path in a Grid Advanced Graphs · NeetCode	Medium	LC
1204	Trapping Rain Water II Advanced Graphs · NeetCode	Hard	LC
1205	Minimum Obstacle Removal to Reach Corner Advanced Graphs · NeetCode	Hard	LC
1206	Minimum Time to Visit a Cell In a Grid Advanced Graphs · NeetCode	Hard	LC
1207	Minimum Cost to Convert String I Advanced Graphs · NeetCode	Medium	LC
1208	Sequence Reconstruction Advanced Graphs · NeetCode	Medium	LC
1209	Minimum Cost Walk in Weighted Graph Advanced Graphs · NeetCode	Hard	LC
1210	Maximum Employees to Be Invited to a Meeting Advanced Graphs · NeetCode	Hard	LC
1211	Remove Max Number of Edges to Keep Graph Fully Traversable Advanced Graphs · NeetCode	Hard	LC
1212	Minimum Number of Days to Disconnect Island Advanced Graphs · NeetCode	Hard	LC
1213	Second Minimum Time to Reach Destination Advanced Graphs · NeetCode	Hard	LC
1214	Find Minimum Diameter After Merging Two Trees Advanced Graphs · NeetCode	Hard	LC
1215	Bus Routes Advanced Graphs · NeetCode	Hard	LC
1216	Build a Matrix With Conditions Advanced Graphs · NeetCode	Hard	LC
1217	Greatest Common Divisor Traversal Advanced Graphs · NeetCode	Hard	LC
1218	Divide Nodes Into the Maximum Number of Groups Advanced Graphs · NeetCode	Hard	LC
1458	Topological Sorting (DFS) Day 26 : Graphs (Part 2) · Apna College	Medium	GFG

💡

Step 16: Dynamic Programming

Step 16100 problems▼

#	Problem	Diff	Platform
627	Climbing Stairs Fibonacci mapping dp[i-1] + dp[i-2]	Easy	LC
628	Frog Jump (DP-3) 1D DP minimization	Easy	GFG
629	Frog Jump with K Distances (DP-4)	Medium	LC
630	Max Sum of Non-Adjacent Elements — House Robber Pick / Non-Pick (Cannot pick adjacent)	Medium	LC
631	House Robber II (Circular)	Medium	LC
632	Ninja's Training 2D DP dp[day][last_task]	Medium	LC
633	Min Cost Climbing Stairs	Easy	LC
634	Decode Ways	Medium	LC
635	Unique Paths in Grid 2D DP Grid traversal	Medium	LC
636	Unique Paths with Obstacles	Medium	LC
637	Minimum Path Sum 2D DP Grid optimization	Medium	LC
638	Triangle (Min Path Sum) Bottom-Up 2D DP	Medium	LC
639	Min Falling Path Sum Grid DP starting from any cell in row 0	Medium	LC
640	Min Falling Path Sum II	Hard	LC
641	Cherry Pickup II (3D DP)	Hard	LC
642	Subset Sum Equal to Target 2D DP Pick/Non-Pick	Medium	LC
643	Partition Equal Subset Sum Target Sum = Total/2	Medium	LC
644	Partition with Minimum Difference	Medium	LC
645	Count Subsets with Sum K Handle zeroes carefully	Medium	LC
646	Target Sum (Count Partitions with Diff) Math transformation to Subset Sum	Medium	LC
647	0/1 Knapsack Weight vs Value state DP	Medium	LC
648	Coin Change (Min Coins) Unbounded Knapsack	Medium	LC
649	Coin Change II (Count Ways) Unbounded Knapsack variant	Medium	LC
650	Unbounded Knapsack Same item picked multiple times	Medium	LC
651	Rod Cutting Problem 1D Unbounded Knapsack	Medium	LC
652	Longest Common Subsequence (LCS) String Matching DP dp[i][j]	Medium	LC
653	Print LCS	Medium	LC
654	Longest Common Substring Reset to 0 when chars don't match	Medium	LC
655	Longest Palindromic Subsequence LCS of string and its reverse	Medium	LC
656	Min Insertions to Make Palindrome Len - Longest Palindromic Subsequence	Hard	LC
657	Min Insertions/Deletions to Convert String	Medium	LC
658	Shortest Common Supersequence	Medium	LC
659	Edit Distance Insert/Delete/Replace String DP	Hard	LC
660	Wildcard Matching Handle * and ? logic	Hard	LC
661	Distinct Subsequences String Matching DP dp[i][j] = dp[i-1][j-1] + dp[i-1][j]	Hard	LC
662	Stock Buy Sell II (Infinite) Infinite transactions greedy/DP	Medium	LC
663	Stock Buy Sell III (At Most 2) At most 2 transactions	Hard	LC
664	Stock Buy Sell IV (At Most K) At most K transactions	Hard	LC
665	Stock with Cooldown Skip a day after selling	Medium	LC
666	Stock with Transaction Fee Subtract fee on sell	Medium	LC
667	LIS (Longest Increasing Subsequence) Binary Search std::lower_bound O(N log N)	Medium	LC
668	Largest Divisible Subset Sort array + LIS logic	Medium	LC
669	Longest String Chain Sort by length + LIS logic	Medium	LC
670	Longest Bitonic Subsequence LIS(left) + LIS(right) - 1	Hard	LC
671	Number of LIS Track count[] alongside dp[]	Medium	LC
672	Matrix Chain Multiplication Partition DP dp[i][j] = min(dp[i][k] + dp[k+1][j] + cost)	Hard	LC
673	Minimum Cost to Cut a Stick Sort cuts + MCM pattern	Hard	LC
674	Burst Balloons Think in reverse (last balloon to burst)	Hard	LC
675	Palindrome Partitioning II (Min Cuts) Front partition DP	Hard	LC
676	Partition Array for Max Sum Front partition DP with limit K	Medium	LC
677	Evaluate Boolean Expression to True 3D DP (i, j, isTrue)	Hard	LC
678	Maximal Square min(top, left, top-left) + 1	Medium	LC
679	Word Break	Medium	LC
680	Count Square Submatrices with All Ones	Medium	LC
681	Coin ChangeProblem Love Babbar DSA Sheet. [GFG Link]	Medium	LC
682	Knapsack Problem Love Babbar DSA Sheet. [GFG Link]	Medium	GFG
683	Binomial CoefficientProblem Love Babbar DSA Sheet. [GFG Link]	Medium	LC
684	Permutation CoefficientProblem Love Babbar DSA Sheet. [GFG Link]	Medium	LC
685	Program for nth Catalan Number Love Babbar DSA Sheet. [GFG Link]	Medium	LC
686	Friends Pairing Problem Love Babbar DSA Sheet. [GFG Link]	Medium	LC
687	Gold Mine Problem Love Babbar DSA Sheet. [GFG Link]	Medium	LC
688	Assembly Line SchedulingProblem Love Babbar DSA Sheet. [GFG Link]	Medium	LC
689	Painting the Fenceproblem Love Babbar DSA Sheet. [GFG Link]	Medium	LC
690	Maximize The Cut Segments Love Babbar DSA Sheet. [GFG Link]	Medium	LC
691	Longest Increasing Subsequence Love Babbar DSA Sheet. [GFG Link]	Medium	LC
692	Space Optimized Solution of LCS Love Babbar DSA Sheet. [GFG Link]	Medium	LC
693	LCS (Longest Common Subsequence) of three strings Love Babbar DSA Sheet. [GFG Link]	Medium	LC
694	Maximum Sum Increasing Subsequence Love Babbar DSA Sheet. [GFG Link]	Medium	LC
695	Count all subsequences having product less than K Love Babbar DSA Sheet. [GFG Link]	Medium	LC
696	Longest subsequence such that difference between adjacent is one Love Babbar DSA Sheet. [GFG Link]	Medium	LC
697	Maximum subsequence sum such that no three are consecutive Love Babbar DSA Sheet. [GFG Link]	Medium	LC
698	Egg Dropping Problem Love Babbar DSA Sheet. [GFG Link]	Medium	LC
699	Maximum Length Chain of Pairs Love Babbar DSA Sheet. [GFG Link]	Medium	LC
700	Maximum size square sub-matrix with all 1s Love Babbar DSA Sheet. [GFG Link]	Medium	LC
701	Maximum sum of pairs with specific difference Love Babbar DSA Sheet. [GFG Link]	Medium	LC
702	Min Cost PathProblem Love Babbar DSA Sheet. [GFG Link]	Medium	LC
703	Maximum difference of zeros and ones in binary string Love Babbar DSA Sheet. [GFG Link]	Medium	LC
704	Minimum cost to fill given weight in a bag Love Babbar DSA Sheet. [GFG Link]	Medium	LC
705	Minimum removals from array to make max –min <= K Love Babbar DSA Sheet. [GFG Link]	Medium	LC
706	Count number of ways to reacha given score in a game Love Babbar DSA Sheet. [GFG Link]	Medium	LC
707	Count Balanced Binary Trees of Height h Love Babbar DSA Sheet. [GFG Link]	Medium	LC
708	Smallest sum contiguous subarray Love Babbar DSA Sheet. [GFG Link]	Medium	LC
709	Unbounded Knapsack (Repetition of items allowed) Love Babbar DSA Sheet. [GFG Link]	Medium	LC
710	Largest Independent Set Problem Love Babbar DSA Sheet. [GFG Link]	Hard	LC
711	Longest alternating subsequence Love Babbar DSA Sheet. [GFG Link]	Medium	LC
712	Weighted Job Scheduling Love Babbar DSA Sheet. [GFG Link]	Medium	LC
713	Coin game winner where every player has three choices Love Babbar DSA Sheet. [GFG Link]	Medium	LC
714	Count Derangements (Permutation such that no element appears in its original position) [ IMPORTANT ] Love Babbar DSA Sheet. [GFG Link]	Medium	GFG
715	Optimal Strategy for a Game Love Babbar DSA Sheet. [GFG Link]	Medium	LC
716	Optimal Binary Search Tree Love Babbar DSA Sheet. [GFG Link]	Medium	LC
717	Palindrome PartitioningProblem Love Babbar DSA Sheet. [GFG Link]	Medium	LC
718	Mobile Numeric Keypad Problem [ IMP ] Love Babbar DSA Sheet. [GFG Link]	Medium	GFG
719	Boolean Parenthesization Problem Love Babbar DSA Sheet. [GFG Link]	Hard	LC
720	Largest rectangular sub-matrix whose sum is 0 Love Babbar DSA Sheet. [GFG Link]	Medium	LC
721	Largest area rectangular sub-matrix with equal number of 1’s and 0’s [ IMP ] Love Babbar DSA Sheet. [GFG Link]	Medium	LC
722	Maximum sum rectangle in a 2D matrix Love Babbar DSA Sheet. [GFG Link]	Medium	LC
723	Maximum profit by buying and selling a share at most k times Love Babbar DSA Sheet. [GFG Link]	Medium	LC
724	Find if a string is interleaved of two other strings Love Babbar DSA Sheet. [GFG Link]	Medium	LC
725	Maximum Length of Pair Chain Love Babbar DSA Sheet. [GFG Link]	Medium	LC
726	Bonus: Perfect Squares Love Babbar DSA Sheet.	Medium	LC
1219	N-th Tribonacci Number 1-D Dynamic Programming · NeetCode	Easy	LC
1220	Paint House 1-D Dynamic Programming · NeetCode	Medium	LC
1221	Paint Fence 1-D Dynamic Programming · NeetCode	Medium	LC
1222	4 Keys Keyboard 1-D Dynamic Programming · NeetCode	Medium	LC
1223	Handshakes That Don't Cross 1-D Dynamic Programming · NeetCode	Hard	LC
1224	Palindromic Substrings 1-D Dynamic Programming · NeetCode	Medium	LC
1225	Triangle 1-D Dynamic Programming · NeetCode	Medium	LC
1226	Delete And Earn 1-D Dynamic Programming · NeetCode	Medium	LC
1227	Filling Bookcase Shelves 1-D Dynamic Programming · NeetCode	Medium	LC
1228	Combination Sum IV 1-D Dynamic Programming · NeetCode	Medium	LC
1229	Check if There is a Valid Partition For The Array 1-D Dynamic Programming · NeetCode	Medium	LC
1230	Integer Break 1-D Dynamic Programming · NeetCode	Medium	LC
1231	Russian Doll Envelopes 1-D Dynamic Programming · NeetCode	Hard	LC
1232	Stickers to Spell Word 1-D Dynamic Programming · NeetCode	Hard	LC
1233	Uncrossed Lines 1-D Dynamic Programming · NeetCode	Medium	LC
1234	Solving Questions With Brainpower 1-D Dynamic Programming · NeetCode	Medium	LC
1235	Count Ways to Build Good Strings 1-D Dynamic Programming · NeetCode	Medium	LC
1236	Ugly Number II 1-D Dynamic Programming · NeetCode	Medium	LC
1237	New 21 Game 1-D Dynamic Programming · NeetCode	Medium	LC
1238	Best Team with no Conflicts 1-D Dynamic Programming · NeetCode	Medium	LC
1239	Knight Dialer 1-D Dynamic Programming · NeetCode	Medium	LC
1240	Count Strictly Increasing Subarrays 1-D Dynamic Programming · NeetCode	Medium	LC
1241	Sentence Screen Fitting 1-D Dynamic Programming · NeetCode	Medium	LC
1242	Stone Game III 1-D Dynamic Programming · NeetCode	Hard	LC
1243	Concatenated Words 1-D Dynamic Programming · NeetCode	Hard	LC
1244	Maximize Score after N Operations 1-D Dynamic Programming · NeetCode	Hard	LC
1245	Find the Longest Valid Obstacle Course at Each Position 1-D Dynamic Programming · NeetCode	Hard	LC
1246	Count all Valid Pickup and Delivery Options 1-D Dynamic Programming · NeetCode	Hard	LC
1247	Number of Ways to Divide a Long Corridor 1-D Dynamic Programming · NeetCode	Hard	LC
1248	Maximum Sum of 3 Non-Overlapping Subarrays 1-D Dynamic Programming · NeetCode	Hard	LC
1249	Student Attendance Record II 1-D Dynamic Programming · NeetCode	Hard	LC
1250	Optimal Account Balancing 1-D Dynamic Programming · NeetCode	Hard	LC
1251	Valid Palindrome III 1-D Dynamic Programming · NeetCode	Hard	LC
1252	Encode String with Shortest Length 1-D Dynamic Programming · NeetCode	Hard	LC
1253	Coin Path 1-D Dynamic Programming · NeetCode	Hard	LC
1254	Maximum Number of Points with Cost 2-D Dynamic Programming · NeetCode	Medium	LC
1255	Length of Longest Fibonacci Subsequence 2-D Dynamic Programming · NeetCode	Medium	LC
1256	Last Stone Weight II 2-D Dynamic Programming · NeetCode	Medium	LC
1257	Interleaving String 2-D Dynamic Programming · NeetCode	Medium	LC
1258	Stone Game 2-D Dynamic Programming · NeetCode	Medium	LC
1259	Stone Game II 2-D Dynamic Programming · NeetCode	Medium	LC
1260	Ones and Zeroes 2-D Dynamic Programming · NeetCode	Medium	LC
1261	2 Keys Keyboard 2-D Dynamic Programming · NeetCode	Medium	LC
1262	Maximum Alternating Subsequence Sum 2-D Dynamic Programming · NeetCode	Medium	LC
1263	Number of Dice Rolls with Target Sum 2-D Dynamic Programming · NeetCode	Medium	LC
1264	Minimum Falling Path Sum 2-D Dynamic Programming · NeetCode	Medium	LC
1265	Out of Boundary Paths 2-D Dynamic Programming · NeetCode	Medium	LC
1266	Count Number of Teams 2-D Dynamic Programming · NeetCode	Medium	LC
1267	Count Vowels Permutation 2-D Dynamic Programming · NeetCode	Hard	LC
1268	Number of Ways to Rearrange Sticks With K Sticks Visible 2-D Dynamic Programming · NeetCode	Hard	LC
1269	Flip String to Monotone Increasing 2-D Dynamic Programming · NeetCode	Medium	LC
1270	Maximum Value of K Coins from Piles 2-D Dynamic Programming · NeetCode	Hard	LC
1271	Number of Music Playlists 2-D Dynamic Programming · NeetCode	Hard	LC
1272	Profitable Schemes 2-D Dynamic Programming · NeetCode	Hard	LC
1273	Painting the Walls 2-D Dynamic Programming · NeetCode	Hard	LC
1274	Number of Ways to Stay in the Same Place After Some Steps 2-D Dynamic Programming · NeetCode	Hard	LC
1275	String Compression II 2-D Dynamic Programming · NeetCode	Hard	LC
1276	Minimum Difficulty of a Job Schedule 2-D Dynamic Programming · NeetCode	Hard	LC
1277	Arithmetic Slices II 2-D Dynamic Programming · NeetCode	Hard	LC
1278	K Inverse Pairs Array 2-D Dynamic Programming · NeetCode	Hard	LC
1279	Cherry Pickup 2-D Dynamic Programming · NeetCode	Hard	LC
1280	Freedom Trail 2-D Dynamic Programming · NeetCode	Hard	LC
1281	Split Array With Same Average 2-D Dynamic Programming · NeetCode	Hard	LC
1282	Paint House II 2-D Dynamic Programming · NeetCode	Hard	LC
1459	Nth Catalan Day 31 : DP (Part 3) · Apna College	Medium	GFG
1460	MCM Day 31 : DP (Part 3) · Apna College	Hard	GFG

🔡

Step 17: Tries

Step 1712 problems▼

#	Problem	Diff	Platform
727	Implement Trie I Array of pointers TrieNode* links[26]	Medium	LC
728	Implement Trie II (countPrefix & countEndsWith)	Medium	LC
729	Longest String with All Prefixes	Medium	LC
730	Number of Distinct Substrings	Hard	LC
731	Design Add & Search Words	Medium	LC
732	Word Search II (Trie + BT)	Hard	LC
733	Maximum XOR of Two Numbers in Array Bit-level Trie (0 and 1 pointers)	Medium	LC
734	Construct a trie from scratch Love Babbar DSA Sheet. [GFG Link]	Medium	LC
735	Find shortest unique prefix for every word in a given list Love Babbar DSA Sheet. [GFG Link]	Medium	LC
736	Word Break Problem \| (Trie solution) Love Babbar DSA Sheet. [GFG Link]	Medium	LC
737	Implement a Phone Directory Love Babbar DSA Sheet. [GFG Link]	Medium	LC
738	Print unique rows in a given boolean matrix Love Babbar DSA Sheet. [GFG Link]	Medium	LC
779	Longest String with All Prefix Apna College Placement Series	Medium	LeetCode
1147	Count Prefix and Suffix Pairs I Tries · NeetCode	Easy	LC
1148	Remove Sub-Folders from the Filesystem Tries · NeetCode	Medium	LC
1149	Extra Characters in a String Tries · NeetCode	Medium	LC
1150	Design File System Tries · NeetCode	Medium	LC
1151	Sum of Prefix Scores of Strings Tries · NeetCode	Hard	LC
1152	Count Prefix and Suffix Pairs II Tries · NeetCode	Hard	LC
1153	Design In-Memory File System Tries · NeetCode	Hard	LC
1154	Design Search Autocomplete System Tries · NeetCode	Hard	LC

🧵

Step 18: Advanced Strings [Pattern Matching]

Step 188 problems▼

#	Problem	Diff	Platform
739	KMP Algorithm / Implement strStr() Rolling Hash / Prime modulo	Hard	LC
740	Z-Algorithm Z-array computation	Hard	LC
741	Shortest Palindrome (KMP)	Hard	LC
742	Longest Happy Prefix (KMP)	Hard	LC
743	Count and Say String manipulation & recursion	Medium	LC
744	Compare Version Numbers String parsing and stringstream	Medium	LC
745	String Matching in an Array	Easy	LC
746	Minimum Add to Make Parentheses Valid Stack optimization	Medium	LC
1456	Robin-Karp Algorithm Day 7 : Strings (Part 2) · Apna College	Hard	GFG

🔥

Activity Log & Contribution Heatmap

🔥 0-Day Streak · 0 Solves ▾

0 d

🔥 Current Streak

0 d

⚡ Longest Streak

📅 Active Days

🏆 Solves Logged

0 contributions in 2026

⚡ Recent Activity Stream 0 events

Striver vs Love Babbar: Which DSA Sheet is Best? 450 DSA Comparison

A comprehensive guide and head-to-head comparison between Striver's A2Z DSA Sheet (460 problems) and Love Babbar's 450 DSA Sheet (453 problems). Understand the differences in problem curation, learning style, and why using our unified 1,464-problem interactive tracker gives you the ultimate competitive edge for FAANG and top-tier product company interviews.

Striver vs Love Babbar The Verdict

Striver A2Z is built around an 18-step algorithmic pattern curriculum—perfect for building conceptual intuition from scratch. Love Babbar 450 is a legendary collection of high-frequency campus placement and service-to-product interview questions. With DSA Tracker, you don't have to choose: practice both sheets seamlessly with zero redundant duplicates!

Striver A2Z: 460 Pattern-Based Questions
Love Babbar 450: 453 Placement-Focused Questions
Combined Master: 1,464 Unique Curated Problems
100% Verified LeetCode & GFG Direct Links

Striver 450 vs Striver 190 SDE Sheet

Students often search for the "Striver 450 sheet", which refers to the full 460-problem A2Z curriculum spanning every fundamental data structure. In contrast, the Striver 190 (SDE Sheet) is a condensed, high-yield subset designed for intensive 30-day revision before upcoming tech rounds. Both tracks are fully searchable with instant progress tracking.

460 Problems for Full Conceptual Mastery
190 Problems for High-Frequency SDE Revision
Step-by-Step Logic from Arrays to Hard Dynamic Programming
Direct LeetCode Practice & Solutions

Interactive 450 Tracker vs Excel Sheets

Traditional Love Babbar 450 Excel sheets and Google Sheets are static, cumbersome on mobile, and prone to losing your progress. DSA Tracker is a modern, lightweight web application with instant 1-click checkboxes, local offline storage, real-time MongoDB cloud synchronization, and responsive dark mode.

Instant Auto-Save to Browser LocalStorage
Real-Time Multi-Device Cloud Backup
One-Click Problem Links (No Broken URLs)
Built-In Streak Tracking & Activity Heatmaps

DSA Revision Tracker & Spaced Repetition

Solving problems once isn't enough—retaining algorithmic patterns is what cracks technical interviews. Use our integrated revision workflow: bookmark difficult problems with the star (⭐) button, log Big-O time/space complexity notes (📝), and filter your starred revision list right before interview day.

⭐ Star Problems for Targeted Revision
📝 In-App Big-O Complexity & Edge Case Notes
Instant Filter: View Only Starred or Unsolved Problems
Seamless LeetGitSyncPro Chrome Extension Integration

Feature / Parameter	DSA Tracker (Combined Master)	Striver A2Z Sheet	Love Babbar 450 Sheet	NeetCode 150 / 250	Blind 75
Total Unique Problems	1,464	460	453	150 / 250	75
Eliminates Duplicates Programmatically	Yes (100% Unique)	N/A (Base)	N/A (Base)	N/A	N/A
Format & Layout	Interactive Web App + Extension Sync	Interactive Web UI	Static Sheet / Excel	Interactive Web UI	Static List
Real-Time Cloud & Offline Sync	Yes (MongoDB + LocalStorage)	Yes	No (Manual)	Yes	No
Spaced Repetition Revision Tracker	Yes (Starred ⭐ & Notes 📝)	Partial	No	Partial	No
Comprehensive Topic Coverage	Exhaustive (18 Steps)	Very High (18 Steps)	High (Topic-Wise)	Focused (Core Patterns)	Minimal (Crash Course)
Direct Practice Platforms	100% Verified LeetCode & GFG	LeetCode & GFG	GFG & LeetCode	LeetCode Only	LeetCode Only

Looking for Algorithmic Patterns & Big-O Cheat Sheets?

Explore our complete curriculum-grade 18-step DSA Roadmap with 14 algorithmic patterns, Big-O tables, and 90-day FAANG study plan.

🗺️ Read 18-Step DSA Roadmap →

❓ Frequently Asked Questions — DSA Sheet Tracker

Striver vs Love Babbar: Which DSA sheet is better for interview preparation?

Both sheets serve distinct strategic purposes. Striver's A2Z DSA Sheet (460 problems) is organized into an 18-step pattern-based progression, teaching the step-by-step logic required for deep problem-solving from scratch. Love Babbar's 450 DSA Sheet (453 problems) is a time-tested collection of classic, high-yield interview questions frequently asked during campus hiring and top-tier product company rounds. On DSA Tracker, we combine both sheets into a unified 1,464-problem roadmap with 0 duplicate questions, allowing you to practice both sheets together or toggle between them seamlessly.

What is the difference between Striver 450 (A2Z) and Striver 190 (SDE Sheet)?

Striver's A2Z DSA Sheet contains 460 comprehensive problems covering every fundamental topic from basic math and hashing to hard Dynamic Programming and Tries (often searched as the "Striver 450 sheet"). The Striver 190 (SDE Sheet) is a condensed, high-yield 190-problem subset tailored specifically for rapid revision during the final 30 to 45 days before coding rounds. Both sheets are fully indexed with direct LeetCode links on DSA Tracker.

Why use this interactive 450 DSA Tracker instead of a Love Babbar Excel sheet?

Static Excel and Google Sheets suffer from unsaved edits, poor mobile responsiveness, and dead links. DSA Tracker provides a modern, interactive web alternative featuring: automatic browser localStorage saving, real-time MongoDB cloud backup across all your devices, verified 1-click LeetCode & GFG links, dark mode, Big-O notes (📝), and GitHub-style contribution streak heatmaps.

How does the DSA Revision Tracker work for technical interviews?

Retaining solutions is critical for technical interviews. Our built-in DSA Revision Tracker allows you to star (⭐) challenging problems as you practice. You can also click the note icon (📝) to write your personal intuition, optimal approach, and Big-O time and space complexity. When your interview approaches, simply filter by starred problems to review high-impact questions in record time.

Does this tracker include direct LeetCode and GeeksforGeeks links?

Yes! Every single question across Striver A2Z (460), Love Babbar 450 (453), NeetCode (250/150), and Apna College (184) features 100% verified clickable links pointing directly to LeetCode, GeeksforGeeks (GFG), and Coding Ninjas problem pages.

How does this sheet compare to Blind 75, NeetCode 150, and Apna College DSA sheets?

Blind 75 and NeetCode 150 are great short-term cheat sheets (2-3 weeks). However, they lack the variety needed to tackle unseen, complex problems at top tech companies. Our 1,464-problem combined tracker encompasses all core problems found in Blind 75, NeetCode 150, NeetCode 250, Apna College (Shradha Khapra & Aman Dhattarwal), Coder Army (Rohit Negi), and Fraz DSA sheets, giving you an all-in-one preparation hub.

Can I practice coding in languages other than C++?

Yes! While problem titles and descriptions follow standard algorithmic notation, all questions link directly to LeetCode and GeeksforGeeks where you can write and submit solutions in Java, Python, C++, JavaScript, TypeScript, Go, Rust, or C#.

Striver + Love Babbar DSA Tracker

450 DSA Tracker — Striver A2Z & Love Babbar DSA Sheet