AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Google Software Engineer Interview Questions and Answers
42 Interview questions
Minimize the absolute difference between sums of two subsets from a given array of non-negative integers.
Use dynamic programming to solve the problem efficiently.
Calculate the total sum of the array, S. The goal is to find a subset with a sum close to S/2.
Create a boolean DP array where dp[i] indicates if a subset with sum i can be formed.
Iterate through the array and update the DP array for possible sums.
The mini...
Determine if two binary trees are mirrors by comparing their structure and node values recursively.
Two trees are mirrors if their root nodes are the same and their subtrees are mirrors.
Check left subtree of tree1 with right subtree of tree2 and vice versa.
Example: Tree1: 1 / \ 2 3 and Tree2: 1 / \ 3 2 are mirrors.
Base case: If both trees are null, they are mirrors. If one is null, they are not.
The Two Sum problem involves finding two numbers in an array that add up to a specific target sum.
Use a hash map to store numbers and their indices for quick lookup.
Iterate through the array, calculating the complement (target - current number).
Check if the complement exists in the hash map; if yes, return the indices.
Example: For nums = [2, 7, 11, 15] and target = 9, return indices [0, 1] (2 + 7 = 9).
Time complex...
A queue is a linear data structure that follows the First-In-First-Out (FIFO) principle for managing data.
Elements are added at the rear and removed from the front.
Common operations include enqueue (adding) and dequeue (removing).
Used in scenarios like print job management and task scheduling.
Example: A line of customers at a bank where the first customer served is the first to leave.
What people are saying about Google
OOP (Object-Oriented Programming) is a programming paradigm based on objects and classes, promoting code reusability and modularity.
Encapsulation: Bundling data and methods that operate on the data within one unit (e.g., a class).
Inheritance: Mechanism where a new class inherits properties and behavior from an existing class (e.g., a 'Dog' class inheriting from an 'Animal' class).
Polymorphism: Ability to present t...
A stack is a linear data structure that follows the Last In First Out (LIFO) principle for managing data.
Elements are added and removed from the top of the stack.
Common operations include push (add), pop (remove), and peek (view top element).
Example: A stack of plates where you can only add or remove the top plate.
Used in function call management in programming languages.
Can be implemented using arrays or linked l...
Google HR Interview Questions
I bring a unique blend of technical skills, problem-solving abilities, and a passion for innovation that aligns with your team's goals.
Strong technical skills: Proficient in multiple programming languages like Python, Java, and C++.
Problem-solving mindset: Successfully developed a solution that reduced processing time by 30% in a previous project.
Team player: Collaborated with cross-functional teams to deliver a p...
ArrayList uses dynamic arrays, while LinkedList uses doubly linked nodes for storage, affecting performance and use cases.
ArrayList is backed by a dynamic array, allowing fast random access (O(1)). Example: accessing elements by index.
LinkedList consists of nodes that hold data and references to the next and previous nodes, making insertions/removals faster (O(1)) at both ends.
ArrayList has a fixed size, requiring...
== checks reference equality, while .equals() checks value equality in Java objects.
== compares memory addresses (references) of objects.
Example: String a = new String("test"); String b = new String("test"); a == b returns false.
.equals() compares the actual content of objects.
Example: a.equals(b) returns true for the same content.
Use == for primitive types (int, char, etc.) and .equals() for object comparisons.
Im...
Design a news aggregation platform similar to Google News.
Implement a user-friendly interface with customizable news categories.
Utilize machine learning algorithms to personalize news recommendations.
Include features like trending topics, saved articles, and notifications.
Partner with reputable news sources for reliable content.
Optimize for speed and performance to handle large amounts of data.
Ensure data privacy ...
Google Software Engineer Interview Experiences
105 interviews found
Sahana Sahana
Selected
I appeared for an interview in Feb 2025, where I was asked the following questions.
- Q1. Tell. Me. about your. Self
- Q2. Why. should. We. choose. You
- Q3. Hello. I'm..sahana.and.idone.an.mba.With.a.speialization.in.HR.and.makeing.as.well.as.aB.Com.inE.commeres.i'm.done.through.my.inthern.ship.atBestEngineerspump.in.Coimbatore I'm. Passionate about. blending....
- Q4. You. Should. hire. me because. I bring. a. unique. blend. Of. Skills. in. H.R.and.marketing.supported.by.me.academic.background.and.practial.. experience. managing. projects and. understanding. team. dynam...
Interview Preparation Tips
Anonymous
Selected
I appeared for an interview in Jun 2025, where I was asked the following questions.
- Q1. Partition Array Minimizing Subset Sum Difference Given an array containing N non-negative integers, your task is to partition this array into two subsets such that the absolute difference between their sum...
- Ans.
Minimize the absolute difference between sums of two subsets from a given array of non-negative integers.
Use dynamic programming to solve the problem efficiently.
Calculate the total sum of the array, S. The goal is to find a subset with a sum close to S/2.
Create a boolean DP array where dp[i] indicates if a subset with sum i can be formed.
Iterate through the array and update the DP array for possible sums.
The minimum d...
- Q2. Check if Two Trees are Mirror Given two arbitrary binary trees, your task is to determine whether these two trees are mirrors of each other.
- Ans.
Determine if two binary trees are mirrors by comparing their structure and node values recursively.
Two trees are mirrors if their root nodes are the same and their subtrees are mirrors.
Check left subtree of tree1 with right subtree of tree2 and vice versa.
Example: Tree1: 1 / \ 2 3 and Tree2: 1 / \ 3 2 are mirrors.
Base case: If both trees are null, they are mirrors. If one is null, they are not.
Interview Preparation Tips
I applied via Campus Placement and was interviewed in Dec 2024. There were 2 interview rounds.
The coding questions were at Leetcode difficulty level and were derived from the Striver sheet.
(2 Questions)
- Q1. BFS graph level
- Q2. Minimum flight distance . I was not shortlisted for interview.
Interview Preparation Tips
SUSHANT WAYBHASE
Selected
I applied via Campus Placement and was interviewed in Dec 2024. There were 4 interview rounds.
It's good and many more things are pending
Very good it was very good best nice very nice
God food good water and good everything good
(3 Questions)
- Q1. What is name and why this name only
- Ans.
Name is a unique identifier given to an individual to distinguish them from others.
Name is used for identification and communication purposes.
Names are often chosen by parents at birth, but can also be changed legally.
Names can have cultural, religious, or personal significance.
Some names are passed down through generations in families.
Nicknames or aliases may also be used in addition to a person's given name.
- Q2. Why we should select you
- Q3. My parents has given that's why
Interview Preparation Tips
(1 Question)
- Q1. Return triplets where sum is zero
- Ans.
Find unique triplets in an array that sum up to zero.
Sort the array first to easily identify duplicates.
Use two pointers technique to find the triplets.
Skip duplicates to avoid duplicate triplets.
Handle edge cases like all zeros or all positive/negative numbers.
Time complexity can be improved to O(n^2) using two pointers approach.
(1 Question)
- Q1. Rotate the matrix 90 degrees clockwise
- Ans.
Rotate an n x n 2D matrix by 90 degrees clockwise in-place without using extra space.
Iterate through each layer of the matrix, swapping elements in groups of 4
Use variables to store temporary values during swapping
Reverse the rows of the matrix to rotate it 90 degrees clockwise
Skills evaluated in this interview
I appeared for an interview in Dec 2024.
(1 Question)
- Q1. Design Google News
(2 Questions)
- Q1. Graph Question Connected components in an undirected graph
- Q2. Dp question Maximal Product when cutting rope
- Ans.
Maximal Product when cutting rope involves finding the best way to cut a rope to maximize the product of the lengths.
Divide the rope into pieces of length 2 or 3 for maximum product.
For a rope of length 10, cutting it into three pieces of length 3 and one piece of length 1 gives a product of 27.
Using dynamic programming, store results of subproblems to avoid redundant calculations.
The formula for the maximum product ca...
Kavendar Kashyap
(2 Questions)
- Q1. What ia Printf funcation use
- Q2. Printf funcation use
Interview Preparation Tips
Skills evaluated in this interview
(1 Question)
- Q1. Leetcode questions and fundamental questions based on sql, networking
2 leetcode hard questions
Interview Preparation Tips
Selected
I appeared for an interview in Jan 2025, where I was asked the following questions.
- Q1. Explain the difference between ArrayList and LinkedList in Java. When would you choose one over the other?
- Q2. What are the advantages and disadvantages of using Java’s synchronized keyword for thread synchronization? Can you explain how the ReentrantLock compares to synchronized?
- Q3. What is the difference between == and .equals() in Java? When should each be used, and what issues can arise from improper usage?
- Q4. How does the Java garbage collector work? Can you describe the different types of garbage collection algorithms available in Java?
- Q5. What are the main features of Java 8? Can you explain how lambdas and the Stream API have changed the way Java applications are written?
Google Interview FAQs
Some of the top questions asked at the Google Software Engineer interview -
The duration of Google Software Engineer interview process can vary, but typically it takes about less than 2 weeks to complete.
Tell us how to improve this page.
Google Interviews By Designations
- Google Software Engineer Interview Questions
- Google Software Developer Interview Questions
- Google Intern Interview Questions
- Google Senior Software Engineer Interview Questions
- Google Data Analyst Interview Questions
- Google SDE Interview Questions
- Google Software Developer Intern Interview Questions
- Google Softwaretest Engineer Interview Questions
- Show more
Interview Questions for Popular Designations
- Software Developer Interview Questions
- Senior Software Engineer Interview Questions
- Senior Engineer Interview Questions
- System Engineer Interview Questions
- Associate Software Engineer Interview Questions
- Project Engineer Interview Questions
- Lead Engineer Interview Questions
- Software Development Engineer Interview Questions
- Show more
Overall Interview Experience Rating
based on 110 interview experiences
Difficulty level
Duration
Software Engineer Interview Questions from Similar Companies
Google Software Engineer Reviews and Ratings
based on 149 reviews
Rating in categories
Gurgaon / Gurugram,
Bangalore / Bengaluru
Not Disclosed
|
Software Engineer
2.6k
salaries
|  ₹34.8 L/yr - ₹60 L/yr |
|
Software Developer
2.3k
salaries
| ₹33.5 L/yr - ₹61.9 L/yr |
|
Senior Software Engineer
1.2k
salaries
| ₹34.7 L/yr - ₹70 L/yr |
|
Data Analyst
426
salaries
| ₹15.3 L/yr - ₹28 L/yr |
|
Sde1
425
salaries
| ₹32.2 L/yr - ₹60 L/yr |
Yahoo
Amazon
Microsoft Corporation
- Home >
- Interviews >
- Google Interview Questions
