Popular DSA SheetPopular

Striver's A2Z

A comprehensive DSA sheet covering important topics from fundamentals to advanced concepts.

473Problems
18Topics
StructuredLearning
Learning Path

Explore topics

18 sections

Problem Explorer

473

Practice in sequence.

01
Input Output
Basics
TUF
02
Cpp Basics
Basics
TUF
03
If ElseIf
Basics
TUF
04
Switch Case
Basics
TUF
05
What are arrays, strings?
Basics
TUF
06
For loops
Basics
TUF
07
While loops
Basics
TUF
08
Functions (Pass by Reference and Value)
Basics
TUF
09
Theory with examples
Basics
TUF
10
Easy and Medium
Basics
TUF
11
Hard
Basics
TUF
12
Pattern 1
Basics
TUF
13
Pattern 2
Basics
TUF
14
Pattern 3
Basics
TUF
15
Pattern 4
Basics
TUF
16
Pattern 5
Basics
TUF
17
Pattern 6
Basics
TUF
18
Pattern 7
Basics
TUF
19
Pattern 8
Basics
TUF
20
Pattern 9
Basics
TUF
21
Pattern 10
Basics
TUF
22
Pattern 11
Basics
TUF
23
Pattern 12
Basics
TUF
24
Pattern 13
Basics
TUF
25
Pattern 14
Basics
TUF
26
Pattern 15
Basics
TUF
27
Pattern 16
Basics
TUF
28
Pattern 17
Basics
TUF
29
Pattern 18
Basics
TUF
30
Pattern 19
Basics
TUF
31
Pattern 20
Basics
TUF
32
Pattern 21
Basics
TUF
33
Pattern 22
Basics
TUF
34
STL
Basics
TUF
35
Java Collections
Basics
TUF
36
Count all Digits of a Number
Basics
TUF
37
Reverse a number
Basics
LC
38
Palindrome Number
Basics
LC
39
GCD of Two Numbers
Basics
TUF
40
Check if the Number is Armstrong
Basics
LC
41
Print all Divisors
Basics
TUF
42
Check for Prime Number
Basics
TUF
43
Understand recursion by print something N times
Basics
TUF
44
Print name N times using recursion
Basics
TUF
45
Print 1 to N using Recursion
Basics
TUF
46
Print N to 1 using Recursion
Basics
TUF
47
Sum of First N Numbers
Basics
TUF
48
Factorial of a given number
Basics
TUF
49
Reverse an array
Basics
TUF
50
Check if String is Palindrome or Not
Basics
LC
51
Fibonacci Number
Basics
LC
52
Basic Hashing
Basics
TUF
53
Counting Frequencies of Array Elements
Basics
TUF
54
Highest Occurring Element in an Array
Basics
TUF
55
Selection Sort
Sorting
TUF
56
Bubble Sort
Sorting
TUF
57
Insertion Sorting
Sorting
TUF
58
Merge Sorting
Sorting
TUF
59
Recursive Bubble Sort
Sorting
TUF
60
Recursive Insertion Sort
Sorting
TUF
61
Quick Sorting
Sorting
TUF
62
Largest Element
Arrays
TUF
63
Second Largest Element
Arrays
TUF
64
Check if the Array is Sorted II
Arrays
LC
65
Remove duplicates from Sorted array
Arrays
LC
66
Left Rotate Array by One
Arrays
LC
67
Left Rotate Array by K Places
Arrays
LC
68
Move Zeros to End
Arrays
LC
69
Linear Search
Arrays
TUF
70
Union of two sorted arrays
Arrays
TUF
71
Find missing number
Arrays
TUF
72
Maximum Consecutive Ones
Arrays
LC
73
Find the number that appears once, and other numbers twice.
Arrays
LC
74
Longest subarray with given sum K(positives)
Arrays
TUF
75
Longest subarray with sum K
Arrays
TUF
76
Two Sum
Arrays
LC
77
Sort an array of 0's 1's and 2's
Arrays
LC
78
Majority Element-I
Arrays
LC
79
Kadane's Algorithm
Arrays
LC
80
Print subarray with maximum subarray sum (extended version of above problem)
Arrays
TUF
81
Stock Buy and Sell
Arrays
LC
82
Rearrange array elements by sign
Arrays
LC
83
Next Permutation
Arrays
LC
84
Leaders in an Array
Arrays
TUF
85
Longest Consecutive Sequence in an Array
Arrays
LC
86
Set Matrix Zeroes
Arrays
LC
87
Rotate matrix by 90 degrees
Arrays
LC
88
Print the matrix in spiral manner
Arrays
LC
89
Count subarrays with given sum
Arrays
LC
90
Pascal's Triangle I
Arrays
LC
91
Majority Element-II
Arrays
LC
92
3 Sum
Arrays
LC
93
4 Sum
Arrays
LC
94
Largest Subarray with Sum 0
Arrays
TUF
95
Count subarrays with given xor K
Arrays
TUF
96
Merge Overlapping Subintervals
Arrays
LC
97
Merge two sorted arrays without extra space
Arrays
LC
98
Find the repeating and missing number
Arrays
TUF
99
Count Inversions
Arrays
TUF
100
Reverse Pairs
Arrays
LC
101
Maximum Product Subarray in an Array
Arrays
LC
102
Search X in sorted array
Binary Search
LC
103
Lower Bound
Binary Search
TUF
104
Upper Bound
Binary Search
TUF
105
Search insert position
Binary Search
LC
106
Floor and Ceil in Sorted Array
Binary Search
TUF
107
First and last occurrence
Binary Search
LC
108
Count Occurrences in a Sorted Array
Binary Search
TUF
109
Search in rotated sorted array-I
Binary Search
LC
110
Search in rotated sorted array-II
Binary Search
LC
111
Find minimum in Rotated Sorted Array
Binary Search
LC
112
Find out how many times the array is rotated
Binary Search
TUF
113
Single element in a Sorted Array
Binary Search
LC
114
Find peak element
Binary Search
LC
115
Find square root of a number
Binary Search
TUF
116
Find Nth root of a number
Binary Search
TUF
117
Koko eating bananas
Binary Search
LC
118
Minimum days to make M bouquets
Binary Search
LC
119
Find the smallest divisor
Binary Search
LC
120
Capacity to Ship Packages Within D Days
Binary Search
LC
121
Kth Missing Positive Number
Binary Search
LC
122
Aggressive Cows
Binary Search
TUF
123
Book Allocation Problem
Binary Search
TUF
124
Split array - largest sum
Binary Search
LC
125
Painter's Partition
Binary Search
TUF
126
Minimize Max Distance to Gas Station
Binary Search
LC
127
Median of 2 sorted arrays
Binary Search
LC
128
Kth element of 2 sorted arrays
Binary Search
TUF
129
Find row with maximum 1's
Binary Search
TUF
130
Search in a 2D matrix
Binary Search
LC
131
Search in 2D matrix - II
Binary Search
LC
132
Find Peak Element - II
Binary Search
LC
133
Matrix Median
Binary Search
TUF
134
Remove Outermost Parentheses
Strings
LC
135
Reverse words in a given string / Palindrome Check
Strings
LC
136
Largest Odd Number in a String
Strings
LC
137
Longest Common Prefix
Strings
LC
138
Isomorphic String
Strings
LC
139
Rotate String
Strings
LC
140
Check if two strings are anagram of each other
Strings
LC
141
Sort Characters by Frequency
Strings
LC
142
Maximum Nesting Depth of the Parentheses
Strings
LC
143
Roman to Integer
Strings
LC
144
String to Integer (atoi)
Strings
LC
145
Count Number of Substrings
Strings
TUF
146
Longest Palindromic Substring
Strings
LC
147
Sum of Beauty of All Substrings
Strings
LC
148
Reverse every word in a string
Strings
LC
149
Introduction to Singly LinkedList
Linked List
TUF
150
Insertion at the head of Linked List
Linked List
TUF
151
Deletion of the head of LL
Linked List
LC
152
Find the length of the Linked List
Linked List
TUF
153
Search in Linked List
Linked List
TUF
154
Introduction to Doubly LL
Linked List
TUF
155
Insert node before head in Doubly Linked List
Linked List
TUF
156
Delete head of Doubly Linked List
Linked List
TUF
157
Reverse a Doubly Linked List
Linked List
TUF
158
Middle of a LinkedList [TortoiseHare Method]
Linked List
LC
159
Reverse a LinkedList [Iterative]
Linked List
LC
160
Reverse a LL
Linked List
LC
161
Detect a loop in LL
Linked List
LC
162
Find the starting point in LL
Linked List
LC
163
Length of loop in LL
Linked List
TUF
164
Check if LL is palindrome or not
Linked List
LC
165
Segregate odd and even nodes in Linked List
Linked List
LC
166
Remove Nth node from the back of the LL
Linked List
LC
167
Delete the middle node in LL
Linked List
LC
168
Sort LL
Linked List
LC
169
Sort a Linked List of 0's 1's and 2's
Linked List
TUF
170
Find the intersection point of Y LL
Linked List
LC
171
Add one to a number represented by LL
Linked List
TUF
172
Add two numbers in Linked List
Linked List
LC
173
Delete all occurrences of a key in DLL
Linked List
TUF
174
Find Pairs with Given Sum in Doubly Linked List
Linked List
TUF
175
Remove duplicates from sorted DLL
Linked List
TUF
176
Reverse LL in group of given size K
Linked List
LC
177
Rotate a LL
Linked List
LC
178
Flattening of LL
Linked List
TUF
179
Clone a LL with random and next pointer
Linked List
LC
180
Recursive Implementation of atoi()
Recursion
LC
181
Pow(x, n)
Recursion
LC
182
Count Good Numbers
Recursion
LC
183
Sort a stack using recursion
Recursion
TUF
184
Reverse a Stack
Recursion
TUF
185
Generate Binary Strings Without Consecutive 1s
Recursion
TUF
186
Generate Parentheses
Recursion
LC
187
Power Set
Recursion
TUF
188
Learn All Patterns of Subsequences (Theory)
Recursion
TUF
189
Count all subsequences with sum K
Recursion
TUF
190
Check if there exists a subsequence with sum K
Recursion
TUF
191
Combination Sum
Recursion
LC
192
Combination Sum II
Recursion
LC
193
Subsets I
Recursion
TUF
194
Subsets II
Recursion
LC
195
Combination Sum III
Recursion
LC
196
Letter Combinations of a Phone Number
Recursion
LC
197
Palindrome partitioning
Recursion
TUF
198
Word Search
Recursion
LC
199
N Queen
Recursion
LC
200
Rat in a Maze
Recursion
TUF
201
Word Break
Recursion
TUF
202
M Coloring Problem
Recursion
TUF
203
Sudoku Solver
Recursion
LC
204
Expression Add Operators
Recursion
LC
205
Introduction to Bits and Tricks
Bit Manipulation
TUF
206
Check if the i-th bit is Set or Not
Bit Manipulation
TUF
207
Check if a Number is Odd or Not
Bit Manipulation
TUF
208
Check if a Number is Power of 2 or Not
Bit Manipulation
LC
209
Count the Number of Set Bits
Bit Manipulation
TUF
210
Set/Unset the rightmost unset bit
Bit Manipulation
TUF
211
Swap Two Numbers
Bit Manipulation
TUF
212
Divide two numbers without multiplication and division
Bit Manipulation
LC
213
Minimum Bit Flips to Convert Number
Bit Manipulation
LC
214
Single Number - I
Bit Manipulation
LC
215
Power Set Bit Manipulation
Bit Manipulation
LC
216
XOR of numbers in a given range
Bit Manipulation
TUF
217
Single Number - III
Bit Manipulation
TUF
218
Print Prime Factors of a Number
Bit Manipulation
TUF
219
Divisors of a Number
Bit Manipulation
TUF
220
Count primes in range L to R
Bit Manipulation
LC
221
Prime factorisation of a Number
Bit Manipulation
TUF
222
Pow(x,n)
Bit Manipulation
LC
223
Implement Stack using Arrays
Stack & Queue
TUF
224
Implement Queue using Arrays
Stack & Queue
TUF
225
Implement Stack using Queue
Stack & Queue
LC
226
Implement Queue using Stack
Stack & Queue
LC
227
Implement stack using Linkedlist
Stack & Queue
TUF
228
Implement queue using Linkedlist
Stack & Queue
TUF
229
Balanced Paranthesis
Stack & Queue
LC
230
Implement Min Stack
Stack & Queue
LC
231
Infix to Postfix Conversion
Stack & Queue
TUF
232
Prefix to Infix Conversion
Stack & Queue
TUF
233
Prefix to Postfix Conversion
Stack & Queue
TUF
234
Postfix to Prefix Conversion
Stack & Queue
TUF
235
Postfix to Infix Conversion
Stack & Queue
TUF
236
Infix to Prefix Conversion
Stack & Queue
TUF
237
Next Greater Element
Stack & Queue
LC
238
Next Greater Element - 2
Stack & Queue
LC
239
Next Smaller Element
Stack & Queue
TUF
240
Number of Greater Elements to the Right
Stack & Queue
TUF
241
Trapping Rainwater
Stack & Queue
LC
242
Sum of Subarray Minimums
Stack & Queue
LC
243
Asteroid Collision
Stack & Queue
LC
244
Sum of Subarray Ranges
Stack & Queue
LC
245
Remove K Digits
Stack & Queue
LC
246
Largest rectangle in a histogram
Stack & Queue
LC
247
Maximum Rectangles
Stack & Queue
LC
248
Sliding Window Maximum
Stack & Queue
LC
249
Stock span problem
Stack & Queue
LC
250
Celebrity Problem
Stack & Queue
LC
251
LRU Cache
Stack & Queue
TUF
252
LFU Cache
Stack & Queue
LC
253
Longest Substring Without Repeating Characters
Sliding Window
LC
254
Max Consecutive Ones III
Sliding Window
LC
255
Fruit Into Baskets
Sliding Window
TUF
256
Longest Repeating Character Replacement
Sliding Window
LC
257
Binary Subarrays With Sum
Sliding Window
LC
258
Count number of Nice subarrays
Sliding Window
LC
259
Number of Substrings Containing All Three Characters
Sliding Window
LC
260
Maximum Points You Can Obtain from Cards
Sliding Window
LC
261
Longest Substring With At Most K Distinct Characters
Sliding Window
LC
262
Subarrays with K Different Integers
Sliding Window
LC
263
Minimum Window Substring
Sliding Window
LC
264
Minimum Window Subsequence
Sliding Window
LC
265
Kth smallest element in an array [use priority queue]
Heaps
TUF
266
Heaps (Theory Video)
Heaps
TUF
267
Implement Min Heap
Heaps
TUF
268
Check if an array represents a min heap
Heaps
TUF
269
Convert Min Heap to Max Heap
Heaps
TUF
270
K-th Largest element in an array
Heaps
TUF
271
Sort K sorted array
Heaps
TUF
272
Merge K sorted Lists
Heaps
LC
273
Replace Elements by Their Rank
Heaps
TUF
274
Task Scheduler
Heaps
LC
275
Hand of Straights
Heaps
LC
276
Design Twitter
Heaps
LC
277
Minimum Cost to Connect Sticks
Heaps
TUF
278
Kth largest element in a stream of running integers
Heaps
LC
279
Maximum Sum Combination
Heaps
TUF
280
Find Median from Data Stream
Heaps
LC
281
Top K Frequent Elements
Heaps
LC
282
Assign Cookies
Greedy
LC
283
Fractional Knapsack
Greedy
TUF
284
Lemonade Change
Greedy
LC
285
Valid Paranthesis Checker
Greedy
LC
286
N meetings in one room
Greedy
TUF
287
Jump Game - I
Greedy
LC
288
Jump Game II
Greedy
LC
289
Minimum number of platforms required for a railway
Greedy
TUF
290
Job sequencing Problem
Greedy
TUF
291
Candy
Greedy
LC
292
Shortest Job First
Greedy
TUF
293
Program for Least Recently Used (LRU) Page Replacement Algorithm
Greedy
TUF
294
Insert Interval
Greedy
LC
295
Merge Intervals
Greedy
LC
296
Non-overlapping Intervals
Greedy
LC
297
Introduction to Trees
Binary Trees
TUF
298
Binary Tree Representation in Java
Binary Trees
TUF
299
Pre, Post, Inorder in one traversal
Binary Trees
TUF
300
Preorder Traversal
Binary Trees
LC
301
Inorder Traversal of Binary Tree
Binary Trees
LC
302
Postorder Traversal
Binary Trees
LC
303
Level Order Traversal
Binary Trees
LC
304
Iterative Preorder Traversal of Binary Tree
Binary Trees
LC
305
Iterative Inorder Traversal of Binary Tree
Binary Trees
LC
306
Post-order Traversal of Binary Tree using 2 stack
Binary Trees
LC
307
Post-order Traversal of Binary Tree using 1 stack
Binary Trees
LC
308
Preorder, Inorder, and Postorder Traversal in one Traversal
Binary Trees
TUF
309
Maximum Depth in BT
Binary Trees
LC
310
Check for balanced binary tree
Binary Trees
LC
311
Diameter of Binary Tree
Binary Trees
LC
312
Maximum path sum
Binary Trees
LC
313
Check if two trees are identical or not
Binary Trees
LC
314
Zig Zag or Spiral Traversal
Binary Trees
LC
315
Boundary Traversal
Binary Trees
LC
316
Vertical Order Traversal
Binary Trees
LC
317
Top View of BT
Binary Trees
TUF
318
Bottom view of BT
Binary Trees
TUF
319
Right/Left View of Binary Tree
Binary Trees
LC
320
Symmetric Binary Tree
Binary Trees
LC
321
Print root to leaf path in BT
Binary Trees
TUF
322
LCA in BT
Binary Trees
LC
323
Maximum Width of BT
Binary Trees
LC
324
Children Sum Property in Binary Tree
Binary Trees
TUF
325
Print all nodes at a distance of K in BT
Binary Trees
LC
326
Minimum time taken to burn the BT from a given Node
Binary Trees
TUF
327
Count total nodes in a complete BT
Binary Trees
LC
328
Requirements needed to construct a unique BT
Binary Trees
TUF
329
Construct a BT from Preorder and Inorder
Binary Trees
LC
330
Construct the Binary Tree from Postorder and Inorder Traversal
Binary Trees
LC
331
Serialize and De-serialize BT
Binary Trees
LC
332
Morris Preorder Traversal of a Binary Tree
Binary Trees
LC
333
Morris Inorder Traversal of a Binary Tree
Binary Trees
LC
334
Flatten Binary Tree to Linked List
Binary Trees
LC
335
Check for Children Sum Property
Binary Trees
TUF
336
Requirements needed to construct a unique BT
Binary Trees
TUF
337
Construct a BT from Preorder and Inorder
Binary Trees
LC
338
Construct the Binary Tree from Postorder and Inorder Traversal
Binary Trees
LC
339
Serialize and De-serialize BT
Binary Trees
LC
340
Morris Preorder Traversal of a Binary Tree
Binary Trees
LC
341
Morris Inorder Traversal of a Binary Tree
Binary Trees
LC
342
Flatten Binary Tree to Linked List
Binary Trees
LC
343
Binary Tree to DLL
Binary Trees
TUF
344
Maximum Sum of Non-Adjacent Nodes
Binary Trees
TUF
345
Serialize and De-serialize BT
Binary Trees
LC
346
Introduction to BST
BST
TUF
347
Search in a BST
BST
LC
348
Ceil in BST
BST
TUF
349
Floor in BST
BST
TUF
350
Insert a given Node in BST
BST
LC
351
Delete a given Node in BST
BST
LC
352
Kth Smallest and Largest Element in BST
BST
LC
353
Check if a tree is a BST or BT
BST
LC
354
LCA in BST
BST
LC
355
Construct a BST from a preorder traversal
BST
LC
356
Inorder Successor/Predecessor in BST
BST
TUF
357
Two Sum In BST : Check if there exists a pair with Sum K
BST
LC
358
Recover BST
BST
LC
359
Largest BST in Binary Tree
BST
TUF
360
Introduction to Graphs
Graphs
TUF
361
Graph and Types
Graphs
TUF
362
Graph Representation - adjacency matrix and list
Graphs
TUF
363
Connected Components
Graphs
TUF
364
BFS
Graphs
TUF
365
DFS
Graphs
TUF
366
Number of provinces
Graphs
LC
367
Number of islands
Graphs
LC
368
Flood fill
Graphs
LC
369
Rotten oranges
Graphs
LC
370
Cycle Detection in Undirected Graph using BFS
Graphs
TUF
371
Topo Sort
Graphs
TUF
372
Topological sort or Kahn's algorithm
Graphs
TUF
373
Detect a cycle in a directed graph
Graphs
LC
374
Course Schedule I
Graphs
LC
375
Course Schedule II
Graphs
LC
376
Find eventual safe states
Graphs
LC
377
Alien Dictionary
Graphs
LC
378
Shortest path in undirected graph with unit weights
Graphs
TUF
379
Shortest path in DAG
Graphs
TUF
380
Djisktra's Algorithm
Graphs
TUF
381
Why priority Queue is used in Djisktra's Algorithm
Graphs
TUF
382
Shortest Distance in a Binary Maze
Graphs
LC
383
Path with minimum effort
Graphs
LC
384
Cheapest flight within K stops
Graphs
LC
385
Network Delay Time
Graphs
LC
386
Number of ways to arrive at destination
Graphs
LC
387
Minimum multiplications to reach end
Graphs
TUF
388
Bellman Ford Algorithm
Graphs
TUF
389
Floyd warshall algorithm
Graphs
TUF
390
Find the city with the smallest number of neighbors
Graphs
LC
391
MST theory
Graphs
TUF
392
Prim's Algorithm
Graphs
TUF
393
Disjoint Set
Graphs
TUF
394
Find the MST weight
Graphs
TUF
395
Number of operations to make network connected
Graphs
LC
396
Most stones removed with same row or column
Graphs
LC
397
Accounts merge
Graphs
LC
398
Number of islands II
Graphs
LC
399
Making a large island
Graphs
LC
400
Swim in Rising Water
Graphs
LC
401
Bridges in graph
Graphs
LC
402
Articulation point in graph
Graphs
TUF
403
Kosaraju's algorithm
Graphs
LC
404
Introduction to DP
Dynamic Programming
TUF
405
Climbing stairs
Dynamic Programming
LC
406
Frog Jump
Dynamic Programming
TUF
407
Frog jump with K distances
Dynamic Programming
TUF
408
Maximum sum of non adjacent elements
Dynamic Programming
LC
409
House robber
Dynamic Programming
LC
410
Ninja's training
Dynamic Programming
TUF
411
Grid Unique Paths : DP on Grids (DP8)
Dynamic Programming
LC
412
Unique paths II
Dynamic Programming
LC
413
Minimum Falling Path Sum
Dynamic Programming
LC
414
Triangle
Dynamic Programming
LC
415
Ninja and his Friends
Dynamic Programming
TUF
416
Subset sum equal to target (DP- 14)
Dynamic Programming
TUF
417
Partition equal subset sum
Dynamic Programming
LC
418
Partition a set into two subsets with minimum absolute sum difference
Dynamic Programming
LC
419
Count subsets with sum K
Dynamic Programming
TUF
420
Count partitions with given difference
Dynamic Programming
TUF
421
Assign Cookies
Dynamic Programming
LC
422
Minimum Coins (DP - 20)
Dynamic Programming
LC
423
Target sum
Dynamic Programming
LC
424
Coin Change 2 (DP - 22)
Dynamic Programming
LC
425
Unbounded knapsack
Dynamic Programming
TUF
426
Rod Cutting Problem
Dynamic Programming
TUF
427
Longest common subsequence
Dynamic Programming
TUF
428
Print Longest Common Subsequence
Dynamic Programming
TUF
429
Longest common substring
Dynamic Programming
TUF
430
Longest palindromic subsequence
Dynamic Programming
LC
431
Minimum insertions to make string palindrome
Dynamic Programming
LC
432
Minimum insertions or deletions to convert string A to B
Dynamic Programming
LC
433
Shortest common supersequence
Dynamic Programming
LC
434
Distinct subsequences
Dynamic Programming
LC
435
Edit distance
Dynamic Programming
LC
436
Wildcard matching
Dynamic Programming
LC
437
Best time to buy and sell stock
Dynamic Programming
LC
438
Best time to buy and sell stock II
Dynamic Programming
LC
439
Best time to buy and sell stock III
Dynamic Programming
LC
440
Best time to buy and sell stock IV
Dynamic Programming
LC
441
Best Time to Buy and Sell Stock with Cooldown
Dynamic Programming
LC
442
Best time to buy and sell stock with transaction fees
Dynamic Programming
LC
443
Longest Increasing Subsequence
Dynamic Programming
TUF
444
Print Longest Increasing Subsequence
Dynamic Programming
TUF
445
Longest Increasing Subsequence
Dynamic Programming
TUF
446
Largest Divisible Subset
Dynamic Programming
LC
447
Longest String Chain
Dynamic Programming
LC
448
Longest Bitonic Subsequence
Dynamic Programming
TUF
449
Number of Longest Increasing Subsequences
Dynamic Programming
LC
450
Matrix chain multiplication
Dynamic Programming
TUF
451
Matrix Chain Multiplication
Dynamic Programming
TUF
452
Minimum cost to cut the stick
Dynamic Programming
LC
453
Burst balloons
Dynamic Programming
LC
454
Different Ways to Evaluate a Boolean Expression
Dynamic Programming
LC
455
Palindrome partitioning II
Dynamic Programming
LC
456
Partition Array for Maximum Sum
Dynamic Programming
LC
457
Maximum Rectangle Area with all 1's
Dynamic Programming
LC
458
Count Square Submatrices with All Ones
Dynamic Programming
LC
459
Trie Implementation and Operations
Tries
LC
460
Trie Implementation and Advanced Operations
Tries
TUF
461
Longest Word with All Prefixes
Tries
TUF
462
Number of distinct substrings in a string
Tries
TUF
463
Bit PreRequisites for TRIE Problems
Tries
TUF
464
Maximum XOR of two numbers in an array
Tries
LC
465
Maximum Xor with an element from an array
Tries
LC
466
Minimum number of bracket reversals to make an expression balanced
Strings
LC
467
Count and say
Strings
LC
468
Rabin Karp Algorithm
Strings
LC
470
Z function
Strings
TUF
471
KMP Algorithm or LPS array
Strings
LC
472
Shortest Palindrome
Strings
TUF
473
Longest happy prefix
Strings
LC
474
Count Palindromic Subsequences
Strings
LC