i
Amazon
Proud winner of ABECA 2025 - AmbitionBox Employee Choice Awards
Filter interviews by
The question is asking for the possible combinations of valid parentheses.
Use backtracking to generate all possible combinations of parentheses.
Keep track of the number of open and close parentheses to ensure they are balanced.
Exclude invalid combinations where close parentheses appear before open parentheses.
Implementing a linked list using BFS to traverse and manipulate nodes efficiently.
BFS (Breadth-First Search) explores nodes level by level, useful for linked lists with multiple branches.
Use a queue to keep track of nodes to visit next, ensuring all nodes at the current level are processed before moving deeper.
Example: For a linked list with nodes 1 -> 2 -> 3, BFS would visit 1, then 2, then 3 in that order.
...
Explore brute force and optimal solutions for a problem, detailing complexities and examples.
Brute Force: Check all combinations. E.g., finding the maximum in an array by comparing each element.
Optimal Solution: Use algorithms like divide and conquer. E.g., finding the maximum using a single pass.
Time Complexity: Brute force can be O(n^2) for nested loops; optimal can be O(n) for linear scans.
Space Complexity: Bru...
I have followed the modular design pattern while building modules.
I break down the software into smaller, independent modules that can be easily managed and maintained.
I ensure each module has a clear purpose and well-defined interfaces for communication with other modules.
I use techniques like encapsulation, abstraction, and separation of concerns to create modular designs.
Example: Using the MVC (Model-View-Contr...
What people are saying about Amazon
Merging intervals involves combining overlapping time periods into a single interval.
Sort the intervals by their start times.
Initialize an empty list to hold merged intervals.
Iterate through the sorted intervals and compare each with the last merged interval.
If they overlap, merge them by updating the end time of the last merged interval.
If they don't overlap, add the current interval to the merged list.
Example: M...
Print the boundary nodes of a tree.
Boundary nodes are the leftmost and rightmost nodes of each level of the tree and the leaf nodes that are not part of the subtree.
Traverse the tree in a clockwise direction and print the nodes as you encounter them.
Use recursion to traverse the tree and keep track of the level and whether the node is a left or right boundary node.
Copy a linked list to a new linked list using pointers, maintaining the same order and structure.
Define a new head for the destination list.
Iterate through the source list using a pointer.
For each node in the source list, create a new node in the destination list.
Copy the data from the source node to the new node.
Update the next pointer of the new node to point to the next node in the source list.
Delete the nth node in a linked list.
Traverse the linked list to find the nth node and keep track of the previous node.
Update the previous node's next pointer to skip the nth node.
Free the memory allocated to the nth node.
Swap kth node with kth last node in a singly-linked, non-circular linked list.
Traverse the linked list to find its length or use two pointers to find kth and kth last nodes.
Swap the nodes and update the pointers accordingly.
Handle edge cases such as k being out of bounds or kth and kth last nodes being the same.
Consider using recursion to traverse the linked list.
Add two long numbers and store the result in a third linked list.
Create a linked list to store the result
Traverse both input linked lists simultaneously, adding corresponding digits
Handle carry over from addition
If one linked list is longer than the other, handle remaining digits
Return the resulting linked list
I applied via Campus Placement
LeetCode questions - one medium and one hard.
The sum of the products of all subsequences in an array of strings.
Calculate the product of all elements in the array
Calculate the product of all possible subsequences
Sum up all the products of subsequences
Linked list based coding question and BST
Implementing a linked list using BFS to traverse and manipulate nodes efficiently.
BFS (Breadth-First Search) explores nodes level by level, useful for linked lists with multiple branches.
Use a queue to keep track of nodes to visit next, ensuring all nodes at the current level are processed before moving deeper.
Example: For a linked list with nodes 1 -> 2 -> 3, BFS would visit 1, then 2, then 3 in that order.
BFS c...
The question is asking for the possible combinations of valid parentheses.
Use backtracking to generate all possible combinations of parentheses.
Keep track of the number of open and close parentheses to ensure they are balanced.
Exclude invalid combinations where close parentheses appear before open parentheses.
I am a passionate software engineering student with experience in web development and a strong desire to learn and grow.
Currently pursuing a degree in Computer Science
Proficient in languages such as Java, Python, and JavaScript
Experience with web development technologies like HTML, CSS, and React
Completed internships at tech companies like XYZ Corp
VSCODE , one question asked
I want to join Amazon because of its innovative culture, vast opportunities for growth, and impact on global e-commerce.
Innovative culture: Amazon is known for its cutting-edge technology and constant drive for innovation.
Opportunities for growth: Amazon offers a wide range of projects and roles for personal and professional development.
Impact on global e-commerce: Amazon's reach and influence in the e-commerce industr...
In 5 years, I see myself as a senior software engineer leading a team of developers on innovative projects.
Leading a team of developers on innovative projects
Advancing to a senior software engineer role
Continuing to learn and grow in the field of software development
posted on 20 Sep 2024
I applied via Naukri.com and was interviewed in Aug 2024. There was 1 interview round.
Given 2 medium level questions
I applied via Company Website and was interviewed before Nov 2023. There were 2 interview rounds.
Duration of 90 min with 3 dsa questions with 2 medium and 1 hard level dsa questions.
DSA-> linked list,tree
You have to solve coding question on a Platform
Dsa questions were asked
I appeared for an interview in Aug 2023.
Solve leetcode questions and give contest which really helps to clear coding rounds
Explore brute force and optimal solutions for a problem, detailing complexities and examples.
Brute Force: Check all combinations. E.g., finding the maximum in an array by comparing each element.
Optimal Solution: Use algorithms like divide and conquer. E.g., finding the maximum using a single pass.
Time Complexity: Brute force can be O(n^2) for nested loops; optimal can be O(n) for linear scans.
Space Complexity: Brute fo...
Some of the top questions asked at the Amazon Software Development Engineer Intern interview -
The duration of Amazon Software Development Engineer Intern interview process can vary, but typically it takes about 2-4 weeks to complete.
based on 27 interview experiences
Difficulty level
Duration
based on 36 reviews
Rating in categories
Customer Service Associate
4.1k
salaries
| ₹1.8 L/yr - ₹5 L/yr |
Transaction Risk Investigator
3.1k
salaries
| ₹2.9 L/yr - ₹6.5 L/yr |
Associate
3.1k
salaries
| ₹2 L/yr - ₹5.5 L/yr |
Senior Associate
2.6k
salaries
| ₹4 L/yr - ₹9 L/yr |
Software Developer
2.3k
salaries
| ₹25.3 L/yr - ₹44 L/yr |
Flipkart
TCS
Netflix