Intellectual Olympiad in Informatics - 2026 ongoing
1000 ₸
Subject: Informatics Level: VIII (I is easiest, XII is hardest)
Category: student
Question language: English
Questions: 15
Example question: When a dynamic array doubles its capacity whenever it becomes full, what is the amortized time complexity of appending one element? O(1), O(log n), O(n), O(n log n)