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 3 problems of 25
- #23hardfoundational
23. Find Median from Data Stream
Design a structure that returns the median of a streaming sequence — Riot uses two-heap streaming medians to track rolling Elo/Glicko percentile windows.
- #24hardfoundational
24. LFU Cache
Design an O(1) least-frequently-used cache — Riot favors LFU over LRU when caching match-history queries that exhibit heavy-tail access patterns.
- #25hardfoundational
25. Sliding Window Maximum
Return the maximum of every sliding window of size k — Riot uses monotonic deques to track peak damage or ping spikes within rolling server-tick windows.