Amazon OA

1. 把n個subfile結合起來成一個single file -> 用priority queue
2

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

游客，您好！
本帖隐藏的内容需要积分高于 188 才可浏览
您当前积分为 0。
VIP即刻解锁阅读权限 或 查看其他获取积分的方式
Unlock interview details and practice with AI
Curated Interview Questions from Top Companies

list of pairs -> 用two pointer

LZ能把第一题在多描述一下么？ 谢谢了！
我找到原题了 谢谢LZ
I have taken the OA in 2020 and has not passed this OA, Please help by providing suitable solutions so I can understand the mistakes I made. Thanks

Write an Algorithm to output the minimum possible time to merge the given N subfiles into a single file
Input: The input to the function/method consists of two arguments:
numOfSubFiles: an integer representing the number of subfiles;
files: a list of integers representing the size of the compressed subfiles
Output: Return an integer representating the minimum time required to merge all the subfiles

Constraints::
2 <= numOfSubFiles <= 10^6
1 <= files[i] <= 10^6

Example:
input:
numOfSubFiles = 4
files = [4,8,6,12]

Output: 58

Explanation:
The optimal way to merge subfiles is as follows:
Step 1: Merge the files of size 4 and 6 (time required is 10). Size of subfiles after merging. [8,10,12]
Step 2: Merge the files of size 8 and 10 (time required is 18). Size of subfiles after merging. [18,12]
Step 3: Merge the files of size 18 and 12 (time required is 30)
Total time required to merge the file is 10 + 18 + 30 = 58.