Zip Interview Questions
Curated from verified interview reports: a Coding + OA + Phone Screen + Behavioral slate spanning graph/BFS pathfinding, tree traversal, dynamic programming, and system design (in-memory DB, vending machine).
9 real interview questions reported from Zip Software Engineer interviews (Coding, OA, Behavioral, Phone Screen rounds): 5 medium, 4 hard. Each question shows its interview round and how often it was reported, and coding questions come with runnable tests.
Zip Coding round questions (3)
- Find Root IDs and Paths - Medium, reported 6×, free preview
Identify root blocks in parent-pointer data, then recover a root-to-target path without looping forever on malformed input. - House Robber III - Medium, reported 3×, free preview
Pick a subset of tree nodes with maximum total value, but never take both a parent and its child. - Poker Card Runs and Sets Enumeration - Hard, reported 5×
Enumerate every valid same-suit run and same-rank set from a hand of distinct cards.
Zip OA round questions (1)
- In-Memory Database - Hard, reported 1×
Implement a versioned record store with CRUD, filtered field listing, TTL expiration, and historical look-back reads.
Zip Behavioral round questions (1)
- Project Deep Dive and Behavioral - Medium, reported 4×
Prepare for Zip’s hiring-manager round by rehearsing one detailed project story plus a few concise behavioral examples.
Zip Phone Screen round questions (4)
- BFS Shortest Path with Moving Parade Obstacles - Hard, reported 2×
Compute the fastest arrival time on a grid where fixed walls and slowly advancing parades block cells as time passes. - Furthest Building You Can Reach - Medium, reported 4×
Use ladders on the biggest climbs and bricks on the smallest ones to maximize how far you travel. - Implement Vending Machine - Hard, reported 1×
Implement stock tracking, the customer's running balance, exact-change rules and cancellation for a compact object-oriented vending machine. - Open the Lock - Medium, reported 3×
Treat each 4-digit code as a graph node and BFS for the fewest wheel turns to the target.