hard20 pts · first answer countsdynamic-programmingstock-problems
Stock DP with at most k trades
The "at most k transactions" stock DP is O(n × k). When k is at least n / 2, what should you do?
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