AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Google Software Developer Interview Questions and Answers
106 Interview questions
Different cases used for software testing include functional, performance, security, usability, and compatibility testing.
Functional testing ensures that the software meets the specified requirements
Performance testing checks the software's speed, scalability, and stability under different loads
Security testing identifies vulnerabilities and ensures data protection
Usability testing evaluates the software's user-fr...
I will reallocate resources based on project priorities and team needs.
Prioritize tasks based on project deadlines and importance
Communicate with team members to understand their workload and availability
Adjust resources as needed to ensure project success
Example: If a critical project is falling behind schedule, I may reallocate resources from less urgent projects to meet the deadline
Bridge in Graph Problem Statement
Given an undirected graph with V vertices and E edges, your task is to find all the bridges in this graph. A bridge is an edge that, when removed, increases the number of ...
Find all the bridges in an undirected graph.
Use Tarjan's algorithm to find bridges in the graph.
A bridge is an edge whose removal increases the number of connected components.
Check for bridges by removing each edge and checking the number of connected components.
Return the edges that are bridges in non-decreasing order.
Problem: Ninja's Robot
The Ninja has a robot which navigates an infinite number line starting at position 0 with an initial speed of +1. The robot follows a set of instructions which includes ‘A’ (Accelera...
Determine the minimum length of instruction sequence for a robot to reach a given target on an infinite number line.
Start at position 0 with speed +1, update position and speed based on 'A' and 'R' instructions
For each test case, find the shortest sequence of instructions to reach the target
Consider both positive and negative positions for the robot
Count Ways to Reach the N-th Stair Problem Statement
You are provided with a number of stairs, and initially, you are located at the 0th stair. You need to reach the Nth stair, and you can climb one or two...
Count the number of distinct ways to climb to the Nth stair by climbing one or two steps at a time.
Use dynamic programming to solve the problem efficiently.
The number of ways to reach the Nth stair is the sum of the number of ways to reach the (N-1)th stair and the (N-2)th stair.
Handle base cases where N=0 and N=1 separately.
Apply modulo 10^9+7 to avoid overflow in the final result.
Shopping Spree Problem Statement
Preeti plans to shop for her father's birthday at a store with unlimited quantities of N different items. She has a budget that allows her to buy a maximum of K items. Help...
Calculate the number of ways Preeti can purchase items within budget, considering distinct ways.
Use dynamic programming to calculate the number of ways to purchase items within budget
Consider different scenarios where Preeti buys different quantities of each item
Return the result modulo 10^9 + 7 to handle large answers
Alien Dictionary Problem Statement
You are provided with a sorted dictionary (by lexical order) in an alien language. Your task is to determine the character order of the alien language from this dictionar...
Given a sorted alien dictionary, determine the character order of the alien language.
Create a graph data structure to represent the relationships between characters based on the given dictionary.
Perform a topological sort on the graph to determine the character order of the alien language.
Return the character array obtained from the topological sort as the final output.
Minimum and Maximum Candy Cost Problem
Ram is in Ninjaland, visiting a unique candy store offering 'N' candies each with different costs. The store has a special offer: for every candy you purchase, you ca...
Find minimum and maximum cost to purchase all candies with special offer of free candies.
Iterate through the candy costs array and sort it in ascending order.
For minimum cost, start from the lowest cost candy and take free candies until reaching the next higher cost candy.
For maximum cost, start from the highest cost candy and take free candies until reaching the next lower cost candy.
Connecting Ropes with Minimum Cost
You are given 'N' ropes, each of varying lengths. The task is to connect all ropes into one single rope. The cost of connecting two ropes is the sum of their lengths. You...
Connect ropes with minimum cost by merging two smallest ropes at a time.
Sort the array of rope lengths in ascending order.
Merge the two smallest ropes at a time and update the cost.
Repeat until all ropes are merged into one.
Return the total cost as the minimum cost to connect all ropes.
Swap And Maximize Problem Statement
You are given a circular array consisting of N integers. Your task is to find the maximum sum of the absolute differences between adjacent elements by rearranging the ar...
Find the maximum sum of absolute differences between adjacent elements in a circular array by rearranging the elements.
Sort the array in non-decreasing order.
Alternate between picking the smallest and largest elements to maximize the sum of absolute differences.
Calculate the sum of absolute differences between adjacent elements in the rearranged array.
Google Software Developer Interview Experiences
102 interviews found
Harima Malhotra
I appeared for an interview in Jan 2025, where I was asked the following questions.
- Q1. Related to array
- Q2. Follow up question using graph algorithms
amazing childrens
(5 Questions)
- Q1. Introduce yourself
- Ans.
I am a software developer with 5 years of experience in Java, Python, and SQL.
5 years of experience in Java, Python, and SQL
Worked on developing web applications using Java Spring framework
Proficient in database management with SQL
- Q2. Array question of leetcode
- Q3. Python basic and medium
- Q4. C++ standard template library
- Q5. Dynamic programming questions
Adarsh Kumar
I applied via Campus Placement
(2 Questions)
- Q1. What is tree in data structure
- Ans.
A tree is a hierarchical data structure consisting of nodes, with a root node and child nodes, used to represent relationships.
A tree consists of nodes connected by edges.
The top node is called the root, and nodes without children are leaves.
Trees can be binary (each node has at most two children) or n-ary (nodes can have n children).
Common types include binary trees, binary search trees, and AVL trees.
Example: A famil...
- Q2. What is hashing in data structure
- Ans.
Hashing is a technique used to convert data into a fixed-size value for efficient data retrieval and storage.
Hash functions take input data and produce a hash code, e.g., SHA-256.
Hash tables use key-value pairs for fast data access, e.g., storing user data by user ID.
Collisions occur when different inputs produce the same hash; techniques like chaining or open addressing resolve this.
Hashing is widely used in data stru...
Interview Preparation Tips
Skills evaluated in this interview
Anonymous
Selected
I applied via AmbitionBox and was interviewed in Apr 2024. There were 3 interview rounds.
An aptitude test is an exam used to determine an individual's skill or propensity to succeed in a given activity.
(4 Questions)
- Q1. Why is Java a platform independent language?
- Ans.
Java is platform independent due to its bytecode and JVM implementation.
Java code is compiled into bytecode, which can run on any platform with a Java Virtual Machine (JVM)
JVM acts as an interpreter, translating bytecode into machine code specific to the underlying platform
This allows Java programs to be written once and run anywhere, without the need for recompilation
- Q2. What are Static Binding and Dynamic Binding?
- Ans.
Static binding is resolved at compile time, while dynamic binding is resolved at runtime.
Static binding is also known as early binding, where the method call is resolved at compile time based on the type of the object.
Dynamic binding is also known as late binding, where the method call is resolved at runtime based on the actual type of the object.
Example of static binding: method overloading.
Example of dynamic binding:...
- Q3. Explain Virtual Machine (JVM) architecture.
- Ans.
JVM is a virtual machine that enables a computer to run Java programs.
JVM is platform-independent and converts Java bytecode into machine code.
It consists of class loader, runtime data areas, execution engine, and native method interface.
JVM manages memory, garbage collection, and exception handling.
Examples of JVM implementations include Oracle HotSpot, OpenJ9, and GraalVM.
- Q4. What is the lambda expression in JAVA?
- Ans.
Lambda expression in JAVA is a concise way to represent a method implementation using a functional interface.
Lambda expressions are used to provide a more concise way to implement functional interfaces in JAVA.
They are similar to anonymous classes but with less boilerplate code.
Lambda expressions can be used to pass behavior as an argument to a method.
Syntax: (parameters) -> expression or (parameters) -> { statements; ...
(1 Question)
- Q1. Tell me something about yourself?
- Ans. Thank you for allowing me to introduce myself. My name is Sivaranjani and I am from Salem City in Tamilnadu. I completed my bachelor degree with the CSE branch from Muthayammal Engineering College. First of all, I want to introduce myself with my soft skills. I am optimistic, smart, self-confident, hardworking, and have a positive mindset. My technical skills include proficiency in Java programming language, C program...
Interview Preparation Tips
- Core Java
- Advanced Java
- MySQL
Skills evaluated in this interview
(2 Questions)
- Q1. Binary search on array
- Q2. Multi source bfs on the array
- Ans.
Multi-source BFS on an array of strings involves finding the shortest path from multiple starting points to a target point.
Implement BFS algorithm to traverse the array of strings starting from multiple sources simultaneously.
Maintain a queue of nodes to visit next, and keep track of visited nodes to avoid revisiting.
Update the distance of each node from the sources as you traverse the array.
Example: Given an array of ...
Skills evaluated in this interview
I appeared for an interview in May 2025, where I was asked the following questions.
- Q1. Leetcode hard probem
- Q2. Leet code medium problem
Interview Preparation Tips
Avinash Kumar S S
I applied via Referral and was interviewed in Sep 2024. There was 1 interview round.
(2 Questions)
- Q1. Explain about your project in detail
- Ans.
Developed a web application for online shopping with user authentication and payment gateway integration.
Implemented user authentication using JWT tokens
Integrated Stripe API for payment processing
Designed responsive UI using React and Bootstrap
Utilized Node.js for backend development
- Q2. Asked to solve 2 leetcode hard problems
Ashish Soni
DSA hard of dp and tree and graph, segments
DSA medium questions were asked in the interview
(1 Question)
- Q1. DSA medium to hard
Test was conducted online on HAckerrank platform
(2 Questions)
- Q1. Sliding window , easy leetcode
- Q2. HASHMAP ,find the all buddy
- Ans.
A HashMap is a data structure that stores key-value pairs. To find all buddies in a HashMap, we need to iterate through the entries and compare values.
Iterate through the entries of the HashMap
Compare values to find buddies
Store buddies in an array of strings
Skills evaluated in this interview
Selected
I appeared for an interview in Mar 2025, where I was asked the following questions.
- Q1. Tell. Me. about your self
- Q2. Why. Should we choose you
- Ans.
I bring a unique blend of skills, experience, and passion for software development that aligns perfectly with your team's goals.
Proven experience in developing scalable applications, such as a recent project where I improved performance by 30%.
Strong problem-solving skills demonstrated through successful debugging of complex issues in previous roles.
Excellent teamwork and communication abilities, as shown by my role in...
Interview Preparation Tips
Top trending discussions
Google Interview FAQs
Some of the top questions asked at the Google Software Developer interview -
The duration of Google Software Developer 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 SDE Interview Questions
- Google Data Analyst Interview Questions
- Google Software Developer Intern Interview Questions
- Google Softwaretest Engineer Interview Questions
- Show more
Interview Questions for Popular Designations
- Software Engineer Interview Questions
- Java Developer Interview Questions
- Web Developer Interview Questions
- Senior Software Developer Interview Questions
- Application Developer Interview Questions
- Salesforce Developer Interview Questions
- Software Development Engineer Interview Questions
- Developer Interview Questions
- Show more
Overall Interview Experience Rating
based on 121 interview experiences
Difficulty level
Duration
Software Developer Interview Questions from Similar Companies
Google Software Developer Reviews and Ratings
based on 141 reviews
Rating in categories
|
Software Engineer
3k
salaries
|  ₹33 L/yr - ₹65 L/yr |
|
Software Developer
2.1k
salaries
| ₹33.2 L/yr - ₹61.6 L/yr |
|
Senior Software Engineer
1.2k
salaries
| ₹35.9 L/yr - ₹70 L/yr |
|
Sde1
398
salaries
| ₹32.6 L/yr - ₹60 L/yr |
|
Data Scientist
379
salaries
| ₹26.8 L/yr - ₹50 L/yr |
Yahoo
Amazon
Microsoft Corporation
- Home >
- Interviews >
- Google Interview Questions
