Amazon Software Developer Intern Interview Questions, Process, and Tips

Having 3 basics DSA questions

Q1. Interview with one DSA easy problem
Add your answer
Q2. Basic question to reverse stack using O(1) space
Add your answer

2 coding questions on hackerrank . First was on dp and second on regex. Medium - Hard was the difficulty level.

Q1. Coding fundamentals, 2 coding questions and project explanation
Add your answer

Hackerrank coding test contained 2 questions 1 based on dynamic programming and other based of regex

Q1. 2 coding questions, computer fundamentals, project explanation
Add your answer

There were 3 coding questions. One was easy and two were of medium level.

Q1. First question was on binary search in which you were given two arrays and an integer d. You had to find count of all pairs such that arr[j] - arr[i] <= d where i is pointer on first array and j is pointe...read more
Ans. 
Count pairs in two arrays with difference less than or equal to d.
• Sort both arrays in ascending order.

• Initialize count to 0.

• For each element in the first array, find the largest index in the second array such that arr[j] - arr[i] <= d.

• Add the count of pairs for that element to the total count.

• Return the total count.

• Example: arr1 = [1, 3, 5], arr2 = [2, 4, 6], d = 2. Answer is 3 (pairs are (1, 2), (1, 4), (3, 2)).
Answered by AI
View 1 more answer
Q2. Second question was a variation of stock span problem. You were given an array and you had return an array that contains maximum consecutive days in which arr[i] >= arr[j] where 0<= i < n and i+1 <= j < n-...read more
Ans. 
Return an array of maximum consecutive days where arr[i] >= arr[j].
• Iterate through the array and keep track of the maximum consecutive days.

• Use a stack to keep track of the indices of the elements in decreasing order.

• Pop elements from the stack until the top element is less than or equal to the current element.

• Calculate the consecutive days by subtracting the current index from the top of the stack.

• Store the consecutiv
Answered by AI
Add your answer

It was a question on heaps

Q1. Stack based(related to nearest larger element to right)
Add your answer
Q2. Heap based( where if two rocks have same weight, eliminate both, otherwise keep the difference)
Add your answer