to check if 3 points are collinear or not

connect to nodes to belong to the same set

counting the no. of 1's in the binary representation of each integer in the array

:type n: int :rtype: int

Decodes a shortened URL to its original URL.

dfs function call to mark a node visited if it's not and push that node and its index into respective their vectors

returns euclidean distance between 2 points

Encodes a URL to a shortened URL.

:type n: int :type logs: List[str] :rtype: List[int]

:type g: List[int] :type s: List[int] :rtype: int

:type nums: List[int] :rtype: List[int]

returns distance to 0