Book Description

Dynamic Programming is a fundamental algorithmic technique which is behind solving some of the toughest computing problems.In this book, we have covered some Dynamic Programming problems which will give you the general idea of formulating a Dynamic Programming solution and some practice on applying it on a variety of problems.Some of the problems we have covered are: * Permutation coefficientThis is a basic problem but is significant in understanding the idea behind Dynamic Programming. We have used this problem to: * Present the two core ideas of Dynamic Programming to make the idea clear and help you understand what Dynamic Programming mean. * Show another approach which can same performance (in terms of time complexity) and understand how it is different from our Dynamic Programming approach* Longest Common SubstringThis is an important problem as we see how we can apply Dynamic Programming in string problems. In the process, we have demonstrated the core ideas of handling string data which helps in identifying the cases when Dynamic Programming is the most efficient approach.* XOR valueThis is another significant problem as we are applying Dynamic Programming on a Number Theory problem more specifically problem involving subset generation. The search space is exponential in size but with our efficient approach, we can search the entire data in polynomial time which is a significant improvement.This brings up a fundamental power of Dynamic Programming: Search exponential search space in polynomial time* K edgesIn line with our previous problems, in this problem, we have applied Dynamic Programming in a graph-based problem. This is a core problem as in this we learn that: * Dynamic Programming makes the solution super-efficient * Extending the Dynamic Programming solution using Divide and Conquer enables us to solve it more efficientlyThis problem shows a problem where Dynamic Programming is not the most efficient solution but is in the right path.We have covered other relevant solutions and ideas as well so that you have the complete idea of the problems and understand deeply the significance of Dynamic Programming in respect to the problems.This book has been carefully prepared and reviewed by Top programmers and Algorithmic researchers and members of OpenGenus. We would like to thank Aditya Chatterjee and Ue Kiao for their expertise in this domain and reviews from professors at The University of Tokyo and Tokyo Institute of Technology.Read this book now and ace your upcoming coding interview. This is a must read for everyone preparing for Coding Interviews at top companies.