https://leetcode.com/problems/minimum-time-to-break-locks-i/description/
class Solution {
public:
int findMinimumTime(vector<int>& strength, int k) {
int n = strength.size();
vector<
https://leetcode.com/problems/triangle/description/?envType=study-plan-v2&envId=top-interview-150
class Solution {
public:
int minimumTotal(vector<vector<int>>& triangle)
https://leetcode.com/problems/coin-change/?envType=study-plan-v2&envId=top-interview-150
class Solution {
public:
int coinChange(vector<int>& coins, int amount) {
int n