Dynamic Programming in one shot | shashcode dp | shashcode dynamic programming | dsa | dp hindi
Lecture Resources
https://github.com/Tiwarishashwat/Jav...
DP basics, top down, bottom up, optimal subproblems, space optimised, pick and no pick, subsequence, substring, lis, optimal substructure, optimal subproblem.
1. Fibonacci number
https://leetcode.com/problems/fibonac...
2. Climbing Stairs:
https://leetcode.com/problems/climbin...
3. Counting Bits:
https://leetcode.com/problems/countin...
4. Min cost climbing stairs
https://leetcode.com/problems/min-cos...
5. House Robber 1
https://leetcode.com/problems/house-r...
6. House Robber 2
https://leetcode.com/problems/house-r...
7. Check if there exists a subsequence with sum K
https://www.geeksforgeeks.org/problem...
8. Perfect sum problem
https://www.geeksforgeeks.org/problem...
9. 01 knapsack
https://www.geeksforgeeks.org/problem...
10. Coin Change 1:
https://leetcode.com/problems/coin-ch...
11. Coin Change 2:
https://leetcode.com/problems/coin-ch...
12. Rod cutting problem
https://www.geeksforgeeks.org/problem...
13. Longest Common Subsequence
https://leetcode.com/problems/longest...
14. Longest Palindromic Subsequence
https://leetcode.com/problems/longest...
15. Shortest Common Supersequence
https://leetcode.com/problems/shortes...
16. Longest Increasing Subsequence
https://leetcode.com/problems/longest...
17. Maximum Length of pair chain
https://leetcode.com/problems/maximum...
18. Unique paths
https://leetcode.com/problems/unique-...
19. Unique paths 2
https://leetcode.com/problems/unique-...
Samsung Interview Experience:
• I cracked Samsung | SRIB Interview Experie...
Company Tags:
Facebook | Amazon | Microsoft | Netflix | Google | LinkedIn | Pega Systems | VMware | Adobe | Samsung
Timestamp:
0:00 - Dynamic Programming basics
12:19 - Fibonacci Number
33:23 - Climbing Stairs
47:36 - Counting Bits
1:02:11 - Min Cost Climbing Stairs
1:21:28 - House Robber
1:49:14 - House Robber Il
1:55:16 - Check if there exists a subsequence with sum K
2:22:32 - Perfect Sum Problem
2:54:57 - 0/1 Knapsack
3:22:54 - Infinite Supply (Coin Change)
3:37:45 - Coin Change 2
3:52:14 - Rod Cutting
4:08:37 - Longest Common Subsequence
4:32:02 - Longest Palindromic Subsequence
4:38:12 - Shortest Common Supersequence
4:49:57 - Longest Increasing Subsequence
5:24:18 - Maximum Length of pair Chain
5:30:49 - Dp on gride/Matrix
5:32:23 - Unique Paths 1
5:49:22 - Unique Paths 2
5:55:42 - Outro