2026 Akuna Capital OA 面经分享|两轮最新真题 + 准备建议

1,065閱讀
沒有評論

刚刚顺利通过了 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 the array 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 tasks are 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 in which 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. Determine how 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
正文完
 0
评论(沒有評論)