本帖最后由 匿名 于 2022-11-14 23:10 编辑
求点赞，求按“评分”按钮加大米！不扣自己的大米！
2023 Amazon Summer Intern SDE
Timeline:
Submit: 08/16/2022
OA: 08/29/2022
OA Submit: 09/11/2022
VO Survey: 10/21/2022
VO Survey Recorded: 10/24/2022
VO Comfirm: 11/01/2022
VO Itself: 11/08/2022
asp-offersonboarding at amazon dot com Update Waitlist: 11/14/2022 14:56 EDT; Portal: Under Review
Hello Xxx,
Thank you for the time you have invested in the Amazon recruitment process. We know that juggling school commitments and job interviews is a lot to manage. We’ve identified you as a qualified and talented candidate; however, our planning process is taking longer than expected, so we are unable to offer you a position with Amazon at this time.
Here is what you should know about potential next steps:
· We may reach out to you if we are able to offer you a position later this year. Because we are still in the midst of our planning process, we cannot confirm when or if we may follow up, nor guarantee that you will be offered a role.
· If you no longer wish to be considered for this position, please let us know by updating your application status in your candidate portal here or by emailing asp-offersonboarding at amazon dot com directly. We wanted to provide this update because we value your time and your trust. We wish you the best of luck as you continue the school year.
Thank you,
Amazon Student Programs
OA1.1: findMaximumMaximaCount
Amazon has a string of categories of items purchased by a particular customer, each represented as a lowercase English letter. To analyze customer behavior, we define a metric called the MaximaCount of a category. It is the number of indices where the frequency of some category c is maximum among all categories present in the prefix of i.
More elaboratively, MaximaCount of character, char, representing a category is defined as the number of indices 4, such that the frequency of char is maximum in the prefix of the string up to the index i.
Given the string categories, find the maximum MaximaCount among all the categories.
Example
Given categories='bccaaacb', there are three categories [a, b, c].
From the above table (assuming 1-based indexing):
- MaximaCount of a = 4 at indices 5, 6, 7, 8
- MaximaCount of b = 2 at indices 1, 2
- MaximaCount of c = 6 at indices 2, 3, 4, 5, 7, 8
Thus the maximum MaximaCount is 6 for the character c.
Function Description
Complete the function findMaximumMaximaCount in the editor below. The function returns an integer denoting the maximum attainable favourability.
findMaximumMaximaCount has the following parameter:
string categories: the given string
Returns
int: the maximum MaximaCount
Constraints
- 1 ≤ |categories| ≤ 10^5
- The string categories consists of lowercase English characters only.
OA1.2: check_similar_passwords
Amazon would like to enforce a password policy that when a user changes their password, the new password cannot be similar to the current one. To determine whether two passwords are similar, they take the new password, choose a set of indices and change the characters at these indices to the next cyclic character exactly once.
Character 'a' is changed to 'b', 'b' to 'e' and so on, and 'z' changes to a'. The password is said to be similar if after applying the operation, the old password is a subsequence of the new password.
The developers come up with a set of n password change requests, where newPasswords denotes the array of new passwords and oldPasswords denotes the array of old password. For each pair newPasswords] and oldPasswords, return "YES" if the passwords are similar, that is, new Passwords i becomes a subsequence of oldPasswords!! after performing the operations, and "NO" otherwise.
Note: A subsequence is a sequence that can be derived from the given sequence by deleting zero or more elements without changing the order of the remaining elements.
Example
The two lists of passwords are given as newPasswords = ("baacbab", "accdb", "baacba"), and oldPasswords = ('abdbc", "ach", "abb"].
Consider the first pair: newPasswords[0] = "baacbab" and oldPasswords = "abdbc", Change "ac" to "bd" at the 3rd and 4th positions, and "b" to "c" at the last position.
Sample Case 0
newPasswords = ["aaccbbee", "aab"]
oldPasswords = ["bdbf", "aee"]
Output: Yes, No
Sample Case 1
newPasswords = ["aaaa", "bzz"]
oldPasswords = ["bcd", "az"]
Output: No, Yes
OA1.3 性格测试：希望大家在正式开始前都能准备充分
求点赞，求按“评分”按钮加大米！不扣自己的大米！
补充内容 (2022-11-15 12:34 +8:00):
VO: 1 Hour (Intro 3 mins; BQ 17 mins; Computer Science 30 mins; Reverse BQ 10 mins)
Intro:
1. Interview Dylan
2. Self Pitch
VO1.1: BQ
BQ1: Challenging Project
Follow up: 如何成为课内project组长
BQ2: Lack Information & No Time Decision
Follow up: three new features是否是自己主动提出的
Follow up: Lack Information的背景原因
BQ3: Out of Responsiblity
Follow up: Mentor 和 colleague的反馈
VO1.2: No Coding
Question 0: 介绍一个自己最喜欢的sort algo (Quick Sort)
Interviewer Dylan: "No need to implement right now"（笑）
Question 1: 浏览器中输入www.amazon.com后发生了什么
Question 2: Q1中amazon.com的server后端发生了什么
Question 3: amazon.com的前端发生了什么
Question 4: 谈一谈session
Question 5: 谈一谈token
Question 6, 7, ...
VO1.3: Reverse BQ
- What does a typical day in this intern role look like?
- What are the trainings I will receive if I get hired
- Biggest Challenge in Amazon currently
- Any opportunity to work on different projects?
- Most important Leadership Principle in this intern role: Bias for action
- How to success in this intern role, how to earn Return Offer
- ...
求点赞，求按“评分”按钮加大米！不扣自己的大米！
补充内容 (2022-11-16 16:28 +8:00):
https://docs.google.com/spreadsh ... XvPo/htmlview#gid=0
Waitlist dp汇总 |
匿名用户-D49DW
2023-1-16 23:40:02
匿名用户-D49DW
2022-11-15 11:54:06
收藏
淘帖
好苗
杂草
匿名用户-VWZDE
提升卡
置顶卡
关贴卡
开贴卡
变色卡
千斤顶
狗仔卡
