i
Amazon
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
I applied via Ammbison box
I applied via Naukri.com and was interviewed in Jan 2021. There was 1 interview round.
I applied via Referral and was interviewed in Apr 2021. There were 3 interview rounds.
What people are saying about Amazon
posted on 31 Aug 2015
Travel to all 7 continents, learn a new language, and write a book.
Travel to Antarctica, Africa, and Australia
Learn Spanish fluently
Write a memoir about my travels
Burger King launched a digital campaign to attract millennials and used social media platforms to engage with customers.
Launched a digital campaign to attract millennials
Used social media platforms to engage with customers
Created a mobile app for ordering and delivery
Partnered with food delivery apps like Swiggy and Zomato
Offered exclusive discounts and deals for online orders
Sales is the lifeblood of any business. It's the art of convincing people to buy your product or service.
Sales is crucial for revenue generation and business growth
It involves building relationships with customers and understanding their needs
Sales requires effective communication, negotiation, and problem-solving skills
Examples: Closing a deal, upselling, cross-selling, lead generation, etc.
We can offer PVR a revenue-sharing model and exclusive access to our customer base.
Propose a revenue-sharing model that benefits both parties
Highlight the potential for increased revenue through exclusive access to our customer base
Offer marketing and promotional support to increase PVR's visibility
Provide data and analytics to help PVR make informed business decisions
Negotiate a mutually beneficial agreement that alig
Groupon is a leading platform for local commerce that connects customers with businesses.
Groupon offers great deals and discounts on a wide range of products and services.
It helps businesses to attract new customers and increase their revenue.
Groupon has a large customer base and a strong brand reputation.
It provides a user-friendly platform for customers to discover and purchase deals.
Groupon has a proven track record
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
based on 6 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