Recently our students completed a Amazon Intern VO, I basically follow up the whole process from OA to VO. OA is the two normal hackerrank medium questions. The following mainly shares the real experience and core inspection points of the two rounds of VO.
Timeline
- 12.13 — OA completed (submitted directly the next day)
There are basically no repeated modifications, the status is online that day, and there is only one AC. - 1.27 — Two rounds of VO completed
The intervals between interviews are not long, they are continuous operations, and the requirements for status are very high. - Monday — Offer received
There was almost no delay, and the process from interview to result was very straightforward, a typical efficient process of a large factory.
Amazon Intern VO Round 1
BQ
Q1: What do you do when you encounter difficulties at work?
Q2: Why Amazon?
Coding
The topic is about the deduplication problem of Morse code. Given an array of strings, each word can be converted into the corresponding Morse code. For example, in the word "cab", c corresponds to "-.-.", a corresponds to ".-", and b corresponds to "-...". When spelled out, it becomes "-.-..–...". We call this process word translation. The question requires translating all the words in the array and then returning how many different password combinations there are.
The idea of solving the problem is actually quite simple. The specific method is to traverse each word, then traverse each letter in the word, convert them into Morse code and splice them together. Use a HashSet to store these passwords, the Set will automatically remove duplicates, and the final size of the Set returned is the answer. This question is not very difficult, the main thing is to use the deduplication feature of Set.
Amazon Intern VO Round 2
BQ
Q1: How do you handle tasks with a very tight deadline?
Q2: When the team faces difficulties, how do you motivate others and work toward a solution?
Coding
Given a string and a list consisting of multiple words of equal length, it is required to find all starting positions in the string so that a substring starting from this position can be spliced from all the words in the list without duplication or omission.
The idea is to use a hash table to count the number of occurrences of each word in the list, then scan the string in steps of word length, divide the candidate substring into several words of equal length and dynamically maintain the frequency of occurrence, using a sliding window.
Learn more
Are you interviewing with a big factory? Stuck in ideas, unsure of the algorithm, or under great pressure on site? Programhelp provides professional Interview assistance , providing steady escort throughout the entire process, helping you clarify your ideas, solve problems accurately, stabilize your rhythm, and greatly increase your passing rate. Want to secure your favorite offer? Contact us now to learn about our exclusive interview assistance program one-on-one.
