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 Backend Developer Interview Questions and Answers

Updated 3 Apr 2024

Amazon Backend Developer Interview Experiences

1 interview found

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Selected Selected

I applied via LinkedIn and was interviewed in Mar 2024. There were 2 interview rounds.

Round 1 - Aptitude Test 

Aptitude Test based on general

Round 2 - Coding Test 

Coding Test Based on backend technologies

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare for backend

Interview questions from similar companies

Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed in Oct 2024. There were 3 interview rounds.

Round 1 - Coding Test 

Online coding test on hacker rank

Round 2 - Technical 

(1 Question)

  • Q1. Normal DSA question related to array & strings
Round 3 - Technical 

(1 Question)

  • Q1. Medium Level DSA questions form Linked list & Aarrays

I applied via LinkedIn and was interviewed in Apr 2021. There were 4 interview rounds.

Interview Questionnaire 

4 Questions

  • Q1. 1. Mininum cost to reach the last cell of a 2D matrix. Required moves are only downward or to the right direction
  • Ans. 

    Minimum cost to reach last cell of 2D matrix with only downward or right moves.

    • Use dynamic programming approach to solve the problem.

    • Calculate minimum cost for each cell by considering minimum cost of its adjacent cells.

    • Final answer will be the minimum cost to reach the last cell.

  • Answered by AI
  • Q2. Design a Stack that can support getMin functionality. Whenever it calls getMin on stack it should return the min element in the stack.
  • Ans. 

    Design a stack that supports getMin functionality to return the minimum element in the stack.

    • Create two stacks, one for storing the actual elements and another for storing the minimum elements.

    • Push elements onto both stacks simultaneously.

    • When popping an element, pop from both stacks.

    • To get the minimum element, peek at the top of the minimum stack.

  • Answered by AI
  • Q3. Design a TreeSet functionality
  • Ans. 

    TreeSet is a data structure that stores unique elements in sorted order.

    • TreeSet is implemented using a Red-Black tree

    • It provides O(log n) time complexity for basic operations like add, remove, and contains

    • It also provides methods like first(), last(), headSet(), tailSet(), and subSet()

    • TreeSet can be used to implement priority queues and sorting algorithms

  • Answered by AI
  • Q4. Design a ArrayList that supprorts all the existing funtions of a list plus getMax functionality also.
  • Ans. 

    Design an ArrayList with getMax functionality.

    • Create a custom ArrayList class that extends the existing ArrayList class.

    • Add a getMax() method that returns the maximum value in the list.

    • Override the add() method to keep track of the maximum value in the list.

    • Update the maximum value whenever an element is added or removed from the list.

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Practice Data Structures and algorithms. If you have industry experience you will be asked system design questions as well, migh as well prepare for that

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Internshala and was interviewed before Aug 2023. There were 2 interview rounds.

Round 1 - Coding Test 

Two questions were asked of easy level

Round 2 - Technical 

(2 Questions)

  • Q1. What is node js
  • Ans. 

    Node.js is a runtime environment that allows you to run JavaScript code outside of a web browser.

    • Node.js is built on Chrome's V8 JavaScript engine.

    • It uses an event-driven, non-blocking I/O model.

    • Node.js is commonly used for building server-side applications.

    • It allows developers to use JavaScript for both client-side and server-side development.

    • Node.js has a large ecosystem of open-source libraries and frameworks, such

  • Answered by AI
  • Q2. Php frameworks working
  • Ans. 

    Php frameworks are tools that help developers build web applications more efficiently by providing pre-built components and structures.

    • Popular Php frameworks include Laravel, Symfony, CodeIgniter, and Yii.

    • Frameworks like Laravel offer features like routing, authentication, and database management out of the box.

    • Choosing the right framework depends on project requirements, developer experience, and community support.

  • Answered by AI

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(2 Questions)

  • Q1. Java threads concepts and its usage
  • Q2. Data structures problems and design quentions
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
No response

I applied via Naukri.com and was interviewed in Mar 2024. There was 1 interview round.

