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