Meta·Software Engineer·Online Assessment (OA)
- Given a card game where sets of 3 cards summing to 15 score points and cards are continuously replenished from a deck, implement a strategy that maximizes total score across a full game. You're working inside a large pre-existing codebase.
- When multiple valid disjoint sets of 3 cards are all playable at the same time, how do you decide which one to play first, and does the order even matter?
- How deep a search tree can you realistically afford here, and what's your justification for the cutoff?
“The setup itself wasn't too bad to understand but the codebase context made everything slower.”