Round 1 - Coding Test 

-----.geeksforgeeks.org/replace-every-element-with-the-greatest-on-right-side/amp/



-----/

Interview Preparation Tips

Topics to prepare for Paytm Backend Developer interview:
  • DSA
  • Core java
  • Design Patterns
  • Spring Boot
Interview preparation tips for other job seekers - DSA , Design Patters , Core Java Concepts , Springboot
Interview experience
1
Bad
Difficulty level
-
Process Duration
-
Result
Selected Selected
Round 1 - HR 

(1 Question)

  • Q1. Human resources is tha set of people who make up the workforce of an organisation, business sector, industry.
Round 2 - Technical 

(2 Questions)

  • Q1. Connected with the partical use of machines, etc. in science and industry
  • Q2. Connected with the skills involved in a particular activity or subject

Interview Preparation Tips

Interview preparation tips for other job seekers - It was great here☺️

I was interviewed before Dec 2020.

Round 1 - Face to Face 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This round was purely based on Data Structures and Algorithms . One has to be fairly comfortable in solving Algorithmic problems to pass this round . Both the questions asked were quite common and luckily I had already prepared them from CodeStudio and LeetCode.

  • Q1. 

    Binary Tree Traversals Problem Statement

    Given a Binary Tree with 'N' nodes, where each node holds an integer value, your task is to compute the In-Order, Pre-Order, and Post-Order traversals of the binar...

  • Ans. 

    Compute the In-Order, Pre-Order, and Post-Order traversals of a Binary Tree given in level-order format.

    • Implement functions to perform In-Order, Pre-Order, and Post-Order traversals of a Binary Tree.

    • Use level-order input to construct the Binary Tree.

    • Traverse the Binary Tree recursively to generate the required traversals.

    • Ensure proper handling of null nodes represented by -1 in the input.

    • Return the three traversals as

  • Answered by AI
  • Q2. 

    Reverse Linked List Problem Statement

    Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.

    Input:

    The first line of input is an intege...
  • Ans. 

    Reverse a singly linked list by altering the links between nodes.

    • Iterate through the linked list and reverse the links between nodes

    • Use three pointers to keep track of the current, previous, and next nodes

    • Update the links between nodes to reverse the list

    • Return the head of the reversed linked list

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 45 Minutes
Round difficulty - Medium

This round basically tested some concepts from Data Structures and File Manipulation .

  • Q1. 

    Intersection of Two Arrays Problem Statement

    Given two arrays A and B with sizes N and M respectively, both sorted in non-decreasing order, determine their intersection.

    The intersection of two arrays in...

  • Ans. 

    The problem involves finding the intersection of two sorted arrays efficiently.

    • Use two pointers to iterate through both arrays simultaneously.

    • Compare elements at the pointers and move the pointers accordingly.

    • Handle cases where elements are equal and update the intersection array.

    • Return the intersection array as the result.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPABig Basket interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, Operating Systems, Aptitude, OOPSTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Jan 2021.

Round 1 - Face to Face 

