Akuna Capital成立于2011年，总部设立在芝加哥，目前在：悉尼、芝加哥、波士顿、伦敦、上海、香港都有公司，全球员工数量大概不到500人。（今年疯狂裁员了一波，全球裁员大概20%，悉尼大概50%）

Akuna Capital的口碑很差，目前工作环境推荐评分为：3.0/5。

大部分人认为比较好的部分有：同事很聪明、有咖啡站…
大部分人认为不太好的部分有：管理层存在严重问题、裙带关系严重、职业发展受限、加班时间长、工作强度大、做的很多项目没有意义、被老板抢credit、薪资在同行业中也不高…

和几位在Akuna工作过的朋友聊天基本证实了以上网络评分，大家给出的建议惊人的一致：
“别来”，
“如果你觉得Optiver culture不好的好，那是你没经历过Akuna…”
“取其糟粕，弃其精华版的Optiver”
“都这样的文化了，关键钱还不多”
“很强的毕业生进来也会被裁，对毕业生的职业生涯打击比对职场老人还大…”

才投的akuna的quant research intern，今天就收到了OA

🕑60分钟内做三道coding题目，可以选择C++或Python

题目特别简单，leetcode easy或medium的难度，让我们一起来看看原题吧

Question 1

Given an array arr of n integers, and two integers l and r, find the number of pairs (i, j) where 1≤𝑖<𝑗≤𝑛1≤i<j≤n such that the value arr[i] + arr[j] lies between l and r, both inclusive. Array indices start at 1.

Example:

Suppose n = 4, arr = [2, 3, 4, 5], l = 5 and r = 7.

There are 4 pairs with a sum between 5 and 7:

• arr[1] + arr[2] = 2 + 3 = 5
• arr[1] + arr[3] = 2 + 4 = 6
• arr[1] + arr[4] = 2 + 5 = 7
• arr[2] + arr[3] = 3 + 4 = 7

Return: 4.

Function Description:

Complete the function getNumPairs in the editor below.

The function getNumPairs has the following parameters:

• arr[int]: an array of integers
• l: the minimum acceptable sum
• r: the maximum acceptable sum

Question 2

A financial services company is uploading documents to a compliance system for analysis. They use a chunking mechanism as below:

• Each document is divided into equal sized packets.
• Documents are then divided and uploaded in "chunks" of packets. A chunk is defined as a contiguous collection of 2𝑛2n packets, where 𝑛n is any integer ≥0≥0.
• After the document is divided into chunks, randomly selected chunks are uploaded until the entire document is completely uploaded.

There is one document that is partially uploaded, described in uploadedChunks. Determine the minimum number of chunks that are yet to be uploaded.

Example:

totalPackets = 5
n = 2 (number of chunks already uploaded)
uploadedChunks = [[1, 2]]

• The document has 5 packets and 1 chunk of 21=221=2 packets and 1 chunk of 20=120=1 packet is uploaded.

Function Description:

Complete the function getMinimumChunksRemaining in the editor below.

Test Results:

Compiled successfully. All available test cases passed.

我们提供OA代做服务，请注意，如果你是在OA的过程中搜索到本文，那么不幸的是我们将无法为您服务。得益于我们优质的服务和有竞争力的价格，我们的OA代做服务必须要预约才能够实行。我们的OA代做是一项收费服务，如果是希望免费获得答案的人不要联系我们。

We provide OA agency services. Please note that if you search for this article during the OA process, unfortunately, we will not be able to serve you. Thanks to our high-quality service and competitive pricing, our OA outsourcing service requires an appointment to be implemented. Our OA agency is a paid service. If you want to get answers for free, please do not contact us.

联系我，查看题目全文。OA代做，代面试，面试代面，面试辅助。联系我 我们公开透明报价，做华人社区面试suport第一品牌。