Akuna Capital OA 以高强度的数学与编程题著称，尤其注重逻辑推理、概率计算、数值处理与算法实现。本篇将结合我们的实战案例详细介绍 Akuna Capital OA 的考试形式、典型题型、时间安排，以及我们辅导学员积累的一些高频考点与解题技巧，帮助你高效备战，稳步通关！
For the top trading firms like Akuna Capital, their very vigorous recruiting filters include some of the best financial knowledge as well as on-point algorithmic and programming talent. Akuna Capital has recently released an extremely difficult online written examination (OA) designed to evaluate candidates for their algorithmic thinking and coding skills under high-pressure situations. The final assessment, a 120-minute exam, is nothing short of an inquisition pushing candidates to the brink of their limits demanding rapid and accurate methods to solve tough problems.
1. K Smallest Substring
There is a string input str consisting of characters ‘0’ and ‘1’ only and an integer k. Find a substring of str such that:
- The number of ‘1’s is equal to
k - It has the smallest length
- It is lexicographically smallest
Note: It is guaranteed that an answer always exists.
Example:str = "0101101", k = 3
Possible substrings with exactly 3 ones include 01011, 1101, 1011. The one with the minimal length and lexicographically smallest is 1011.
2. Delivery Management System
A manufacturing company is located in a certain city. Their goods need to be shipped to other cities that are connected with bidirectional roads, though some cities may not be accessible because roads don’t connect to them. The order of deliveries is determined first by distance, then by priority. Given the number of cities, their connections via roads, and what city the manufacturing company is located in, determine the order of cities where the goods will be delivered.
Example: cityNodes = 4, cityFrom = [1,2,2], cityTo = [2,3,4], company = 1. Roads: 1–2, 2–3, 2–4.
- 最近的城市先访问 → 城市 2（距离 1）
- 下一个最近的城市 → 城市 3 和 4（距离 2），按编号优先：先 3，再 4
3. Maximum Distinct
Problem Statement:
Consider two arrays a and b each of length n. In one operation you can swap a[i] with b[j]. You may perform at most k operations. Find the maximum number of distinct elements achievable in array a.
Example:n = 5
a = [2,3,3,2,2]
b = [1,3,2,4,1]
k = 2
- Swap
a[2]andb[0]: nowa=[2,3,1,2,2] - Swap
a[4]andb[3]: nowa=[2,3,1,2,4]
Resulting a has 4 distinct elements, which is maximal under 2 swaps.
如果你也在为 OA 感到压力，或希望快速通过考试，我们提供专业的面试辅助和 OA 代写服务，助你一臂之力。立即联系我们，一起迈向成功！
