Dynamic Programming : Popular Interview Problems (Explanation + Solution)

Minimum Difficulty of a Job Schedule | Recursion | Memoization | Amazon | Leetcode 1335

Maximum Length of a Concatenated String with Unique Characters | Amazon | Leetcode 1239

Ugly Number II | Simple Explanation | Dry Run | codestorywithMIK

Perfect Squares | Why not Greedy | Recursion | Memo | Leetcode 279

Maximum Profit in Job Scheduling | Recursion | Memoization | Leetcode 1235

Arithmetic Slices II - Subsequence | Hard Made Easy | Intuition | Leetcode 446

Climbing Stairs | 3 Approaches | Leetcode 70

Minimum Falling Path Sum | Recursion | Memo | Bottom Up | Leetcode 931

House Robber | Recursion | Memo | Bottom Up | Leetcode 198

Longest Common Subsequence | Recursion | Memo | Optimal | Leetcode 1143

Best Time to Buy and Sell Stock with Cooldown | Google | Microsoft | Amazon | codestorywithMIK

Domino and Tromino Tiling | Detailed Explanations | Leetcode 790 | codestorywithMIK

Jump Game - (Google, Microsoft, Amazon, Ebay, Meta) : Explanation ➕ Live Coding

Flip String to Monotone Increasing - (GOOGLE) | Recursion+Memo | Explanation ➕ Live Coding

Flip String to Monotone Increasing - (GOOGLE) | Optimal | Explanation ➕ Live Coding

Minimum Path Sum | Recursion | Bottom Up | Leetcode 64 | codestorywithMIK

Minimum Cost For Tickets | Recursion | Memo | Bottom Up | Leetcode-983 | codestorywithMIK

Reducing Dishes - (MICROSOFT) | Leetcode-1402 | 2 Approaches | Explanation ➕ Live Coding

Scramble String - (GOOGLE) | Leetcode-87 | Explanation ➕ Live Coding

Number of Ways of Cutting a Pizza - (Google, TikTok) | Leetcode-1444 | Explanation ➕ Live Coding

Longest Palindromic Subsequence | Recursion | Memo | Bottom Up | Leetcode 516

Maximum Value of K Coins From Piles | META | Leetcode-2218 | codestorywithMIK

Number of Ways to Form a Target String Given a Dictionary | Recur | Memo | Leetcode 1639 | MIK

Number of Ways to Form a Target String Given a Dictionary | Bottom Up | Leetcode 1639 | MIK

Profitable Schemes - (AMAZON) | Recur+Memo | Leetcode-879 | Live Code + Explanation

Restore The Array - (GOOGLE, MICROSOFT) | Recur+Memo | Leetcode-1416 | Live Code + Explanation

Minimum Insertion Steps to Make a String Palindrome | Recur+Memo | GOOGLE | Leetcode-1312 🧑🏻‍💻

Find the Longest Valid Obstacle Course at Each Position | META | Leetcode-1964 | Live Coding

Uncrossed Lines | Microsoft, Amazon, Meta | Leetcode-1035 | Live Code + Explanation

Solving Questions With Brainpower | GOOGLE | Leetcode 2140 | codestorywithMIK

Count Ways To Build Good Strings | Recursion | Memo | Leetcode 2466 | codestorywithMIK

Count Ways To Build Good Strings | Bottom Up | Leetcode 2466 | codestorywithMIK

Maximize Score After N Operations | BRUTE FORCE To OPTIMAL | META | Leetcode-1799 | Live Code

Stone Game II | Game Strategy | EASIEST Explanation | META | Leetcode 1140 | codestorywithMIK

Stone Game III | Basic to Optimal | EASIEST Explanation | META, GOOGLE | Leetcode-1406 | Live Code

Minimum Cost to Cut a Stick | Recur + Memo | Time Complexity | GOOGLE | Leetcode-1547 | Live Code

Make Array Strictly Increasing | Recur + Memo | Time Complexity | GOOGLE | Leetcode-1187 | Live Code

Number of Increasing Paths in a Grid | DFS + Memo | ADOBE, MICROSOFT | Leetcode-2328 | Live Code

Best Time to Buy and Sell Stock with Transaction Fee | Recur + Memo | META | Leetcode-714

