i
Amazon
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
I applied via LinkedIn
Search for a specific string in an array of strings.
Iterate through the array and compare each string with the target string.
Use a loop to go through each element in the array and check for a match.
Consider using built-in methods like indexOf() or includes() for efficient searching.
Handle cases where the target string is not found in the array.
Search for a specific string in an array of strings.
Iterate through the array and compare each string with the target string.
Use a loop to go through each element in the array and check for a match.
Consider using built-in methods like indexOf or includes for efficient searching.
Find all subarrays in a given array of strings
Iterate through the array and consider each element as the starting point of a subarray
For each starting point, iterate through the array to find all possible subarrays
Store each subarray found in a separate list
Use stack data structure to check for balanced parentheses in a string.
Create an empty stack to store opening parentheses
Iterate through the string and push opening parentheses onto the stack
When encountering a closing parenthesis, pop from the stack and check if it matches the corresponding opening parenthesis
If stack is empty at the end and all parentheses have been matched, the string is balanced
A mean heap is a data structure that minimizes the cost of accessing the smallest element.
Mean heap is a type of binary heap where the value of each node is less than or equal to the values of its children.
It is useful for finding the minimum element quickly, as the root node always contains the smallest value.
Insertion and deletion operations in a mean heap have a time complexity of O(log n).
I applied via LinkedIn and was interviewed in Oct 2024. There were 2 interview rounds.
DSA medium level 2 question based on graph and recursion
I applied via LinkedIn and was interviewed in Sep 2024. There was 1 interview round.
What people are saying about Amazon
Prime numbers usung sieve if erastothenesis
Amazon interview questions for designations
I applied via Company Website and was interviewed in May 2024. There was 1 interview round.
Amazon Chime interview with questions on DSA
Function to return mutual friends given two ids and getFriends(id) function
Call getFriends(id) for both ids to get their respective friend lists
Iterate through both lists and compare to find mutual friends
Return the list of mutual friends
Function to return list of friends of friends in decreasing order of mutual friends
Use a set to store all friends of friends
Iterate through the list of friends of the given id
For each friend, iterate through their list of friends and count mutual friends
Sort the set of friends of friends by decreasing number of mutual friends
Given time slots, find a specific time with maximum overlap. Prove solution.
Create a list of all start and end times
Sort the list in ascending order
Iterate through the list and keep track of the number of overlaps at each time
Return the time with the maximum number of overlaps
Prove solution by testing with different input sizes and edge cases
Find the longest sub-array with increasing order of integers.
Iterate through the array and keep track of the current sub-array's start and end indices.
Update the start index whenever the current element is smaller than the previous element.
Update the end index whenever the current element is greater than or equal to the next element.
Calculate the length of the sub-array and compare it with the longest sub-array found s
Find the length of longest increasing subsequence and print the sequence from an array of integers.
Use dynamic programming to solve the problem
Create an array to store the length of longest increasing subsequence ending at each index
Traverse the array and update the length of longest increasing subsequence for each index
Print the sequence by backtracking from the index with the maximum length
Time complexity: O(n^2)
Exam...
Code to find a given integer in a rotated sorted array.
Use binary search to find the pivot point where the array is rotated.
Divide the array into two subarrays and perform binary search on the appropriate subarray.
Handle edge cases such as the target integer not being present in the array.
Use a min-heap to keep track of the largest K numbers seen so far.
Create a min-heap of size K.
For each incoming integer, add it to the heap if it's larger than the smallest element in the heap.
If the heap size exceeds K, remove the smallest element.
At the end, the heap will contain the largest K numbers in the input.
LRU Cache is a data structure that stores the most recently used items and discards the least recently used items.
Use a doubly linked list to keep track of the order of items in the cache
Use a hash map to store the key-value pairs for fast access
When an item is accessed, move it to the front of the linked list
When the cache is full, remove the least recently used item from the back of the linked list and the hash map
Solution to performing operations on a large array of bits.
Use bitwise operators to perform operations on individual bits
Use a loop to iterate through the array and perform the operations
Ensure that the array is large enough to accommodate all the bits
Consider using a data structure like a bitset for efficient bit manipulation
I appeared for an interview before May 2021.
Round duration - 90 Minutes
Round difficulty - Medium
it was time bound coding test round. The questions were from array and string. There were 2 questions.
Determine whether a given string str
can be considered a K-Palindrome.
A string is considered a K-Palindrome if it can be transformed into a palindrome after removing up to...
The problem is to determine whether a given string can be considered a K-Palindrome by removing up to 'k' characters.
Iterate through the string from both ends and check if characters match, if not increment removal count
If removal count is less than or equal to k, return True, else return False
Use dynamic programming to optimize the solution by storing subproblem results
Round duration - 30 Minutes
Round difficulty - Easy
in this round manager spoke to me and explained about project and joining date later hr spoke to me regarding on boarding process
Tip 1 : Practise Data structures mostly (Array, String and Tree) , practise as much questions as you can.
Tip 2 : Have Good knowledge of Tech Stack you mention in your resume
Tip 3 : Have good understanding of projects mentioned in your resume.
Tip 1 : Resume should be having one page or maximum two pages long
Tip 2 : Mention your role on each project.
I applied via Company Website and was interviewed in Sep 2023. There were 2 interview rounds.
Implement an iterator to flatten 2D vector
Use Dijkstra's algorithm to find the shortest path to get all keys
Implement Dijkstra's algorithm to find the shortest path in a graph
Consider the keys as nodes in the graph and the paths between keys as edges
Keep track of the keys collected and update the shortest path accordingly
based on 5 interviews
1 Interview rounds
based on 5 reviews
Rating in categories
Customer Service Associate
4.2k
salaries
| ₹0.6 L/yr - ₹6.8 L/yr |
Transaction Risk Investigator
3.1k
salaries
| ₹2.3 L/yr - ₹6.3 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.1k
salaries
| ₹9 L/yr - ₹36 L/yr |
Flipkart
TCS
Netflix