Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by Amazon Team. If you also belong to the team, you can get access from here

Amazon Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Clear (1)

Amazon SDE Interview Questions, Process, and Tips

Updated 12 Jan 2025

Top Amazon SDE Interview Questions and Answers

  • Q1. There is a 12 km road and a contractor who is in-charge of repairing it. Contractor updates you about the work which is done in patches. Like “Road between 3.2 km to 7.9 ...read more
  • Q2. There are n nuts and n bolts represented in two different arrays and a function is_fit(nut_i, bolt_j) which returns 0 if its perfectly fit, 1 if it’s a tight fit and -1 i ...read more
  • Q3. A stream of data is coming. Maintain records in a page and mechanism to see previous and next page. (Concept of Doubly Linked List) (It is always advisable to ask questio ...read more
View all 47 questions

Amazon SDE Interview Experiences

44 interviews found

SDE Interview Questions & Answers

user image Anonymous

posted on 25 May 2015

Interview Preparation Tips

Round: Telephonic round
Experience: 1. An array is given with element name and their respective pH values. Print the combination of 2 elements which make a neutral compound.

A discussion started and best solution was O(n) time complexity and O(1) space complexity.

Then I got call for F2F interviews and here are those-

Round: Technical Interview
Experience: 1. Print Matrix in spiral form.

2. A store have n customers and any 1 can visit them any time through out the year.Data is stored in a file.Design a data structure to find given person visited on so n so date or not.

Round: Technical Interview
Experience: 1.There are N packages P1, P2…Pn. A package may depend on another or many other for its compilation. Given a matrix of dependency, find a sequence of package compilation.

2.A 2D matrix is given, with each elements representing number of gold coin at that position. I have to travel from (0,0) to last element of matrix collecting maximum no. of coins.I can travel either right of an element or down of it.

3.In Galaxy there are trillions of stars. I am provide distance of every star from earth. Tell me nearest 1Million stars to earth, provided with best time and space complexity.

Round: Technical Interview
Experience: 1. Implement LRU.

2.In Android phones we have 3X3 grid for making a pattern. Given a length, find number of combinations for that length in that grid.

Round: HR Interview
Experience: 1. Project deep discussion.
2. Few given scenarios and how you will tackle.
3. Strengths and weaknesses.
4. Given a file with many statements. Print all the strings with their anagrams through the file.Logic to check anagrams and to store them

Round: Technical Interview
Experience: 1. Behavioral Questions like
>Why you want to leave your organization?
>What is most challenging work you have done till date?
>Why you want to join Amazon?
etc.
2. Which data structure you know?
3.Say I have few words and their meaning, and I want to store them which DS will you use and why.
I started with Hashmap and we kept on discussing about pros and cons.Finally ended up with trie.He asked me to write code for it, for adding new word and for fetching meaning from Trie.The whole process started in 1st week and yesterday got a call from HR for I am invited to be part of Amazon.

College Name: NA

SDE Interview Questions & Answers

user image Anonymous

posted on 7 Jun 2015

Interview Questionnaire 

11 Questions

  • Q1. Heaps-insertion
  • Q2. Advantages of heaps over arrays
  • Ans. 

    Heaps allow efficient insertion and deletion of elements, unlike arrays.

    • Heaps are useful for implementing priority queues.

    • Insertion and deletion of elements in a heap take O(log n) time, while in an array it takes O(n) time.

    • Heaps are dynamically resizable, unlike arrays which have a fixed size.

    • Heaps can be used to efficiently find the kth largest/smallest element in an array.

    • Examples of heap data structures include bin

  • Answered by AI
  • Q3. Find 2nd min element from given array
  • Ans. 

    Find the 2nd minimum element from an array.

    • Sort the array and return the second element.

    • Use a loop to find the minimum and second minimum elements.

    • Initialize two variables to store the minimum and second minimum elements.

  • Answered by AI
  • Q4. Given an array and a sum s find all pairs of numbers which whoose sum=s
  • Q5. Given a tree construct a mirror tree and return root of mirror tree
  • Ans. 

    Construct a mirror tree from a given tree and return the root of the mirror tree.

    • Traverse the given tree in a recursive manner.

    • Swap the left and right child of each node.

    • Return the root of the mirror tree.

  • Answered by AI
  • Q6. Level order traversal of a tree
  • Ans. 

    Level order traversal of a tree is a method to visit all the nodes of a tree level by level.

    • Use a queue to store the nodes of the tree

    • Start with the root node and enqueue it

    • While the queue is not empty, dequeue a node and visit it

    • Enqueue the left and right child of the visited node if they exist

    • Repeat until all nodes are visited

  • Answered by AI
  • Q7. Given a stack output a sorted stack.(hint use recursion)
  • Ans. 

    Sort a stack using recursion.

    • Pop the top element from the stack and recursively sort the remaining stack.

    • Insert the popped element in the correct position in the sorted stack.

    • Repeat until the entire stack is sorted.

    • Use a helper function to insert the element in the correct position.

    • Time complexity: O(n^2), space complexity: O(n) due to recursion.

    • Example: Input stack - [5, 2, 7, 1], Output stack - [1, 2, 5, 7]

  • Answered by AI
  • Q8. Given a tree populate the sibiling of the tree node with the next node in same level.space complexity-O(1)
  • Ans. 

    Populate sibling of a tree node with next node in same level with O(1) space complexity.

    • Traverse the tree level by level using BFS.

    • For each node, check if it has a sibling to its right.

    • If yes, populate the sibling pointer of the current node with the right sibling.

    • If no, move to the next level.

    • Repeat until all levels are traversed.

  • Answered by AI
  • Q9. What happens when you type amazon.com in browser
  • Ans. 

    When you type amazon.com in a browser, it sends a request to the Amazon servers, which then respond by sending back the website's content to be displayed on your screen.

    • Browser sends a DNS request to resolve the domain name 'amazon.com' to an IP address

    • Browser establishes a TCP connection with the Amazon servers

    • Browser sends an HTTP request to the Amazon servers for the website content

    • Amazon servers process the request...

  • Answered by AI
  • Q10. Linked list problem -----/
  • Q11. A simple problem in linked list

Interview Preparation Tips

Round: Test
Total Questions: 29

Round: Technical Interview
Tips: assume array is already sorted)space complexity-O(1),time complexity-O(n)

