Leetcode 2339. All the Matches of the League

Given a list of teams, generate every distinct match between two different teams (each unordered pair exactly once), i.e., produce all combinations C(n,2) of teams — typically returned as pairs or formatted match strings. This is an O(n^2) enumeration problem of pairwise combinations.