Amazon India Interview Experience | SDE 6m Internship
Last Updated :
23 Jul, 2025
My interview experience with Amazon India for SDE 6-month internship (Jan -June 2025 batch).
How I Got the Opportunity:
In the second week of September 2024, I received an email from the "Amazon University Talent Acquisition" team, inquiring about my interest in a Software Development Engineer (SDE) internship at Amazon. The email included a hiring interest form to collect details such as job location preferences and availability. I'm unsure how Amazon selects candidates, but it could be based on Amazon WoW applicants.
Hiring Process:
The hiring process included two online assessments followed by 1 technical interview.
Round 1: Online Assessment 1 (via Mettl)
A few days after submitting the hiring interest form, I received an invitation to a coding challenge hosted on Mettl, which had to be completed within a 3-day window. The assessment consisted of 41 questions spread across 9 sections:
- Coding Problem (1 section): One problem-solving question.
- MCQs (8 sections): Each section had 5 multiple-choice questions (MCQs), covering topics like Data Structures, Algorithms, Pseudo-code, Software Testing Methodologies, SDLC, Linux concepts, Computer Networks, and more.
Coding Question:
Given an array of integers arr and a constant y, find the length of the largest subset such that the absolute difference between any two elements in the subset is greater than or equal to y.
Example: For the input arr = {-900, 1, 1, 2, 100, 101, 2, 4, 5, 10, 18, 20, 15} and y = 4, the expected output is 7.
One possible largest subset is {-900, 1, 100, 5, 10, 20, 15}, where the difference between any two elements in the subset is greater than or equal to 4.
Round 2: Online Assessment 2 (via Hackerrank)
A few days after the first assessment I received a mail saying I have been shortlisted for the next round. This test, hosted on Hackerrank, had to be completed within a 5-day window. It consisted of 2 DSA questions (easy-medium).
Problems:
1. Given an array of integers arr and a constant x, find the number of pairs (i, j) such that: i < j and arr[i] + arr[j] is divisible by x
Example: For the input arr = [3, 8, 2, 7, 1, 9] and x = 5. The valid pairs are (3, 7) , (8, 2) , (7, 8) and (1, 9) because their sums are divisible by 5. So, the expected output would be 4.
2. Given an array of strings where each string consists of lowercase alphabets and the character '?', return a string that has the fewest '?' characters while matching all the given strings. The character '?' can be replaced with any lowercase alphabet to achieve a match. (The array consists of strings of same length)
Examples:
- For the input array of strings ["a?c", "??c", "abc"], the expected output is "abc"
- For the input array of strings ["adc", "??c", "abc"], the expected output is "a?c"
Round 3: Virtual Interview
In the last week of September, I was informed that I had cleared the assessments and was shortlisted for a virtual technical interview. It was scheduled for the second week of October.
The interview began with introductions, followed by questions about one of the projects mentioned in my resume. After discussing the project, I was given two problems to solve in a live coding environment. I was able to solve both questions.
The interview duration was 60 minutes.
Problems:
- Check whether array can be made strictly increasing by removing at most one element. Time Complexity: O(n)
- Merge Intervals. Time Complexity: O(nlogn)
Verdict:
1 week after the interview I was informed that I have cleared the interview