Goldman SachsCoding·120 minMembers
Efficient Tasks / Three-Server Difficulty Split
Members only
Partition task difficulties across three servers, then each server chooses one task to minimize `|d1-d2| + |d2-d3|`; maximize that minimized value over all valid partitions. Multiple 2026 OA candidate...
SWE
RS
array
greedy
math
medium
Frequency
Low
Last asked
2025-11-25
Stage
oa
Log in to continue reading the full content
Comments
Sign in to join the discussion
Loading...
