i
Amazon
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
I applied via LinkedIn and was interviewed in Jul 2022. There were 2 interview rounds.
I applied via Company Website and was interviewed in Jan 2022. There were 2 interview rounds.
Asked 2 questions
1. Find the strings with maximum pattern match in given array of strings
2. Find the shortest distance between two target elements in given array
What people are saying about Amazon
I applied via Referral and was interviewed before Mar 2023. There was 1 interview round.
DSA round - algorithm to insert in sorted and non overlapping intervel
Amazon interview questions for designations
I was interviewed before Dec 2021.
Normal coding questions and good mcqs.
A mountain array in an array refers to an array where the elements form a peak and then descend.
The array should have a peak element and then the elements should descend on both sides.
For example, [1, 3, 5, 4, 2] is a mountain array in an array.
However, [1, 2, 3, 4, 5] is not a mountain array in an array.
Finding the median in a running stream of data.
The median is the middle value in a sorted list of numbers.
In a running stream, we cannot sort the data beforehand.
We can use a min-heap and a max-heap to keep track of the median.
As new data comes in, we add it to the appropriate heap and balance the heaps.
The median is then the top element of the larger heap or the average of the top elements of both heaps.
Get interview-ready with Top Amazon Interview Questions
I applied via campus placement at National Institute of Technology (NIT), Warangal and was interviewed before Aug 2021. There were 2 interview rounds.
2 coding questions were asked, 1 invloves sorting and manipulation and the other one was trees question.
Connect n ropes with minimum cost using priority queue
Create a priority queue and insert all the ropes into it
Pop the two smallest ropes from the queue and connect them
Insert the new rope into the queue and repeat until only one rope remains
The cost of connecting two ropes is the sum of their lengths
Time complexity: O(nlogn)
Example: Ropes of lengths 4, 3, 2, and 6 can be connected with a cost of 29
The height of the tree can be found by counting the number of edges from the root to the farthest leaf node.
Count the number of edges from the root to the farthest leaf node
This will give the height of the tree
Example: If the farthest leaf node is 4 edges away from the root, the height of the tree is 4
Leetcode medium problems
To find the middle of a linked list, use two pointers - one moving twice as fast as the other. To add two numbers, traverse both lists simultaneously and add corresponding digits.
Use two pointers to find the middle of the linked list - one moving twice as fast as the other
To add two numbers represented by linked lists, traverse both lists simultaneously and add corresponding digits
If the sum of two digits is greater th
I applied via Referral and was interviewed in Apr 2021. There were 4 interview rounds.
2 variable variation of LIS
The problem involves finding the longest increasing subsequence in two arrays
Dynamic programming can be used to solve the problem
The time complexity of the solution is O(n^2)
Example: Given two arrays [1, 3, 5, 4] and [2, 4, 3, 5], the longest increasing subsequence is [3, 5]
Example: Given two arrays [10, 22, 9, 33, 21, 50, 41, 60] and [5, 24, 39, 60, 15, 28, 27, 40], the longest increasing su
Search for an element in a rotated sorted array.
Use binary search to find the pivot point where the array is rotated.
Compare the target element with the first element of the array to determine which half to search.
Perform binary search on the selected half to find the target element.
Time complexity: O(log n), Space complexity: O(1).
Find the first non-repeating character in a continuous character stream.
Use a hash table to keep track of character frequency.
Iterate through the stream and check if the current character has a frequency of 1.
If yes, return the character as the first non-repeating character.
If no non-repeating character is found, return null or a default value.
I applied via Company Website and was interviewed before Nov 2021. There were 3 interview rounds.
General Leet Code Question and it was easy
General coding question which was from difficult
Some of the top questions asked at the Amazon Sde1 interview -
1 Interview rounds
based on 100 reviews
Rating in categories
Customer Service Associate
4.2k
salaries
| ₹0.6 L/yr - ₹5 L/yr |
Transaction Risk Investigator
3.1k
salaries
| ₹2.5 L/yr - ₹6.5 L/yr |
Associate
2.8k
salaries
| ₹0.8 L/yr - ₹7 L/yr |
Senior Associate
2.4k
salaries
| ₹2 L/yr - ₹10.1 L/yr |
Software Development Engineer
2k
salaries
| ₹16.6 L/yr - ₹33 L/yr |
Flipkart
TCS
Netflix