Amazon Interview Experience | Set 367 (On-Campus for Internship) Last Updated : 11 Jul, 2019 Comments Improve Suggest changes Like Article Like Report 1st ROUND(Online Round :90 min) There were 20 aptitude questions based on C, DS, OS, OOPS, and 2 coding questions. Coding Questions: Find nth Magic Number Count triplets with sum smaller than a given value Since coding questions were easy those who completed both coding questions and some aptitude questions were selected. Total 19 students were selected from this round. 2nd ROUND (TECHNICAL INTERVIEW :Around 1 hour) First he asked me a genuine question : "tell me about yourself". Find the intersection of two arrays .Initially i told him to use c++ map to hash, immediately he asked me to implement your own defined map,I was a little confused then he asked me to use hashmap and finally i solved this one.Interviewer was very co-operative. Solution: GeeksforGeeks Link Given a binary tree,print the nodes in spiral form.I solved this one immediately using two stacks, he was much impressed and told me to wait for next round. Solution: Level order traversal in a spiral form Total 6 students were selected for next round. 3rd ROUND (TECHNICAL INTERVIEW : Around 30 min) The interviewer was very cool. He immediately asked me questions: Find the rotation point in a rotated sorted array.It was a stright forward question on binary search. Solution: Find the Rotation Count in Rotated Sorted array Given a linked list separate even and odd numbered nodes such that even numbered nodes are at the front of the list and in order followed by odd numbered nodes. Since it was also a straight forward question. I explained two approaches and he was satisfied and asked me to code it. Solution: Segregate even and odd elements in Linked list Related Practice ProblemsCount triplets with sum smaller than X Comment More infoAdvertise with us Next Article Amazon Interview Experience | Set 386 (On Campus for Internship) Anonymous Improve Article Tags : Interview Experiences Amazon Practice Tags : Amazon Similar Reads Amazon Interview Experience | Set 363 (On-Campus for Internship) Round 1:online Test(90 min) 20 MCQs -15 Technical(DS,OS,NETWORK,PCD) -5 Aptitude 2 Coding Questions Finding duplicates in the given array,change that to 1,move all the 1's to the right side and the other elements are moved to right Pair sum count(to find the number of pairs present in the given arra 1 min read Amazon Interview Experience | Set 386 (On Campus for Internship) The first round was an online round. There were 2 coding questions and 20 MCQs. The MCQs consisted of both aptitude questions as well as technical questions. The students who did both the coding questions and half of the MCQs were chosen for the interview round. 25 students out of 200 students who g 2 min read Amazon Interview Experience | Set 277 (On-Campus for Internship) Recently Amazon visited our campus for interns and placements. For interns it consisted of 1 online + 2 technical rounds. Online:(90 mins) 20 MCQ'S based mainly on sorting, OS,Networks 2 coding questions: 1. Given a number find the next greatest number formed with same digits 2. Find the largest inc 1 min read Amazon Interview Experience | Set 279 (On-Campus for Internship) Recently Amazon visited our campus. There were total three rounds. First round was an online coding round conducted on Hackerrank, It consisted of 20 Mcqs based on Data Structures,Sorting Techniques,Operating systems,Networking and some aptitude questions along with 2 coding questions, The questions 2 min read Amazon Interview Experience | Set 207 (On-Campus for Internship) Cut off: 75%. Around 140 students were short listed. Round 1: 90 minutes It comprised of 20 MCQs on aptitude, operating system, DBMS, data structures and algorithms on Hackerrank. There were two coding questions 1. Given a string find the first non repeating character in it, O(n) was good enough. 2. 2 min read Amazon Interview Experience | Set 205 (On-Campus for Internship) Cut off: 75%. Around 140 students were short listed. Round 1: 90 minutes It comprised of 20 MCQs on aptitude, operating system, DBMS, data structures and algorithms on Hackerrank. There were two coding questions 1. Given a string find the first non repeating character in it, O(n) was good enough. 2. 2 min read Like