Retired
Partition (retired)
Description:
Split a big value (n) in a list of smaller ones, each unique and bigger or equal than a minimun (minsize).
The sum of the value in the list must (obviously) be equal to n
List size MUST be longer or equal to sqrt(2n)-(3minsize)
if n is lesser of minsize, return a list containing n
Fundamentals
Similar Kata:
Stats:
| Created | May 24, 2017 |
| Warriors Trained | 77 |
| Total Skips | 0 |
| Total Code Submissions | 238 |
| Total Times Completed | 9 |
| Python Completions | 9 |
| Total Stars | 0 |
| % of votes with a positive feedback rating | 50% of 7 |
| Total "Very Satisfied" Votes | 2 |
| Total "Somewhat Satisfied" Votes | 3 |
| Total "Not Satisfied" Votes | 2 |
| Total Rank Assessments | 7 |
| Average Assessed Rank | 6 kyu |
| Highest Assessed Rank | 5 kyu |
| Lowest Assessed Rank | 7 kyu |
