Leetcode 3385. Minimum Time to Break Locks II
Given N locks and a set of operations (each with a time cost) that can simultaneously change the state of a subset of locks, find the minimum total time to get every lock to the "broken" state. The core challenge is exploring an exponential state space of lock configurations and combining operations optimally—typically solved with bitmask DP or shortest-path (Dijkstra) on the implicit state graph.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Hello Interview Premium
Your account is free and you can post anonymously if you choose.