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
题目是关于摩尔斯密码的去重问题。给你一个字符串数组，每个单词都可以转换成对应的摩尔斯密码。比如”cab”这个单词，c对应”-.-.”，a对应”.-“，b对应”-…”，拼起来就是”-.-..–…”，我们把这个过程叫做单词翻译。题目要求对数组中所有单词进行翻译，然后返回有多少种不同的密码组合。
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 ，全程稳护航，帮你理清思路、精准破题、稳住节奏，大幅提升通过率。想稳拿心仪 Offer？现在联系我们，一对一了解专属面试助力方案。