College Name: NA

Skills evaluated in this interview

SDE Interview Questions Asked at Other Companies

asked in Infosys
Q1. Return Subsets Sum to K Problem Statement Given an integer array ... read more
asked in Nagarro
Q2. Partition to K Equal Sum Subsets Problem Given an array of intege ... read more
asked in Nagarro
Q3. Sort a "K" Sorted Doubly Linked List Given a doubly-linked list w ... read more
asked in Nagarro
Q4. Maximum Meetings Selection You are tasked with scheduling meeting ... read more
asked in Amazon
Q5. There is a 12 km road and a contractor who is in-charge of repair ... read more

SDE Interview Questions & Answers

user image Anonymous

posted on 21 May 2015

Interview Questionnaire 

14 Questions

  • Q1. There is a 12 km road and a contractor who is in-charge of repairing it. Contractor updates you about the work which is done in patches. Like “Road between 3.2 km to 7.9 km repaired ”, “Road between 1.21 k...
  • Ans. 

    The longest continuous patch of a road being repaired by a contractor is determined.

    • Iterate through the updates and keep track of the start and end points of each patch

    • Calculate the length of each patch and update the longest patch if necessary

    • Return the start and end points of the longest patch

  • Answered by AI
  • Q2. Several Questions were asked from my project
  • Q3. There are billions and billions of stars and at any point of time you need to tell the closest million to earth. In what way I should take input for the stars and what all do I need to represent one. I use...
  • Q4. Implementation of Least Recently Used Cache. I started with O(n) solution using queue and ended up with O(1) solution using heap and doubly linked list
  • Q5. Basically it was from snakes and ladders game. There is n x n matrix and you are at starting position. What is the no. of ways to reach n-square position if your next move will be dependent on number on di...
  • Q6. Write an efficient program to count number tree structures that can be made using n number of nodes. Basically T(n)=summation (T(i) * T(n-i-1)). I used DP as there are a lot of sub-problems used again and ...
  • Ans. 

    The program counts the number of tree structures that can be made using n nodes.

    • Use dynamic programming to solve the problem efficiently

    • Break down the problem into subproblems and store their solutions in an array

    • Iterate through the array to calculate the number of tree structures

    • The time complexity of the program is O(n^2)

  • Answered by AI
  • Q7. There are n nuts and n bolts represented in two different arrays and a function is_fit(nut_i, bolt_j) which returns 0 if its perfectly fit, 1 if it’s a tight fit and -1 if its loose fit. I was asked to arr...
  • Ans. 

    Arrange nuts and bolts so that every nut fits perfectly with the bolt in the same position.

    • Sort both arrays in the same order using a comparison function

    • Use a binary search to find the matching bolt for each nut

    • Repeat until all nuts are matched with bolts

  • Answered by AI
  • Q8. Find the kth largest element in a BST. Well that was easy JWe discussed about projects and he asked reasons for leaving present company
  • Q9. How to know the time between someone writes Amazon.com and the page appears on his browser for a particular user. I impressed him by suggesting to use dummy request packets after the page is loaded complet...
  • Q10. He showed me the Amazon page they were working at that time and I asked me to suggest 5 changes in 5 minutes
  • Q11. Behavioral questions like dealing with manager in case of conflicts,
  • Q12. Why would you choose Amazon and not Flipkart if you have offers from both
  • Q13. About my projects and contribution to present company
  • Q14. Reasons for leaving present company, ,
  • Ans. 

    Seeking new challenges and growth opportunities

    • Desire for career advancement

    • Limited growth opportunities in current role

    • Seeking new challenges and learning experiences

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: Q1. Given a string you need to print all possible strings that can be made by placing spaces (zero or one) in between them. For example : ABC -> A BC, AB C, ABC, A B CQ2. Given a tree where there are three pointers (left_pointer, right_pointer and a next_right_pointer). Left and right pointers are set like that of any general binary tree. We were asked to set the next_right_pointer to the next node in the level order traversal for the same level. This implies means for the last node in every level it will be null for rest it will be pointer to the next node in level order traversal.
Duration: 60 minutes
Total Questions: 2

