i
Amazon
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
Clear (1)
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 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.
based on 6 interviews
2 Interview rounds
based on 41 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.8k
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