JobHuntDaily
G

Google India Placement Papers

2025 & 2026 — Questions, Answers & Tips

Hard Difficulty10 Questions300 minutes4 Sections

Year-wise Papers

Google 2026 Paper →Google 2025 Paper →

About the Google Placement Test

Google 2026 campus hiring includes a new AI/ML-specific track for SWE roles. The 4-round onsite format remains, but one round now focuses on ML system design for ML engineer roles. Google has emphasized hiring for Gemini and Google Cloud products in India.

Section-wise Breakdown

Online Coding Assessment

3 Questions
AlgorithmsData StructuresDynamic ProgrammingGraph Theory

Technical Phone Screen

2 Questions
CodingProblem Decomposition

Onsite — Coding

4 Questions
Advanced AlgorithmsSystem DesignOptimization

Onsite — Behavioral (Googliness)

1 Questions
TeamworkInnovationLeadershipAmbiguity Handling

Sample Questions

Online Coding Assessment

Q1. What is the output of this Python code? arr = [1, 2, 3, 4, 5] print(arr[-2])

A. 3
B. 4
C. 2
D. 5

Explanation:

arr[-2] accesses the second element from the end. In [1,2,3,4,5], that is index 3 which has value 4.

Q2. What does this code return? def f(n): return n if n <= 1 else f(n-1) + f(n-2) f(5)

A. 5
B. 8
C. 13
D. 3

Explanation:

This is a Fibonacci function. f(0)=0,f(1)=1,f(2)=1,f(3)=2,f(4)=3,f(5)=5.

Q3. What is the space complexity of an algorithm that uses a single variable regardless of input size?

A. O(n)
B. O(log n)
C. O(1)
D. O(n²)

Explanation:

O(1) or constant space complexity means memory usage does not grow with input size. A single variable takes constant space.

Q4. Which sorting algorithm has the best average-case time complexity?

A. Bubble Sort
B. Insertion Sort
C. Merge Sort
D. Selection Sort

Explanation:

Merge Sort has O(n log n) average and worst case. Bubble, Insertion, and Selection sort are O(n²) on average.

Q5. What is printed? for i in range(1, 6): if i == 3: continue print(i, end=' ')

A. 1 2 3 4 5
B. 1 2 4 5
C. 1 2
D. 1 2 3 5

Explanation:

The continue statement skips the rest of the loop body when i==3. So 3 is not printed. Output: 1 2 4 5.

Technical Phone Screen

Q1. What is the output of: int x = 5; printf('%d', x++);

A. 5
B. 6
C. 4
D. Compiler error

Explanation:

Post-increment: x++ returns current value (5) then increments. So printf prints 5, and x becomes 6 after the statement.

Q2. Which SQL clause is used to filter groups after GROUP BY?

A. WHERE
B. HAVING
C. FILTER
D. CONDITION

Explanation:

WHERE filters individual rows before grouping. HAVING filters groups after GROUP BY. Example: GROUP BY dept HAVING COUNT(*) > 5.

Q3. What data structure is used for BFS (Breadth First Search)?

A. Stack
B. Queue
C. Tree
D. Heap

Explanation:

BFS uses a Queue (FIFO) to explore nodes level by level. DFS uses a Stack (LIFO) or recursion to explore depth-first.

Q4. What is the time complexity of binary search?

A. O(n)
B. O(n²)
C. O(log n)
D. O(n log n)

Explanation:

Binary search halves the search space at each step. With n elements, it takes at most log₂(n) comparisons. Time complexity = O(log n).

Q5. In OOPS, what is method overloading?

A. Defining same method in child class
B. Multiple methods with same name but different parameters
C. Using a method from parent class
D. Making a method private

Explanation:

Method overloading (compile-time polymorphism) allows multiple methods with the same name but different parameter types or count. Example: add(int,int) and add(double,double).

Onsite — Coding

Q1. What is the output of this Python code? arr = [1, 2, 3, 4, 5] print(arr[-2])

A. 3
B. 4
C. 2
D. 5

Explanation:

arr[-2] accesses the second element from the end. In [1,2,3,4,5], that is index 3 which has value 4.

Q2. What does this code return? def f(n): return n if n <= 1 else f(n-1) + f(n-2) f(5)

A. 5
B. 8
C. 13
D. 3

Explanation:

This is a Fibonacci function. f(0)=0,f(1)=1,f(2)=1,f(3)=2,f(4)=3,f(5)=5.

Q3. What is the space complexity of an algorithm that uses a single variable regardless of input size?

A. O(n)
B. O(log n)
C. O(1)
D. O(n²)

Explanation:

O(1) or constant space complexity means memory usage does not grow with input size. A single variable takes constant space.

Q4. Which sorting algorithm has the best average-case time complexity?

A. Bubble Sort
B. Insertion Sort
C. Merge Sort
D. Selection Sort

Explanation:

Merge Sort has O(n log n) average and worst case. Bubble, Insertion, and Selection sort are O(n²) on average.

Q5. What is printed? for i in range(1, 6): if i == 3: continue print(i, end=' ')

A. 1 2 3 4 5
B. 1 2 4 5
C. 1 2
D. 1 2 3 5

Explanation:

The continue statement skips the rest of the loop body when i==3. So 3 is not printed. Output: 1 2 4 5.

How to Crack Google Placement Test

  • 1.ML engineer track: know transformer architecture basics and fine-tuning concepts
  • 2.Googliness round 2026: focus on user impact and inclusive design in answers
  • 3.Competitive programming background (ICPC, Codeforces) significantly helps
  • 4.Graph algorithms: Dijkstra, BFS/DFS, topological sort are high-frequency
  • 5.Phone screen: interviewers look for clean, modular code with good naming

Other Company Papers

T

TCS

Medium

I

Infosys

Medium

W

Wipro

Easy

C

Cognizant

Medium

Cleared the Test? Get Matched to Google Job Alerts

JobHuntDaily notifies you the moment Google and similar companies open fresher applications — before it goes viral on LinkedIn.

Get Job Alerts — Start for ₹2