i
Amazon
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
Clear (1)
A dsa round with standard leetcode medium questions
It was easy . Mainly cs foundation question and Linux and one DSA
Questions on Trees and Arrays
Traverse a tree to display only nodes from the right side
Start traversal from the root node
Visit the right child node first before the left child node
Use a stack or queue data structure for traversal
Example: Inorder traversal with right child first
What people are saying about Amazon
2 qns-medium level
array and strings were asked.
Amazon interview questions for designations
I applied via LinkedIn and was interviewed in Aug 2023. There were 2 interview rounds.
Coding test usually lasts 70 to 90 minutes
Find pair of adjacent elements with largest product in an array of integers
Iterate through the array and calculate the product of each pair of adjacent elements
Keep track of the pair with the largest product as you iterate
Return the largest product found
Get interview-ready with Top Amazon Interview Questions
I applied via Approached by Company and was interviewed before Sep 2023. There were 3 interview rounds.
Good knowledge of dsa is required
BST stands for Binary Search Tree, a data structure used for efficient searching, insertion, and deletion operations.
BST is a binary tree where each node has at most two children, referred to as the left child and the right child.
The key in each node must be greater than all keys stored in the left subtree and less than all keys in the right subtree.
Example: In a BST, the left child of a node contains keys less than th...
I would follow the leadership principle of 'Lead by Example'
Setting a positive example for others to follow
Demonstrating the behavior and work ethic expected from team members
Inspiring and motivating others through actions rather than just words
I applied via Campus Placement and was interviewed in Apr 2024. There were 2 interview rounds.
Overall good exp and standard questions
Tree dp graph is important for optimizing algorithms on tree structures.
Tree dp (dynamic programming) is a technique used to optimize algorithms on tree structures by storing and reusing intermediate results.
Graph algorithms on trees often involve traversing the tree in a specific order to solve a problem efficiently.
Understanding tree dp graph can help in solving problems like finding the longest path in a tree, calcu...
I applied via Company Website and was interviewed in Nov 2023. There were 2 interview rounds.
It was leetcode medium level questions
I applied via Campus Placement and was interviewed before Jul 2023. There were 2 interview rounds.
Medium hard level questions were there
Finding the median of a data stream efficiently
Use two heaps - a max heap to store the smaller half of the data and a min heap to store the larger half
Keep the two heaps balanced by ensuring the size difference is at most 1
If the total number of elements is odd, the median is the top element of the larger heap. If even, it's the average of the top elements of both heaps
I was interviewed before Feb 2024.
The first round comprised of 4 sections online questions including aptitude, logical, Coding questions, and technical portions (Test Duration: 90 mins):
Debugging: We had to choose a language and debug up to 7 questions most probably. Codes were very basic like sorting, etc. I completed 6 of them.
Coding: There were two medium-hard level questions.
Work-style Assessment: Just try to answer as an ideal employee. Make sure you answers don’t contradict each other.
Aptitude: Around 25 questions.
The diameter of a tree is the longest path between two nodes in a tree.
Calculate the longest path between two leaf nodes in the tree.
The diameter of a tree can be found by calculating the height of the left subtree, the height of the right subtree, and the sum of the heights plus 1 for the root node.
Example: For the tree 1 -> 2 -> 3 -> 4, the diameter is 3 (from node 4 to node 2).
To find the n'th node from the end of a Linked List, use two pointers approach.
Use two pointers, one moving n steps ahead of the other.
When the first pointer reaches the end, the second pointer will be at the n'th node from the end.
Handle edge cases like n being greater than the length of the Linked List.
Use Breadth First Search algorithm to find the shortest distance between 2 points in a matrix.
Implement Breadth First Search algorithm to traverse the matrix
Keep track of visited cells to avoid revisiting them
Stop the search when the destination point is reached
Some of the top questions asked at the Amazon Software Developer Intern interview -
The duration of Amazon Software Developer Intern interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 40 interviews
3 Interview rounds
based on 91 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