NeetCode #721LC-518Medium2-D Dynamic ProgrammingNC 150NC 250
← Back to All Problems#721 · #518 · Coin Change II(零钱兑换 II)
📌 Problem Statement & Constraints
Given an integer array
coins and an integer amount, return the number of combinations that make up amount using an unlimited supply of each coin. Constraints: 1 <= coins.length <= 300, 1 <= coins[i] <= 5000, 0 <= amount <= 5000. The answer fits in a signed 32-bit integer.🔒
Sign In to Unlock Full Solutions for All 973 Problems
Sign in to access step-by-step logic, benchmark Python3 code, complexity breakdown, and offline export!