6 kyu
Product Partitions II
Loading description...
Fundamentals
Data Structures
Mathematics
Recursion
Algorithms
This comment has been reported as {{ abuseKindText }}.
Show
This comment has been hidden. You can view it now .
This comment can not be viewed.
- |
- Reply
- Edit
- View Solution
- Expand 1 Reply Expand {{ comments?.length }} replies
- Collapse
- Spoiler
- Remove
- Remove comment & replies
- Report
{{ fetchSolutionsError }}
-
-
Your rendered github-flavored markdown will appear here.
-
Label this discussion...
-
No Label
Keep the comment unlabeled if none of the below applies.
-
Issue
Use the issue label when reporting problems with the kata.
Be sure to explain the problem clearly and include the steps to reproduce. -
Suggestion
Use the suggestion label if you have feedback on how this kata can be improved.
-
Question
Use the question label if you have questions and/or need help solving the kata.
Don't forget to mention the language you're using, and mark as having spoiler if you include your solution.
-
No Label
- Cancel
Commenting is not allowed on this discussion
You cannot view this solution
There is no solution to show
Please sign in or sign up to leave a comment.
Description should be language-agnostic
Input range for
sshould be specified tooA lot of parts require re-wording and cleaning for clarity
Супер ката.
Grate kata!
python new test framework
Approved!
Nice kata of the series for exercising the dynamic programming approach.
The first part really should be linked to in the description.
Done.
I have just copied my solution from previous part and it is working properly..
i suggest you to advance the limit of
n- otherwise good kata:)This kata is very good,i spend a lot of time on the returning of the recursion function.but at last i solved it.It is a good kata for exercise recursion.