Akuna 2021 Qunat Dynamic 笔试机经

这周结束了Akuna Qunat Dynamic 2021的笔试题，三道题都做过，但是发挥的不好。
Q1 Crushing Stones
We have a collection of stones, each stone has a positive integer weight.
Each turn, we choose the two heaviest stones and smash them together.  Suppose the stones have weights x and y with x <= y.  The result of this smash is:
If x == y, both stones are totally destroyed;
If x != y, the stone of weight x is totally destroyed, and the stone of weight y has new weight y-x.
At the end, there is at most 1 stone left.  Retu

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

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

l is located at coordinates (a,b)
Cost of the travel from city to festival is |x-a|+|y-b|

Find the optimal location of the festival is called minimum total travel cost assuming all people attend

Example:
numPeople=[1,2]
x=[1,3]
y=[1,3]

the minimum cost is 4

楼主OA是quant researcher？

hansleo 发表于 2021-7-22 05:22
楼主OA是quant researcher？

是的，大概是一个多月前投的

请问楼主有后续吗

irene413 发表于 2021-7-27 16:53
请问楼主有后续吗

没有了，sign。。。

楼主可以问一下 每道题要对多少个test case才算过呀

匿名者 发表于 2021-9-9 02:02
楼主可以问一下 每道题要对多少个test case才算过呀

我没全过，最好过80%以上吧。他们家的题不难，就是时间太紧

foolish3 发表于 2021-9-10 03:31
我没全过，最好过80%以上吧。他们家的题不难，就是时间太紧

好的好的, 多谢楼主回复, 他们家的时间确实很紧