Dynamic Programming By Striver

Access full Playlist by Striver.

No	Range	Type
1	1-6	Basic(Fibonacci Pattern)
2	7-13	DP on Grid
3	14-24	DP on Subsets(knapsack Pattern)
4	25-31	DP on Strings(LCS Pattern)
5	32-34	DP on Strings(String Matching Pattern)
6	35-40	DP on Stocks
7	41-47	DP on Longest increasing subsequence(LIS)
8	48-54	Partitioning DP(MCM Pattern)
9	55-56	DP on Squares

Video No.	Problem	Type
1	Fibonacci Numbers	1
2	Climbing stairs	1
3	Frog Jump	1
4	Frog Jump follow up	1
5	Maximum sum of non-adjacent elements	1
6	House Robber	1
7	Ninja’s Training	2
8	Unique Paths	2
9	Unique Path II	2
10	Minimum Path Sum	2
11	Triangle	2
12	Maximum Path sum in matrix	2
13	Chocolate Pickup	2
14	Subset sum equals to K	3
15	Partition Equal Subset Sum	3
16	Minimum subset sum difference	3
17	Count Subset with target sum	3
18	Partition with given difference	3
19	0-1 Knapsack	3
20	Minimum Elements/Coin change	3
21	Target Sum	3
22	coin change II	3
23	Unbounded Knapsack	3
24	Rod cutting	3
25	Longest Common Subsequence	4
26	Print LCS	4
27	Longest Common substring	4
28	Longest Palindromic Subsequence	4
29	minimum insertions to make a string palindrome	4
30	Deletion and insertions require to convert string A to B	4
31	Shortest Common Supersequence	4
32	Distinct Subsequences	5
33	Edit Distance	5
34	Wildcard matching	5
35	Best Time to Buy and Sell Stock	6
36	Best Time to Buy and Sell Stock II	6
37	Best Time to Buy and Sell Stock III	6
38	Best Time to Buy and Sell Stock IV	6
39	Best Time to Buy and Sell Stock with Cooldown	6
40	Best Time to Buy and Sell Stock with Transaction Fee	6
41	Longest Increasing Subsequence	7
42	LIS continued	7
43	LIS solved with BS	7
44	Largest Divisible Subset	7
45	Longest String chain	7
46	Longest Bitonic Sequence	7
47	Number of LIS	7
48	Matrix Chain Multiplication	8
49	MCM Continued	8
50	Min cost to cut a stick	8
51	Burst Balloons	8
52	Evaluate Expression to True	8
53	Palindrome Partitioning II	8
54	Partition Array for Maximum Sum	8
55	Maximal Rectangle	9
56	Count Square Submatrices with All Ones	9