First step is to pass a hackerrank challenge and then a phone interview, finally onsite interview.
Quant dev #7-2018. The hackerrank challenge must be solved in python (2 or 3). There will be one simple/average question and other two will require good coding skills.
Interview questions [3]
Question 1
Given a set of lines, return the count of unique words and letters. A word is defined as any sequence of one or more lower case letters and words are separated by white spaces.
N coffee chains are competing for market share by a fierce advertising battle. each day a percentage of customers will be convinced to switch from one chain to another. Current market share and daily probability of customer switching is given. If the advertising runs forever, what will be the final distribution of market share?
Assumption: N is an integer less than 25, Total market share is 1.0, probability that a customer switches is independent of other customers and days.
Example: 2 coffee chains: A and B
market share of A: 0.4
market share of B: 0.6
Each day, there is a 0.2 probability that a customer switches from A to B
Each day, there is a 0.1 probability that a customer switches from B to A
input: market_share=[0.4,0.6], switch_prob = [[.8,.2][.1,.9]]
output: [0.3333 0.6667]
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 Sept 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.