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 Sdet-I Interview Questions, Process, and Tips

Updated 30 May 2015

Amazon Sdet-I Interview Experiences

1 interview found

Sdet-I Interview Questions & Answers

user image Anonymous

posted on 25 May 2015

Interview Questionnaire 

16 Questions

  • Q1. Given an array and a number, check whether there are any 3 elements in the array which add up to the given number
  • Ans. 

    Check if any 3 elements in an array add up to a given number

    • Sort the array in ascending order

    • Use nested loops to iterate through all possible combinations of 3 elements

    • Check if the sum of the 3 elements equals the given number

    • Return true if a match is found, else false

  • Answered by AI
  • Q2. Given a number, find the nearest perfect square(modified binary search)
  • Ans. 

    Given a number, find the nearest perfect square using modified binary search.

    • Start with low=0 and high=num.

    • While low<=high, find mid=(low+high)/2.

    • If mid*mid==num, return mid.

    • If mid*mid

    • If mid*mid>num, update high=mid-1.

    • Return the closest perfect square to num.

  • Answered by AI
  • Q3. Write a method to check whether two binary trees are mirrors of each other -----/
  • Q4. Write a method to print the boundaries of a binary tree -----/
  • Q5. Fill an array with the next greater elements (using stack) -----/
  • Q6. Given a binary tree, count the number of occurrences where there are two nodes with the same horizontal distance. To make it clearer, if we assume each node in a cell of a matrix, then count the number of ...
  • Ans. 

    Count occurrences of two nodes with same horizontal distance in a binary tree

    • Traverse the tree using BFS or DFS and keep track of horizontal distance of each node

    • Store nodes with same horizontal distance in a hash table and increment count if collision occurs

    • Recursively traverse left and right subtrees with updated horizontal distance

    • Time complexity: O(n), Space complexity: O(n)

  • Answered by AI
  • Q7. Given a linked list, write a program to check if it is a palindrome
  • Ans. 

    Program to check if a linked list is a palindrome

    • Traverse the linked list and push each element onto a stack

    • Traverse the linked list again and compare each element with the top of the stack

    • If all elements match, the linked list is a palindrome

  • Answered by AI
  • Q8. Write some test methods for stress testing of Furniture class
  • Ans. 

    Test methods for stress testing of Furniture class

    • Create a large number of Furniture objects and check for memory leaks

    • Simulate heavy usage by continuously calling methods and check for performance issues

    • Test the Furniture class with maximum allowed input values and check for any errors or crashes

  • Answered by AI
  • Q9. Some discussion on automation testing
  • Q10. Discussion about my current job role
  • Q11. Several behavioral and team fit questions
  • Q12. What are the things you will consider (both from Developer’s perspective and User perspective) while trying to develop an application for computer aided competitive examinations like CAT, GMAT etc
  • Ans. 

    Considerations for developing an application for computer aided competitive exams

    • User-friendly interface for easy navigation

    • Accurate and reliable question bank

    • Timed tests to simulate real exam conditions

    • Option to save and resume tests

    • Detailed performance analysis and feedback

    • Compatibility with different devices and operating systems

    • Regular updates and bug fixes

    • Developer should consider the security of the application t...

  • Answered by AI
  • Q13. Given a singly linked list, write a recursive method to reverse every 3 nodes in the list. I did not write a clean code for this. He moved on because of lack of time
  • Ans. 

    Reverse every 3 nodes in a singly linked list using recursion

    • Create a recursive function that takes in a node and a count

    • If count is less than 3, return the node

    • Reverse the first 3 nodes and call the function recursively with the 4th node and count 1

    • Connect the reversed nodes to the rest of the list

    • Return the new head of the reversed list

  • Answered by AI
  • Q14. Again discussion of my current job role and about the projects I have worked on
  • Q15. Tell me 3 things that you want to learn/change in yourself
  • Ans. 

    I want to learn/change 3 things about myself

    • Improve my communication skills

    • Develop better time management habits

    • Learn a new programming language

  • Answered by AI
  • Q16. Again several team fit questions

