Blog

Your dream job? Lets Git IT.
Interactive technical interview preparation platform designed for modern developers.

XGitHub

Platform

  • Categories

Resources

  • Blog
  • About the app
  • FAQ
  • Feedback

Legal

  • Privacy Policy
  • Terms of Service

© 2025 LetsGit.IT. All rights reserved.

LetsGit.IT/Categories/Algorithms
Algorithmsmedium

What does amortized O(1) mean? Explain with dynamic array growth.

Tags
#amortized#complexity#dynamic-array#analysis
Back to categoryPractice quiz

Answer

Amortized means “average cost per operation over a whole sequence”, even if some single operations are expensive. In a dynamic array, most appends are O(1), and once in a while you pay O(n) to resize/copy—spread across many appends it becomes O(1) amortized.

Related questions

Algorithms
Heap sort: what are its time complexity, space complexity, and stability?
#heapsort#sorting#complexity
Algorithms
Bitmask DP (subset DP): what is it and what is a typical complexity?
#dp#bitmask#subset
Algorithms
Sliding window: what is it and when is it better than nested loops?
#sliding-window#two-pointers#complexity
Algorithms
What does Big-O describe?
#big-o#complexity#performance
Algorithms
QuickSort vs MergeSort?
#sorting#quicksort#mergesort
Algorithms
Explain Binary Search.
#search#binary-search#algorithm