2026 Akuna Capital OA 面經分享|兩輪最新真題 + 準備建議

1,067Views
尚無留言

剛剛順利通過了 2026 Akuna Capital 的兩輪 OA! 整體體驗下來,雖然題目難度沒有到「變態」級別,但絕對也不輕鬆,尤其是第二輪的口頭表達環節,緊張感拉滿。 這裡整理一下我的完整經歷,希望能給後面準備投 Akuna 的同學一點參考。

第一輪 OA(Coding,Python)

1. Minimum Swaps
“Given an unsorted array of consecutive integers from 1 to n (with no duplicates), return the minimum number of swaps required to sort thearray in ascending order.”

Example:
Input: [7, 1, 3, 2, 4, 5, 6]
Output: 5

2. Delivery Management System
“You are given a list of tasks, each with an arrival time and a processing time. The system can only process one task at a time. If multiple tasksare available, the task with the smallest processing time is executed first. If there is a tie, the task with the smaller index is chosen. Return the order inwhich the tasks are executed.”

Example:
Input: tasks = [[1,2],[2,4],[3,2],[4,1]]
Output: [0,2,3,1]

3. Binary Circuit
“You are given a directed graph representing a binary circuit. Each node has a binary state (0 or 1). Initially, some nodes are set to 1. In each step, the signal propagates to its neighbors. A node becomes 1 if any of its incoming neighbors are 1. Determinehow many steps are required until no more updates occur. If the process never stabilizes (due to cycles), return -1.”

Example:
Input: n=4, edges=[[0,1],[1,2],[2,3]], initial=[1,0,0,0]
Output: 3

第二輪 OA

总共 5 道题,每題口頭講解 + 最終答案(題庫隨機,這裡是常見類型的還原):

1. Probability – Dice Roll
“You roll two fair six-sided dice. What is the probability that the sum is greater than 9?”

2. Combinatorics
“How many different ways can you arrange the letters of the word ‘STATISTICS’?”

3. Mental Math
“What is 37 × 43?”

4. Expected Value
“You flip a fair coin 10 times. What is the expected number of heads?”

5. Algebra / Word Problem
“A car travels 60 miles at 30 mph, and then another 60 miles at 60 mph. What is the average speed of the entire trip?”

重點說明

  • 第一輪 coding → 資料結構 + graph/heap 應用為主。
  • 第二輪 math → 偏基礎概率/組合/心算/EV/應用題,但難點是口頭表達邏輯,不是計算本身。

拒絕瞎忙,用對方法才能提速

Akuna 的兩輪 OA,考的不只是 coding,還要能把 邏輯講清楚。 真的別小看這個 OA! 第一輪 coding 題型雖然高頻,但考的都是 graph / heap / BFS 這些經典套路; 第二輪 EasyHire 的數學口述才是大殺器! 限時一壓,很多人就慌了:明明算對了,結果講不清楚,直接扣分... 我身邊不少同學就是卡在第二輪,邏輯一亂,白白錯失機會。

我這次用 Programhelp 的無痕連線助攻,提前把 高頻 coding + 數學口述 演練到位,實戰時完全沒掉鏈子。 題能算對,思路也能講順,整個過程流暢得多,最後輕輕鬆鬆過關!

準備 Akuna 的同學真的別硬撐,提前演練 + 實戰語音提醒,能讓你少走很多彎路,穩穩拿下!

author avatar
jor jor
END
 0
Comment(尚無留言)