leetcode

1 Random Problem

2 files changed, 19 insertions(+), 0 deletions(-)

diff --git a/ Problems/2952.cpp b/ Problems/2952.cpp

@@ -0,0 +1,18 @@

class Solution {

public:

int minimumAddedCoins(vector<int> &coins, int target) const {

int res = 0, get = 0;

sort(begin(coins), end(coins));

for (int i = 0; i < size(coins) && get < target; i++) {

while (get + 1 < coins[i])

get += get + 1, res++;

get += coins[i];

}

while (get < target)

get += get + 1, res++;

return res;

}

};

diff --git a/ README.md b/ README.md

@@ -1141,6 +1141,7 @@ for solving problems. | 2914 | Medium | [Minimum Number of Changes to Make Binary String Beautiful](Problems/2914.cpp) | | 2924 | Medium | [Find Champion II](Problems/2924.cpp) | | 2947 | Medium | [Count Beautiful Substrings I](Problems/2947.cpp) |

| 2952 | Medium | [Minimum Number of Coins to be Added](Problems/2952.cpp) |

| 2966 | Medium | [Divide Array Into Arrays With Max Difference](Problems/2966.cpp) | | 2971 | Medium | [Find Polygon With the Largest Perimeter](Problems/2971.cpp) | | 2997 | Medium | [Minimum Number of Operations to Make Array XOR Equal to K](Problems/2997.cpp) |