Ho presentato la mia candidatura online. Ho sostenuto un colloquio presso Google
Colloquio
ONLY DSA Questions were asked. Not a single question related to OS, DBMS, CNS, OOP, System design or even Resume was asked. So now you know what to focus on.
Domande di colloquio [1]
Domanda 1
You are given a string S of length N consisting of digits from ‘0’ to ‘9’. You need to partition the string in ‘K’ substrings such that each substring starts with an even digit and ends with an odd digit. Each substring must be of Length at least equal to ‘M’. Determine the total number of ways in which you can partition the string into ‘K’ substrings. Give answer modulo 1e9+7.
Sample: N=9, M=2, K=3, S=’454569421′
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.
Applied got email from someone I don’t think they are actual Google recruiters, they send assessment link once completed even pass, they say will update to Google recruiter and come back by saying not selected. Feel whole process something not right
Le migliori aziende per "stipendio e benefit" vicino a te
