Dynamic Programming is a fundamental algorithmic technique which is behind solving some of the toughest computing problems. In this book "Dynamic Programming for the day before your coding interview", we have covered some Dynamic Programming problems which will give you the general idea of formulating a Dynamic Programming solution and practice on applying it on a variety of Coding Interview problems.

The first chapter is the Dynamic Programming cheatsheet. This is a goldmine. This will help you get the core DP idea of over 50 problems within 30 minutes. You should revisit and revise this cheatsheet every 2 months.

Some of the problems we have covered are:

• Permutation coefficient: This is a basic problem but is significant in understanding the idea behind Dynamic Programming.
• Longest Common Substring: This is an important problem as we see how we can apply Dynamic Programming in string problems.
• XOR value: This is another significant problem as we are applying Dynamic Programming on a Number Theory problem more specifically problem involving subset generation.
• K edges: In line with our previous problems, in this problem, we have applied Dynamic Programming in a graph-based problem. This problem shows a problem where Dynamic Programming is not the most efficient solution but is in the right path.

Book: Dynamic Programming for the day before your Coding Interview
Authors (2): Aditya Chatterjee, Ue Kiao

About the authors:
Aditya Chatterjee is an Independent Researcher, Technical Author and the Founding Member of OPENGENUS, a scientific community focused on Computing Technology.
Ue Kiao is a Japanese Software Developer and has played key role in designing systems like TaoBao, AliPay and many more. She has completed her B. Sc in Mathematics and Computing Science at National Taiwan University and PhD at Tokyo Institute of Technology.

Published: April 2020 (Edition 1)
Publisher: (c) OpenGenus