i
Amazon
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
Function to check if a string of parenthesis is balanced
Use a stack to keep track of opening parenthesis
If a closing parenthesis is encountered, pop from stack and check if it matches
If stack is empty and a closing parenthesis is encountered, return False
If all parenthesis are matched and stack is empty, return True
Count the occurrences of words in a paragraph.
Split the paragraph into words using whitespace as a delimiter.
Create a dictionary to store the count of each word.
Iterate through the words and increment the count in the dictionary.
Return the dictionary with the word counts.
Find common elements out of two sorted array
Use two pointers to traverse both arrays simultaneously
Compare elements at each pointer and move the pointer of the smaller element
If elements are equal, add to common elements list and move both pointers
Stop when either pointer reaches end of array
Convert a Binary Search Tree to a Doubly Linked List.
Create a DLL node class with left, right, and data fields.
Traverse the BST in-order and add each node to the DLL.
Adjust the left and right pointers of each node to create the DLL.
Return the head of the DLL.
The task is to fill the 'next' field of each node in a binary tree to point to the next node at the same level.
Use a level order traversal to process the tree nodes.
Maintain a queue to store the nodes at each level.
For each node, set its 'next' field to the next node in the queue.
If a node is the last node at its level, set its 'next' field to NULL.
To find anagrams of a given word in a dictionary, use a hash table to store sorted versions of each word as keys and their corresponding original words as values.
Create a hash table to store the anagrams
Iterate through each word in the dictionary
Sort the characters of the word and use it as a key in the hash table
If the key already exists, add the word to the list of values for that key
Print the list of values for the
Suggest a data structure for efficient search of a string in 10 files and print line number and file if string appears more than once.
Use a hash table to store the file name and line number of each occurrence of the string.
Iterate through each file and for each line, check if the string is present and update the hash table accordingly.
Print the hash table entries for the string.
Amazon is the right place for me because of its innovative culture, vast resources, and opportunities for growth.
Amazon's innovative culture aligns with my passion for pushing boundaries and finding creative solutions.
The company's vast resources provide the necessary tools and support to develop and deliver high-quality software.
Amazon offers numerous opportunities for growth and career advancement, allowing me to con...
I was interviewed in Jan 2025.
I was interviewed in Jan 2025.
What people are saying about Amazon
I was interviewed in Jan 2025.
Amazon interview questions for designations
Get interview-ready with Top Amazon Interview Questions
3 leetcode hards, followed by some system design
Designing Amazon involves creating a user-friendly e-commerce platform with a vast product selection, efficient search and recommendation algorithms, secure payment processing, and reliable delivery logistics.
Develop a user-friendly interface for easy navigation and product search
Implement recommendation algorithms based on user behavior and preferences
Integrate secure payment processing systems to protect customer inf...
To invert a binary search tree (BST), swap the left and right children of each node recursively.
Start from the root node and recursively swap the left and right children of each node.
Repeat this process for all nodes in the BST.
The final result will be the inverted BST.
The Aptitude was quite hard
The coding round was medium
I applied via Naukri.com and was interviewed in May 2024. There were 3 interview rounds.
Coding questions based on DP
I applied via Referral
2 coding question were asked
Recursively sum the values of nodes in a binary tree
Use a recursive function to traverse the tree and add the values of each node
Base case: if the current node is null, return 0
Recursive step: return the sum of current node value, left subtree sum, and right subtree sum
Hard and platformwas leetcode and geeksforgeeks
Good, leetcode medium level questions
Some of the top questions asked at the Amazon Software Engineer interview -
The duration of Amazon Software Engineer interview process can vary, but typically it takes about 2-4 weeks to complete.
based on 57 interviews
4 Interview rounds
based on 151 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.5 L/yr |
Associate
2.8k
salaries
| ₹0.8 L/yr - ₹6.9 L/yr |
Senior Associate
2.5k
salaries
| ₹2 L/yr - ₹10.1 L/yr |
Program Manager
2.3k
salaries
| ₹9 L/yr - ₹36 L/yr |
Flipkart
TCS
Netflix