2025-09-10 Daily Challenge

Posted on:
Posted modified:
In: DailyChallenge

Today I have done leetcode's September LeetCoding Challenge with cpp.

September LeetCoding Challenge 10

Description

Minimum Number of People to Teach

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] denotes a friendship between the users u​​​​​​​​​​​i​​​​​ and vi.

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:

  • 2 <= n <= 500
  • languages.length == m
  • 1 <= m <= 500
  • 1 <= languages[i].length <= n
  • 1 <= languages[i][j] <= n
  • 1 <= u​​​​​​i < v​​​​​​i <= languages.length
  • 1 <= friendships.length <= 500
  • All tuples (u​​​​​i, v​​​​​​i) are unique
  • languages[i] contains only unique values

Solution

class Solution {
public:
  int minimumTeachings(int n, vector<vector<int>>& languages, vector<vector<int>>& friendships) {
    int m = languages.size();
    vector<unordered_set<int>> lang(m+1);
    for(int i = 0; i < m; ++i) {
      lang[i+1] = unordered_set<int>(languages[i].begin(), languages[i].end());
    }
    vector<bool> sat;
    for(auto &f : friendships) {
      bool s = false;
      for(auto l : lang[f[0]]) {
        if(lang[f[1]].count(l)) {
          sat.push_back(true);
          s = true;
          break;
        }
      }
      if(!s) sat.push_back(false);
      
    }
    int answer = m;
    for(int i = 1; i <= n; ++i) {
      int cnt = 0;
      for(int j = 0; j < friendships.size(); ++j) {
        if(sat[j]) continue;
        // cout << friendships[j][0] << ' ' << friendships[j][1] << endl;
        cnt += !lang[friendships[j][0]].count(i);
        cnt += !lang[friendships[j][1]].count(i);
        lang[friendships[j][0]].insert(i);
        lang[friendships[j][1]].insert(i);
      }
      answer = min(answer, cnt);
    }
    return answer;
  }
};

// Accepted
// 100/100 cases passed (288 ms)
// Your runtime beats 10.59 % of cpp submissions
// Your memory usage beats 17.65 % of cpp submissions (152.3 MB)
Algorithm