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
81 challenges matching your filters
Clear topic filter- Code AnalysisHard
Trace: Merge Two Sorted
dsaanalysishard - Code AnalysisHard
Trace: Apply Method
dsaanalysishard - Code AnalysisHard
Trace: Async Return Type
dsaanalysishard - Code AnalysisHard
Trace: Bind Partial
dsaanalysishard - Code AnalysisHard
Trace: Closure Factory
dsaanalysishard - Code AnalysisHard
Trace: Object Coercion
dsaanalysishard - Code AnalysisHard
Trace: Destructure Defaults
dsaanalysishard - Code AnalysisHard
Trace: Event Loop Order
dsaanalysishard - Code AnalysisHard
Trace: For-Of Loop
dsaanalysishard - Code AnalysisHard
Trace: Generator Yield*
dsaanalysishard - Code AnalysisHard
Trace: Var Hoisting
dsaanalysishard - Code AnalysisHard
Trace: MAX_SAFE_INTEGER
dsaanalysishard - Code AnalysisHard
Trace: Promise.race
dsaanalysishard - Code AnalysisHard
Trace: Sort Compare
dsaanalysishard - Code AnalysisHard
Trace: This in Global
dsaanalysishard - Code AnalysisHard
Trace: This in Method
dsaanalysishard - Code AnalysisHard
Trace: toFixed Precision
dsaanalysishard - Code AnalysisHard
Trace: ValueOf Override
dsaanalysishard - Multiple ChoiceHard
Edit Distance (Levenshtein)
dsadphard - Multiple ChoiceHard
0/1 Knapsack
dsadphard - Multiple ChoiceHard
Longest Common Subsequence
dsadphard - Multiple ChoiceHard
Subset Sum
dsadphard - Multiple ChoiceHard
DP vs Naive Recursion
dsadphard - Multiple ChoiceHard
Fenwick Tree (BIT)
dsafenwick-treehard - Multiple ChoiceHard
Fenwick vs Segment Tree
dsafenwick-treehard - Multiple ChoiceHard
Bellman-Ford Algorithm
dsagraphshard - Multiple ChoiceHard
Dijkstra's Algorithm
dsagraphshard - Multiple ChoiceHard
Floyd-Warshall Algorithm
dsagraphshard - Multiple ChoiceHard
Minimum Spanning Tree
dsagraphshard - Multiple ChoiceHard
Strongly Connected Components
dsagraphshard - Multiple ChoiceHard
Topological Sort
dsagraphshard - Multiple ChoiceHard
Amortized Cost
dsamcqhard - Multiple ChoiceHard
Overlapping Subproblems
dsamcqhard - Multiple ChoiceHard
Cycle Detection
dsamcqhard - Multiple ChoiceHard
Timsort is a hybrid of
dsahard - Multiple ChoiceHard
Introsort combines
dsahard - Multiple ChoiceHard
Comparison sorts need at least
dsahard - Multiple ChoiceHard
Radix sort achieves O(d(n+k)) by
dsahard - Multiple ChoiceHard
Bucket sort distributes into
dsahard - Multiple ChoiceHard
External sorting handles data that
dsahard - Multiple ChoiceHard
HyperLogLog estimates
dsahard - Multiple ChoiceHard
Count-Min Sketch estimates
dsahard - Multiple ChoiceHard
Cuckoo hashing guarantees
dsahard - Multiple ChoiceHard
Consistent hashing minimizes
dsahard - Multiple ChoiceHard
A* Search
dsahard - 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 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
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.