Fixed

Hmmm, I like the title aesthetically but you're correct it frames the problem incorrectly. I will try "Shuffled N-Ary Tree"

Fixed! Thanks for the issue

awesome, thank you-- will fix

Great point, curious what the consensus is. To be clear: I didn't use any of their text, images, examples, or code for this challenge.

Here's what leetcode says in their terms of service:
You agree not to copy, redistribute, publish or otherwise exploit any Content in violation of the intellectual property rights.

Since I didn't use their content for this challenge, they'd have to claim that the underlying algorithm question is their intellectual property, which would be evil and bad and harder to claim than if I copypasta'd.

Presumably this question has come up before, but I like this problem so am happy to modify so that I'm following the rules

I added some of the more precise language from the leetcode version. I like having the bit about the driver code down with the test case, what do you think about that?

I'm marking this as resolved so that I can republish with updates from the other issues, but I'm open to improving the description.

I'd like to get the description into a minimum-viable state and then translate this into javascript and typescript, then focus on making a visualization and perhaps a fuller tree for an example.

Please feel free to re-open an issue with specific suggestions and I'll take a look

Marking as resolved so that I can republish, but please feel free to make a new issue if there are still issues

Okay, added better tests. This is my first submission, so I'm still getting used to it.

Is there anything you prefer about the leetcode description? I like mine better, but I'm open to fixing specific criticisms if you have them. If I add one more example will that suffice?

Sample tests are up

I will mention how the serialization works in the description

This is a mistake, I will fix, thank you for the feedback

Thank you for the feedback, Node is specified in the input box. I'll consider adding it to the description.

I attempted this kata in Javascript.

I had trouble understanding the what the kata was asking, even with the test output.

I ended up with a solution that shifted/unshifted both lists because I thought that's what in-place was referring to.

After reviewing the solutions it is clear to me that I misunderstood the problem, but I still can't quite tell what I should have done.

Thanks for the other great katas!