Skip to content
Placement Papers - Free Placement Papers for Top CompaniesPlacement Papers - Free Placement Papers for Top CompaniesPlacement Papers

Google Placement Papers 2025

Overview

This page is a working set of Google placement papers from 2025: from student reports questions, the 2025 online assessment pattern, and step-by-step solutions. Use it to see what Google actually asked in the latest cycle, how hard the rounds were, and which themes (DSA, system design, aptitude, or role-specific topics) mattered most. Practice the problems below under timed conditions, then cross-check with the interview and preparation guides if you are targeting an upcoming Google drive.

Google Online Assessment 2025 exam pattern

Section Questions Time Difficulty Focus Areas
Coding Problem 1 1 30 min Medium Arrays, strings, two pointers
Coding Problem 2 1 30 min Hard Trees, graphs, dynamic programming
CS Fundamentals MCQs 18-20 30 min Medium DSA, time complexity, system design, AI/ML basics

Total: 20-22 questions, 90 minutes

Key Changes in 2025:

  • AI/ML basics added to MCQs
  • Product impact understanding emphasized
  • Extended behavioral round for cultural fit
  • Faster interview-to-offer timeline (6-8 weeks)

Google Placement Papers 2025 - actual questions & solutions

This section contains practice questions styled on Google placement papers 2025 (recent-cycle pattern), with worked solutions. Use them as timed sectional drills - from student reports drives vary by college and role, so treat this as a high-signal practice bank, not an official paper dump.

Question 1: detect cycle in linked list

Show solution

Problem Statement: Return true if the linked list has a cycle.

Example:

Input: 3→2→0→-4→(back to 2)
Output: true

Solution (Java):

public boolean hasCycle(ListNode head) {
    ListNode slow = head, fast = head;
    while (fast != null && fast.next != null) {
        slow = slow.next;
        fast = fast.next.next;
        if (slow == fast) return true;
    }
    return false;
}

Time Complexity: O(n)
Space Complexity: O(1)

Question 2: climbing stairs

Show solution

Problem Statement: You can climb 1 or 2 steps. How many distinct ways to climb n stairs?

Example:

Input: n = 4
Output: 5

Solution (Java):

public int climbStairs(int n) {
    if (n <= 2) return n;
    int a = 1, b = 2;
    for (int i = 3; i <= n; i++) {
        int c = a + b; a = b; b = c;
    }
    return b;
}

Time Complexity: O(n)
Space Complexity: O(1)

Question 3: binary tree level order

Show solution

Problem Statement: Return the level-order traversal of a binary tree.

Example:

Input: [3,9,20,null,null,15,7]
Output: [[3],[9,20],[15,7]]

Solution (Java):

public List<List<Integer>> levelOrder(TreeNode root) {
    List<List<Integer>> res = new ArrayList<>();
    if (root == null) return res;
    Queue<TreeNode> q = new ArrayDeque<>();
    q.add(root);
    while (!q.isEmpty()) {
        int sz = q.size();
        List<Integer> level = new ArrayList<>();
        for (int i = 0; i < sz; i++) {
            TreeNode n = q.poll();
            level.add(n.val);
            if (n.left != null) q.add(n.left);
            if (n.right != null) q.add(n.right);
        }
        res.add(level);
    }
    return res;
}

Time Complexity: O(n)
Space Complexity: O(n)

Question 4: rotate array right by k

Show solution

Problem Statement: Rotate the array to the right by k steps.

Example:

Input: [1,2,3,4,5,6,7], k = 3
Output: [5,6,7,1,2,3,4]

Solution (Java):

public void rotate(int[] nums, int k) {
    k %= nums.length;
    reverse(nums, 0, nums.length - 1);
    reverse(nums, 0, k - 1);
    reverse(nums, k, nums.length - 1);
}
void reverse(int[] a, int l, int r) {
    while (l < r) { int t = a[l]; a[l++] = a[r]; a[r--] = t; }
}

Time Complexity: O(n)
Space Complexity: O(1)

Question 5: first non-repeating character

Show solution

Problem Statement: Return the first non-repeating character in a string, or ‘_’ if none.

Example:

Input: "swiss"
Output: 'w'

Solution (Java):

public char firstUnique(String s) {
    int[] freq = new int[256];
    for (char c : s.toCharArray()) freq[c]++;
    for (char c : s.toCharArray()) if (freq[c] == 1) return c;
    return '_';
}

Time Complexity: O(n)
Space Complexity: O(1)

Question 6: valid parentheses

Show solution

Problem Statement: Given a string of brackets, determine if it is valid.

Example:

Input: "()[]{}"
Output: true

Solution (Java):

public boolean isValid(String s) {
    Deque<Character> st = new ArrayDeque<>();
    Map<Character, Character> pair = Map.of(')', '(', ']', '[', '}', '{');
    for (char c : s.toCharArray()) {
        if (pair.containsValue(c)) st.push(c);
        else if (st.isEmpty() || st.pop() != pair.get(c)) return false;
    }
    return st.isEmpty();
}

Time Complexity: O(n)
Space Complexity: O(n)

Question 7: reverse a string

Show solution

Problem Statement: Given a string, return it reversed.

Example:

Input: "placement"
Output: "tnemecalp"

Solution (Java):

public String reverse(String s) {
    return new StringBuilder(s).reverse().toString();
}

Time Complexity: O(n)
Space Complexity: O(n)

Question 8

Q8: Which SQL clause filters grouped rows after GROUP BY?

Solution:

