Add office photos
i
Amazon
CompareProud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
Amazon SDE-2 Interview Questions, Process, and Tips for Experienced
Top Amazon SDE-2 Interview Questions and Answers for Experienced
- Q1. Word Break You are given a non-empty string containing no spaces (say sentence) and a dictionary of list of non-empty strings (say the list of words). You are supposed to ...read more
- Q2. Ninja and the bulbs Ninja owns an electronic shop. In the shop, Ninja has 'N' bulbs. To sell these bulbs, Ninja has to check if they are of good quality. To check bulbs, ...read more
- Q3. Maximize the sum You are given two sorted arrays of distinct integers, ‘ARR1’ and ‘ARR2’. If you find a common element in both arrays, you can switch from one array to an ...read more
Amazon SDE-2 Interview Experiences for Experienced
4 interviews found
CodingNinjas
I was interviewed in Apr 2021.
(1 Question)
Round duration - 60 Minutes
Round difficulty - Medium
Timing: 10AM-11AM
Interviewer was quite supportive and helpful.
Environment was normal as usual and it was morning time
- Q1. Application Question
Design a system where user can upload, delete and share the video/image files.
And can immediately view the uploaded files on the different logged-in system
(2 Questions)
Round duration - 60 Minutes
Round difficulty - Medium
Timing: 11AM-12PM
The interviewer was SDE2
He was checking the code for edge cases and was hinting if required
- Q1. Implement a priority queue
Ninja is given a task to implement a priority queue using Heap data structure. The Ninja is busying preparing for the tournament., So he asked for your help.
Your task is to us...
- Ans. Array representation of heap
- Since the heap is maintained in the form of a complete binary tree, the heap can be easily represented in the form of an array.
- To keep the tree complete and shallow, while inserting a new element insert it in the leftmost vacant position in the last level i.e., at the end of our array, and perform some operation to maintain the property of the heap.
- Similarly, for deleting the maximum e...
- Q2. Ninja and the bulbs
Ninja owns an electronic shop. In the shop, Ninja has 'N' bulbs. To sell these bulbs, Ninja has to check if they are of good quality. To check bulbs, Ninja uses a unique techniq...
- Ans. Brute Force
Approach:
A brute force solution to this problem is to turn on and off the bulbs N time, then at last check the number of bulbs that are on.
Algorithm:
- Take a boolean array of ‘BULBS’ of size N+1.
- Itertate on ‘i’ from 1 to ‘N’
- Iterate on ‘j’ form ‘i’ to ‘N’ and each time increment ‘j’ as ‘j’ += ‘i’.
- if(BULBS[j] == true) then make it false.
- If (BULBS[j]==false) then make it true.
- Iterate on ‘j’ form ‘i’ to ‘N’ and each time increment ‘j’ as ‘j’ += ‘i’.
- Intialise a variable ‘COUNT’ =...
(1 Question)
Round duration - 60 Minutes
Round difficulty - Medium
Timing: 6PM-7PM
The interviewer was not interactive and didn't gave any feedback whatsoever.
It was Hiring Manager Round
Interviewer was Software Development Manager at Amazon
- Q1. Maximize the sum
You are given two sorted arrays of distinct integers, ‘ARR1’ and ‘ARR2’. If you find a common element in both arrays, you can switch from one array to another.
Your task is to find a pat...
- Ans. Recursive
In this problem, our primary focus is on the common elements i.e. an element that is present in both the arrays. Then, we have to decide whether we have to make a switch. So for that, first we store all the elements of ‘ARR1’ and ‘ARR2’ into ‘MAP1’ and ‘MAP2’ respectively.
Now we call our ‘maximiseSumHelper’ function. We call this function for both cases i.e starting with ‘ARR1’ and starting with ‘A...
Interview Preparation Tips
Tip 1 : Focus on internals of Data structure on how it actually works
Tip 2 : Implement the Data Structure from scratch, later you can use the inbuilt packages no problem but you must know the implementation
Tip 3 : Understand System Design concepts
Tip 1 : Highlight your contributions you made and how it impacted the business and be real
Tip 2 : Mention the improvement figures like x% reduction in page load size, improved SEO ranking by x figure, reduce memory usage by y%
Skills evaluated in this interview
I was interviewed before Sep 2020.
(2 Questions)
Round duration - 90 minutes
Round difficulty - Medium
- Q1. Number of Islands
You are given a 2-dimensional array/list having N rows and M columns, which is filled with ones(1) and zeroes(0). 1 signifies land, and 0 signifies water.
A cell is said to be connected...
- Ans.
I used DFS to find number of distinct components.
- Q2. Add First and Second Half
You are given a Singly Linked List of N nodes such that each node represents a single digit.
Your task is to return a node 'X', where 'X' represents the head of...
- Ans. Brute Force
In this approach, we will first iterate through the Linked List and find the length of the given Linked List. Then we will initialize two Linked List ‘HEAD1’ and ‘HEAD2’ to store the two numbers.
We will iterate on the Linked List till half-length and create a new list to store the first half with a head equal to ‘HEAD1’. Similarly, we will keep the second half in a new list with a head equals to ‘HEAD2...
(1 Question)
Round duration - 60 minutes
Round difficulty - Medium
- Q1. Next greater element
You are given an array arr of length N. You have to return a list of integers containing the NGE(next greater element) of each element of the given array. The NGE for an element X is t...
- Ans. Brute Force
- Initialise an array ans of length N to store the next greater number of arr[i] at index i.
- Traverse the given array and for every element at index I
- Initialise a variable next to -1.
- Run a loop from i+1 to N, and check whether the current element is greater than arr[i] then update the next to the current element and break the loop.
- Store next at ans[i].
- Return ans array.
O(1).
&nb...
(2 Questions)
Round duration - 60 Minutes
Round difficulty - Hard
- Q1. Word Break
You are given a non-empty string containing no spaces (say sentence) and a dictionary of list of non-empty strings (say the list of words). You are supposed to construct and return all possible...
- Ans.
Paraphrasing the solution in my words
Let's take an example. s="catsand" and wordDict = ["cat", "cats", "and", "sand"].
The solution starts by taking the string S( "catsand") initially finding whether whole string is present or not . IN this case it is not present in the dict.
Now breaking the string and then finding
s.substr( i) gives the substring from ith index till the end. so string word goes as
atsand // not present
ts... - Q2. Valid Parenthesis
You're given string ‘STR’ consisting solely of “{“, “}”, “(“, “)”, “[“ and “]” . Determine whether the parentheses are balanced.
Input Format:
The first line contains an Integer &... - Ans. Valid Parenthesis
Make use of the stack. Traverse the string and push the current character in the stack if it is an opening brace else pop from the stack If it is the corresponding starting brace for current closing brace then move to the next character of the string otherwise return false.
If after complete traversal if the stack is empty then the string is balanced else it is not balanced.
Pseudo Code:
- Decla...
(1 Question)
Round duration - 60 minutes
Round difficulty - Easy
- Q1. System Design
Design a local transport system like BMTC.
(1 Question)
Round duration - 60 minutes
Round difficulty - Easy
- Q1. Project Questions
It was mix of HLD, LLD design discussion of your project. Make sure you know enough about your projects. Questions asked were based on Amazon leadership principles. Amazon mainly focuses o...
- Ans.
Tip 1: Revolve your answers around amazon leadership principles.
Tip 2: Make sure you do have good knowledge of your projects.
Interview Preparation Tips
Tip 1 : Practice a lot.
Tip 2 : Focus on system design
Tip 3 : Focus on amazon Leadership principles.
Tip 1: Mention relevant details for job you are applying.
Tip 2: Be objective and concise.
Skills evaluated in this interview
Rachit Jain
Programming with Nisha
Amazon interview questions for designations
Top trending discussions
Interview questions from similar companies
(1 Question)
- Q1. Data structure related question
(2 Questions)
- Q1. Nodejs related questions
- Q2. Promises Async Await Events emitter
- Ans.
Promises, async/await, and event emitters are all ways to handle asynchronous operations in JavaScript.
Promises provide a way to handle asynchronous operations by returning a promise object that can be resolved or rejected.
Async/await is a syntax for working with promises that makes code easier to read and write.
Event emitters allow you to create custom events that can be triggered and listened for in your code.
(2 Questions)
- Q1. System design related question
- Q2. Design a system like facebook
- Ans.
Design a system like Facebook
Create a user registration and login system
Implement a news feed for users to see updates from friends
Allow users to create and join groups
Include features like messaging, commenting, and liking posts
Implement privacy settings for users to control who can see their content
(1 Question)
- Q1. System design and behavioral
Interview Preparation Tips
Practice some HLD questions
Microservices related conecpts
Skills evaluated in this interview
I was interviewed before Sep 2020.
(1 Question)
Round duration - 60 minutes
Round difficulty - Medium
It was a telephonic interview at 10 in the morning. Interviewer seemed cool.
- Q1. Algorithm to find best insert position in sorted array
You are given a sorted array 'A' of length 'N' with distinct integers and a target integer 'M'. You need to return the positio...
- Ans. Brute Force
- Iterate through the given array.
- If at any position i, we get A[i] ≥ M, return i.
- If there is no such position i, return N.
O(1).
As there is no extra space required.
Time Complexity: O(n)Explanation:O(N), where ‘N’ is the length of the given array.
We are traversing the array only once. Hence, the overall complexity is O(N).
- Iterate through the given array.
(2 Questions)
Round duration - 60 minutes
Round difficulty - Medium
The interview was in the morning at 10 AM in the office meeting room.
- Q1. Frontend and Backend Tasks
Given 2 arrays - frontend and backend tasks . each number in these array represents the complexity needed to run the task.There is a server that has to run these tasks., the serve...
- Ans.
Sort both arrays and start from one end of first and opposite end from second.and make pairs
I was trying to find the pairs as well as updating the max complexity needed but that approach was failing as it needed backtracking to correctly assign all the possible pairs.
The interviewer gave me a hint to solve it in parts-
First calculate the lowest complexity that the server can have(by using the same method mentioned abov - Q2. House robber
Mr. X is a professional robber planning to rob houses along a street. Each house has a certain amount of money hidden. All houses along this street are arranged in a circle. That means the fir...
- Ans.
Didn't get enough time to code the solution but explained the approach
We can do this using DP
We can maintain 2 arrays - one represents the ans if we start from first house and the other represents the answer if we start. from the second house.Then simply looping over the array and calculating these array's elements.
(1 Question)
Round duration - 60 minutes
Round difficulty - Medium
The interview was at 11 AM in the meeting office.
- Q1. Running median
You are given a stream of 'N' integers. For every 'i-th' integer added to the running list of integers, print the resulting median.
Print only the integer part of the media...
- Ans.
Started with the brute force solution of insertion sort
Interviewer asked to optimize.
Gave the solution which uses two heaps - max heap and min heap. the difference in size of both heaps cannot be more than 1. And we might need to remove elements from one heap to other heap as more input numbers are added
(1 Question)
Round duration - 60 minutes
Round difficulty - Medium
The interview was at 1 AM.
- Q1. System Design
Was asked to design a notification service for website like Facebook.
Whenever someone liked our post or commented on our post - Ans.
Tip 1: Asked a lot of questions to get clarity on the requirement
Tip 2: Keep in mind how to modularize the various components in the design
Tip 3: Mention the assumptions that you are taking
(1 Question)
Round duration - 60 minutes
Round difficulty - Easy
The meeting was at 2 PM in the office meeting room.
- Q1. Resume and Past Experience Based Questions
There were a lot of questions, related to my resume, past experience, the technologies i had worked on. And then there were questions regarding the technologies an...
- Ans.
Tip 1: Be truthful. Don't try to fake things you don't know about.
(1 Question)
Round duration - 60 minutes
Round difficulty - Easy
10 AM
- Q1. Project Discussion
Deeper discussion about all the projects i did in the past company.
- Ans.
Tip 1: Know well about the projects that you have done in the past
Interview Preparation Tips
Tip 1 : Be consistent in the preparation. Practice atleast one question everyday
Tip 2 : Make relevant notes that you can go through on the day before the interview
Tip 3 :Try to note your progress by giving timed contests
Tip 1 : Clearly mention the details of the projects that are relevant to the company that you are applying for
Tip 2 : Ensure that there are no grammatical mistakes and that you have highlighted the important keywords in your resume
Skills evaluated in this interview
Sdet Automation Test Engineer Interview Questions & Answers
Expedia Group
Anonymous
posted on 9 Feb 2024
I applied via LinkedIn and was interviewed in Jan 2024. There were 3 interview rounds.
Easy Interview basic questions
(1 Question)
- Q1. Desing Tic Tac Toe
(1 Question)
- Q1. Final Round behavioural questions
I applied via LinkedIn and was interviewed in Aug 2023. There were 3 interview rounds.
2 medium level and 1 hard question from dsa
(1 Question)
- Q1. Asked about myself and managerial questions
(1 Question)
- Q1. Data structure related question
(2 Questions)
- Q1. Nodejs related questions
- Q2. Promises Async Await Events emitter
- Ans.
Promises, async/await, and event emitters are all ways to handle asynchronous operations in JavaScript.
Promises provide a way to handle asynchronous operations by returning a promise object that can be resolved or rejected.
Async/await is a syntax for working with promises that makes code easier to read and write.
Event emitters allow you to create custom events that can be triggered and listened for in your code.
(2 Questions)
- Q1. System design related question
- Q2. Design a system like facebook
- Ans.
Design a system like Facebook
Create a user registration and login system
Implement a news feed for users to see updates from friends
Allow users to create and join groups
Include features like messaging, commenting, and liking posts
Implement privacy settings for users to control who can see their content
(1 Question)
- Q1. System design and behavioral
Interview Preparation Tips
Practice some HLD questions
Microservices related conecpts
Skills evaluated in this interview
I was interviewed before Sep 2020.
(1 Question)
Round duration - 60 minutes
Round difficulty - Easy
Timing: evening
Environment: Online round took at home
- Q1. Smallest Subarray with K Distinct Elements
Given an array 'A' consisting of 'N' integers, find the smallest subarray of 'A' containing exactly 'K' distinct integers.
Note ...
- Ans.
At first sight this can be solved easily by using two loops to iterate over contiguous subarrays in O(n^2) and counting number of arrays and breaking the outer loop if number of odds exceed 'k'.
Optimised solution is to take two pointer approach where right pointer is incremented till num of odds not exceed 'k'. If limit is reached, increment left pointer and add number of arrays (right - left+1)*(right-left)/2 to the r
(1 Question)
Round duration - 90 minutes
Round difficulty - Medium
Machine coding round
- Q1. Design and code publisher subscriber based messaging queue supporting following features:
Design and code publisher subscriber based messaging queue supporting following features:
1. New topic creation
2. Mul... - Ans.
1. I drafted LLD by defining classes - methods and members.
2. I discussed the approach and working of LLD to fit the given features
3. I live coded the classes and logic using core Java on my machine.
(1 Question)
Round duration - 60 minutes
Round difficulty - Medium
- Q1. Rat In a Maze All Paths
You are given a 'N' * 'N' maze with a rat placed at 'MAZE[0][0]'. Find and print all paths that rat can follow to reach its destination i.e. 'MAZE['N...
- Ans. Backtracking Approach
Initialize, all the cells of the solution matrix used to print the path matrix to 0. First, you cannot make use of the existing maze to print the solution maze as you have to distinguish b/w 1 of maze or 1 of ‘SOLUTION matrix.
Form a recursive function, which will follow a path and check if the path reaches the destination or not. If the path does not reach the destination then backtrack and t...
(1 Question)
Round duration - 60-90 minutes
Round difficulty - Medium
- Q1. Design stock exchange system
I was required to describe a typical stock exchange system design.
He asked me to begin with defining API contracts. Problem was open ended. Started with clarifying the scope and... - Ans.
Tip 1 : Revise general distributed system concepts thoroughly.
Tip 2 : Practice as many design problems as possible with time constraints. Try to discuss approaches with friends.
Tip 3 : Clarify as many doubts and assumptions as possible wit h the interviewer before jumping to the solution.
(1 Question)
Round duration - 60 minutes
Round difficulty - Medium
Hiring Manager round
- Q1. General Questions
1. Brief description of past work.
2. Recent challenging bug/issue solved.
3. Design description of one of the projects.
4. SDLC, tooling, agile related discussions. - Ans.
Tip 1 : Revisit and recollect your past experiences in detail with a focus on learnings, challenges, conflicts etc.
Tip 2 : Prepare general behavioural and situational questions for the role.
Interview Preparation Tips
Tip 1 : Do some basic research about the interview process and types of rounds while appearing for a company interview. Narrow down the topics and draft a realistic plan afterwards.
Tip 2 : Try to solve as many problems as possible as this is primarily what you will be doing in live interview rounds.
Tip 1 : Tailor your resume as per expectations from the role you are applying for.
Tip 2 : Order your experiences and skills by relevance.
Tip 3 : Try to fit the content in a single page.
Skills evaluated in this interview
Amazon Interview FAQs
Some of the top questions asked at the Amazon SDE-2 interview for experienced candidates -
Tell us how to improve this page.
Amazon Interviews By Designations
- Amazon Software Developer Interview Questions
- Amazon Customer Service Associate Interview Questions
- Amazon Transaction Risk Investigator Interview Questions
- Amazon Customer Service Executive Interview Questions
- Amazon Software Developer Intern Interview Questions
- Amazon Associate Interview Questions
- Amazon Seller Support Associate Interview Questions
- Amazon Software Engineer Interview Questions
- Show more
Interview Questions for Popular Designations
SDE-2 Interview Questions from Similar Companies
Fast track your campus placements
Amazon SDE-2 Reviews and Ratings
based on 18 reviews
Rating in categories
|
Customer Service Associate
4.1k
salaries
|  ₹0.6 L/yr - ₹6 L/yr |
|
Transaction Risk Investigator
3.1k
salaries
| ₹2.3 L/yr - ₹6.5 L/yr |
|
Associate
2.8k
salaries
| ₹0.8 L/yr - ₹6.9 L/yr |
|
Senior Associate
2.4k
salaries
| ₹2 L/yr - ₹10.1 L/yr |
|
Software Development Engineer
2k
salaries
| ₹16.3 L/yr - ₹33.7 L/yr |
Flipkart
TCS
Netflix
Calculate your in-hand salary
- Home >
- Interviews >
- Amazon Interview Questions >
- Amazon SDE-2 Interview Questions for Experienced
