Collections · interview question
How would you explain the time complexity of adding an element to an ArrayList when the underlying array needs resizing in an interview?
Multiple choiceMediumchapter-4-curatedpremiumcollectionscollection-performance-basics
Answer and explanation
Correct answer
B. O(1) amortized
Why
While adding an element can require resizing the array (O(n) in the worst case), the amortized time complexity is O(1) because resizing happens infrequently relative to the number of insertions.
Test yourself on Collections
A free test with instant, explained results. No account needed.
More Collections questions
- Given a List<String> catalog, which method call on an Iterator<String> allows safe removal of an item during iteration?
- If you need to ensure that elements are processed in the exact order they are added but also need occasional access to…
- Given an e-commerce application that requires frequent updates and lookups of product prices, which collection would…
- Which operation is most efficient for an ArrayList?
- What will happen if you try to access an index in an ArrayList that is out of bounds?
- You need to store product IDs and ensure no duplicates, with the ability to retrieve them in sorted order. Which…