medium10 pts · first answer countsdynamic-programmingcomplexitydp-basics
Estimating a DP’s running time
A DP has n × m states, and each state looks at up to k earlier states. What is its time complexity?
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