Akuna Capital OA is known for its high-intensity math and programming questions, especially focusing on logical reasoning, probability calculation, numerical processing and algorithm implementation. In this article, we will introduce Akuna Capital OA exam format, typical question types, time schedule, as well as some high-frequency test points and problem solving techniques accumulated by our tutored students, which will help you prepare for the exam efficiently and pass the exam steadily!
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 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
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. 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. 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. Given the number of cities, their connections via roads, and what city the manufacturing company is located in, determine the order of cities
Example. cityNodes = 4, cityFrom = [1,2,2], cityTo = [2,3,4], company = 1. Roads: 1-2, 2-3, 2-4.
- Nearest city visited first → City 2 (distance 1)
- Next closest city → cities 3 and 4 (distance 2), prioritized by number: 3, then 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.
If you are also stressing about OA or want to pass the exam quickly, we offer professional interview assistance and OA ghostwriting services to help you.Contact Us NowTogether, we are on the road to success!
