Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 1919. 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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.