>_
SWE Maxx
Questions
Quizzes
Daily challenge
System design
My attempts
Sign in
☀
☾
Light mode
Dark mode
Loading question…
Sign in
← Question bank
Algorithms · Multiple Choice
Difficulty: Medium
Why can inserting at the start of an array take O(n) time?
Arrays
Complexity
Choose your answer
A
The array must be sorted after every insertion.
B
A hash function must run on every element.
C
Existing elements may need to shift to make room.
D
Arrays cannot contain duplicate values.
Check answer
More in Algorithms →
Why can inserting at the start of an array take O(n) time? | SWE Maxx