← All problemsSign in

1733. Minimum Number of People to Teach

LeetCodeArrayHash TableGreedyOpen on judge ↗

On a social network consisting of m users and some friendships between users, two users can communicate with each other if they know a common language. You are given an integer n, an array languages, and an array friendships where: - There are n languages numbered 1 through n, - languages[i] is the set of languages the i​​​​​​th​​​​ user knows, and - friendships[i] = [u​​​​​​i​​​, v​​​​​​i] de

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start