Hi all,\n\n\nIt started with a phone interview:\nQuestions:\n1.Right Side view of the Binary tree\n2.Given an array with duplicates, find the local maxima\n\n\nOnsite:\nFirst Interview:\nWeird why I was being asked the first question:\n1.Find the unique elements in a huge array(Gave the linear search array and HashSet approach)\n2.Return true of false if subarray sum is found\nSecond Interview: \n1.The rat and cheese question(used DFS here)\n2.Insert numbers in a container and compute their median(used two Priotity Queues here)\nThis was nothing like Moving Average Data Stream\nThird Interview: Design Instagram(Product)\nFourth Interview: So difficult to interpret what the interviewer was asking because of his accent.\nLooked like the answers which I was giving, either he wasn\'t listening or was unable to interpret because he asked me the same questions framed differently again. After answering the same answer second time, he got it. I was more than verbose when explaining everything. He didn\'t want technical explainations and I framed my answers accordingly.\nI provided working solutions for all the coding problems. May be, the during the second interview for the second question, my explaination was not upto the mark because I was focusing on implementing the solution as I had imagined it to be long and yeah, the time crunch.\nI ran through all the solutions with examples and validated my solutions too.\n\n\nNot so bad an experience, will prepare better!\nGood luck to all!

Hi all,\n\n\nIt started with a phone interview:\nQuestions:\n1.Right Side view of the Binary tree\n2.Given an array with duplicates, find the local maxima\n\n\n