i
Amazon
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
I applied via Referral and was interviewed before Jan 2024. There was 1 interview round.
I applied via Referral and was interviewed in May 2021. There were 5 interview rounds.
What people are saying about Amazon
I applied via Recruitment Consulltant and was interviewed before Jan 2024. There was 1 interview round.
I applied via LinkedIn and was interviewed in Nov 2024. There was 1 interview round.
I applied via Referral and was interviewed in Sep 2024. There was 1 interview round.
Print nodes of n-ary tree in arc wise manner from outside
Traverse the tree level by level from outside to inside
Use a queue to keep track of nodes at each level
Print the nodes at each level in a clockwise or anticlockwise manner
I applied via Naukri.com and was interviewed in Jan 2024. There was 1 interview round.
I analyse credit metrics of a firm by evaluating financial statements, debt levels, profitability, liquidity, and industry trends.
Reviewing financial statements to assess revenue, expenses, and profitability
Analyzing debt levels and debt-to-equity ratios to evaluate financial leverage
Assessing liquidity ratios such as current ratio and quick ratio to determine short-term solvency
Examining industry trends and economic f...
Contractual obligations are legally binding agreements between parties, while structural obligations are inherent responsibilities within a system or organization.
Contractual obligations are based on agreements between parties, often outlined in contracts or agreements.
Structural obligations are inherent responsibilities within a system or organization, such as following policies and procedures.
Contractual obligations ...
I applied via Referral and was interviewed in Feb 2024. There was 1 interview round.
posted on 19 Dec 2023
I applied via LinkedIn and was interviewed in Nov 2023. There were 2 interview rounds.
Create subarrays with sum = 0 from given array of integers.
Iterate through the array and keep track of the running sum.
Store the running sum in a hashmap and check if the current sum - any previous sum equals 0.
If yes, then the subarray between those two indices has a sum of 0.
The left view of a binary tree is the set of nodes visible when the tree is viewed from the left side.
Traverse the tree in a level order manner and keep track of the first node at each level.
Use a queue to store nodes at each level and update the left view nodes accordingly.
Example: For a binary tree with root node 1, left child 2, and right child 3, the left view would be [1, 2].
I was interviewed before Jul 2023.
45 min round. Similar to Leetcode medium level question.
45 min coding round, 2 question asked
Design a system for proximity service
Utilize geolocation data to track user locations
Implement algorithms to calculate proximity between users
Use real-time updates to notify users of nearby contacts
based on 16 reviews
Rating in categories
6-12 Yrs
₹ 50-75 LPA
Customer Service Associate
4.1k
salaries
| ₹0.6 L/yr - ₹6 L/yr |
Transaction Risk Investigator
3.1k
salaries
| ₹2.3 L/yr - ₹6.5 L/yr |
Associate
2.8k
salaries
| ₹0.8 L/yr - ₹6.9 L/yr |
Senior Associate
2.4k
salaries
| ₹2 L/yr - ₹10.1 L/yr |
Program Manager
2k
salaries
| ₹9 L/yr - ₹36 L/yr |
Flipkart
TCS
Netflix