amazon logo
Amazon· sde 6-month internship

Amazon SDE 6m Internship Interview Experience

Result
Offer
Location
india
Posted
18 Oct 2024
328 reads

Summary

I successfully navigated Amazon India's SDE 6-month internship interview process, which comprised two rigorous online assessments and a virtual technical interview, ultimately leading to a positive outcome.

How it went

I was thrilled to receive an email from the Amazon University Talent Acquisition team in September 2024, inviting me to apply for an SDE 6-month internship (Jan-June 2025 batch) with Amazon India. After submitting my details through a hiring interest form, I embarked on a multi-stage interview process.

The first stage was an online assessment via Mettl, which I completed within a three-day window. It included a challenging coding problem alongside 40 multiple-choice questions spread across various technical domains such as Data Structures, Algorithms, Pseudo-code, Software Testing Methodologies, SDLC, Linux, and Computer Networks.

Shortly after, I was informed that I had been shortlisted for the second online assessment, this time hosted on Hackerrank. This round, which I completed within a five-day window, focused on Data Structures and Algorithms, presenting two problems described as easy-medium difficulty.

Having cleared both assessments, I was invited for a virtual technical interview, scheduled for the second week of October. The 60-minute interview began with introductions, followed by an in-depth discussion about one of the projects listed on my resume. Following the project discussion, I was given two coding problems to solve in a live coding environment. I managed to successfully solve both problems.

A week after the interview, I received the good news that I had cleared all rounds.

Questions asked (5)

  1. 01

    Largest Subset with Absolute Difference >= Y

    Data Structures & Algorithms

    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.

  2. 02

    Count Pairs with Sum Divisible by X

    Data Structures & Algorithms

    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.

  3. 03

    Match Strings with Wildcard '?'

    Data Structures & Algorithms

    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"

  4. 04

    Remove One Element to Make Array Strictly Increasing

    Data Structures & Algorithms · Easy

    Check whether array can be made strictly increasing by removing at most one element. Time Complexity: O(n)

    Open the problem
  5. 05

    Merge Intervals

    Data Structures & Algorithms · Medium

    Merge Intervals. Time Complexity: O(nlogn)

    Open the problem

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Amazon recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!