Status: 7y experience in product development\nPosition: SSE\nDate: July 2021\n\n**Screening**\nForgot the exact questions, there were 2. Easy to Medium difficulty\n\n**Coding -1**\nQ1. Choose index of one of max element randomly (uniformly distributed)\n1 2 5 5 3 -> index {2,3} chosen uniformly\nQ2. Max sum path of Binary Tree\n\n**Coding - 2**\nQ1. Remove min parenthesis to form a valid string\nQ2. Find LCA of two given nodes in Binary Tree\n\n**Design**\nDesign an Online Programming Judge. Focus on scalability.\n\n\nInterviewers were not native english speaker and I had a tough time understanding them specially in round 1. Had to ask multiple times exactly what they were trying to say.\nI think in round-1, q2, he wanted me to print the path but I calculated the sum instead \nMissed one scenario in round-2, q2\n\nQuestions were not that difficult and I even prepared well, but missed it :(

Status: 7y experience in product development\nPosition: SSE\nDate: July 2021\n\nScreening\nForgot the exact questions, there were 2. Easy to Medium difficulty\n