@B4B Not for you, you're a moderator :)

it's the kata's fault though, not yours.

I am sorry. I was just trying to test some answers.

Needless to say that the calculation should be dynamic and not hardcoded...

Thank you so much!

Great kata. Very challenging. My recognition to the autor, jaybruce1998. The last part is very tricky because of the eventual "parity".

Pleasantly challenging!!! Good job evk!

Try googling it.

Mine is passing all the tests in Attempt. However shows "Exit Code: 139" and won't let me Submit it. Can anybody give some guidance?

if the \n at the end of each line is not guaranteed

Description doesn't say that. Description says this:

track - string representation of the entire train line (\n separators - maybe jagged, maybe not trailing)

• \n separators - means each row is separated by \n
• maybe jagged - means each row might be different lengths
• maybe not trailing - means the \n of the last row is optional

no the linefeed are always present. That's the number of trailing spaces, hence, the length of the row, that isn't guaranteed.

Great kata dinglemouse. I do have a question, if the \n at the end of each line is not guaranteed then how can you really tell that the row ended? I mean, in your example, since there is no separation between the 2nd and 3rd row it looks like if the 2nd row is 92 characters long but in reality it is just 2nd nd 3rd row looking like one. Some guidance here please...

Happy coding ^_^

myjinxin2015 great job. Very, very challenging and particular. Took me very long to solve it but was absolutely worth it.

The most challening task is to be able to detect a pattern. If the string is split into smaller pieces and these pieces are consecutive to eachother you might have found a pattern. Once you have the pattern you can calculate the position of the first number of the pattern. I am trying to help without spoling the kata.

By the way, myjinxin2015, this is one of the mosy singular and challenging katas I have done. Congratulations. Keep it up!