Available question text
Given locks with required energies and a sword whose per-minute gain x starts at 1 and increases by k after each break, each lock takes ceil(strength[i] / x) minutes (energy resets after each break); find the order to break all locks that minimizes total minutes. The core challenge is choosing the optimal permutation (n ≤ 8) to minimize the sum of these ceil divisions, typically solved by exploring permutations or bitmask DP.
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
No company association
Leetcode 3376. Minimum Time to Break Locks I
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source