add solutions, explanation and update the README file of the day 2127

Aarzoo · Aarzoo · commit ae6e8dccc9aa · 2025-01-26T09:01:10.000+05:30
diff --git a/Algorithms/README.md b/Algorithms/README.md
@@ -69,6 +69,7 @@
 | 2064            | Minimized Maximum of Products Distributed to Any Store  | [C++](./Algorithms/src/2064.%20Minimized%20Maximum%20of%20Products%20Distributed%20to%20Any%20Store/Code/solution.cpp), [Java](./Algorithms/src/2064.%20Minimized%20Maximum%20of%20Products%20Distributed%20to%20Any%20Store/Code/solution.java), [JavaScript](./Algorithms/src/2064.%20Minimized%20Maximum%20of%20Products%20Distributed%20to%20Any%20Store/Code/solution.js), [Python](./Algorithms/src/2064.%20Minimized%20Maximum%20of%20Products%20Distributed%20to%20Any%20Store/Code/solution.py), [Go](./Algorithms/src/2064.%20Minimized%20Maximum%20of%20Products%20Distributed%20to%20Any%20Store/Code/solution.go) | [Explanation](./Algorithms/src/2064.%20Minimized%20Maximum%20of%20Products%20Distributed%20to%20Any%20Store/Explanation/explanation.md)   | Medium             |
 | 2070            | Most Beautiful Item for Each Query  | [C++](./Algorithms/src/2070.%20Most%20Beautiful%20Item%20for%20Each%20Query/Code/solution.cpp), [Java](./Algorithms/src/2070.%20Most%20Beautiful%20Item%20for%20Each%20Query/Code/solution.java), [JavaScript](./Algorithms/src/2070.%20Most%20Beautiful%20Item%20for%20Each%20Query/Code/solution.js), [Python](./Algorithms/src/2070.%20Most%20Beautiful%20Item%20for%20Each%20Query/Code/solution.py), [Go](./Algorithms/src/2070.%20Most%20Beautiful%20Item%20for%20Each%20Query/Code/solution.go) | [Explanation](./Algorithms/src/2070.%20Most%20Beautiful%20Item%20for%20Each%20Query/Explanation/explanation.md)   | Medium             |
 | 2116            | Check if a Parentheses String Can Be Valid  | [C++](./Algorithms/src/2116.%20Check%20if%20a%20Parentheses%20String%20Can%20Be%20Valid/Code/solution.cpp), [Java](./Algorithms/src/2116.%20Check%20if%20a%20Parentheses%20String%20Can%20Be%20Valid/Code/solution.java), [JavaScript](./Algorithms/src/2116.%20Check%20if%20a%20Parentheses%20String%20Can%20Be%20Valid/Code/solution.js), [Python](./Algorithms/src/2116.%20Check%20if%20a%20Parentheses%20String%20Can%20Be%20Valid/Code/solution.py), [Go](./Algorithms/src/2116.%20Check%20if%20a%20Parentheses%20String%20Can%20Be%20Valid/Code/solution.go) | [Explanation](./Algorithms/src/2116.%20Check%20if%20a%20Parentheses%20String%20Can%20Be%20Valid/Explanation/explanation.md)   | Medium             |
