Amazon Interview Experience | Set 258 (For SDE1) Last Updated : 09 Aug, 2024 Summarize Comments Improve Suggest changes Share Like Article Like Report Round 1: It was a writen round with three questions : 1. Find a row with maximum number of 1’s in a sorted 2D Boolean matrix. 2. Find next greater element for every element of an array to its right in O(n). 3. Convert a sorted array to binary search tree. Round 2: 1. There is a linked list which is sorted based on their absolute values. Sort them based on their actual values. Eg., input : 1 -> -2 -> -3 -> 4 -> -5 output: -5 -> -3 -> -2 -> 1 ->4 2. Reverse a linked list. 3. Given a 1D array where each cell represents a toll gate ticket value. Find the minimum number of tickets needed to surpass the whole array (means till u reach the end of array) .If ticket value is 1 then u can pass that cell alone. If ticket value is 2 u can pass that cell and the next cell.. that is how ticket values work. Eg : Input : 3 1 5 4 1 1 1 Output :In this case if v buy ticket from a[0] and a[2] meaning two tickets are enof to pass this array.. Round 3: Only one question was asked : 1. Convert a BST to sorted doubly linked list without any extra space. (only ptrs to nodes should be created ,no new node creation is allowed.) Round 4: Telephonic Round: 1. Tell me about yourself 2. Print the boundary of a tree. 3. There are billions of URL given. Come up with a efficient data structure that returns ip address of these urls. 4. Trie data structure I was asked to send the code snapshot within five mins after ending the call. Round 5: 1. Tell me about yourself 2. Projects and Internship 3. Given a tree where each node has an additional ptr called “next” ptr. Initially this next ptr of every node is null. Write code such that each node’s next ptr should point to its next bfs node. 4. Trending tab related question: Given a large stream of strings, return the top 10 most frequently occurring string . (Hash map + min heap of size 10 is the solution.) Round 6: 1. Tell me about yourself 2. Why do u like Database Mgt System (I had DB in my areas of interest) 3. Design the backend of a social networking application (Eg : linked in) 4. All OS related qns 5. Network qns 6. Oops concepts with real time examples. 7. General technical questions. All Practice Problems for Amazon ! Comment More infoAdvertise with us Next Article Amazon Interview Experience | Set 426 (For SDE-1) Anonymous Improve Article Tags : Interview Experiences Experiences Amazon Practice Tags : Amazon Similar Reads Amazon Interview Experience | Set 353 (For SDE-2) I went through some interview rounds for SDE-2 in amazon. Below is the format. Round1: LCA of Binary tree Finding minimum cost to combine n pipes of different size. Round2: Behavioural question. Design Dating application. HLD, then specific discussion of profile search and ranking based on the users 1 min read Amazon Interview Experience | Set 308 (For SDE) I was recently interviewed for the position of SDE-1 at Amazon. It was a 3 round process: Round 1: On paper coding: Given a binary tree print it in vertical order. The problem is stated here: Print a Binary Tree in Vertical Order Given a linked list convert it into given format: 1->2->3->4- 1 min read Amazon Interview Experience | Set 260 (For SDE2) Online Coding Round: 1. Parenthesis Checker 2. Maximum Rectangular Area in a Histogram 1st Round: 1. Add two numbers represented by linked lists I gave recursion solution code. Then asked for optimized one. 2nd Round: 1. Detail overview of current project. roles and responsibilities. 2. Implementati 1 min read Amazon Interview Experience | Set 247 (For SDE 1) Round 1: Coding Round on paper 1 Add two numbers represented by linked lists 2 Spirally traversing a matrix Round 2: 1 Tell me about yourself?? 2 Row with max 1s Round 3: Hiring Manager Have you use what's app, there are some hints come when we start type. How these hints are coming.He asked me 1 to 1 min read Amazon Interview Experience | Set 426 (For SDE-1) Round 1:Written Round had 3 questions:- 1- Sum of two linked lists Don't remember the other 2. Round 2: DS algo 1-Find pair with given sum in bst 2-Transpose of the matrix Round 3: problem solving 1-Find top view of binary tree (Iterative approach) 2nd question was on matrix don't remember exactly 1 min read Amazon Interview Experience | Set 373 (For SDE 2) Round 1 Trapping rain water Total number of possible binary search trees with n keys , Just the formula and its derivation was discussed Round 2 Majority Element Boundary traversal of a binary tree Round 3 Discussion on my project, its design, challenges faced, what important decisions I took that w 1 min read Like