Loading page...
Sponsored
Problems
01 MatrixMedium
5mo ago
Array
Dynamic Programming
Breadth-First Search
Matrix
132 PatternMedium
2mo ago
Array
Binary Search
Stack
Monotonic Stack
Ordered Set
2 Keys KeyboardMedium
4mo ago
Math
Dynamic Programming
24 GameHard
5mo ago
Array
Math
Backtracking
3SumMedium
2mo ago
Array
Two Pointers
Sorting
3Sum ClosestMedium
1mo ago
Array
Two Pointers
Sorting
3Sum SmallerMedium
5mo ago
Array
Two Pointers
Binary Search
Sorting
4 Keys KeyboardMedium
3mo ago
Math
Dynamic Programming
4SumMedium
1mo ago
Array
Two Pointers
Sorting
4Sum IIMedium
5mo ago
Array
Hash Table
3mo ago
Math
Accounts MergeMedium
1mo ago
Array
Hash Table
String
Depth-First Search
Breadth-First Search
Union Find
Sorting
Add BinaryEasy
3mo ago
Math
String
Bit Manipulation
Simulation
Add Bold Tag in StringMedium
5mo ago
Array
Hash Table
String
Trie
String Matching
Add DigitsEasy
3mo ago
Math
Simulation
Number Theory
Add One Row to TreeMedium
5mo ago
Tree
Depth-First Search
Breadth-First Search
Binary Tree
Add StringsEasy
1mo ago
Math
String
Simulation
Add Two IntegersEasy
3mo ago
Math
Add Two NumbersMedium
1mo ago
Linked List
Math
Recursion
Add Two Numbers IIMedium
1mo ago
Linked List
Math
Stack
Sponsored
Add Two PromisesEasy
2mo ago
5mo ago
Array
Two Pointers
String
Simulation
Additive NumberMedium
2mo ago
String
Backtracking
4mo ago
Array
5mo ago
Array
Binary Search
4mo ago
Math
Dynamic Programming
Brainteaser
Probability and Statistics
Alien DictionaryHard
3mo ago
Array
String
Depth-First Search
Breadth-First Search
Graph
Topological Sort
5mo ago
Depth-First Search
Breadth-First Search
Graph
Topological Sort
Array
3mo ago
Hash Table
Tree
Depth-First Search
Breadth-First Search
Binary Tree
2mo ago
Hash Table
Linked List
Design
Doubly-Linked List
5mo ago
Graph
Topological Sort
4mo ago
Backtracking
Depth-First Search
Breadth-First Search
Graph
4mo ago
Database
3mo ago
Dynamic Programming
Tree
Recursion
Memoization
Binary Tree
4mo ago
Alphabet Board PathMedium
4mo ago
Hash Table
String
4mo ago
Array
Sliding Window
Alternating Groups IIMedium
3mo ago
Array
Sliding Window
Ambiguous CoordinatesMedium
5mo ago
String
Backtracking
Enumeration
Sponsored
3mo ago
Array
Segment Tree
Ordered Set
Google Interview Process
The interview process at Google typically follows a standard structure designed to assess your technical skills, problem-solving abilities, and cultural fit. While specific rounds may vary by role and level, here is what you can generally expect:
1. Recruiter Screen
A 30-minute call to discuss your background, interests, and the role. Be prepared to talk about your resume and why you want to join Google.
2. Technical Screen
One or two coding interviews (45-60 mins) focusing on data structures and algorithms. Often conducted via video call with a shared code editor.
3. Onsite Loop
A series of 3-5 interviews covering coding, system design, and behavioral questions. This is the final and most comprehensive stage.
How to Prepare for Google
- Master the Basics:Focus on core data structures (Arrays, Linked Lists, Trees, Graphs) and algorithms (Sorting, Searching, BFS/DFS, Dynamic Programming).
- Practice Problems:Solve the most frequently asked questions for Google listed above. Aim to understand the underlying patterns rather than just memorizing solutions.
- System Design:For senior roles, practice designing scalable systems. Understand concepts like load balancing, caching, database sharding, and API design.