- Main
- Computers - Programming
- 7 days with Dynamic Programming
7 days with Dynamic Programming
Ue Kiao PhD, Aditya ChatterjeeBecome Dynamic Programming Master in 7 days
Dynamic Programming is one of the most important algorithmic domains and is equally challenging. With practice and correct way of thinking, you can master it easily.
If a problem takes O(2^N) time to search a solution among possible solutions, Dynamic Programming has the potential to reduce it to O(N) or polynomial time thereby reducing the search space.
We will attempt one problem every day in this week and analyze the problem deeply.
Our schedule
• Day 1: Introduction + Longest Increasing Subsequence
• Day 2: 2D version of Day 1 problems
• Day 3: Dynamic Programming on Strings
• Day 4: Modified version of Day 3 problems
• Day 5: Dynamic Programming for String patterns (Longest Palindromic Substring)
• Day 6: Modified version of Day 4 problems
• Day 7: 2 conditions on 1 data point
该文件将通过电报信使发送给您。 您最多可能需要 1-5 分钟才能收到它。
注意:确保您已将您的帐户链接到 Z-Library Telegram 机器人。
该文件将发送到您的 Kindle 帐户。 您最多可能需要 1-5 分钟才能收到它。
请注意:您需要验证要发送到Kindle的每本书。检查您的邮箱中是否有来自亚马逊Kindle的验证电子邮件。