Burst Balloons | LeetCode | Solution Explained
LeetCode 312. Burst Balloons is a hard problem. I explain the dynamic programming approach in detail, along with...
Largest Divisible Subset | LeetCode | GeeksforGeeks | DP Solution Explained
368. Largest Divisible Subset. I explain the Dynamic Programming approach using simple examples and visuals, along with an...
Best Time to Buy and Sell Stock | A Compilation of Solutions
Best Time to Buy and Sell Stock is a popular series of problems on LeetCode. In this...
Climbing Stairs | LeetCode | Solution Explained
70. Climbing Stairs is an easy LeetCode problem. We first look at the iterative dynamic programming (dp)...
Jump Game | LeetCode | Solution Explained
55. Jump Game on LeetCode is a medium problem. I discuss the iterative dp solution as well...
Dungeon Game | LeetCode | Solution Explained
Dungeon Game is a Hard level problem on LeetCode, requiring us to break the problem down into...
Longest Common Subsequence | LeetCode | Solution Explained
Longest Common Subsequence. One of the most popular string DP questions. I explain the logic with recursive...