Amazon Interview | Set 74 Last Updated : 06 Aug, 2024 Comments Improve Suggest changes Like Article Like Report 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 subset sum which is equal to 0. eg 2, 1, -1, 0, 2, -1, -1 o/p: 1, -1 1, -1, 0 0 2, -1, -1 2) How do you check whether a binary tree is a binary search tree. Face to Face Interview (Round 2): 1) you have a billion numbers how do get kth top elements 2) given a number n, print all pairs of valid parenthesis eg: n=2 -> (()), ()() n=3 -> ()()(), (())(),()(()), ((())) I did not clear after this round, I hope this helps others. All Practice Problems for Amazon ! Comment More infoAdvertise with us Next Article Amazon Interview | Set 74 Anonymous Improve Article Tags : Interview Experiences Experiences Amazon Practice Tags : Amazon Similar Reads 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 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 31 Recently I attended the Amazon walk-in and got selected for the position of SDE I. Written test: 1. Write a code to convert tree to DDL(assume tree node contains pre, next pointers and set as null initially.)2. WAP to encode and decode string. aabbbbcccd <->a2b4c3d13. Find the sum of elements 2 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 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 | 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 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 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