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, Process, and Tips
Top Google Software Developer Interview Questions and Answers
- Q1. Painter's Partition Problem Statement Given an array/list representing boards, where each element denotes the length of a board, and a number ‘K’ of available painters, ...read more
- Q2. Special Numbers Problem Statement Your task is to find the total count of special numbers within a range from 1 to a given integer, 'MAXVAL'. A special number is defined ...read more
- Q3. Chocolate Distribution Problem You are given an array/list CHOCOLATES of size 'N', where each element represents the number of chocolates in a packet. Your task is to di ...read more
Google Software Developer Interview Experiences
88 interviews found
Anonymous
Interview Questionnaire
7 Questions
- Q1. Image data structure: An image(square image) can be stored as a tree: A node is white if the image is white, is black if the image is black, and is mixed if it contains both. White and black nodes are leav...
- Q2. There is a dictionary containing words in sorted order. These words consist of some alien alphabets. Using the dictionary, find out the ordering between the alphabets. For eg, if English was the alien lang...
- Q3. A / b c / / d e f g Print the nodes in the following order: a, b, c, g, f, e, d, h, i, j, k, l ,m, n, o and so on. Which all data structures are used? Can we use just 1?
- Ans.
Multiple data structures are used to print nodes in a specific order. One data structure cannot be used alone.
The given order suggests a depth-first search traversal of a tree-like structure.
A stack can be used to keep track of the nodes to be visited.
A queue can be used to store the children of a node in the order they are visited.
An array can be used to store the nodes in the required order.
A linked list can be used ...
- Q4. Given 2 strings like bangalore and blr, return whether one appears as a subsequence of the other. The above case returns true whereas bangalore and brl returns false
- Q5. Given n pens and n tops, each pen (and each top) having a size different than the other and each pen fitting exactly one top, find the largest pen using minimum number of comparisons. A comparison involves...
- Ans.
Find largest pen using minimum comparisons with tops.
Divide pens into two groups and compare largest pen from each group with largest top.
Repeat the process with the group containing the largest pen until only one pen is left.
The remaining pen is the largest pen.
Total number of comparisons required is 2n-3.
- Q6. Given n dice, each of 'a' sides and a sum b, return the number of ways in which the sum b can be obtained. How can you reduce the time complexity and space complexity?
- Ans.
Given n dice with 'a' sides and sum b, return no. of ways to obtain b. Optimize time and space complexity.
Use dynamic programming to reduce time complexity
Create a 2D array to store the number of ways to obtain each sum for each number of dice
Use rolling arrays to optimize space complexity
Example: n=2, a=6, b=7 -> 6 ways to obtain sum 7
Example: n=3, a=4, b=8 -> 21 ways to obtain sum 8
- Q7. Given 2 machines, each having 64 GB RAM, containing all integers (8 byte), sort the entire 128 GB data. You may assume a small amount of additional RAM. Extend this to sort data stored in 1000 machines
- Ans.
Sort 128 GB data on 2 machines with 64 GB RAM each. Extend to 1000 machines.
Use external sorting algorithm like merge sort or quick sort
Divide data into smaller chunks and sort them individually
Merge sorted chunks using additional RAM
For 1000 machines, use distributed sorting algorithms like MapReduce or Hadoop
Ensure data consistency and fault tolerance in distributed sorting
Interview Preparation Tips
Experience: There was a preliminary test, wherein questions on discrete structures, data structures, algorithms, math (permutation, combinations, probability) and operating systems were asked. There was also a programming question to code (on paper). It took them around 3 weeks to shortlist students selected for interviews.
Round: Technical Interview
Experience: It took them about a month's time to announce results!
College Name: Veermata Jijabai Technological Institute, Mumbai [ VJTI ]
Skills evaluated in this interview
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 at Indian Institute of Technology (IIT), Jodhpur
(2 Questions)
- Q1. What is tree in data structure
- Q2. What is hashing in data structure
Interview Preparation Tips
What people are saying about Google
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
Google interview questions for designations
(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
Get interview-ready with Top Google Interview Questions
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
(2 Questions)
- Q1. C++ is bad that java why?
- Ans.
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 easier fo...
- Q2. Why is google better than facebook?
- Ans.
Google is better than Facebook due to its focus on search and information retrieval.
Google's primary focus is on search and information retrieval, while Facebook is more focused on social networking.
Google's search algorithm is more advanced and accurate compared to Facebook's search functionality.
Google offers a wide range of services beyond social networking, such as Google Maps, Gmail, and Google Drive.
Google has a ...
Aditya Mishra
(1 Question)
- Q1. Palindrome of the number we have to return
- Ans.
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
Interview Preparation Tips
(2 Questions)
- Q1. Tell about ursellf and experiences
- Q2. Coding program and complexity
- Ans.
Coding programs can vary in complexity depending on the requirements and functionalities needed.
Complexity can be measured using Big O notation, which describes the worst-case scenario for time and space complexity.
Factors affecting complexity include data structures used, algorithms implemented, and the size of input data.
Examples of complex programs include machine learning algorithms, large-scale distributed systems
(2 Questions)
- Q1. Dynamic pragramming backtracking coding
- Q2. Experinces and how you perform
- Ans.
I have over 5 years of experience in software development, with a strong focus on web applications and database management.
Developed web applications using HTML, CSS, JavaScript, and various frameworks like Angular and React
Proficient in database management with SQL and NoSQL databases such as MySQL and MongoDB
Experience in version control systems like Git for collaborative development
Strong problem-solving skills and ...
Skills evaluated in this interview
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 Softwaretest Engineer Interview Questions
- Google Data Analyst Interview Questions
- Show more
Interview Questions for Popular Designations
- Senior Software Developer Interview Questions
- Associate Software Developer Interview Questions
- Lead Software Engineer Interview Questions
- Software Development Engineer II Interview Questions
- Software Engineer Interview Questions
- Software Development Engineer 1 Interview Questions
- Software Engineer Level 1 Interview Questions
- Senior Software Engineer Interview Questions
- Show more
Google Software Developer Interview Process
based on 106 interviews
3 Interview rounds
- Coding Test Round - 1
- Coding Test Round - 2
- Coding Test Round - 3
Software Developer Interview Questions from Similar Companies
Fast track your campus placements
Google Software Developer Reviews and Ratings
based on 176 reviews
Rating in categories
|
Software Engineer
1.7k
salaries
|  ₹19 L/yr - ₹77.5 L/yr |
|
Software Developer
1.1k
salaries
| ₹20.1 L/yr - ₹60 L/yr |
|
Senior Software Engineer
666
salaries
| ₹24 L/yr - ₹85.4 L/yr |
|
Data Scientist
274
salaries
| ₹12 L/yr - ₹50 L/yr |
|
Sde1
257
salaries
| ₹14 L/yr - ₹55 L/yr |
Yahoo
Amazon
Microsoft Corporation
- Home >
- Interviews >
- Google Interview Questions >
- Google Software Developer Interview Questions
