Minimum friend factor of each trio
Filed under SAP
The question
Given a friendship graph, find the minimum friend factor among all trios (triangles of 3 edges), where the friend factor is the sum of connections outside the trio for the three connected nodes.
No write-up yet. Related questions below have one.
Related SAP questions
Collected from public candidate posts and coding forums. Updated Nov 2026.