Envié una solicitud electrónica. Acudí a una entrevista en Google (Bengaluru) en oct 2018
Entrevista
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
Preguntas de entrevista [1]
Pregunta 1
They asked me a coding question which was based on Binary lifting in trees
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
Tough back to back 3 rounds after googliness , it started with phone call , than in person round in Bengaluru office 1 1 1 1 1 1 1 1
Entrevista difícil
Solicitud
Envié una solicitud electrónica. Acudí a una entrevista en Google (New York, NY)
Entrevista
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
Preguntas de entrevista [1]
Pregunta 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.