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]

Stats:

CreatedJul 3, 2021
Warriors Trained8
Total Skips0
Total Code Submissions25
Total Times Completed5
Python Completions5
Total Stars0
% of votes with a positive feedback rating0% of 4
Total "Very Satisfied" Votes0
Total "Somewhat Satisfied" Votes0
Total "Not Satisfied" Votes4
Total Rank Assessments4
Average Assessed Rank
7 kyu
Highest Assessed Rank
7 kyu
Lowest Assessed Rank
7 kyu
Ad
Contributors
  • ckarakoc Avatar
Ad