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-pointalgorithmic and programming talent. Akuna Capital has recently released an extremely difficult online written examination (OA) designed to evaluatecandidates for their algorithmic thinking and coding skills under high-pressure situations. The final assessment, a 120-minute exam, is nothing shortof 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, thoughsome cities may not be accessible because roads don’t connect to them. The order of deliveries is determined first by distance, then bypriority. Given the number of cities, their connections via roads, and what city the manufacturing company is located in, determine the order of citieswhere 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.
如果你也在為 Akuna Capital OA 感到壓力，或希望快速通過考試，我們提供專業的面試輔助和 OA 代寫服務，助你一臂之力。立即聯絡我們，一起邁向成功！
