Ho sostenuto un colloquio presso Hudson River Trading
Colloquio
Didn't make it pass the OA. The OA was extremely difficult in my opinion consisting of 3 hacker rank questions that were easily leetcode mediums-hard. Most of my questions were on bit manipulation.
Domande di colloquio [1]
Domanda 1
Write an algorithm that returns if a string can be partitioned into k sized intervals with each k containing a specific amount of 1's (the string is binary).
