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

Amazon Senior Sdet Engineer Interview Questions, Process, and Tips

Updated 22 Nov 2024

Top Amazon Senior Sdet Engineer Interview Questions and Answers

Amazon Senior Sdet Engineer Interview Experiences

5 interviews found

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-

I applied via LinkedIn

Round 1 - Technical 

(5 Questions)

  • Q1. Find string in array
  • Ans. 

    Search for a specific string in an array of strings.

    • Iterate through the array and compare each string with the target string.

    • Use a loop to go through each element in the array and check for a match.

    • Consider using built-in methods like indexOf() or includes() for efficient searching.

    • Handle cases where the target string is not found in the array.

  • Answered by AI
  • Q2. Find string in array
  • Ans. 

    Search for a specific string in an array of strings.

    • Iterate through the array and compare each string with the target string.

    • Use a loop to go through each element in the array and check for a match.

    • Consider using built-in methods like indexOf or includes for efficient searching.

  • Answered by AI
  • Q3. Subarray in given array
  • Ans. 

    Find all subarrays in a given array of strings

    • Iterate through the array and consider each element as the starting point of a subarray

    • For each starting point, iterate through the array to find all possible subarrays

    • Store each subarray found in a separate list

  • Answered by AI
  • Q4. Stack for balance paranthesis
  • Ans. 

    Use stack data structure to check for balanced parentheses in a string.

    • Create an empty stack to store opening parentheses

    • Iterate through the string and push opening parentheses onto the stack

    • When encountering a closing parenthesis, pop from the stack and check if it matches the corresponding opening parenthesis

    • If stack is empty at the end and all parentheses have been matched, the string is balanced

  • Answered by AI
  • Q5. Mean heap fo minimising the cost
  • Ans. 

    A mean heap is a data structure that minimizes the cost of accessing the smallest element.

    • Mean heap is a type of binary heap where the value of each node is less than or equal to the values of its children.

    • It is useful for finding the minimum element quickly, as the root node always contains the smallest value.

    • Insertion and deletion operations in a mean heap have a time complexity of O(log n).

  • Answered by AI

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
4-6 weeks
Result
No response

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

Round 1 - Coding Test 

DSA medium level 2 question based on graph and recursion

Round 2 - Technical 

(2 Questions)

  • Q1. DSA question on dynamic programming
  • Q2. Question on graph (topological sort)

Interview Preparation Tips

Interview preparation tips for other job seekers - keep working hard

Senior Sdet Engineer Interview Questions Asked at Other Companies

asked in PubMatic
Q1. Optimize an existing system. The system currently makes an API ca ... read more
asked in Capgemini
Q2. Write a code to split a string to one by one letter in each line?
asked in Capgemini
Q3. Write Xpath of an element from amazon.in page manually, without c ... read more
Q4. What is Selenium, and how is it used in automation testing?
asked in Leena AI
Q5. Write manual test cases for whatapp security features
Interview experience
5
Excellent
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via LinkedIn and was interviewed in Sep 2024. There was 1 interview round.

Round 1 - HR 

(2 Questions)

  • Q1. Asking for my Hobbies
  • Q2. Ctc was discussed with me
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Prime numbers usung sieve if erastothenesis

Amazon interview questions for designations

 Sdet Engineer

 (8)

 Sdet

 (5)

 Senior Sdet Test Engineer

 (2)

 Senior Sdet Software Engineer

 (1)

 Sdet Lead

 (12)

 Sdet Intern

 (1)

 Sdet 2

 (1)

 Sdet-I

 (1)

Senior Sdet Engineer Interview Questions & Answers

user image Prabhas Shrivastava

posted on 7 Nov 2024

Interview experience
4
Good
Difficulty level
Hard
Process Duration
2-4 weeks
Result
Not Selected

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

Round 1 - Coding Test 

Amazon Chime interview with questions on DSA

Interview questions from similar companies

Interview Preparation Tips

Round: Resume Shortlist
Experience: You need to submit your CV and they shortlist you on this basis.Fast and accurate coding.
Tips: Clearly specify any technical achievement.

Round: Coding
Experience: You are given 4 hours to solve a few algorithmic questions.Start practicing for this from sometime earlier.
Tips: There are puzzles available on the Facebook page.

Round: Technical Interview
Experience: Three interviews. All almost exclusively technical with 1-2 HR questions.
The questions are mainly algorithmic in nature and you need to code online while talking to them.
Tips: Be as accurate and clean with your code as possible.

General Tips: Be creative while answering the questions. They might ask you questions like 'What changes would you want to make to Facebook?'.
Prepare algorithmic questions for the interviews. Most companies like Facebook, Google, Microsoft and others focus on this.
Technical projects or internships will be beneficial.
Qualifying for or winning programming contests like overnite is very beneficial. Involvement in Social/Cultural activities or sports is not really essential.
Skill Tips: Being good at writing fast and correct code in any language helps a lot.
Skills: Programming
College Name: IIT KHARAGPUR

Interview Questionnaire 

