Amazon Software Development Engineer Interview Questions, Process, and Tips

Q1. Leetcode medium
Add your answer
Q2. LLD round not very difficult
Add your answer

Ds and Algo, tree, array String

DS Algo, Tree Array grapH String

Q1. Behavioural questions
Add your answer

Q1. 1 on DS Algo LC medium
Add your answer
Q2. Behavioural questions
Add your answer

1hr with two DSA questions, one is printing nth row of pascal triangle,
other I donot remember

Q1. Diagonal traversal of a binary tree
Ans. 
Diagonal traversal of a binary tree involves printing the nodes of the tree in a diagonal pattern.
• Start with the root node and move to its right child, then move down to its left child.

• Repeat this process for each diagonal of the tree, printing the nodes as you traverse.

• Use a queue to keep track of the nodes at each level of the tree.
Answered by AI
Add your answer
Q2. I donot remember
Add your answer

Q1. Merge point of two inked lists which will be same from a node. (Linked List)
Ans. 
Find the merge point of two linked lists.
• Traverse both linked lists to find their lengths.

• Calculate the difference in lengths and move the pointer of the longer list by the difference.

• Traverse both lists in parallel until the merge point is found.
Answered by AI
Add your answer
Q2. Next greater element (Stack)
Ans. 
The Next Greater Element problem involves finding the next greater element for each element in an array.
• Use a stack to keep track of elements for which the next greater element is yet to be found.

• Iterate through the array and for each element, pop elements from the stack until a greater element is found.

• Store the next greater element for each element in a result array.
Answered by AI
Add your answer

Q1. Solve soduko puzzle(I have used backtracking)
Add your answer

DSA and SQL leetcode questions

Q1. Explain the coding questions that you have solved
Add your answer

3 simple questions on arrays and strings

Q1. 1 question on flattening binary tree to array
Add your answer
Q2. Simple graph BFS-No of times it takes oranges to decay in a grid
Ans. 
Using BFS to find the minimum number of steps for oranges to decay in a grid
• Implement BFS algorithm to traverse the grid and decay the oranges

• Keep track of the number of steps taken to decay all oranges

• Return the minimum number of steps required to decay all oranges
Answered by AI
Add your answer

Q1. Brain teasers,like if you have jars of 10L and 45L, how can you get 60L, something like that
Add your answer