Software Engineer · Full Journey · Multiple Types

Amazon — Software Engineer ✅ Passed

Level: Intern

Round: Full Journey · Type: Multiple Types · Difficulty: 6/10 · Duration: 120 min

Topics: Behavioral, String Manipulation, Dynamic Programming

Location: Seattle, WA, US

Interview date: 2026-01-19

Summary

Round 1: Behavioral (BQ)

Question:

1. How do I handle difficulties at work?
2. How do I encourage my team and help them find solutions when they encounter difficulties?
3. Why did I choose Amazon?

Round 2: Coding

Question:

1. Given a string array words, where each word can be written as a combination of Morse code for each letter, return the number of different word translations.
2. Given a string s and a string dictionary wordDict, add spaces in the string s to construct a sentence such that all words in the sentence are in the dictionary. Return all possible sentences in any order. Note that the same word in the dictionary may be used repeatedly in the segmentation.

Details

The first coding question involves iterating through each word, then each letter of the word, constructing its Morse code, using a set to record the different codes, and then returning the set length. I had seen this type of problem before.

For the second coding question, I used dynamic programming and modified the dp array to store vectors. For element dp[i] in the vector, it represents a word from s[j] to s[i]. The segmentation result of s is stored in such (j, i) tuples. The problem can be solved by reverse searching these (j, i) tuples from dp[s.size()] and concatenating the string s using recursion.