Envié una solicitud electrónica. Acudí a una entrevista en Google (Bengaluru) en nov 2024
Entrevista
Interview totally based on dsa.briefly told the self intro and then question regarding the strings.they are given a conversation between two persons and count the each persons words.and asked the time complexity. and the project and the language which we were comfortable with.
Preguntas de entrevista [1]
Pregunta 1
They asked me about the bruteforce. later asked the optimal one.
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
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.