Amazon Interview Experience
Position: Software Development Engineer-I ( WOW EVENT 2020) "When life puts you in a tough situation, don't say why me just say try me".Read it till the end to know why I have mentioned this quotation here. Round 1 (online round on Mettl platform): 28 Technical Mcqs 2 coding Round 2(onsite technical): 1. Find the diameter of a tree when a binary tree is flattened. https://www.geeksforgeeks.org/diameter-of-a-binary-tree/ First approach: Finding the lowest common ancestor(which is at the highest level) of two nodes in the left and right subtree, then find the distance between them. This solution cleared only a few cases. Few questions on different traversal techniques to be used to approach the above problem. It took a lot of time for me to get the logic right. Second approach: Finding the deepest node on the left and right subtree and finding the dis
