#!process Google offer
1 messages · Page 1 of 1 (latest)
OA oct 30
interviews nov 5 and nov 15?
TM nov 16
2 calls by nov 29
matched by early dec
offer 2 days ago
accepted td
what team
gcp
w loc?
this guy is too good holy shit
incredibly chill
almost like they dont really mind how strong you are, just if you are interested
@faint hedge how hard was the OA and interviews?
OA - easy
interviews - both medium
damn wdym by easy, the OA practice questions google gave me were DP
i remember backtracking, i forgot the other
You are given an array A representing heights of students. All the students are asked to stand in rows. The students arrive by one, sequentially (as their heights appear in A). For the i-th student, if there is a row in which all the students are taller than A[i], the student will stand in one of such rows. If there is no such row, the student will create a new row. Your task is to find the minimum number of rows created.
Write a function that, given a non-empty array A containing N integers, denoting the heights of the students, returns the minimum number of rows created.
There are some processes that need to be executed. Amount of a load that process causes on a server that runs it, is being represented by a single integer. Total load caused on a server is the sum of the loads of all the processes that run on that server. You have at your disposal two servers, on which mentioned processes can be run. Your goal is to distribute given processes between those two servers in the way that, absolute difference of their loads will be minimized.
Write a function that, given an array A of N integers, of which represents loads caused by successive processes, the function should return the minimum absolute difference of server loads.
different OA then, mine was fr a 10 min OA
damn
Those are just standard oa practice questions lol
Those were my practice oa qs back when i did it in june
oh lol
The oa is super ez
would you say the OA was easier
you remember? ðŸ˜
Lol yeah specifically bc i was like wtf this oa might be hard
ðŸ˜
So i did the practice and expected it to be that difficulty but it was hella free
it will be