Draft
Sums of List of Integers
Description:
Given an array of integers, give all possible ways the integers can be added to a certain value.
- The output should be a list of lists containing all correct sums.
- The resulting list should not contain duplicates.
- The resulting sums should be in increasing order (i.e. sorted)
Example:
Give sums to 12:
✓ [1,2,3,3,5,7] => [5, 7], [2, 3, 7], [1, 3, 3, 5]
X [1,2,3,3,5,7] => [7, 5], [2, 3, 7], [1, 3, 3, 5]
X [1,2,3,3,5,7] => [7, 5], [2, 3, 7], [2, 3, 7], [1, 3, 3, 5]
Similar Kata:
Stats:
Created | Jul 3, 2021 |
Warriors Trained | 8 |
Total Skips | 0 |
Total Code Submissions | 25 |
Total Times Completed | 5 |
Python Completions | 5 |
Total Stars | 0 |
% of votes with a positive feedback rating | 0% of 4 |
Total "Very Satisfied" Votes | 0 |
Total "Somewhat Satisfied" Votes | 0 |
Total "Not Satisfied" Votes | 4 |
Total Rank Assessments | 4 |
Average Assessed Rank | 7 kyu |
Highest Assessed Rank | 7 kyu |
Lowest Assessed Rank | 7 kyu |