Solve | |||||
---|---|---|---|---|---|
maximum-subarray-sum | Maximum Subarray Sum | Find the contiguous subarray with the maximum sum. Return the sum of the subarray. | EASY | ||
minimum-number-of-coins-to-make-change | Minimum Number Of Coins To Make Change | Given an array of coins or denominations and a target sum, calculate the minimum number of coins required to match the total. Note that the coins array will have denominations that are Infinitely available, i.e. coins can be repeated and added to calculate the target. | MEDIUM |
Rows per page