Akuna Interview Question
AkunaQuantitative Researcher Interview
1. Profitable Project Pairs - Calculate the number of profitable pairs via binary search. 2. Maximum Swaps - Given two lists. Swap elements between two lists for a given limited time. Calculate the maximum number of unique elements in the first list. 3. Binary Circuit - Given a binary string, calculate the cost of moving all 1s to the right.
Unlock the Full Solution
Enter your email to get instant access to the complete solution, explanation, and similar practice problems.