easy5 pts · first answer countsdynamic-programmingdp-basics
Robbing houses that are not neighbours
You may take money from houses in a row but never from two adjacent houses. The amounts are [2, 7, 9, 3, 1]. What is the most you can take?
Discussion 0
Join free to post in the discussion.
Related questions
- Signs that a problem suits DPBackend Developer
- What memoisation meansBackend Developer
- What tabulation meansBackend Developer
- Cost of plain recursive FibonacciBackend Developer
- Fibonacci after adding a cacheBackend Developer
- Recursion with no base caseBackend Developer
- Ways to climb five stairsBackend Developer
- Hidden memory cost of recursionBackend Developer