Time Complexity · #26 · 2026-04-30
What's the Big-O?
JavaScript ·Difficulty 2/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.
word has length m. What is the time complexity?
function search(root, word) {
let node = root;
for (const ch of word) {
if (!node.children[ch]) return false;
node = node.children[ch];
}
return node.isEnd === true;
}
Loading your progress...
Press 1 through 4, or tap a numbered choice, to answer. Back to hub