Cursor Interview Questions
Reconstructed from 18 verified candidate reports across 6 questions. May 2025 – Sep 2026.
This page is a live view of every Cursor interview question AceOffer has indexed — pulled from real candidate reports, not invented from job descriptions or one founder’s memory. Every question shows how many times it’s been reported and when it was last seen. The catalog gets a refresh pass every month.
Key facts
- •6 distinct Cursor interview questions indexed
- •18 candidate reports across the catalog
- •Most reported: Merkle Tree over a Repository: Hash, Diff and Sync — 10× (last seen September 2026)
- •Reports span May 2025 – Sep 2026
- •Refreshed monthly · last updated September 2026
Browse Cursor interviews by topic
The Cursor loop, from candidate reports
Cursor's process runs one round at a time: each round is scheduled only after you pass the one before, so it can take weeks. The first round is almost always a coding screen of 45 to 60 minutes: build a Merkle tree, which reports also call a hash tree, over a real repository, then diff two trees and use the tree to sync a client and a server. Ten reports describe it, and several candidates say it is hard to finish in time without having written it before. One report allowed Google or AI for syntax but not for the implementation. A second coding screen has been either a notification rate limiter with user, team and company limits, or an in-memory transactional key-value store, on CoderPad, with follow-ups that depend on what you built. Later rounds reported include system design (a job scheduler, or storing and syncing IDE settings), a project deep dive and a hiring-manager conversation; one candidate's phone-screen stage had all four, which they called the longest phone screen they had seen. The final stage is working in Cursor's office alongside the team: two days in earlier reports, one day for some teams in 2026, and candidates say each team sets its own problems. Two reports come from Graphite, the code review startup Cursor acquired: a bug-fixing round on a parser and an internationalisation design.
What does Cursor ask in each interview round?
Cursor interviews span 2 distinct round types, broken down below. Counts reflect distinct questions per round, not number of times asked. Frequencies on individual question cards show how many candidates reported getting that specific question.
Which Cursor interview questions come up most?
These are the Cursorquestions reported most across the loops we’ve indexed, sorted by candidate-report frequency.
| Question | Round | Reported | Last seen |
|---|---|---|---|
| Merkle Tree over a Repository: Hash, Diff and Sync | Phone Screen | 10× | September 2026 |
| Notification Rate Limiter: User, Team and Company Limits | Phone Screen | 2× | July 2026 |
| Design a Distributed Cron / Job Scheduler | System Design | 2× | September 2026 |
| Design an Internationalization (i18n) System | System Design | 2× | April 2026 |
| In-Memory Transactional Key-Value Store | Phone Screen | 1× | March 2026 |
| Design IDE Settings Storage and Team Sync | System Design | 1× | July 2026 |
The full index is below, or browse the Cursor catalog →
Every Cursorinterview question we’ve indexed
All 6, grouped by round and sorted by how often candidates reported them. Each links to the question, its reported follow-up count, and when it was last seen.
Phone Screen (3)
- Merkle Tree over a Repository: Hash, Diff and Sync — reported 10×, last seen September 2026
- Notification Rate Limiter: User, Team and Company Limits — reported 2×, last seen July 2026
- In-Memory Transactional Key-Value Store — reported 1×, last seen March 2026
System Design (3)
- Design a Distributed Cron / Job Scheduler — reported 2×, last seen September 2026
- Design an Internationalization (i18n) System — reported 2×, last seen April 2026
- Design IDE Settings Storage and Team Sync — reported 1×, last seen July 2026
- •Writing a file-system Merkle tree before the interview. Candidates say the screen is hard to finish in 60 minutes otherwise, and one who had written file-system code before finished their part.
- •Settling the interface first. One candidate advises modelling the diff as added, modified and removed from the start and pinning down the class signatures, after their own comparison ran out of time.
- •Keeping new rules out of the core code. In the rate limiter's second part, one candidate added a register_handler so each new rule is its own handler.
- •Clarifying throughout. A candidate who passed the first screen gave one piece of advice for the second: practise and keep clarifying.
- •Not finishing the diff in the Merkle-tree screen, which leaves no time for the follow-ups.
- •Running out of time before an extension: one rate-limiter candidate failed because the design part was not complete.
- •Assuming a complete solution is enough. A candidate who finished the part they were given, with tests and one or two small bugs fixed, was still rejected and believes the bar is a fast, uninterrupted run.
- •Not knowing Python's file-system library. One candidate says anyone who has not used it will not finish the Merkle tree.
Get the full Cursor catalog
Every question. Every candidate-reported follow-up. The mistakes that sink people, and what passers do instead. Monthly refresh.
Know someone interviewing at Cursor?
Send them this guide: 6 questions from 18 candidate reports, with the rounds, the follow-ups and what passers do.