tomatocream
1dec88aaf2
Add populate-notes.mjs that fetches problem descriptions and Python/C++ code stubs from LeetCode's GraphQL API. Populated all 197 NeetCode 150 note files with: - Problem description (examples, constraints) - Python code stub (function signature) - C++ code stub (function signature + includes) API responses cached in leetcode/.cache/leetcode/ for instant re-runs.
1.2 KiB
1.2 KiB
TODO 0322. Coin Change medium
You are given an integer array coins representing coins of different denominations and an integer amount representing a total amount of money.
Return the fewest number of coins that you need to make up that amount. If that amount of money cannot be made up by any combination of the coins, return -1.
You may assume that you have an infinite number of each kind of coin.
Example 1:
Input: coins = [1,2,5], amount = 11
Output: 3
Explanation: 11 = 5 + 5 + 1Example 2:
Input: coins = [2], amount = 3
Output: -1Example 3:
Input: coins = [1], amount = 0
Output: 0Constraints:
1 <= coins.length <= 121 <= coins[i] <= 2^{31} - 10 <= amount <= 10^{4}
TODO Approach
Write your approach here.
TODO Python
class Solution:
def coinChange(self, coins: List[int], amount: int) -> int:TODO C++
class Solution {
public:
int coinChange(vector<int>& coins, int amount) {
}
};