DE shaw OA | Scary question tbh
Summary
I encountered two challenging algorithmic problems during my DE Shaw Online Assessment. The first involved finding the minimum spanning tree weight in a complete graph with 0/1 edge weights, and the second was about maximizing system redundancy by flipping a consecutive sequence of server statuses.