✅ One Line Solution
(Disclaimer: this is not an example to follow in a real project - it is written for fun and training mostly)Code #1.1 - One LineTime complexity: O(n2). Space co
(Disclaimer: this is not an example to follow in a real project - it is written for fun and training mostly)

# Code #1.1 - One Line
Time complexity: $$O(n^2)$$. Space complexity: $$O(n)$$.
```python3
class Solution:
    def findRedundantConnection(self, e: List[List[int]]) -> List[int]:
        return (t:=''.join(map(chr,range(1001)))) and next([u,v] for u,v in e if (t[u]==t[v],t:=t.replace(t[u],t[v]))[0])
```
[Ref](https://leetcode.com/problems/redundant-connection/solutions/108002/unicode-find-5-short-lines)

# Code #1.2 - Unwrapped
```python3
class Solution:
    def findRedundantConnection(self, e: List[List[int]]) -> List[int]:
        t = ''.join(map(chr, range(1001)))
        for u,v in e:
            if t[u] == t[v]:
                return [u, v]
                
            t = t.replace(t[u], t[v])
```

(Disclaimer 2: code above is just a product of fantasy packed into one line, it is not claimed to be 'true' oneliners - please, remind about drawbacks only if you know how to make it better)
['Tree', 'Union Find', 'Graph', 'Python', 'Python3']