Round 1: https://leetcode.com/discuss/interview-question/872815/google-onsite-software-engineer
Round 2: Given a calculation class where you initialize values for a,b,c, and the following function f(x) = ax^2 + bx + c, and a list of numbers, apply this function to all values in the list.
class Calculation {
int a;
int b;
int c;

int[] calculate(int[] arr)
}

Followup: We want the output array to be sorted. Can we do better than O(nlogn)?

Round 3: You are given a * b board/floor and you are supposed to place m tiles for 1*n. Given an arrangement (you can assume a structure and inputs) you are supposed to find whether the arrangement is valid or not. A valid arrangement is where all m tiles are placed and follow all rules: 1. All tiles should be vertical or horizontally placed (not on an angle). 2. Tiles should not touch each other from edges or corners (no common corners or edges). 3. Tiles should not overlap.
Input :

• a, b (size of board/floor)
• m tiles (e.g. 7 tiles: 2 1x2 tiles, 3 1x4 tiles and 2 1x5 tiles)
• An arrangement of some tiles on board (you are allowed to assume your own structure).

Output: true/false for the validity of a given arrangement for a given set of tiles on a given floor.

Round 4: Googlyness (it was a short 15 mins discussion)

1. A problem that you are proud of.
2. Strengths and how are you different.
3. Situations where you have to go against seniors/managers.