Interview Preparation Tips

Round: Technical Interview
Experience: 1. Given an array and a number, check whether there are any 3 elements in the array which add up to the given number.
  For example:
     Given an array {1,2,3,4,5} and the number 9, return true, as 2,3,4 add up to 9.
     Given an array {1,2,3,4,5} and the number 3, return false, as there are no 3 elements which add up to 3, in the array.
2. Given a number, find the nearest perfect square(modified binary search)
  For example:
     Given 50, return 49
     Given 25, return 25

Round: Technical Interview
Experience: System: The user gives a book id to be downloaded and the location in which the book is to be stored. The system downloads the book (if it exists) in the location given by the user and returns a url through which the user can access the book.
I was asked to design automated test cases for the system. The interviewer kept adding more and more constraints to the system and we discussed about the pros and cons of my approach.

College Name: NA

Skills evaluated in this interview

Interview questions from similar companies

Interview Questionnaire 

1 Question

  • Q1. Oops Programming

Sdet-I Interview Questions & Answers

Paytm user image Anonymous

posted on 2 Nov 2022

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Coding Test 

There was one coding question followed by some testing questions. Testing questions were of easy level.

Round 3 - Technical 

(1 Question)

  • Q1. I was asked about bubble sort and some basic dsa question. The interview went for 20 min.
Round 4 - Technical 

(1 Question)

  • Q1. Again I was asked some basic dsa and sorting algorithm with my project discussion.

Interview Preparation Tips

Interview preparation tips for other job seekers - Just focus on dsa and there should be a project to show to interviewer.

I appeared for an interview 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 appeared for an interview 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 appeared for an interview 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

I applied via Campus Placement

Interview Preparation Tips

Round: Test
Experience: It was a good one but both questions would have been easy if we know more libraries in java
Tips: Both the questions were related to bigint. It could have been better if both questions were from different areas
Duration: 90 minutes

Round: Technical Interview
Experience: I felt my interview went fine since i was able to answer most of their questions.They gave many hints even if i didn't get the right one
Tips: Everything was fine

Round: HR Interview
Experience: I was able to see myself how i responded to questions asked regarding me and sometimes i was just blabbering
Tips: nothing

General Tips: One must be good at datastrucures and algorithms
Skill Tips: nothing
Skills: Datastructures and Algorithms
Duration: 2
College Name: IIT Madras
Motivation: I wanted to do something for the company where I ordered many of my things
Funny Moments: No funny moments as such but I enjoyed talking to the hr interviewer

Software Developer Interview Questions & Answers

Flipkart user image RAJIVTEJA NAGIPOGU

posted on 25 Aug 2015

I applied via Campus Placement

Interview Preparation Tips

Round: Test
Experience: The test started very late due to some technical issues and space issues. So , It helped us to be far more relaxed.
Duration: 11/2 hr minutes
Total Questions: 2

Round: Technical Interview
Experience: The Overall Technical Interview was a mixture of innovation and apprehension and it really helped me to get my strengths and weaknesses out. The questions outsmarted me at the beginning, Later I did.

Round: HR Interview
Experience: HR was very friendly. He asked about my strengths and weaknesses. And then we continued talking about the nature of work and sincerity and technicality expected from my side, while taking a stroll in cool night air.

Skills: Algorithms and DataStructures
Duration: 2 months
College Name: IIT Madras
Motivation: The work specification

I applied via Campus Placement

Interview Questionnaire 

2 Questions

  • Q1. First question was about a robot and tracking his movements.Given a string of moves a robot makes check if he ends up at the location he starts from?
  • Q2. Given a list of stars and their distances from the earth.Find an efficient solution to find the k closest stars to earth?
  • Ans. 

    Efficient solution to find k closest stars to earth from a list of stars and their distances.

    • Use a priority queue to store the distances of stars from earth.

    • Iterate through the list of stars and add their distances to the priority queue.

    • Pop k elements from the priority queue to get the k closest stars to earth.

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: The online coding test is not that difficult. The questions are very easy. Only thing is that you have to come up with an efficient solution.The naive solutions are fairly obvious.
Tips: Practice some algorithms questions.
Duration: 90 minutes
Total Questions: 2

