Google needs no introduction as one of the world’s mightiest tech moguls. Unsurprisingly, many aspiring developers, engineers, analysts, and other professionals would love the opportunity to work for Google and become part of the organization playing a vital role in powering today’s I.T. world.

Now, Google is no slouch when it comes to handpicking the most talented among candidate pools. Hence, Google’s hiring process is long and complex, requiring thorough preparation and performance to successfully make it through.

Before your interview, it’s vital that you review possible Google interview questions. Whether they’re Google software engineer interview questions, Google behavioral interview questions, or Google coding interview questions 2023 — you need to be prepared for all of them. Intimidated? Don’t worry, we’ve got you covered. Today we’ll run through all the possible Google interview questions for 2023 to help you prepare.

Read through each of these Google hypothetical interview questions and practice the Google interview questions with answers regularly for optimal results!

Let’s get started!

**Google Interview Process**

Google has a reputation for conducting some strange interviews. Some prospective candidates recall being asked strange questions that felt more like riddles, like “how many golf balls can fit in a school bus.” Check out some accounts and reviews of Google interviews from candidates that went through the process!

Google also had a bad reputation for having one of the longest interview processes, some citing 6-9 interviews over the course of 6 months. Nowadays, you won’t have to go through so many interviews, but you’ll still be faced with more of a process than from other employers. Here are Google’s stages for their interview process:

- 1-2 sessions of phone screenings
- 4-5 sessions of in-person interviews
- Hiring committee review
- Executive review

You might face a variety of questions depending on the role you’re trying to land. As supplementary study material, check out these data structure interview questions and programming interview questions.

Be prepared to explain your answers to logic, coding, and algorithm questions on a whiteboard. You’ll be faced with some Google behavioral interview questions as well.

Let’s dive into some Google process interview questions!

**Top Google Interview Questions and Answers**

Let’s take a look at some Google hypothetical interview questions by category.

**Common Google Interview Questions and Answers**

**1. What is your favorite Google product, and how would you improve it?**

**Possible Answer:** My favorite Google product is Google Maps. It’s helped me find my way when I’ve been lost either in town or on my travels, and I love how it shows me where there’s traffic or other potential sources of delays. To improve it, I would offer customers a paid, live map version that doesn’t require data to see paths to certain areas. This will help people traveling in remote communities, without access to data.

**Note: **Have fun with this question! We added a product example, but there are so many Google products to choose from for this answer.

**2. Briefly explain the difference between coding and programming.**

**Answer**: Coding strictly refers to writing code for implementing a solution to a problem. Programming, although wrongly used interchangeably with coding, is a wider process that involves coding as well as coming up with an approach for solving a particular problem and other program development tasks like testing.

**Learn more:**** ****Coding vs. Programming**

**Google Behavioral Interview Questions**

**3. How do you stay accountable? **

I have a few tools that help me stay accountable, apart from my own integrity. I love using calendar apps and project management tools like Asana to track my deliverables and make sure I keep track of my due dates. I set aside time to complete each task in advance, and communicate with my superiors and colleagues if I need more time in an extreme situation. I also make sure I schedule meetings with stakeholders or team members well in advance of a project due date to ensure we’re on the same page for a project.

**4. Tell me about a time when you set and achieved a goal?**

In my last position as X, my supervisor told us that we couldn’t meet our quota due to being short-staffed. While the reduced workload was appreciated by me and my colleagues, I thought that we would be better off meeting our original goal despite being short a team member. I organized a meeting with my colleagues and made an argument for pushing our workloads to meet our originally intended goal. I tried my best to encourage their participation so that we could work as a team to get it done. With enhanced communication and extra effort in coordinating extra tasks, we met our end-of-year quota and kept our original commitment.

**Google Hypothetical Interview Questions and Answers: Technical Questions for Coding, Engineering, Logic, and Data**

**5. How can you learn the identity of a person under these circumstances with the minimum number of questions asked? How many ways can we solve this problem?**

A party is going on with “n*” *number of attendees, with only a single person known to every party attendee. This known person may be present at the party. However, this person doesn’t know anyone at the party, and we can only ask questions like, does A know B? How can you learn the stranger’s identity with the minimum number of questions asked? In how many ways can we solve this problem?

**Answer**: To solve the problem, we need to consider an array with N elements that represents all party attendees. We can also consider a function, are known (A, B). It will return true if A knows B; otherwise false. We can solve the problem in **three ways. **

**First Solution - Brute Force Search Method**

Similar to brute force search, model the solution using graphs and initializing indegree and outdegree of every vertex as 0. If A knows B, then draw a directed edge from A to B. Increase the in-degree of B and outdegree of A by 1. Next, construct all edges of the graph for every possible pair. If the person is present, then we will have a sink node with an in-degree of N-1 and an outdegree of 0, since this person doesn’t know anyone at the party.

The total time required for finding the sink node, i.e., the person will be (N), and the overall complexity of the problem will be O(N^2).

**Second Solution - Using Recursion**

Recursion allows us to decompose the entire problem into a combination of smaller instances. Here, we solve the problem of the smaller instance during the divide step. When going back, we’ll find the person from the smaller instance, if present.

During the combining step, ensure (check) whether the person is known to everyone and she doesn’t know anyone. The recurrence of the recursive decomposition will be T(N) = O(N2).

**Third Solution - Using Stack**

Based on the elimination method, we have the following observations:

- If A knows B, then A is not the person while B might be. Thus, discard A.
- If A doesn’t know B, then B is not the person while A might be. So, discard B.
- Repeat these two aforementioned steps until you’re left with only one person.
- Ensure that the remaining person is the person we are searching for.

To ensure the remaining person is the one we are looking for, we can use a stack as follows:

**Step 1:**Push all the party attendees into a stack.**Step 2:**Pop off two persons from the stack. Based on the return status of the Are Known (A, B) function, discard one of them and push the remaining person on the stack.**Step 3:**Continue repeating Step 2 until only one person remains in the stack.**Step 4:**Check that the remaining person doesn’t know any other party attendees.

The Areknown (A, B) function will be called 3(N-1) times, provided the person is present at the party.

**6. Could manhole covers be any shape other than round, like a rectangle?**

**Answer**: No. Manhole covers must be round to avoid them falling inside the manholes. Only a circular shaped manhole cover won’t fall through the manhole. If the cover were a rectangle or square, then it could easily fall in.

**7. Which of the following sets do not belong?**

**[a, b, c, d]****[a, f, b, g]****[h, i, a, b]****[j, k, l, m]**

**Answer:** The [j, k, l, m] doesn’t belong to the series. The three remaining sets are part of the series because all of them have the [a, b] subset in common.

**8. What is DEADBEEF?**

**Answer**: DEADBEEF corresponds to the hexadecimal representation of the 32-bit number, 3735928559. It was used as a magic debug value during the assembly/mainframe times. The DEADBEEF makes it easy to identify while finding and marking specific memory in pages of hex dumps.

**9. Explain the two-sum problem. In how many ways can we solve it?**

**Answer**: We can solve this problem in two ways. The two-sum problem is a variation of the subset-sum problem. The problem involves finding all the pairs of two integers from an unsorted array that adds up to sum S.

For instance, if the unsorted array is [22, 24, 36, -3, 5, -17, 14] and the sum (S) is 19, then the program must return [22, -3], [36, -17], [5, 14].

**Solution 1 (Normal):** The simple solution to this problem is to loop through the entire array twice, with the second time looking for a pair that totals to the sum S. The total running time for this solution will be O(N^2).

**Solution 2 (Faster): **This approach uses hash tables. While passing through each element of the array, the method checks whether S (the current element) exists in the hash table or not. Hence, we need to loop through the array only once. So, the running time for this solution is O(N).

**10. Explain the algorithm for finding the power set of a given set.**

**Answer**: The power set of a given set contains all the possible combinations of the elements, i.e., all the subsets of a given set, an empty set, and the given set itself. For example, if S = [0, 1, 2, 3] is the given set, then its power set will be:

**P[S]** = [[], [0], [1], [2], [3], [0, 1], [0, 2], [0, 3], [1, 2], [1, 3], [2, 3], [0, 1, 2], [0, 1, 3], [0, 2, 3], [1, 2, 3], [0, 1, 2, 3]].

Here’s the algorithm for finding the power set of a given set:

For a set with N elements, the total subsets will be 2N. Therefore, the algorithm for finding the power set of a given set contains the following steps:

**Step 1:**Loop from 0 to 2N.**Step 2:**For each number, find the binary representation. For example, four is represented as 0100 in binary.**Step 3:**Use the binary representation to check whether to include a number from the set or not, e.g., 0100 = [exclude, include, exclude, exclude].

**11. Is it possible that five minus two equals 4? If yes, how?**

**Answer**: Yes, if we remove two alphabets, i.e., f and e from five, we get IV. IV is the Roman numeral representing 4.

**12. Suppose you have an input string 1??0, where ? is a wildcard. Explain the algorithm to find all possible string combinations **

**Answer**: The input string is 1??0. Now, the first and the last number will be fixed. The middle two are wildcards, which means they can be either 0 or 1.

Here’s a general algorithm to find all the possible combinations of the given string:

**Step 1:**Start by calling the function with the string and an empty set (where we will push 0s and 1s).**Step 2:**Once the control reaches a?, make a copy of each string set, and add 0 for half and 1 for the other half.**Step 3:**Continue recursively calling the function with a smaller string until the string runs empty.

For the 1??0 Input string, the algorithm works like this:

Initial set = [] (The empty set called in Step 1)

- 1st character = 1, so set = [1]
- 2nd character = ?
- So, a copy of each string set will be made i.e. [1], [1]. Next, 0 is added to one half of the sets and 1 to the other half. Hence, the set = [1, 0], [1, 1]
- 3rd character = ?, so once again a copy of each string set will be made i.e. [1,0], [1,0], [1, 1], [1,1]. Next, 0 is added to half of the string sets and 1 to the other remaining half. Hence, the set = [1, 0, 0], [1, 1, 0], [1, 0, 1], [1, 1, 1]
- 4th character = 0, so the final set is [1, 0, 0, 0], [1,0, 1, 0], [1, 1, 0, 0], [1, 1, 1, 0].

**13. How would you explain programming and programming languages to a 10-year old?**

**Answer**: Programming allows us to teach computers to do specific things. A programming language is like a language that we speak, except computers speak it.

**14. Write code to search whether an array has a majority element. If yes, print it.**

**Answer**: The following C++ program searches for the majority element in an array [10, 22, 22, 21, 22, 23, 22] and then prints it:

```
#include <iostream>
using namespace std;
void findMajorityElement(int arr[], int n)
{
int maxCount = 0;
int index = -1;
for(int i = 0; i < n; i++)
{
int count = 0;
for(int j = 0; j < n; j++)
{
if(arr[i] == arr[j])
count++;
}
if(count > maxCount)
{
maxCount = count;
index = i;
}
}
if (maxCount > n/2)
cout << arr[index] << endl;
else
cout << "No Majority Element Exists in the Array" << endl;
}
int main()
{
int arr[] = {10, 22, 22, 21, 22, 23, 22};
int n = sizeof(arr) / sizeof(arr[0]);
findMajorityElement(arr, n);
return 0;
}
```

**Output:**

22

**15. Use the mathematical operations +, -, *, and / on 3, 3, 7, 7 to get 24.**

**Answer**: Divide three by seven and then add 3 to the result. After, multiply the result with 7 to get 24:

7 x ((3/7) + 3) = 24

**16. Is the interval (3, 7) covered for these location coordinates, [[1, 3], [2, 5], [5, 7]]? Is it covered in this list [[2, 3], [3, 4], [5, 6], [6, 7]]?**

**Answer**: Points 3 to 7 are covered in the list [[1, 3], [2, 5], [5, 7]] because 2 to 5 and 5 to 7 are covered. However, points 3 to 7 aren’t covered in the list [[2, 3], [3, 4], [5, 6], [6, 7]] because the distance between 4 to 5 is not covered here.

**17. Suppose you have six glasses lined up in a row with the first three filled with juice and the last three empty. How can you arrange the glasses in an alternating pattern by only swapping once?**

