Leetcode 1949. Strong Friendship

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.