(3 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This was a typical DS/Algo where I was asked to solve two questions related to Binary Trees and write the pseudo code for both of them followed by some theoretical questions related to Operating Systems.

  • Q1. 

    K-th Largest Number in a BST

    Given a binary search tree (BST) consisting of integers and containing 'N' nodes, your task is to find and return the K-th largest element in this BST.

    If there is no K-th la...

  • Ans. 

    Find the K-th largest element in a BST.

    • Perform reverse in-order traversal of the BST to find the K-th largest element.

    • Keep track of the count of visited nodes to determine the K-th largest element.

    • Return -1 if there is no K-th largest element in the BST.

  • Answered by AI
  • Q2. 

    Is Height Balanced Binary Tree Problem Statement

    Determine if the given binary tree is height-balanced. A tree is considered height-balanced when:

    1. The left subtree is balanced.
    2. The right subtree is bala...
  • Ans. 

    Determine if a given binary tree is height-balanced by checking if left and right subtrees are balanced and their height difference is at most 1.

    • Check if the left subtree is balanced

    • Check if the right subtree is balanced

    • Calculate the height difference between the left and right subtrees

    • Return 'True' if all conditions are met, otherwise return 'False'

  • Answered by AI
  • Q3. Can you explain the concepts of Zombie Process and Orphan Process in operating systems?
  • Ans. 

    Zombie process is a terminated process that has completed execution but still has an entry in the process table. Orphan process is a process whose parent process has terminated.

    • Zombie process is created when a child process completes execution but its parent process has not yet read its exit status.

    • Zombie processes consume system resources and should be cleaned up by the parent process using wait() system call.

    • Orphan p...

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This was also a Data Structures and Algorithm round where I was asked to solve 3 medium to hard level problems along with their pseudo code within 60 minutes .

  • Q1. 

    Longest Substring Without Repeating Characters Problem Statement

    Given a string S of length L, determine the length of the longest substring that contains no repeating characters.

    Example:

    Input:
    "abac...
  • Ans. 

    Find the length of the longest substring without repeating characters in a given string.

    • Use a sliding window approach to keep track of the longest substring without repeating characters.

    • Use a hashmap to store the index of each character in the string.

    • Update the start index of the window when a repeating character is found.

    • Calculate the maximum length of the window as you iterate through the string.

    • Return the maximum le

  • Answered by AI
  • Q2. 

    Problem: Search In Rotated Sorted Array

    Given a sorted array that has been rotated clockwise by an unknown amount, you need to answer Q queries. Each query is represented by an integer Q[i], and you must ...

  • Ans. 

    Search for integers in a rotated sorted array efficiently.

    • Use binary search to efficiently search for integers in the rotated sorted array.

    • Handle the rotation of the array while performing binary search.

    • Return the index of the integer if found, else return -1.

  • Answered by AI
  • Q3. 

    Count Subarrays with Sum Divisible by K

    Given an array ARR and an integer K, your task is to count all subarrays whose sum is divisible by the given integer K.

    Input:

    The first line of input contains an...
  • Ans. 

    Count subarrays with sum divisible by K in an array.

    • Iterate through the array and keep track of the prefix sum modulo K.

    • Use a hashmap to store the frequency of each prefix sum modulo K.

    • For each prefix sum, increment the count by the frequency of (prefix sum - K) modulo K.

    • Handle the case when prefix sum itself is divisible by K.

    • Return the total count of subarrays with sum divisible by K.

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 50 Minutes
Round difficulty - Medium

In this round , I was asked to code a simple question related to BST . After that I was asked the internal implementation of a Hash Map where I was supposed to design a Hash Map using any of the Hashing Algorithms that I know . This was preety challenging for me but I got to learn so much from it.

  • Q1. 

    Ceil Value from BST Problem Statement

    Given a Binary Search Tree (BST) and an integer, write a function to return the ceil value of a particular key in the BST.

    The ceil of an integer is defined as the s...

  • Ans. 

    Ceil value of a key in a Binary Search Tree (BST) is found by returning the smallest integer greater than or equal to the given number.

    • Traverse the BST to find the closest value greater than or equal to the key.

    • Compare the key with the current node value and update the ceil value accordingly.

    • Recursively move to the left or right subtree based on the comparison.

    • Return the ceil value once the traversal is complete.

  • Answered by AI
  • Q2. 

    Design a Constant Time Data Structure

    Create a data structure that maintains mappings between keys and values, supporting the following operations in constant time:

    1. INSERT(key, value): Add or update t...
  • Ans. 

    Design a constant time data structure to maintain mappings between keys and values with various operations.

    • Use a hash table to achieve constant time complexity for INSERT, DELETE, SEARCH, and GET operations.

    • Keep track of the number of key-value pairs for GET_SIZE operation.

    • Check if the hash table is empty for IS_EMPTY operation.

    • Return true or false for SEARCH operation based on key existence.

    • Return the value associated...

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAFlipkart interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 MonthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Jan 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 90 Minutes
Round difficulty - Hard

I found the online coding round of Flipkart to be quite difficult based on the constraints of the problem and their time limits. I coded the first problem quite easily but on the second and the third problem , my code could only pass a few test cases and gave TLE for most of them. Both the questions required very efficient solution and the last 5 to 10 Test Cases carried more weight than the rest so I didn't get through this round.

  • Q1. 

    Print the Kth Digit

    Given three non-negative integers N, M, and K, compute the Kth digit from the right in the number obtained from N raised to the power M (i.e., N ^ M).

    Input:

    The first line contains ...
  • Ans. 

    The task is to find the Kth digit from the right in the number obtained from N raised to the power M.

    • Iterate through the digits of N^M from right to left

    • Keep track of the position of the current digit

    • Return the digit at position K from the right

  • Answered by AI
  • Q2. 

    The Skyline Problem

    Compute the skyline of given rectangular buildings in a 2D city, eliminating hidden lines and forming the outer contour of the silhouette when viewed from a distance. Each building is ...

  • Ans. 

    Compute the skyline of given rectangular buildings in a 2D city, eliminating hidden lines and forming the outer contour of the silhouette.

    • Iterate through the buildings and create a list of critical points (x, y) where the height changes.

    • Sort the critical points based on x-coordinate and process them to form the skyline.

    • Merge consecutive horizontal segments of equal height into one to ensure no duplicates.

    • Return the fin...

  • Answered by AI
  • Q3. 

    Longest Palindromic Substring Problem Statement

    You are provided with a string STR of length N. The goal is to identify the longest palindromic substring within this string. In cases where multiple palind...

  • Ans. 

    Identify the longest palindromic substring in a given string.

    • Iterate through the string and expand around each character to find palindromes

    • Keep track of the longest palindrome found

    • Return the longest palindrome with the smallest start index

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAFlipkart interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewRejected

Skills evaluated in this interview

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

Amazon Interview FAQs

How many rounds are there in Amazon Backend Developer interview?
Amazon interview process usually has 2 rounds. The most common rounds in the Amazon interview process are Aptitude Test and Coding Test.
How to prepare for Amazon Backend Developer 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 Algorithms, C++, Data Structures, Java and LLD.

Recently Viewed

JOBS

Airtribe

No Jobs

SALARIES

Mobikwik

SALARIES

Razorpay

LIST OF COMPANIES

Airtribe

Locations

JOBS

Mobikwik

No Jobs

SALARIES

Mobikwik

SALARIES

PolicyBazaar

SALARIES

Revolut

LIST OF COMPANIES

Freecharge

Locations

INTERVIEWS

Clix Capital Services

No Interviews

Tell us how to improve this page.

Amazon Backend Developer Interview Process

based on 1 interview

Interview experience

5
  
Excellent
View more

Interview Questions from Similar Companies

Reliance Retail Interview Questions
3.9
 • 1.5k Interviews
Flipkart Interview Questions
4.0
 • 1.3k Interviews
Paytm Interview Questions
3.3
 • 753 Interviews
Tata Group Interview Questions
4.2
 • 359 Interviews
BigBasket Interview Questions
3.9
 • 359 Interviews
Myntra Interview Questions
4.0
 • 215 Interviews
Blinkit Interview Questions
3.7
 • 182 Interviews
AmbitionBox Interview Questions
4.9
 • 151 Interviews
Uber Interview Questions
4.2
 • 150 Interviews
JioMart Interview Questions
3.9
 • 94 Interviews
View all
Amazon Backend Developer Salary
based on 18 salaries
₹8.2 L/yr - ₹30.7 L/yr
126% more than the average Backend Developer Salary in India
View more details

Amazon Backend Developer Reviews and Ratings

based on 5 reviews

2.9/5

Rating in categories

2.4

Skill development

2.7

Work-life balance

2.8

Salary

2.3

Job security

2.3

Company culture

2.4

Promotions

2.4

Work satisfaction

Explore 5 Reviews and Ratings
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.9k 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