Skip to content
Related Articles

Related Articles

Improve Article
Save Article
Like Article

Amazon Interview Experience for SDE (Off-Campus)

  • Difficulty Level : Hard
  • Last Updated : 24 Jan, 2022

I attended a hiring event on Codechef for Amazon in March or April ’21. I managed to solve nearly 50% of the questions. So, after nearly 6 months, I got a mail that my profile has been shortlisted from Codechef.

After attending the preparation session for 3-4 times, finally they scheduled my interviews. There were 3 rounds scheduled on the same day.

Round 1(70 mins-Taken by SDE): The interview started off with my introduction and I was asked some questions about my role at previous job. After that I was asked 2-3 questions on leadership principles.  –>20mins 

After this, the interviewer asked 2 coding questions.

  1. https://www.geeksforgeeks.org/decode-string-recursively-encoded-count-followed-substring/. I discussed the stack approach with the interviewer and after that I coded the solution.
  2. https://www.geeksforgeeks.org/check-if-a-binary-tree-is-subtree-of-another-binary-tree/

After suggesting brute force approach for this, I had to take several hints from the interviewer for the optimal solution(by comparing inorder traversals of both trees). But, finally I got it right and the interviewer was satisfied.

Round 2(60 mins – Taken by Technical Program Manager-II): Again, the interview started off with my introduction and I was asked some questions about my role at previous job. After that I was asked another 2-3 questions on leadership principles.  –>20mins

After this, the interviewer asked 2 coding questions.

  1. https://www.geeksforgeeks.org/fix-two-swapped-nodes-of-bst/. I discussed the approach with the interviewer first. It took some time for me to explain this: When there is more than one pair in inorder traversal which does not follow the property, in[i]<in[j], which one to swap and why?
  2. This one was a very specific question. But, after thinking for a while, I realized it was a basic heap question.

I was able to code both questions within time(40 mins), although I realized I gave the wrong TC for one of the questions. 

Round 3(60 mins – Taken by Manager, Software Development): It started with my introduction. After that, it moved to my CV and I was asked to choose a project mentioned in my resume. I was asking various questions about it, but I didn’t go through my project before interview, so I wasn’t able to answer even some of the most basic questions, I was really embarrassed. After that, they said some leadership principles. All of this took 30 mins.

After this, I was asked one coding question

  1. https://www.geeksforgeeks.org/largest-sum-contiguous-subarray/. Along with with the sum, I also had to print the elements included in the sum. I tried to do this in single traversal only using Kadane’s. But, the time ran out and I failed to explain the approach properly. I felt terrible after this round and I felt like I botched it. 

But, I think because my first 2 rounds were good, I got call for the last round.

Round 4(45 mins – Taken by Manager, Software Development): It started with my introduction and I was asked some basic questions about my role at current company. After that, I was asked one coding question:

  1. Given a string containing of digits, print in the below manner:
    11 -> one 1
    21 -> two 1's
    3233 -> three 2's, and three 3's

    I discussed the approach and coded the solution.

After this, I was asked 2-3 more questions on leadership principles. Overall, I think this round was pretty chill.

Verdict: Selected

My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!