Recursion with memoization can still take exponential time whereas a DP solution... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		reader5000 on March 15, 2019 \| parent \| context \| favorite \| on: Dynamic Programming for Technical Interviews Recursion with memoization can still take exponential time whereas a DP solution is usually going to be quadratic or better.

chillee on March 15, 2019 [–]

That's not really true. There's plenty of DP solutions that are >cubic or exponential.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact