Google L3 USA Onsite interview questions
Summary
I recently interviewed for an L3 role at Google in the USA, navigating through a phone screen, a Google & Leadership round, and three challenging technical rounds.
Full Experience
My L3 interview journey at Google in the USA began with a phone screen, followed by an onsite component which included a dedicated Google & Leadership round and three distinct technical coding sessions. Each stage presented unique challenges, ranging from in-depth behavioral inquiries to complex algorithmic problem-solving. It was a comprehensive evaluation of my skills and approach.
Interview Questions (9)
Tell me about a time when your manager set reasonable demands. Follow up asked for a situation with unreasonable demands.
Tell me about one of the biggest accomplishments in your career so far.
Tell me about a time when you faced a challenging situation at work.
How do you manage multiple priorities, do you like to be in a place where priorities keep changing or prefer doing the same thing repeatedly.
Tell me about a time you set a goal for yourself and how you approached achieving it
Describe one positive leadership/managerial style you liked from one of your previous managers and how did that affect your workstyle
Given a sequence of words as a single string, place them into lines of specified width. Return the number of lines needed.
Your company has hired interns who need to relocate for the summer. You are in charge of assigning apartments (flats) to them. Apartments have at least one bedroom and each intern will get their own bedroom. Interns can indicate whether they prefer to share a 2 (or more) bedroom apartment (flat) with other interns,or a one-bedroom to themselves. Note that the number of single-occupancy and shared apartments (flats) is finite, so interns may not get their preference.
Your goal is to assign people to apartments (flats) for their internship, matching their preferences to the best of your ability. The remaining people should be matched to the rest of the available units.
You have the following data structures:
struct Apartment { int apt_id; int num_bedrooms; }struct Person { std::string name; bool wants housemates; }Return unordered_map<int, vector<char>> apartments_to_tenants containing a list of apt_ids with the names of tenants residing in that apt.
Given a sequence of digits of size S, return the subsequence that represents the largest possible number of size K that could be formed from the sequence maintaining the input order. Follow-up : asked for a different approach with same time complexity and discussed both.