Longest Arithmetic Subsequence | Recur + Memo | Bottom Up | GOOGLE | Leetcode-1027 | Live Code

Tallest Billboard | Recur + Memo | Tree Diagram | GOOGLE | Leetcode 956 | codestorywithMIK

Count All Possible Routes | Recur + Memo | Tree Diagram | ZOHO | Leetcode-1575 | Live Code

Longest Arithmetic Subsequence of Given Difference | Recur + Memo | Optimal | META | Leetcode-1218

Maximum Number of Events That Can Be Attended II | Recur | Memo | Leetcode 1751 | codestorywithMIK

Smallest Sufficient Team | Recur + Memo | Bit Manipulation Made Easy | AMAZON | Leetcode-1125

Number of Longest Increasing Subsequence | Using LIS | Full Dry Run | META | Leetcode-673

Knight Probability in Chessboard | Recursion | Memoization | AMAZON | DIRECTi | Leetcode-688

All Possible Full Binary Trees | Recursion Tree | Memoization | GOOGLE | AMAZON | Leetcode-894

Predict the Winner | Two Recursive Approaches | Memoization | Game Strategy | Leetcode-486 | MIK

Soup Servings | INTUITIVE | Recursion | Memoization | GOOGLE | Leetcode-808

Strange Printer | INTUITIVE | Recursion | Memoization | NetEase | Leetcode-664

Minimum ASCII Delete Sum for Two Strings | Intuition | Similar Problems | Leetcode 712 | MIK

Word Break | Tree Diagram | Recursion | Memoization | Similar Problems | Leetcode-139

Unique Binary Search Trees II | Similar Problem | Recursion | Memoization | Amazon | Leetcode-95

Number of Music Playlists | Made Super Easy | Recursion | Memoization | META | Leetcode-920

Coin Change II | Made Super Easy | Recursion | Memoization | AMAZON | Leetcode-518

Unique Paths II | Made Super Easy | Recursion | Memoization | 2D Array | AMAZON | Leetcode-63

Check if There is a Valid Partition For The Array | Recursion | Memoization | GOOGLE | Leetcode-2369

Interleaving String | Khandaani Tareeka | Memoization | GOOGLE | Leetcode-97

Frog Jump | Khandaani Tareeka | Memoization | GOOGLE | AMAZON | META | Leetcode 403 | MIK

Minimum Number of Taps to Open to Water a Garden | Recursion | Memoization | Leetcode - 1326

Extra Characters in a String | Tree Diagram | Recursion | Memoization | MADE EASY | Leetcode - 2707

Unique Paths | Recursion | Memoization | AMAZON | CISCO | PAYTM | OLA | LINKEDIN | Leetcode - 62

Champagne Tower | Recursion | Memoization | GOOGLE | Leetcode - 799

Champagne Tower | Intuitive | Bottom Up | GOOGLE | Leetcode - 799

Integer Break | Tree Diagram | Recursion | Memoization | AMAZON | Leetcode - 343

Max Dot Product of Two Subsequences | Detailed | simplified | Leetcode 1458 | codestorywithMIK

Min Cost Climbing Stairs | Bottom Up | Recursion | Memoization | GOOGLE | Leetcode - 746

Painting the Walls | Why Greedy Fails | Recursion | Memoization | GOOGLE | Leetcode - 2742

Number of Ways to Stay in the Same Place After Some Steps | Recursion | Memoization | Leetcode- 1269

Constrained Subsequence Sum | Recursion | Memoization | Sliding Window | GOOGLE | Leetcode - 1425

Longest Palindromic Substring | Recursion | Memoization | Microsoft | Leetcode 5 | codestorywithMIK

Maximum Points After Collecting Coins From All Nodes | Memoization | Optimisations | Leetcode - 2920

Knight Dialer | Recursion Memoization | Bottom Up DP | Google | Dropbox | Leetcode 935

Decode Ways | Recursion | Memo | Bottom Up | Leetcode 91

Number of Dice Rolls With Target Sum | Recursion | Memo | Bottom Up | Leetcode 1155

String Compression II | Recursion | Memo | Leetcode 1531

