Amazon Interview | Set 11 Last Updated : 05 Aug, 2024 Comments Improve Suggest changes Like Article Like Report I would like to thank geeksforgeeks team for the excellent website. I got placed in amazon because of your website. I would like to share my experience and the interview questions. 1 round was online written technical test There were 20 MCQ and 2 programming questions. Each correct answer carried 1 mark and -0.25 for a wrong answer. Programming questions were: ---Write a program to find the difference between the sum of nodes at odd height and the sum of nodes at even height ---Given an array of integers representing coin values and the sum required. find the number of coins required to get the sum 4 technical rounds Various programming questions related to data structures were asked. Each round was an elimination round. Questions asked were ---Write a program to traverse the tree in spiral form in O(n) time.(Hint:use two stacks) ---Program to implement atoi function ---Program to swap the kth node from end and kth node from front ---Program to find loops in linked list ---Find the maximum length palindrome in a string ---Difference between process and thread ---Advantages and disadvantages of thread and process ---Test cases for checking binary tree ---Test case for atoi function ---Test cases for finding loops in the single linked list Each technical round was for 60-90 minute duration. There was no HR round :) This article is compiled by Supreeth. Many Many congratulations to Supreeth. All Practice Problems for Amazon ! Comment More infoAdvertise with us Next Article Amazon Interview | Set 11 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 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 | 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 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 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 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 SDE 1 Interview Experience Round 1: Written round, 1. Convert Sorted array to BST. 2.Return row from the 2-D array which has maximum Number of 1. 3.Print next greater element input-4 5 25 13 6 12 output -5 25 -1 -1 12 -1 Round 2: F2F 1. Find the missing number from 1 to N.N=12 0 1 2 3 4 5 10 12 output---6 Binary search 1 min read Amazon Interview experience | Set 335 First Round : 10 Mins - Introduction of the team , myself , Behavioral questions . Next 45 mins - write a findMatch method for online game where two players are set to play game. If player X comes online then he needs to be matched with player whose existing rank is closest possible to that of Playe 1 min read Like