亞麻25 Intern OA

2 OA coding question

Code Question 1
Amazon stores its data on different servers at different locations. From time to time, due to several factors, Amazon needs to move its data from one location to another. This challenge involves keeping track of the locations of Amazon's data and reporting them at the end of the year.

At the start of the year, Amazon's data was located at n different locations. Over the course of the year, Amazon's data was moved from one server to another m times. Precisely, in the iᵗʰ operation, the data was moved from movedFrom[i] to movedTo[i].
Find the locations of the data after all m moving operations. Return the locations in ascending order.

Note:

It is guaranteed that for any movement of data:
There is data at movedFrom[i].
There is no data at movedTo[i].
Example
locations = [1, 7, 6, 8]
movedFrom = [1, 7, 2]
movedTo = [2, 9, 5]

Explanation
Data begins at locations listed in locations. Over the course of the year, the data was moved three times. Data was first moved from movedFrom[0] to movedTo[0], from 1 to 2. Next, data was moved from 7 to 9, and finally, from location 2 to 5.

In the end, the locations where data is present are [5, 6, 8, 9] in ascending order.

Function Description
Complete the function getFinalLocations in the editor below.

The function is expected to return an INTEGER_ARRAY.
The function accepts the following parameters:

INTEGER_ARRAY locations
INTEGER_ARRAY movedFrom
INTEGER_ARRAY movedTo


Code Question 2
You are in the Amazon's Cloud Infrastructure Team, and you are working on a project to optimize how data flows through its network of storage servers.

You are given with n storage servers, and the throughput capacity of each server is given in an integer array named throughput.

There are pipelineCount data pipelines that need to be connected to two

您好！
本帖隐藏的内容需要积分高于 188 才可浏览
您当前积分为 0。
使用VIP即刻解锁阅读权限或查看其他获取积分的方式

游客，您好！
本帖隐藏的内容需要积分高于 188 才可浏览
您当前积分为 0。
VIP即刻解锁阅读权限 或 查看其他获取积分的方式

tal transferRate, the data pipelines can optimally choose the pairs
[3, 3], [1, 3], [3, 1], [1, 1]
to obtain the maximum sum of
transferRate = (5 + 5) + (5 + 4) + (4 + 5) + (4 + 4) = 36.

Function Description
Complete the function maxTransferRate in the editor below.

maxTransferRate has the following parameters:

int throughput[n]: array of throughput provided by each server instance.
int pipelineCount: the number of data pipelines that need to be connected.
Returns

long: the maximum total transfer rate.

求大米，謝謝😊

请问楼主第二题过了嘛

yuhangsun1014 发表于 2024-12-26 19:58
第一題全過，第二題只過一半的cases.

和我差不多，第二题我只过了八九个，后面那么大的case实在想不通怎么过

yuhangsun1014 发表于 2024-12-26 19:58
第一題全過，第二題只過一半的cases.

请问之后有收到vo嘛

已加米，请问work style楼主是怎么准备的

微信用户_5ee317d 发表于 2024-12-12 18:05:17
已加米，请问work style楼主是怎么准备的

我是讀亞麻LP準備。

請問收到vo邀請了嗎

请问一下 楼主test case 全过了吗？

Chenlu_Ru 发表于 2024-12-16 00:21:51
请问楼主第二题过了嘛

第二題，14test cases過了7個。其他的run time error.

LeslieLi 发表于 2024-12-13 13:28:30
请问一下 楼主test case 全过了吗？

第一題全過，第二題只過一半的cases.

不错呀！这个必须给一个赞！太强了。。。。。。