8 Questions

  • Q1. Given two “ids” and a function getFriends(id) to get the list of friends of that person id, write a function that returns the list of mutual friends
  • Ans. 

    Function to return mutual friends given two ids and getFriends(id) function

    • Call getFriends(id) for both ids to get their respective friend lists

    • Iterate through both lists and compare to find mutual friends

    • Return the list of mutual friends

  • Answered by AI
  • Q2. Given an “id” and a function getFriends(id) to get the list of friends of that person id, write a function that returns the list of “friends of friends” in the order of decreasing number of mutual friends,...
  • Ans. 

    Function to return list of friends of friends in decreasing order of mutual friends

    • Use a set to store all friends of friends

    • Iterate through the list of friends of the given id

    • For each friend, iterate through their list of friends and count mutual friends

    • Sort the set of friends of friends by decreasing number of mutual friends

  • Answered by AI
  • Q3. Given a number of time slots – start time and end time,“a b”, find any specific time with the maximum number of overlapping. After solving the problem I had to prove my solution
  • Ans. 

    Given time slots, find a specific time with maximum overlap. Prove solution.

    • Create a list of all start and end times

    • Sort the list in ascending order

    • Iterate through the list and keep track of the number of overlaps at each time

    • Return the time with the maximum number of overlaps

    • Prove solution by testing with different input sizes and edge cases

  • Answered by AI
  • Q4. Given an array of Integers, find the Longest sub-array whose elements are in Increasing Order
  • Ans. 

    Find the longest sub-array with increasing order of integers.

    • Iterate through the array and keep track of the current sub-array's start and end indices.

    • Update the start index whenever the current element is smaller than the previous element.

    • Update the end index whenever the current element is greater than or equal to the next element.

    • Calculate the length of the sub-array and compare it with the longest sub-array found s

  • Answered by AI
  • Q5. Given an array of Integers, find the length of Longest Increasing Subsequence and print the sequence.
  • Ans. 

    Find the length of longest increasing subsequence and print the sequence from an array of integers.

    • Use dynamic programming to solve the problem

    • Create an array to store the length of longest increasing subsequence ending at each index

    • Traverse the array and update the length of longest increasing subsequence for each index

    • Print the sequence by backtracking from the index with the maximum length

    • Time complexity: O(n^2)

    • Exam...

  • Answered by AI
  • Q6. Given a Sorted Array which has been rotated, write the code to find a given Integer
  • Ans. 

    Code to find a given integer in a rotated sorted array.

    • Use binary search to find the pivot point where the array is rotated.

    • Divide the array into two subarrays and perform binary search on the appropriate subarray.

    • Handle edge cases such as the target integer not being present in the array.

  • Answered by AI
  • Q7. You have a number of incoming Integers, all of which cannot be stored into memory. We need to print largest K numbers at the end of input
  • Ans. 

    Use a min-heap to keep track of the largest K numbers seen so far.

    • Create a min-heap of size K.

    • For each incoming integer, add it to the heap if it's larger than the smallest element in the heap.

    • If the heap size exceeds K, remove the smallest element.

    • At the end, the heap will contain the largest K numbers in the input.

  • Answered by AI
  • Q8. Implement LRU Cache
  • Ans. 

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

    • Use a doubly linked list to keep track of the order of items in the cache

    • Use a hash map to store the key-value pairs for fast access

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

    • When the cache is full, remove the least recently used item from the back of the linked list and the hash map

  • Answered by AI

Interview Preparation Tips

Round: ONLINE CODING ROUND
Experience: Facebook visited our campus in July, 2012. We had an online coding round hosted on InterviewStreet. We were asked to solve just one problem. The given problem boils down to : Given a undirected graph, source and destination, write the code to find the total number of distinct nodes visited, considering all possible paths.
Tips: Those shortlisted had to fly to Delhi for a Personal Interview. There were four rounds of interview, each of 45 minutes. The questions were simple. But just solving the given problem wasn't enough.

There was much more interaction and short questions asked related to the problem

Round: Technical Interview
Experience: The above mentioned questions wer asked in the interview. For every solution I was asked to write the code on paper. The code should also include the implementation of the data structures used (I used heaps - so I was asked to implement heaps ). They are looking for someone with good problem solving skills and conceptually sound in data structures

College Name: BIT MESRA

Skills evaluated in this interview

Interview Questionnaire 

4 Questions

  • Q1. You are given a large array of n bits. Each bit is initially 0. You perform several operations of the type
  • Ans. 

    Solution to performing operations on a large array of bits.

    • Use bitwise operators to perform operations on individual bits

    • Use a loop to iterate through the array and perform the operations

    • Ensure that the array is large enough to accommodate all the bits

    • Consider using a data structure like a bitset for efficient bit manipulation

  • Answered by AI
  • Q2. Questions on Network programming
  • Q3. Questions on array,heap and binary trees
  • Q4. Round was both HR+Technical

Interview Preparation Tips

Round: Test
Experience: Questions can be found here:

-----/
Tips: Try to solve all 3.
Duration: 60 minutes
Total Questions: 3

Round: Technical Interview
Experience: First discuss the solution and then paper-code it.
Tips: Try to code without mistakes.

