Time Complexity · #65 · 2026-06-08
What's the Big-O?
JavaScript ·Difficulty 1/3
How to play
Read the code and pick its time complexity from four Big-O choices. Think about loops, recursion, and hidden costs. Press 1–4 or click to answer.
n = arr.length. What is the time complexity?
function maxSubarraySum(arr) {
let max = -Infinity, cur = 0;
for (const x of arr) {
cur = Math.max(x, cur + x);
max = Math.max(max, cur);
}
return max;
}
Loading your progress...
Press 1 through 4, or tap a numbered choice, to answer. Back to hub