+| 2127            | Maximum Employees to Be Invited to a Meeting  | [C++](./Algorithms/src/2127.%20Maximum%20Employees%20to%20Be%20Invited%20to%20a%20Meeting/Code/solution.cpp), [Java](./Algorithms/src/2127.%20Maximum%20Employees%20to%20Be%20Invited%20to%20a%20Meeting/Code/solution.java), [JavaScript](./Algorithms/src/2127.%20Maximum%20Employees%20to%20Be%20Invited%20to%20a%20Meeting/Code/solution.js), [Python](./Algorithms/src/2127.%20Maximum%20Employees%20to%20Be%20Invited%20to%20a%20Meeting/Code/solution.py), [Go](./Algorithms/src/2127.%20Maximum%20Employees%20to%20Be%20Invited%20to%20a%20Meeting/Code/solution.go) | [Explanation](./Algorithms/src/2127.%20Maximum%20Employees%20to%20Be%20Invited%20to%20a%20Meeting/Explanation/explanation.md)   | Hard             |
 | 2134            | Minimum Swaps to Group All 1's Together II  | [C++](./Algorithms/src/2134.%20Minimum%20Swaps%20to%20Group%20All%201's%20Together%20II/Code/solution.cpp), [Java](./Algorithms/src/2134.%20Minimum%20Swaps%20to%20Group%20All%201's%20Together%20II/Code/solution.java), [JavaScript](./Algorithms/src/2134.%20Minimum%20Swaps%20to%20Group%20All%201's%20Together%20II/Code/solution.js), [Python](./Algorithms/src/2134.%20Minimum%20Swaps%20to%20Group%20All%201's%20Together%20II/Code/solution.py), [Go](./Algorithms/src/2134.%20Minimum%20Swaps%20to%20Group%20All%201's%20Together%20II/Code/solution.go) | [Explanation](./Algorithms/src/2134.%20Minimum%20Swaps%20to%20Group%20All%201's%20Together%20II/Explanation/explanation.md)   | Medium             |
 | 2185            | Counting Words With a Given Prefix  | [C++](./Algorithms/src/2185.%20Counting%20Words%20With%20a%20Given%20Prefix/Code/solution.cpp), [Java](./Algorithms/src/2185.%20Counting%20Words%20With%20a%20Given%20Prefix/Code/solution.java), [JavaScript](./Algorithms/src/2185.%20Counting%20Words%20With%20a%20Given%20Prefix/Code/solution.js), [Python](./Algorithms/src/2185.%20Counting%20Words%20With%20a%20Given%20Prefix/Code/solution.py), [Go](./Algorithms/src/2185.%20Counting%20Words%20With%20a%20Given%20Prefix/Code/solution.go) | [Explanation](./Algorithms/src/2185.%20Counting%20Words%20With%20a%20Given%20Prefix/Explanation/explanation.md)   | Easy             |
 | 2270            | 2270. Number of Ways to Split Array  | [C++](./Algorithms/src/2270.%20Number%20of%20Ways%20to%20Split%20Array/Code/solution.cpp), [Java](./Algorithms/src/2270.%20Number%20of%20Ways%20to%20Split%20Array/Code/solution.java), [JavaScript](./Algorithms/src/2270.%20Number%20of%20Ways%20to%20Split%20Array/Code/solution.js), [Python](./Algorithms/src/2270.%20Number%20of%20Ways%20to%20Split%20Array/Code/solution.py), [Go](./Algorithms/src/2270.%20Number%20of%20Ways%20to%20Split%20Array/Code/solution.go) | [Explanation](./Algorithms/src/2270.%20Number%20of%20Ways%20to%20Split%20Array/Explanation/explanation.md)   | Medium             |
diff --git a/Algorithms/src/2127. Maximum Employees to Be Invited to a Meeting/Code/solution.cpp b/Algorithms/src/2127. Maximum Employees to Be Invited to a Meeting/Code/solution.cpp
@@ -0,0 +1,64 @@
+class Solution
+{
+public:
+    int maximumInvitations(vector<int> &favorite)
+    {
+        int n = favorite.size();
+        vector<int> inDegree(n, 0), chainLengths(n, 0);
+        vector<bool> visited(n, false);
+
+        for (int fav : favorite)
+        {
+            inDegree[fav]++;
+        }
+
+        queue<int> q;
+        for (int i = 0; i < n; ++i)
+        {
+            if (inDegree[i] == 0)
+            {
+                q.push(i);
+            }
+        }
+
+        while (!q.empty())
+        {
+            int node = q.front();
+            q.pop();
+            visited[node] = true;
+
+            int next = favorite[node];
+            chainLengths[next] = chainLengths[node] + 1;
+            if (--inDegree[next] == 0)
+            {
+                q.push(next);
+            }
+        }
+
+        int maxCycle = 0, totalChains = 0;
+        for (int i = 0; i < n; ++i)
+        {
+            if (!visited[i])
+            {
+                int current = i, cycleLength = 0;
+                while (!visited[current])
+                {
+                    visited[current] = true;
+                    current = favorite[current];
+                    cycleLength++;
+                }
+
+                if (cycleLength == 2)
+                {
+                    totalChains += 2 + chainLengths[i] + chainLengths[favorite[i]];
+                }
+                else
+                {
+                    maxCycle = max(maxCycle, cycleLength);
+                }
+            }
+        }
+
+        return max(maxCycle, totalChains);
+    }
+};
diff --git a/Algorithms/src/2127. Maximum Employees to Be Invited to a Meeting/Code/solution.go b/Algorithms/src/2127. Maximum Employees to Be Invited to a Meeting/Code/solution.go
@@ -0,0 +1,55 @@
+func maximumInvitations(favorite []int) int {
+    n := len(favorite)
+    inDegree := make([]int, n)
+    chainLengths := make([]int, n)
+    visited := make([]bool, n)
+
+    for _, fav := range favorite {
+        inDegree[fav]++
+    }
+
+    queue := []int{}
+    for i := 0; i < n; i++ {
+        if inDegree[i] == 0 {
+            queue = append(queue, i)
+        }
+    }
+
+    for len(queue) > 0 {
+        node := queue[0]
+        queue = queue[1:]
+        visited[node] = true
+
+        next := favorite[node]
+        chainLengths[next] = chainLengths[node] + 1
+        inDegree[next]--
+        if inDegree[next] == 0 {
+            queue = append(queue, next)
+        }
+    }
+
+    maxCycle, totalChains := 0, 0
+    for i := 0; i < n; i++ {
+        if !visited[i] {
+            current, cycleLength := i, 0
+            for !visited[current] {
+                visited[current] = true
+                current = favorite[current]
+                cycleLength++
+            }
+
+            if cycleLength == 2 {
+                totalChains += 2 + chainLengths[i] + chainLengths[favorite[i]]
+            } else {
+                if cycleLength > maxCycle {
+                    maxCycle = cycleLength
+                }
+            }
+        }
+    }
+
+    if maxCycle > totalChains {
+        return maxCycle
+    }
+    return totalChains
+}
diff --git a/Algorithms/src/2127. Maximum Employees to Be Invited to a Meeting/Code/solution.java b/Algorithms/src/2127. Maximum Employees to Be Invited to a Meeting/Code/solution.java
@@ -0,0 +1,50 @@
+class Solution {
+    public int maximumInvitations(int[] favorite) {
+        int n = favorite.length;
+        int[] inDegree = new int[n];
+        int[] chainLengths = new int[n];
+        boolean[] visited = new boolean[n];
+
+        for (int fav : favorite) {
+            inDegree[fav]++;
+        }
+
+        Queue<Integer> queue = new LinkedList<>();
+        for (int i = 0; i < n; ++i) {
+            if (inDegree[i] == 0) {
+                queue.offer(i);
+            }
+        }
+
+        while (!queue.isEmpty()) {
+            int node = queue.poll();
+            visited[node] = true;
+
+            int next = favorite[node];
+            chainLengths[next] = chainLengths[node] + 1;
+            if (--inDegree[next] == 0) {
+                queue.offer(next);
+            }
+        }
+
+        int maxCycle = 0, totalChains = 0;
+        for (int i = 0; i < n; ++i) {
+            if (!visited[i]) {
+                int current = i, cycleLength = 0;
+                while (!visited[current]) {
+                    visited[current] = true;
+                    current = favorite[current];
+                    cycleLength++;
+                }
+
+                if (cycleLength == 2) {
+                    totalChains += 2 + chainLengths[i] + chainLengths[favorite[i]];
+                } else {
+                    maxCycle = Math.max(maxCycle, cycleLength);
+                }
+            }
+        }
+
+        return Math.max(maxCycle, totalChains);
+    }
+}
diff --git a/Algorithms/src/2127. Maximum Employees to Be Invited to a Meeting/Code/solution.js b/Algorithms/src/2127. Maximum Employees to Be Invited to a Meeting/Code/solution.js
@@ -0,0 +1,48 @@
+var maximumInvitations = function (favorite) {
+  const n = favorite.length;
+  const inDegree = new Array(n).fill(0);
+  const chainLengths = new Array(n).fill(0);
+  const visited = new Array(n).fill(false);
+
+  favorite.forEach((fav) => inDegree[fav]++);
+
+  const queue = [];
+  for (let i = 0; i < n; i++) {
+    if (inDegree[i] === 0) {
+      queue.push(i);
+    }
+  }
+
+  while (queue.length) {
+    const node = queue.shift();
+    visited[node] = true;
+
+    const next = favorite[node];
+    chainLengths[next] = chainLengths[node] + 1;
+    if (--inDegree[next] === 0) {
+      queue.push(next);
+    }
+  }
+
+  let maxCycle = 0,
+    totalChains = 0;
+  for (let i = 0; i < n; i++) {
+    if (!visited[i]) {
+      let current = i,
+        cycleLength = 0;
+      while (!visited[current]) {
+        visited[current] = true;
+        current = favorite[current];
+        cycleLength++;
+      }
+
+      if (cycleLength === 2) {
+        totalChains += 2 + chainLengths[i] + chainLengths[favorite[i]];
+      } else {
+        maxCycle = Math.max(maxCycle, cycleLength);
+      }
+    }
+  }
+
+  return Math.max(maxCycle, totalChains);
+};
diff --git a/Algorithms/src/2127. Maximum Employees to Be Invited to a Meeting/Code/solution.py b/Algorithms/src/2127. Maximum Employees to Be Invited to a Meeting/Code/solution.py
@@ -0,0 +1,37 @@
+class Solution:
+    def maximumInvitations(self, favorite: List[int]) -> int:
+        n = len(favorite)
+        inDegree = [0] * n
+        chainLengths = [0] * n
+        visited = [False] * n
+
+        for fav in favorite:
+            inDegree[fav] += 1
+
+        queue = deque(i for i in range(n) if inDegree[i] == 0)
+        while queue:
+            node = queue.popleft()
+            visited[node] = True
+
+            next_node = favorite[node]
+            chainLengths[next_node] = chainLengths[node] + 1
+            inDegree[next_node] -= 1
+            if inDegree[next_node] == 0:
+                queue.append(next_node)
+
+        maxCycle = 0
+        totalChains = 0
+        for i in range(n):
+            if not visited[i]:
+                current, cycleLength = i, 0
+                while not visited[current]:
+                    visited[current] = True
+                    current = favorite[current]
+                    cycleLength += 1
+
+                if cycleLength == 2:
+                    totalChains += 2 + chainLengths[i] + chainLengths[favorite[i]]
+                else:
+                    maxCycle = max(maxCycle, cycleLength)
+
+        return max(maxCycle, totalChains)
diff --git a/Algorithms/src/2127. Maximum Employees to Be Invited to a Meeting/Explanation/explanation.md b/Algorithms/src/2127. Maximum Employees to Be Invited to a Meeting/Explanation/explanation.md
diff --git a/README.md b/README.md
