thank you very much mate, I wish you the best of luck in your professional career as well

Hello) Don't worry, everything is fine! I am also just learning how to program and also make a lot of mistakes. You are a great fellow, because you are learning and making attempts to write code! I am sure that over time you will be able to become a professional in your field. Don't stop learning and enjoy the process. Good luck ;)

Fixed in the description.

Fixed in the description.

Im agree.

Better problem task may be if the distances on the array was between stations rather than to the origin.

The solution of the problem can be the list os stations must been visited in order to reach the final of travel with the least stops possible

I just included that test case in the rareTests. I also removed some phrases that made the description of the kata a bit confusing. I hope that with these corrections everything is correct. If not, let me know and I will try to fix any problem. Thanks in advance.

It is still very unclear. In the actual task everything after the refill is thrown away and we do not care, but in the hypothetical scenario that'd be absurd (since the purpose is to reach the destination).

Then the empty array is an edge case; it should be moved into fixed tests to ensure it is always tested each run.

Fixed in the description.

Fixed in the description.

Thank you very much!

Please see Translation authoring guidelines for ideas on creating a good quality translations. Please visit Codewars Discord and #help-translate channel if you need help with creating translations.

Fixed.

I apologize for any errors in the translation of this kata. I think they have been fixed. If this is not the case or more errors appear please let me know. Thanks for your understanding.

Hello Oleg. I apologize for the errors in the translation of your kata. I have edited it and I think I fixed all the problems. I am just starting in programming, thanks for your understanding.