OA contains 5 math problems. The phone interview is quite hard, about probability and algorithm. I think after the phone interview and there will be a virtual onsite as well. Unfortunately, I cannot pass the phone interview.
Interview questions [1]
Question 1
1. gamble game with 0.6 probability to win and choose the best policy; 2. there are n points on the plane and then find three points to form the largest angle.
I applied online. I interviewed at AKUNA CAPITAL in Sept 2025
Interview
HackerRank Coding Test (3 problems, leetcode medium level), then Vidcruiter Test (need to verbally explain, serveral math, 5 min each), then Technical Phone Screen (normal brain teasers, probability etc.), then final round.
Interview questions [1]
Question 1
Problem Analysis:
A k-star consists of a center node and up to k arms (edges to other nodes)
We need to find the k-star with maximum sum of all its nodes
For each potential center, we choose the best neighbors (up to k) to maximize sum
Algorithm:
Build an adjacency list from the edges
For each node as a potential center:
Get all its neighbors
Sort neighbors by their values (descending)
Select up to k best neighbors
Calculate sum: center + selected neighbors
Return the maximum sum found
I applied online. The process took 3 weeks. I interviewed at AKUNA CAPITAL in Sept 2025
Interview
the first step is a leetcode like challenge, easy to medium difficulties. for 2 hour, there is enough time for you to solve them. if you pass the test cases, the following is the video math OA
You will receive an automatic OA (HackerRank Coding Challenge). If you pass, you will have a 5-minute video-recorded interview. The topics will be linear algebra, brainteasers, combinatorics, and probability. Make sure you review theories in linear algebra.
Interview questions [1]
Question 1
I got something similar to Leetcode's Maximum Subarray.