News for hackers. Stuff that matters.

A comment on Dynamic Programming for Technical Interviews. Parent comment

Re:Dynamic Programming for Technical Interviews by deepGem on Friday March 15, 2019 @02:30AM (#19397072)
Absolutely, but I attribute the ability to decompose a problem into overlapping subproblems as an understanding of recursion, so I had implicitly assumed such an understanding.
[ Parent | on HN ]
Re:Dynamic Programming for Technical Interviews by baobabKoodaa on Friday March 15, 2019 @09:26AM (#19399461)
Try solving some difficult DP problems on CodeForces. You will find that an "understanding of recursion" is not enough to solve them.
[ Parent | on HN ]
Re:Dynamic Programming for Technical Interviews by eru on Friday March 15, 2019 @10:05AM (#19399774)
No, no, it is an understanding of how to recurse just right. Not an understanding of the concept of recursion in general.

Basically, recursion plus memoization is almost the same in terms of power and approach as dynamic programming.

[ Parent | on HN ]
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.

[ Parent | on HN ]
Re:Dynamic Programming for Technical Interviews by baobabKoodaa on Wednesday March 20, 2019 @11:59AM (#19443487)
...That's what I thought.
[ Parent | on HN ]
Re:Dynamic Programming for Technical Interviews by kortilla on Sunday March 31, 2019 @03:35AM (#19534372)
Behaving like an asshole and not getting a response is not proof of anything other than people not being interested in engaging with assholes.
[ Parent | on HN ]