---
title: 'CAP Theorem in System Design Interviews'
source: 'https://youtube.com/watch?v=Ibf7wKf8MqU'
video_id: 'Ibf7wKf8MqU'
date: 2026-08-04
duration_sec: 84
---

# CAP Theorem in System Design Interviews

> Source: [CAP Theorem in System Design Interviews](https://youtube.com/watch?v=Ibf7wKf8MqU)

## Summary

This video explains the CAP theorem in the context of system design interviews, clarifying that it is not about choosing two of three guarantees but rather about making a single decision when a network partition occurs: whether to prioritize consistency or availability. It uses relatable examples to illustrate the trade-off and provides a simple heuristic for interview answers.

### Key Points

- **CAP theorem basics** [00:01] — CAP theorem stands for consistency, availability, and partition tolerance. Classic framing says a distributed system can only guarantee two of three.
- **Partition tolerance is non-optional** [00:14] — In a distributed system, network partitions are inevitable, so partition tolerance is not optional. Therefore, the real choice is between consistency and availability when a partition occurs.
- **The real question** [00:27] — When the network fails, you must decide: return possibly stale data (availability) or return an error (consistency).
- **Example: social app** [00:40] — For a social app, showing stale data (old picture) is acceptable, so you choose availability.
- **Example: Ticketmaster** [00:52] — For Ticketmaster selling the last seat, you would return an error to avoid selling the same seat twice, so you choose consistency.
- **Interview tip** [01:04] — In an interview, don't recite the three letters. Instead, answer the question: Is stale data acceptable or not?

### Conclusion

The CAP theorem in practice is a simple trade-off between consistency and availability when partitions occur. For interviews, focus on whether stale data is acceptable for the specific use case.

## Transcript

with a choice about CAP theorem, but the real decision is a lot simpler than you refresher. CAP theorem stands for consistency, availability, and partition tolerance. The classic framing is that a distributed system can only guarantee
two of the three. But, in a distributed system, the network will eventually partition tolerance is not optional. This means that CAP theorem isn't asking you to pick two of three. It's actually just asking one simple question. When
the network does fail, do you return possibly stale data, which would mean an error, which would mean choosing consistency? Let's look at an example. Say your user updates their profile in the United States, and the connection to
your Europe server goes down before that update is replicated. Then, a user in Europe requests the profile. Well, you have two options. You can show them the old picture, or you can refuse to answer until the network heals. For a social
app, you'd clearly show them the old picture. Stale data is fine. An error availability. For Ticketmaster, on the other hand, selling the last seat at a concert, you would return an error. You'd rather tell somebody try again
than sell the same seat twice. That's consistency. And so, when an interviewer three letters altogether. Just answer this one question. Is stale data acceptable or not? For a full breakdown on CAP theorem, head over to
hellointerview.com. Our link is in the bio.