Google Software Developer Intern Interview Questions, Process, and Tips

Q1. I dont remember
Add your answer
Q2. Trees based question
Add your answer
Q3. Palindromic subsequence based
Add your answer

Q1. Brief introduction
Add your answer

Two coding questions to be done

Swap two numbers with any of the language

Discuss about your family members

Q1. What is software intern developer
Ans. 
A software intern developer is a student or recent graduate who works on software development projects under the guidance of experienced developers.
• Assists in coding, testing, and debugging software applications

• Learns new programming languages and technologies

• Participates in team meetings and contributes to project discussions
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Q1. 
Minimum Time To Solve The Problems
Given 'N' subjects, each containing a certain number of problems, and 'K' friends, assign subjects to friends such that each subject goes to exactly one friend, maintain...read more
Ans. Brute Force
We want to assign N number of subjects among K friends. So consider this as dividing the array into K partitions, where each partition denotes the subjects assigned to one of the friends. Assume that we already have K-1 partitions i.e. we have already assigned the subjects to K-1 friends, and now we want to do the K th partition. So, this last divider can be put between i th and i+1 th subject for 1<=i<...read more
Answered Anonymously
Add your answer
Q2. 
Sum of Bit Difference Among All Pairs Problem Statement
Given an array of integers, determine the sum of bit differences among all possible pairs that can be formed using the elements of the array.
The b...read more
Ans. Brute Force
• Run two nested loops to get every pair that can be formed using the given array elements.
• For each pair calculate the different bits.
Space Complexity: O(1)Explanation:
O(1)
 
No extra space is required.
Time Complexity: O(n^2)Explanation:
O(N^2), where ‘N’ is the number of elements in the given integer array.
 
We have to run two nested loops to get every pair that can be formed using the given array ele...read more
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Q1. 
Sum of LCM Problem Statement
Given an integer 'N', calculate and print the sum of the least common multiples (LCM) for each integer from 1 to N with N.
The sum is represented as:
LCM(1, N) + LCM(2, N) + ....read more
Ans. Brute force approach
 
Using the mathematical formula, A*B = LCM(A,B) * GCD(A,B) where ‘A’ and ‘B’ are the two integers, and GCD(A,B) denotes the Greatest common divisor of ‘A’ and ‘B’.
For example, suppose 
 
A = 20 and B = 30
Factors of A = {1,2,4,5,10,20}
Factors of B = {1,2,3,5,6,10,15,30}
 
The greatest common factor is 10, hence GCD(20,30) = 10.
 
So LCM(A,B) = A*B / GCD(A,B)
 
All we need to fin...read more
Answered Anonymously
Add your answer
Q2. 
Sudoku Solver
Given a 9x9 Sudoku board, your task is to fill the empty slots and return the completed Sudoku solution.
A Sudoku is a grid composed of nine 3x3 smaller grids. The challenge is to fill in the...read more
Ans. BACKTRACKING
Our approach here will be to check for each empty slot that filling it with which number will not violate any constraint. We will start from the first block and keep on checking for each block using recursion. Consider a function SOLVESUDOKU for this, that accepts as a parameter an ArrayList ARR and  do:
1. Check, if ARR[i][j] = 0 for each 1<=i<=9 and 1<=j<=9:
   1. Iterate for each 1<= VAL <=9 ...read more
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Hard

Q1. 
Problem Statement: Delete Node In A Linked List
Given a singly linked list of integers and a reference to a node, your task is to delete that specific node from the linked list. Each node in the linked li...read more
Ans. Brute-force
Approach:
 
We need to delete the node K from the linked list. The most general way to delete the node K from a singly linked list is to get access to the previous node of K. We can get access to the previous node by traversing from the head of the linked list. Let’s denote this previous node as P. Then, we update the next pointer of P to the next pointer of K. 
Although the reference to node K is giv...read more
Answered Anonymously
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

Timing was around 3 pm.

Q1. 
Maximum Subarray Sum Problem Statement
Given an array ARR consisting of N integers, your goal is to determine the maximum possible sum of a non-empty contiguous subarray within this array.
Example of Sub...read more
Ans. Brute Force
We will iterate through all possible boundaries of the subarrays in the given array with the help of two nested loops. 
 
Then, we will iterate through each subarray with the help of another loop and find the sum of the subarray. We will maintain the maximum subarray sum through our iterations and finally return it.
Space Complexity: O(1)Explanation:
O(1), constant space is used.
Time Complexity: O(n^3...read more
Answered Anonymously
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

This round was to test if Google should spend time in interviewing me or not. I was asked around 8 questions that any coder must know, like time complexities of various algorithms, basic understanding of trees and graphs, some concepts specific to the chosen language etc. Apart from these, there was a question to test my mental arithmetic that can be important for system design interviews.
This round went pretty well for me and I moved to the next Round.

Q1. 
Validate BST Problem Statement
Given a binary tree with N nodes, determine whether the tree is a Binary Search Tree (BST). If it is a BST, return true; otherwise, return false.
A binary search tree (BST)...read more
Ans. Approach 1
• For each node, store the minimum and maximum value allowed for that node.
• Initially, for the root node as all the integer values are allowed, the minimum value would be -10^9 and the maximum value should be 10^9. Here we can also use built-in INT_MIN and INT_MAX constants.
• If the value of that node is not in the bounded range of minimum and maximum value, then return false.
• For the left subtree of a node with da...read more
Answered Anonymously
Add your answer

Round duration - 45 minutes
Round difficulty - Hard

This round was to test my coding aptitude. It was a 45 minutes round and I was asked 2 questions. One of the questions was based on Dynamic Programming and the other question was on Arrays that involved usage of Heaps. I was able to approach both the problems but could code only one due to time constraints. The interviewer was pretty friendly and quite helping. She guided me wherever I went wrong.

Q1. 
Ways To Make Coin Change
Given an infinite supply of coins of varying denominations, determine the total number of ways to make change for a specified value using these coins. If it's not possible to make...read more
Ans. Recursion
 
1. The idea is to use recursion.
2. For a particular coin, we have two options either include it or exclude it.
3. If we include that coin, then calculate the remaining number that we have to generate so recur for that remaining number.
4. If we exclude that coin, then recur for the same amount that we have to make.
5. Our final answer would be the total number of ways either by including or excluding.
6. There will be two edg...read more
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Timing: Between 3-5 pm we could take the test anytime
The test environment was hackerrank. Great user interface and I did not suffer anyt problems.
There was no interviewer as it was coding test. 
There were 2 coding questions asked.

Q1. 
Subset OR Problem Statement
You are given an array/list ARR of N positive integers. Your task is to determine the size of the smallest subset that achieves the maximum possible OR value among all subsets.
...read more
Add your answer
Q2. 
Wildcard Queries Problem Statement
Given a dictionary D with N words, each of a fixed length L and consisting only of lowercase English alphabets, answer Q queries. Each query consists of a word W of the ...read more
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

Timing was late at night ie 9:30 PM for this round.
The environment was nice. It was on Google meet.
The interviewer was very friendly and explained the question well

Q1. 
Rat in a Maze Problem Statement
You need to determine all possible paths for a rat starting at position (0, 0) in a square maze to reach its destination at (N-1, N-1). The maze is represented as an N*N ma...read more
Add your answer
Q2. 
BFS Traversal in a Graph
Given an undirected and disconnected graph G(V, E) where V vertices are numbered from 0 to V-1, and E represents edges, your task is to output the BFS traversal starting from the ...read more
Add your answer