Google — Online Assessment: Pattern, Syllabus & Mock Test
Google — Online Assessment pattern: 2 questions in 90 minutes across 1 section. Sample questions, a preparation guide and a free timed mock.
- Pattern: Google
- Duration: 90 minutes
- Questions: 2
- Timing: Free — move between sections until the paper's clock ends
- Negative marking: None
Two problems, ninety minutes, nothing else. Google's screen has no aptitude section and never has.
- Pure coding
- Partial credit per test case
- One shared clock
Sections
| Section | Questions | Time | Kind | Marks each |
|---|---|---|---|---|
| Coding | 2 | 90 min | Coding | 10 |
Google — Online Assessment syllabus
Coding: Google coding questions 1309 problems
Instructions
Google's university online assessment is two coding problems in ninety minutes, on a shared clock. There is no aptitude round, no reasoning section and no multiple-choice paper.
- Both problems are open at once. Read them both before you start writing.
- Marks are per test case, so a partial solution scores. Never leave an empty editor.
- Expect graph or tree traversal, a rules-based simulation, or heavy string and array work.
Not every applicant receives this assessment. Candidates who come through a recruiter often skip straight to the technical screen.
How to prepare for this pattern
A guide to the Google online assessment pattern for university candidates: two coding problems, one clock, and nothing else.
What the paper looks like
One section: Coding, two problems of medium difficulty in 90 minutes. There is no aptitude round, no reasoning section and no multiple-choice paper. Both problems are open at once on a shared clock, and you can move between them freely and return to either until time runs out. Each problem is worth ten marks and is graded on the test cases your solution passes, so a partial solution scores; nothing is deducted for a wrong answer. The paper is not adaptive. Sources agree on the shape and differ on the details: two problems in 60 to 90 minutes is the dominant report, and some write-ups describe a three-task variant whose third task is code analysis. This mock uses ninety minutes.
How to prepare, section by section
- Coding. Expect graph or tree traversal, a rules-based simulation, or heavy string and array work. For traversal, practise Breadth-First Search, Depth-First Search and Graph problems until building an adjacency list and a visited set takes no thought. For simulations, the Simulation hub trains the careful state-keeping they need. For string and array work, Strings, Arrays, Hash Table, Two Pointers and Sliding Window cover the standard moves. If you want an order to work in, the DSA roadmap sequences these topics stage by stage.
- Language. Use the language you write fastest and most accurately. If it still slows you down, its study plan — Java, C++, Python or JavaScript — covers the collections and string handling that assessment code leans on.
On the day
Read both problems before you write anything, and start with the one you can see a way through. Forty-five minutes a problem is the average, not a rule; with one shared clock you can give the harder one more. Because marks come per test case, a correct brute-force solution that passes the small cases is worth submitting before you look for the efficient one, so never leave an editor empty. Keep the last ten minutes for testing on the examples and on edge cases you make up yourself, such as empty input, a single element or repeated values, rather than for starting a new approach.
This mock is modelled on the published shape of Google's online assessment, whose exact counts are crowd-sourced; CodeKairo is not affiliated with Google.
About this pattern
Shape well documented, exact counts crowd-sourced. Two problems in 60 to 90 minutes is the dominant report; some 2025 write-ups describe a three-task variant whose third task is code analysis. Ninety minutes is used here.
Modelled on the published pattern; not affiliated with Google. Every sitting draws a fresh paper from the aptitude bank and the problem catalogue.