Amazon Software Engineer Interview Questions, Process, and Tips

Q1. I was asked a leetcode question similar to rain water trapping
Add your answer

Question was to implement a stack using queues

For reasoning, grammar, etc

Q1. Self introduction, like that questions
Add your answer

Q1. About c language basics
Add your answer

Q1. Self introduction like that
Add your answer

As make as possible

Q1. 1. A variation of nodes at a distance of K
Ans. 
A question about finding nodes at a distance of K from a given node in a graph.
• Use BFS or DFS to traverse the graph and keep track of the distance from the starting node.

• Maintain a visited set to avoid revisiting nodes.

• Return all nodes at distance K from the starting node.

• Example: Find all nodes at distance 2 from node A in a graph.
Answered by AI
Add your answer

Q1. 1. DP + Sliding window problem
Ans. 
DP + Sliding window problem
• Dynamic Programming (DP) is a technique to solve optimization problems by breaking them down into smaller subproblems

• Sliding window is a technique to solve problems by maintaining a window of elements in an array or string

• Combining DP and sliding window can be useful in solving problems that require both techniques
Answered by AI
Add your answer

DSA questions, System design topics and also COmputer fundamentals

Q1. Merge sort implementation
Ans. 
Merge sort is a divide and conquer algorithm that divides the input array into two halves, sorts them, and then merges them back together.
• Divide the array into two halves recursively

• Sort each half using merge sort

• Merge the sorted halves back together
Answered by AI
Add your answer