| Sno | Topic | Fav | Title | Solved |
|---|
| 1 | Array | | Reverse the array | |
|---|
| 2 | Array | | Find the maximum and minimum element in an array | |
|---|
| 3 | Array | | Find the "Kth" max and min element of an array | |
|---|
| 4 | Array | | Given an array which consists of only 0, 1 and 2. Sort the array without using any sorting algo | |
|---|
| 5 | Array | | Move all the negative elements to one side of the array | |
|---|
| 6 | Array | | Find the Union and Intersection of the two sorted arrays. | |
|---|
| 7 | Array | | Write a program to cyclically rotate an array by one. | |
|---|
| 8 | Array | | find Largest sum contiguous Subarray [V. IMP] | |
|---|
| 9 | Array | | Minimise the maximum difference between heights [V.IMP] | |
|---|
| 10 | Array | | Minimum no. of Jumps to reach end of an array | |
|---|
| 11 | Array | | find duplicate in an array of N+1 Integers | |
|---|
| 12 | Array | | Merge 2 sorted arrays without using Extra space. | |
|---|
| 13 | Array | | Kadane's Algo [V.V.V.V.V IMP] | |
|---|
| 14 | Array | | Merge Intervals | |
|---|
| 15 | Array | | Next Permutation | |
|---|
| 16 | Array | | Count Inversion | |
|---|
| 17 | Array | | Best time to buy and Sell stock | |
|---|
| 18 | Array | | find all pairs on integer array whose sum is equal to given number | |
|---|
| 19 | Array | | find common elements In 3 sorted arrays | |
|---|
| 20 | Array | | Rearrange the array in alternating positive and negative items with O(1) extra space | |
|---|
| 21 | Array | | Find if there is any subarray with sum equal to 0 | |
|---|
| 22 | Array | | Find factorial of a large number | |
|---|
| 23 | Array | | find maximum product subarray | |
|---|
| 24 | Array | | Find longest coinsecutive subsequence | |
|---|
| 25 | Array | | Given an array of size n and a number k, fin all elements that appear more than " n/k " times. | |
|---|
| 26 | Array | | Maximum profit by buying and selling a share atmost twice | |
|---|
| 27 | Array | | Find whether an array is a subset of another array | |
|---|
| 28 | Array | | Find the triplet that sum to a given value | |
|---|
| 29 | Array | | Trapping Rain water problem | |
|---|
| 30 | Array | | Chocolate Distribution problem | |
|---|
| 31 | Array | | Smallest Subarray with sum greater than a given value | |
|---|
| 32 | Array | | Three way partitioning of an array around a given value | |
|---|
| 33 | Array | | Minimum swaps required bring elements less equal K together | |
|---|
| 34 | Array | | Minimum no. of operations required to make an array palindrome | |
|---|
| 35 | Array | | Median of 2 sorted arrays of equal size | |
|---|
| 36 | Array | | Median of 2 sorted arrays of different size | |
|---|
| 39 | Matrix | | Spiral traversal on a Matrix | |
|---|
| 40 | Matrix | | Search an element in a matriix | |
|---|
| 41 | Matrix | | Find median in a row wise sorted matrix | |
|---|
| 42 | Matrix | | Find row with maximum no. of 1's | |
|---|
| 43 | Matrix | | Print elements in sorted order using row-column wise sorted matrix | |
|---|
| 44 | Matrix | | Maximum size rectangle | |
|---|
| 45 | Matrix | | Find a specific pair in matrix | |
|---|
| 46 | Matrix | | Rotate matrix by 90 degrees | |
|---|
| 47 | Matrix | | Kth smallest element in a row-cpumn wise sorted matrix | |
|---|
| 48 | Matrix | | Common elements in all rows of a given matrix | |
|---|
| 51 | String | | Reverse a String | |
|---|
| 52 | String | | Check whether a String is Palindrome or not | |
|---|
| 53 | String | | Find Duplicate characters in a string | |
|---|
| 55 | String | | Write a Code to check whether one string is a rotation of another | |
|---|
| 56 | String | | Write a Program to check whether a string is a valid shuffle of two strings or not | |
|---|
| 57 | String | | Count and Say problem | |
|---|
| 58 | String | | Write a program to find the longest Palindrome in a string.[ Longest palindromic Substring] | |
|---|
| 59 | String | | Find Longest Recurring Subsequence in String | |
|---|
| 60 | String | | Print all Subsequences of a string. | |
|---|
| 61 | String | | Print all the permutations of the given string | |
|---|
| 62 | String | | Split the Binary string into two substring with equal 0’s and 1’s | |
|---|
| 63 | String | | Word Wrap Problem [VERY IMP]. | |
|---|
| 64 | String | | EDIT Distance [Very Imp] | |
|---|
| 65 | String | | Find next greater number with same set of digits. [Very Very IMP] | |
|---|
| 66 | String | | Balanced Parenthesis problem.[Imp] | |
|---|
| 67 | String | | Word break Problem[ Very Imp] | |
|---|
| 68 | String | | Rabin Karp Algo | |
|---|
| 69 | String | | KMP Algo | |
|---|
| 70 | String | | Convert a Sentence into its equivalent mobile numeric keypad sequence. | |
|---|
| 71 | String | | Minimum number of bracket reversals needed to make an expression balanced. | |
|---|
| 72 | String | | Count All Palindromic Subsequence in a given String. | |
|---|
| 73 | String | | Count of number of given string in 2D character array | |
|---|
| 74 | String | | Search a Word in a 2D Grid of characters. | |
|---|
| 75 | String | | Boyer Moore Algorithm for Pattern Searching. | |
|---|
| 76 | String | | Converting Roman Numerals to Decimal | |
|---|
| 77 | String | | Longest Common Prefix | |
|---|
| 78 | String | | Number of flips to make binary string alternate | |
|---|
| 79 | String | | Find the first repeated word in string. | |
|---|
| 80 | String | | Minimum number of swaps for bracket balancing. | |
|---|
| 81 | String | | Find the longest common subsequence between two strings. | |
|---|
| 82 | String | | Program to generate all possible valid IP addresses from given string. | |
|---|
| 83 | String | | Write a program tofind the smallest window that contains all characters of string itself. | |
|---|
| 84 | String | | Rearrange characters in a string such that no two adjacent are same | |
|---|
| 85 | String | | Minimum characters to be added at front to make string palindrome | |
|---|
| 86 | String | | Given a sequence of words, print all anagrams together | |
|---|
| 87 | String | | Find the smallest window in a string containing all characters of another string | |
|---|
| 88 | String | | Recursively remove all adjacent duplicates | |
|---|
| 89 | String | | String matching where one string contains wildcard characters | |
|---|
| 90 | String | | Function to find Number of customers who could not get a computer | |
|---|
| 91 | String | | Transform One String to Another using Minimum Number of Given Operation | |
|---|
| 92 | String | | Check if two given strings are isomorphic to each other | |
|---|
| 93 | String | | Recursively print all sentences that can be formed from list of word lists | |
|---|
| 96 | Searching & Sorting | | Find first and last positions of an element in a sorted array | |
|---|
| 97 | Searching & Sorting | | Find a Fixed Point (Value equal to index) in a given array | |
|---|
| 98 | Searching & Sorting | | Search in a rotated sorted array | |
|---|
| 99 | Searching & Sorting | | square root of an integer | |
|---|
| 100 | Searching & Sorting | | Maximum and minimum of an array using minimum number of comparisons | |
|---|
| 101 | Searching & Sorting | | Optimum location of point to minimize total distance | |
|---|
| 102 | Searching & Sorting | | Find the repeating and the missing | |
|---|
| 103 | Searching & Sorting | | find majority element | |
|---|
| 104 | Searching & Sorting | | Searching in an array where adjacent differ by at most k | |
|---|
| 105 | Searching & Sorting | | find a pair with a given difference | |
|---|
| 106 | Searching & Sorting | | find four elements that sum to a given value | |
|---|
| 107 | Searching & Sorting | | maximum sum such that no 2 elements are adjacent | |
|---|
| 108 | Searching & Sorting | | Count triplet with sum smaller than a given value | |
|---|
| 109 | Searching & Sorting | | merge 2 sorted arrays | |
|---|
| 110 | Searching & Sorting | | print all subarrays with 0 sum | |
|---|
| 111 | Searching & Sorting | | Product array Puzzle | |
|---|
| 112 | Searching & Sorting | | Sort array according to count of set bits | |
|---|
| 113 | Searching & Sorting | | minimum no. of swaps required to sort the array | |
|---|
| 114 | Searching & Sorting | | Bishu and Soldiers | |
|---|
| 115 | Searching & Sorting | | Rasta and Kheshtak | |
|---|
| 116 | Searching & Sorting | | Kth smallest number again | |
|---|
| 117 | Searching & Sorting | | Find pivot element in a sorted array | |
|---|
| 118 | Searching & Sorting | | K-th Element of Two Sorted Arrays | |
|---|
| 119 | Searching & Sorting | | Aggressive cows | |
|---|
| 120 | Searching & Sorting | | Book Allocation Problem | |
|---|
| 121 | Searching & Sorting | | EKOSPOJ: | |
|---|
| 122 | Searching & Sorting | | Job Scheduling Algo | |
|---|
| 123 | Searching & Sorting | | Missing Number in AP | |
|---|
| 124 | Searching & Sorting | | Smallest number with atleastn trailing zeroes infactorial | |
|---|
| 125 | Searching & Sorting | | Painters Partition Problem: | |
|---|
| 126 | Searching & Sorting | | ROTI-Prata SPOJ | |
|---|
| 127 | Searching & Sorting | | DoubleHelix SPOJ | |
|---|
| 128 | Searching & Sorting | | Subset Sums | |
|---|
| 129 | Searching & Sorting | | Findthe inversion count | |
|---|
| 130 | Searching & Sorting | | Implement Merge-sort in-place | |
|---|
| 131 | Searching & Sorting | | Partitioning and Sorting Arrays with Many Repeated Entries | |
|---|
| 134 | LinkedList | | Write a Program to reverse the Linked List. (Both Iterative and recursive) | |
|---|
| 135 | LinkedList | | Reverse a Linked List in group of Given Size. [Very Imp] | |
|---|
| 136 | LinkedList | | Write a program to Detect loop in a linked list. | |
|---|
| 137 | LinkedList | | Write a program to Delete loop in a linked list. | |
|---|
| 138 | LinkedList | | Find the starting point of the loop. | |
|---|
| 139 | LinkedList | | Remove Duplicates in a sorted Linked List. | |
|---|
| 140 | LinkedList | | Remove Duplicates in a Un-sorted Linked List. | |
|---|
| 141 | LinkedList | | Write a Program to Move the last element to Front in a Linked List. | |
|---|
| 142 | LinkedList | | Add “1” to a number represented as a Linked List. | |
|---|
| 143 | LinkedList | | Add two numbers represented by linked lists. | |
|---|
| 144 | LinkedList | | Intersection of two Sorted Linked List. | |
|---|
| 145 | LinkedList | | Intersection Point of two Linked Lists. | |
|---|
| 146 | LinkedList | | Merge Sort For Linked lists.[Very Important] | |
|---|
| 147 | LinkedList | | Quicksort for Linked Lists.[Very Important] | |
|---|
| 148 | LinkedList | | Find the middle Element of a linked list. | |
|---|
| 149 | LinkedList | | Check if a linked list is a circular linked list. | |
|---|
| 150 | LinkedList | | Split a Circular linked list into two halves. | |
|---|
| 151 | LinkedList | | Write a Program to check whether the Singly Linked list is a palindrome or not. | |
|---|
| 152 | LinkedList | | Deletion from a Circular Linked List. | |
|---|
| 153 | LinkedList | | Reverse a Doubly Linked list. | |
|---|
| 154 | LinkedList | | Find pairs with a given sum in a DLL. | |
|---|
| 155 | LinkedList | | Count triplets in a sorted DLL whose sum is equal to given value “X”. | |
|---|
| 156 | LinkedList | | Sort a “k”sorted Doubly Linked list.[Very IMP] | |
|---|
| 157 | LinkedList | | Rotate DoublyLinked list by N nodes. | |
|---|
| 158 | LinkedList | | Rotate a Doubly Linked list in group of Given Size.[Very IMP] | |
|---|
| 161 | LinkedList | | Flatten a Linked List | |
|---|
| 162 | LinkedList | | Sort a LL of 0's, 1's and 2's | |
|---|
| 163 | LinkedList | | Clone a linked list with next and random pointer | |
|---|
| 164 | LinkedList | | Merge K sorted Linked list | |
|---|
| 165 | LinkedList | | Multiply 2 no. represented by LL | |
|---|
| 166 | LinkedList | | Delete nodes which have a greater value on right side | |
|---|
| 167 | LinkedList | | Segregate even and odd nodes in a Linked List | |
|---|
| 168 | LinkedList | | Program for n’th node from the end of a Linked List | |
|---|
| 169 | LinkedList | | Find the first non-repeating character from a stream of characters | |
|---|
| 172 | Binary Trees | | level order traversal | |
|---|
| 173 | Binary Trees | | Reverse Level Order traversal | |
|---|
| 174 | Binary Trees | | Height of a tree | |
|---|
| 175 | Binary Trees | | Diameter of a tree | |
|---|
| 176 | Binary Trees | | Mirror of a tree | |
|---|
| 177 | Binary Trees | | Inorder Traversal of a tree both using recursion and Iteration | |
|---|
| 178 | Binary Trees | | Preorder Traversal of a tree both using recursion and Iteration | |
|---|
| 179 | Binary Trees | | Postorder Traversal of a tree both using recursion and Iteration | |
|---|
| 180 | Binary Trees | | Left View of a tree | |
|---|
| 181 | Binary Trees | | Right View of Tree | |
|---|
| 182 | Binary Trees | | Top View of a tree | |
|---|
| 183 | Binary Trees | | Bottom View of a tree | |
|---|
| 184 | Binary Trees | | Zig-Zag traversal of a binary tree | |
|---|
| 185 | Binary Trees | | Check if a tree is balanced or not | |
|---|
| 186 | Binary Trees | | Diagnol Traversal of a Binary tree | |
|---|
| 187 | Binary Trees | | Boundary traversal of a Binary tree | |
|---|
| 188 | Binary Trees | | Construct Binary Tree from String with Bracket Representation | |
|---|
| 189 | Binary Trees | | Convert Binary tree into Doubly Linked List | |
|---|
| 190 | Binary Trees | | Convert Binary tree into Sum tree | |
|---|
| 191 | Binary Trees | | Construct Binary tree from Inorder and preorder traversal | |
|---|
| 192 | Binary Trees | | Find minimum swaps required to convert a Binary tree into BST | |
|---|
| 193 | Binary Trees | | Check if Binary tree is Sum tree or not | |
|---|
| 194 | Binary Trees | | Check if all leaf nodes are at same level or not | |
|---|
| 195 | Binary Trees | | Check if a Binary Tree contains duplicate subtrees of size 2 or more [ IMP ] | |
|---|
| 196 | Binary Trees | | Check if 2 trees are mirror or not | |
|---|
| 197 | Binary Trees | | Sum of Nodes on the Longest path from root to leaf node | |
|---|
| 198 | Binary Trees | | Check if given graph is tree or not. [ IMP ] | |
|---|
| 199 | Binary Trees | | Find Largest subtree sum in a tree | |
|---|
| 200 | Binary Trees | | Maximum Sum of nodes in Binary tree such that no two are adjacent | |
|---|
| 201 | Binary Trees | | Print all "K" Sum paths in a Binary tree | |
|---|
| 202 | Binary Trees | | Find LCA in a Binary tree | |
|---|
| 203 | Binary Trees | | Find distance between 2 nodes in a Binary tree | |
|---|
| 204 | Binary Trees | | Kth Ancestor of node in a Binary tree | |
|---|
| 205 | Binary Trees | | Find all Duplicate subtrees in a Binary tree [ IMP ] | |
|---|
| 206 | Binary Trees | | Tree Isomorphism Problem | |
|---|
| 209 | Binary Search Trees | | Fina a value in a BST | |
|---|
| 210 | Binary Search Trees | | Deletion of a node in a BST | |
|---|
| 211 | Binary Search Trees | | Find min and max value in a BST | |
|---|
| 212 | Binary Search Trees | | Find inorder successor and inorder predecessor in a BST | |
|---|
| 213 | Binary Search Trees | | Check if a tree is a BST or not | |
|---|
| 214 | Binary Search Trees | | Populate Inorder successor of all nodes | |
|---|
| 215 | Binary Search Trees | | Find LCA of 2 nodes in a BST | |
|---|
| 216 | Binary Search Trees | | Construct BST from preorder traversal | |
|---|
| 217 | Binary Search Trees | | Convert Binary tree into BST | |
|---|
| 218 | Binary Search Trees | | Convert a normal BST into a Balanced BST | |
|---|
| 219 | Binary Search Trees | | Merge two BST [ V.V.V>IMP ] | |
|---|
| 220 | Binary Search Trees | | Find Kth largest element in a BST | |
|---|
| 221 | Binary Search Trees | | Find Kth smallest element in a BST | |
|---|
| 222 | Binary Search Trees | | Count pairs from 2 BST whose sum is equal to given value "X" | |
|---|
| 223 | Binary Search Trees | | Find the median of BST in O(n) time and O(1) space | |
|---|
| 224 | Binary Search Trees | | Count BST ndoes that lie in a given range | |
|---|
| 225 | Binary Search Trees | | Replace every element with the least greater element on its right | |
|---|
| 226 | Binary Search Trees | | Given "n" appointments, find the conflicting appointments | |
|---|
| 227 | Binary Search Trees | | Check preorder is valid or not | |
|---|
| 228 | Binary Search Trees | | Check whether BST contains Dead end | |
|---|
| 229 | Binary Search Trees | | Largest BST in a Binary Tree [ V.V.V.V.V IMP ] | |
|---|
| 230 | Binary Search Trees | | Flatten BST to sorted list | |
|---|
| 233 | Greedy | | Activity Selection Problem | |
|---|
| 234 | Greedy | | Job SequencingProblem | |
|---|
| 235 | Greedy | | Huffman Coding | |
|---|
| 236 | Greedy | | Water Connection Problem | |
|---|
| 237 | Greedy | | Fractional Knapsack Problem | |
|---|
| 238 | Greedy | | Greedy Algorithm to find Minimum number of Coins | |
|---|
| 239 | Greedy | | Maximum trains for which stoppage can be provided | |
|---|
| 240 | Greedy | | Minimum Platforms Problem | |
|---|
| 241 | Greedy | | Buy Maximum Stocks if i stocks can be bought on i-th day | |
|---|
| 242 | Greedy | | Find the minimum and maximum amount to buy all N candies | |
|---|
| 243 | Greedy | | Minimize Cash Flow among a given set of friends who have borrowed money from each other | |
|---|
| 244 | Greedy | | Minimum Cost to cut a board into squares | |
|---|
| 245 | Greedy | | Check if it is possible to survive on Island | |
|---|
| 246 | Greedy | | Find maximum meetings in one room | |
|---|
| 247 | Greedy | | Maximum product subset of an array | |
|---|
| 248 | Greedy | | Maximize array sum after K negations | |
|---|
| 249 | Greedy | | Maximize the sum of arr[i]*i | |
|---|
| 250 | Greedy | | Maximum sum of absolute difference of an array | |
|---|
| 251 | Greedy | | Maximize sum of consecutive differences in a circular array | |
|---|
| 252 | Greedy | | Minimum sum of absolute difference of pairs of two arrays | |
|---|
| 253 | Greedy | | Program for Shortest Job First (or SJF) CPU Scheduling | |
|---|
| 254 | Greedy | | Program for Least Recently Used (LRU) Page Replacement algorithm | |
|---|
| 255 | Greedy | | Smallest subset with sum greater than all other elements | |
|---|
| 256 | Greedy | | Chocolate Distribution Problem | |
|---|
| 257 | Greedy | | DEFKIN -Defense of a Kingdom | |
|---|
| 258 | Greedy | | DIEHARD -DIE HARD | |
|---|
| 259 | Greedy | | GERGOVIA -Wine trading in Gergovia | |
|---|
| 260 | Greedy | | Picking Up Chicks | |
|---|
| 261 | Greedy | | CHOCOLA –Chocolate | |
|---|
| 262 | Greedy | | ARRANGE -Arranging Amplifiers | |
|---|
| 263 | Greedy | | K Centers Problem | |
|---|
| 264 | Greedy | | Minimum Cost of ropes | |
|---|
| 265 | Greedy | | Find smallest number with given number of digits and sum of digits | |
|---|
| 266 | Greedy | | Rearrange characters in a string such that no two adjacent are same | |
|---|
| 267 | Greedy | | Find maximum sum possible equal sum of three stacks | |
|---|
| 270 | BackTracking | | Rat in a maze Problem | |
|---|
| 271 | BackTracking | | Printing all solutions in N-Queen Problem | |
|---|
| 272 | BackTracking | | Word Break Problem using Backtracking | |
|---|
| 273 | BackTracking | | Remove Invalid Parentheses | |
|---|
| 274 | BackTracking | | Sudoku Solver | |
|---|
| 275 | BackTracking | | m Coloring Problem | |
|---|
| 276 | BackTracking | | Print all palindromic partitions of a string | |
|---|
| 277 | BackTracking | | Subset Sum Problem | |
|---|
| 278 | BackTracking | | The Knight’s tour problem | |
|---|
| 279 | BackTracking | | Tug of War | |
|---|
| 280 | BackTracking | | Find shortest safe route in a path with landmines | |
|---|
| 281 | BackTracking | | Combinational Sum | |
|---|
| 282 | BackTracking | | Find Maximum number possible by doing at-most K swaps | |
|---|
| 283 | BackTracking | | Print all permutations of a string | |
|---|
| 284 | BackTracking | | Find if there is a path of more than k length from a source | |
|---|
| 285 | BackTracking | | Longest Possible Route in a Matrix with Hurdles | |
|---|
| 286 | BackTracking | | Print all possible paths from top left to bottom right of a mXn matrix | |
|---|
| 287 | BackTracking | | Partition of a set intoK subsets with equal sum | |
|---|
| 288 | BackTracking | | Find the K-th Permutation Sequence of first N natural numbers | |
|---|
| 291 | Stacks & Queues | | Implement Stack from Scratch | |
|---|
| 292 | Stacks & Queues | | Implement Queue from Scratch | |
|---|
| 293 | Stacks & Queues | | Implement 2 stack in an array | |
|---|
| 294 | Stacks & Queues | | find the middle element of a stack | |
|---|
| 295 | Stacks & Queues | | Implement "N" stacks in an Array | |
|---|
| 296 | Stacks & Queues | | Check the expression has valid or Balanced parenthesis or not. | |
|---|
| 297 | Stacks & Queues | | Reverse a String using Stack | |
|---|
| 298 | Stacks & Queues | | Design a Stack that supports getMin() in O(1) time and O(1) extra space. | |
|---|
| 299 | Stacks & Queues | | Find the next Greater element | |
|---|
| 300 | Stacks & Queues | | The celebrity Problem | |
|---|
| 301 | Stacks & Queues | | Arithmetic Expression evaluation | |
|---|
| 302 | Stacks & Queues | | Evaluation of Postfix expression | |
|---|
| 303 | Stacks & Queues | | Implement a method to insert an element at its bottom without using any other data structure. | |
|---|
| 304 | Stacks & Queues | | Reverse a stack using recursion | |
|---|
| 305 | Stacks & Queues | | Sort a Stack using recursion | |
|---|
| 306 | Stacks & Queues | | Merge Overlapping Intervals | |
|---|
| 307 | Stacks & Queues | | Largest rectangular Area in Histogram | |
|---|
| 308 | Stacks & Queues | | Length of the Longest Valid Substring | |
|---|
| 309 | Stacks & Queues | | Expression contains redundant bracket or not | |
|---|
| 310 | Stacks & Queues | | Implement Stack using Queue | |
|---|
| 311 | Stacks & Queues | | Implement Stack using Deque | |
|---|
| 312 | Stacks & Queues | | Stack Permutations (Check if an array is stack permutation of other) | |
|---|
| 313 | Stacks & Queues | | Implement Queue using Stack | |
|---|
| 314 | Stacks & Queues | | Implement "n" queue in an array | |
|---|
| 315 | Stacks & Queues | | Implement a Circular queue | |
|---|
| 316 | Stacks & Queues | | LRU Cache Implementationa | |
|---|
| 317 | Stacks & Queues | | Reverse a Queue using recursion | |
|---|
| 318 | Stacks & Queues | | Reverse the first “K” elements of a queue | |
|---|
| 319 | Stacks & Queues | | Interleave the first half of the queue with second half | |
|---|
| 320 | Stacks & Queues | | Find the first circular tour that visits all Petrol Pumps | |
|---|
| 321 | Stacks & Queues | | Minimum time required to rot all oranges | |
|---|
| 322 | Stacks & Queues | | Distance of nearest cell having 1 in a binary matrix | |
|---|
| 323 | Stacks & Queues | | First negative integer in every window of size “k” | |
|---|
| 324 | Stacks & Queues | | Check if all levels of two trees are anagrams or not. | |
|---|
| 325 | Stacks & Queues | | Sum of minimum and maximum elements of all subarrays of size “k”. | |
|---|
| 326 | Stacks & Queues | | Minimum sum of squares of character counts in a given string after removing “k” characters. | |
|---|
| 327 | Stacks & Queues | | Queue based approach or first non-repeating character in a stream. | |
|---|
| 328 | Stacks & Queues | | Next Smaller Element | |
|---|
| 331 | Heap | | Implement a Maxheap/MinHeap using arrays and recursion. | |
|---|
| 332 | Heap | | Sort an Array using heap. (HeapSort) | |
|---|
| 333 | Heap | | Maximum of all subarrays of size k. | |
|---|
| 334 | Heap | | “k” largest element in an array | |
|---|
| 335 | Heap | | Kth smallest and largest element in an unsorted array | |
|---|
| 336 | Heap | | Merge “K” sorted arrays. [ IMP ] | |
|---|
| 337 | Heap | | Merge 2 Binary Max Heaps | |
|---|
| 338 | Heap | | Kth largest sum continuous subarrays | |
|---|
| 339 | Heap | | Leetcode- reorganize strings | |
|---|
| 340 | Heap | | Merge “K” Sorted Linked Lists [V.IMP] | |
|---|
| 341 | Heap | | Smallest range in “K” Lists | |
|---|
| 342 | Heap | | Median in a stream of Integers | |
|---|
| 343 | Heap | | Check if a Binary Tree is Heap | |
|---|
| 344 | Heap | | Connect “n” ropes with minimum cost | |
|---|
| 345 | Heap | | Convert BST to Min Heap | |
|---|
| 346 | Heap | | Convert min heap to max heap | |
|---|
| 347 | Heap | | Rearrange characters in a string such that no two adjacent are same. | |
|---|
| 348 | Heap | | Minimum sum of two numbers formed from digits of an array | |
|---|
| 351 | Graph | | Create a Graph, print it | |
|---|
| 352 | Graph | | Implement BFS algorithm | |
|---|
| 353 | Graph | | Implement DFS Algo | |
|---|
| 354 | Graph | | Detect Cycle in Directed Graph using BFS/DFS Algo | |
|---|
| 355 | Graph | | Detect Cycle in UnDirected Graph using BFS/DFS Algo | |
|---|
| 356 | Graph | | Search in a Maze | |
|---|
| 357 | Graph | | Minimum Step by Knight | |
|---|
| 358 | Graph | | flood fill algo | |
|---|
| 359 | Graph | | Clone a graph | |
|---|
| 360 | Graph | | Making wired Connections | |
|---|
| 361 | Graph | | word Ladder | |
|---|
| 362 | Graph | | Dijkstra algo | |
|---|
| 363 | Graph | | Implement Topological Sort | |
|---|
| 364 | Graph | | Minimum time taken by each job to be solved given by a Directed Acyclic Graph | |
|---|
| 365 | Graph | | Find whether it is possible to finish all tasks or not from given dependencies | |
|---|
| 366 | Graph | | Find the no. of Isalnds | |
|---|
| 367 | Graph | | Given a sorted Dictionary of an Alien Language, find order of characters | |
|---|
| 368 | Graph | | Implement Kruksal’sAlgorithm | |
|---|
| 369 | Graph | | Implement Prim’s Algorithm | |
|---|
| 370 | Graph | | Total no. of Spanning tree in a graph | |
|---|
| 371 | Graph | | Implement Bellman Ford Algorithm | |
|---|
| 372 | Graph | | Implement Floyd warshallAlgorithm | |
|---|
| 373 | Graph | | Travelling Salesman Problem | |
|---|
| 374 | Graph | | Graph ColouringProblem | |
|---|
| 375 | Graph | | Snake and Ladders Problem | |
|---|
| 376 | Graph | | Find bridge in a graph | |
|---|
| 377 | Graph | | Count Strongly connected Components(Kosaraju Algo) | |
|---|
| 378 | Graph | | Check whether a graph is Bipartite or Not | |
|---|
| 379 | Graph | | Detect Negative cycle in a graph | |
|---|
| 380 | Graph | | Longest path in a Directed Acyclic Graph | |
|---|
| 381 | Graph | | Journey to the Moon | |
|---|
| 382 | Graph | | Cheapest Flights Within K Stops | |
|---|
| 383 | Graph | | Oliver and the Game | |
|---|
| 384 | Graph | | Water Jug problem using BFS | |
|---|
| 385 | Graph | | Water Jug problem using BFS | |
|---|
| 386 | Graph | | Find if there is a path of more thank length from a source | |
|---|
| 387 | Graph | | M-ColouringProblem | |
|---|
| 388 | Graph | | Minimum edges to reverse o make path from source to destination | |
|---|
| 389 | Graph | | Paths to travel each nodes using each edge(Seven Bridges) | |
|---|
| 390 | Graph | | Vertex Cover Problem | |
|---|
| 391 | Graph | | Chinese Postman or Route Inspection | |
|---|
| 392 | Graph | | Number of Triangles in a Directed and Undirected Graph | |
|---|
| 393 | Graph | | Minimise the cashflow among a given set of friends who have borrowed money from each other | |
|---|
| 394 | Graph | | Two Clique Problem | |
|---|
| 397 | Trie | | Construct a trie from scratch | |
|---|
| 398 | Trie | | Find shortest unique prefix for every word in a given list | |
|---|
| 399 | Trie | | Word Break Problem | (Trie solution) | |
|---|
| 400 | Trie | | Given a sequence of words, print all anagrams together | |
|---|
| 401 | Trie | | Implement a Phone Directory | |
|---|
| 402 | Trie | | Print unique rows in a given boolean matrix | |
|---|
| 405 | Dynamic Programming | | Coin ChangeProblem | |
|---|
| 406 | Dynamic Programming | | Knapsack Problem | |
|---|
| 407 | Dynamic Programming | | Binomial CoefficientProblem | |
|---|
| 408 | Dynamic Programming | | Permutation CoefficientProblem | |
|---|
| 409 | Dynamic Programming | | Program for nth Catalan Number | |
|---|
| 410 | Dynamic Programming | | Matrix Chain Multiplication | |
|---|
| 411 | Dynamic Programming | | Edit Distance | |
|---|
| 412 | Dynamic Programming | | Subset Sum Problem | |
|---|
| 413 | Dynamic Programming | | Friends Pairing Problem | |
|---|
| 414 | Dynamic Programming | | Gold Mine Problem | |
|---|
| 415 | Dynamic Programming | | Assembly Line SchedulingProblem | |
|---|
| 416 | Dynamic Programming | | Painting the Fenceproblem | |
|---|
| 417 | Dynamic Programming | | Maximize The Cut Segments | |
|---|
| 418 | Dynamic Programming | | Longest Common Subsequence | |
|---|
| 419 | Dynamic Programming | | Longest Repeated Subsequence | |
|---|
| 420 | Dynamic Programming | | Longest Increasing Subsequence | |
|---|
| 421 | Dynamic Programming | | Space Optimized Solution of LCS | |
|---|
| 422 | Dynamic Programming | | LCS (Longest Common Subsequence) of three strings | |
|---|
| 423 | Dynamic Programming | | Maximum Sum Increasing Subsequence | |
|---|
| 424 | Dynamic Programming | | Count all subsequences having product less than K | |
|---|
| 425 | Dynamic Programming | | Longest subsequence such that difference between adjacent is one | |
|---|
| 426 | Dynamic Programming | | Maximum subsequence sum such that no three are consecutive | |
|---|
| 427 | Dynamic Programming | | Egg Dropping Problem | |
|---|
| 428 | Dynamic Programming | | Maximum Length Chain of Pairs | |
|---|
| 429 | Dynamic Programming | | Maximum size square sub-matrix with all 1s | |
|---|
| 430 | Dynamic Programming | | Maximum sum of pairs with specific difference | |
|---|
| 431 | Dynamic Programming | | Min Cost PathProblem | |
|---|
| 432 | Dynamic Programming | | Maximum difference of zeros and ones in binary string | |
|---|
| 433 | Dynamic Programming | | Minimum number of jumps to reach end | |
|---|
| 434 | Dynamic Programming | | Minimum cost to fill given weight in a bag | |
|---|
| 435 | Dynamic Programming | | Minimum removals from array to make max –min <= K | |
|---|
| 436 | Dynamic Programming | | Longest Common Substring | |
|---|
| 437 | Dynamic Programming | | Count number of ways to reacha given score in a game | |
|---|
| 438 | Dynamic Programming | | Count Balanced Binary Trees of Height h | |
|---|
| 439 | Dynamic Programming | | LargestSum Contiguous Subarray [V>V>V>V IMP ] | |
|---|
| 440 | Dynamic Programming | | Smallest sum contiguous subarray | |
|---|
| 441 | Dynamic Programming | | Unbounded Knapsack (Repetition of items allowed) | |
|---|
| 442 | Dynamic Programming | | Word Break Problem | |
|---|
| 443 | Dynamic Programming | | Largest Independent Set Problem | |
|---|
| 444 | Dynamic Programming | | Partition problem | |
|---|
| 445 | Dynamic Programming | | Longest Palindromic Subsequence | |
|---|
| 446 | Dynamic Programming | | Count All Palindromic Subsequence in a given String | |
|---|
| 447 | Dynamic Programming | | Longest Palindromic Substring | |
|---|
| 448 | Dynamic Programming | | Longest alternating subsequence | |
|---|
| 449 | Dynamic Programming | | Weighted Job Scheduling | |
|---|
| 450 | Dynamic Programming | | Coin game winner where every player has three choices | |
|---|
| 451 | Dynamic Programming | | Count Derangements (Permutation such that no element appears in its original position) [ IMPORTANT ] | |
|---|
| 452 | Dynamic Programming | | Maximum profit by buying and selling a share at most twice [ IMP ] | |
|---|
| 453 | Dynamic Programming | | Optimal Strategy for a Game | |
|---|
| 454 | Dynamic Programming | | Optimal Binary Search Tree | |
|---|
| 455 | Dynamic Programming | | Palindrome PartitioningProblem | |
|---|
| 456 | Dynamic Programming | | Word Wrap Problem | |
|---|
| 457 | Dynamic Programming | | Mobile Numeric Keypad Problem [ IMP ] | |
|---|
| 458 | Dynamic Programming | | Boolean Parenthesization Problem | |
|---|
| 459 | Dynamic Programming | | Largest rectangular sub-matrix whose sum is 0 | |
|---|
| 460 | Dynamic Programming | | Largest area rectangular sub-matrix with equal number of 1’s and 0’s [ IMP ] | |
|---|
| 461 | Dynamic Programming | | Maximum sum rectangle in a 2D matrix | |
|---|
| 462 | Dynamic Programming | | Maximum profit by buying and selling a share at most k times | |
|---|
| 463 | Dynamic Programming | | Find if a string is interleaved of two other strings | |
|---|
| 464 | Dynamic Programming | | Maximum Length of Pair Chain | |
|---|
| 467 | Bit Manipulation | | Count set bits in an integer | |
|---|
| 468 | Bit Manipulation | | Find the two non-repeating elements in an array of repeating elements | |
|---|
| 469 | Bit Manipulation | | Count number of bits to be flipped to convert A to B | |
|---|
| 470 | Bit Manipulation | | Count total set bits in all numbers from 1 to n | |
|---|
| 471 | Bit Manipulation | | Program to find whether a no is power of two | |
|---|
| 472 | Bit Manipulation | | Find position of the only set bit | |
|---|
| 473 | Bit Manipulation | | Copy set bits in a range | |
|---|
| 474 | Bit Manipulation | | Divide two integers without using multiplication, division and mod operator | |
|---|
| 475 | Bit Manipulation | | Calculate square of a number without using *, / and pow() | |
|---|
| 476 | Bit Manipulation | | Power Set | |
|---|