Amazon Interview Questions and Answers That You Should Know Before Attending an Interview

Interviews are the first step to get a job. They play a key role in examining the skill set and competency one has. While giving the interview you must take care of all the necessary actions. Most of the questions asked in the interview are technical and situation-based, so for your easy understanding, this tutorial on Amazon Interview Questions dives into all the essential questions. After reading this tutorial on Amazon Interview Questions, you will feel more confident when you are giving the interview.

Firstly, look at Beginner Level Amazon Interview Questions.


Post Graduate Program: Full Stack Web Development

in Collaboration with Caltech CTMEEnroll Now
Post Graduate Program: Full Stack Web Development

1. Why do you want to join Amazon?

This is one of the most straightforward Amazon interview questions you might encounter. Here’s an answer to it:

  1. The company's growth is increasing rapidly every day, and Amazon has disrupted every industry it has set its foot in every sector in the world.
  2. It is really about putting yourself in the shoes of the consumer to win their trust and confidence towards the company and the skills in a personality.
  3. It also helps me to excel at immersing myself in new industries and applying that knowledge to deliver above-average results.

2. What are checked exceptions?

A checked exception is an exception that occurs at the compile-time; these exceptions are also called compile-time exceptions. The exceptions cannot simply be ignored at the time of compilation, and the programmer should take care of (handle) these exceptions.

For example:- If a file is to be opened, but the file was not found, an exception occurs. These exceptions that occurred cannot simply be ignored at the time of compilation.

3. What is hashing?

Hashing is a technique used to convert a range of key values into a range of indexes of an array. For example, you can create an associative data storage where the data index is found by providing its key values using the hash tables.

4. What is linear data structure?

A Linear data structure has data elements arranged in a sequential manner, and each element is connected to its previous and next element. Such data structures are easy to implement as computer memory is also sequential.

The examples of the linear data structure are Lists, Queue, Stack, Array, etc. 

5. What does algorithm mean?

An algorithm is a finite sequence of well-defined instructions, typically used to solve a class of specific problems or perform a computation. Algorithms are used as specifications for performing calculations, data processing, automated reasoning, automated decision-making, and other tasks. A heuristic, in contrast, is an approach to problem-solving that may not be fully specified or may not guarantee correct or optimal results, especially in problem domains where there is no well-defined correct or optimal result.

New Course: Full Stack Development for Beginners

Learn Git Command, Angular, NodeJS, Maven & MoreEnroll Now
New Course: Full Stack Development for Beginners

6. What is a search operation?

Search operation means whenever an element is to be searched, start searching from the root node, where the data is less than the key value, search for the element in the left subtree. Or, in simple terms, searching for the element in the right subtree.

7. What is the purpose of the "is" operator in Python?

The "is" keyword is used to test if two variables refer to the same object or not. The test returns the results true if the two objects are the same object and false if they are not referred to the same object or if the two objects are accurate. Use the == operator to test if two variables are equal.

8. What is data structure?

Data structure is a data organization and storage format that enables efficient access and modification of the data. And, a data structure is a collection of data values and the relationships among the data and the functions that can be applied over the data.

9. What is the difference between tuples and lists in Python?

The main differences between the lists and tuples are: lists are enclosed with ( [] ) square brackets and their elements, and the size can be changed when required. Tuples are enclosed in round or parentheses ( () )and cannot be updated. Tuples can be off as read-only lists.

10. What is the Tower of Hanoi?

The Tower of Hanoi is a puzzle consisting of three towers and more than one ring. Where all rings are of different sizes and stacked upon each other, the large disk is always below the small disk. The main aim is to move the disk tower from one peg to another without breaking its properties.

11. What is Collections API?

Collections API is a set of classes and interfaces that support operations on the collection of objects. The significant advantages of a collections API are that it provides interoperability between unrelated APIs.

12. Describe a time where you failed at something. How did you recover?

When I was managing a project for one of our biggest clients in my previous company, I was so eager to please them that I told them we could finish the project within three weeks. So, I took my experience and used it to become much better at managing clients' expectations during the project.

13. Tell something about you which is not included in your resume?

  1. Mention something you achieved at your current job that's so recent and not included in your resume.
  2. Talk about a volunteering experience that you can relate to the position.
  3. Stress is a strength or skill that's essential to the current position.

Full Stack Web Developer Course

To become an expert in MEAN StackView Course
Full Stack Web Developer Course

14. What is BFS?

Breadth-First Search algorithm is used in searching for a tree data structure for a node satisfying the given property. The algorithm begins at the tree root and goes further to explore all the tree nodes at present depth before it moves on to the nodes at the next depth level. The extra memory, usually a queue, should be needed to keep track of the child nodes that were encountered but not explored.

15. Why should we hire you?

As some right out of college, I am on the lookout for opportunities to prove my ability. As a part of this organization, I'll put all my efforts and strengths to make your company reach outstanding achievements, and if you hire me, I will get an opportunity to build my professional experience through your company.

These are a few Beginner Level Amazon Interview Questions. Now, jump on to the Intermediate level Amazon Interview Questions in this tutorial.

16. What is a Heap in Data Structure?

Heap is a balanced binary tree data structure where the root-node key is compared with its children and is arranged accordingly. A min-heap, a parent node has a key-value less than its child’s, and a max-heap parent node has a value greater than its child’s.

17. What does success mean to you?

In my point of view, I define success as fulfilling my role in my team and the company. I trust that my employer has placed me in a position where I can achieve the goals of the company and my team. So I work toward completing my duties as effectively as possible.

18. How does Prim's algorithm find spanning trees?

The Prim's algorithm considers the nodes to be part of a single tree and adds new nodes to the spanning tree from the given graph.

19. What is synchronization?

Synchronization is the capability to control the access of multiple threads to the shared resources. Synchronized keyword in Java provides locking that ensures exclusive mutual access of shared resources and prevents data race.

20. List a few advantages of Packages in Java?

  1. Packages in Java avoid name clashes.
  2. Packages in Java also provide easier access control.
  3. It is easy to locate the related classes using packages in Java.

FREE Java Certification Training

Learn A-Z of Java like never beforeEnroll Now
FREE Java Certification Training

21. What is Tree Traversal?

Tree traversal is a process of visiting all the nodes of a tree. All the nodes are connected via edges (links), where we always start from the root (head) of the node.

The three ways to traverse a tree:

  1. In-order Traversal
  2. Pre-order Traversal
  3. Post-order Traversal

22. Why did you decide to go into IT?

While technical skills can get you far, there's a lot in IT work that can be learned on the job. Because of this, employers might look for somebody who has other qualities that can be linked to success, like passion and curiosity. So this question can also be a way for employers to get to know you and your story.

23. What are your salary expectations?

For these kinds of questions, rather than offering a set number of the salary you expect, provide a range in which you'd like your salary to fall. And also, try to keep your range tight rather than very wide.

For example, if you want to make $80,000 a year, an excellent range to offer would be $75,000 to $90,000.

24. What does success mean to you?

 In my point of view, I define success as fulfilling my role in my team and the company. I trust that my employer has placed me in a position where I can achieve the goals of the company and my team. So I work toward completing my duties as effectively as possible.

25. What is Database?

A Database is a collection of the data that is stored and accessed by the computer system, and designed by formal design and modeling techniques. 

26. Describe yourself in five words?

Give a response like the following:  

  • Creative
  • Diligent
  • Honest
  • Friendly
  • Loyal

27. How does Kruskal's algorithm work?

The working of Kruskal's algorithm treats the graph as a forest and every node as an individual tree. A tree that connects to another only if it has the least cost among all available options and does not violate MST properties.

Full Stack Java Developer Course

In Partnership with HIRIST and HackerEarthEXPLORE COURSE
Full Stack Java Developer Course

28. How does depth-first traversal work?

The Depth First Search algorithm algorithm traverses a graph in a depthward motion and remembers the stack to get the next vertex to start a search when a dead end occurs in any iteration.

29. What was the biggest mistake of your life?

For these kinds of questions, one of the best ways to answer is to talk about a specific example of a time when you made a mistake. Explain what the mistake was and elaborate a little about it. Quickly switch over what you learned and how you improved after making that mistake.

30. What is shell sort?

Shell sort can be said as a variant of insertion sort. It divides the list into smaller sublists based on some gap variable, and then each sub-list is sorted using insertion sort. In some cases, it can also perform up to 0(n log n).

31. Mention some examples of greedy algorithms?

Examples of greedy algorithms are:  

  1. Kruskal's Minimal Spanning Tree Algorithm
  2. Travelling Salesman Problem
  3. Knapsack Problem
  4. Prim's Minimal Spanning Tree Algorithm
  5. Job Scheduling Problem
  6. Dijkstra's Minimal Spanning Tree Algorithm
  7. Graph - Map Coloring
  8. Graph - Vertex Cover

32. What is a recursive function?

A recursive function is a function that calls itself directly or calls a function that in turn calls it.

Every recursive function follows the recursive properties base criteria where functions stop calling itself and progressive approach where the function tries to meet the base criteria in each iteration.

33. List the types of Data Structures? 

Data structures are divided into two categories: 

  • Linear Data Structure
  • Non-Linear Data Structure

34. What are your strengths?

The answer to this amazon interview question could be:  

  1. Creativity
  2. Discipline
  3. Patience
  4. Determination
  5. Dedication
  6. Honesty

35. What are the situations that make you angry?

For these kinds of questions, briefly mention the situation that agitated you and then move on to the solution. Every interviewer appreciates a problem-solving attitude or bent-of-mind. Do not over exaggerate about you being a calm and professional person.

36. State the properties of B Tree.

The properties of B Tree are: 

  1. Every node in a B-Tree contains at most m children.
  2. Every node in a B-Tree except the root node and the leaf node contains at least an m/2 children.
  3. The root nodes in B-Tree must have at least two nodes.

37. Which is more important: money or work?

In my point of view work is more important to me. Once you achieve and overperform the target and help increase the company's growth, then definitely money will follow.

These are a few Intermediate Level Amazon Interview Questions. Now, understand the Advanced Level Amazon Interview Questions.

Free Course: Programming Fundamentals

Learn the Basics of ProgrammingEnroll Now
Free Course: Programming Fundamentals

38. Mention some examples of dynamic programming algorithms?

  1. Knapsack problem
  2. Shortest path by Dijkstra
  3. Tower of Hanoi
  4. Project scheduling
  5. Floyd-Warshall
  6. Fibonacci number series

39. What is a queue in Data Structure?

Queue in a data structure is an abstract data structure. In contrast to stack, where the queue is opened at both ends, one end is mainly used to insert data (enqueue), while the other to remove data (dequeue). Queue follows FIFO methodology, and the data item stored first will be accessed first.

40. Mention the use of a default constructor in Java?

The purpose of the default constructor in Java is to assign the default value to the objects. Java compiler always creates a default constructor implicitly if there is no constructor present in the class.

41. What is a postfix expression?

An expression in which the operators follow the operands is known as postfix expression. The benefit of this form is that there is no need to group sub-expressions in parentheses or consider operator precedence.

In postfix notation, the expression "a + b" will be represented as "ab+".

42. What is meant by Selection Sort?

Selection sort is an in-place sorting technique. It splits the data set into sub-lists known as sorted and unsorted. Then it selects the minimum element from the unsorted sub-list and places it into the sorted list. This iterates unless all the elements from the unsorted sub-list are consumed into a sorted sub-list.

43. Write a code for Inserting a node?

class Node:

def __init__(self, data): = data = None 

class LinkedList:

def __init__(self):

self.head = None

44. What is merge sort, and how does it work?

Merge sort is a sorting algorithm based on the divide and conquers programming approach. Merge sort keeps dividing the list into smaller sub-list until all sub-list have only one element. And then, it merges them in a sorted way until all sub-lists are consumed. It has a run-time complexity of 0(n log n), and it needs 0(n) auxiliary space.

45. Tell me about a time you could not finish a project and had to pivot quickly. How did you handle it?

At my last job, I led a project that was near completion. When everything was moving smoothly and on target for timely completion, then one of our partners provided one of the software upgrades that were to occur at the 90 percent mark and encountered a breach of systems and was estimated to be delayed by two to four weeks. Instead, we could allocate two resources to support the provider and help to recover from the breach in less than half of the projected time.

46. Why did you leave your Last Job?

The best way to answer these questions is, to be honest. Try not to forget to add your learnings from the situation and how you have overcome those problems.

Take care of yourself not to speak ill of your former employer, colleagues, or the job. Your attempt and approach should be to make the answer as positive as you can. So, it will be beneficial to make a good impression on you.

47. Count possible paths in an mXn matrix from top left to bottom right?

class Tree {

static int numberOfPaths(int a, int b)


if (a == 1 || b == 1)

return 1;

return numberOfPaths(a- 1, b) + numberOfPaths(a, b - 1);  


public static void main(String args[])


System.out.println(numberOfPaths(3, 3));


48. Write a function to give the sum of all the numbers in the list?

def sum(numbers):

total = 0 for num in numbers:


print(''Sum of the numbers: '', total)

sum((10, 20, 30, 40, 0, 50))

49. How to Split String in Java?

public class Split {

  public static void main(String args[])


  String str = "Simplielearn";

  String[] arrOfStr = str.split("e", 2);

  for (String a : arrOfStr)




50. Write a code to find the factorial?

class Factorial


 public static void main(String args[])


  int i, fact=1;  

  int number=5;   

  for(i=1; i<=number; i++){    



  System.out.println("Factorial of "+number+" is "+fact);    



Advance your career as a MEAN stack developer with the Full Stack Web Developer - MEAN Stack Master's Program. Enroll now!


These are the top 50 Amazon Interview questions and answers that would give you an idea of what questions could be asked in the Amazon interview, and you need to prepare.

If you are planning to learn coding and programming, consider enrolling in Simplilearn's programming and web development courses. These globally-recognized programs are designed to give you the right experience in coding and programming, and excel in your career.

If you have any questions on the article Amazon Interview Questions, you can let us know in the comment section below and our experts will answer you soon.

About the Author

Hemant DeshpandeHemant Deshpande

Hemant Deshpande, PMP has more than 17 years of experience working for various global MNC's. He has more than 10 years of experience in managing large transformation programs for Fortune 500 clients across verticals such as Banking, Finance, Insurance, Healthcare, Telecom and others. During his career he has worked across the geographies - North America, Europe, Middle East, and Asia Pacific. Hemant is an internationally Certified Executive Coach (CCA/ICF Approved) working with corporate leaders. He also provides Management Consulting and Training services. He is passionate about writing and regularly blogs and writes content for top websites. His motto in life - Making a positive difference.

View More
  • Disclaimer
  • PMP, PMI, PMBOK, CAPM, PgMP, PfMP, ACP, PBA, RMP, SP, and OPM3 are registered marks of the Project Management Institute, Inc.