Amazon Interview Experience for SDE-1 - GeeksforGeeks

20 Aug, 2021
Hi All, Initially, I have found the Amazon SDE job requirement on Linked In then I applied on the Amazon job portal for the same. I got an email for round one after two weeks.
Round 1: It was conducted online and needs to implement the coding on the HackerRank platform. There are 3 sections of the assessment.
Coding challenge (2 scenarios) and Coding approach (elaborate why you code the way you do) – 105 minutesWorkstyle survey – 15 minutesFeedback survey – 5 minutes
Coding challenge (2 scenarios) and Coding approach (elaborate why you code the way you do) – 105 minutes
Workstyle survey – 15 minutes
Feedback survey – 5 minutes
Questions asked were:
Given n number of sorted files, the task is to find the minimum computations done to reach the Optimal Merge Pattern.
Sample Input:

n = 6, size = {2, 3, 4, 5, 6, 7}

Sample Output :

68

Approach: This can be solved by using minimum heap.

Given a matrix with values 0 (trenches), 1 (flat), and 9 (obstacle) you have to find the minimum distance to reach 9 (obstacle). If not possible then return -1. The demolition robot must start at the top left corner of the matrix, which is always flat and can move on the block up, down, right, left. The demolition robot cannot enter 0 trenches and cannot leave the matrix.
Sample Input :

[1, 0, 0],

[1, 0, 0],

[1, 9, 1]]

Sample Output :

3

Approach : This can be solved by using BFS or DFS.


Given n number of sorted files, the task is to find the minimum computations done to reach the Optimal Merge Pattern.
Sample Input:

n = 6, size = {2, 3, 4, 5, 6, 7}

Sample Output :

68

Approach: This can be solved by using minimum heap.



Sample Input:

n = 6, size = {2, 3, 4, 5, 6, 7}

Sample Output :

68

Approach: This can be solved by using minimum heap.


Given a matrix with values 0 (trenches), 1 (flat), and 9 (obstacle) you have to find the minimum distance to reach 9 (obstacle). If not possible then return -1. The demolition robot must start at the top left corner of the matrix, which is always flat and can move on the block up, down, right, left. The demolition robot cannot enter 0 trenches and cannot leave the matrix.
Sample Input :

[1, 0, 0],

[1, 0, 0],

[1, 9, 1]]

Sample Output :

3

Approach : This can be solved by using BFS or DFS.



Sample Input :

[1, 0, 0],

[1, 0, 0],

[1, 9, 1]]

Sample Output :

3

Approach : This can be solved by using BFS or DFS.


All test cases passed for both so that I expected for the second round. After 15-20 days I got a mail from HR for an Amazon Chime Interview. There will be 2 rounds on that day only.
Round 2:
Question 1: Search a Word in a 2D Grid of characters it can be possible in 8 directions
Here I took more time to solve this problem and approached the brute force approach. The interviewer didn’t ask for an efficient approach since I have crossed the time limit.
Round 3:
In this round questions asked all about arrays and string 
Question 1: Reverse words in a given String
Question 2: Print all pairs with given sum
Question 3: Count pairs in an array whose sum is divisible by K
Here The Interviewer expects an efficient solution for all the questions but I gave the efficient solution for question 1 alone.
Next week I got a call from HR, badly I am not shortlisted for the upcoming rounds anyway I got an experience.  I could suggest everyone should try to work on problems for efficient approach.
All the best!
Amazon
Marketing
Interview Experiences
Amazon
Writing code in comment?
Please use ide.geeksforgeeks.org,
generate link and share the link here.
Amazon Interview Experience for SDE-1 (Off-Campus)
Amazon AWS Interview Experience for SDE-1
Zoho Interview | Set 3 (Off-Campus)
Difference between ANN, CNN and RNN
Amazon Interview Experience
JPMorgan Chase & Co. Code for Good Internship Interview Experience 2021
Amazon Interview Experience for SDE-1
Infosys Interview Experience for DSE 2022
Amazon Interview Experience (Off-Campus) 2022
Amazon Interview Experience for SDE-1 (On-Campus)