Distributed counters pattern in Firebase - Practice Problems & Coding Challenges

Challenge - 5 Problems

❓ Architecture

intermediate

Why use distributed counters in Firebase?

In Firebase, what is the main reason to use distributed counters instead of a single document counter?

A To prevent any writes from failing by locking the counter document.

B To avoid contention and improve write scalability by splitting increments across multiple documents.

C To reduce the total number of reads by storing all counts in one document.

D To ensure the counter value is always exactly consistent in real-time without delay.

💡 Hint

Think about what happens when many users try to update the same counter at once.

Distributed counters split increments across multiple documents to reduce write contention and improve scalability. A single document can become a bottleneck when many writes happen simultaneously.

❓ service_behavior

intermediate

Behavior of incrementing a distributed counter shard

Given a distributed counter with 5 shards, what happens when you increment one shard document in Firebase?

A The increment fails if the shard document does not exist.

B All shard documents increase their count by one simultaneously.

C The total count document is updated directly without changing shards.

D Only the shard document's count increases by one; the total count is the sum of all shards.

💡 Hint

Consider how distributed counters store counts across shards.

Each shard document holds part of the total count. Incrementing one shard increases only that shard's count. The total count is calculated by summing all shards.

❓ security

advanced

Securing distributed counter shards in Firebase

Which Firebase security rule best prevents unauthorized users from arbitrarily modifying distributed counter shard values?

A Allow writes only if the increment value is exactly 1 and the user is authenticated.

B Allow any write to shard documents without restrictions.

C Allow writes only if the user is an admin, ignoring increment values.

D Deny all writes to shard documents.

💡 Hint

Think about limiting increments to small controlled changes by trusted users.

Security rules should allow increments only of 1 by authenticated users to prevent tampering. Allowing unrestricted writes or denying all writes would either be insecure or prevent updates.

❓ Configuration

advanced

Configuring shard count for a distributed counter

You want to configure a distributed counter in Firebase to handle up to 1000 increments per second without contention. Which shard count is most appropriate?

A 100 shards to reduce contention while controlling cost.

B 10 shards to balance between performance and cost.

C 1 shard because it simplifies the design.

D 1000 shards to allow one increment per shard per second.

💡 Hint

More shards reduce contention but increase cost and complexity.

100 shards provide a good balance to handle 1000 increments per second by spreading writes, reducing contention, and controlling costs compared to 1000 shards.

🧠 Conceptual

expert

Calculating total count from distributed counter shards

You have a distributed counter with 4 shards having counts: 12, 15, 10, and 13. What is the total count returned when you read the counter?

A 40

B 12

C 50

D 15

💡 Hint

Sum all shard counts to get the total.

The total count is the sum of all shard counts: 12 + 15 + 10 + 13 = 50.

Practice

1. What is the main reason to use the distributed counters pattern in Firebase?

easy

A. To avoid write conflicts by splitting counts into multiple shards

B. To store large files efficiently

C. To speed up user authentication

D. To reduce network bandwidth usage

Solution

1. Step 1: Understand the problem with single counters

   Single counters cause write conflicts when many users update at once.

2. Step 2: How distributed counters solve this

   Splitting the count into shards lets many users write to different parts, avoiding conflicts.

3. Final Answer:

   To avoid write conflicts by splitting counts into multiple shards -> Option A

4. Quick Check:

   Distributed counters = avoid conflicts [OK]

Hint: Distributed counters split counts to avoid conflicts [OK]

Common Mistakes:

• Thinking it speeds up authentication
• Confusing with file storage
• Assuming it reduces bandwidth

2. Which Firebase data structure is typically used to implement shards in a distributed counter?

easy

A. A single document with a numeric field

B. A collection of user profiles

C. Multiple documents each representing a shard

D. A storage bucket

Solution

1. Step 1: Identify how shards are stored

   Each shard is stored as a separate document to allow independent updates.

2. Step 2: Why multiple documents

   Multiple documents reduce write conflicts by spreading writes across shards.

3. Final Answer:

   Multiple documents each representing a shard -> Option C

4. Quick Check:

   Shards = multiple documents [OK]

Hint: Shards are separate documents, not single fields [OK]

Common Mistakes:

• Using a single document for all shards
• Confusing shards with user profiles
• Thinking shards are stored in storage buckets

3. Given this code snippet to increment a distributed counter shard in Firebase Firestore, what is the expected behavior?

const shardId = Math.floor(Math.random() * 5);
const shardRef = firestore.collection('counters').doc('counter1').collection('shards').doc(shardId.toString());
await shardRef.update({ count: firebase.firestore.FieldValue.increment(1) });

medium

A. It increments the count in a random shard to reduce write conflicts

B. It increments the count in all shards simultaneously

C. It causes an error because shardId is a number

D. It resets the count to 1 in the selected shard

Solution

1. Step 1: Understand shard selection

   The code picks a random shard ID between 0 and 4 to update.

2. Step 2: What update does

   It increments the count field in that shard by 1, avoiding conflicts.

3. Final Answer:

   It increments the count in a random shard to reduce write conflicts -> Option A

4. Quick Check:

   Random shard increment = reduce conflicts [OK]

Hint: Random shard update avoids conflicts [OK]

Common Mistakes:

• Thinking it updates all shards at once
• Assuming shardId type causes error
• Believing it resets count instead of incrementing

4. You have a distributed counter with 3 shards but the total count is incorrect. Which of these is a likely cause?

medium

A. You incremented the same shard multiple times

B. You forgot to sum all shard counts when reading the total

C. You used a single document instead of shards

D. You used a random shard for increments

Solution

1. Step 1: Check how total count is calculated

   Total count must be the sum of all shard counts.

2. Step 2: Identify missing sum

   If you read only one shard or forget to sum, total will be wrong.

3. Final Answer:

   You forgot to sum all shard counts when reading the total -> Option B

4. Quick Check:

   Sum all shards for total [OK]

Hint: Always sum all shards to get total count [OK]

Common Mistakes:

• Assuming incrementing same shard causes wrong total
• Confusing single document with shards
• Thinking random shard increments cause errors

5. You want to design a distributed counter with 10 shards for a high-traffic app. Which approach best balances accuracy and performance?

hard

A. Increment shards sequentially in a fixed order

B. Increment all shards on each update and read any one shard for total

C. Use a single document counter with transaction retries

D. Increment a random shard on each update and sum all shards when reading total

Solution

1. Step 1: Understand update strategy

   Incrementing a random shard spreads writes and avoids conflicts.

2. Step 2: Understand read strategy

   Summing all shards gives accurate total, though slightly delayed.

3. Step 3: Why other options fail

   Incrementing all shards wastes writes; single document causes conflicts; sequential increments cause bottlenecks.

4. Final Answer:

   Increment a random shard on each update and sum all shards when reading total -> Option D

5. Quick Check:

   Random increment + sum shards = best balance [OK]

Hint: Random increments + sum shards = best practice [OK]

Common Mistakes:

• Trying to increment all shards each time
• Using single document counter under high load
• Incrementing shards in fixed order causing bottlenecks