Amazon Interview Experience

amazon logo
amazon
Software Engineer InternRejected
August 31, 202413 reads

Summary

I participated in an Amazon interview for a 6-month internship through their Amazon WOW diversity hiring program. After clearing two online assessments, I faced two coding questions in the interview: "Reorganize String" and "Path Sum II". I struggled with the first but solved the second, ultimately not receiving an offer.

Full Experience

I recently went through the Amazon interview process as part of their Amazon WOW diversity hiring program for a 6-month internship. My journey began with two online assessments. The first assessment focused on computer fundamentals, while the second presented two coding challenges: one involving binary search and another utilizing priority queues. I successfully solved both coding problems in the second assessment, which led to an interview invitation.

The interview itself lasted 1 hour and 15 minutes, during which I was asked two specific LeetCode questions. The first was 767. Reorganize String, with which I struggled significantly. However, I was able to smoothly solve the second problem, 113. Path Sum II.

Unfortunately, despite my efforts, the final verdict was 'Not selected'.

Interview Questions (2)

Q1
Reorganize String
Data Structures & AlgorithmsMedium

Given a string s, rearrange the characters of s so that no two adjacent characters are the same. If it is impossible, return an empty string. For example, if s = "aab", output "aba". If s = "aaab", output "".

Q2
Path Sum II
Data Structures & AlgorithmsMedium

Given the root of a binary tree and an integer targetSum, return all root-to-leaf paths where the sum of the node values in the path equals targetSum. Each path should be returned as a list of the node's values. A root-to-leaf path is a path starting from the root and ending at any leaf node.

Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

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