Dark Alpha Capital·Software Engineer·Onsite - Coding / Algorithms
Jun 2026
Coding round at Dark Alpha Capital that was basically one meaty bitmask DP problem. Not a bad experience but the question was niche enough that if you haven't seen this pattern before you're going to flounder.
- Implement a bitmask DP solution for an assignment problem where N workers must each be assigned to a unique resource from a set, minimizing total cost. Walk through the state formulation, transitions, and time complexity.
“I'd seen the LC campus bikes variant before so I recognized the pattern pretty quickly, which helped.”