The interview comprised three rounds.

All three focused on Data Structures and Algorithms. One of them included a 15-minute Googleyness round.

Googleyness is Google's behavioral round.

First Round: Build a probabilistic map which maps keys to a list of values. Whenever the user tries to access a key, it returns a random value from the list, which is then deleted with the same probability as the other values.

Googleyness:

1. Did you have conflicting decisions when working in a team? If so, how did you tackle that situation?
2. Was there a time when you stood up for a teammate?

Second Round: There is a lock and a password with the keys: {1, 2, 3, 4, 5}. I was asked to generate all possible passwords using these keys. In one step, a person can press multiple (possibly zero) keys. Find all possible passwords.

There is an unsorted array with the condition that abs(index_current - index_sorted) <= k, where k <.