Search
⌘K

Leetcode 614. Second Degree Follower

Given a directed "follows" graph, find the unique second-degree followers — users who follow one of a user's followers but do not directly follow that user (excluding the user themself). The core challenge is efficiently traversing depth‑2 neighbors and deduplicating results in a potentially large, cyclic graph.


Question Timeline

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

Comments

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