ZipRecruiter Software Engineer interview questions

4 Software Engineers have shared notes from their ZipRecruiter interviews, with the questions they were asked in each round. That is 80% of the 5 ZipRecruiter interview notes on Screna AI.

4 Software Engineer interview notes

ZipRecruiter·Software Engineer·Technical Phone Screen

May 2026
ZipRecruiter SWE interview focused on extending an in-memory key-value store with scan operations, then digging into data structure tradeoffs for prefix-based lookups. Pretty design-heavy for what felt like a coding round.
  • You have an in-memory key-value store where each key maps to a collection of field-value pairs. Implement a scan(key) operation that returns all field-value pairs for a given key, sorted lexicographically by field name. Return an empty result if the key doesn't exist.
  • Extend the store with a scan_by_prefix(key, prefix) operation that returns only the field-value pairs whose field name starts with a given prefix, again in lexicographic order.
  • Walk through the time complexity tradeoffs between using a sorted map versus a linear scan with sort-on-read for both scan and scan_by_prefix. When does each approach make sense?

“Felt straightforward at first.”

View Post

ZipRecruiter·Software Engineer·Technical Phone Screen

May 2026
Ziprecruiter software engineer interview that was basically one big design problem around an in-memory key-value store. They started with the base operations and kept layering on requirements, TTL being the main one. Decent round, more nuanced than I expected.
  • Design an in-memory key-value store where each key maps to a set of field-value pairs. Support operations like set, get, scan (returns all pairs sorted lexicographically by field), and scan_by_prefix.
  • Now add TTL support. Each set operation takes a timestamp and a TTL value. Fields should expire after TTL time units from the timestamp, and reads or scans at time t should ignore any field whose expiration is at or before t. Re-setting a field should replace both its value and expiration.
  • Walk through the trade-offs between lazy expiration (skip expired fields on read) versus active expiration (background sweep that evicts expired entries). How does each approach affect memory usage and latency?

“The base problem felt manageable.”

View Post

ZipRecruiter·Software Engineer·Technical Phone Screen

May 2026
Ziprecruiter software engineer interview that centered on a single meaty design problem. The question had enough moving parts that it was easy to go in circles if you didn't nail down the data model first.
  • Design a restaurant voting system backed by a hash table that supports vote(restaurant), unvote(restaurant), and getMostPopular() in real time. How do you keep track of the top entry efficiently, and how do you handle ties and concurrent updates?

“I started with a plain hashmap of restaurant to count, which is fine for vote and unvote, but getMostPopular is where it gets ugly if you just scan the whole map every call.”

View Post

ZipRecruiter·Software Engineer·Technical Phone Screen

May 2026
Coding round at Ziprecruiter where the whole session was basically one design problem: build an in-memory key-value store that supports nested fields and a handful of operations. More implementation-heavy than algorithmic, which I didn't fully expect.
  • Design and implement an in-memory key-value store class where each key can hold multiple named fields. The class must support set(key, field, value), get(key, field), setAndCompare(key, field, value, threshold), and setAndDelete(key, field, value, condition). Define return values for missing keys and fields, and explain your choice of underlying data structure.

“I went with a dict-of-dicts pretty quickly and they seemed fine with that.”

View Post