From c5741a3beafd7a685570bad9a095468e3495129a Mon Sep 17 00:00:00 2001 From: Deven <63876261+devenperez@users.noreply.github.com> Date: Wed, 10 Sep 2025 20:02:24 -0400 Subject: [PATCH] Create README - LeetHub --- .../README.md | 43 +++++++++++++++++++ 1 file changed, 43 insertions(+) create mode 100644 1733-minimum-number-of-people-to-teach/README.md diff --git a/1733-minimum-number-of-people-to-teach/README.md b/1733-minimum-number-of-people-to-teach/README.md new file mode 100644 index 0000000..1f1e4d5 --- /dev/null +++ b/1733-minimum-number-of-people-to-teach/README.md @@ -0,0 +1,43 @@ +

1733. Minimum Number of People to Teach

Medium

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:

+ + + +

You can choose one language and teach it to some users so that all friends can communicate with each other. Return the minimum number of users you need to teach.

+Note that friendships are not transitive, meaning if x is a friend of y and y is a friend of z, this doesn't guarantee that x is a friend of z. +

 

+

Example 1:

+ +
+Input: n = 2, languages = [[1],[2],[1,2]], friendships = [[1,2],[1,3],[2,3]]
+Output: 1
+Explanation: You can either teach user 1 the second language or user 2 the first language.
+
+ +

Example 2:

+ +
+Input: n = 3, languages = [[2],[1,3],[1,2],[3]], friendships = [[1,4],[1,2],[3,4],[2,3]]
+Output: 2
+Explanation: Teach the third language to users 1 and 3, yielding two users to teach.
+
+ +

 

+

Constraints:

+ +