Good Kata. This actually took me a while but then I clocked. I was searching for ages on how to make a large list of Long types to then count in scala. Was really inefficient and didn't find a simple solution. But this was a good way to think differently. To anyone trying in scala... you'll slap yourself when you get it.

The last example shows this exact scenario.

I think people who are struggling to understand the problem specifications can use the many forum comments talking about this exact thing to help them understand how and why other people are able to interpret the problem in the way the Kata author intended!

Sometimes when writing code, we come at it with wrong impressions, but that's when discourse matters most to correct ourselves!

Can we add this example to the Kata description to make it clearer?

No.

10                   // no pair
10, 5                // no pair adding to 10
10, 5, 2             // no pair adding to 10
10, 5, 2, 3          // no pair adding to 10
10, 5, 2, 3, 7       // a pair adding to 10: 3 + 7, done

same issue here. I think the instruction is not clear enough. since we were asked to parse from left, then first pair should be [5,5] unless I misunderstand the instruction.

And then it would violate Python's conventions so you would have to write another comment saying "Please use underscores when possible. This isn't JavaScript"

Hello, I have the same question, but I have a hypothesis: the kata says "the first two values (parse from the left please)", so I think [3,7] are the first, because the 7 is the first from the left that 5. But I repeat is a hypothesis.

regards

Good easy kata to start practicing recursion on

Drop a few *s and the as part -- otherwise just forfeit the kata and learn from the solutions :-)

Thank you

Of course, why wouldn't they be?

Are spaces counted as characters?

I've tried to do two ways here but just cutting short of completion.

First function has come to 69 characters however including the "from ******** import ********** as **" it equals 101 characters.

Second function has come to 70 characters however including the "import ******** as *" it equals 91 characters.

I can't find any other solution on stack overflow or other forums/websites. I think I've shortened it as much as possible...unless someone can give another hint to point me in another direction?

'looks like u solved it'