Ho presentato la mia candidatura online. Ho sostenuto un colloquio presso Google (Bengaluru) nel mese di ott 2018
Colloquio
there were various stages in my interview,
There was a coding round , then project discussion and then hr round.
Coding round was conducted online and shortlisted people were called for project discussion and HR round
Domande di colloquio [1]
Domanda 1
They asked me a coding question which was based on Binary lifting in trees
Ho sostenuto un colloquio presso Google (Bengaluru)
Colloquio
Total of 3 rounds, asked dsa related questions, each round is of 45 mins, need yo think if approach first l then align with it with interviewer and then code it
Ho presentato la mia candidatura online. Ho sostenuto un colloquio presso Google (New York, NY)
Colloquio
oa+interview, and also you need to go to one office to get onboard interview, tech interview about leetcode problem, They ask you to write it on the board and docs
Domande di colloquio [1]
Domanda 1
You are given two N-sided dice, P and Q, where each die has N integer values (not necessarily unique or standard).
When rolled, each side is equally likely to appear.
Given the values on each side of dice P and Q, determine:
The number of outcomes where P's roll is greater than Q's roll (i.e., P wins).
Follow up 1: The number of outcomes where Q wins.
Follow up 2: The number of outcomes where both rolls are equal (tie).
P and Q are always in non-decreasing sorted order.