Message on Whatsapp 8879355057 for DSA(OA + Interview) + Fullstack Dev Training + 1-1 Personalized Mentoring to get 10+LPA Job
0 like 0 dislike
in Interview-Experiences by Expert (30,360 points) | 559 views

1 Answer

0 like 0 dislike
Google | SWE | Rejected

5 Rounds full day interview



Give an array of boxes with size N+1 with its weight is from 1->N. The final element is empty marked with an 0. Sort the boxes from lightest to heaviest where you can only move 1 box at a time to the empty slot. You should do it in o(N) time.



Get maximum sum from array of coin, if you can only pick k coins from either side of the the array.



Given a binary tree in array form, where each element is <value, parent index>, where remove the subtree given the parent index.



Remove an array of substring from document given its starting position.






I was rejected because my code wasn't optimized. I suspect it's just a random reason given to candidates.
by Expert (30,360 points)