Leetcode 2127. Maximum Employees to Be Invited to a Meeting

Given a functional directed graph where each node points to its favorite person, choose the largest subset that can be arranged around a round table so every invited node sits next to its favorite. This reduces to finding the maximum between the length of the largest directed cycle and the sum of sizes formed by all mutual-favorite pairs (2-cycles) extended by the longest incoming chains into each pair.