@ZED.CWT, cryptic solution as usual haha :)

Hey, care to explain your solution? I really like how short and concise it is compared to mine lmao.

Goddamit! My solution is overcomplicated :(

Why did you include iterator???

I love how your code always has these random variable names (E, V, Q etc) lol

Hi,

https://www.wolframalpha.com/input/?i=(7%5E(6%5E(21)))+mod+10

Edit: Provided a naive implementation (not that my algorithm was that efficient anyways :P)

SIZE           TIME
100   - 1000   0.24128198623657227s,
1000  - 10000  0.10492610931396484s,
100000         1.62141752243042s.

Not too surprising for a worst case O(n^2) algorithm...

oooooo interesting!

Hi, just looking for some clarification:

"Note that if node 0 is connected to node 1, node 1 is also connected to node 0."
Based on that statement, I can see that isTree([[1],[0]]) is True, but why isTree([[1,2],[0,2],[1,2]]) is False?
Node 1 and node 0 are connected, and if isTree([[1],[0]]) is True, why isn't node 0 and node 1 in [[1,2],[0,2],[1,2]] considered to be connected?

Nice!