True, but for people who just started coding, this approach is the most obvious along with str(b)

Bro, I try my best to come up with a solution using a couple of lines for every kata, and then there will be a guy like this whos one-liner code would look like:

return [the answer that you're looking for]

I truly feel like a noob :')

The "adjacency list" aspect of this kata isn't explained very well, so here is an explanation that is hopefully not a spoiler:

The adjacency list should basically be a 2D list or array created in the constructor, with one subarray for each vertex in the graph. The indexes of these subarrays correspond to the (numeric) names of the vertices.

When a new edge is added, if the two vertices are equal, you put that number into the corresponding adjacency list subarray twice. If the vertices are not equal, then you put each vertex into the other vertex's subarray in the adjacency list once.

A couple of tips for this aspect of the kata:

1. Do some research into how to raise or throw exceptions in your language.
2. Your IllegalArgumentError might need to inherit from a parent class (a more general type of exception). So research how to specify that, too.

哥们你都等级6了 你不是在开玩笑吧

三不像 有这功夫直接字典映射不好

"ask a small girl" 😭

Alright.

@chrono79

Thanks for adding them. Unfortunately I cannot edit my original post :(

If not random tests, at least shuffled tests should be added to prevent solvers from hardcoding fixed tests ...

Feel free to add the rest or close this one and open another one with latest languages ... I won't be contributing in fixing && translating anymore, unless ............

Added random tests to Typescript and PHP. Could we strikeout the languages that already have random tests in the first post? Also, the input range is limited to 10 strings, are random tests really necessary?

why is that?

That's actually an issue not a suggestion