Amazon Software Developer Interview Questions, Process, and Tips

Platform-Hacker Rank
Data Structures and Algorithms
60 mins
Behavioral Round

Q1. Find path from one node to another in a binary tree
Ans. 
Use depth-first search to find path from one node to another in a binary tree
• Start from the root node and recursively search for the target node

• Keep track of the path taken from the root to the current node

• If the target node is found, return the path from the root to the target node

• If the target node is not found, backtrack and continue searching in the other branches
Answered by AI
Add your answer

Q1. Two Sum in an array
Ans. 
Find two numbers in an array that add up to a specific target value.
• Use a hashmap to store the difference between the target value and each element in the array.

• Iterate through the array and check if the current element's complement exists in the hashmap.

• Return the indices of the two numbers that add up to the target value.
Answered by AI
Add your answer
Q2. Minimum jump in an array
Ans. 
Find the minimum number of jumps needed to reach the end of an array.
• Iterate through the array and keep track of the maximum reachable index at each step.

• Update the maximum reachable index as you iterate through the array.

• Increment the jump count when you reach the current maximum reachable index.
Answered by AI
Add your answer

Standard DSA questions

Numerical skills and persons skills
Such as problem solving