5 kyu
Recursive ASCII Fractals
51skidd
Loading description...
Mathematics
Algorithms
Geometry
ASCII Art
Performance
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.
This comment has been hidden.
This one should be fixed asap: https://www.codewars.com/kumite/637b0a0e11b50fbe53bb2e5f?sel=637b0a0e11b50fbe53bb2e5f
resolved.
Sample / actual testcase: Missing solution import. (
from solution import fractalize)fixed: https://www.codewars.com/kumite/637b0c0f71cd9bc49401c839?sel=637b0c0f71cd9bc49401c839
resolved.
I believe the author already fixed this?
not sure what time, but yes
typo: "2st" should be "2nd"
Thanks for spotting this.
Hi,
Cheers
Thanks. I fixed the sample tests and added more information about the random tests to the description.
Are there any performance constraints? My recursive solution times out.
I suggest to add the
performancetag. Naive solutions time out.Thanks for the suggestion. I just added this tag. The solution must be efficient because the random tests get fairly large, highest is 9x9 for 4 iterations.
Votes were split between 5 and 6 kyu. I'd say the performance requirements push this to kyu 5, approved!
Why is 3rd iteration 27x27, and not 81x81? Is Iteration 3 built by replacing every
*from iteration 2 by a copy of iteration 2, or is the rule different?The rule is different. Iteration 3 is built by replacing
*in the starting seed by a copy of iteration 2. I hope this answers your question. Edit: I just clarified this in the description.What to do with empty seed?
['', '']-> should be stated in specificationThanks for this feedback. I added this to the description.
You print too much
I noticed this happening too. I couldn't figure out not print your output should equal intended output, so what I'm doing now is just testing for equality before the assert_equals on the random tests to prevent the large lists from being printed out. Let me know if there's a better way.