Leetcodify Similar Friends

Given a social graph where each user has a set of friends, identify pairs or top-K users whose friend lists are highly similar (e.g., large overlap or Jaccard similarity above a threshold). The challenge is to compute these similarities efficiently at scale for large, sparse graphs, requiring sub-quadratic techniques such as inverted indexes, hashing/MinHash, or bitset intersections.