•CODING INTERVIEW QUESTIONS
Google Coding Interview Questions (DSA)
50 DSA problems sourced from real Google interviews
Google Coding Interview Questions
| Problem | Difficulty | Tags |
|---|---|---|
| Easy | ArrayHash Table | |
| Palindrome Number | Easy | Math |
| Hard | ArrayBinary SearchDivide and Conquer | |
| Medium | Hash TableStringSliding Window | |
| Medium | ArrayTwo PointersSorting | |
| Medium | Linked ListMathRecursion | |
| Easy | ArrayDynamic Programming | |
| Roman to Integer | Easy | Hash TableMathString |
| Concatenation of Array | Easy | ArraySimulation |
| Medium | ArrayHash TableUnion-Find | |
| Medium | Two PointersStringDynamic Programming | |
| Merge Sorted Array | Easy | ArrayTwo PointersSorting |
| Remove Duplicates from Sorted Array | Easy | ArrayTwo Pointers |
| Recyclable and Low Fat Products | Easy | Database |
| Medium | ArrayBinary Search | |
| Reverse Integer | Medium | Math |
| Split Array Largest Sum | Hard | ArrayBinary SearchDynamic Programming |
| Valid Palindrome | Easy | Two PointersString |
| Majority Element | Easy | ArrayHash TableDivide and Conquer |
| Valid Anagram | Easy | Hash TableStringSorting |
| Medium | ArrayHash TableString | |
| Longest Common Prefix | Easy | ArrayStringTrie |
| Medium | ArrayHash TablePrefix Sum | |
| N-Queens | Hard | ArrayBacktrackingAlgorithm X |
| Generate Parentheses | Medium | StringDynamic ProgrammingBacktracking |
| Medium | ArrayDynamic ProgrammingBreadth-First Search | |
| Hard | ArrayTwo PointersDynamic Programming | |
| Medium | ArrayTwo PointersGreedy | |
| Search Insert Position | Easy | ArrayBinary Search |
| Letter Combinations of a Phone Number | Medium | Hash TableStringBacktracking |
| Easy | MathDynamic ProgrammingMemoization | |
| Missing Number | Easy | ArrayHash TableMath |
| Employees Earning More Than Their Managers | Easy | Database |
| Easy | StringStackBracket Sequences | |
| Sqrt(x) | Easy | MathBinary SearchNewton's Method |
| 3Sum Closest | Medium | ArrayTwo PointersSorting |
| Combine Two Tables | Easy | Database |
| Contains Duplicate II | Easy | ArrayHash TableSliding Window |
| Rotate Array | Medium | ArrayMathTwo Pointers |
| Binary Tree Inorder Traversal | Easy | StackTreeDepth-First Search |
| Easy | Linked ListRecursion | |
| Contains Duplicate | Easy | ArrayHash TableSorting |
| Medium | ArrayDynamic Programming | |
| Jump Game II | Medium | ArrayDynamic ProgrammingGreedy |
| Happy Number | Easy | Hash TableMathTwo Pointers |
| Medium | ArrayPrefix Sum | |
| Sort an Array | Medium | ArrayDivide and ConquerSorting |
| Two Sum II - Input Array Is Sorted | Medium | ArrayTwo PointersBinary Search |
| Check if Array Is Sorted and Rotated | Easy | Array |
| Plus One | Easy | ArrayMath |
Difficulty Breakdown
Top Data Structures & Patterns
Frequently Asked Questions
What questions does Google ask in coding interviews?
Google coding interviews focus on Algorithm X, Array, Backtracking, Binary Search, and other data structure problems. We compiled 50 questions from real Google interviews. The most common topics are Algorithm X, Array, Backtracking, Binary Search, Binary Tree. Filter by topic to see what comes up most often.
How many Google coding interview questions are there?
InterviewSkool has 50 Google coding interview questions: 26 Easy, 20 Medium, and 4 Hard. Most Google interviews focus on Medium-difficulty problems, so prioritize those in your prep.
How should I prepare for Google coding interviews?
Start with Medium difficulty problems. Group by topic (Array, Tree, DP) to build pattern recognition. Aim to solve 30 to 40 problems before your interview. Then practice under pressure with a mock interview.
Are Google coding interview questions free?
Yes. All 50 Google coding interview questions are free to browse with no sign-up required. You can filter by difficulty and topic tags. Start a mock interview with a free credit to practice under real pressure.
Practice with a Mock Interview
Simulate real Google interview pressure with our AI interviewer.
Start Mock Interview →