Real exams. Every combination.
Your final could look like anything.
We have all of them.
We took real CS exams from real courses—MIT, Stanford, CMU, Berkeley—and broke them into pieces. So you can practice the same ideas in endless combinations.
csp_hex-dec-binModular
Each highlighted value is generated — click to see another version
- What is 256 in hexadecimal?
- What is 0x4f in decimal?
- A value is 101110100110 in binary. What is it in hexadecimal?
- What is (0x1e4 << 4) in hexadecimal?
Same problem type, new numbers every time
Built from real exams at
MIT·Stanford·CMU·Berkeley·Princeton·Cornell
One problem, many angles
See how a real question works
Each problem is more than multiple choice. Trace memory, step through code, get a nudge with hints—then check the solution when you're ready.
CS106B-2018-Q3
RecursionMedium
Recursive Backtracking: Domino Chains
Write a function canChain(dominoes) that returns true if the given list of dominoes can be formed into a single valid chain.
bool canChain(Vector<Domino>& dominoes) {
}
}
How it works
Built for the way you actually study
- Real exams, preserved
- Problems are transcribed from actual course PDFs—same wording, same difficulty. No synthetic filler.
- Modular by design
- We broke long exams into atomic, taggable questions. Build a quiz that's only pointers, only Big-O, or a full mix.
- Spaced repetition
- Revisit concepts when you're about to forget. We'll surface the right problems at the right time.
- See where you stand
- Track performance by topic so you know exactly what to drill before the real thing.
0+Modular problemsEach with procedurally generated variants
0Top universitiesReal exams from real course archives
∞Unique combinationsNo two practice sessions are the same
You've seen the idea.
Now run the exam.
Build a custom practice exam in under a minute. No credit card, no commitment—just pick your topics and go.