Multiple ChoiceIntermediate 30s
DP: Fibonacci Optimization
Computing Fibonacci with DP instead of naive recursion reduces complexity from:
Options
- 1O(log n) to O(n)
- 2O(n) to O(2^n)
- 3O(n²) to O(n log n)
- 4O(2^n) to O(n)
Think you can answer under pressure?
Get matched and answer live questions in 3-minute 1v1 battles. Elo ranking, badge tiers and bragging rights on the line.