Please clarify:
The tsp function is provided with only the matrix. Where is the 'reference solution'? How do I optimized the salesman path for a "same or lower" cost?
Thanks...

If you're looking for NodeJS built-in modules, then take a look at NodeJS v18 API docs

Well, yeah, but I am not seeing the library everybody used for solving this kata

Here: https://docs.codewars.com/languages/javascript#node-modules

If I understand correctly you can import native Node.js packages inside the codewars environment?

Where's the list of all those packages available on codewars?

I see them aswell. Closing...

Rejected for using outdated language version.

Forking is still possible, so no work is necessarily lost.

I see them all.

None of the images in the description are showing

Python new test framework should be used (Refer this for more detail)

It is left to you. The only requirements is that the result be lowercase and have a maximal length of 13 (including the short.ly/ prefix)

Thanks a lot, this issue was not only in dart but in all languages :)

DART > The regex you use to check if shortURL (short.ly/[a-z]{1,4}) is valid is wrong. You forgot to escape the dot, meaning that "shorttly/abcd" is still valid URL.

With this you can circumvent the problem with big numbers, since the number of valid strings is actually 14_257_620, not 475_254. For example in my solution once i got to number 470_000, i resetted the number to 0, and changed the url from "short.ly" to "shorttly". This way i cheated the regex, and my solution was valid. THIS IS WRONG!
Please fix the regex to short.ly/[a-z]{1,4}

After getting this one wrong a hundred times in a hundred ways, I finally stopped being dumb and now I think it's a good kata

approved