Minimum Time to Break Locks I
Bob is stuck in a dungeon and must break n locks, each requiring some amount of energy to break.
Bob is stuck in a dungeon and must break n locks, each requiring some amount of energy to break. The required energy for each lock is stored in an array called strength where strength[i] indicates the energy needed to break the ith lock.
To break a lock, Bob uses a sword with the following characteristics:
Your task is to determine the minimum time in minutes required for Bob to break all n locks and escape the dungeon.
Return the minimum time required for Bob to break all n locks.
Example 1
Input: strength = [3,4,1], k = 1
Output: 4
Explanation: The locks cannot be broken in less than 4 minutes; thus, the answer is 4.
Example 2
Input: strength = [2,5,4], k = 2
Output: 5
Explanation: The locks cannot be broken in less than 5 minutes; thus, the answer is 5.
Constraints
- n == strength.length
- 1 <= n <= 8
- 1 <= K <= 10
- 1 <= strength[i] <= 10^6
Hints
Companies
No companies reported yet.
Discussion
Sign in to join the discussion.
Loading discussion...
Test results
No test cases yet.