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