Hello, I’m a Remaining yr scholar pursuing my B.Tech in Info Know-how from VIT Vellore.
Amazon visited our campus on twentieth July 2022 for hiring SDE interns.
First spherical: The primary spherical was a basic On-line evaluation. Earlier than the web check, our faculty had despatched a shortlist of scholars who might register for the stated job title on the Amazon Jobs web site. Solely these shortlisted college students received the OA hyperlink. The OA was carried out on Hackerrank and had a check window from 9:00 AM to six:00 PM. The check was a primary check consisting of two DSA-based questions. The questions had been shuffled for college kids in numerous combos. Round 4000 college students gave the check out of which 440 college students had been shortlisted for the Interview Spherical.
Interview Spherical(1 hr 45 minutes): Began with the interviewer’s Intro after which mine. The interviewer was fairly chill and pleasant and he defined to me what was his position in Amazon and what crew he works for.
Later he posed me 2 questions:
- The First query was on Linked Record: “Suppose you might have 2 numbers saved in 2 Linked Lists, add the numbers and retailer their end in a brand new linked record.” This was the query, it is a fairly primary query and the interviewer needed to see if I knew the fundamentals. Individuals who couldn’t reply the fundamental questions had been rejected on the spot.
https://www.geeksforgeeks.org/add-two-numbers-represented-by-linked-lists/
The method I used: Iterate by way of each lists to the tip and append the main zeros of the lists with a small quantity. Then name the recursive operate on the beginning node of each lists. The recursive operate calls itself on the subsequent node in each lists till it reaches the tip. This operate creates a node for the sum of the present digits and returns the carry.
Steps to succeed in the answer.
- Iterate over the 2 linked lists and add main zeros in case one record has fewer digits than the opposite.
- Begin on the prime node of each lists and name the recursive operate on the subsequent node.
- Proceed to the tip of the record.
- Creates a node for the sum of the present variety of digits and returns the carry.
Then the interviewer requested me if I used to be snug with graphs, which I used to be not so he requested me a quite common query about bushes.
I used to be in a position to resolve the query with a number of hints from the interviewer after which he requested me concerning the time complexity of my resolution. I took a while and gave him the reply.
After these two questions, he requested me if I had any questions for him, to which I requested for basic suggestions on my efficiency. The interviewer informed me that the interview went fairly nicely simply that I must be assured with all the information buildings and particularly the superior ones as a result of they’re used of their each day life. At this level, I regretted that I didn’t research graphs and I knew I’d not be chosen.
This was the one spherical of choice after which the record of chosen college students was launched.
Verdict: Not Chosen.
