Company sheets › Google
Google interview preparation
Global technology company with some of the most algorithm-heavy interviews. Software engineering roles and internships through campus programs and online applications.
Google hiring process
- Online assessment / phone screen — One or two algorithmic problems with a focus on optimal solutions.
- Onsite-style interviews (3–4) — Hard DSA — graphs, DP, binary search on answer, greedy proofs; complexity analysis is expected.
- Googleyness / behavioural — Collaboration, handling ambiguity and learning from mistakes.
The process changes from year to year — check the official notice for the exact pattern.
Interview topics
Tips
- Practise explaining *why* your solution is correct, not only what it does.
- Focus on Medium–Hard graph and DP problems, and always state time and space complexity.
Google DSA problems (168)
- Power with Modulo — Medium
- Single Number — Easy
- Best Time to Buy and Sell Stock — Easy
- Range Sum Queries — Easy
- Two Sum — Medium
- Maximum Subarray Sum — Medium
- Majority Element — Medium
- Longest Consecutive Sequence — Medium
- Subarray Sum Equals K — Medium
- Merge Intervals — Medium
- Maximum Product Subarray — Medium
- 3Sum Count — Medium
- Spiral Matrix — Medium
- Rotate Matrix 90 Degrees — Medium
- Next Permutation — Medium
- Find the Duplicate Number — Medium
- Majority Element II — Medium
- Count Inversions — Hard
- Trapping Rain Water — Hard
- Reverse Pairs — Hard
- Longest Common Prefix — Easy
- Roman to Integer — Easy
- Isomorphic Strings — Easy
- Remove Outermost Parentheses — Easy
- Integer to Roman — Medium
- Longest Palindromic Substring — Medium
- Sort Characters by Frequency — Medium
- Find All Pattern Occurrences — Medium
- Shortest Palindrome by Adding in Front — Hard
- Squares of a Sorted Array — Easy
- Happy Number — Easy
- Container With Most Water — Medium
- Group Anagrams Count — Medium
- 3Sum Closest — Medium
- Minimum Size Subarray Sum — Medium
- Longest Substring Without Repeating Characters — Medium
- Max Consecutive Ones III — Medium
- Fruit Into Baskets — Medium
- Longest Repeating Character Replacement — Medium
- Permutation in String — Medium
- Maximum Points from Cards — Medium
- Sliding Window Maximum — Hard
- Minimum Window Substring — Hard
- Subarrays with K Different Integers — Hard
- First and Last Occurrence — Easy
- Search Insert Position — Easy
- Search in Rotated Sorted Array — Medium
- Peak of Mountain Array — Medium
- Koko Eating Bananas — Medium
- Minimum in Rotated Sorted Array — Medium
- Single Element in a Sorted Array — Medium
- Nth Root of an Integer — Medium
- Capacity to Ship Packages — Medium
- Minimum Days to Make Bouquets — Medium
- Aggressive Cows — Hard
- Book Allocation — Hard
- Median of Two Sorted Arrays — Hard
- Kth Element of Two Sorted Arrays — Hard
- Generate Parentheses — Medium
- Letter Combinations of a Phone Number — Medium
- Palindrome Partitioning — Medium
- N-Queens Count — Hard
- Sudoku Solver — Hard
- Reverse a Linked List — Easy
- Merge Two Sorted Lists — Easy
- Detect a Cycle in a Linked List — Easy
- Remove Nth Node From End — Medium
- Add Two Numbers as Lists — Medium
- Starting Point of a Loop — Medium
- Intersection of Two Linked Lists — Medium
- Reverse Nodes in K-Group — Hard
- Valid Parentheses — Medium
- Min Stack — Medium
- Daily Temperatures — Medium
- Next Greater Element II — Medium
- Asteroid Collision — Medium
- Remove K Digits — Medium
- Sum of Subarray Minimums — Medium
- The Celebrity Problem — Medium
- Largest Rectangle in Histogram — Hard
- LRU Cache — Hard
- Kth Largest Element in an Array — Easy
- Last Stone Weight — Easy
- K Closest Points to Origin — Medium
- Top K Frequent Elements — Medium
- Merge K Sorted Arrays — Medium
- Hand of Straights — Medium
- Median of a Running Stream — Hard
- Inorder Traversal — Easy
- Level Order Traversal — Easy
- Preorder Traversal — Easy
- Postorder Traversal — Easy
- Balanced Binary Tree — Medium
- Diameter of a Binary Tree — Medium
- Validate Binary Search Tree — Medium
- Lowest Common Ancestor in a BST — Medium
- Vertical Order Traversal — Medium
- Maximum Width of a Binary Tree — Medium
- Root to Leaf Paths — Medium
- Lowest Common Ancestor in a Binary Tree — Medium
- Kth Smallest Element in a BST — Medium
- Construct Tree from Preorder and Inorder — Medium
- Nodes at Distance K — Medium
- Binary Tree Maximum Path Sum — Hard
- Count Words with a Given Prefix — Easy
- Implement a Trie — Medium
- Longest Word with All Prefixes — Medium
- Count Distinct Substrings — Medium
- Maximum XOR of Two Numbers — Medium
- Maximum XOR with a Limit — Hard
- BFS of a Graph — Easy
- DFS of a Graph — Easy
- Flood Fill — Easy
- Number of Connected Components — Medium
- Shortest Path in an Unweighted Graph — Medium
- Number of Islands — Medium
- Dijkstra's Shortest Paths — Medium
- Course Schedule — Medium
- Rotting Oranges — Medium
- Distance of Nearest Zero — Medium
- Surrounded Regions — Medium
- Number of Enclaves — Medium
- Is Graph Bipartite — Medium
- Detect Cycle in a Directed Graph — Medium
- Topological Sort — Medium
- Minimum Spanning Tree — Medium
- Bellman-Ford Shortest Paths — Medium
- Floyd-Warshall All-Pairs Shortest Paths — Medium
- Cheapest Flights Within K Stops — Medium
- Path With Minimum Effort — Medium
- Strongly Connected Components — Hard
- Bridges in a Graph — Hard
- Word Ladder — Hard
- Climbing Stairs — Easy
- Unique Grid Paths — Easy
- Longest Common Subsequence — Medium
- House Robber — Medium
- Coin Change (Minimum Coins) — Medium
- 0/1 Knapsack — Medium
- Longest Increasing Subsequence — Medium
- Minimum Path Sum — Medium
- Longest Palindromic Subsequence — Medium
- House Robber II — Medium
- Unique Paths with Obstacles — Medium
- Maximum Falling Path Sum — Medium
- Minimum Subset Sum Difference — Medium
- Unbounded Knapsack — Medium
- Rod Cutting — Medium
- Stock Trading with Cooldown — Medium
- Maximal Square — Medium
- Number of Longest Increasing Subsequences — Medium
- Edit Distance — Hard
- Matrix Chain Multiplication — Hard
- Distinct Subsequences — Hard
- Wildcard Matching — Hard
- Burst Balloons — Hard
- Palindrome Partitioning II — Hard
- Lemonade Change — Easy
- Jump Game — Medium
- Jump Game II — Medium
- Non-overlapping Intervals — Medium
- Insert Interval — Medium
- Gas Station — Medium
- Valid Parenthesis String — Medium
- Candy — Hard
- Power of Two — Easy
- Single Number II — Medium
- Two Non-Repeating Numbers — Medium