python - 纽约求捞
8820
NY有缺组员的吗？ 17年本科生物毕业后，开始自学cs，主要用python。最近2022年才开始投简历。 纽约求捞...
【最近aws HR联系，准备中....】
若hr通过，后期更新面试过程
补充内容 (2022-08-29 11:31 +8:00):
我是 recruiter reach-out的社招，在SDE1/SDE2 之间. 这个recruiter的profile是early career，所以我选择他一起走AWS的application，没跟其他recruiter。
我申请了他发的job link，周六申请。周一收到了OA1的邮件。
时间线：
08-22：收到OA1 link
08-28：完成OA1（4道题，2道coding，2道解释coding的approach）
Q1：ChooseFleet - given an integer denoting a total number of wheels, help Amazon Logistics from an infinite supply of two-wheeled and four-wheeled vehicles such that the group of chosen vehicle has that exact total number of wheels. Two ways of choosing vehicles are considered to be different if and only if they contain different numbers of two-wheeled or four-wheeled vehicles.
For example, if our array wheels = [4,5,6] ur return array would be res = [2, 0, 2]. Case by case, we can have 1 four-wheel or 2 two-wheel to have 4 wheels. we cannot have 5 wheels. We can have 1 four-wheel and 1 two-wheel or 3 two-wheel vehicles in the final case.
Q2: 解释Q1approach
Q3：TraversedPath - You are in charge of preparing a recently purchased lot for one of Amazon's new building. The lot is covered with trenches and has a single obstacle that needs to be taken down before the foundation can be prepared for the building. The demolition robot must remove the obstacle before progress can be made on the building.
Write an algorithm to determine the minimum distance required for the demolition robot to remove the obstacle.
Assumption:
The lot is flat, except for trenches, and can be represented as a two-dimensional grid. the demolition robot must start from the top-left corner of the lots, which is always flat, and can move one block up, down, left, or right at a time. The demolition robot cannot enter tranches and cannot leave the lot. The flat areas are represented as 1, areas with trenches are represented by 0 and the obstacle is represented by 9.
Q4: 解释Q3approach
初总结：做的题跟自己的resume很match. 勇敢跟recruiter讲自己的需求。【继续更...
补充内容 (2022-08-29 11:45 +8:00):
两小时内，只做完了Q1+Q2，Q3没，当时想着去Q4写approach，time out时没点submit。
【 目前，坐等OA2 or 没被捞 :) 】
p.s. recruiter 发的job link是Seattle的。 Job status move forward 也是同个application. 但我一开始就跟recruiter说我想在NY，且告诉他我申请了NY的job id。 【如果走完整个interview process，后期继续更新details】
补充内容 (2022-10-11 05:20 +8:00):
挂了。 OA没过，进入冷冻期；明年月初再战。
Lesson learned：下次直接找NY的recruiter，因为不想relocate.. 自己基础还是太差，多写code，不然看题没感觉。也间接性的看理论，若coding过了，onsite的话，ramp-up不会太惨。
【最近aws HR联系，准备中....】
若hr通过，后期更新面试过程
补充内容 (2022-08-29 11:31 +8:00):
我是 recruiter reach-out的社招，在SDE1/SDE2 之间. 这个recruiter的profile是early career，所以我选择他一起走AWS的application，没跟其他recruiter。
我申请了他发的job link，周六申请。周一收到了OA1的邮件。
时间线：
08-22：收到OA1 link
08-28：完成OA1（4道题，2道coding，2道解释coding的approach）
Q1：ChooseFleet - given an integer denoting a total number of wheels, help Amazon Logistics from an infinite supply of two-wheeled and four-wheeled vehicles such that the group of chosen vehicle has that exact total number of wheels. Two ways of choosing vehicles are considered to be different if and only if they contain different numbers of two-wheeled or four-wheeled vehicles.
For example, if our array wheels = [4,5,6] ur return array would be res = [2, 0, 2]. Case by case, we can have 1 four-wheel or 2 two-wheel to have 4 wheels. we cannot have 5 wheels. We can have 1 four-wheel and 1 two-wheel or 3 two-wheel vehicles in the final case.
Q2: 解释Q1approach
Q3：TraversedPath - You are in charge of preparing a recently purchased lot for one of Amazon's new building. The lot is covered with trenches and has a single obstacle that needs to be taken down before the foundation can be prepared for the building. The demolition robot must remove the obstacle before progress can be made on the building.
Write an algorithm to determine the minimum distance required for the demolition robot to remove the obstacle.
Assumption:
The lot is flat, except for trenches, and can be represented as a two-dimensional grid. the demolition robot must start from the top-left corner of the lots, which is always flat, and can move one block up, down, left, or right at a time. The demolition robot cannot enter tranches and cannot leave the lot. The flat areas are represented as 1, areas with trenches are represented by 0 and the obstacle is represented by 9.
Q4: 解释Q3approach
初总结：做的题跟自己的resume很match. 勇敢跟recruiter讲自己的需求。【继续更...
补充内容 (2022-08-29 11:45 +8:00):
两小时内，只做完了Q1+Q2，Q3没，当时想着去Q4写approach，time out时没点submit。
【 目前，坐等OA2 or 没被捞 :) 】
p.s. recruiter 发的job link是Seattle的。 Job status move forward 也是同个application. 但我一开始就跟recruiter说我想在NY，且告诉他我申请了NY的job id。 【如果走完整个interview process，后期继续更新details】
补充内容 (2022-10-11 05:20 +8:00):
挂了。 OA没过，进入冷冻期；明年月初再战。
Lesson learned：下次直接找NY的recruiter，因为不想relocate.. 自己基础还是太差，多写code，不然看题没感觉。也间接性的看理论，若coding过了，onsite的话，ramp-up不会太惨。
- 2
0条回复