Riot Games Coding Interview Questions
25 Riot Games coding interview problems with full optimal solutions — 13 easy, 9 medium, 3 hard. Every problem ships with multiple approaches (brute-force first, then the optimal), complexity tables for each, company-specific tips on what an Riot Games interviewer values, and a FAQ section.
Showing 13 problems of 25
- #1easyfoundational
1. Two Sum
Find two indices in an array whose values sum to a target — a hash-map warm-up at Riot before pivoting to matchmaking systems.
- #2easyfoundational
2. Valid Parentheses
Validate balanced brackets with a stack — Riot uses this to gauge stack fluency before chat-protocol parsing questions.
- #3easyfoundational
3. Merge Two Sorted Lists
Merge two sorted linked lists into one — Riot uses this to test pointer hygiene before queue-merge matchmaking questions.
- #4easyfoundational
4. Remove Duplicates from Sorted Array
Compact a sorted array in place — Riot uses this for two-pointer fluency before state-replication delta questions.
- #5easyfoundational
5. Remove Element
Filter an array in place by value — Riot uses this to test write-pointer mechanics before anti-cheat blacklist filtering questions.
- #6easyfoundational
6. Search Insert Position
Find where to insert a value in a sorted array — Riot uses this for binary-search fluency before MMR bucket lookup questions.
- #7easyfoundational
7. Maximum Subarray
Find the contiguous subarray with the largest sum — Riot uses Kadane to probe DP intuition before damage-window analytics questions.
- #8easyfoundational
8. Plus One
Increment a big-integer represented as a digit array — Riot uses this for carry-handling fluency before frame-counter arithmetic questions.
- #9easyfoundational
9. Same Tree
Compare two binary trees node-by-node — a recursion warm-up before Riot dives into client/server state-replication problems.
- #10easyfoundational
10. Single Number
Find the only element that appears once in an array where every other element appears twice — a bitwise trick Riot favors for low-overhead anti-cheat heuristics.
- #11easyfoundational
11. Linked List Cycle
Detect whether a singly linked list contains a cycle — Floyd's tortoise-and-hare is the canonical low-memory check Riot uses for replication-graph loops.
- #12easyfoundational
12. Majority Element
Find the element that appears more than n/2 times — Boyer-Moore voting is a Riot favorite because it surfaces dominant patterns in chat-spam and anti-cheat telemetry.
- #13easyfoundational
13. Reverse Linked List
Reverse a singly linked list in place — a pointer-manipulation warm-up Riot uses before scaling up to replay-buffer reversal questions.