Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
- All the Pairs With the Maximum Number of Common Followers
Coding
- Average Salary Excluding the Minimum and Maximum Salary
Coding
- Best Meeting Point
Coding
- Binary Tree Maximum Path Sum
Coding · Binary Tree · Depth-First Search · DP on Trees
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2127. Maximum Employees to Be Invited to a Meeting
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source