Google Interview Onsite

Posted
24 Apr 2025
337 reads

Summary

I was asked a ranking problem in my onsite second round. I correctly outlined the approach but only partially coded the solution.

How it went

The following question was asked in my onsite second round. I just told the approach correctly and coded just half of the solution.

Questions asked (1)

  1. 01

    Determine Precisely Ranked Players in Chess Contest

    Data Structures & Algorithms

    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

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Google recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!