Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Microsoft
Leetcode 3385. Minimum Time to Break Locks II
Reported Sep 2, 2026 · 1 source report
PRINCIPAL
Source snapshot: Nov 12, 2026
View source