amazon swe intern| amazon oa|amazon summer oa|amazon vo|亚麻oa代写|亚马逊 oa|OA亚马

OA

student program oa两道coding 题
第一道是 关于礼物的一题地里有, 附上code.
Given a integer vector reward that contains n integers that represent the reward. Each time the customer purchase one item, y i-th item, customer could gains the rewards point rewards[i].Then  the reward points of the remaining item are reduced 1 until become zero.
  Find the maximum possible reward points that can be gathered by purchasing the items optimally.
  Ex. reward = [5,2,2,3,1], n = 5

第二道是 get longest match
https://www.fastprep.io/problems/amazon-get-longest-match

VO

印度小哥,挺友善的,面了大概1个小时BQ: Tight Deadline + Calculated Risk
Coding: Unix Find OOD

coding ood是一步一步的

  1. match filename under directory
  2. what if there are circular directory(A->B,B-‍‍‍‍‍‌‍‍‍‌‌‍‌‌‍‌‌‍‌‌>A)
  3. apply filter

总体不难,主要是code和亚麻的bq。

Leave a Reply

Your email address will not be published. Required fields are marked *