← Verkada Interview InsightsSoftware Engineer

Verkada·Software Engineer·Onsite - System Design / Architecture·Intermediate

IntermediatePrefer not to say
May 2026

Summary

System design round at Verkada for a software engineer role. The whole thing was basically one big question about access control, but it branched out a lot more than I expected once we got into the storage layer.

Questions Asked (1)

Q1

Design an access control system that supports looking up which doors a person can open, which people can open a given door, and granting a person access to a door.

System DesignData ModelingTechnical Trade-offs
Author's notes

I jumped straight to a relational model with a join table and the interviewer seemed fine with that, but then they pushed on what happens at scale.

Create a free account to read the full note

AI HintsAI Generated

Suggested Approach

Start by clarifying requirements and scale, then propose a data model that supports efficient bidirectional lookups (e.g., a many-to-many mapping between persons and doors). Discuss trade-offs between normalized relational tables and denormalized indexes, and outline how to handle grants, revocations, and queries at scale.

Pro tip: Mention that access control is security-critical, so you should consider caching, eventual consistency, and audit logging; also, proactively discuss how to handle revocation and propagation delays.

1. Clarify Requirements and Scale

Ask about expected number of users, doors, and access checks per second; whether reads or writes dominate; and consistency requirements (e.g., immediate revocation).

2. Design Core Data Model

Propose a many-to-many relationship between Person and Door, with an AccessGrant entity. Consider using a relational database with a join table, or a wide-column store for scale.

3. Optimize for Bidirectional Queries

Ensure efficient lookups in both directions: index by person_id and door_id. Discuss denormalization or materialized views if needed for performance.

4. Handle Grant and Revoke Operations

Describe how to add or remove access, including idempotency, conflict resolution, and propagation to edge devices or caches.

5. Address Scalability and Reliability

Discuss partitioning, replication, caching strategies, and how to ensure low-latency access checks at scale, including fallback mechanisms.

Key Points to Mention

  • Many-to-many mapping with a join table (e.g., access_grants) and appropriate indexes on both person_id and door_id.
  • Trade-offs between normalized relational design and denormalized/NoSQL approaches for read-heavy workloads.
  • Caching strategies (e.g., Redis) to speed up frequent access checks, with invalidation on grant/revoke.
  • Consistency models: strong vs. eventual consistency, and how to handle revocation propagation delays.
  • Audit logging and security considerations (e.g., encryption, access control on the access control system itself).
  • Scalability techniques: sharding by person_id or door_id, read replicas, and handling hot partitions.

AI-generated suggestions, not part of the candidate's original notes. May be inaccurate — verify before relying on them.