CSE Roadmap

Common tier · about 4 hours · 8 parts

Part 1 of 8 · 1 min read

Why this page comes last in Level 12

In this module you will

  • Scope a game leaderboard and size its update, read and memory needs.
  • Show why a relational database ranks slowly at this size, and what a sorted set does instead.
  • Name the Redis commands for adding points, reading the top 10 and finding a player's rank.
  • Shard a leaderboard by score range or by hash slot, and say what each costs.
  • Describe a rebuild path, a NoSQL alternative and a serverless deployment.

The earlier cases were about streams, storage and money. This one is about choosing the right data structure. The same question, "who is in the lead?", is slow with one tool and instant with another. It also shows how far one machine can go before sharding is needed. The book used is "System Design Interview, Volume 2" by Alex Xu, the real-time gaming leaderboard chapter. Numbers marked "made up" only show the idea.