**Answer**: Let us represent the glasses filled with juice by J and empty glasses by E:

J J J E E E

Now, we wish to have:

J E J E J E

OR

E J E J E J

For the E J E J E J pattern, we need to swap at least twice, by replacing the fourth glass with the first, and the fifth with the second.

To achieve the J E J E J E pattern, we need only one swap, which is replacing the 2nd glass with the 5th.

**18. How many ways can you find all the triplets in a given array of n distinct elements with a sum equal to 0?**

**Answer**: Here are three ways to find all the triplets with sum zero in a given array of distinct elements:

**Approach 1 (Naive Approach):** Run three separate loops and check one by one that the sum of the three elements is zero or not. Print all the triplets whose sum equals 0, otherwise print not found.

Auxiliary Space: O(1)

Time Complexity: O(n3)

**Approach 2 (Hashing):** In this approach, we iterate through every element. For each element arr[i], we need to find a pair with 0 - arr[i]. This approach involves the following steps:

- Run a loop from i = 0 to i = n - 2
- Create an empty hash table
- Run inner loop from j = i + 1 to j = n -1
- If - (arr[i] + arr[j]) is present in the hash table then print arr[i], arr[j] and -(arr[i]+arr[j])

Else insert arr[j] in the hash table

Auxiliary Space: O(n)

Time Complexity: O(n2)

**Approach 3 (Sorting)**: We can use sorting to find the triplets with a sum equal to zero. It involves the following steps:

- Sort the array.
- Run a loop from i = 0 to i = n - 2 and initialize two index variables, l = i + 1 and r = n - 1.
- While (l < r), check whether the sum of arr[i], arr[l], arr[r] is zero or not.
- If the sum is 0, then print the triplet and do l++ and r–.
- If the sum is less than 0, then l++.
- If the sum is greater than 0, then r–.
- If the sum doesn’t exist in the array, then print not found.

Auxiliary Space: O(1)

Time Complexity: O(n2)

**19. How many months have 28 or 29 days?**

**Answer**: All 12 months have 28 or 29 days.

**20. When, and how many times do a clock’s minute and hour hands overlap in one day? Explain mathematically.**

**Answer**: For T hours:

- Total laps completed by the minute hand = T
- Total laps completed by the hour hand = T/12

The very first time in the day when the minute and hour hands overlap is after 12 am. The former will have completed one more lap than the latter. Hence, for one overlap, the time period T will be:

T = T/12 + 1 - (i)

Solving it for T we get,

T = (12+T)/12

12T = 12 + T

12T - T = 12

11T = 12

T = 12/11

So,

T = (12/11) * 60 = 65, which is 1:05 am

65 minutes is also the gap between each successive overlap. Now, the second time the hour and minute hands overlap one another; the minute hand will have completed two more laps than the hour hand. So, applying the same logic for N overlaps we get:

T = T/12 + N - (ii)

We have 24 hours in a day, i.e., T = 24. Therefore, solving (ii) will give us the total number the hour and minute hands will overlap one another in a day:

24 = 24/12 + N

24 = 2 + N

N = 24 -2

N = 22

So, the minute and hours hand will overlap one another 22 times a day at:

- 12:00 a.m.
- 01:05 a.m.
- 02:10 a.m.
- 03:15 a.m.
- 04:20 a.m.
- 05:25 a.m.
- 06:30 a.m.
- 07:35 a.m.
- 08:40 a.m.
- 09:45 a.m.
- 10:50 a.m.
- 12:00 p.m.
- 01:05 p.m.
- 02:10 p.m.
- 03:15 p.m.
- 04:20 p.m.
- 05:25 p.m.
- 06:30 p.m.
- 07:35 p.m.
- 08:40 p.m.
- 09:45 p.m.
- 10:50 p.m.

**21. What’s the next number in this series: 10, 9, 60, 90, 70, 66**

**Answer**: If we spell the numbers, then we observe that each successive number has one more letter than the one preceding it:

10: ten (3 letters)

9 : nine (4 letters)

60: sixty (5 letters)

90: ninety (6 letters)

70: seventy (7 letters)

