Amazon Interview | Set 16 Last Updated : 09 Apr, 2025 Comments Improve Suggest changes Like Article Like Report I recently appeared for amazon which came to our campus. Here is my experience. Shortlisting Round. There were 20 MCQ and 2 programming questions. Each correct answer carried 1 mark and -0.25 for a wrong answer. Programming questions were: a. Given a number with the number of digits in the range of 10-50, find the next higher permutation of the number. If such a number doesn't exist, return -1. b. Given an array of strings, you need to find the longest running sequence of a character among all possible permutations of the strings in the array. INPUT: ab ba aac OUTPUT: a,3 Then there were 4 rounds of interview. T1 a. Given link list segregate odd elements first and even elements afterwards. b. Given a BST of memory sizes. Find best fit for a memory block of size M. T2. a. Given 2 sorted arrays of size m and n+m(with n elements) , mergethem into the latter.. b. Given a character array find the first element that repeats itself.T3. a. Given a binary tree connect all nodes in a level through link list. b. Some question related to share market which boiled down to find maximum difference between two elements such that second element appears after the first one. c. What is thrashing ? d. Real world application of heaps? e. Minimum spanning tree and topological sort . T4. Around half an hour HR then Given a function node* inplacemergesort(node* n1, node* n2) which takes 2 linked lists as input and performs in-place merge sort and returns the final list. How will you test it and make sure it does what it claims. I was hired :) . The interviewers were very friendly, patient and looked for optimal solution to each question . I am very thankful to geeksforgeeks for such a great site and the way its maintained.It really helped me a lot for my preparation. Keep up the good work guys :) Thanks. This article is compiled by Ayush. Many Many congratulations to Ayush for his selection in Amazon. Comment More infoAdvertise with us Next Article Amazon Interview | Set 16 Anonymous Improve Article Tags : Interview Experiences Experiences Amazon Practice Tags : Amazon Similar Reads Amazon Interview | Set 13 Round 1 (Telephonic) Q1. For a given number, find the next greatest number which is just greater than previous one and made up of same digits. Q2. Find immediate ancestor of a given Node Q3. Clone the linked list having an extra random pointer in nodes which is pointing random node in the list. Roun 2 min read Amazon Interview | Set 93 I have just completed a full interview with Amazon and wanted to give back to GeeksForGeeks my experience because it has helped me so so much to go through it. 1st phone interview Why Amazon? How do you find out the cause of a slow UI request? Write function to convert a stream of incoming character 1 min read Amazon Interview | Set 29 I am very much excited for sharing my experience for Amazon, I went through 6 rounds and really enjoyed a lot for facing all of them and i feels like in each round that GEEKSFORGEEKS is the one the best site which gave me lot of ideas for solving the problems, This is THE BEST site for coding for ge 5 min read Amazon Interview | Set 63 (For SDE-1) I have a total experience of two years. I am sharing my interview experience with Amazon. This is for SDE1 Amazon. A very big thanks to whole team of geeks for geeks. It is because of them only that I was able to make Amazon and get a job in my dream company. Otherwise it was impossible for me. The 1 min read Amazon Interview | Set 9 (Answers) This post is about answers to the questions asked in Amazon Interview | Set 9. It contains links to some of the solutions available on the geeksforgeeks. I have also written my answers which I replied in the interview. I hope it would help the readers. Online Programming Round: (5 methods, 2 hours) 3 min read Amazon Interview Question Round 1: There is an unsorted array of size n. Given a key k find m nearest elements to k. Example Array :Â Â -10, -50, 20, 17, 80. key k :20 m : 2 Answer 17, -10. Solution : Find k closest numbers in an unsorted array 1 min read Amazon interview Experience | Set 133 Recently had a interview with Amazon, through employee referral. All face to face rounds. I didn't clear, so no offer. 1st Technical Round: Given an integer, find the next biggest integer whose digits are in increasing order. Example: Input: 118 Output: 123 Input: 127 Output: 234 Input: 987 Output: 1 min read Amazon Interview Experience | Set 148 Round 1: 1. Incoming stream of characters () defines an onion of depth 1, (()) of 2. Find all onions with their in an incoming stream of characters. Discuss complexity. Stream can be (()) () )) ((( ( 2. Biggest challenge faced / where you innovated? Resume Project: i. Demonstrate High Level Design 3 1 min read Amazon Interview Experience | Set 361 Round 1 : Given 2 array of size m , n , find the pair from diff array with minimum difference Solution: GeeksforGeeks Link Given the dialer of a feature phone and a dictionary of words , find the string suggestions after dialing n numbers. Verify if the Tree validates the definition parent_node.data 1 min read Amazon Interview Experience | Set 221 I gave my round 1 amazon. There were two coding questions. 1) Given an integer n in the input, find its next sparse binary numberA sparse binary number is a number whose binary representation does not contain any consecutive 1s. For eg. 72 is a sparse binary number, because its binary representation 1 min read Like