1 |
Marvolo Gaunt Ring |
Medium |
codeforces |
2 |
Search a 2D Matrix |
Medium |
leetcode |
3 |
Find Subsets |
Medium |
leetcode |
4 |
Find Subsets (Use Bitmasking) |
Medium |
leetcode |
5 |
Letter Combinations |
Medium |
leetcode |
6 |
Fast Exponentiation |
Medium |
leetcode |
7 |
Parantheses-1 |
Medium |
leetcode |
8 |
Parantheses-2 |
Medium |
hackerrank |
9 |
Simple Combinations |
Medium |
leetcode |
10 |
Simple Combinations Sum |
Medium |
leetcode |
11 |
Combination Sum |
Medium |
leetcode |
12 |
Permutations-1 |
Easy |
leetcode |
13 |
Permutations-2 (Lexicographic ordering) |
Easy |
leetcode |
14 |
Permutations-3 |
Medium |
leetcode |
15 |
Unique Paths |
Hard |
leetcode |
16 |
Maze Problem |
Hard |
codechef |
17 |
N-Queens 1 |
Hard |
leetcode |
18 |
N-Queens 2 |
Hard |
leetcode |
19 |
Sudoku Solver |
Hard |
leetcode |
20 |
Peak Element |
Medium |
leetcode |
21 |
K Closest Points |
Easy |
leetcode |
22 |
Custom Sort |
Medium |
leetcode |
23 |
Insertion Sort |
Easy |
geeksforgeeks |
24 |
Bubble Sort |
Easy |
geeksforgeeks |
25 |
Trouble Sort |
Hard |
uva |
26 |
Special Election |
Hard |
codechef |
27 |
Merge Process |
Easy |
leetcode |
28 |
Sort the squares |
Easy |
leetcode |
29 |
Special Inversions |
Hard |
leetcode |
30 |
Counting Smaller Numbers |
Hard |
leetcode |
31 |
Implement Partition |
Easy |
geeksforgeeks |
32 |
Zeroes at the End |
Easy |
leetcode |
33 |
Sorting Colors |
Easy |
leetcode |
34 |
Linear Sort |
Medium |
geeksforgeeks |
35 |
Unique Triplets |
Medium |
leetcode |
36 |
Unique Quadruplets |
Medium |
leetcode |
37 |
No Repetition |
Medium |
leetcode |
38 |
Smallest Window |
Hard |
leetcode |
39 |
Consecutive Ones |
Medium |
leetcode |
40 |
Minimize the Expression(Try on Local Editor) |
Medium |
geeksforgeeks |
41 |
Numbers with Prime Factors |
Hard |
leetcode |
42 |
A Power of Two |
Easy |
leetcode |
43 |
Count Set Bits |
Easy |
leetcode |
44 |
Cumulative Bitwise AND |
Medium |
leetcode |
45 |
Number occurring once-2 |
Medium |
leetcode |
46 |
Hamming Distance |
Medium |
leetcode |
47 |
Sum of Bitwise OR |
Hard |
hackerrank |
48 |
Multiple XOR queries |
Medium |
leetcode |
49 |
Magic Formula |
Medium |
codeforces |
50 |
Two Elements |
Medium |
leetcode |
51 |
Infinite OR Game |
Easy |
codechef |
52 |
Count Subarrays |
Medium |
leetcode |
53 |
Interesting Queries |
Medium |
codeforces |
54 |
Longest Consecutive Sequence |
Hard |
leetcode |
55 |
Illumination |
Hard |
leetcode |
56 |
Max Points |
Hard |
leetcode |
57 |
All Words |
Hard |
leetcode |
58 |
Make Palindromes |
Hard |
leetcode |
59 |
Two Stacks |
Easy |
geeksforgeeks |
60 |
Balanced Paranthesis |
Easy |
leetcode |
61 |
Next Greater Element |
Medium |
geeksforgeeks |
62 |
Largest Rectangle Histogram |
Hard |
leetcode |
63 |
Need All Ones |
Medium |
hackerrank |
64 |
Max Rectangle |
Hard |
leetcode |
65 |
Sum of Minimums |
Medium |
leetcode |
66 |
Duplicate Letters |
Medium |
leetcode |
67 |
Design Min Stack |
Medium |
leetcode |
68 |
Design Max Stack |
Medium |
hackerrank |
69 |
Nested Integers |
Medium |
leetcode |
70 |
Implement Queue |
Easy |
geeksforgeeks |
71 |
Design Queue Using Stacks |
Easy |
leetcode |
72 |
Design Stack Using Queues |
Easy |
leetcode |
73 |
Reverse a Queue |
Easy |
geeksforgeeks |
74 |
Binary Numbers |
Easy |
geeksforgeeks |
75 |
Maximum in Sliding Window |
Hard |
leetcode |
76 |
First Negative Integer |
Hard |
geeksforgeeks |
77 |
Middle Node |
Easy |
leetcode |
78 |
Delete N-th Node From End |
Easy |
leetcode |
79 |
Reverse List iteratively |
Easy |
leetcode |
80 |
Reverse List recursively |
Easy |
leetcode |
81 |
Palindrome List |
Easy |
leetcode |
82 |
Reordering |
Medium |
leetcode |
83 |
K-Reversal |
Hard |
leetcode |
84 |
Pair Sum in Linked List(Try on local IDE) |
Medium |
geeksforgeeks |
85 |
Check For Cycle |
Easy |
leetcode |
86 |
First Node of Cycle |
Easy |
leetcode |
87 |
Merge Sorted Lists Iteratively |
Easy |
leetcode |
88 |
Merge Sorted Lists Recursively |
Easy |
leetcode |
89 |
K Sorted Lists |
Easy |
leetcode |
90 |
Flatten a Linked List |
Medium |
geeksforgeeks |
91 |
Clone a Linked List |
Medium |
leetcode |
92 |
Segragate Nodes |
Easy |
geeksforgeeks |
93 |
Multilevel Doubly Linked List |
Medium |
leetcode |
94 |
Implement LRU Cache |
Medium |
leetcode |
95 |
Count Leaf Nodes |
Easy |
geeksforgeeks |
96 |
Left Leaves |
Easy |
leetcode |
97 |
Mirror Image |
Easy |
geeksforgeeks |
98 |
Symmetric Binary Tree |
Easy |
leetcode |
99 |
Height of Binary Tree |
Easy |
leetcode |
100 |
Minimum Height of Binary Tree |
Easy |
leetcode |
101 |
Root to Leaf Paths |
Easy |
leetcode |
102 |
Binary Tree Diameter |
Medium |
leetcode |
103 |
Height Balanced Tree |
Medium |
leetcode |
104 |
Maximum Sum Path |
Hard |
leetcode |
105 |
Prune the Binary Tree |
Easy |
leetcode |
106 |
Binary Tree to Doubly Linked List |
Hard |
geeksforgeeks |
107 |
Binary Tree to Linked List |
Medium |
leetcode |
108 |
Full Binary Trees |
Medium |
leetcode |
109 |
Recursive Preorder Traversal |
Easy |
leetcode |
110 |
Iterative Preorder Traversal |
Medium |
leetcode |
111 |
Recursive Inorder Traversal |
Easy |
leetcode |
112 |
Iterative Inorder Traversal |
Medium |
leetcode |
113 |
Recursive Postorder Traversal |
Easy |
leetcode |
114 |
Iterative Postorder Traversal |
Medium |
leetcode |
115 |
Level Order Traversal |
Easy |
leetcode |
116 |
ZigZag Level Order Traversal |
Medium |
leetcode |
117 |
Left View of Tree |
Medium |
geeksforgeeks |
118 |
Right View of Tree |
Medium |
geeksforgeeks |
119 |
Next Pointers - 1 |
Medium |
leetcode |
120 |
Next Pointers - 2 |
Medium |
leetcode |
121 |
Vertical Order Traversal |
Medium |
geeksforgeeks |
122 |
Top View of Tree |
Medium |
geeksforgeeks |
123 |
Bottom View of Tree |
Medium |
geeksforgeeks |
124 |
Count of Nodes in Complete Binary Tree |
Medium |
leetcode |
125 |
Construct Binary Tree from Inorder and Preorder |
Medium |
leetcode |
126 |
Construct Binary Tree from Inorder and Postorder |
Medium |
leetcode |
127 |
Construct Binary Tree from Special Preorder(code on local IDE) |
Medium |
geeksforgeeks |
128 |
Check for Subtree |
Medium |
leetcode |
129 |
Duplicate Subtrees |
Medium |
leetcode |
130 |
Binary Tree Serialization and Deserialization - 1 |
Medium |
geeksforgeeks |
131 |
Binary Tree Serialization and Deserialization - 2 |
Medium |
leetcode |
132 |
Binary Tree Recovery |
Hard |
leetcode |
133 |
Max Product |
Medium |
leetcode |
134 |
Lowest Common Ancestor |
Medium |
leetcode |
135 |
Distance between Nodes |
Medium |
geeksforgeeks |
136 |
SQL Practice - Hackerrank |
Medium |
hackerrank |
137 |
SQL Practice - Leetcode |
Medium |
leetcode |
138 |
Trie Implementation |
Medium |
leetcode |
139 |
Trie Deletion |
Medium |
geeksforgeeks |
140 |
Prefix Search |
Medium |
geeksforgeeks |
141 |
Shortest Unique Prefix |
Hard |
geeksforgeeks |
142 |
Maximum Xor in Array |
Medium |
leetcode |
143 |
Minimum Xor in Array |
Medium |
geeksforgeeks |
144 |
Maximum Xor Subarray |
Medium |
geeksforgeeks |
145 |
Count Pairs with XOR in Range |
Hard |
leetcode |
146 |
Search in BST |
Easy |
leetcode |
147 |
Insert in BST |
Easy |
leetcode |
148 |
Delete in BST |
Medium |
leetcode |
149 |
k-th smallest in BST |
Easy |
leetcode |
150 |
Validate BST |
Medium |
leetcode |
151 |
Convert into BST |
Easy |
geeksforgeeks |
152 |
Height Balanced BST |
Easy |
leetcode |
153 |
Largest BST in Binary Tree |
Hard |
geeksforgeeks |
154 |
Reconstruct BST from preorder |
Medium |
leetcode |
155 |
Reconstruct BST from postorder |
Medium |
geeksforgeeks |
156 |
Max Sum BST |
Hard |
leetcode |
157 |
Implement BST Iterator |
Medium |
leetcode |
158 |
Pair Sum in BST |
Medium |
geeksforgeeks |
159 |
LCA in BST |
Medium |
leetcode |
160 |
BST Recovery |
Medium |
leetcode |
161 |
Build your Heap(on your local IDE) |
Medium |
geeksforgeeks |
162 |
Heap Sort |
Easy |
geeksforgeeks |
163 |
K-Largest |
Easy |
geeksforgeeks |
164 |
K-Closest Points |
Medium |
leetcode |
165 |
Tying Ropes |
Medium |
geeksforgeeks |
166 |
Merge K Sorted Arrays |
Medium |
geeksforgeeks |
167 |
Smallest Sum Pairs |
Medium |
leetcode |
168 |
K-th Smallest in Special Matrix |
Medium |
leetcode |
169 |
Schedule the tasks |
Medium |
leetcode |
170 |
String rearrangement(Try on local IDE) |
Hard |
geeksforgeeks |
171 |
Number with limited Prime Factors |
Medium |
leetcode |
172 |
Number with limited Prime Factors - 2 |
Hard |
leetcode |
173 |
Maximum Meetings |
Easy |
geeksforgeeks |
174 |
Minimum Platforms |
Medium |
hackerrank |
175 |
Maximum Profit from Jobs |
Medium |
geeksforgeeks |
176 |
Fractional Knapsack Problem |
Medium |
geeksforgeeks |
177 |
Minimize the Loss(Try on Local IDE) |
Medium |
geeksforgeeks |
178 |
K-th Largest in Running Stream |
Medium |
leetcode |
179 |
Median in Running Stream |
Hard |
leetcode |
180 |
Median in Sliding Window |
Hard |
leetcode |
181 |
Maximum Performance |
Hard |
leetcode |
182 |
Huffman Encoding |
Hard |
geeksforgeeks |
183 |
BFS of Graph |
Easy |
geeksforgeeks |
184 |
Shortest Path in Unweighted Graph |
Medium |
hackerrank |
185 |
Knight Walk |
Medium |
geeksforgeeks |
186 |
Nearest Zero |
Medium |
leetcode |
187 |
Rotten Oranges |
Medium |
leetcode |
188 |
Word Ladder |
Hard |
leetcode |
189 |
DFS of Graph |
Easy |
geeksforgeeks |
190 |
Connected Components |
Medium |
hackerearth |
191 |
Number of Islands |
Medium |
leetcode |
192 |
Capture Surrounded Regions |
Medium |
leetcode |
193 |
Check Bipartite Graph |
Medium |
leetcode |
194 |
Detect Cycle in Undirected Graph |
Medium |
geeksforgeeks |
195 |
Detect Cycle in Directed Graph |
Medium |
geeksforgeeks |
196 |
Topological Sort of Graph |
Medium |
geeksforgeeks |
197 |
Course Schedule |
Medium |
leetcode |
198 |
Staircase Problem - Top Bottom |
Easy |
geeksforgeeks |
199 |
Staircase Problem - Bottom Top |
Easy |
geeksforgeeks |
200 |
Tiling Problem |
Easy |
geeksforgeeks |
201 |
Maximum non adjacent sum - Top Bottom |
Medium |
geeksforgeeks |
202 |
Maximum non adjacent sum - Bottom Top |
Medium |
geeksforgeeks |
203 |
Maximum non adjacent sum - 2 |
Medium |
geeksforgeeks |
204 |
Count of Decodings - Top Bottom |
Medium |
leetcode |
205 |
Count of Decodings - Bottom Top |
Medium |
leetcode |
206 |
Rod Cutting Problem - Top Bottom |
Medium |
geeksforgeeks |
207 |
Rod Cutting Problem - Bottom Top |
Medium |
geeksforgeeks |
208 |
Cutting Segments - Top Bottom |
Medium |
geeksforgeeks |
209 |
Cutting Segments - Bottom Top |
Medium |
geeksforgeeks |
210 |
Coin Change - 1 Top Bottom |
Medium |
leetcode |
211 |
Coin Change - 1 Bottom Top |
Medium |
leetcode |
212 |
Coin Change - 2 Top Bottom |
Hard |
geeksforgeeks |
213 |
Coin Change - 2 Bottom Top |
Hard |
geeksforgeeks |
214 |
Check Subset Sum |
Medium |
geeksforgeeks |
215 |
Partition to minimise difference |
Hard |
geeksforgeeks |
216 |
0-1 Knapsack Top Bottom |
Medium |
geeksforgeeks |
217 |
0-1 Knapsack Bottom Top |
Medium |
geeksforgeeks |
218 |
Unbounded Knapsack Top Bottom |
Medium |
geeksforgeeks |
219 |
Unbounded Knapsack Bottom Top |
Medium |
geeksforgeeks |
220 |
Longest Increasing Subsequence |
Medium |
leetcode |
221 |
Longest Bitonic Subsequence |
Medium |
geeksforgeeks |
222 |
Envelopes |
Medium |
leetcode |
223 |
Stack the Boxes |
Hard |
geeksforgeeks |
224 |
Count of LIS |
Medium |
leetcode |
225 |
Longest Common Subsequence Top Bottom |
Medium |
leetcode |
226 |
Longest Common Subsequence Bottom Top |
Medium |
leetcode |
227 |
LCS Construction |
Medium |
hackerrank |
228 |
Longest Palindromic Subsequence Top Bottom |
Medium |
leetcode |
229 |
Longest Palindromic Subsequence Bottom Top |
Medium |
leetcode |
230 |
Longest Palindromic Substring |
Medium |
leetcode |
231 |
Split to Palindromes Top Bottom |
Hard |
leetcode |
232 |
Split to Palindromes Bottom Top |
Hard |
leetcode |
233 |
Edit Distance Top Bottom |
Hard |
leetcode |
234 |
Edit Distance Bottom Top |
Hard |
leetcode |
235 |
Pattern Matching Top Bottom |
Hard |
leetcode |
236 |
Pattern Matching Bottom Top |
Hard |
leetcode |
237 |
Regex Matching |
Hard |
leetcode |
238 |
Count Subsequences |
Hard |
leetcode |
239 |
Matrix Chain Multiplication Top Bottom |
Hard |
geeksforgeeks |
240 |
Matrix Chain Multiplication Bottom Top |
Hard |
geeksforgeeks |
241 |
Bursting Balloons Top Bottom |
Hard |
geeksforgeeks |
242 |
Bursting Balloons Bottom Top |
Hard |
geeksforgeeks |
243 |
Total Paths Top Bottom |
Easy |
leetcode |
244 |
Total Paths Bottom Top |
Easy |
leetcode |
245 |
Total Paths - 2 Top Bottom |
Easy |
leetcode |
246 |
Total Paths - 2 Bottom Top |
Easy |
leetcode |
247 |
Min Sum Path Top Bottom |
Easy |
leetcode |
248 |
Min Sum Path Bottom Top |
Easy |
leetcode |
249 |
AND plus OR |
Easy |
codechef |
250 |
Cooking Machine |
Easy |
codechef |
251 |
Integer Division Problem |
Easy |
codechef |
252 |
Chef and Notebooks |
Easy |
codechef |
253 |
Minimum Spanning Tree (Kruskal) |
Hard |
geeksforgeeks |
254 |
Minimum Spanning Tree (Prim) |
Hard |
geeksforgeeks |
255 |
Articulation Points |
Hard |
leetcode |
256 |
Shortest Path in Graph using Dijkstra |
Hard |
leetcode |
257 |
Lorenzo Von Matterhorn |
Hard |
codeforces |
258 |
Diameter of Tree |
Hard |
codeforces |
259 |
Kefa and Park |
Hard |
codeforces |
260 |
Linova and Kingdom |
Hard |
codeforces |
261 |
Range Minimum Query (Sparse Table) |
Hard |
spoj |
262 |
Range Minimum Query (Sqrt Decomposition) |
Hard |
spoj |