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
1,033 challenges matching your filters
Clear topic filter- Multiple ChoiceIntermediate
[Algorithms] Data structure Level-order graph traversal
qaalgosalgosqa - Multiple ChoiceIntermediate
[Algorithms] Shortest path Level-order graph traversal
qaalgosalgosqa - Multiple ChoiceIntermediate
[Algorithms] Visited Level-order graph traversal
qaalgosalgosqa - Multiple ChoiceIntermediate
[Algorithms] Complexity Level-order graph traversal
qaalgosalgosqa - Multiple ChoiceIntermediate
[Algorithms] Bidirectional Level-order graph traversal
qaalgosalgosqa - Multiple ChoiceBeginner
[Algorithms] Precondition O(log n) on sorted array
qaalgosalgosqa - Multiple ChoiceBeginner
[Algorithms] Mid calc O(log n) on sorted array
qaalgosalgosqa - Multiple ChoiceBeginner
[Algorithms] Termination O(log n) on sorted array
qaalgosalgosqa - Multiple ChoiceBeginner
[Algorithms] First occurrence O(log n) on sorted array
qaalgosalgosqa - Multiple ChoiceBeginner
[Algorithms] Rotated array O(log n) on sorted array
qaalgosalgosqa - Multiple ChoiceHard
[Algorithms] Search Ordered tree structure
qaalgosalgosqa - Multiple ChoiceHard
[Algorithms] Insert Ordered tree structure
qaalgosalgosqa - Multiple ChoiceHard
[Algorithms] Successor Ordered tree structure
qaalgosalgosqa - Multiple ChoiceHard
[Algorithms] Delete Ordered tree structure
qaalgosalgosqa - Multiple ChoiceHard
[Algorithms] Balance Ordered tree structure
qaalgosalgosqa - Multiple ChoiceHard
[Algorithms] Priority queue Single-source shortest path
qaalgosalgosqa - Multiple ChoiceHard
[Algorithms] Relaxation Single-source shortest path
qaalgosalgosqa - Multiple ChoiceHard
[Algorithms] Negative edges Single-source shortest path
qaalgosalgosqa - Multiple ChoiceHard
[Algorithms] vs A* Single-source shortest path
qaalgosalgosqa - Multiple ChoiceHard
[Algorithms] Dial's algorithm Single-source shortest path
qaalgosalgosqa - Multiple ChoiceHard
[Algorithms] Top-down Subproblem memoization
qaalgosalgosqa - Multiple ChoiceHard
[Algorithms] Bottom-up Subproblem memoization
qaalgosalgosqa - Multiple ChoiceHard
[Algorithms] Knapsack Subproblem memoization
qaalgosalgosqa - Multiple ChoiceHard
[Algorithms] LCS Subproblem memoization
qaalgosalgosqa - Multiple ChoiceHard
[Algorithms] Optimal substructure Subproblem memoization
qaalgosalgosqa - Multiple ChoiceIntermediate
[Algorithms] Coin change Locally optimal choice
qaalgosalgosqa - Multiple ChoiceIntermediate
[Algorithms] Activity selection Locally optimal choice
qaalgosalgosqa - Multiple ChoiceIntermediate
[Algorithms] Huffman coding Locally optimal choice
qaalgosalgosqa - Multiple ChoiceIntermediate
[Algorithms] When fails Locally optimal choice
qaalgosalgosqa - Multiple ChoiceIntermediate
[Algorithms] Matroid Locally optimal choice
qaalgosalgosqa - Multiple ChoiceBeginner
[Algorithms] Collision O(1) lookup on average
qaalgosalgosqa - Multiple ChoiceBeginner
[Algorithms] Load factor O(1) lookup on average
qaalgosalgosqa - Multiple ChoiceBeginner
[Algorithms] Hash function O(1) lookup on average
qaalgosalgosqa - Multiple ChoiceBeginner
[Algorithms] Rehashing O(1) lookup on average
qaalgosalgosqa - Multiple ChoiceBeginner
[Algorithms] Perfect hash O(1) lookup on average
qaalgosalgosqa - Multiple ChoiceIntermediate
[Algorithms] Divide Stable O(n log n)
qaalgosalgosqa - Multiple ChoiceIntermediate
[Algorithms] Merge Stable O(n log n)
qaalgosalgosqa - Multiple ChoiceIntermediate
[Algorithms] Stable Stable O(n log n)
qaalgosalgosqa - Multiple ChoiceIntermediate
[Algorithms] Space Stable O(n log n)
qaalgosalgosqa - Multiple ChoiceIntermediate
[Algorithms] External sorting Stable O(n log n)
qaalgosalgosqa - Multiple ChoiceIntermediate
[Algorithms] Pivot choice Divide and conquer with pivot
qaalgosalgosqa - Multiple ChoiceIntermediate
[Algorithms] Lomuto partition Divide and conquer with pivot
qaalgosalgosqa - Multiple ChoiceIntermediate
[Algorithms] Hoare partition Divide and conquer with pivot
qaalgosalgosqa - Multiple ChoiceIntermediate
[Algorithms] Worst O(n²) Divide and conquer with pivot
qaalgosalgosqa - Multiple ChoiceIntermediate
[Algorithms] 3-way Divide and conquer with pivot
qaalgosalgosqa - Multiple ChoiceIntermediate
[AWS] REST vs HTTP Managed API frontend
qaawsawsqa - Multiple ChoiceIntermediate
[AWS] Stages Managed API frontend
qaawsawsqa - Multiple ChoiceIntermediate
[AWS] Throttling Managed API frontend
qaawsawsqa - Multiple ChoiceIntermediate
[AWS] Integration Managed API frontend
qaawsawsqa - Multiple ChoiceIntermediate
[AWS] CORS Managed API frontend
qaawsawsqa - Multiple ChoiceHard
[AWS] Partition key Managed NoSQL database
qaawsawsqa - Multiple ChoiceHard
[AWS] Sort key Managed NoSQL database
qaawsawsqa - Multiple ChoiceHard
[AWS] GSI/LSI Managed NoSQL database
qaawsawsqa - Multiple ChoiceHard
[AWS] Provisioned vs on-demand Managed NoSQL database
qaawsawsqa - Multiple ChoiceHard
[AWS] DynamoDB Streams Managed NoSQL database
qaawsawsqa - Multiple ChoiceBeginner
[AWS] Instance types Virtual servers (IaaS)
qaawsawsqa - Multiple ChoiceBeginner
[AWS] AMI Virtual servers (IaaS)
qaawsawsqa - Multiple ChoiceBeginner
[AWS] Security groups Virtual servers (IaaS)
qaawsawsqa - Multiple ChoiceBeginner
[AWS] EBS Virtual servers (IaaS)
qaawsawsqa - Multiple ChoiceBeginner
[AWS] Spot instances Virtual servers (IaaS)
qaawsawsqa
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.