Quiz · 4 questions
🔢 Arrays & Strings
Contiguous memory and the techniques it unlocks
Level 0Curious Beginner
0 XP0/85 lessons0/19 achievements
0/100 XP to next level100 XP to go0% complete
Quiz
01Why is arr[5] instant — O(1) — no matter how big the array is?
02Why is inserting at the FRONT of an array O(n)?
03A 'sliding window' turns which brute-force complexity into O(n)?
04A prefix-sum array lets you answer 'sum of elements from index i to j' in...
Hint
Think about precomputing running totals so a range collapses to a single subtraction.
Comments 0
🔔 Reply notifications (sign in)Sign in — Please sign in to comment.
No comments yet — be the first.