Compute the Longest Run of Ones Across Multiple Machines
Company: Molocoads
Role: Machine Learning Engineer
Category: System Design
Difficulty: medium
Interview Round: Onsite
Overview: Design an exact distributed reduction for the longest run of ones when a binary input is split across ordered machines. The solution derives a constant-size shard summary, proves the ordered merge rule, and covers all-one bridges, retries, shard identity, and reduction cost.
Read the full Molocoads Machine Learning Engineer interview experience this question came from