General Tips: TIPS:1. Don’t jump into solutions, ask about the type of input that is given and output that is expected.2. The interviewer always tries to take you to the most optimal solution so listen to what all he says. Many a times they are big hints !!!3.Be honest.4. Keep believing that you will get the job .
College Name: NA

Skills evaluated in this interview

SDE Interview Questions & Answers

user image Anonymous

posted on 22 May 2015

Interview Questionnaire 

15 Questions

  • Q1. What is the definition of tree ?
  • Ans. 

    A tree is a data structure consisting of nodes connected by edges, with a single root node and no cycles.

    • Nodes represent elements of the tree, and edges represent the relationships between them.

    • Each node can have zero or more child nodes, and each child node can have its own children.

    • Trees are commonly used in computer science for organizing and searching data, such as in binary search trees.

    • Examples of trees include f...

  • Answered by AI
  • Q2. What are the differences between graph and tree?
  • Ans. 

    Graphs are non-linear data structures with cycles while trees are hierarchical data structures without cycles.

    • Graphs can have cycles while trees cannot

    • Graphs can have multiple root nodes while trees have only one

    • Graphs can have disconnected components while trees are always connected

    • Graphs can have directed or undirected edges while trees have only directed edges

    • Examples of graphs include social networks, road networks...

  • Answered by AI
  • Q3. When can you say a graph to be a tree?
  • Ans. 

    A graph can be called a tree if it is connected and has no cycles.

    • A tree is a type of graph with no cycles.

    • It must be connected, meaning there is a path between any two vertices.

    • It has n-1 edges, where n is the number of vertices.

    • Examples include family trees, file directory structures, and decision trees.

  • Answered by AI
  • Q4. Write a program to show whether a graph is a tree or not using adjacency matrix
  • Ans. 

    Program to determine if a graph is a tree using adjacency matrix

    • A graph is a tree if it is connected and has no cycles

    • Check if the graph is connected by performing a depth-first search or breadth-first search

    • Check if the graph has cycles by performing a depth-first search and tracking visited nodes

  • Answered by AI
  • Q5. Did u ask your current company to provide that type of work as u r looking in Amazon?
  • Q6. Why Amazon ?
  • Q7. Lots of questions on my current work and tools which I was using
  • Q8. Why do I want to leave my current company on such a short interval of 5 months
  • Ans. 

    Seeking better growth opportunities and a more challenging role.

    • Limited growth opportunities in my current company

    • Looking for a more challenging role to enhance my skills

    • Seeking a company with a better work culture and values

    • Exploring options that align better with my long-term career goals

  • Answered by AI
  • Q9. A stream of data is coming. Maintain records in a page and mechanism to see previous and next page. (Concept of Doubly Linked List) (It is always advisable to ask questions in design questions. The intervi...
  • Ans. 

    A thread is a unit of execution within a process that can run independently and concurrently with other threads.

    • Threads allow for concurrent execution of tasks within a program.

    • Threads share the same memory space and resources of the process they belong to.

    • Threads can communicate and synchronize with each other through shared data structures like locks and semaphores.

    • Threads can improve performance by utilizing multipl...

  • Answered by AI
  • Q10. What is the meaning of memory leakage?
  • Ans. 

    Memory leakage is a situation where a program fails to release memory it no longer needs.

    • Memory leakage can cause a program to slow down or crash due to insufficient memory.

    • It is caused by programming errors such as not freeing allocated memory or losing references to it.

    • Examples include forgetting to close a file or database connection, or not releasing memory allocated for a variable.

    • Memory leakage can be detected us...

  • Answered by AI
  • Q11. Design a system for finding the costliest element always whenever we pick up an element from a box.(concept of Max Heap)
  • Ans. 

    Design a system using Max Heap to find the costliest element from a box when an element is picked.

    • Implement a Max Heap data structure to store the elements in the box.

    • Whenever an element is picked, the costliest element can be found at the root of the Max Heap.

    • After picking an element, update the Max Heap by removing the root and reorganizing the heap.

    • Ensure the Max Heap property is maintained during insertion and dele...

  • Answered by AI
  • Q12. What inspires you to join Amazon? Why dream company ?
  • Q13. Connect Sibling pointers. I gave a Level Order Traversal solution. He asked to do it in O(1) space complexity. I explained the approach but messed up In writing the working code for that
  • Q14. Explain the approach of LRU cache and implement using object oriented language
  • Ans. 

    LRU cache is a data structure that stores most recently used items and discards least recently used items.

    • LRU stands for Least Recently Used

    • It is implemented using a doubly linked list and a hash map

    • When an item is accessed, it is moved to the front of the list

    • When the cache is full, the least recently used item is removed from the end of the list

    • Example: A web browser cache that stores recently visited web pages

  • Answered by AI
  • Q15. OS questions

Interview Preparation Tips

Round: Test
Experience: 1. Convert Binary tree to linked list.

2. Rotate a matrix by 90 degree.

There were 2 more questions. But I forgot what were they?

Round: TECHNICAL INTERVIEW
Experience: Overview of current job responsibilities and internship project.

1. Convert a tree to a sum tree.Example :

1 27

/ /

2 3 -------> 9 13

/ / / /

4 5 6 7 0 0 0 0 Always take care of all the corner cases

2. Print a pascal tree .

3. Given a 2D matrix sorted row wise and column wise . Print the matrix in sorted way. (Can be done using Min Heap).

For all the questions, complexity of the program was asked and was being asked to improve both time and space complexity.

Round: TECHNICAL INTERVIEW
Experience: Many questions regarding my current project, tools and technology I am working on.

1. Convert a binary tree to a sum tree . Here he had a new meaning of sum tree.

Example :Example :

1 1

/ /

2 3 -------> 2 5

/ / / /

4 5 6 7 4 9 15 22 (I did it with Level Order Traversal) (Complete working code was required)

2. Given an array of integers. Find the largest 3 element. (Can be done using Max Heap in less time complexity)

College Name: NA

Skills evaluated in this interview

Amazon interview questions for designations

 SDE Intern

 (15)

 SDE-2

 (14)

 SDE-1 Position

 (2)

 SDE (Software Development Engineer)

 (22)

 Customer Service Associate

 (156)

 Customer Service Executive

 (102)

 Transaction Risk Investigator

 (102)

 Associate

 (87)

SDE Jobs at Amazon

View all
Contribute & help others!
anonymous
You can choose to be anonymous

Amazon Interview FAQs

How many rounds are there in Amazon SDE interview?
Amazon interview process usually has 2-3 rounds. The most common rounds in the Amazon interview process are Coding Test, Technical and Resume Shortlist.
How to prepare for Amazon SDE interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at Amazon. The most common topics and skills that interviewers at Amazon expect are C++, Algorithms, Java, Analytical Chemistry and Architectural Design.
What are the top questions asked in Amazon SDE interview?

Some of the top questions asked at the Amazon SDE interview -

  1. There is a 12 km road and a contractor who is in-charge of repairing it. Contra...read more
  2. There are n nuts and n bolts represented in two different arrays and a function...read more
  3. A stream of data is coming. Maintain records in a page and mechanism to see pre...read more
How long is the Amazon SDE interview process?

The duration of Amazon SDE interview process can vary, but typically it takes about less than 2 weeks to complete.

Recently Viewed

SALARIES

Zee Entertainment Enterprises

No Salaries

REVIEWS

Amazon

No Reviews

INTERVIEWS

Ramoji Film City

No Interviews

COMPANY BENEFITS

Zee Entertainment Enterprises

No Benefits

REVIEWS

Jio

No Reviews

INTERVIEWS

Park Plus

No Interviews

REVIEWS

Viacom18 Media

No Reviews

JOBS

Amazon

No Jobs

PHOTOS

Viacom18 Media

No Photos

Tell us how to improve this page.

Amazon SDE Interview Process

based on 35 interviews

4 Interview rounds

  • Coding Test Round - 1
  • Technical Round - 1
  • Coding Test Round - 2
  • Technical Round - 2
View more

SDE Interview Questions from Similar Companies

Flipkart SDE Interview Questions
4.0
 • 5 Interviews
Myntra SDE Interview Questions
4.0
 • 3 Interviews
Paytm SDE Interview Questions
3.3
 • 2 Interviews
Uber SDE Interview Questions
4.2
 • 2 Interviews
Snapdeal SDE Interview Questions
3.8
 • 1 Interview
Blinkit SDE Interview Questions
3.7
 • 1 Interview
LinkedIn SDE Interview Questions
4.3
 • 1 Interview
Facebook SDE Interview Questions
4.3
 • 1 Interview
View all
Amazon SDE Salary
based on 313 salaries
₹12 L/yr - ₹50 L/yr
45% more than the average SDE Salary in India
View more details

Amazon SDE Reviews and Ratings

based on 26 reviews

3.5/5

Rating in categories

3.5

Skill development

3.1

Work-life balance

3.9

Salary

2.5

Job security

3.4

Company culture

3.1

Promotions

3.3

Work satisfaction

Explore 26 Reviews and Ratings
SDE

Hyderabad / Secunderabad

0-7 Yrs

Not Disclosed

SDE

Hyderabad / Secunderabad

0-7 Yrs

Not Disclosed

SDE

Chennai

3-10 Yrs

Not Disclosed

Explore more jobs
Customer Service Associate
4.2k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Transaction Risk Investigator
3.1k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Associate
2.8k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Associate
2.5k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Program Manager
2.1k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Amazon with

Flipkart

4.0
Compare

TCS

3.7
Compare

Google

4.4
Compare

Netflix

4.5
Compare
Did you find this page helpful?
Yes No
write
Share an Interview