Kotlin
Java
JavaReturn to List
Solve: Subset Total
Created By: Chris Taylor
/ Version: 2023.7.0
Write the recursive method, subsetTotal(int[] nums, int total, int start),
that, when called by the provided subsetTotal(int[] nums, int total) method,
returns true if the sum of any subset of values in nums is equal to total.
You may assume that nums is not null.
boolean subsetTotal(int[] nums, int total, int start) {
return false; // You may need to remove this starter code
}
boolean subsetTotal(int[] nums, int total) {
return subsetTotal(nums, total, 0);
}
Related Lessons
Stuck? You may find these lessons helpful: