Amazon SDE Sheet: Interview Questions and Answers 2024
Last Updated :
24 Jul, 2025
Amazon SDE sheet is the collection of the most important topics or the most frequently asked question in Amazon Software Development Engineer Interviews. Here we have collected all the interview questions and answers to land a job on Amazon
Amazon is an American multinational technology company that focuses on e-commerce, cloud computing, digital streaming, and artificial intelligence. To get employed by Amazon is a dream for many. One must have clear Data Structure concepts, good communication skills, and analytical thinking and should be able to solve real-world problems to crack top companies like Amazon. Steps to follow to get a chance at Amazon are:
- Online Application
- Online test: (60 mins) 2 coding questions of medium difficulty level. The Amazon online test (20 questions) is based on OOPs, DBMS, operating systems, data structures, and algorithms.
- Technical Interview 1: Project discussions, coding questions based on DS algorithms, and quizzes. It basically tests real-world problem-solving skills.
- Technical Interview 2: Questions of relatively higher difficulty level (mostly DS and algorithms-based)
- Bar raiser round: Behavioral questions and project discussions. Some technical questions are followed by an assessment of leadership quality and cultural fit.
For one to land a job at Amazon, he/she must have clear concepts of DSA and good practice of questions on sorting, array, string, Linked List, searching, sorting, stack, queue, tree, graph recursion backtracking dynamic programming, etc. Here through this Amazon SDE sheet, we are providing most of the coding questions which frequently pop up in amazon interviews topic-wise. This collection of interview questions will help you prepare better for your interview.
Computer Fundamentals
There are three focused computer subjects, on the basis of those subjects MCQs will be there, we have designed top MCQs for that, so you can easily test your knowledge on those subjects.
Language Based Questions
They can be asked language-based questions, to check your grasp of the language you used for the coding round.
Data Structure & Algorithms
Array
An array is a collection of items stored at contiguous memory locations. The idea is to store multiple items of the same type together.
String
String are defined as an array of characters. The difference between a character array and a string is the string is terminated with a special character ‘\0’.
Linked List
Linked List is the data structure that can overcome all the limitations of an array. A Linked list is a linear data structure, in which the elements are not stored at contiguous memory locations, it allocates memory dynamically.
Searching
Searching Algorithms are designed to check for an element or retrieve an element from any data structure where it is stored.
Sorting
A Sorting Algorithm is used to rearrange a given array or list of elements according to a comparison operator on the elements. The comparison operator is used to decide the new order of elements in the respective data structure.
Stack
A stack is a linear data structure in which elements can be inserted and deleted only from one side of the list, called the top. A stack follows the LIFO (Last In First Out) principle.
Queue
A Queue is a linear data structure in which elements can be inserted only from one side of the list called rear, and the elements can be deleted only from the other side called the front. The queue data structure follows the FIFO (First In First Out) principle.
Tree
A tree is non-linear and a hierarchical data structure consisting of a collection of nodes such that each node of the tree stores a value, a list of references to nodes (the “children”).
Graph
A Graph is a non-linear data structure consisting of nodes and edges. The nodes are sometimes also referred to as vertices and the edges are lines or arcs that connect any two nodes in the graph.
Trie is an efficient information retrieval data structure. Using Trie, search complexities can be brought to optimal limit (key length).
A Heap is a special Tree-based data structure in which the tree is a complete binary tree. Heap and hash is an efficient implementation of a priority queue. The linear hash function monotonically maps keys to buckets, and each bucket is a heap.
Bit stands for binary digit. A bit is the basic unit of information and can only have one of two possible values that is 0 or 1.
Recursion and Backtracking
- Recursion: The process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function.
- Backtracking: Backtracking is an algorithmic technique for solving problems recursively by trying to build a solution incrementally, one piece at a time, removing those solutions that fail to satisfy the constraints of the problem at any point in time (by time, here, is referred to the time elapsed till reaching any level of the search tree).
Dynamic Programming is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for same inputs, we can optimize it using Dynamic Programming.
After qualifying the Online test you have to face 2 technical interviews, where they asked about Data Structure, algorithms, and different kinds of puzzles. Technical rounds are face-to-face algorithmic rounds in which candidates are presented with 2-4 questions, all from data structures. The most commonly asked DSs are the matrix, binary tree, BST, and Linked list. The second technical round is more difficult and more questions from Trees, BST, and Graph are asked. One should have a clear knowledge of tree-based recursion, and the standard questions based on it are a must.
P.S: After solving all the problems mentioned above you can answer the questions which will be asked in these rounds.
Puzzles
Puzzles are one of the ways to check your problem-solving skills. These are tricky questions that let you think logically. Amazon will test your problem-solving skills through the puzzles as well. Try to solve these 20 Puzzles Commonly Asked During SDE Interviews
Project Discussion
Thoroughly revise all the work you have done till now in your projects. The grilling about projects can sometimes be very deep. Mention only those topics where you think you are fine to be grilled upon. If you don't have any project they will not ask about it, but better to have some projects, it involves questions like what's new in your project if you have created a basic clone, or what's your input followed by questions based on your technology stack.
If you haven’t made a project then take an idea from GFG Projects and start working on it.
Note: If you have a project on AWS then you have to be confident enough to provide sufficient answers of each question,
To let you know in details about Amazon Recruitment Process, we have a article on that too so you can go through this post:
https://www.geeksforgeeks.org/interview-experiences/amazon-recruitment-process/
Similar Reads
Basics & Prerequisites
Data Structures
Array Data StructureIn this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous
3 min read
String in Data StructureA string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut
2 min read
Hashing in Data StructureHashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The
2 min read
Linked List Data StructureA linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Here’s the comparison of Linked List vs Arrays Linked List:
2 min read
Stack Data StructureA Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first
2 min read
Queue Data StructureA Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed. It is used as a buffer in computer systems
2 min read
Tree Data StructureTree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes. Types of TreeBinary Tree : Every node has at most two childrenTernary Tree : Every node has at most
4 min read
Graph Data StructureGraph Data Structure is a collection of nodes connected by edges. It's used to represent relationships between different entities. If you are looking for topic-wise list of problems on different topics like DFS, BFS, Topological Sort, Shortest Path, etc., please refer to Graph Algorithms. Basics of
3 min read
Trie Data StructureThe Trie data structure is a tree-like structure used for storing a dynamic set of strings. It allows for efficient retrieval and storage of keys, making it highly effective in handling large datasets. Trie supports operations such as insertion, search, deletion of keys, and prefix searches. In this
15+ min read
Algorithms
Searching AlgorithmsSearching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input
2 min read
Sorting AlgorithmsA Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ
3 min read
Introduction to RecursionThe process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution
14 min read
Greedy AlgorithmsGreedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get
3 min read
Graph AlgorithmsGraph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net
3 min read
Dynamic Programming or DPDynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of
3 min read
Bitwise AlgorithmsBitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit
4 min read
Advanced
Segment TreeSegment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree
3 min read
Pattern SearchingPattern searching algorithms are essential tools in computer science and data processing. These algorithms are designed to efficiently find a particular pattern within a larger set of data. Patten SearchingImportant Pattern Searching Algorithms:Naive String Matching : A Simple Algorithm that works i
2 min read
GeometryGeometry is a branch of mathematics that studies the properties, measurements, and relationships of points, lines, angles, surfaces, and solids. From basic lines and angles to complex structures, it helps us understand the world around us.Geometry for Students and BeginnersThis section covers key br
2 min read
Interview Preparation
Practice Problem