Google Web Developer Interview Questions and Answers

Round duration - 60 minutes
Round difficulty - Medium

Q1. 
Find All Anagrams Problem Statement
Given a string STR and a non-empty string PTR, identify all the starting indices of anagrams of PTR within STR.
Explanation:
An anagram of a string is another string ...read more
Ans. 
Given a string STR and a non-empty string PTR, find all starting indices of anagrams of PTR within STR.
• Create a frequency map of characters in PTR.

• Use sliding window technique to check anagrams in STR.

• Return the starting indices of anagrams found.
Answered by AI
Add your answer
Q2. 
Subset Sum Problem Statement
Given an array of integers, find the sum of all subsets in non-decreasing order of the given array.
Example:
Input:
N = 3, array = [1, 2]
Output:
[0, 1, 2, 3]
Explanatio...read more
Ans. 
Find sum of all subsets in non-decreasing order of given array.
• Use recursion to generate all subsets of the array

• Calculate sum of each subset and store in a list

• Sort the list in non-decreasing order to get the final result
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

First he asked me to tell about myself, then he asked me some OOPS Concepts,difference in shallow copy and deep copy,
asked me to write a code for boundary traversal of binary tree.

Q1. 
Boundary Traversal of Binary Tree Problem Statement
Given a binary tree consisting of integers, your task is to provide the boundary nodes of this tree in an anti-clockwise direction, starting with the ro...read more
Ans. 
Boundary traversal of a binary tree to find left boundary, right boundary, and leaf nodes in an anti-clockwise direction.
• Perform a pre-order traversal to get the left boundary nodes

• Perform an in-order traversal to get the leaf nodes

• Perform a post-order traversal to get the right boundary nodes

• Combine the results to get the boundary nodes in anti-clockwise direction
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

The second tech interview lasted for about an hour and half. First he asked me to tell about myself. Then he asked me how my first interview was. He then asked me where should I start, data structures, databases, to which I replied anywhere.
He started asking questions about C. He asked difference between call by pointer and call by reference. Whether a function can be defined as
void function(int &x, int &y);
Then he asked what is volatile data type in C. Then about the static data class.
He also asked me to write a program to find length of a string.
Then he asked about how functions in C work. How does the program know where to go back after a function is over, etc.
He then asked me if I knew C++, I said no. So he continued to ask a few questions on data structures.
He then asked about the ACID properties which a good database must have. He asked how are transactions managed by a database, what are commits, how, in case of a power failure, data is reverted back, etc.
Then he asked me whether I like to work individually or in a team. I said in a team. He then gave me scenario where I have to decide between a project I am working on, whose deadline is approaching, and helping a friend working on another project whose deadline is also approaching, and asked me what would I do in such a case.

Q1. 
Find the Middle of a Linked List
This problem requires you to return a pointer that references the middle node of a singly linked list.
Explanation:
If the number of elements in the linked list is odd, ...read more
Ans. 
Return the middle node of a singly linked list, considering odd and even number of elements.
• Traverse the linked list with two pointers, one moving twice as fast as the other

• When the fast pointer reaches the end, the slow pointer will be at the middle

• Return the node pointed to by the slow pointer as the middle node
Answered by AI
Add your answer

Round duration - 75 minutes
Round difficulty - Easy

This was the coding round which consisted of three coding questions and the time limit was of 75 minutes. The platform used was Co-Cubes. 3 questions were asked of 2, 3 and 5 marks respectively with varying difficulty.

Q1. 
Nearest Multiple of 10 Problem Statement
Given an integer N, find the nearest multiple of 10. If there are multiple nearest multiples, return the smallest one.
Input:
The first line contains an integer ...read more
Ans. 
Given an integer, find the nearest multiple of 10. If multiple nearest multiples, return the smallest one.
• Iterate through each test case

• Calculate the remainder when dividing N by 10

• If remainder is less than or equal to 5, nearest multiple is N - remainder

• If remainder is greater than 5, nearest multiple is N + (10 - remainder)
Answered by AI
Add your answer
Q2. 
Day of the Week Calculation
Your task is to create a function that determines the day of the week for any given date, whether in the past or the future.
Input:
The first line consists of an integer 'T',...read more
Ans. 
Create a function to determine the day of the week for any given date.
• Parse the input integers to create a date object

• Use a library or algorithm to calculate the day of the week for the given date

• Return the corresponding day of the week as a string
Answered by AI
Add your answer
Q3. 
Delete N Nodes After M Nodes in a Linked List
Given a singly linked list and two integers 'N' and 'M', traverse the linked list to retain 'M' nodes and then delete the next 'N' nodes. Continue this proces...read more
Ans. 
Traverse a linked list to retain 'M' nodes and then delete the next 'N' nodes, repeating until the end of the list.
• Create a function that takes the head of the linked list, 'N', and 'M' as input parameters.

• Traverse the linked list, retaining 'M' nodes and deleting the next 'N' nodes in each iteration.

• Continue this process until the end of the linked list is reached.

• Update the next pointers accordingly to skip 'N' nodes...read more
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

This was a written round and we were expected to write fully functional code, without any bugs and errors. Library functions used if any, had to be explained and if possible, code for that too (not that rigorous). Pseudocode and algorithms were also allowed. All the assumptions made had to be explained as well.

Q1. 
Look-And-Say Sequence Problem Statement
The Look-And-Say sequence is a series of positive integers generated in a specific pattern:
1, 11, 21, 1211, 111221, 312211, 13112221,...
To construct this sequen...read more
Ans. 
The Look-And-Say sequence is a series of positive integers generated in a specific pattern based on the count of digits in the previous number.
• Implement a function to generate the Nth term of the Look-And-Say sequence efficiently.

• Use a loop to iterate through the sequence generation process.

• Keep track of the count of consecutive digits in each number to generate the next number.

• Handle the constraints of the number of t...read more
Answered by AI
Add your answer
Q2. 
Rearrange Array to Form Largest Number
Given an array ARR consisting of non-negative integers, rearrange the numbers to form the largest possible number. The digits within each number cannot be changed.
...read more
Ans. 
Rearrange the array elements to form the largest possible number by concatenating them.
• Sort the array elements in a custom way to form the largest number.

• Convert integers to strings for comparison while sorting.

• Handle edge cases like leading zeros in the final number.

• Example: For input [12, 5, 34], the output should be '53412'.
Answered by AI
Add your answer

Round duration - 50 minutes
Round difficulty - Easy

The interviewer was very friendly and started asking me questions by making me comfortable.

Q1. 
Simplify Directory Path Problem Statement
You are provided with a directory path in Unix-style notation, and your task is to simplify it according to given rules.
In a Unix-style file system:
• A dot (...read more
Ans. 
The task is to simplify a directory path in Unix-style notation according to given rules.
• Use a stack to keep track of directories while iterating through the input path.

• Handle cases for '.', '..', and multiple slashes to simplify the path.

• Return the simplified path starting with a slash and without a trailing slash.
Answered by AI
Add your answer
Q2. 
Polynomial Simplification Problem Statement
You are provided with two arrays representing the coefficients and degrees of a polynomial expression. Your task is to simplify this polynomial into its general...read more
Ans. 
Simplify a polynomial expression by combining like terms and arranging them in descending order of degrees.
• Iterate through the coefficients and degrees arrays to combine like terms

• Create a map to store coefficients based on degrees

• Sort the map keys in descending order to get the simplified polynomial
Answered by AI
Add your answer

Round duration - 40 minutes
Round difficulty - Easy

This round was focused on resume and projects

Round duration - 30 minutes
Round difficulty - Easy

This round was basically a mix of HR and creative design round. The interviewer wanted to check whether the candidate can think out-of-the-box with regard to any given problem and come up with unique, optimized solutions.

Q1. Basics of. Net Framework and sql related questions.
Add your answer

Q1. . Net and sql related questions
Add your answer

Q1. Projects that you have done, salary expectations and joining time.
Add your answer

Q1. Salary related conversation.
Add your answer