One HR screening round followed by a technical round.
It was a math/logic problem followed by a leetcode medium. I solved both but not fast/efficiently enough, the bar seems quite high, overall a good experience though
Questions d'entretien [1]
Question 1
Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0.
One hour zoom call with a quant dev, was friendly but didn’t provide much more information or help. Spent most the time watching me implement the solution.
Afterwards answered my questions about the company very quickly
Questions d'entretien [1]
Question 1
Python trivia and an algorithms/data structures problem
