Open In App

Amazon Interview Experience | Set 360 (On-Campus)

Last Updated : 10 Jul, 2019
Improve
Improve
Like Article
Like
Save
Share
Report

Round 1: (Online Test)
Time: 1hr 30 mins on HackerEarth Platform
20 MCQ (Gen Apti, OS, TOC, Networks and DS)
Coding:

  1. Maximum non adjacent subsequence
    GeeksforGeeks Link
  2. Profit sort (Find no. of elements in the given range)

Round 2: (Problem Solving Round)

  1. Vertical Sum of Binary Tree.
    Discussion about various data structures that can be used. Finally came up with hash map.
  2. Width of Binary Tree
  3. How map is internally stored in C++?
  4. If N students in a class play a game against each other where each student plays against all other students in the class, find the total number of matches to be conducted.
    Also, if the class leader has to arrange the students in a line where each student would have lost the match with the student in front of him (Remember: student may or may not have won the match with the student front of front of him). Design a suitable data structure for maintaining such an order.


Round 3: (Data Structures and Algorithms Round)

  1. Project Discussion
  2. There are various libraries that a Kindle app may use. All these libraries must be linked appropriately to be included in Kindle. There will be dependencies between the libraries. Apply a suitable data structure such that a library cannot be added before its dependencies. I discussed a topological sort approach. Finally wrote code and tested the same.
  3. Discussion about second coding question asked in the online test. I was asked to bring up a better solution, given, that I can use extra space. I proposed an approach based on hashing and counting sort.
  4. Threads vs Process. They were impressed because I explained with a real-time example
  5. How the Program is stored in memory? Stack frame for Program?
  6. When two threads access a code at the same time, what happens. How is it prevented?
  7. Difference between mutex and semaphore.
  8. Priority Inheritance and Priority Inversion.


Round 4: (CS Fundamentals)

  1. Tell me about yourself
  2. Design a music player application
    I was asked to first list out all possible features to be added within 2mins time. I came up with around 30 features. The interviewer selected a few of those features and asked to draw a class diagram for the same.
  3. I have a DB of some size as of now. In future new DB with additional space will be added. How will the DB be modified? What to modify? How to scale it?
  4. Distributed computing concepts
  5. Multiple partitions in OS
  6. MVC design pattern
  7. My costliest mistake in life
  8. Asked something interesting about myself that others don’t have.
  9. Whether I like back-end or front end. Reason out.


Round 5: (Bar Raiser Round)

  1. Project Discussion
  2. There are k stars in the space and an origin star, find the nearest 100 stars from the origin star.
    I came up with brute force approach first.
    Later devised a max heap solution and coded the same
  3. Virtual Machine
  4. About AWS, S3
  5. Design Patterns. Asked to implement Singleton Design Pattern in Java
  6. Scheduling Algorithms. Which scheduling algorithm does modern operating systems use?
  7. Strength and weakness
  8. Latest technical knowledge that I gained. Recent technical article that I read.
  9. Maximum amount of code that I had ever written in college.
  10. Any Questions from my side?

I was one among the three to be selected from my college for Full Time SDE at Amazon


Previous Article
Next Article

Similar Reads

Amazon Interview Experience | Set 351 (Off Campus - For SDE I)
I attended the referral drive in Delhi, so we had to report to 10:00 AM at Amazon's office. ROUND 1: Written – Pen & Paper (11:00 - 12:00 PM) You have to write a short description first of your approach, put comments if necessary to explain that line's logic. Full Optimize Code should be written covering all the edge cases. Also mention the com
5 min read
Amazon Interview Experience | Set 376 (On Campus for Internship)
Amazon visited our campus(Jadavpur University) to recruit interns and FTEs. I'm sharing my internship interview experience. There were 3 rounds in all – 1 Online Round followed by 2 F2F Interviews. Online Round(90 min on Hackerearth): There were 20 questions mostly based on C, C++, DS, Reasoning and a few from OS, OOPS, DBMS etc and 2 coding questi
5 min read
Amazon interview Experience | Set 413 (SDET-1 On-Campus Internship)
This was a pool campus conducted by amazon for internship. Online Round: There were 20 mcq(+1 for each) and 2 coding questions(+30 for each). MCQ had more networking and DS problems. Given three linked list, add them. GeeksforGeeks Link Input will be of this format 1->0->1 8->9->9 5 Output: 1->0->0->5 Solving above problem in p
3 min read
Amazon interview Experience | Set 416 (On Campus for Internship)
Coding Round There were 2 coding questions (10 marks each) and 20 MCQ’s from various core concepts ( OS,DS,Algorithms,DB,C language etc ). Question 1 : https://www.geeksforgeeks.org/given-a-string-print-all-possible-palindromic-partition/ Given a string, find all possible palindromic partitions of given string. Question 2 : You are given with a lar
4 min read
Amazon Interview Experience | Set 432 (SDET Off – Campus)
My friend in Amazon referred me for the job . I was approached by the HR and after lots of delay (1 month), I was scheduled a Telephonic Interview. Round 1: (Telephonic Interview ) - 1h  A screen was shared (Notepad) where I will be writing codes and doing other rough work. I was doing conversation with him on phone. Given n sized stairs and we can
4 min read
Amazon interview Experience | Set 129 (For SDE 1 Off-Campus)
In the recent past, I attended interview with Amazon. Here is my interview experience. Written Round: 1.5 hours 1. Given an array of integers, replace each element with the next immediate greater element. 2. Given a linked list, reverse each 3 nodes. 3. Given a tree, print all the nodes which are K distance from the leaf nodes. Face to Face Intervi
5 min read
Amazon interview Experience | Set 134 (Off-Campus for SDE)
I would like to start off by thanking the entire community of GeeksforGeeks for helping me out. Attempt 1 Round1: 1. Given a number N, find the number of correct combination of parentheses possible. Input: N=2 => ()() Output: 2 [(()),()()] Input: N=3 => ()()() Output: 5 [()()(),((())),(())(),(()()),()(())] 2. Print all root to leaf paths usin
3 min read
Amazon interview Experience | Set 135 (On-Campus for SDE)
Recently, Amazon visited our campus and I was interviewed for SDE position. Here is my Interview Experience: Online Round: (Duration – 90 minutes) 20 MCQs and 2 coding questions. MCQs were on Algorithms, Time Complexity, Quantitative Aptitude, Probability, Operating Systems, Graphs, Data Structures, Recursion outputs etc. Coding Questions: 1. In on
3 min read
Amazon interview Experience | Set 142 (Off-Campus for SDE-1)
Round 1: Telephonic Q1. Implement some functionalities of Minesweeper like connected component search and game termination check etc. Q2. Linked list random pointer question: Clone a linked list with next and random pointer Q3. Given a matrix of 0s and 1s find the row that contains maximum number of 1s. Q4. Given a node in a binary tree, find all t
3 min read
Amazon Interview Experience | Set 143 (Off-Campus for SDE-1)
Experience: 5 months F2F: 1st round 1. Tell me about your college project. 2. Write a Code to check if linked list is a palindrome without using extra space. 3. Write a Code to print zizzag traversal of tree. F2F: 2nd round 1. Tell me about your college project. 2. Tell me about your current project. 3. Nodes of a binary tree are randomly inserted
2 min read
Practice Tags :