Oxford CS interviews lean on problems you haven't seen before. The interviewer wants to see how you set them up, how you handle being stuck, and whether you can recover from a wrong path.
MockLabsEdu is not affiliated with the University of Oxford.
Drawn from publicly reported interview content and the kind of reasoning that comes up year after year. The interviewer will follow up until your reasoning holds.
Prove that the sum of the first n odd numbers is n².
How would you reverse a singly linked list? Walk me through your thinking.
If P implies Q, and Q is false, what can we say about P?
You have a stream of numbers — how would you find the median efficiently?
I have a 3-litre jug and a 5-litre jug. Can I measure exactly 4 litres?
When does a graph have a closed walk that uses every edge exactly once?
Pick a phase to practise in isolation, or run a full mock end-to-end.
Get started