String Compression II | Recursion | 2-D Memoization | Leetcode 1531

Minimum Difficulty of a Job Schedule | Bottom Up | Amazon | Leetcode 1335

Count possible ways to construct buildings | Recursion | Memoization | Bottom UP | GFG POTD

Maximize the Number of Partitions After Operations | Intuition From Scratch | Leetcode 3003 | MIK

Out of Boundary Paths | Recursion | Memoization | Bottom Up | Optimal Bottom Up | Leetcode 576

K Inverse Pairs Array | Recursion | Memoization | Bottom Up | Optimal Bottom Up | Leetcode 629

Count digit groupings of a number | Recursion | Memoization | GFG POTD

Partition Array for Maximum Sum | Why DP | Recursion | Memo | Bottom Up | Leetcode 1043

Perfect Squares | Bottom UP | Made Easy | Google | Leetcode 279

Palindromic Substrings | Blueprint | Palindrome Problems | 4 Approaches | Leetcode 647

Cherry Pickup II | 3 Approaches | Super Detailed | Leetcode 1463

Maximum Strength of K Disjoint Subarrays | Recursion | Memoization | Leetcode 3077 | Contest 388

Valid Parenthesis String | 4 Detailed Approaches | Leetcode 678 | codestorywithMIK

Minimum Sum of Values by Dividing Array | Recursion | Memoization | Leetcode 3117 | codestorywithMIK

Longest Ideal Subsequence | LIS Variant | Bottom Up | Optimal | Leetcode 2370 | codestorywithMIK

Minimum Falling Path Sum II | 4 Approaches | Detailed Dry Run | Leetcode 1289 | codestorywithMIK

Freedom Trail | Recursion | Memoization | Bottom Up | Detailed | Leetcode 514 | codestorywithMIK

Find Number of Ways to Reach the K-th Stair | Recursion+Memo | Leetcode 3154 | codestorywithMIK

Student Attendance Record II | Recursion | Memoization | Bottom Up | Leetcode 552 | codestorywithMIK

Filling Bookcase Shelves | Recursion Memoization | Why not Greedy | Leetcode 1105 | codestorywithMIK

Maximum Number of Points with Cost | Detailed Explanation | Leetcode 1937 | codestorywithMIK

2 Keys Keyboard | Detailed Explanations | Leetcode 650 | codestorywithMIK

Maximum Number of Moves to Kill All Pawns | Step By Step Detailed | Leetcode 3283 | codestorywithMIK

Extra Characters in a String | Recursion | Bottom Up | Easy | Leetcode 2707 | codestorywithMIK

Count Square Submatrices with All Ones | Recursion | Bottom Up | Leetcode 1277 | codestorywithMIK

Minimum Total Distance Traveled | Detailed Thought Process | Leetcode 2463 | codestorywithMIK

Minimum Array Sum | Detailed for Beginners | Contest Problem | Leetcode 3366 | codestorywithMIK

Target Sum | Two Ways Of Memoization | Detailed | Leetcode 494 | Explanation + Code

Maximum Sum of 3 Non-Overlapping Subarrays | Detailed For Beginners | Leetcode 689 | codstorywithMIK

Length of Longest Fibonacci Subsequence | Recursion Memo | Bottom Up |Leetcode 873| codestorywithMIK

Partition Equal Subset Sum | Recursion | Memo | Tree Diagram | Leetcode 416 | codestorywithMIK

Merge Operations for Minimum Travel Time | Thought Process | Leetcode 3538 | codestorywithMIK

Count Number of Balanced Permutations | Super Detailed Explanation | Leetcode 3343 |codestorywithMIK

Print Longest Increasing Subsequence | LIS | Detailed Dry Run | Why It is Special |codestorywithMIK

Longest Unequal Adjacent Groups Subsequence II | Why Greedy Fails | Leetcode 2901 | codestorywithMIK

Painting a Grid With Three Different Colors | Thought Process | Leetcode 1931 | codestorywithMIK

Find the Original Typed String II | Multiple Approaches | Detailed | Leetcode 3333 |codestorywithMIK

Find the Maximum Length of Valid Subsequence | Part I | Part II | Leetcode 3201 | 3202 | MIK

