Available question text
Given an undirected friendship graph and a threshold k, determine which friendships or users are "strong"—typically defined by having at least k mutual friends or belonging to the k-core—often requiring efficient degree-tracking, adjacency intersections, and iterative pruning to handle cascading removals or queries. This is a graph problem focusing on k-core-like pruning and fast neighborhood/count updates.
Related questions
Continue with questions that share topics or the same question type.
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 1949. Strong Friendship
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source