_1733.java

packagecom.fishercoder.solutions.secondthousand;

importjava.util.HashMap;
importjava.util.HashSet;
importjava.util.Map;
importjava.util.Set;

publicclass_1733 {
publicstaticclassSolution1 {
publicintminimumTeachings(intn, int[][] languages, int[][] friendships) {
Map<Integer, Set<Integer>> langMap = newHashMap<>();
for (inti = 0; i < languages.length; i++) {
Set<Integer> set = newHashSet<>();
langMap.put(i + 1, set);
for (intlang : languages[i]) {
set.add(lang);
 }
 }
boolean[] canCommunicate = newboolean[friendships.length];
for (inti = 1; i <= n; i++) {
for (intj = 0; j < friendships.length; j++) {
intfriend1 = friendships[j][0];
intfriend2 = friendships[j][1];
if (langMap.get(friend1).contains(i) && langMap.get(friend2).contains(i)) {
canCommunicate[j] = true;
 }
 }
 }
intminTeach = friendships.length;
for (inti = 1; i <= n; i++) {
Set<Integer> teach = newHashSet<>();
for (intj = 0; j < friendships.length; j++) {
if (!canCommunicate[j]) {
intfriend1 = friendships[j][0];
intfriend2 = friendships[j][1];
if (!langMap.get(friend1).contains(i)) {
teach.add(friend1);
 }
if (!langMap.get(friend2).contains(i)) {
teach.add(friend2);
 }
 }
 }
minTeach = Math.min(minTeach, teach.size());
 }
returnminTeach;
 }
 }
}