i
Amazon
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
It was a online 2 hour coding test tand had 3 questions to solve
Medium level problem of dsa
I applied via Company Website and was interviewed before Feb 2023. There was 1 interview round.
The code I wrote is a function that sorts an array of integers in ascending order using bubble sort algorithm.
The code starts by iterating through the array and comparing adjacent elements, swapping them if they are in the wrong order.
This process is repeated until no more swaps are needed, indicating that the array is sorted.
The time complexity of bubble sort is O(n^2) in the worst case scenario.
Example: int[] arr = {
I applied via Campus Placement and was interviewed before Dec 2021. There were 4 interview rounds.
There is two question :
One from Sliding window : medium
Another from Graph same as leetcode island problem : medium
Solved both within time limit
What people are saying about Amazon
I applied via Referral and was interviewed before Oct 2022. There were 6 interview rounds.
Amazon interview questions for designations
I applied via Recruitment Consulltant and was interviewed before Jul 2023. There was 1 interview round.
Duration was 1 hour with Graph problem medium level.
Get interview-ready with Top Amazon Interview Questions
I applied via LinkedIn and was interviewed in Aug 2021. There were 5 interview rounds.
Platform - HackerRank
Duration - 2 hrs
Question Types - 2 coding question and some behavioural question
first question was related to hashing concept and 2nd was related to BFS concept and 1 more thing that you have to also explain your approach and time complexity of your code that you have written.
I applied via Referral and was interviewed before Jun 2021. There were 5 interview rounds.
Medium hard questions with mcq.
Find maximum number of intersections in a given time range.
Consider all the intervals and their start and end times.
Sort the intervals based on their start times.
Use a priority queue to keep track of the intervals that are currently active.
Update the maximum number of intersections whenever a new interval is added or removed from the priority queue.
Finding the median of a stream of numbers.
Maintain two heaps, one for smaller half and one for larger half of the stream.
If the heaps are of equal size, median is the average of the top elements of both heaps.
If the heaps are of different sizes, median is the top element of the larger heap.
Add new elements to the appropriate heap and balance the heaps accordingly.
I applied via Referral and was interviewed in Jun 2018. There were 6 interview rounds.
Remove duplicates from a list
Create a new empty list
Loop through the original list
If an element is not in the new list, add it
Return the new list
Count the number of islands in a 2D grid of 1s and 0s.
An island is a group of connected 1s (horizontally or vertically).
Use DFS or BFS to traverse the grid and mark visited cells.
Count the number of times you start a traversal from an unvisited 1.
Design a system for making table reservations at a restaurant.
Create a user-friendly interface for customers to make reservations
Allow customers to select date, time, and party size
Provide real-time updates on table availability
Integrate with the restaurant's seating chart and reservation system
Send confirmation emails or texts to customers
Allow customers to modify or cancel reservations
Provide analytics for the restau
I appeared for an interview before Dec 2020.
Round duration - 90 minutes
Round difficulty - Hard
This was an online coding round where we were supposed to solve 2 questions under 90 minutes . Both the questions in my set were related to Graphs and were quite tricky and heavy to implement.
Given a directed graph with a specified number of vertices V
and edges E
, your task is to calculate the total number of distinct paths from a given source node S
to all ot...
Calculate the total number of distinct paths from a given source node to all other nodes in a directed graph.
Use dynamic programming to keep track of the number of paths from the source node to each node in the graph.
Consider using modular arithmetic to handle large numbers and prevent overflow.
Start by initializing the number of paths from the source node to itself as 1.
Iterate through the edges of the graph and updat...
You are provided with a number of courses 'N', some of which have prerequisites. There is a matrix named 'PREREQUISITES' of size 'M' x 2. This matrix indicates that fo...
Given courses with prerequisites, determine a valid order to complete all courses.
Use topological sorting to find a valid order of courses.
Create a graph with courses as nodes and prerequisites as edges.
Start with courses that have no prerequisites and remove them from the graph.
Continue this process until all courses are taken or there are no valid courses left.
If there is a cycle in the graph, it is impossible to com
Round duration - 60 Minutes
Round difficulty - Medium
This was a Data Structures and Algorithms round with some standard questions . I was expected to come up with an
efficient approach and code it as well .
You are provided with 'N' intervals, each containing two integers denoting the start time and end time of the interval.
Your task is to merge all overlapping intervals a...
Merge overlapping intervals and return sorted list of merged intervals.
Sort the intervals based on start times.
Iterate through intervals and merge overlapping intervals.
Return the merged intervals in sorted order.
Given a 2-dimensional binary matrix called Mat
of size N x M that consists solely of 0s and 1s, find the length of the longest path from a specified source cell to a destina...
Find the length of the longest path from a source cell to a destination cell in a binary matrix.
Use depth-first search (DFS) to explore all possible paths from source to destination.
Keep track of visited cells to avoid revisiting them.
Return the length of the longest path found, or -1 if no path exists.
Round duration - 50 Minutes
Round difficulty - Medium
This was also a DSA round where I was asked to code only one of the questions but I eventually ended up coding both
as I had some spare time and explained my approches very smoothly to the interviewer . This round went preety well .
Given an array of integers with 'N' elements, determine the length of the longest subsequence where each element is greater than the previous element. This...
Find the length of the longest strictly increasing subsequence in an array of integers.
Use dynamic programming to solve this problem efficiently.
Initialize an array to store the length of the longest increasing subsequence ending at each index.
Iterate through the array and update the length of the longest increasing subsequence for each element.
Return the maximum value in the array as the result.
Given a rotated sorted array ARR
of size 'N' and an integer 'K', determine the index at which 'K' is present in the array.
1. If 'K' is not present...
Given a rotated sorted array, find the index of a given integer 'K'.
Use binary search to find the pivot point where the array is rotated.
Then perform binary search on the appropriate half of the array to find 'K'.
Handle cases where 'K' is not present in the array by returning -1.
Round duration - 50 Minutes
Round difficulty - Medium
This was also a DSA round with 2 questions of Medium to Hard difficulty . I was expected to follow some clean code and OOPS principles to write the code in this round .
Given an array of integers ARR
and an integer K
, determine the rank of the element ARR[K]
.
The rank of any element in ARR
is defined as the number of elem...
Given an array and an index, find the number of elements smaller than the element at that index appearing before it in the array.
Iterate through the array up to index K and count the number of elements smaller than ARR[K].
Return the count as the rank of ARR[K].
Handle edge cases like empty array or invalid index K.
Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:
1. get(key)
- Return the value of the key if it exists in the cache; otherw...
Design a Least Recently Used (LRU) cache data structure that supports get and put operations with capacity constraint.
Implement a doubly linked list to maintain the order of recently used keys.
Use a hashmap to store key-value pairs for quick access.
Update the order of keys in the linked list on get and put operations.
Evict the least recently used key when the cache reaches its capacity.
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.
I applied via Naukri.com and was interviewed before Nov 2020. There were 3 interview rounds.
based on 6 interviews
2 Interview rounds
based on 41 reviews
Rating in categories
Bangalore / Bengaluru
0-4 Yrs
Not Disclosed
Customer Service Associate
4.2k
salaries
| ₹0.6 L/yr - ₹6.8 L/yr |
Transaction Risk Investigator
3.1k
salaries
| ₹2 L/yr - ₹6.1 L/yr |
Associate
2.9k
salaries
| ₹0.8 L/yr - ₹7 L/yr |
Senior Associate
2.5k
salaries
| ₹2 L/yr - ₹10.5 L/yr |
Program Manager
2.4k
salaries
| ₹9 L/yr - ₹37 L/yr |
Flipkart
TCS
Netflix