AppliedMultiple choice
What most often decides whether a dynamic programming solution is feasible?
- AThe size of the state space, since it bounds both time and memory
- BWhether you use memoisation or tabulation
- CThe programming language
- DWhether the recursion is written top-down or bottom-up
The worked solution is in Premium
The answer, the full working and the one idea to take away – for this and all 1,322 questions in the bank. Answer it in practice and your working is marked, with a known mistake named when you make one.
Learn the method
Dynamic programming, and why it is the same as an EV recursion
Reported in interviews at
More data structures and algorithms questions
- You climb a staircase of 10 steps, taking one or two steps at a time.Foundation
- Climbing a staircase, part 1 of 3Foundation
- Using an unlimited supply of coins worth 1, 3 and 4, in how many ways can you…Applied
- What is the expected number of fair coin flips to see two heads in a row?Applied
- What is the edit distance between "kitten" and "sitting"?Applied
- What is the length of the longest strictly increasing subsequence of…Applied