Akuna Capital
2 questions · 25 experiences · 1p3a (27)
27 entries
1/2AkunaCapital 2026 Quantitative Research Summer Internship Online Test
Akuna Capital C++ Object Pool Coding Challenge Interview
Akunacapital 2026 Quant Finance Intern Online Assessment Experience
Barclays Quantitative Finance Internship Codility Online Test Review
Akunacapital Fulltime Software Engineer Online Assessment: Exchange Order Matching Engine
Akuna Capital Online Test Experience for SDE Position
Akunacapital Quant Developer Technical Phone Screen Experience
Akuna Capital SWE Internship Technical Phone Screen Interview
Akuna Capital SDE Online Assessment Interview Experience
Akunacapital Tech Phone Screen: Implementing a Market Making Quoting Algorithm
Akunacapital OA1 Online Assessment for Quant Finance Roles
Akuna Capital Junior Quant Developer & Strategist Video Interview Experience
Akuna Capital Quant Finance Tech Phone Screen Experience
AkunaCapital Quantitative Strategies Internship Technical Phone Screen
AkunaCapital Hardware Internship Online Test
Akuna Capital C++ SDE 2026 Graduate Online Test Review
Akuna Capital Junior Quant Developer and Quantitative Strategist Interview Overview
Akunacapital Quant Finance Intern Video Interview Experience Summer 2026
Akunacapital 2026 Quant Research Intern Coding Challenges
Akuna Capital Online Assessment for Quant Finance Fulltime Position
Akunacapital Junior Trader 2025-2026 Online Assessment Questions
Akunacapital Software Engineer Tech Phone Screen: Enemy Factory Design Challenge
Akuna Capital Python Intern Online Assessment Overview
Akuna Capital Intern Online Assessment Insights for Quant Finance
Akunacapital 2026 Summer Intern Onsite Interview - Software Engineer
AkunaCapital 2026 Quantitative Research Summer Internship Online Test
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 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!