Intellectual Olympiad in Algorithms and Programming Fundamentals - 2026 ongoing
1000 ₸
Subject: Algorithms and Programming Fundamentals Level: VIII (I is easiest, XII is hardest)
Category: student
Question language: English
Questions: 15
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