| 1 | 0 - 1 Knapsack Problem |
| 2 | 2D Difference Array |
| 3 | 2D Submatrix Sum Queries |
| 4 | Activity Selection |
| 5 | Add 1 to a Linked List Number |
| 6 | Add Binary Strings |
| 7 | Add Number Linked Lists |
| 8 | Aggressive Cows |
| 9 | Alien Dictionary |
| 10 | All numbers with specific difference |
| 11 | All Subsets Xor Sum |
| 12 | All Unique Permutations of an array |
| 13 | Allocate Minimum Pages |
| 14 | Alternate positive and negative numbers |
| 15 | Alternative Sorting |
| 16 | Anagram |
| 17 | Ancestors in Binary Tree |
| 18 | AND In Range |
| 19 | Array Duplicates |
| 20 | Array to BST |
| 21 | Articulation Point - II |
| 22 | ASCII Range Sum |
| 23 | Assign Mice Holes |
| 24 | Balancing Consonants and Vowels Ratio |
| 25 | Bellman-Ford |
| 26 | BFS of graph |
| 27 | Binary Tree to DLL |
| 28 | Bitonic Point |
| 29 | Boolean Parenthesization |
| 30 | Bottom View of Binary Tree |
| 31 | Brackets in Matrix Chain Multiplication |
| 32 | Bridge edge in a graph |
| 33 | BST to greater sum tree |
| 34 | BST with Dead End |
| 35 | Burning Tree |
| 36 | Bus Conductor |
| 37 | Bus Ticket Change |
| 38 | Candy |
| 39 | Case-specific Sorting of Strings |
| 40 | Check for BST |
| 41 | Check if a String is Subsequence of Other |
| 42 | Check if frequencies can be equal |
| 43 | Check If two Line segments Intersect |
| 44 | Chocolate Distribution Problem |
| 45 | Chocolate Pickup II |
| 46 | Circle of strings |
| 47 | Clone a linked list with next and random pointer |
| 48 | Clone an Undirected Graph |
| 49 | Clone List with Next and Random |
| 50 | Closest Neighbour in BST |
| 51 | Closest Three Sum |
| 52 | Coin Change (Count Ways) |
| 53 | Coin Change (Minimum Coins) |
| 54 | Coin Piles |
| 55 | Compare two fractions |
| 56 | Construct an array from its pair-sum array |
| 57 | Construct Binary Tree from Parent Array |
| 58 | Construct Tree from Inorder & Preorder |
| 59 | Construct Tree from Preorder & Postorder |
| 60 | Container With Most Water |
| 61 | Count all triplets with given sum in sorted array |
| 62 | Count distinct elements in every window |
| 63 | Count elements less than or equal to k in a sorted rotated array |
| 64 | Count Indices to Balance Even and Odd Sums |
| 65 | Count Inversions |
| 66 | Count Linked List Nodes |
| 67 | Count Numbers Containing Specific Digits |
| 68 | Count of distinct substrings |
| 69 | Count pairs Sum in matrices |
| 70 | Count Pairs whose sum is less than target |
| 71 | Count pairs with given sum |
| 72 | Count Reverse Pairs |
| 73 | Count set bits |
| 74 | Count Smaller elements |
| 75 | Count Subarray with k odds |
| 76 | Count Subarrays with given XOR |
| 77 | Count Subset With Target Sum II |
| 78 | Count the Coprimes |
| 79 | Count the number of possible triangles |
| 80 | Count the paths |
| 81 | Count Unique Vowel Strings |
| 82 | Count ways to N'th Stair(Order does not matter) |
| 83 | Count X in Range of a Sorted Array |
| 84 | Counting elements in two arrays |
| 85 | Course Schedule II |
| 86 | Coverage of all Zeros in a Binary Matrix |
| 87 | Cutting Binary String |
| 88 | Decode the string |
| 89 | Delete Alternate Nodes |
| 90 | Delete node in Doubly Linked List |
| 91 | Deletion and Reverse in Circular Linked List |
| 92 | Design MinMax Queue |
| 93 | Detect Loop in linked list |
| 94 | DFS of Graph |
| 95 | Diameter of a Binary Tree |
| 96 | Dice throw |
| 97 | Difference Check |
| 98 | Dijkstra Algorithm |
| 99 | Directed Graph Cycle |
| 100 | Distance of nearest cell having 1 |
| 101 | Distribute Candies |
| 102 | Divisible by 13 |
| 103 | Duplicate Subtrees |
| 104 | Edit Distance |
| 105 | Elements in range [a, b] |
| 106 | Equalize the Towers |
| 107 | Equilibrium Point |
| 108 | Evaluation of Postfix Expression |
| 109 | Exactly one swap |
| 110 | Expression Add Operators |
| 111 | Expression contains redundant bracket or not |
| 112 | Extract the Number from the String |
| 113 | Facing the sun |
| 114 | Farthest Smaller Right |
| 115 | Find all possible palindromic partitions of a String |
| 116 | Find All Triplets with Zero Sum |
| 117 | Find H-Index |
| 118 | Find K Smallest Sum Pairs |
| 119 | Find Kth Rotation |
| 120 | Find length of Loop |
| 121 | Find maximum volume of a cuboid |
| 122 | Find median in a stream |
| 123 | Find Only Repetitive Element from 1 to n-1 |
| 124 | Find rectangle with corners as 1 |
| 125 | Find the closest pair from two arrays |
| 126 | Find the first node of loop in linked list |
| 127 | Find the longest string |
| 128 | Find the number of islands |
| 129 | Find the Sum of Last N nodes of the Linked List |
| 130 | Fixing Two nodes of a BST |
| 131 | Flattening a Linked List |
| 132 | Flood fill Algorithm |
| 133 | Floyd Warshall |
| 134 | Form a palindrome |
| 135 | Form the Largest Number |
| 136 | Frog Jump |
| 137 | Game of XOR |
| 138 | Game with String |
| 139 | Gas Station |
| 140 | Generate all binary strings |
| 141 | Generate Binary Numbers |
| 142 | Generate IP Addresses |
| 143 | Generate Permutations of an array |
| 144 | Get Min from Stack |
| 145 | Get Minimum Squares |
| 146 | Gold Mine Problem |
| 147 | Graph Diameter |
| 148 | Group Balls by Sequence |
| 149 | Happiest Triplet |
| 150 | Height of Binary Tree |
| 151 | Histogram Max Rectangular Area |
| 152 | Identical Linked Lists |
| 153 | Implement Atoi |
| 154 | Implement k Queues in a Single Array |
| 155 | Implement Pow |
| 156 | Implement Trie |
| 157 | Indexes of Subarray Sum |
| 158 | Inorder Traversal |
| 159 | Insert in Sorted Circular Linked List |
| 160 | Insert in Sorted way in a Sorted DLL |
| 161 | Insert Interval |
| 162 | Integral Points Inside Triangle |
| 163 | Interleave the First Half of the Queue with Second Half |
| 164 | Interleaved Strings |
| 165 | Intersection in Y Shaped Lists |
| 166 | Intersection of Two arrays with Duplicate Elements |
| 167 | Intersection Point in Y Shaped Linked Lists |
| 168 | Is Binary Tree Heap |
| 169 | Is Linked List Length Even |
| 170 | Job Sequencing Problem |
| 171 | Josephus problem |
| 172 | K closest elements |
| 173 | K Closest Points to Origin |
| 174 | K closest Values |
| 175 | k largest elements |
| 176 | K Sized Subarray Maximum |
| 177 | K Sum Paths |
| 178 | K-Pangrams |
| 179 | K-th element of two Arrays |
| 180 | K-th Largest Sum Contiguous Subarray |
| 181 | k-th Smallest in BST |
| 182 | Kadane's Algorithm |
| 183 | Koko Eating Bananas |
| 184 | Kth distance |
| 185 | Kth element in Matrix |
| 186 | Kth Missing Positive Number in a Sorted Array |
| 187 | Kth Smallest |
| 188 | Kth Smallest Number in Multiplication Table |
| 189 | Largest BST |
| 190 | Largest Divisible Subset |
| 191 | Largest number in K swaps |
| 192 | Largest number in one swap |
| 193 | Largest Pair Sum |
| 194 | Largest square formed in a matrix |
| 195 | Largest subarray of 0's and 1's |
| 196 | Last Moment Before All Ants Fall Out |
| 197 | LCM Triplet |
| 198 | LCS of three strings |
| 199 | Left Rotate Matrix K times |
| 200 | Left View of Binary Tree |
| 201 | Level Order in spiral form |
| 202 | Level order traversal |
| 203 | Lexicographically Largest String After Deleting K Characters |
| 204 | Linked List Group Reverse |
| 205 | Linked List Matrix |
| 206 | Linked list of strings forms a palindrome |
| 207 | Longest alternating subsequence |
| 208 | Longest Bounded-Difference Subarray |
| 209 | Longest Common Increasing Subsequence |
| 210 | Longest Common Prefix of Strings |
| 211 | Longest Common Subsequence |
| 212 | Longest Common Substring |
| 213 | Longest Consecutive Subsequence |
| 214 | Longest Increasing Subsequence |
| 215 | Longest Palindrome in a String |
| 216 | Longest Palindromic Subsequence |
| 217 | Longest Periodic Proper Prefix |
| 218 | Longest Prefix Suffix |
| 219 | Longest Span in two Binary Arrays |
| 220 | Longest String Chain |
| 221 | Longest Subarray Length |
| 222 | Longest subarray with Atmost two distinct integers |
| 223 | Longest Subarray with Majority Greater than K |
| 224 | Longest Subarray with Sum K |
| 225 | Longest substring with distinct characters |
| 226 | Longest Substring with K Uniques |
| 227 | Longest valid Parentheses |
| 228 | Look and Say Pattern |
| 229 | Lowest Common Ancestor in a BST |
| 230 | LRU Cache |
| 231 | Majority Element |
| 232 | Majority Element II |
| 233 | Majority Vote |
| 234 | Make array elements unique |
| 235 | Make Binary Tree From Linked List |
| 236 | Make Matrix Beautiful |
| 237 | Make Strings Equal |
| 238 | Matrix Chain Multiplication |
| 239 | Max Circular Subarray Sum |
| 240 | Max DAG Edges |
| 241 | Max distance between same elements |
| 242 | Max min Height |
| 243 | Max of min for every window size |
| 244 | Max rectangle |
| 245 | Max Score from Subarray Mins |
| 246 | Max sum in the configuration |
| 247 | Max Sum Increasing Subsequence |
| 248 | Max sum path in two arrays |
| 249 | Max Sum Subarray of size K |
| 250 | Max Xor Subarray of size K |
| 251 | Maximise String Score |
| 252 | Maximize Array Value After Rearrangement |
| 253 | Maximize median after doing k addition operation |
| 254 | Maximize Number of 1's |
| 255 | Maximize partitions in a String |
| 256 | Maximize The Cut Segments |
| 257 | Maximize the minimum difference between k elements |
| 258 | Maximum Connected group |
| 259 | Maximum Difference |
| 260 | Maximum Non-Adjacent Nodes Sum |
| 261 | Maximum Non-Overlapping Odd Palindrome Sum |
| 262 | Maximum number of overlapping Intervals |
| 263 | Maximum of minimum for every window size |
| 264 | Maximum path sum |
| 265 | Maximum path sum from any node |
| 266 | Maximum People Visible in a Line |
| 267 | Maximum Product Subarray |
| 268 | Maximum product subset of an array |
| 269 | Maximum Stone Removal |
| 270 | Maximum subarray sum 2 |
| 271 | Maximum Sum Combination |
| 272 | Maximum sum of elements not part of LIS |
| 273 | Maximum sum of Non-adjacent nodes |
| 274 | Maximum sum Rectangle |
| 275 | Maximum XOR of two numbers in an array |
| 276 | Median in a row-wise sorted Matrix |
| 277 | Median of BST |
| 278 | Median of two sorted arrays |
| 279 | Meeting Rooms |
| 280 | Meeting Rooms III |
| 281 | Merge K sorted linked lists |
| 282 | Merge Sort for Linked List |
| 283 | Merge two BST 's |
| 284 | Merge two sorted linked lists |
| 285 | Merge Without Extra Space |
| 286 | Middle of a Linked List |
| 287 | Min Add to Make Parentheses Valid |
| 288 | Min Chars to Add for Palindrome |
| 289 | Min Cost Climbing Stairs |
| 290 | Minimal Cost |
| 291 | Minimize the Heights I |
| 292 | Minimize the Heights II |
| 293 | Minimum Cost of ropes |
| 294 | Minimum Cost Path |
| 295 | Minimum cost to connect all houses in a city |
| 296 | Minimum Cost to cut a board into squares |
| 297 | Minimum Cost to Cut a Stick of length N |
| 298 | Minimum Cost to Merge Stones |
| 299 | Minimum days to make M bouquets |
| 300 | Minimum Deletions |
| 301 | Minimum Jumps |
| 302 | Minimum K Consecutive Bit Flips |
| 303 | Minimum number of deletions and insertions |
| 304 | Minimum Number of Workers |
| 305 | Minimum Operations to Connect Hospitals |
| 306 | Minimum Platforms |
| 307 | Minimum repeat to make substring |
| 308 | Minimum Steps to Halve Sum |
| 309 | Minimum sum |
| 310 | Minimum Weight Cycle |
| 311 | Minimum Window Subsequence |
| 312 | Mirror Tree |
| 313 | Missing And Repeating |
| 314 | Missing Element in Range |
| 315 | Missing element of AP |
| 316 | Missing in Array |
| 317 | Mobile numeric keypad |
| 318 | Modify the Array |
| 319 | Move All Zeroes to End |
| 320 | Multiply two linked lists |
| 321 | Multiply two strings |
| 322 | N meetings in one room |
| 323 | N-Queen Problem |
| 324 | nCr |
| 325 | Nearest multiple of 10 |
| 326 | Nearly sorted |
| 327 | Next element with greater frequency |
| 328 | Next Greater Element |
| 329 | Next Greater Element in Circular Array |
| 330 | Next Permutation |
| 331 | Nine Divisors |
| 332 | Non Repeating Character |
| 333 | Non-overlapping Intervals |
| 334 | Not a subset sum |
| 335 | Nth Natural Number |
| 336 | Number of BST From Array |
| 337 | Number of distinct subsequences |
| 338 | Number of occurrence |
| 339 | Number of pairs |
| 340 | Number of paths in a matrix with k coins |
| 341 | Number of Rectangles in a Circle |
| 342 | Number of Ways to Arrive at Destination |
| 343 | Occurence of an integer in a Linked List |
| 344 | Optimal binary search tree |
| 345 | Optimal Strategy For A Game |
| 346 | Overlapping Intervals |
| 347 | Pair Sum in BST |
| 348 | Pair with given sum in a sorted array |
| 349 | Pairs with difference k |
| 350 | Palindrome Linked List |
| 351 | Palindrome Sentence |
| 352 | Palindrome SubStrings |
| 353 | Parenthesis Checker |
| 354 | Partition Equal Subset Sum |
| 355 | Pascal Triangle |
| 356 | Path With Minimum Effort |
| 357 | Peak element |
| 358 | Permutations of a String |
| 359 | Police and Thieves |
| 360 | Populate Inorder Successor for all nodes |
| 361 | Possible Words From Phone Digits |
| 362 | Postfix Evaluation |
| 363 | Postorder Traversal |
| 364 | Power of k in factorial of n |
| 365 | Powerful Integer |
| 366 | Predecessor and Successor |
| 367 | Prime List |
| 368 | Prime Pair with Target Sum |
| 369 | Print Anagrams Together |
| 370 | Print Bracket Number |
| 371 | Print leaf nodes from preorder traversal of BST |
| 372 | Product array puzzle |
| 373 | Pythagorean Triplet |
| 374 | Queue Reversal |
| 375 | Quick Sort on Linked List |
| 376 | Rat in a Maze |
| 377 | Rat in a Maze Problem - I |
| 378 | Remaining String |
| 379 | Remove all occurences of duplicates in a linked list |
| 380 | Remove BST keys outside given range |
| 381 | Remove Duplicates |
| 382 | Remove duplicates in array |
| 383 | Remove Half Nodes |
| 384 | Remove loop in Linked List |
| 385 | Remove the balls |
| 386 | Reorganize The Array |
| 387 | Replace O's with X's |
| 388 | Reverse a Doubly Linked List |
| 389 | Reverse a linked list |
| 390 | Reverse an Array |
| 391 | Reverse Words |
| 392 | Roman Number to Integer |
| 393 | Roof Top |
| 394 | Root to leaf path sum |
| 395 | Root to Leaf Paths |
| 396 | Root to leaf paths sum |
| 397 | Rotate a Linked List |
| 398 | Rotate and delete |
| 399 | Rotate Array |
| 400 | Rotate by 90 degree |
| 401 | Rotate Deque By K |
| 402 | Rotten Oranges |
| 403 | Row with max 1s |
| 404 | Safe States |
| 405 | Search in a Row-Column sorted matrix |
| 406 | Search in a row-wise sorted matrix |
| 407 | Search in a sorted Matrix |
| 408 | Search in an almost Sorted Array |
| 409 | Search in fully rotated sorted 2D matrix |
| 410 | Search in Rotated Sorted Array |
| 411 | Search insert position of K in a sorted array |
| 412 | Search Pattern (KMP-Algorithm) |
| 413 | Search Pattern (Rabin-Karp Algorithm) |
| 414 | Second Best Minimum Spanning Tree |
| 415 | Second Largest |
| 416 | Segregate 0s and 1s |
| 417 | Serialize and deserialize a binary tree |
| 418 | Set Matrix Zeroes |
| 419 | Set Matrix Zeros |
| 420 | Shop in Candy Store |
| 421 | Shortest Common Supersequence |
| 422 | Shortest Cycle |
| 423 | Shortest path in Undirected Graph |
| 424 | Shortest Path in Weighted undirected graph |
| 425 | Shortest Path Using Atmost One Curved Edge |
| 426 | Single Number |
| 427 | Smallest distinct window |
| 428 | Smallest Divisor |
| 429 | Smallest number |
| 430 | Smallest Positive Missing |
| 431 | Smallest Positive Missing Number |
| 432 | Smallest range in K lists |
| 433 | Smallest window containing all characters |
| 434 | Smallest window in a string containing all the characters of another string |
| 435 | Solve the Sudoku |
| 436 | Sort 0s, 1s and 2s |
| 437 | Sort a k sorted doubly linked list |
| 438 | Sort a linked list of 0s, 1s and 2s |
| 439 | Sort by Absolute Difference |
| 440 | Sort in specific order |
| 441 | Sort the given array after applying the given equation |
| 442 | Sorted and Rotated Minimum |
| 443 | Sorted subsequence of size 3 |
| 444 | Sorting Elements of an Array by Frequency |
| 445 | Spirally traversing a matrix |
| 446 | Split an array into two equal Sum subarrays |
| 447 | Split array in three equal sum subarrays |
| 448 | Split Array Largest Sum |
| 449 | Split Array Subsequences |
| 450 | Split Linked List Alternatingly |
| 451 | Split the Array |
| 452 | Square root of a number |
| 453 | Stickler Thief |
| 454 | Stickler Thief II |
| 455 | Stock Buy and Sell – Max 2 Transactions Allowed |
| 456 | Stock Buy and Sell – Max K Transactions Allowed |
| 457 | Stock Buy and Sell – Max one Transaction Allowed |
| 458 | Stock Buy and Sell – Multiple Transaction Allowed |
| 459 | Stock Buy and Sell with Cooldown |
| 460 | Stock span problem |
| 461 | Stream First Non-repeating |
| 462 | String stack |
| 463 | Strings Rotations of Each Other |
| 464 | Sub-arrays with equal number of occurences |
| 465 | Subarray range with given sum |
| 466 | Subarrays With At Most K Distinct Integers |
| 467 | Subarrays with First Element Minimum |
| 468 | Subarrays with sum K |
| 469 | Subset Sum Problem |
| 470 | Subset XOR |
| 471 | Substrings of length k with k-1 distinct elements |
| 472 | Substrings with K Distinct |
| 473 | Substrings with same first and last characters |
| 474 | Sum of all substrings of a number |
| 475 | Sum of Mode |
| 476 | Sum of Nodes in BST Range |
| 477 | Sum of nodes on the longest path |
| 478 | Sum of subarray minimum |
| 479 | Sum of subarray minimums |
| 480 | Sum of subarray ranges |
| 481 | Sum of Subarrays |
| 482 | Sum Pair closest to target |
| 483 | Sum Tree |
| 484 | Sum-string |
| 485 | Summed Matrix |
| 486 | Swap and Maximize |
| 487 | Swap diagonals |
| 488 | Swap Kth nodes from ends |
| 489 | Symmetric Tree |
| 490 | The Celebrity Problem |
| 491 | The Knight's tour problem |
| 492 | The Painter's Partition Problem-II |
| 493 | The Palindrome Pattern |
| 494 | Toeplitz matrix |
| 495 | Top K Frequent in Array |
| 496 | Top View of Binary Tree |
| 497 | Topological sort |
| 498 | Total count |
| 499 | Total Decoding Messages |
| 500 | Trail of ones |
| 501 | Transpose of Matrix |
| 502 | Trapping Rain Water |
| 503 | Travelling Salesman Problem |
| 504 | Tree Boundary Traversal |
| 505 | Triplet Family |
| 506 | Two Smallests in Every Subarray |
| 507 | Two Sum - Pair with Given Sum |
| 508 | Two Swaps |
| 509 | Tywin's War Strategy |
| 510 | Undirected Graph Cycle |
| 511 | Union of Arrays with Duplicates |
| 512 | Union of Two Sorted Arrays with Distinct Elements |
| 513 | Unique K-Number Sum |
| 514 | Unique Number I |
| 515 | Unique Number II |
| 516 | Unique Number III |
| 517 | Unique Paths in a Grid |
| 518 | Validate an IP Address |
| 519 | Vertical Tree Traversal |
| 520 | Vertical Width of a Binary Tree |
| 521 | Walls Coloring II |
| 522 | Ways to Reach the n'th Stair |
| 523 | Ways To Tile A Floor |
| 524 | Weighted Job Scheduling |
| 525 | Wildcard Pattern Matching |
| 526 | Word Break |
| 527 | Word Search |
| 528 | XOR Linked List |
| 529 | XOR Pairs less than K |
| 530 | ZigZag Tree Traversal |