Google Software Developer Intern Interview Questions, Process, and Tips

• Q1. Brief introduction
  Add 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
  View Answers (1)

Array string questions

• Q1. Graphs circles and radius question
  Add Answer
• Q2. Array some operations on array
  Add Answer

Round duration - 60 minutes
Round difficulty - Easy

• Q1. Minimum Time To Solve The Problems There are 'N' number of subjects and the ith subject contains subject[i] number of problems. Each problem takes 1 uni...read more
  View Answers (4)
• Q2. Sum of Bit Difference Among all Pairs Given an array of size ‘N’ containing integer elements and let the elements of the given array be 'ARR1', 'ARR...read more
  View Answers (2)

Round duration - 60 minutes
Round difficulty - Medium

• Q1. Sum of LCM You are given an integer ‘N’ , calculate and print the sum of : LCM(1,N) + LCM(2,N) + .. + LCM(N,N) where LCM(i,n) denotes the Least Common Multiple ...read more
  View Answers (2)
• Q2. Sudoku You are given a 9x9 sudoku. Your task is to solve sudoku and return the solution. A sudoku is a puzzle in which players insert the numbers one to nine in...read more
  View Answers (1)

Round duration - 60 minutes
Round difficulty - Hard

• Q1. Delete Node In A Linked List You are given a Singly Linked List of integers and a reference to the node to be deleted. Every node of the Linked List has a uniqu...read more
  View Answers (1)
• Q2. Aptitude Question Alok has three daughters. His friend Shyam wants to know the ages of his daughters. Alok gives him first hint. 1) The product of their ages is...read more
  Add Answer

Round duration - 60 Minutes
Round difficulty - Easy

Timing was around 3 pm.

• Q1. Maximum Subarray Sum You are given an array/list ARR consisting of N integers. Your task is to find the maximum possible sum of a non-empty subarray(contagious)...read more
  View Answers (3)
• Q2. Technical Questions 1) What are the different types of scaling? 2) Few SQL Queries  1) Getting top salary for a department 2) Queries based on Joins 3) Vir...read more
  Add 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 Given a binary tree with N number of nodes, check if that input tree is BST (Binary Search Tree) or not. If yes, return true, return false otherwis...read more
  View Answers (2)

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 You are given an infinite supply of coins of each of denominations D = {D0, D1, D2, D3, ...... Dn-1}. You need to figure out the total ...read more
  View Answers (4)
• Q2. Puzzle There are 5 lanes on a race track. One needs to find out the 3 fastest horses among total of 25. Find out the minimum number of races to be conducted in ...read more
  Add Answer