Google | L3 | On-site | Bangalore | Offer

Given two arrays appointmentTime and appointmentDuration and an integer numRooms. Each room has an id ranging from 0 to n-1. Find the room that gets most appointments if a room can have only one appointment at a time, and each appointment is assigned an available room with the smallest room ID.

There is a highway of length m and has n+1 lanes. I am a frog trying to get across the highway. I can either move left, right, up or stay in my current position for 1 unit of time. There are k cars on the highway, given as {laneNumber, initialPosition, velocity}. The cars can move in either directions with unit speed. Find the minimum time the frog will take to cross the highway. Also find the worst-case time complexity.
Assume the initial lane and last lane are empty. My frog starts from lane 0 and position x. The cars can have either +1 or -1 velocity. Once a car leaves the frame, they don't return.

You are given an array of commit IDs in chronological order. There is one bad commit in the order that renders all subsequent commits bad. You have an isBad(commit#) function that tells if a particular commit is bad or not. You have to find the first bad commit. This is the same as First Bad Version question on LeetCode.

A question very similar to Word Break II.

I am sitting on a computer (Main-computer) on a network. The network has a few computers, connected directly or indirectly to me. Each computer has a 'unique' string identifying it (like MAC address), but for simplicity, these MAC addresses can be assumed to be from A-Z. The goal is to find the total number of computers on the network. I cannot access other computers on the network directly, but I can send a program on the network that EACH computer on the network will install. This program will have a send(string) function and a receive() function. The send function will send the string passed to the function to all its IMMEDIATE neighbours (it's handled implicitly - no information about neighbours is given). The 'receive' function takes the string sent from its immediate neighbours. I need to write a 'receive' function such that after a while, the Main-computer can print out the total number of computers on the network.

Some clarifications discussed with the interviewer:

• Each computer gets identical send() and receive() functions.
• I only have access to the send() function on the main-computer.
• There is no global memory that can be accessed by all computers, but each program can access the local memory of the computer it is running on.
• Since there are a lot of async calls happening, assume a mutex lock on this memory while in use.