Intellectual Olympiad in Informatics - 2026 ongoing
1000 ₸
Subject: Informatics Level: XI (I is easiest, XII is hardest)
Category: student
Question language: English
Questions: 15
Example question: Which string-matching algorithm preprocesses a pattern using a prefix-function table and guarantees O(n + m) time for searching a pattern of length m in a text of length n? Rabin–Karp, Boyer–Moore, Knuth–Morris–Pratt, Floyd–Warshall