Round: Technical Interview
Experience: First question was very simple. I was asked for the solution first and then to write the code on paper and show it to him.Second question requires more time to think.
Tips: A good knowledge of data structures and algorithms will help you clear the interview with ease.

Round: HR Interview
Experience: The guy asking questions makes you feel relaxed. He will give you a feedback about the test and the questions asked in the test. I appreciated the feedback. He pointed out things i could have done better.
Tips: The HR interview is relatively easy. Its just a chat about you and your interests and some other questions like "why should I hire you?".

General Tips: A good knowledge of Data structures and Algorithms will help clear the interview and the test.
Skill Tips: Practice Data structures and Algorithms questions.
Skills: Data structures and Algorithms, Coming up with efficient solutions
Duration: 2
College Name: IIT Madras
Motivation: I wanted to apply for Flipkart as I have seen its meteoric rise in the past few years. It has transformed the wasy people shop in India.

Skills evaluated in this interview

Interview Questionnaire 

1 Question

  • Q1. Question 1: General HR questions, some based on the CV Question 2: A marketing specific question

Interview Preparation Tips

Round: Test
Experience: The test basically tests your ability to solve questions as quickly as possible as it's a 60 minute test for 60 questions. The level of difficulty is pretty decent, so one just needs to be focused right from the beginning. English can trouble a bit, so some practice in English sections is also advisable.
Tips: Prepare from Arun Sharma Quantitative Aptitude and Logical Reasoning for CAT. It's a wholesome book and has enough questions to practice and build concepts. Join a test series so that you get a timed analysis of your performance, the ability to skip tough questions and to score as many marks as possible.
Duration: 40 minutes

Round: Group Discussion
Experience: It went pretty well. We had a great discussion. The approach was to list out all the problems one by one and think of probable solutions for each of them. During this, general group dynamics should be taken in consideration. Respect the views and thoughts of other people. Add value to the discussion by thinking critically and bringing new content every now and then. Always be specific and speak to the point.
Tips: Read. Read and Read.
Follow google news, read relevant articles in newspapers, magazines, social media sites or any other place.
Follow Quora, It'a an amazing source to boost your knowledge around any topic.
Duration: 50 minutes

Round: HR Interview
Experience: Be spontaneous, little humorous and lastly very confident. Communication skills improve with time, so start as early as possible. Take part in discussions. Speak up !
Tips: Have a sound knowledge about the industry and the company. They just check your approach. So be very clear and critical on the approach. Have good reasons to back what ever you present. Rest will be fine.

Skills: Communication And Confidence, Analytical Skills, Business Logic, Business Acumen
College Name: Institute of Management, Nirma University

Amazon Interview FAQs

What are the top questions asked in Amazon Sdet-I interview?

Some of the top questions asked at the Amazon Sdet-I interview -

  1. Given a binary tree, count the number of occurrences where there are two nodes ...read more
  2. Given an array and a number, check whether there are any 3 elements in the arra...read more
  3. What are the things you will consider (both from Developer’s perspective and ...read more

Tell us how to improve this page.

Interview Questions from Similar Companies

Reliance Retail Interview Questions
3.9
 • 1.6k 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 Sdet-I Salary
based on 18 salaries
₹12 L/yr - ₹34.9 L/yr
45% more than the average Sdet-I Salary in India
View more details

Amazon Sdet-I Reviews and Ratings

based on 4 reviews

3.9/5

Rating in categories

3.8

Skill development

2.9

Work-life balance

4.2

Salary

2.6

Job security

2.9

Company culture

3.6

Promotions

2.9

Work satisfaction

Explore 4 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 L/yr - ₹6.5 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.1 L/yr

Program Manager
2.1k salaries
unlock blur

₹9 L/yr - ₹36 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