Re:Dynamic Programming for Technical Interviews
by baobabKoodaa on Friday March 15, 2019 @12:51PM
(#19401518)
No, it's not, and if you actually tried to solve one of the harder DP problems, this would become very obvious to you.
Here's one for you: https://codeforces.com/problemset/problem/1097/G
It's a dp problem, and you understand how to recurse just right, and you understand memoization, so you'll be able to solve it, right? Link your solution when you reply please.
Re:Dynamic Programming for Technical Interviews
by baobabKoodaa on Wednesday March 20, 2019 @11:59AM
(#19443487)
...That's what I thought.
Basically, recursion plus memoization is almost the same in terms of power and approach as dynamic programming.