Hello Coders! In this video, we will be working on a very interesting problem, as I have seen this type of questions multiple times this year in my interviews! We will be discussing Dynamic Programming as a solution to this problem.
This video is divided into 3 parts:
Part I: Problem description and the most intuitive solution 0:33
Part II: Optimized solution 3:05
Part III: Actual code to the optimized solution 9:58
Runtime: O(n^2)
Space: O(n)
Hope you enjoy this video and good luck 💙
Try my LeetCode list:
https://leetcode.com/list/xbahsr4j
Let's be friends:
My Blog: jazwang.com
Email: [email protected]