HAVING filters aggregates; WHERE filters rows before grouping.

Answer: HAVING

Question 9

Q9: Time complexity of binary search on a sorted array of n elements is?

Solution:

Each step halves the search space → O(log n).

Answer: O(log n)

Question 10

Q10: Which data structure uses FIFO order?

Solution:

FIFO = First In First Out → Queue. Stack is LIFO.

Answer: Queue

Question 11

Q11: Which protocol is connection-oriented at the transport layer?

Solution:

TCP is connection-oriented; UDP is connectionless.

Answer: TCP

Hiring volume

  • Total Hires: 600+ freshers expected across India
  • Software Engineer L3: 540+ selections
  • Product Manager: 35+ selections
  • Data Scientist: 25+ selections
  • Growth: 20% increase from 2024

Salary packages

  • Software Engineer L3: ₹32-48 LPA
  • Product Manager: ₹35-60 LPA
  • Data Scientist: ₹40-80 LPA
  • 10% increase from 2024 packages

New initiatives

  • AI/ML knowledge emphasis
  • Product thinking assessment
  • Extended behavioral rounds
  • Remote-first opportunities

Coding Problems:

  • Dynamic programming remains dominant (35%)
  • System design implementation (30%)
  • Graph algorithms (25%)
  • Array/string manipulation (10%)

New Focus Areas:

  • AI/ML basics in MCQs
  • Product impact questions
  • Scalability thinking

Key insights from 2025 Google Online Assessment

  1. Coding Section is Critical: Must solve both problems correctly with optimal solutions to advance
  2. AI/ML Knowledge: Basic ML concepts now tested in online assessment MCQs
  3. Product Thinking: Technical roles require product impact understanding
  4. Faster Process: Reduced time-to-hire (6-8 weeks) to compete with other tech giants
  5. Remote Opportunities: More positions available for remote work
  6. Googleyness: Behavioral round emphasizes collaboration, innovation, and problem-solving approach
  7. Difficulty Level: Google interviews rated 3.4-3.5/5 difficulty - most challenging among FAANG
  8. Extended Behavioral: More focus on cultural fit and product impact in 2025

Google 2025 interview experiences

Based on recent candidate experiences from 2025 Google interviews:

2025 Interview Process:

  1. Online Assessment (90 minutes): 2 coding problems + 18-20 CS fundamentals MCQs (including AI/ML basics)
  2. Technical Phone Screen (45-60 minutes): Coding problems, algorithm discussions
  3. Onsite Interviews (4-5 rounds, 45 minutes each):
  • Coding rounds (2-3): Algorithms, data structures, problem-solving
  • System Design round: For experienced candidates
  • Behavioral round: Extended focus on “Googleyness” and product impact

2025 Interview Trends:

  • Increased emphasis on AI/ML knowledge even for general SWE roles
  • More product thinking questions in technical rounds
  • Extended behavioral round for better cultural fit assessment
  • Faster interview-to-offer timeline (6-8 weeks vs 8-12 weeks previously)

Common 2025 Interview Topics:

  • Coding: Graph algorithms, dynamic programming, string manipulation, tree problems
  • System Design: URL shortener, distributed systems, scalability, AI/ML systems
  • Behavioral: Collaboration examples, innovation stories, product impact
  • Product Thinking: Design products, identify competitors, improve existing products
  • AI/ML Basics: Fundamental ML concepts, neural networks basics, data preprocessing

2025 Interview Questions Examples:

  • “Design a URL Shortener” (System Design)
  • “Serialize and Deserialize Binary Tree” (Coding)
  • “Choose a product you like and explain how you would identify its competitors” (Product)
  • “Design a voice assistant product for kids” (Product Design)

Success Tips:

  • Strong coding performance is essential - solve problems optimally with clean code
  • Practice explaining your thought process clearly
  • Prepare examples demonstrating collaboration, innovation, and product impact
  • Focus on “Googleyness” - show how you think about problems and user impact
  • Learn AI/ML basics even for general SWE roles
  • Be ready for extended behavioral questions about product thinking

Difficulty Rating: 3.4-3.5/5 (Most challenging among FAANG)

For detailed interview experiences from 2025, visit Google Interview Experience page.

Preparation tips for Google 2025 pattern

  1. Master Coding Fundamentals: Focus on solving 2 coding problems optimally - graph algorithms, DP, string manipulation
  2. AI/ML Basics: Learn fundamental ML concepts and algorithms - now tested in MCQs
  3. Product Thinking: Understand how technical decisions impact users and products
  4. System Design: Practice designing scalable systems with AI/ML components
  5. Practice Previous Year Papers: Solve Google OA papers from 2020-2025 to understand patterns
  6. Time Management: Practice completing 2 coding problems in 60 minutes, 18-20 MCQs in 30 minutes
  7. LeetCode Practice: Solve 200+ LeetCode problems focusing on Google tag (medium-hard difficulty)
  8. Googleyness Preparation: Prepare STAR stories demonstrating collaboration, innovation, and product impact
  9. Behavioral Prep: Prepare extended examples for behavioral round focusing on cultural fit
  10. Mock Tests: Take timed practice tests to improve speed and accuracy

Download 2025 Placement Papers

Google 2025 paper 1

Latest 2025 online assessment with coding problems and MCQs

Google 2025 paper 2

Additional 2025 questions with detailed solutions

2025 coding examples

Collection of 2025 coding problems with solutions

Comments & Suggestions

Similar companies

Amazon · Microsoft · Meta · Apple · Netflix · LinkedIn