Virtu Quantitative Researcher Interview Experience — Five Hard Problems in a 105-Minute OA

Five problems in 105 minutes. The problems are hard difficulty, and some of them are straight LeetCode problems. Time is pretty tight. I got the OA within about two weeks of applying everywhere.

Debt Transactions: LeetCode 465.

Building Construction: LeetCode 2865.

Reaching Points: LeetCode 780.

Lifting Weights: Given an array weights of n plate weights and a barbell capacity maxCapacity, choose a subset of plates whose total weight is as large as possible without exceeding maxCapacity. Each plate can be used at most once. Return that maximum total weight. Constraints: 1 ≤ n ≤ 42, 1 ≤ maxCapacity ≤ 10^9, and 1 ≤ weights[i] ≤ 10^9. For example, weights = [7, 1, 5, 6, 2] and maxCapacity = 7 gives an answer of 7.