DE shaw OA | Scary question tbh
Summary
I participated in a DE Shaw Online Assessment which featured two challenging algorithmic questions, one on Minimum Spanning Trees with 0/1 edge weights and another on maximizing redundancy by flipping...
Interview Experience
Q1 - A complete graph is a graph where each pair of vertices is connected by an edge. Given an undirected weighted complete graph with g_nodes vertices, the weight of each edge is either 0 or 1. There are exactly g_edges edges provided in the form of two arrays, g_from and g_to, which denote an undi...