Round: Technical Interview
Experience: First, I was asked to discuss my project based on networking and then I was given a question on network programming
Tips: Pay attention on discussion

Round: Technical Interview
Experience: Provide the optimised solution and code it without any mistakes.

Round: HR Interview
Experience: Why linkedin?
What changes will you make in 6 months?
Internship project: Discussion and lot of common questions on that.
Basic Questions of C++ and Java

Skills: Data Structure, Core courses understanding, Algorithms
College Name: IIT GUWHATI

Skills evaluated in this interview

I appeared for an interview before May 2021.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 Minutes
Round difficulty - Medium

it was time bound coding test round. The questions were from array and string. There were 2 questions.

  • Q1. 

    K-Palindrome Problem Statement

    Determine whether a given string str can be considered a K-Palindrome.

    A string is considered a K-Palindrome if it can be transformed into a palindrome after removing up to...

  • Ans. 

    The problem is to determine whether a given string can be considered a K-Palindrome by removing up to 'k' characters.

    • Iterate through the string from both ends and check if characters match, if not increment removal count

    • If removal count is less than or equal to k, return True, else return False

    • Use dynamic programming to optimize the solution by storing subproblem results

  • Answered by AI
Round 2 - HR 

Round duration - 30 Minutes
Round difficulty - Easy

in this round manager spoke to me and explained about project and joining date later hr spoke to me regarding on boarding process

Interview Preparation Tips

Professional and academic backgroundI applied for the job as Software Engineer in HyderabadEligibility criteriaNo criteriaUber interview preparation:Topics to prepare for the interview - Data structure ,Problem Solving ,Algorithms , Java , Spring Framework , Design QuestionsTime required to prepare for the interview - 3 MonthsInterview preparation tips for other job seekers

Tip 1 : Practise Data structures mostly (Array, String and Tree) , practise as much questions as you can.
Tip 2 : Have Good knowledge of Tech Stack you mention in your resume
Tip 3 : Have good understanding of projects mentioned in your resume.

Application resume tips for other job seekers

Tip 1 : Resume should be having one page or maximum two pages long
Tip 2 : Mention your role on each project.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
3
Average
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
No response

I applied via Company Website and was interviewed in Sep 2023. There were 2 interview rounds.

Round 1 - Coding Test 

Implement an iterator to flatten 2D vector

Round 2 - One-on-one 

(1 Question)

  • Q1. Find shortest path to get all keys
  • Ans. 

    Use Dijkstra's algorithm to find the shortest path to get all keys

    • Implement Dijkstra's algorithm to find the shortest path in a graph

    • Consider the keys as nodes in the graph and the paths between keys as edges

    • Keep track of the keys collected and update the shortest path accordingly

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Practice algorithmic questions

Skills evaluated in this interview

Amazon Interview FAQs

How many rounds are there in Amazon Senior Sdet Engineer interview?
Amazon interview process usually has 1-2 rounds. The most common rounds in the Amazon interview process are Coding Test, Technical and HR.
What are the top questions asked in Amazon Senior Sdet Engineer interview?

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

  1. mean heap fo minimising the c...read more
  2. find string in ar...read more
  3. subarray in given ar...read more

Tell us how to improve this page.

Amazon Senior Sdet Engineer Interview Process

based on 5 interviews

1 Interview rounds

  • Coding Test Round
View more

Interview Questions from Similar Companies

Uber Interview Questions
4.2
 • 150 Interviews
Expedia Group Interview Questions
3.8
 • 75 Interviews
LinkedIn Interview Questions
4.3
 • 65 Interviews
OLX Interview Questions
3.8
 • 57 Interviews
Facebook Interview Questions
4.3
 • 52 Interviews
Groupon Interview Questions
3.2
 • 42 Interviews
Uplers Interview Questions
4.0
 • 41 Interviews
Fareportal Interview Questions
3.3
 • 30 Interviews
Yahoo Interview Questions
4.6
 • 29 Interviews
Airbnb Interview Questions
3.7
 • 23 Interviews
View all
Amazon Senior Sdet Engineer Salary
based on 41 salaries
₹20 L/yr - ₹77.1 L/yr
77% more than the average Senior Sdet Engineer Salary in India
View more details

Amazon Senior Sdet Engineer Reviews and Ratings

based on 5 reviews

4.0/5

Rating in categories

4.1

Skill development

4.1

Work-life balance

4.1

Salary

4.1

Job security

4.1

Company culture

4.1

Promotions

4.1

Work satisfaction

Explore 5 Reviews and Ratings
Customer Service Associate
4.2k salaries
unlock blur

₹0.6 L/yr - ₹6.8 L/yr

Transaction Risk Investigator
3.1k salaries
unlock blur

₹2.3 L/yr - ₹6.3 L/yr

Associate
2.9k salaries
unlock blur

₹0.8 L/yr - ₹7 L/yr

Senior Associate
2.5k salaries
unlock blur

₹2 L/yr - ₹10.5 L/yr

Program Manager
2.1k salaries
unlock blur

₹9 L/yr - ₹36 L/yr

Explore more salaries
Compare Amazon with

Flipkart

3.9
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