Get AmbitionBox App
Faster and better experience!
AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Compare
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
Google Software Developer Interview Questions and Answers
63 Interview questions
Find the Kth largest and Kth smallest elements in an array of integers efficiently.
Sort the array and access the Kth elements directly. Example: For [3, 1, 5, 2], K=2 gives 2nd largest=3, 2nd smallest=2.
Use a min-heap for Kth largest and a max-heap for Kth smallest. This is efficient for large arrays.
Consider edge cases: If K is larger than the array size, return an error or a specific value.
For duplicates, decide...
I have a solid understanding of computer networks, including protocols, architectures, and security measures.
Familiar with OSI and TCP/IP models, understanding how data flows through layers.
Experience with network protocols like HTTP, FTP, and DNS.
Knowledge of network devices such as routers, switches, and firewalls.
Understanding of IP addressing, subnetting, and network segmentation.
Experience with network troubl...
Return the palindrome of a given number
Check if the number is equal to its reverse to determine if it is a palindrome
Convert the number to a string to easily reverse it
Handle negative numbers by converting them to positive before checking for palindrome
Binary search is a fast search algorithm that finds the position of a target value within a sorted array.
Ensure the array is sorted before performing binary search.
Compare the target value with the middle element of the array.
If the target value is less than the middle element, search the left half of the array. If it is greater, search the right half.
Repeat the process until the target value is found or the subar...
What people are saying about Google
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 arra...
Sorting an array of strings without using inbuilt methods
Use a sorting algorithm like bubble sort, selection sort, or insertion sort
Compare each element with the next one and swap if necessary
Repeat the process until the array is sorted
Use a priority queue to find top k nodes with highest value in a tree
Traverse the tree and store nodes in a priority queue based on their values
Pop k nodes from the priority queue to get the top k nodes with highest value
Use two heaps to keep track of the numbers and find median efficiently.
Use a max heap to store the smaller half of the numbers and a min heap to store the larger half.
Keep the size of the two heaps balanced or with a difference of at most 1.
If the total number of elements is odd, the median is the top element of the larger heap. If even, it's the average of the tops of both heaps.
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
C++ and Java have different strengths and weaknesses, it's not accurate to say one is 'bad' compared to the other.
C++ is closer to the hardware and allows for more low-level programming, while Java is more platform-independent and easier to learn.
C++ gives more control over memory management, but this can lead to more bugs if not handled properly.
Java has automatic garbage collection, making memory management easi...
Google Software Developer Interview Experiences
95 interviews found
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
- Q2. What is hashing in data structure
Interview Preparation Tips
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
- Ans.
Binary search is a fast search algorithm that finds the position of a target value within a sorted array.
Ensure the array is sorted before performing binary search.
Compare the target value with the middle element of the array.
If the target value is less than the middle element, search the left half of the array. If it is greater, search the right half.
Repeat the process until the target value is found or the subarray i...
- 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
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 technical skills, problem-solving abilities, and a passion for collaboration that drives successful projects.
Proven experience in full-stack development, having successfully delivered multiple projects using React and Node.js.
Strong problem-solving skills demonstrated by optimizing an existing application, resulting in a 30% performance improvement.
Excellent communication skills, which helped ...
Interview Preparation Tips
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
Sundaran Srïnïvâs
I appeared for an interview in Mar 2025, where I was asked the following questions.
- Q1. What is the explanation of the Least Recently Used (LRU) cache algorithm?
- Ans.
LRU cache algorithm evicts the least recently used items first to optimize memory usage and improve access speed.
Eviction Policy: LRU removes the least recently accessed items when the cache reaches its limit, ensuring frequently used items remain available.
Implementation: Typically implemented using a combination of a hash map for fast access and a doubly linked list to maintain the order of usage.
Example: If a cache ...
- Q2. What is Dijkstra's algorithm and how does it work?
- Ans.
Dijkstra's algorithm finds the shortest path between nodes in a graph, using a priority queue for efficient pathfinding.
Graph Representation: Dijkstra's algorithm works on weighted graphs, where edges have non-negative weights, representing distances or costs.
Initialization: Start with a source node, setting its distance to zero and all other nodes to infinity, indicating they are unreachable initially.
Priority Queue: ...
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 Software Developer Intern Interview Questions
- Google Data Analyst Interview Questions
- Google Softwaretest Engineer Interview Questions
- Show more
Software Developer Interview Questions from Similar Companies
Google Software Developer Reviews and Ratings
based on 141 reviews
Rating in categories
|
Software Engineer
2.1k
salaries
|  ₹33.9 L/yr - ₹80 L/yr |
|
Software Developer
1.6k
salaries
| ₹31.1 L/yr - ₹60 L/yr |
|
Senior Software Engineer
1k
salaries
| ₹21 L/yr - ₹80 L/yr |
|
Data Scientist
310
salaries
| ₹15 L/yr - ₹60 L/yr |
|
Data Analyst
283
salaries
| ₹12.5 L/yr - ₹30 L/yr |
Yahoo
Amazon
Microsoft Corporation
- Home >
- Interviews >
- Google Interview Questions >
- Google Software Developer Interview Questions
