YOE -> 0-1 years\n\n1st OA round\n2 coding questions, both were leetcode medium-hard. Don\'t remember the questions exactly but I was able to solve 1.5 and got selected.\n\n1st Technical Round:\n\nIntroduction for first 5 mins\n1 coding question: It is a stack based question\nInput string : {{paypal}as}\nOutput : {lapyapas} -> sapaypal\nYou have to reverse the string present inside the parenthesis and do it from the last.\n\n2nd coding question: Union Find matrix problem, where we need to find connected components\nI gave the solution based on Uniuon Find By Rank\n\nSecond Technical  Round: One tree Based question, where we need to find the maximum sum between any two nodes. I gave the approach based on PostOrder traversal and interviewer was satisfied.\nThen there was a discussion on Projects I did and some CS Fundamentals.\n\n3rd Manager Round\n\nIn this for whole 1 Hr he asked me behavioural questions only.\n\nVerdict: Selected for the next round, submitted documents but after 4 weeks got the rejection mail.

YOE -> 0-1 years\n\n1st OA round\n2 coding questions, both were leetcode medium-hard. Don\'t remember the questions exactly but I was able to solve 1.5 and got 