i
Amazon
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
I applied via Referral and was interviewed before Aug 2023. There were 2 interview rounds.
CodeSignal. LeetCode Easy-Meduim
Behavioural questions for initial 15 mins. Live coding for 45 mins. Leetcode Medium-Hard
I applied via Company Website and was interviewed before Feb 2023. There were 2 interview rounds.
2 questions based on dynamic programming
The time complexity of the code can be determined by analyzing the number of operations performed as a function of the input size.
Time complexity is typically expressed using Big O notation, which describes the upper bound on the growth rate of the algorithm.
Common time complexities include O(1) for constant time, O(log n) for logarithmic time, O(n) for linear time, O(n^2) for quadratic time, and O(n!) for factorial ti...
Yes, it can be improved by considering alternative approaches or technologies.
Consider different algorithms or data structures for optimization
Explore new technologies or frameworks that may offer better performance
Collaborate with team members to brainstorm alternative solutions
Conduct code reviews and seek feedback for improvement
I applied via Job Fair and was interviewed before Feb 2023. There were 2 interview rounds.
Data Structures for 45 mins on Hackerrank
Kadane's algorithm is used to find the maximum subarray sum in an array of integers.
Iterate through the array and keep track of the maximum sum ending at each index.
At each index, choose between extending the previous subarray or starting a new subarray.
The final result is the maximum sum found during the iteration.
What people are saying about Amazon
I applied via LinkedIn and was interviewed before Sep 2022. There were 3 interview rounds.
2 questions medium difficulty
JSP servlets were used for dynamic web page generation and server-side processing.
Used for creating dynamic web pages by embedding Java code in HTML
Facilitates server-side processing of user requests
Enables separation of presentation and business logic
Provides scalability and reusability of code
Example: Used JSP servlets to generate personalized user profiles on a website
Amazon interview questions for designations
I applied via Company Website and was interviewed before Oct 2022. There were 4 interview rounds.
Some medium level leetcode questions
Some general behavioural questions
Get interview-ready with Top Amazon Interview Questions
I applied via Referral and was interviewed before Jul 2021. There were 3 interview rounds.
OA is tough clear it Practice DSA
Coding is super hard solve leetcode
Reverse a linked-list
Iterate through the linked-list and change the direction of the pointers
Keep track of the previous, current and next nodes
Set the head of the linked-list to the last node after reversing
To find third maximum salary in DBMS, we can use the ORDER BY and LIMIT clauses.
Use ORDER BY to sort the salaries in descending order
Use LIMIT to select the third highest salary
Example: SELECT salary FROM employees ORDER BY salary DESC LIMIT 2,1
I applied via Amazon websi and was interviewed in Aug 2020. There was 1 interview round.
DFS based question to find number of rotten tomatoes in an array of strings.
Implement DFS to traverse the array of strings
Check each element for rotten tomatoes
Keep track of the count of rotten tomatoes
I applied via Naukri.com and was interviewed in Mar 2019. There were 5 interview rounds.
Shortest path in 2D matrix
Use BFS or Dijkstra's algorithm
Create a visited matrix to avoid revisiting cells
Keep track of distance and path
Consider obstacles or blocked cells
Vertical order traversal of tree
Vertical order traversal means printing nodes of a binary tree in vertical order
We can use a map to store nodes at each horizontal distance from the root
Then we can traverse the map and print nodes in each horizontal distance
The number of binary strings of length N without consecutive 1s.
Use dynamic programming to solve the problem.
Create an array to store the number of valid strings for each length.
Initialize the array with base cases.
Iterate through the array and calculate the number of valid strings for each length.
Return the value at the Nth index of the array.
Find the first level in a complete binary tree where the height difference between left and right subtrees is more than 1.
Traverse the binary tree level by level using breadth-first search
For each level, calculate the height difference between the left and right subtrees
Return the level number when the height difference is more than 1
Find the length of the longest increasing subsequence in an array.
Use dynamic programming to solve the problem.
The time complexity of the algorithm should be O(n^2).
Example: For the array [10, 22, 9, 33, 21, 50, 41, 60, 80], the longest increasing subsequence is [10, 22, 33, 50, 60, 80] with length 6.
Some of the top questions asked at the Amazon Software Development Engineer interview -
The duration of Amazon Software Development Engineer interview process can vary, but typically it takes about 2-4 weeks to complete.
based on 31 interviews
4 Interview rounds
based on 132 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