Hi everyone,
I recently bought Alex's book - Jumping into C++ and it's truley a great book. However, I can't find the solutions to all the practice problems. It would be great to have it by my side to compare my code against Alex's code. If you have a github or something with the solutions and don't mind throw it my way I would highly appreciate it.
Dynamic Programming is a method for solving a complex problem by breaking it down into a collection of simpler subproblems, solving each of those subproblems just once, and storing their solutions using a memory-based data structure (array, map,etc). Each of the subproblem solutions is indexed in some way, typically based on the values of its input parameters, so as to facilitate its lookup. So the next time the same subproblem occurs, instead of recomputing its solution, one simply looks up the previously computed solution, thereby saving computation time. This technique of storing solutions to subproblems instead of recomputing them is called memoization.
Here’s brilliant explanation on concept of Dynamic Programming on Quora Jonathan Paulson’s answer to How should I explain dynamic programming to a 4-year-old?
Want to read this story later? Save it in Journal.
Please find below top 10 common data structure problems that can be solved using Dynamic programming -
1.Longest Common Subsequence | Introduction & LCS Length
2.Longest Common Subsequence | Finding all LCS
3.Longest Common Substring problem
4.Longest Palindromic Subsequence using Dynamic Programming
5.Longest Repeated Subsequence Problem
6.Implement Diff Utility
7.Shortest Common Supersequence | Introduction & SCS Length
8.Shortest Common Supersequence | Finding all SCS
9.Longest Increasing Subsequence using Dynamic Programming
10.Longest Bitonic Subsequence