66: sixty-six (8 letters)

Hence, the number following 66 will be a number with 9 letters, like 91 (ninety-one) or 92 (ninety-two).

**22. If the day before yesterday is three days after Saturday, what day is it today?**

**Answer**: Three days after Saturday is Tuesday, making the day before yesterday Tuesday. So:

- The day before yesterday was Wednesday, and
- yesterday was Thursday.

Therefore, today is Friday.

**23. Garry is 16 years old, and four times older than his younger brother James. How old will Garry be when he’s twice the age of James? **

**Answer**: Garry is 16 years old, four times the age of his younger brother James. So, James is 4 years old, or 16/4.

This means that Garry, at 16 years of age, is 12 years older than James.

Let’s suppose that Garry is X years old when he is twice the age of his younger brother. Let us represent the age of James at that time by y years. Now, as Garry will be twice the age of James, we get:

x = 2y - (I)

Also:

x = 12 + y - (II)

x = 2y = 12 + y

2y - y = 12

y = 12

So, James will be 12 years old when his brother Garry is twice his age. Hence, Garry’s age at that time will be 2 x 12 = **24 years.**

**24. How can you get a sum of 10000 by adding only 8?**

**Answer**: To get 10000 only by adding 8, we must add 8 three times, then 88, and 888:

8 + 8 + 8 + 88 + 888 = 10000

**25. Suppose you have 8 balls. 7 weigh the same, while the 8th is slightly heavier. How can you find the heavier ball by comparing the balls only twice?**

**Answer**: Out of the 8 balls, take 6 of them. Now, divide them into triplets and place them on either side of a weighing machine. If the weights are equal, the heavier ball must be one of the remaining 2 balls. Otherwise, the side that weighs heavier will have the heavier ball.

If the ball is among the remaining two balls then:

Place each of them on either side of the weighing machine to find the heavier ball.

If the ball is among one of the triplets:

Out of the triplets, take 2 balls and place each one of them on either side of the weighing machine. If they weigh equal, then the remaining ball is the heavier one; otherwise, the heavier side will have the heavier ball.

**26. Which number doesn’t belong in this series: 0, 1, 1, 2, 3, 4, 5, 8, 13, 21**

**Answer**: This series represents numbers that are the sum of the previous two numbers. The number 4 doesn’t belong to the series, as the 3 and 2 do not add up to equal 4. The correct sequence would be:, 0, 1, 1, 2, 3, 5, 8, 13, 21.

**Tips to Prepare for Your Google Interview**

Reviewing Google interview questions and answers is a great start for your interview prep. Here are some other helpful tips to prepare:

- Research the latest about Google in the news, including new developments and products, expansions, legal issues, and anything else relevant.
- Review the job position specifications in great detail before your interview.
- Talk to your network and see if anyone has gone through the Google interview process, and ask them for any tips.
- Prepare early.
- Get a good night's rest and get to your interview early.

**Best Questions to Ask At the End of an Interview**

At the end of your interview(s) with Google, the interviewer might ask you if you have any questions for them. The worst thing you can do here is say “no.” Show your interest, commitment, and engagement by presenting them with some thoughtful questions.

Here are a few examples:

- What does an average day look like for someone in my role?
- How would you measure success in the position I’m interviewing for?
- What’s your favorite part about working for Google?
- What's the most challenging part about this position?

**Conclusion**

These Google interview questions should give you a general idea about how Google approaches their interviews and hiring process.

Don’t expect your interviewer to spout the exact same common Google interview questions listed in this article. The idea is to get yourself used to the feel of these Google hypothetical interview questions to help you use the same skills to answer similar ones.

Curious about how others fared in their Google interviews? Check out this new grad’s account of the Google interview process.

**Ace Your Google Interview With This Course!**

**People Are Also Reading:**

- Best GCP Certifications
- Difference between Google Cloud, AWS and Azure
- Best AWS Certification
- Best Java Certification
- Top AWS Interview Questions
- Best AWS Certifications
- Top Python Certification
- Top 5 SQL Server Certifications
- How to Become a DevOps Engineer?
- Top Deep Learning Books
- Data Science Books