i
Amazon
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
Dynamic Programing, string manipulation
Largest common ancestor is the most recent node that is a common ancestor of two or more nodes in a tree.
It is commonly used in computer science and genealogy.
In genealogy, it refers to the most recent common ancestor of two or more individuals.
In computer science, it is used in algorithms for finding the lowest common ancestor of two nodes in a tree.
It can be found using various algorithms such as Tarjan's off-line le...
Rain water trapping problem refers to the accumulation of rainwater in low-lying areas or on flat roofs.
The problem can be solved by installing rainwater harvesting systems.
Proper drainage systems can also prevent rainwater trapping.
Green roofs and permeable pavements can help absorb rainwater.
Rain gardens can be created to collect and filter rainwater.
Regular maintenance of gutters and downspouts can prevent clogging ...
1. Question on Graph LC-Hard 2. Question on BFS LC-Medium
Find missing number in array without extra space
Iterate through the array and XOR all the elements with their indices and the actual numbers
The missing number will be the XOR result
Example: ['1', '2', '4', '5'] -> XOR(0, 1) ^ XOR(1, 2) ^ XOR(2, 4) ^ XOR(3, 5) = 3
Implementing Heap data structure in C++
Use an array to represent the binary tree structure of the heap
Implement functions for inserting elements, deleting elements, and heapifying the array
Ensure that the heap property is maintained (parent node is always greater than or equal to its children)
LRU Cache is a data structure that stores a fixed number of items and removes the least recently used item when the cache is full.
Use a combination of a doubly linked list and a hashmap to efficiently implement LRU Cache.
Keep track of the least recently used item at the tail of the linked list.
When an item is accessed, move it to the head of the linked list to mark it as the most recently used item.
When adding a new it...
A linked list is a linear data structure where elements are stored in nodes with each node pointing to the next node in the sequence.
Consists of nodes connected by pointers
Does not have a fixed size like arrays
Can easily insert or delete elements without shifting other elements
Examples: Singly linked list, Doubly linked list, Circular linked list
Sets in JavaScript are used to store unique values of any type.
Create a new set using the Set constructor
Add values to the set using the add() method
Check if a value exists in the set using the has() method
Remove a value from the set using the delete() method
Iterate over the set using the forEach() method
What people are saying about Amazon
I applied via Referral and was interviewed in Jun 2023. There were 5 interview rounds.
2 questions of leetcode medium level
And also has to write the steps of the approaches
Dynamic programming problem involving arrays of strings.
Use dynamic programming to efficiently solve problems by breaking them down into smaller subproblems.
Consider using a 2D array to store intermediate results for optimal substructure.
Examples: Longest Common Subsequence, Word Break, Minimum Path Sum.
Amazon interview questions for designations
3 Coding question on hackerrank (graph leet code medium)
Find the final element in a rotated array.
Identify the pivot point where the array was rotated.
Determine if the target element is in the first or second half of the array.
Use binary search to find the target element.
Reorder a linked list in place.
Use two pointers to find the middle of the list
Reverse the second half of the list
Merge the two halves of the list
Finding the intersection point of two linked lists.
Traverse both lists and find their lengths
Move the head of the longer list by the difference in lengths
Traverse both lists simultaneously until they meet at the intersection point
Calculate the sum of all paths between two nodes in a binary tree.
Traverse the tree and keep track of the path and its sum from the root to the current node.
When the target nodes are found, calculate the sum of all paths between them by adding the path sums of their common ancestor.
Recursively traverse the left and right subtrees to find the target nodes.
Use a hash table to store the path sums of each node for efficien...
Get interview-ready with Top Amazon Interview Questions
45 minutes
2 medium level questions
Binary Search Tree Traversal, 20 min, Leetcode
Caching is the process of storing frequently accessed data in a temporary storage to improve performance.
Caching improves performance by reducing the need to fetch data from the original source.
It involves storing data in a temporary storage, such as memory or disk, closer to the user or application.
Caching can be done at various levels, including browser caching, server-side caching, and database caching.
Examples of c...
POST requests are a type of HTTP request method used to submit data to a server.
POST requests are used to create or update resources on a server.
They are commonly used in web forms to submit user input data.
POST requests have a request body that contains the data being submitted.
They are different from GET requests, which are used to retrieve data from a server.
POST requests are more secure than GET requests because th
I applied via campus placement at National Institute of Technology (NIT), Warangal and was interviewed before Dec 2023. There were 3 interview rounds.
Coding test on Amazon own website
Assessment of 2 coding questions in 70 minutes + behaviour questions
I applied via campus placement at Vasavi College of Engineering, Hyderabad and was interviewed before Jul 2023. There were 3 interview rounds.
Basic leetcode and hard one question
Matrix multiplication involves multiplying the elements of one matrix with another matrix.
Create two matrices with compatible dimensions
Multiply corresponding elements of each row in the first matrix with each column in the second matrix
Sum the products to get the resulting matrix
Some of the top questions asked at the Amazon Sde1 interview -
1 Interview rounds
based on 100 reviews
Rating in categories
Customer Service Associate
4.2k
salaries
| ₹0.6 L/yr - ₹5 L/yr |
Transaction Risk Investigator
3.1k
salaries
| ₹2.5 L/yr - ₹6.5 L/yr |
Associate
2.8k
salaries
| ₹0.8 L/yr - ₹7 L/yr |
Senior Associate
2.4k
salaries
| ₹2 L/yr - ₹10 L/yr |
Software Development Engineer
2k
salaries
| ₹16.6 L/yr - ₹33 L/yr |
Flipkart
TCS
Netflix