amazon logo
Amazon· SDE I

Amazon | SDE1 | Online Round

Result
Ongoing
Posted
29 Jul 2022
272 reads

Summary

I interviewed for an SDE1 role at Amazon, completing an online coding round with two questions. After an initial period of no response, I was informed that my candidacy was moving forward.

How it went

I applied for an SDE1 position on the Amazon Alexa team via LinkedIn. A few days later, I received an invitation for an online coding round hosted on the HackerRank platform. The round comprised two coding questions, and for each, I had to explain my approach and state the time and space complexities. The first question was essentially the Reorder Data in Log Files problem from LeetCode, with only minor adjustments to the wording. The second question was new to me: 'Given a binary string, find the number of 3-size binary subsets that are alternate. For example, for '01010', the expected output is 5.' I attempted to solve this recursively, but many test cases unfortunately failed due to a time limit exceeded error. Initially, I received no response after the round and, after following up with the recruiter and being ghosted, I assumed I was rejected. However, I later received a call from Amazon informing me that they had decided to move forward with my candidature.

Questions asked (2)

  1. 01

    Reorder Data in Log Files

    Data Structures & Algorithms

    The first question was exactly the 'Reorder Data in Log Files' question in LeetCode with just the wordings changed.

    Open the problem
  2. 02

    Count Alternate Binary Subsets of Size 3

    Data Structures & Algorithms

    Given a binary string, find the number of 3-size binary subsets that are alternate. For example: 01010, expected output is 5.

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!