News for hackers. Stuff that matters.

A comment on Dynamic Programming vs. Divide-and-Conquer (2018). Parent comment

Re:Dynamic Programming vs. Divide-and-Conquer (2018) by EvilEy3 on Sunday April 25, 2021 @08:29AM (#26932220)
> And when you actually need algorithms, you always have a luxury of existing literatures and implementations.

And how well that works in practice? How will candidate even know where to look at if he has no idea what he needs to find?

[ Parent | on HN ]
Re:Dynamic Programming vs. Divide-and-Conquer (2018) by lifthrasiir on Sunday April 25, 2021 @09:10AM (#26932420)
> How will candidate even know where to look at if he has no idea what he needs to find?

That happens all the time, not just for algorithms. I don't expect candidates to know every possible algorithm (as I surely don't), I expect candidates to identify and learn what's required for the task. A knowledge of the specific algorithm is not of much value. The ability to learn and possibly implement algorithms is.

[ Parent | on HN ]
Re:Dynamic Programming vs. Divide-and-Conquer (2018) by EvilEy3 on Sunday April 25, 2021 @09:23AM (#26932501)
> I expect candidates to identify and learn what's required for the task

And that comes for free in people who spent time on Algorithms and Data Structures.

[ Parent | on HN ]
Re:Dynamic Programming vs. Divide-and-Conquer (2018) by lifthrasiir on Sunday April 25, 2021 @09:31AM (#26932563)
Yes, I haven't said that you should not learn algorithms. The best way to learn that skill is to learn (some) algorithms; DP is particularly worthwhile to learn because it is pretty hard to invent by one's own. But as an interviewer I would spend more time to check the general ability to adapt than the algorithmic knowledge.
[ Parent | on HN ]