Google Interview Questions (2026)

121 questions across 10 categories · Updated April 2026

Google interviews are known for their rigor — typically 4–6 rounds covering DSA, system design, and behavioral questions. Google evaluates candidates on their problem-solving approach, code quality, and ability to handle ambiguity. The Googleyness and leadership dimension is assessed throughout, not just in dedicated HR rounds.

Algorithms

Merge Intervals

Evaluate Division (Union-Find)

Serialize and Deserialize Binary Tree

Implement Trie (Prefix Tree)

Two Sum

Minimum Genetic Mutation

Design HashMap

Flatten Binary Tree to Linked List

Max Points on a Line

Generate Parentheses

Maximum Profit in Job Scheduling

Boyer-Moore Majority Vote Algorithm

Sliding Window Maximum

Sum of Two Integers

Add and Search Word - Data structure design

Maximum XOR of Two Numbers in an Array

Behavioral

Defining Your Own Success Metrics

Why You Are Leaving Your Current Role

How do you apply for digital marketing jobs at Google?

Most Challenging Technical Problem

What is the most important thing to consider when preparing for an interview?

Ethical Dilemma at Work

Leading a Technical Discussion

Handling Project Cancellation

Finding a Technical Champion

Leadership without authority

Influencing Product Vision

How would you evaluate your skills and performance against your job role?

Why should we hire you?

How do I get a job at Google?

Can you describe your role and challenges in previous projects?

Biggest Technical Risk Taken

Leading an Incident Response Team

Handling Team Disengagement

Managing Team Technical Vision

Commitment to Diversity and Inclusion

Impact of User Feedback

What are your greatest strengths?

Coding

What is Object-Oriented Programming in Java and why is it important?

Can you explain how to find the largest word by deleting characters?

What is the method to find the largest word in a dictionary by deletion?

What is the best way to generate binary strings from a pattern?

What is the strategy to generate all binary strings from a given pattern?

What is the strategy to find the largest word by deleting characters?

Can you generate all binary strings from a given pattern?

Data Structures

Design a Max Heap

Kth Largest Element in an Array (Quickselect/Heap)

Path Sum (Binary Tree)

Binary Tree Zigzag Level Order Traversal

Maximum Depth of Binary Tree

Trie (Prefix Tree) Implementation

Design a Least Frequently Used (LFU) Cache

Design a Set with $O(1)$ `insert`, `remove`, and `getRandom`

Design a Simple LRU Cache using Python/Java built-ins

Balanced Parentheses (Generative)

Flatten a Multilevel Doubly Linked List

Design a Time Map (TreeMap/Sorted Map)

Convert BST to Greater Tree

Find the Middle of a Linked List (No length)

Shortest Unsorted Continuous Subarray (Array/Pointers)

Reverse a Linked List

Find the Root of N-ary Tree (Graph Traversal)

Delete Node in a Linked List (O(1) trick)

Path Sum III (Path in Tree)

Remove Invalid Parentheses (BFS)

Implement an LRU Cache

DSA

How do you count ongoing events for multiple query times?

How do you find a subarray with a specific sum efficiently?

How do you count ongoing events for specific query times?

How do you determine ongoing events for specific query times?

How do you count strings formed under specific character constraints?

How do you find all triplets with zero sum in an array?

How do you find a subarray with a specific sum in non-negative numbers?

How can you count strings formed under specific character constraints?

How do you find a subarray with a given sum in non-negative numbers?