Multiple ChoiceIntermediate 30s
Kadane's Algorithm
Kadane's algorithm finds maximum subarray sum in:
Options
- 1O(n log n)
- 2O(n)
- 3O(n²)
- 4O(2^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.