AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
i
Amazon
Compare
Filter interviews by
Clear (1)
Amazon Sdet-I Interview Questions, Process, and Tips
Amazon Sdet-I Interview Experiences
1 interview found
Anonymous
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
- 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.
- 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)
- 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
- 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
- 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...
- 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
- 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
- Q16. Again several team fit questions
Interview Preparation Tips
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
Rate your
company
🤫 100% anonymous
How was your last interview experience?
Interview questions from similar companies
Interview Questionnaire
1 Question
- Q1. Oops Programming
There was one coding question followed by some testing questions. Testing questions were of easy level.
(1 Question)
- Q1. I was asked about bubble sort and some basic dsa question. The interview went for 20 min.
(1 Question)
- Q1. Again I was asked some basic dsa and sorting algorithm with my project discussion.
Interview Preparation Tips
Interview Preparation Tips
Experience: GD was conducted for shortlisted candidates and candidates were divided into groups of 6 people.There were 3 topics and each topic was discussed for 2 minutes.No specific rules,like each person needs to speak,are to be followed during the GD.Anyone can initiate,intervene,etc. Finally we were asked to link all three topics and this discussion went on for another 2 minutes.
Round: HR Interview
Experience: Only a single round lasting about 40-45 minutes.There were only 4 people in the panel and technical as well as HR questions were asked. First I was asked to go through my own resume, “Introduce/Tell us about yourself?". E.g.:“Where have you shown leadership qualities?Have you led a
team?Size of team? What new initiatives did you take?”.Core questions starting form basics like “How does an airplane fly?” to specific questions about the different types of engines used in airplanes,their specifications, etc. were asked. HR questions were put up like"What was the most difficult decision in your life?" and grilled on my internship for 15-20 minutes which I did in Transocean. (Another oil field services company).
General Tips: You need to be very good in the basics of your
core courses and if you have done an internship in the oil industry,
you will definitely be grilled on that.Questions will be asked in quick succession.
Skill Tips: Highlight any intern in Oil industry or anything related to that in your resume.Any POR or any sport activity which shows your leadership qualities should me mentioned in your resume.
Skills: Leadership qualities, Athletic, Quick thinking, presence of mind
College Name: IIT MADRAS
Adithya H K Upadhya
Interview Preparation Tips
Experience: An aptitude test which was followed by three rounds of technical interviews and finally the HR interview.
Round: HR Interview
Experience: Snapdeal offered placements for 5 students (3 from CS and 2 from IT).
General Tips: Be extremely well prepared for any company. Research about the company's profile extensively before the company's interview. HR panel always looks for candidates who are well aware of the company in order to measure the candidate's interest. Data structures are absolutely necessary for any company. Improve coding skills through frequent participation in competitive programming arena such as codeForces, codeChef, HackerEarth etc. "Software development job profile was offered to me.
Unnecessary and irrelevant questions are to be avoided. We should raise questions only if we have some genuine questions. However any question related to job profile or location preference could be raised. "
"It was very grueling and tiring at first but the sweet taste of placement makes it all worth it.
Placements are a turning point in everybody's career."
Skill Tips: Snapdeal is more focussed on Data structures and object oriented technology.
For data structures, online materials such as GeeksforGeeks are excellent and in case of OOPS concepts, stronghold in either C++ or java programming language is necessary.
Skills:
College Name: NIT Surathkal
Aman Jain
Interview Preparation Tips
Experience: Algorithmic coding test was conducted on hackerank platform. Around 60 students gave online test. There were 4-5 algo questions to be done in 90 mins duration.
Tips: Try to do at least 2 questions.
Round: Technical Interview
Experience: First Interviewer asked me to introduce myself. Then he asked me questions on data structures & Algo. He asked me about tree data structures, why it is used, time complexities of various operations on tree, balancing of tree, AVL Tree. He asked me write AVL Tree insertion, deletion, update code. Then he jumps to BTree, B+Tree and asks me write code on paper for various operations. Questions were asked on indexing, various types of indexing, how it is used in databases, etc. Then he briefly asked about the project I done in my internship.
Round: Technical Interview
Experience: Interviewer asked me how was my 1st round, I said it was great. He first asked me introduce myself. Then he asked about my projects mentioned in my resume. I done a project in machine learning on spam webpage detection. He was interested in that. He asked me what language, libraries I used to implement that project. Then he gave me real time scenario to predict whether an item is explosive or not. Then I approached this problem and asked information related to problem. He was impressed by the approach I target the problem. He asked me what machine learning model will be best and what are their pros and cons. Then he asked me question that given 100 sorted linked lists, you have to merge them and return single sorted linked list. I gave 3-4 solutions with their time & space complexities.
Round: HR Interview
Experience: Interviewer asked me common HR questions like tell me about yourself, my family background, why do you want to join the company, what impact you can make in Snapdeal, why should we hire you. After that he congratulated me for the role of SDE at Snapdeal. I was very happy at that moment.
All the 5 students cleared this round.
Skills: SQL, ML, Algorithms And Data Structures, Python, Basic C/C++
College Name: IIT Guwahati
I was interviewed before Apr 2021.
(2 Questions)
Round duration - 90 minutes
Round difficulty - Easy
There were 22 MCQ questions of aptitude and technical based while 3 questions were of coding type.
Tips: MCQ questions were not time consuming , so try to do that questions in less time , so you will get enough time for coding questions.
- Q1.
Balanced Parentheses Check
Given a string
STRconsisting solely of the characters '{', '}', '(', ')', '[', and ']', determine whether the parentheses are balanced.Input:
The first line contains an inte... - Ans.
Implement a function to check if parentheses in a string are balanced.
Use a stack to keep track of opening parentheses and pop when a closing parenthesis is encountered.
If the stack is empty when a closing parenthesis is encountered or if there are unmatched parentheses at the end, return 'NO'.
Ensure that all opening parentheses have a corresponding closing parenthesis in the correct order.
Return 'YES' if all parenthes...
- Q2.
Find the Next Greater Number with the Same Set of Digits
Given a string
Sthat represents a number, determine the smallest number that is strictly greater than the original number and has the same set of ... - Ans.
The task is to find the smallest number greater than the given number with the same set of digits.
Sort the digits of the number in descending order.
Find the first digit from the right that is smaller than the digit to its right.
Swap this digit with the smallest digit to its right that is greater than it.
Sort all the digits to the right of the swapped digit in ascending order to get the smallest number greater than the
(2 Questions)
Round duration - 60 minutes
Round difficulty - Medium
My experience was very awesome , I answered all the questions , although in starting I was very nervous , so at starting interviewer help me get my confidence, interviewer was very helpful.
- Q1.
Maximum Level Sum in Binary Tree Problem Statement
Given an arbitrary binary tree consisting of N nodes, where each node is associated with a certain value, your task is to find the maximum sum for any le...
- Ans.
Find the maximum sum for any level in a binary tree.
Traverse the binary tree level by level and calculate the sum for each level.
Keep track of the maximum sum encountered so far.
Return the maximum sum found.
Example: For the input tree, the maximum level sum is 13 (5+6+2).
- Q2.
Find Top K Frequent Numbers in a Stream
Given an integer array
ARRand an integerK, your task is to find theKmost frequent elements inARR. Return the elements sorted in ascending order.Example:
Inp...
- Ans.
Find the K most frequent elements in an integer array and return them sorted in ascending order.
Use a hashmap to store the frequency of each element in the array.
Use a min heap to keep track of the K most frequent elements.
Return the elements from the min heap in ascending order.
(2 Questions)
Round duration - 60 minutes
Round difficulty - Easy
This round was based on DSA and questions on core subjects that I had studied throughout college.
- Q1.
Vertical Sum in a Binary Tree
Given a binary tree where each node has a positive integer value, compute the vertical sum of the nodes. The vertical sum is defined as the sum of all nodes aligned along the...
- Ans.
Compute the vertical sum of nodes in a binary tree aligned along the same vertical line.
Traverse the binary tree in a level order manner to calculate the vertical sum.
Use a hashmap to store the vertical sum at each vertical level.
Recursively traverse the tree and update the vertical sum in the hashmap.
Output the vertical sums in the required format for each test case.
- Q2. What is TCP/IP?
- Ans.
TCP/IP is a set of protocols that governs the way data is transmitted over the internet.
TCP/IP stands for Transmission Control Protocol/Internet Protocol.
It is a suite of communication protocols used to connect devices on the internet.
TCP ensures that data is reliably transmitted between devices.
IP is responsible for addressing and routing data packets across networks.
Examples of TCP/IP protocols include HTTP, FTP, and
Round duration - 30 minutes
Round difficulty - Easy
Experience : Keep confidence and show them good communication skills. Previous round's performance also matters in this rounds
Interview Preparation Tips
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.
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.
Skills evaluated in this interview
I was interviewed before Apr 2021.
(1 Question)
Round duration - 60 minutes
Round difficulty - Easy
In the interview I was asked few puzzles and few coding problems.
In the coding questions the interviewers did not ask me to write down the complete codes of the problems, they only asked me to suggest some suitable algorithms.
- Q1.
Count Set Bits Problem Statement
Given a positive integer
N, find the total number of '1's in the binary representation of all the numbers from 1 toN.You should return the result modulo 109+7 as the co...
- Ans.
Count the total number of set bits in the binary representation of numbers from 1 to N, modulo 10^9+7.
Iterate through numbers from 1 to N and count the set bits in their binary representation
Use bitwise operations to count set bits efficiently
Return the total count modulo 10^9+7 as the result
(1 Question)
Round duration - 45 minutes
Round difficulty - Easy
In second round of interview I was asked some hardcore programming questions on data structures since I wrote it as my area of interest.
I was asked some puzzles as well.
- Q1.
Merge Two Sorted Arrays Problem Statement
Given two sorted integer arrays
ARR1andARR2of size M and N, respectively, merge them intoARR1as one sorted array. Assume thatARR1has a size of M + N to hol... - Ans.
Merge two sorted arrays into one sorted array in place.
Iterate from the end of both arrays and compare elements to merge in place
Use two pointers to keep track of the current position in both arrays
Handle cases where one array is fully merged before the other
Interview Preparation Tips
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.
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.
Skills evaluated in this interview
Interview Questionnaire
1 Question
- Q1. Questions based on tree
Interview Preparation Tips
Experience: Keep your Calm
Tips: Practice matters
Duration: 90 minutes
Total Questions: 30
Round: Interview
Tips: They are not going to eat you.. they will help you out only...
So just go inside the interview room as some of your friends called you to ask some question..relax
Skills: Thinking Process
College Name: IIT GUWHATI
Piyush Raman
Interview Questionnaire
7 Questions
- Q1. Discussion on internship at IBM' Cloud Unit
- Q2. Find LCM of all numbers from 1 to n. Give an algorithm, then correctly estimate the time complexity
- Ans.
Algorithm to find LCM of all numbers from 1 to n and its time complexity
Find prime factors of all numbers from 1 to n
For each prime factor, find the highest power it appears in any number from 1 to n
Multiply all prime factors raised to their highest power to get LCM
Time complexity: O(n*log(log(n)))
- Q3. SQL vs NoSQL. Why NoSQL
- Ans.
NoSQL databases are flexible, scalable, and can handle large amounts of unstructured data.
NoSQL databases are schema-less, allowing for easy and flexible data modeling.
They can handle large amounts of unstructured data, making them suitable for big data applications.
NoSQL databases are highly scalable and can easily handle high traffic and large user bases.
They provide horizontal scalability by distributing data across...
- Q4. Some DBMS designing question relating to Snapdeal website
- Q5. JAVA-Spring and Hibernate
- Q6. Variation of -----/ Given a dictionary of words and a number n. Find count of all words in dictionary that can be formed by given number n
- Ans.
The question asks to find the count of words in a dictionary that can be formed by a given number.
Iterate through each word in the dictionary
Check if the characters in the word can be formed using the given number
Increment the count if the word can be formed
- Q7. Given an array of elements. We can perform following operation only- Increase an array element. Cost of operation is the amount of increment made per array element. Now for a given H, we need to make any H...
Interview Preparation Tips
Experience: I did both coding question ( 1 full and 2nd partial ) and 5 MCQ only and was shortlisted
Tips: Refer to interview sets on Geeksforgeeks.
Do solve both the coding questions first. Not necessary to pass all test cases for both.
Then go for C based o/p questions. At last aptitude.
Duration: 60 minutes
Total Questions: 23
Round: Technical Interview
Experience: I did not know JAVA and DBMS so could not answer any of the last 2 questions. I told him directly thati had no experience in JAVA / DBMS and justified. I had proficiency in Data Structure and Algorithms and I beleive the interviewer liked my internship work on Cloud / Virtualization
Tips: Focus on Data Strucure-Algorithms, JAVA, DBMS, Puzzles
Round: Test
Experience: All repeated questions from previous interviews.
Tips: Refer interview set from geeksforgeeks.org
Duration: 60 minutes
Total Questions: 3
Round: Technical Interview
Experience: For the first question, I started by exponential solution and reduced it to polynomial. We
discussed various approaches and tried a variety of methods and after
1-1.5 hrs of discussion finally ended up with an O(1) solution with some
pre-processing overhead. After achiveing O(1) time complexity, he asked
to further optimize the space complexity.
Usage of Trie / TST. Internal Implementation of Hashing structure and replacing the hashing mechanism using Trie / TST.
Tips: Focus on Tree, Stacks, Queue, Linked List, Hash Maps, Trie, Hashing, String Algorithms, Ternary Search Tree
Round: HR Interview
Experience: Typical HR
General Tips: Practice programming
Skill Tips: Focus on Data Structure-Algorithms and programming in either C++ / JAVA
Skills: Data Structure, Algorithms, Programing, JAVA, DBMS
College Name: Indian Institute of Information Technology, Design and Manufacturing, Jabalpur
Motivation: -
Funny Moments: -
Skills evaluated in this interview
Amazon Interview FAQs
Some of the top questions asked at the Amazon Sdet-I interview -
Recently Viewed
SALARIES
Arcesium
DESIGNATION
SALARIES
Coal India
REVIEWS
Coal India
No Reviews
JOBS
Amadeus
No Jobs
REVIEWS
Arcesium
No Reviews
REVIEWS
Arcesium
No Reviews
SALARIES
Arcesium
REVIEWS
Coal India
No Reviews
REVIEWS
Arcesium
No Reviews
Tell us how to improve this page.
Amazon Interviews By Designations
- Amazon Software Developer Interview Questions
- Amazon Customer Service Associate Interview Questions
- Amazon Customer Service Executive Interview Questions
- Amazon Transaction Risk Investigator Interview Questions
- Amazon Software Developer Intern Interview Questions
- Amazon Associate Interview Questions
- Amazon Seller Support Associate Interview Questions
- Amazon Software Engineer Interview Questions
- Show more
Interview Questions for Popular Designations
- Sdet Interview Questions
- Sde1 Interview Questions
- Sdet Automation Test Engineer Interview Questions
- Sdet Engineer Interview Questions
- SDE Intern Interview Questions
- Sdet Lead Interview Questions
- Senior Sdet Engineer Interview Questions
- Sdet (Software Development Engineer in Test) Interview Questions
- Show more
Anonymously discuss salaries, work culture, and many more
Get Ambitionbox App
Interview Questions from Similar Companies
Fast track your campus placements
Amazon Sdet-I Reviews and Ratings
based on 4 reviews
Rating in categories
|
Customer Service Associate
4.2k
salaries
|  ₹0 L/yr - ₹0 L/yr |
|
Transaction Risk Investigator
3.1k
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Associate
2.9k
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Senior Associate
2.5k
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Program Manager
2.1k
salaries
| ₹0 L/yr - ₹0 L/yr |
Flipkart
TCS
Netflix
- Home >
- Interviews >
- Amazon Interview Questions >
- Amazon Sdet-I Interview Questions
