Your code fails for cases like [[0, 1], [0, 0]] because of your 2nd for loop finding 1 at index 1 of [0, 1] (inner). However, field[1] does not have 1 in it, hence the error!

Not an issue.

i have the same problem , could i know how i can figure it out?

I'd second that. I actually found the 4 kyu sudoku validation exercise way easier than this.

You should output the input string.
I bet there was only one letter and you double it with your algorithm!

@brassington Why add the function? Just remove all code. Making stuff compile is trivial, if there is nothing which can fail. That's why I don't think this is a good Kata.

Also, your TDD tests are still the default. Imho, you should at least give one example, like calling main and call_me successfully

Thanks for the feedback, there are still some ambiguities that need to be worked out. If possible can you describe any of the weird errors you ran in to? It's possible they were the compiler errors for Rust. Assuming they were the Rust compiler errors, maybe we I should include a word of warning/introduction to Rust compiler errors...

Hey buddy, thanks. Could you please elaborate the issue ?

I don't really know what's wrong in your code, but apparently, codewars accepts it if you use directly n , instead of declaring a new variable number = n .

But I have no idea why this happens...

Glad you liked it!

I think 6kyu is just about right

What I can see is that you have some numbers that should not be there, 10890, 109890. Their corresponding reversed will have a leading 0 and the instructions say that you have to discard these terms. Correct this part and I'm pretty sure that you'll pass the tests.

Hi @mandeepbhutani. Send me between backsticks a table with the numbers that you found.
The format of the table:

n     integer
1       45
2       54
..      ...
...     ...

Thanks in advance for your time invested in this kata.
(Do not forget to mark it with spoiler)

Now ponder "01:02:03\n".