Challenge Library
Coding Challenges
5,893 curated questions across every arena — browse by topic, then jump into a live 3-minute battle to put them to the test.
Filter by type
Filter by difficulty
Popular topics
5,893 challenges total
- Multiple ChoiceHard
Boyer-Moore Majority Vote
dsahard - Multiple ChoiceHard
Tarjan's SCC
dsahard - Multiple ChoiceHard
Manacher's Algorithm
dsahard - Multiple ChoiceHard
Z Algorithm
dsahard - Multiple ChoiceHard
Convex Hull
dsahard - Multiple ChoiceHard
Splay Tree
dsahard - Multiple ChoiceHard
Bloom Filter
dsahard - Multiple ChoiceHard
Skip List
dsahard - Multiple ChoiceHard
Treap
dsahard - Multiple ChoiceIntermediate
Brute Force
dsaintermediate - Multiple ChoiceIntermediate
Prefix Sum
dsaintermediate - Multiple ChoiceIntermediate
Monotonic Stack
dsaintermediate - Multiple ChoiceIntermediate
Bit Manipulation
dsaintermediate - Multiple ChoiceIntermediate
Reservoir Sampling
dsaintermediate - Multiple ChoiceIntermediate
Quickselect
dsaintermediate - Multiple ChoiceIntermediate
Counting Sort
dsaintermediate - Multiple ChoiceIntermediate
Binary Lifting
dsaintermediate - Multiple ChoiceIntermediate
Sieve of Eratosthenes
dsaintermediate - Multiple ChoiceIntermediate
Kadane's Algorithm
dsaintermediate - Multiple ChoiceHard
What is NP-Hard?
dsahard - Multiple ChoiceHard
What is NP-Complete?
dsahard - Multiple ChoiceHard
What is P class?
dsahard - Multiple ChoiceHard
What is SAT problem?
dsahard - Multiple ChoiceHard
What is reduction?
dsahard - Multiple ChoiceHard
What is greedy stays ahead?
dsahard - Multiple ChoiceHard
What is exchange argument?
dsahard - Multiple ChoiceHard
What is amortized analysis?
dsahard - Multiple ChoiceHard
What is the accounting method?
dsahard - Multiple ChoiceHard
What is the potential method?
dsahard - Multiple ChoiceHard
What is dynamic array doubling?
dsahard - Multiple ChoiceHard
What is Fibonacci heap?
dsahard - Multiple ChoiceHard
What is disjoint-set forest?
dsahard - Multiple ChoiceHard
What is Ackermann function?
dsahard - Multiple ChoiceHard
What is Morris traversal?
dsahard - Multiple ChoiceHard
What is Boyer-Moore majority?
dsahard - Multiple ChoiceHard
What is reservoir sampling?
dsahard - Multiple ChoiceHard
What is Fisher-Yates shuffle?
dsahard - Multiple ChoiceIntermediate
What is a stable sort?
dsaintermediate - Multiple ChoiceIntermediate
What is counting sort?
dsaintermediate - Multiple ChoiceIntermediate
Topological sort works on?
dsaintermediate - Multiple ChoiceIntermediate
Kahn's algorithm finds?
dsaintermediate - Multiple ChoiceIntermediate
Prim's algorithm uses?
dsaintermediate - Multiple ChoiceIntermediate
Kruskal's algorithm uses?
dsaintermediate - Multiple ChoiceIntermediate
Dijkstra cannot handle?
dsaintermediate - Multiple ChoiceIntermediate
Bellman-Ford relaxes all edges?
dsaintermediate - Multiple ChoiceIntermediate
Floyd-Warshall uses?
dsaintermediate - Multiple ChoiceIntermediate
What is memoization?
dsaintermediate - Multiple ChoiceIntermediate
What is tabulation?
dsaintermediate - Multiple ChoiceIntermediate
Optimal substructure means?
dsaintermediate - Multiple ChoiceIntermediate
Knapsack problem solves?
dsaintermediate - Multiple ChoiceIntermediate
Activity selection picks?
dsaintermediate - Multiple ChoiceIntermediate
Huffman coding builds?
dsaintermediate - Multiple ChoiceIntermediate
BFS uses which data structure?
dsaintermediate - Multiple ChoiceIntermediate
DFS uses which data structure?
dsaintermediate - Multiple ChoiceIntermediate
What is backtracking?
dsaintermediate - Multiple ChoiceIntermediate
N-Queens is solved by?
dsaintermediate - Multiple ChoiceIntermediate
Merge sort is?
dsaintermediate - Multiple ChoiceIntermediate
Quick sort is?
dsaintermediate - Multiple ChoiceIntermediate
Heap sort is?
dsaintermediate - Multiple ChoiceIntermediate
What is LRU cache?
dsaintermediate
Practice now, dominate the arena
Every challenge here is drawn from the live Code Royale pool. Review a question, then head to the arena to answer under pressure against a real opponent — 3-minute matches, Elo ranking, and badge tiers on the line.