I applied online. I interviewed at AKUNA CAPITAL (New York, NY) in Nov 2016
Interview
After application I was asked to complete task in hackerrank. It consist of 4 question for 2hr.
Some questions are related to basic coding experience. Others are analytical thinking. I think I was not efficient on time. I could have done better if prepared well.
Interview questions [1]
Question 1
1. Given array find median of elements that are less than given number k. k exist in the array
2. Find number of polindrome dates (MMDDYYYY) in century (ex 1000-9999).
3. You are given an array of numbers (old trades) with label (good, bad). Predict label for the new array. I spent a lot of time thinking about it, but it seems very simple question. Solved with simple approach got 4/5 test cases.
4. Given a grid with 0s -1s and 1. You can walk on 0s only and try to reach 1s. Print if you can reach or not. I think related to path finding algorithm.
Hope this will be helpful to someone else.
Started with online assesment, hirevue and then a technical round, Did not pass the technical round. Questions were coding related in last round and few questions about the resume. Interviewer was chill. Hirevue asked maths and probability questions and asked how u came up with the solution.
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