Google Interview Onsite
Summary
I was asked a ranking problem in my onsite second round. I correctly outlined the approach but only partially coded the solution.
Full Experience
The following question was asked in my onsite second round. I just told the approach correctly and coded just half of the solution.
Interview Questions (1)
There is a chess contest between N players. Each chess player has a distinct rank (positive integer number from 1 to N). We assume that in a chess game between two players, the player ranked higher always wins. The ranks remain constant during the contest. Unfortunately, we don't know the player ranks. But we know the outcome of M games in the following format: Player #1 won #2, Player #2 won #4, ... Given the results of M games above, give me the number of ranks that can be precisely determined