Python, don't make me cry :(

In python the default recursion limit is 1000. This kata has trees with sizes that will make your solution recurse much more than that ;)

and you neither have to sort the arrays but fill the appropriate count of values instead. But I guess than it becomes more verbous (not an expert on Python's syntactic sugar)

Hey!

Thanks for working on the Java Translation of this KATA. Here are a couple of things I noticed:

• The "Example" section of the "Description" is a bit off. The instantiations of the Quark class are missing the new keyword.
• Also, there are no semicolons at the end of the lines.
• Basically it should be more like the C# version just using camelCase formatting instead of PascalCase or snake_case.

Otherwise seems good to me.

Approved

Thanks :)

Not a kata issue, it's just how python works.
Default arguments are evaluated only ONCE, this means your set is always the same set in every invocation of the function.

Read more here. (notice the Important warning)

It's the original function performed with a recursive implementation instead of loop. It keeps using itself with the n / 10 parameter until one of the first two conditions is met. Pretty neat.

What is prevMultOfThree?? never seen it before

Thank you! Sadly I'm not familiar with C. Hence, looking for feedback :)

C translation 🧺 :)

Yeah, I spent considerable time searching for how to restrict the values to the valid colors and flavors. Btw can anyone tell me how?

The simple fact that typical insert/update/delete commands aren't enough is an argument yoou need some wider knowledge and looking for it is a waste of time. If You want to copy/paste the solution - ok, it's not college, you don't get certificate for completing katas, however if you're doing exercises (eg. katas) and want to master your skills, you have to have those skills first and get fluent with them by comming up with solutions. So hints would be cool. However - it's Your kata (and it's cool it is here), so You're the boss.