I applied online and got an online assessment back about a week later. The OA is 3 problems over 2 hours. The three problems worth 10, 15, and 5 points respectively. I solved the first two but get TLE(time limit exceed on 3/9 test cases for the third problem) using my brute-force O(n^3) method. I thought about it after the OA and came up with one that takes O(n^2 logn). It has been a week after the OA but I still have not heard back from them yet.
Interview questions [1]
Question 1
1.compare the value of two hands of cards. 2.maximum of the shortest path from a source to other nodes on a direct graph. 3.if there exist three collinear points in a list of points.
I applied online. I interviewed at AKUNA CAPITAL (Chicago, IL) in Oct 2023
Interview
One coding OA, one math video OA, and then phone interview. The phone interview also has a coding test and a math test. They both are not really hard, but I felt nervous and stuttered a little.
Interview questions [2]
Question 1
Design a class that can handle streaming prices data and implement function for get the top 5 prices and the other function for the most frequest price.
I applied online. The process took 4 weeks. I interviewed at AKUNA CAPITAL (Chicago, IL) in Sep 2023
Interview
The first round is OA, including 3 coding questions. We need to complete them in 1 hour. After that, I received online math test on Easyhire, which requires interviewers to answers questions with webcam.
Interview questions [1]
Question 1
How many ways are there to place the digits 0-9 in a sequence such that each digit is either an integer multiple of each of its neighbors or a divisor of each of its neighbors
I applied online. The process took 2 weeks. I interviewed at AKUNA CAPITAL (Sydney)
Interview
It was a technical coding interview with data structure and algorithms related questions. The interviewer was friendly and offered tips if you were on the right track to a solution!
Interview questions [1]
Question 1
Graph search question, shortest path from A->B according to a given time schedule.