Google May 2020 [Bangalore] [Reject]
Anonymous User
1142

phone screening - separate text with per line limit (inserting new lines without impacting already existing newlines )
round 1- binary heap question
round 2 - DP hard stone game -III
round 3 - addition of longs , overflow issue
- check if a string is subsequene of another or not and a follow up of checking a string against a list o strings
round4 - -find timeouts of RPC calls , duration > timeout

reject as I could not solve problem in round 2 and partially solved in round 1.
:( hope to come back stronger next year.

Comments (3)