Google

Find the duplicate number in an array of n + 1 integers where each value is between 1 and n using Floyd's Tortoise and Hare cycle detection. Given a list of account emails where some belong to the same person, merge overlapping accounts using a Disjoint Set Union (Union-Find) data structure. Compute the maximum sum of values collected from a starting node to any ending node in a binary tree without reusing nodes.