← Back to Directory

Verkada interview notes, page 1 of 4

Mid-sized

Most of these Verkada write-ups come from Software Engineers (27), then Frontend Engineers (4). The most reported rounds are the technical phone screen (22), the system design round (7), the behavioral / leadership round (1) and the onsite coding round (1).

31 interview notes · updated Jul 2026

Verkada·Software Engineer·Technical Phone Screen

Apr 2026
Verkada coding screen, one problem the whole time. It's a Wordle-style feedback function and the duplicate letter handling is where they actually care about whether you thought it through.
  • Implement a function that takes a secret word and a guess of equal length, and returns an array where each position is marked GREEN (exact match), YELLOW (letter exists but wrong position), or GRAY (not present). Handle invalid inputs with an exception, and be careful about how duplicate letters are counted.

“The basic case is fine, loop through and compare.”

View Post

Verkada·Software Engineer·Technical Phone Screen

Apr 2026
Verkada Software Engineer interview with a pretty gnarly JavaScript problem about building a frame-by-frame media player controller from scratch. The question covered a lot of ground: timer scheduling, closures, edge cases, the works. Felt more like a system design and coding hybrid than a pure algo round.
  • Implement a JavaScript media player controller that supports frame-by-frame playback with configurable FPS, exposes a clean API (play, pause, seek, setFPS, currentFrame, isPlaying), and handles timer scheduling correctly using closures to encapsulate state.
  • Compare setTimeout vs setInterval vs requestAnimationFrame for scheduling frames in a browser media player. What are the tradeoffs and which would you choose?
  • How would you handle edge cases like seeking while the player is already playing, receiving an invalid frame index, reaching the last frame, and resuming after a pause?

“This was a lot more than just 'write some JS.' I started with a closure-based module pattern which felt right, but then got into the weeds on timer drift pretty fast.”

View Post

Verkada·Software Engineer·Onsite - System Design / Architecture

Apr 2026
System design round at Verkada for a software engineering role, one big question about monitoring cameras at scale. The whole session was basically a deep dive into a single problem and they pushed hard on every layer of it.
  • Design a system that monitors 10 million cameras, each sending a heartbeat signal once per minute. The system needs to report healthy vs unhealthy device counts in near real time, handle ingestion at scale, and correctly mark a device as unhealthy if it misses heartbeats within a sliding time window.

“This one took me a second to size up.”

View Post

Verkada·Software Engineer·Technical Phone Screen

Apr 2026
Interviewed for a software engineer role at Verkada. The technical portion had a classic array merging problem but with an in-place constraint that changes the whole approach. Nothing too wild, but the space complexity requirement is where people trip up.
  • You have two sorted integer arrays. Merge them into a single sorted array in-place using O(1) extra space. The first array has extra capacity at the end to hold all elements from both arrays.

“The naive approach is to just copy everything over and sort it, but they explicitly said O(1) space so that kills anything allocation-heavy.”

View Post

Verkada·Software Engineer·Onsite - System Design / Architecture

Apr 2026
System design round at Verkada for a software engineering role. The whole thing centered on one problem but went pretty deep, covering data modeling, storage choices, and scaling concerns. Left feeling okay about it but not certain.
  • Design an access control system that supports looking up all doors a person can open, looking up all people who can open a given door, and granting a person access to a door via an admin operation.

“The core of the problem is just a many-to-many relationship, which I spotted pretty fast.”

View Post

Verkada·Software Engineer·Technical Phone Screen

Apr 2026
Verkada coding screen for a software engineer role, pretty much a straight LeetCode 146 situation. Nothing tricky or novel, just the classic LRU cache problem with the O(1) constraint.
  • Design and implement an LRU cache class that supports get and put operations, both in O(1) average time, with eviction of the least recently used entry when capacity is exceeded.

“Classic problem, so I'd seen it before, but the O(1) constraint is where people trip up if they haven't thought through the data structure combo.”

View Post

Verkada·Software Engineer·Onsite - System Design / Architecture

May 2026
System design round at Verkada for a software engineer role. The whole thing was basically a deep dive into YouTube architecture, which sounds broad but they pushed hard on three specific areas. Time pressure was real.
  • Design YouTube end-to-end. Walk through the high-level architecture covering ingestion, storage, encoding, CDN, and playback, including the metadata layer and recommendation path.
  • How would you design video search for YouTube, including indexing, ranking, autocomplete, and personalization?
  • How do you scale video uploads to handle many concurrent large file uploads? Cover chunked uploads, presigned URLs, the transcoding pipeline, and CDN fan-out.
  • What happens when a video upload fails partway through? How do you handle resumability, retries, idempotency, orphaned chunk cleanup, and the user-facing recovery experience?

“I started with the ingestion to playback pipeline which felt right, but I spent too long on it and left myself almost no buffer for the deep dives.”

View Post

Verkada·Software Engineer·Technical Phone Screen

May 2026
Verkada coding screen for a software engineer role, one algorithmic problem centered on permission graph traversal. Pretty niche problem space given what the company actually does, which in hindsight makes sense.
  • You're given a list of (subject, relationship, object) permission tuples where subjects can be users or groups and objects include cameras. Write code to find the single user who has access to every camera, either directly or through arbitrarily nested group memberships (no cycles in the group graph).

“The graph traversal part wasn't too bad once I drew it out, but I kept second-guessing whether to go top-down from cameras or bottom-up from users.”

View Post

Verkada·Software Engineer·Technical Phone Screen

May 2026
Verkada SWE interview with an in-place array merge problem. Pretty clean algorithmic question, nothing too wild, but the O(1) space constraint is where it gets interesting.
  • You have two sorted arrays. The first array has extra space at the end to accommodate all elements from the second. Merge the second array into the first in-place, keeping everything sorted, using constant extra space.

“The naive approach is just copy everything into a temp array and sort it, but they want O(1) space so that's out.”

View Post

Verkada·Software Engineer·Technical Phone Screen

May 2026
Verkada software engineer screen with a sensor data processing problem. Pretty focused, just the one coding question, felt like a typical technical phone screen.
  • Given a list of timestamped motion sensor readings and a threshold value, return all time intervals where motion level continuously exceeds the threshold. Consecutive active readings form one interval regardless of gaps between their timestamps.

“The problem looks straightforward until you slow down and realize the interval grouping is based on adjacency in the array, not on actual time continuity.”

View Post