Ways to Express an Integer as Sum of Powers | Recursion Memo | Leetcode 2787 | codestorywithMIK

Length of Longest V-Shaped Diagonal Segment | Made Easy | Leetcode 3459 | codestorywithMIK

Number of People Aware of a Secret | Recursion Memo | Bottom Up | Leetcode 2327 | codestorywithMIK

Triangle | 4 Approaches | Detailed | Leetcode 120 | codestorywithMIK

Minimum Score Triangulation of Polygon | Simplified for Beginners | Leetcode 1039 | codestorywithMIK

Taking Maximum Energy From the Mystic Dungeon | 2 Approaches | Leetcode 3147 | codestorywithMIK

Maximum Total Damage With Spell Casting | 2 Approaches | Detailed | Leetcode 3186 | codestorywithMIK

Find Sum of Array Product of Magical Sequences | Super Detailed | Leetcode 3539 | codestorywithMIK

Ones and Zeroes | Think From Scratch | Will Greedy Work | Leetcode 474 | codestorywithMIK

Paths in Matrix Whose Sum Is Divisible by K | Simplest Approaches | Leetcode 2435 | codestorywithMIK

Count Partitions With Max-Min Difference at Most K | Multiple Approaches | Leetcode 3578 | MIK

Maximum Profit from Trading Stocks with Discounts | Super Detailed | Beginner | Leetcode 3562 | MIK

Best Time to Buy and Sell Stock V | Made Simple | Detailed | Leetcode 3573 | codestorywithMIK

Delete Columns to Make Sorted III | Hard Made Easy | Dry Run | Leetcode 960 | codestorywithMIK

Number of Ways to Paint N × 3 Grid | Hard Made Easy | Simple Story To Code | Leetcode 1411 | MIK

Minimum Cost Path with Teleportations | 3 Approaches | Postmortem | Leetcode 3651 | codestorywithMIK

Trionic Array II | Simplest Approach | Detailed Intuition | Leetcode 3640 | codestorywithMIK

Find All Possible Stable Binary Arrays I | 2 Approaches | Detailed Intuition | Leetcode 3129 | MIK

Find All Possible Stable Binary Arrays II | Derive From Part I | Detailed | Leetcode 3130 | MIK

Find the String with LCP | Deep Dive | Dry Runs | 2 Ways | Leetcode 2573 | codestorywithMIK

Maximum Amount of Money Robot Can Earn | Simple Straight Forward | Leetcode 3418 | codestorywithMIK

Maximum Walls Destroyed by Robots | Detailed | Build Intuition | Leetcode 3661 | codestorywithMIK

Minimum Distance to Type a Word Using Two Fingers | Detailed | Intuition | Leetcode 1320 | MIK

Maximum Score From Grid Operations | Super Detailed For Beginners | Leetcode 3225 | codestorywithMIK

Maximum Path Score in a Grid | Detailed | Simplified | Leetcode 3742 | codestorywithMIK

Rotated Digits | 3 Approached | Simplified | Detailed | Leetcode 788 | codestorywithMIK

Maximum Number of Jumps to Reach the Last Index | Simple Intuition | Leetcode 2770 | MIK

Jump Game V | Detailed | Simplified | Intuition | Leetcode 1340 | codestorywithMIK

Jump Game VII | Brute Force | Optimal | Simple Intuition | Leetcode 1871 | codestorywithMIK

Total Waviness of Numbers in Range II | Super Detailed | For Beginners | Leetcode 3753 | MIK

Number of ZigZag Arrays I | Brute Force | Better | Optimal | Leetcode 3699 | codestorywithMIK

Number of Paths with Max Score | Detailed Explanation | 2 Ways | Leetcode 1301 | codestorywithMIK

Find the Number of Subsequences With Equal GCD | Detailed Explanation | 3 Ways | Leetcode 3336 | MIK

Stone Game | Simple Strategy | 2 Approaches | Leetcode 877 | codestorywithMIK

Stone Game IV | Simplified Approaches | Leetcode 1510 | codestorywithMIK

Stone Game V | Simplified Explanations | Leetcode 1563 | codestorywithMIK

Stone Game VIII | Simplified Approach | Leetcode 1872 | codestorywithMIK