Intellectual Olympiad in Algorithms and Programming Fundamentals - 2026 ongoing

Subject: Algorithms and Programming Fundamentals
Level: VIII
Category: student
Quiz questions: in English
Example question: A dynamic array doubles its capacity whenever it becomes full. What is the amortized time complexity of appending n elements to an initially empty array? O(log n) per append, O(n) per append, O(n log n) in total, O(n) in total