Bird
Raised Fist0
Redisquery~5 mins

Why sorted sets combine uniqueness with ordering in Redis

Choose your learning style10 modes available
Introduction

Sorted sets in Redis let you store unique items and keep them in order at the same time. This helps you quickly find items by their rank or score.

When you want to keep a list of top scores in a game without duplicates.
When you need to show items sorted by time or priority and avoid repeats.
When you want to rank users by points and get their position easily.
When you want to store unique tags with a weight and retrieve them sorted.
When you want to combine fast lookups with sorted results.
Syntax
Redis
ZADD key [NX|XX] [CH] [INCR] score member [score member ...]
ZADD adds members with scores to a sorted set, keeping members unique.
If a member exists, its score is updated, keeping uniqueness and order.
Examples
Adds three unique members with scores to the sorted set 'leaderboard'.
Redis
ZADD leaderboard 100 "Alice" 200 "Bob" 150 "Carol"
Updates Alice's score to 250, keeping her unique and reordering the set.
Redis
ZADD leaderboard 250 "Alice"
Adds Dave only if he is not already in the set (NX means no update if exists).
Redis
ZADD leaderboard NX 300 "Dave"
Sample Program

This adds three fruits with scores, updates banana's score, then lists all items sorted by score.

Redis
ZADD scores 10 "apple" 20 "banana" 15 "cherry"
ZADD scores 25 "banana"
ZRANGE scores 0 -1 WITHSCORES
OutputSuccess
Important Notes

Sorted sets keep members unique by name but order them by score.

Updating a member's score changes its position in the order.

Use ZRANGE to get members in order with their scores.

Summary

Sorted sets combine uniqueness and ordering by storing unique members with scores.

This allows fast ranking and retrieval of items in sorted order.

Updating scores reorders members without duplicates.

Practice

(1/5)
1. What is the main reason Redis sorted sets combine uniqueness with ordering?
easy
A. To store unique members with associated scores for sorted retrieval
B. To allow duplicate members with different scores
C. To store unordered lists of members
D. To only store scores without members

Solution

  1. Step 1: Understand uniqueness in sorted sets

    Sorted sets store each member only once, ensuring uniqueness.
  2. Step 2: Understand ordering in sorted sets

    Each member has a score that determines its order in the set.
  3. Final Answer:

    To store unique members with associated scores for sorted retrieval -> Option A
  4. Quick Check:

    Uniqueness + ordering = unique members with scores [OK]
Hint: Remember: unique members + scores = sorted sets [OK]
Common Mistakes:
  • Thinking duplicates are allowed
  • Confusing sorted sets with lists
  • Ignoring the role of scores
2. Which of the following is the correct Redis command to add a member with a score to a sorted set?
easy
A. ZADD myset member1 10
B. SADD myset 10 member1
C. ZADD myset 10 member1
D. ADD myset 10 member1

Solution

  1. Step 1: Recall Redis sorted set add syntax

    The correct syntax is ZADD key score member.
  2. Step 2: Match syntax with options

    ZADD myset 10 member1 matches ZADD myset 10 member1 correctly.
  3. Final Answer:

    ZADD myset 10 member1 -> Option C
  4. Quick Check:

    ZADD key score member = correct syntax [OK]
Hint: ZADD uses score before member name [OK]
Common Mistakes:
  • Using SADD instead of ZADD
  • Swapping score and member order
  • Using ADD command which doesn't exist
3. Given the commands:
ZADD myset 5 apple
ZADD myset 10 banana
ZADD myset 7 cherry
What will ZRANGE myset 0 -1 WITHSCORES return?
medium
A. ["apple", "5", "banana", "10", "cherry", "7"]
B. ["apple", "5", "cherry", "7", "banana", "10"]
C. ["banana", "10", "cherry", "7", "apple", "5"]
D. ["cherry", "7", "apple", "5", "banana", "10"]

Solution

  1. Step 1: Understand ZADD inserts with scores

    Members apple=5, banana=10, cherry=7 are added.
  2. Step 2: ZRANGE returns members sorted by score ascending

    Order is apple(5), cherry(7), banana(10).
  3. Final Answer:

    ["apple", "5", "cherry", "7", "banana", "10"] -> Option B
  4. Quick Check:

    ZRANGE sorts by score ascending [OK]
Hint: ZRANGE returns members sorted by score ascending [OK]
Common Mistakes:
  • Assuming ZRANGE sorts by insertion order
  • Confusing WITHSCORES output format
  • Mixing up ascending and descending order
4. You run these commands:
ZADD myset 1 apple
ZADD myset 2 apple
ZRANGE myset 0 -1
But the output shows only one 'apple'. What is the issue?
medium
A. The second ZADD command has wrong syntax
B. Redis sorted sets allow duplicates, so this is a bug
C. ZRANGE command is incorrect and filters duplicates
D. Sorted sets do not allow duplicate members; score is updated instead

Solution

  1. Step 1: Understand uniqueness in sorted sets

    Sorted sets keep unique members only; adding same member updates score.
  2. Step 2: Analyze commands effect

    Second ZADD updates 'apple' score from 1 to 2, no duplicate added.
  3. Final Answer:

    Sorted sets do not allow duplicate members; score is updated instead -> Option D
  4. Quick Check:

    Same member updates score, no duplicates [OK]
Hint: Same member updates score, no duplicates added [OK]
Common Mistakes:
  • Expecting duplicates in sorted sets
  • Thinking ZRANGE filters duplicates
  • Assuming syntax error caused issue
5. You want to keep a leaderboard where players have unique names and scores that can change. Which Redis data structure best fits this need and why?
hard
A. Sorted sets, because they store unique members with scores and keep them ordered
B. Lists, because they allow duplicates and maintain insertion order
C. Hashes, because they store key-value pairs without ordering
D. Sets, because they store unique members but no scores

Solution

  1. Step 1: Identify requirements for leaderboard

    Need unique player names, scores, and sorted order by score.
  2. Step 2: Match Redis data structures to requirements

    Sorted sets store unique members with scores and keep order automatically.
  3. Step 3: Exclude other options

    Lists allow duplicates and no score ordering; hashes lack ordering; sets lack scores.
  4. Final Answer:

    Sorted sets, because they store unique members with scores and keep them ordered -> Option A
  5. Quick Check:

    Leaderboard needs unique + ordered scores = sorted sets [OK]
Hint: Leaderboard needs unique + ordered scores: use sorted sets [OK]
Common Mistakes:
  • Choosing lists or sets ignoring ordering or scores
  • Confusing hashes with sorted sets
  • Not considering uniqueness requirement
Recommended

Ready to prove it?

Pass the test and this pattern moves unknown strong while earning +1 Grip toward your certificate.

10 questions~5 mineasy hard