amazon logo
Amazon· Intern

Amazon intern vo coding experience

Posted
22 Feb 2026
352 reads

Summary

I recently had my virtual onsite interview for an Amazon intern position, which involved behavioral questions and two coding problems. The coding problems included translating words to Morse code and a dynamic programming-based word break problem.

How it went

Last week I had my Amazon intern VO. It consisted of behavioral questions (BQ) plus two coding problems. I’ve done quite a few Amazon intern interviews before, and the other rounds and OA were similar to previous interview experiences I had seen. A few of the behavioral questions were even repeated.

Behavioral Questions

How do you handle difficulties at work?

When your team encounters challenges, how do you motivate them and help come up with solutions?

Why do you choose Amazon?

Coding Part

Coding 1

You are given an array of strings words. Each word can be written as a concatenation of Morse codes corresponding to each letter.

For example, "cab" can be written as "-.--..." (i.e., "-.-" + ".-" + "-..."). We call this concatenation process the word’s translation.

Translate every word in words and return the number of distinct word translations.

The idea is straightforward:

  • Iterate through each word.
  • For each word, iterate through its letters and build the corresponding Morse code string.
  • Use a set to store unique translations.
  • Return the size of the set.

This is a relatively simple problem that you’ve probably seen while practicing.

Coding 2

Given a string s and a dictionary of strings wordDict, add spaces in s to construct sentences such that every word in the sentence exists in the dictionary. Return all possible sentences in any order.

Note that the same word in the dictionary may be reused multiple times in the segmentation.

The solution is based on dynamic programming. We modify the DP array so that each dp[i] is a vector. For each element j in dp[i], it represents a valid word from s[j] to s[i]. In other words, we store valid (j, i) splits.

After building the DP structure, we start from dp[s.size()] and backtrack through these (j, i) pairs to reconstruct all possible sentences. Since dp[i] may contain multiple valid splits (i.e., more than one way to segment), we need to use recursion (or DFS) to generate all combinations.

Questions asked (5)

  1. 01

    Handle Difficulties at Work

    Behavioral

    How do you handle difficulties at work?

  2. 02

    Motivate Team and Find Solutions

    Behavioral

    When your team encounters challenges, how do you motivate them and help come up with solutions?

  3. 03

    Why Amazon?

    Behavioral

    Why do you choose Amazon?

  4. 04

    Unique Morse Code Words

    Data Structures & Algorithms · Easy

    You are given an array of strings words. Each word can be written as a concatenation of Morse codes corresponding to each letter.

    For example, "cab" can be written as "-.--..." (i.e., "-.-" + ".-" + "-..."). We call this concatenation process the word’s translation.

    Translate every word in words and return the number of distinct word translations.

  5. 05

    Word Break II

    Data Structures & Algorithms · Hard

    Given a string s and a dictionary of strings wordDict, add spaces in s to construct sentences such that every word in the sentence exists in the dictionary. Return all possible sentences in any order.

    Note that the same word in the dictionary may be reused multiple times in the segmentation.

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!