Google Software Developer Intern Interview Questions, Process, and Tips

Round duration - 60 minutes
Round difficulty - Medium

• Q1. Min Steps to one using DP You are given a positive integer 'N’. Your task is to find and return the minimum number of steps that 'N' has to take to ...read more
  View Answers (3)

Round duration - 100 minutes
Round difficulty - Medium

My interview was held from 3 to 3:50 and 4 to 4:50 in the evening . I sat in a silent place of my room with no disturbances in my room. 
The interviewer first asked me to introduce myself then he did the same, he then gave me a problem of sliding window and we discussed to reach on a optimal solution then I wrote the code for it . Then he asked me to ask if I had any questions , I asked some questions regarding their work culture , what do they expect from me and what work will I be given there as an SDE -intern. Second interview was almost the same the problem was of dynamic programming .

• Q1. Maximum In Sliding Windows Of Size K Given an array/list of integers of length ‘N’, there is a sliding window of size ‘K’ which moves from the beginning of the ...read more
  View Answers (3)

Round duration - 50 minutes
Round difficulty - Medium

I have already given the description in the previous round.

• Q1. Remove K Corner Elements Given an array ‘arr’ consisting of ‘N’ integer elements. You have to remove ‘K’ elements from the beginning or end of the array. Return...read more
  View Answers (2)

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 You are given an array/list ‘ARR’ of ‘N’ positive integers’. Your task is to find out the size of the smallest subset with the maximum OR possible. Th...read more
  View Answers (3)
• Q2. Wildcard Queries You are given a dictionary ‘D’ consisting of ‘N’ words. Each word of the dictionary is of fixed size ‘L’ and contains only lowercase English al...read more
  View Answers (3)

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 You are given a starting position for a rat which is stuck in a maze at an initial point (0, 0) (the maze can be thought of as a 2-dimensional pla...read more
  View Answers (1)
• Q2. BFS in Graph You are given an undirected and disconnected graph G(V, E) having V vertices numbered from 0 to V-1 and E edges. Your task is to print its BFS trav...read more
  View Answers (1)

Round duration - 45 minutes
Round difficulty - Easy

Timing : Evening

• Q1. Distance between two nodes of a Tree Given a binary tree and the value of two nodes, find the distance between the given two nodes of the Binary Tree. Distance ...read more
  View Answers (2)
• Q2. Delete Leaf Nodes with Value X You are given a binary tree, in which the data present in the nodes are integers. You are also given an integer X. Your task is t...read more
  View Answers (1)

Round duration - 45 minutes
Round difficulty - Easy

Timing : 10:00 pm

• Q1. Maximum sum path from the leaf to root You are given a binary tree of 'N' nodes. Your task is to find the path from the leaf node to the root node which...read more
  View Answers (2)

Round duration - 45 minutes
Round difficulty - Easy

Timimg : 11:00 pm

• Q1. Ninja and the bulbs Ninja owns an electronic shop. In the shop, Ninja has 'N' bulbs. To sell these bulbs, Ninja has to check if they are of good quality...read more
  View Answers (3)

Round duration - 60 minutes
Round difficulty - Easy

Timing : Evening
Online : No webcam proctoring

• Q1. Count distinct Bitwise OR of all subarrays You are given an array consisting of N positive integers, your task is to count the number of distinct possible value...read more
  View Answers (3)
• Q2. Search In Rotated Sorted Array Aahad and Harshit always have fun by solving problems. Harshit took a sorted array and rotated it clockwise by an unknown amount....read more
  View Answers (2)

Round duration - 45+45= 90 minutes
Round difficulty - Easy

2 rounds of interview of 45 minutes each
Was scheduled late at night: 9 pm(Interviewers were from USA)
Through Google meet and google online code platform
One interviewer per session

• Q1. Count Palindrome Words in A String You are given a string S of words. Your task is to find the number of palindrome words in the given string S. A word is calle...read more
  View Answers (1)
• Q2. House Robber Mr. X is a professional robber planning to rob houses along a street. Each house has a certain amount of money hidden. All houses along this street...read more
  View Answers (1)

Round duration - 60 Minutes
Round difficulty - Medium

The test was held at 3:00 P.M on Hackerearth and we were provided separate Login IDS and Passwords for the same.
There were 2 coding questions .

• Q1. Hotel Rooms You are the manager of a hotel having 10 floors numbered 0-9. Each floor has 26 rooms [A-Z]. You will be given a sequence of strings of the room whe...read more
  View Answers (2)
• Q2. Maximum Time You are given a string that represents time in the format hh:mm. Some of the digits are blank (represented by ‘?’). Fill in ‘?’ such that the time ...read more
  View Answers (1)

Round duration - 45 Minutes
Round difficulty - Medium

This round was held on Google Meet at 10:00 A.M and there were 2 interviewers.
They were friendly and helped whenever we got stuck.

• Q1. Count Ways To Reach The N-th Stairs You have been given a number of stairs. Initially, you are at the 0th stair, and you need to reach the Nth stair. Each time ...read more
  View Answers (4)
• Q2. DBMS Question Make a E-R Diagram for OLA serive . You need to think of the Backend Process.  Like what happens when you book, who is assigning you the driv...read more
  Add Answer