EasyRememberArrays & StringsMultiple Choice
Which operation has O(n) worst-case time when performed at the beginning of an array?
Remember — Tests recall of fundamental facts and definitions.
Answer Options
AAccess by index
BAppend at end
CInsert at index 0
DRead length
Want to see the correct answer?
Get the answer with a detailed explanation, plus practice 34+ more Arrays & Strings questions with adaptive quizzes and timed interviews.
See the Answer on Guru Sishya →This question is from the Arrays & Strings topic (Data Structures).
More Arrays & Strings Questions
What is the time complexity of accessing an element by index in an array?
EasyWhat is the space complexity of a prefix sum array for n elements?
EasyWhat does nums.slice(1,3) return for nums = [10,20,30,40,50]?
EasyOutput of [1,2,3].map(x=>x*2).filter(x=>x>2) in JavaScript?
EasyIn a variable sliding window, what triggers moving the left pointer inward?
Medium-Easy