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.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 1949. Strong Friendship

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact