Recently I attended a Two-Day Master Sessions on “Dynamic Programming” under the mentorship of the world record holder, Mr. Vimal Daga. In this blog, I would like to share few highlights from the session.
𝐓𝐨𝐩𝐢𝐜𝐬 𝐜𝐨𝐯𝐞𝐫𝐞𝐝 𝐝𝐮𝐫𝐢𝐧𝐠 𝐭𝐡𝐞 𝐦𝐚𝐬𝐭𝐞𝐫 𝐬𝐞𝐬𝐬𝐢𝐨𝐧𝐬:
Concept and importance of space complexity
What is Dynamic Programming
Multi stage decision process
Principle of Optimality
Overlapping structure problem
Backward induction
Optimal substructure
Algorithm
Time complexity and it’s effects
Memory profiler
Top down method / Memoization
Bottom up method / Tabulation
%timeit
Use case of line_profiler and memory_profiler library
Recursion
Greedy Method
Thank You!!