HomeCoursesGoogle Coding Interview Questions

Beginner

10h

Google Coding Interview Questions

Sharpen your skills with coding problems modeled after real Google interviews—focusing on algorithmic depth, performance under constraints, and clear technical thinking.
Join 2.8M developers at
Overview
Content
Reviews
Google’s coding interviews assess more than your ability to write working code—they test how you structure ideas, optimize for scale, and communicate your decisions. Whether you're targeting front-end, back-end, or full-stack roles, these problems reflect Google’s high bar for technical rigor, clarity, and creativity. Each coding problem is framed with constraints and interviewer-style prompts to help you code like a Googler, and think like one too.
Google’s coding interviews assess more than your ability to write working code—they test how you structure ideas, optimize for s...Show More

WHAT YOU'LL LEARN

Structured thinking to break down open-ended algorithmic problems.
Fluent use of data structures like graphs, heaps, and hash maps.
Technical articulation of logic, trade-offs, and design decisions under pressure.
Scalable thinking for writing modular, maintainable, and efficient code.
Structured thinking to break down open-ended algorithmic problems.

Show more

Content

2.

Two Pointers

50 Lessons

Introduction to Two Pointers
Valid Palindrome
Solution: Valid Palindrome
3Sum
Solution: 3Sum
Remove Nth Node from End of List
Solution: Remove Nth Node from End of List
Sort Colors
Solution: Sort Colors
Reverse Words in a String
Solution: Reverse Words in a String
Valid Word Abbreviation
Solution: Valid Word Abbreviation
Strobogrammatic Number
Solution: Strobogrammatic Number
Minimum Number of Moves to Make Palindrome
Solution: Minimum Number of Moves to Make Palindrome
Next Palindrome Using Same Digits
Solution: Next Palindrome Using Same Digits
Lowest Common Ancestor of a Binary Tree III
Solution: Lowest Common Ancestor of a Binary Tree III
Count Pairs Whose Sum is Less than Target
Solution: Count Pairs Whose Sum is Less than Target
Count Subarrays With Fixed Bounds
Solution: Count Subarrays With Fixed Bounds
Get the Maximum Score
Solution: Get the Maximum Score
Find the Lexicographically Largest String From Box II
Solution: Find the Lexicographically Largest String From Box II
Create Maximum Number
Solution: Create Maximum Number
Append Characters to String to Make Subsequence
Solution: Append Characters to String to Make Subsequence
Squares of a Sorted Array
Solution: Squares of a Sorted Array
Reverse String
Solution: Reverse String
Intersection of Two Linked Lists
Solution: Intersection of Two Linked Lists
Remove Element
Solution: Remove Element
String Compression
Solution: String Compression
Partition Labels
Solution: Partition Labels
Next Permutation
Solution: Next Permutation
Rotate Array
Solution: Rotate Array
Valid Palindrome II

3.

Fast and Slow Pointers

21 Lessons

4.

Sliding Window

33 Lessons

5.

Intervals

18 Lessons

6.

In-Place Manipulation of a Linked List

26 Lessons

7.

Heaps

25 Lessons

8.

K-way merge

15 Lessons

9.

Top K Elements

37 Lessons

10.

Modified Binary Search

36 Lessons

11.

Subsets

16 Lessons

12.

Greedy Techniques

41 Lessons

13.

Backtracking

35 Lessons

14.

Dynamic Programming

56 Lessons

15.

Cyclic Sort

12 Lessons

16.

Topological Sort

22 Lessons

17.

Sort and Search

31 Lessons

18.

Matrices

37 Lessons

19.

Stacks

30 Lessons

20.

Graphs

31 Lessons

21.

Tree Depth-First Search

35 Lessons

22.

Tree Breadth-First Search

26 Lessons

23.

Trie

30 Lessons

24.

Hash Maps

44 Lessons

25.

Knowing What to Track

32 Lessons

26.

Union Find

28 Lessons

27.

Custom Data Structures

32 Lessons

28.

Bitwise Manipulation

32 Lessons

29.

Math and Geometry

47 Lessons

30.

Challenge Yourself

40 Lessons

Certificate of Completion
Showcase your accomplishment by sharing your certificate of completion.
Author NameGrokking the Coding InterviewPatterns
Developed by MAANG Engineers
Every Educative lesson is designed by a team of ex-MAANG software engineers and PhD computer science educators, and developed in consultation with developers and data scientists working at Meta, Google, and more. Our mission is to get you hands-on with the necessary skills to stay ahead in a constantly changing industry. No video, no fluff. Just interactive, project-based learning with personalized feedback that adapts to your goals and experience.

Trusted by 2.8 million developers working at companies

Hands-on Learning Powered by AI

See how Educative uses AI to make your learning more immersive than ever before.

AI Prompt

Build prompt engineering skills. Practice implementing AI-informed solutions.

Code Feedback

Evaluate and debug your code with the click of a button. Get real-time feedback on test cases, including time and space complexity of your solutions.

Explain with AI

Select any text within any Educative course, and get an instant explanation — without ever leaving your browser.

AI Code Mentor

AI Code Mentor helps you quickly identify errors in your code, learn from your mistakes, and nudge you in the right direction — just like a 1:1 tutor!

Free Resources

FOR TEAMS

Interested in this course for your business or team?

Unlock this course (and 1,000+ more) for your entire org with DevPath

Frequently Asked Questions

What types of coding questions does Google ask?

Google focuses on algorithms and data structures, emphasizing topics such as arrays, strings, trees, graphs, dynamic programming, and concurrency. Expect problems that require creative problem‑solving and optimizations.

How many rounds of coding interviews are there at Google?

Typically there is one initial online assessment or phone screen followed by 1–2 technical phone interviews and then several on‑site interviews (now often virtual). Each technical round lasts about 45 minutes and features one or two coding problems.

Which programming languages are allowed in a Google coding round?

Google allows you to code in any mainstream language (e.g., Python, Java, C++, Go). You should choose a language you are most fluent in and be prepared to discuss its trade‑offs and complexities.

How important is Big‑O analysis for a Google coding interview?

Extremely important. Interviewers expect you to write efficient code and to analyze time and space complexity. Be ready to justify your approach and, if needed, optimize further

Are library functions permitted during the Google interview?

You may use standard library functions for simple tasks (sorting, searching) but should avoid using high‑level utilities that trivialize the problem. Clarify with your interviewer if you’re unsure.

What is unique about Google interviews?

Google interviews often test your ability to explain thought processes clearly, optimize solutions in real time, and apply algorithms to novel problems.

Does Google ask LeetCode-style questions?

Yes. Many Google coding interview questions are similar to medium and hard LeetCode problems, though Google sometimes modifies them to assess scalability, edge cases, and real-world applicability.