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 Senior Software Engineer Interview Questions and Answers

Updated 21 Jan 2025

Amazon Senior Software Engineer Interview Experiences

8 interviews found

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

I applied via Company Website and was interviewed in Nov 2024. There was 1 interview round.

Round 1 - Technical 

(1 Question)

  • Q1. Coding and behavioral questions
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Related to Dp and other questions is related to array like reverse and find duplicate in an array, String matching Questions

Senior Software Engineer Interview Questions Asked at Other Companies

Q1. K Largest Elements Problem Statement You are given an integer k a ... read more
asked in DBS Bank
Q2. Tell me about yourself. What technology are you using? What is a ... read more
asked in GlobalLogic
Q3. MapSum Pair Implementation Create a data structure named 'MapSum' ... read more
asked in UST
Q4. Nth Prime Number Problem Statement Find the Nth prime number give ... read more
asked in Capgemini
Q5. Pascal's Triangle Construction You are provided with an integer ' ... read more
Interview experience
2
Poor
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Half an hour Java boilerplate question

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

1 Hour, Binary Search + Greedy, Chime

Interview Preparation Tips

Interview preparation tips for other job seekers - DSA, DSA, DSA ...

Amazon interview questions for designations

 Senior Software Engineer Testing

 (1)

 Senior Software Development Engineer

 (1)

 Software Engineer

 (78)

 Senior Software Developer

 (1)

 Senior Software Associate

 (1)

 Software Development Engineer

 (34)

 Software Engineer Intern

 (13)

 Embedded Software Engineer

 (4)

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Aptitude Test 

Dsa and algorithms with design

Round 2 - Case Study 

Design sw update system

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Group Discussion 

Guestimate were asked like how many syringes are used in a city

Senior Software Engineer Jobs at Amazon

View all
Interview experience
3
Average
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Not Selected

I applied via LinkedIn and was interviewed in Aug 2023. There were 2 interview rounds.

Round 1 - Coding Test 

1 hr
Coding qn on dynamic programing

Round 2 - Technical 

(1 Question)

  • Q1. Project Related

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare yourself clearly before taking any interview
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Recruitment Consulltant and was interviewed in Apr 2023. There were 2 interview rounds.

Round 1 - System Design 

(2 Questions)

  • Q1. Google Autocomplete problem.
  • Ans. 

    Google Autocomplete problem involves predicting the most likely search queries based on partial input.

    • Utilize algorithms like Trie or N-gram models to efficiently predict search queries.

    • Consider user's location, search history, and popular queries for better predictions.

    • Implement real-time updating of autocomplete suggestions based on user input.

    • Optimize for speed and accuracy to enhance user experience.

  • Answered by AI
  • Q2. Spiral Problem matrix
Round 2 - Coding Test 

Word Search2 problem. Interviewer wanted solution other than trie.

Interview Preparation Tips

Topics to prepare for Amazon Senior Software Engineer interview:
  • Graphs

Skills evaluated in this interview

Interview questions from similar companies

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

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

Amazon Interview FAQs

How many rounds are there in Amazon Senior Software Engineer interview?
Amazon interview process usually has 1-2 rounds. The most common rounds in the Amazon interview process are Coding Test, Technical and Resume Shortlist.
How to prepare for Amazon Senior Software Engineer 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 Architectural Design, Technical Leadership, Clinical SAS Programming, Medical Coding and System Architecture.
What are the top questions asked in Amazon Senior Software Engineer interview?

Some of the top questions asked at the Amazon Senior Software Engineer interview -

  1. Google Autocomplete probl...read more
  2. Coding and behavioral questi...read more
  3. Spiral Problem mat...read more

Recently Viewed

JOBS

Barclays Shared Services

No Jobs

JOBS

Barclays Shared Services

No Jobs

JOBS

Barclays Shared Services

No Jobs

JOBS

Pathfinder Global School

No Jobs

JOBS

Pathfinder Global School

No Jobs

REVIEWS

Global Indian International School

No Reviews

JOBS

Lericon Informatics

No Jobs

JOBS

Motherhood Hospital

No Jobs

JOBS

JPMorgan Chase & Co.

No Jobs

DESIGNATION

Tell us how to improve this page.

Amazon Senior Software Engineer Interview Process

based on 8 interviews

1 Interview rounds

  • Coding Test Round
View more
Amazon Senior Software Engineer Salary
based on 395 salaries
₹20 L/yr - ₹77.7 L/yr
218% more than the average Senior Software Engineer Salary in India
View more details

Amazon Senior Software Engineer Reviews and Ratings

based on 11 reviews

2.8/5

Rating in categories

2.6

Skill development

2.8

Work-life balance

3.7

Salary

2.7

Job security

2.4

Company culture

2.7

Promotions

2.3

Work satisfaction

Explore 11 Reviews and Ratings
Senior Software Engineer

Bangalore / Bengaluru

8-13 Yrs

Not Disclosed

Senior Software Engineer, Transportation Financial Systems

Bangalore / Bengaluru

3-7 Yrs

₹ 10-120 LPA

Senior Software Engineer, Alexa Reminders

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