- 1Find a methodSplit into three groups of three; weigh A against B. The heavier side holds the coin; if they balance, it is in C. One weighing narrows it to three coins.
Cambridge Computer Science
Cambridge Computer Science: prove the limit, then meet it
Frontier ACE
The Cambridge CS interview bank
- Cambridge CS interview questions
- 40+
- Cambridge CS interview questions
- of real interview questions covered
- 90%+
- of real interview questions covered
- mock interviews with follow-ups
- 1v1
- mock interviews with follow-ups
- scoring dimensions after each answer
- 5
- scoring dimensions after each answer

Will your College interview you online or in person
| College | Applicants based in the UK | Applicants based outside the UK | |
|---|---|---|---|
| 14 Colleges | Christ's, Downing, Fitzwilliam, Girton, Hughes Hall, Lucy Cavendish, Magdalene, Murray Edwards, Newnham, Queens', St Catharine's, St Edmund's, St John's, Wolfson | Online | Online |
| 1 College | Clare (all courses except Medicine and Music) | Online | Online |
| 1 College | Homerton | Online | Online |
| 1 College | Jesus | Online | Online |
| 4 Colleges | Churchill, Emmanuel, King’s, Selwyn | In person | In person |
| 5 Colleges | Corpus Christi, Peterhouse, Robinson, Sidney Sussex, Trinity Hall | In person | Online |
| 2 Colleges | Pembroke, Trinity | In person | Your choice |
| 1 College | Gonville & Caius | UK and Ireland: your choice | Online |
Copied from the 2027-entry table on Cambridge’s interview page (checked 31 October 2026). Applicants in the Republic of Ireland can choose at Corpus Christi. Four Colleges interview everyone in person, so an overseas applicant to one of them needs to plan a December trip and visa. Your invitation is the final word.
What a CS interview problem feels like: one original example
A method with no bound
Binary habit
What to revise for Cambridge CS
Our recommended revision list, built from the admissions-test syllabus and the kinds of problems interviews use.
Discrete mathematics
Most Computer Science interview problems are discrete maths.
- Counting and combinations
- The pigeonhole principle
- Parity and invariants
- Basic graph theory
Proof
“Is that the minimum?” needs a proof, not examples.
- Induction
- Contradiction
- Lower-bound arguments
Algorithmic ideas
You may describe a procedure and estimate how many steps it takes.
- Binary search and divide and conquer
- Recursion and iteration
- Intuition for complexity
- Sorting
Logic and number systems
Binary, logic gates and truth tables are the base language of computing.
- Binary and base conversion
- Propositional logic and truth tables
- Modular arithmetic
TMUA mathematics
TMUA reasoning questions share their thinking with interview proofs.
- Necessary and sufficient conditions
- Spotting errors in proofs
- Functions and sketching
4 practice questions for this course
Exclusive questions in the style of this interview. Talk each one through out loud first, then open the hints one at a time.
- What it testsWhether you can find the conserved quantity (twice the number of handshakes) and finish with parity.
- 1Step 1Try a small case: three people all shaking hands, each has 2, so zero people are odd.
- What it testsThis tests hash sets and edge cases. The problem is simple, but “first” and “repeated” both need precise definitions, and the test design reveals engineering habits.
- 1Step 1Scan left to right and keep a set of characters seen so far. Return a character when it is already in the set; otherwise add it.
f(n) = 1 when n = 0, otherwise f(n) = n × f(n − 1). Rewrite it without recursion. If n is very large, what breaks first?- What it testsThis tests recursion, the call stack and numeric growth. The interviewer wants to see that recursion depth and integer overflow are two different limits.
- 1Step 1It computes the factorial, f(n) = n!. Use a loop from 1 to n and keep the result in one variable.
- What it testsThis tests modular arithmetic and periodicity. The interviewer wants you to compute a few small powers, spot the cycle, and explain why it must repeat, rather than reaching for a calculator.
- 1Step 1The last digits run 7, 9, 3, 1 and repeat every four powers. Since 2026 leaves remainder 2 on division by 4, the last digit is 9.
The two weeks before your interview
0 of 8 done
Progress is saved in this browser only.
More questions by subject
5 original problems
5 original problems
5 original problems
5 original problems
5 original problems
5 original problems
5 original problems
5 original problems
6 original problems
6 original problems
10 original problems
8 original problems
More interview guides
Cambridge
Oxford
Imperial
drag the windows
Practise this question on Frontier ACE
A timed preview: read the question, think for a few seconds, then answer aloud. Frontier ACE scores the attempt on five dimensions.
Open the sample questionSister site
Practise saying the thinking out loud
Frontier ACE is Frontier Academy’s AI interview practice site for Oxford, Cambridge and Imperial applicants. It runs timed video-style practice and mock interviews, then scores each attempt on five dimensions. Use it to rehearse the conversation, then come back to the subject problems here.
Frontier ACE is a Frontier Academy site. Links open in a new tab and are tagged as referrals.
Official sources
Frequently asked questions
Do I need the CSAT for Cambridge Computer Science?
What if my school does not offer Further Maths?
Can I choose between online and in person?
Does having more interviews mean I am a stronger candidate?
UAT-UK, Pearson, OCR, the University of Cambridge, Imperial College London and other names and logos belong to their respective owners.
Prepare for Cambridge Computer Science interview in four weeks
Work through the original subject questions, then rehearse the conversation with FrontierACE. Both are built by Frontier Academy.