Career Tracks
Exams
MCQ
Companies
Opportunities
Challenges
Pricing
MCQ Practice
Programming
Time & Space Complexity
Question
Hard
tcs-nqt
What is the amortised time complexity of push and pop operations in a dynamic array?
A
O(n)
B
O(log n)
C
O(n²)
D
O(1)
Show Answer
← Back to Time & Space Complexity questions
What is the amortised time complexity of push and pop operations in a dynamic array? | Time & Space Complexity MCQ | TomoLink | TomoLink
