1p3a Question · Sep 2025

AkunaCapital 2026 Quantitative Research Summer Internship Online Test

Quant OA Intern Easy
2 upvotes

Question Details

After applying online, I quickly received the online assessment (OA) link, valid for one month. The OA consisted of three coding questions, with a time limit of 120 minutes. The difficulty was roughly

Full Details

After applying online, I quickly received the online assessment (OA) link, valid for one month. The OA consisted of three coding questions, with a time limit of 120 minutes. The difficulty was roughly equivalent to LeetCode's easy-medium level. The first question was a minimum swap problem: find the minimum number of swaps required to sort an array. The second question was an array manipulation problem: sum the differences between each element and its leftmost and next-to-left elements. The third question was a relatively basic dynamic programming problem: find the maximum sum of subsequences in an array, with the constraint that you cannot skip two or more consecutive numbers. Please give me some points!

Free preview. Unlock all questions →

Topics

Arrays Dynamic Programming