I had a Telephonic round with Google Brain Paris, they asked 2 question in 45 mins.\n\n1 Implement assert function in c++.\n2. You have 2d matrix of points. So implement algo for points collinearity.\n\nI was point blank on the first question implementing assert function. Never expected these type of question and the interviewer drag it for 35 mins. for the 2nd question implemented it in 10 mins missing some corner cases as already finished the time of 45 min.\n\nGot rejected. But I will say not the fair question to ask in Interview.\n\nLinkedIn -\n\nInput:\nA method getRandom01Biased() that generates a random integer in [0, 1], where 0 is generated with probability p and 1 is generated with probability (1-p)\n\nOutput:\nA method getRandom06Uniform() that generates a random integer in [0, 6] with uniform probability\nTip:\ngetRandom01UnBiased\n\nDont use any library function.\n\nMultiple Basic question from machine learning and computer vision. Easily answered.\nRejected

I had a Telephonic round with Google Brain Paris, they asked 2 question in 45 mins.\n\n1 Implement assert function in c++.\n2. You have 2d matrix of points. So 