Hi All,\n\nI applied to amazon through internal referral. Was contacted by the recruiter after one week.\n\n1) Online Round\n\nQues-1 The problem boils down to optimal merge tape problem.\n\nQues-2 The problem boils down to find all the pairs in the two given arrays that has sum closest and less than\n\t\t\tto a given number K.\n\n\nAfter one week the recruiter told me that I have cleared the online assessment and my virtual onsite was scheduled.\n\n**[Round 1]**\n\n* First 25 minutes were spent on the LP Questions. \nQues - 1 The problem boils down to the course scheduling from leetcode. The only catch was that instead of the integer \nrepresentation of courses the string representation was given. \n\nThis round only had one question.\n\n**[Round 2]**\nQues - 1 The problem was similar to the minimum platform required if the arriving and departure times of train are given.\n(Wasn\'t able to optimise this one, I explained the O(n^2) approach).\n\nQues - 2 The problem was similar to knight on a chessboard. (solved this one although one bug while implementation)\n\nQues - 3 Asked the concept of virtual memory and asked the LLD for the swap In and swap out process. [Had a little discussion as very little time was left]\n\nPS -  Didn\'t received any further updates after these rounds. Also contacted the recruiter through mail still no response \n\t\tafter 1.5 weeks. Probably it\'s a reject.\n\nEdit-1 Received a mail from recruiter today. It\'s a reject.

Hi All,\n\nI applied to amazon through internal referral. Was contacted by the recruiter after one week.\n\n1) Online Round\n\nQues-1 The problem boils down to 