i
Amazon
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
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
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.
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)
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
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
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...
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
I want to learn/change 3 things about myself
Improve my communication skills
Develop better time management habits
Learn a new programming language
There was one coding question followed by some testing questions. Testing questions were of easy level.
I applied via Campus Placement and was interviewed before Apr 2023. There were 2 interview rounds.
The first circular tour that visits all petrol pumps can be found using the concept of a circular linked list.
Create a circular linked list with each node representing a petrol pump
Calculate the difference between petrol available at each pump and the distance to the next pump
Start from a pump where the sum of differences is positive and traverse the circular linked list until completing the tour
Find the pair element from the array
Iterate through the array and use a hashmap to store elements and their counts
Check if the current element's complement exists in the hashmap
Return the pair if found, otherwise return null
I applied via Campus Placement and was interviewed before Jan 2024. There was 1 interview round.
We had an aptitude test which involved 60 questions in 15 minutes. Of course, no one can solve this fast, but it was about the hit rate / accuracy and volume. Subsequent followed with two guesstimate based rounds and final as HR round which involved asking about college projects, extra curricular experiences and so on.
I applied via LinkedIn and was interviewed before Apr 2022. There were 4 interview rounds.
By analyzing data, identifying pain points, and implementing solutions to improve user experience and trust.
Analyze user behavior and feedback to identify areas of improvement
Implement measures to increase transparency and trust, such as user reviews and seller verification
Provide resources and support for dispute resolution
Encourage diversity and inclusivity in the marketplace to attract a wider range of buyers and se...
I will design a customer support system that is user-friendly, efficient, and personalized.
Conduct research to understand customer needs and preferences
Identify common customer issues and develop a knowledge base for quick resolution
Implement a ticketing system to track and prioritize customer inquiries
Integrate chatbots and AI to provide 24/7 support
Train support staff to provide personalized and empathetic service
Col...
The weight of an aircraft is crucial for its performance and safety.
The weight of an aircraft includes the weight of the aircraft itself, fuel, passengers, cargo, and any other equipment on board.
The weight of an aircraft is measured in pounds or kilograms.
The weight of an aircraft affects its takeoff and landing performance, as well as its fuel efficiency and range.
Aircraft manufacturers provide maximum takeoff and la...
I want you to provide me with challenging software development projects that will help me grow as a developer.
Challenging projects that will push my skills to the limit
Opportunities to learn new technologies and programming languages
Collaborative work environment with experienced developers
Clear communication and feedback on my work
Opportunities for career growth and advancement
I was interviewed before Jan 2021.
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.
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...
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.
Determine if the given binary tree is height-balanced. A tree is considered height-balanced when:
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'
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...
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 .
Given a string S
of length L
, determine the length of the longest substring that contains no repeating characters.
"abac...
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
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 ...
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.
Given an array ARR
and an integer K
, your task is to count all subarrays whose sum is divisible by the given integer K
.
The first line of input contains an...
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.
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.
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...
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.
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...
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...
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.
Some of the top questions asked at the Amazon Sdet-I interview -
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