Back to Sheets

6 Month DSA Practice Sheet

Ultimate comprehensive DSA journey

84 Easy119 Medium33 Hard
0 of 236 solved0%

Sign in to save your progress and see it on your dashboard.

Showing 236 of 236 problems

01Running Sum of 1d Arrayeasy
02Richest Customer Wealtheasy
03Contains Duplicateeasy
04Find Numbers with Even Number of Digitseasy
05Insertion Sort Listeasy
06Merge Sorted Arrayeasy
07Sort an Arrayeasy
08Sort an Arrayeasy
09Sort an Arrayeasy
10Squares of a Sorted Arrayeasy
11Max Consecutive Oneseasy
12Arithmetic Sliceseasy
13Maximum Subarrayeasy
14Pascal's Triangleeasy
15Set Matrix Zeroesmedium
16Rotate Imagemedium
17Merge Intervalsmedium
18Kth Largest Element in an Arraymedium
19Next Permutationhard
20Count Inversionsmedium
21Contains Duplicateeasy
22Find First and Last Position of Element in Sorted Arrayeasy
23Count Negative Numbers in a Sorted Matrixeasy
24Search Insert Positioneasy
25Valid Perfect Squareeasy
26Search in Rotated Sorted Arraymedium
27Sqrt(x)easy
28Search a 2D Matrixmedium
29Median of Two Sorted Arrayshard
30Remove Elementeasy
31Two Sum II - Input Array Is Sortedeasy
32Subarray Sum Equals Keasy
33Remove Duplicates from Sorted Arrayeasy
34K-diff Pairs in an Arraymedium
35Kth Element of Two Sorted Arraysmedium
36Intersection of Two Arrayseasy
37Sort Colorsmedium
38Trapping Rain Waterhard
39Maximum Subarrayeasy
40Minimum Size Subarray Summedium
41K Max Sum Combinationsmedium
42Print Linked List Elementseasy
43Convert Binary Number in a Linked List to Integereasy
44Print Linked List Elementseasy
45Nth Node from end of linked listeasy
46Insert into a Linked Listeasy
47Delete Node in a Linked Listeasy
48Merge Nodes in Between Zeroseasy
49Reverse Linked Listeasy
50Remove Linked List Elementseasy
51Middle of the Linked Listeasy
52Merge Two Sorted Listseasy
53Delete Node in a Linked Listeasy
54Palindrome Linked Listeasy
55Intersection of Two Linked Listseasy
56Remove Duplicates from Sorted Listeasy
57Remove Duplicates from Sorted List IImedium
58Nth Node from end of linked listmedium
59Remove Nth Node From End of Listmedium
60Add Two Numbersmedium
61Reverse Linked List IImedium
62Reverse Nodes in k-Grouphard
63Plus One Linked Listmedium
64Reorder Listmedium
65Rotate Listmedium
66Linked List Cyclemedium
67Linked List Cycle IImedium
68Flatten a Multilevel Doubly Linked Listmedium
69Partition Listmedium
70Insertion Sort Listmedium
71Sort Listmedium
72Implement Stack using Arrayseasy
73Implement Stack using Linked Listeasy
74Implement Queue using Arrayeasy
75Implement Queue using Linked Listeasy
76Implement Queue using Stackseasy
77Implement Stack using Queueseasy
78Valid Parentheseseasy
79Min Stackeasy
80Evaluate Reverse Polish Notationmedium
81Next Greater Element Imedium
82Simplify Pathmedium
83Rotting Orangesmedium
84Sliding Window Maximumhard
85Largest Rectangle in Histogramhard
86Counting Sorteasy
87Single Numbermedium
88Two Sumeasy
893Summedium
904Summedium
91Longest Consecutive Sequencemedium
92Largest subarray with 0 summedium
93Longest Substring Without Repeating Charactersmedium
94Sliding Window Maximumhard
95Subarrays with XOR Khard
96Longest Substring with At Most K Distinct Charactersmedium
97Copy List with Random Pointermedium
98LRU Cachehard
99Rat in a Mazemedium
100Subsetsmedium
101Subsets IImedium
102Partition Equal Subset Summedium
103Combination Summedium
104Combination Sum IImedium
105Combinationsmedium
106Tug of Warmedium
107Permutationsmedium
108Letter Combinations of a Phone Numbermedium
109Generate Parenthesesmedium
110Restore IP Addressesmedium
111Split Array into Consecutive Subsequencesmedium
112N-Queenshard
113Sudoku Solverhard
114Permutation Sequencehard
115Binary Tree Inorder Traversaleasy
116Binary Tree Preorder Traversaleasy
117Binary Tree Postorder Traversaleasy
118Binary Tree Level Order Traversaleasy
119Same Treeeasy
120Symmetric Treeeasy
121Maximum Depth of Binary Treeeasy
122Diameter of Binary Treeeasy
123Invert Binary Treeeasy
124Balanced Binary Treeeasy
125Binary Tree Zigzag Level Order Traversalmedium
126Construct Binary Tree from Preorder and Inorder Traversalmedium
127Construct Binary Tree from Inorder and Postorder Traversalmedium
128Binary Tree Left Side Viewmedium
129Binary Tree Right Side Viewmedium
130Top View of Binary Treemedium
131Bottom View of Binary Treemedium
132Lowest Common Ancestor of a Binary Treemedium
133Flatten Binary Tree to Linked Listmedium
134Populating Next Right Pointers in Each Nodemedium
135Binary Tree Maximum Path Sumhard
136Binary Tree to DLLhard
137Search in a Binary Search Treeeasy
138Insert into a Binary Search Treemedium
139Inorder Successor in BSTmedium
140Inorder Predecessor in BSTmedium
141Delete Node in a BSTmedium
142Lowest Common Ancestor of a BSTeasy
143Validate Binary Search Treemedium
144Two Sum IV - Input is a BSTeasy
145Kth Largest Element in a BSTmedium
146Kth Smallest Element in a BSTmedium
147Binary Search Tree Iteratormedium
148Serialize and Deserialize BSTmedium
149Largest BSThard
150Kth Largest Element in a Streamhard
151Find Median from Data Streamhard
152Merge k Sorted Listshard
153Sort Nearly Sorted Arrayhard
154Excel Sheet Column Numbereasy
155Factorial Trailing Zeroeseasy
156Greatest Common Divisoreasy
157Count Primesmedium
158Unique Pathsmedium
159Pow(x, n)medium
160Find Most Significant Biteasy
161Power of Twoeasy
162Number of 1 Bitseasy
163Find the Duplicate Numbereasy
164Missing Numbereasy
165Find Missing and Repeatingmedium
166Divide Two Integersmedium
167Valid Perfect Squaremedium
168Subsetsmedium
169Climbing Stairseasy
170Longest Increasing Subsequencemedium
171Longest Common Subsequencemedium
172Maximum Sum Increasing Subsequencemedium
173Longest Palindromic Substringmedium
174Edit Distancemedium
175Dungeon Gamemedium
176Partition Equal Subset Summedium
177Minimum Path Summedium
178Rod Cuttingmedium
179Coin Changemedium
180Decode Waysmedium
181Unique Pathsmedium
182Maximum Product Subarraymedium
183Super Egg Drophard
184Palindrome Partitioningmedium
185Palindrome Partitioning IIhard
186Word Breakmedium
187Word Break IIhard
188Best Time to Buy and Sell Stockeasy
189Best Time to Buy and Sell Stock IIeasy
190Best Time to Buy and Sell Stock IIIhard
191Best Time to Buy and Sell Stock IVhard
192Regular Expression Matchinghard
193Wildcard Matchinghard
194Meeting Rooms IImedium
195Fractional Knapsackmedium
196Job Sequencing Problemmedium
197Minimum Platformsmedium
198Adjacency Listeasy
199Adjacency Matrixeasy
200DFS of Grapheasy
201DFS of Graphmedium
202BFS of Graphmedium
203Clone Graphmedium
204Detect Cycle in Directed Graphmedium
205Detect Cycle in Undirected Graphmedium
206Course Schedulemedium
207Find if Path Exists in Graphmedium
208Flood Filleasy
209Number of Islandsmedium
210Valid Pathmedium
211Surrounded Regionsmedium
212Knight Probability in Chessboardmedium
213Word Searchmedium
214Stepping Numbersmedium
215M-Coloring Problemmedium
216Is Graph Bipartitemedium
217Word Ladderhard
218Redundant Connectionmedium
219Min Cost to Connect All Pointsmedium
220Min Cost to Connect All Pointsmedium
221Network Delay Timemedium
222Reverse Words in a Stringmedium
223Longest Palindromemedium
224Roman to Integereasy
225Integer to Romaneasy
226Implement strStreasy
227Repeated String Matchhard
228Shortest Palindromehard
229Distinct Subsequenceshard
230Longest Common Prefixeasy
231Minimum Insertion Steps to Make a String Palindromehard
232Valid Anagrameasy
233Count and Saymedium
234Compare Version Numbersmedium
235Shortest Unique Prefixhard
236Search Suggestions Systemhard