募捐 9月15日2024 – 10月1日2024 关于筹款

7 days with Dynamic Programming

7 days with Dynamic Programming

Ue Kiao PhD, Aditya Chatterjee
你有多喜欢这本书?
下载文件的质量如何?
下载该书,以评价其质量
下载文件的质量如何?

Become 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

年:
2020
出版社:
OpenGenus
语言:
english
页:
40
文件:
PDF, 594 KB
IPFS:
CID , CID Blake2b
english, 2020
线上阅读
正在转换
转换为 失败

关键词