[ad_1]
Hello, I’m a ultimate 12 months Pc Science Undergrad pupil from Vel Tech College, Chennai. Just lately I acquired a Full-time provide from Amazon, India for the place of SDE-1. It was On-campus recruitment.
On-line Evaluation: Debugging (20 minutes): 7 coding questions (70 minutes): It consisted of two DSA questions. CS elementary MCQs
Interview Spherical 1 (60 minutes): One in all Amazon’s SDE-2 took this spherical. We began with a short introduction. The interviewer launched himself after which requested me to introduce myself Then he jumped into DSA. He advised to me that he shall be asking 2 DSA questions and I’ve to code each of them.
- https://leetcode.com/issues/copy-list-with-random-pointer/
- https://leetcode.com/issues/validate-binary-search-tree/ (A variant of this downside)
I began explaining to him the brute pressure resolution after which regularly moved to probably the most optimized resolution and defined the time and house complexity. Then he requested me to code probably the most optimized method. He appeared happy with my code and requested to dry run it. Quite a lot of significance was given to the code high quality.
Interview Spherical 2 (60 minutes): One in all Amazon’s SDE-2s took this spherical. We began with a short introduction. The interviewer launched himself after which requested me to introduce myself Then he jumped into DSA.
I took lots of time to unravel the primary query. I coded the answer utilizing degree order traversal(which Took extra further house) however the interviewer was anticipating a recursive method. Then he requested me to unravel utilizing recursion. I solved it and coded the identical. For the second query, I used to be left with very much less time. I began with brute pressure as probably the most optimum method. He appeared to be happy with my method.
Interview Spherical 3: Bar Raiser (60 minutes): This was the final interview spherical. The interviewer was SDEM with some 10–12 years of expertise. The interviewer launched himself after which requested me to introduce myself with a short introduction of the challenge I’ve labored on. He requested a couple of follow-up questions on initiatives. The dialogue on initiatives was completed for greater than 30 min. Then he jumped into DSA.
- It was primarily based on merge kind. (Don’t precisely bear in mind).
- It was primarily based on shortest path stuff. Solved utilizing BFS.
I defined the method to the primary query and coded it inside 5 min. The second query took a bit extra time resulting from plenty of edge circumstances however finally, I solved and coded it. A particular focus was made on code high quality in each spherical. The next hyperlink shall be useful: https://www.youtube.com/watch?v=MDomi07XR8Q
Consequence — Received the provide!
[ad_2]