Amazon Interview | Set 6 Last Updated : 05 Aug, 2024 Comments Improve Suggest changes Like Article Like Report Following are my interview details for senior software engineer in 2010. Thought of sharing it, if it helps anybody Telephonic Interview 1 1) Write your own power function in C/C++. Time complexity of your code, optimizations. 2) Given two strings, write a function to remove all characters in one string which are present in other string Telephonic Interview 2 1) Construct a tree from ancestor matrix. The main thing he wanted to check was use of binary search. 2) Find the k maximum selling items at amazon site at the end of day. Given a file which has count all sold items. Use of min heap was expected. Face to Face 1 1) Given a Binary Search Tree, in-place convert it to DLL. 2) Find the next greater element for every element in array. Face to Face 2 1) Median of two sorted arrays. 2) Given an XML file, how will you store it in memory. Use of tree was expected. There were some more questions that I don't remember. Face to Face 3 1) Given a Binary Tree, check if every node is sum of all of its children. 2) Given any Binary Tree, convert it to a tree where every node is sum of all of its children. 3) Given an array, find three numbers a, b and c such that a^2 + b^2 = c^2 That is all I remember now. Thanks to Vivek for sharing Amazon Interview Questions. All Practice Problems for Amazon ! Comment More infoAdvertise with us Next Article Amazon Interview | Set 6 Anonymous Improve Article Tags : Interview Experiences Experiences Amazon Practice Tags : Amazon Similar Reads Amazon Interview | Set 5 I've attended the Amazon interview in Hyderabad, This was kindle team, I got rejected but I'd like to share the experience, thought of giving back something to geeksforgeeks, which was a great reference for me. Written test Very straight forward 1. Given a linked list, sort without extra space. I wr 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 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 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 74 Phone Interview: 1) Given a 2D matrix where every row is sorted, give the index of row which has maximum number of one’s 2) Given a Binary tree, print its every level in a new line. Face to Face Interview (Round 1): 1) you have an array which has a set of positive and negative numbers, print all 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 | 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 116 (On-Campus) Round 1:- 20 MCQ’s(Majority from OS and Java, C++, 1 aptitude) 2 coding questions. 1. Given an array, find the maximum sum that can be formed from the array such that no two adjacent elements are taken into consideration. for ex:- 1,2,3,5 should return 7. 2. Print Vertical axis sum of the given bina 2 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 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