Sync LeetCode submission Runtime - 71 ms (83.57%), Memory - 34.1 MB (28.45%)

Author: jimit105

2497-maximum-matching-of-players-with-trainers/README.md

@@ -0,0 +1,39 @@
+<p>You are given a <strong>0-indexed</strong> integer array <code>players</code>, where <code>players[i]</code> represents the <strong>ability</strong> of the <code>i<sup>th</sup></code> player. You are also given a <strong>0-indexed</strong> integer array <code>trainers</code>, where <code>trainers[j]</code> represents the <strong>training capacity </strong>of the <code>j<sup>th</sup></code> trainer.</p>
+
+<p>The <code>i<sup>th</sup></code> player can <strong>match</strong> with the <code>j<sup>th</sup></code> trainer if the player&#39;s ability is <strong>less than or equal to</strong> the trainer&#39;s training capacity. Additionally, the <code>i<sup>th</sup></code> player can be matched with at most one trainer, and the <code>j<sup>th</sup></code> trainer can be matched with at most one player.</p>
+
+<p>Return <em>the <strong>maximum</strong> number of matchings between </em><code>players</code><em> and </em><code>trainers</code><em> that satisfy these conditions.</em></p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> players = [4,7,9], trainers = [8,2,5,8]
+<strong>Output:</strong> 2
+<strong>Explanation:</strong>
+One of the ways we can form two matchings is as follows:
+- players[0] can be matched with trainers[0] since 4 &lt;= 8.
+- players[1] can be matched with trainers[3] since 7 &lt;= 8.
+It can be proven that 2 is the maximum number of matchings that can be formed.
+</pre>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> players = [1,1,1], trainers = [10]
+<strong>Output:</strong> 1
+<strong>Explanation:</strong>
+The trainer can be matched with any of the 3 players.
+Each player can only be matched with one trainer, so the maximum answer is 1.
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= players.length, trainers.length &lt;= 10<sup>5</sup></code></li>
+	<li><code>1 &lt;= players[i], trainers[j] &lt;= 10<sup>9</sup></code></li>
+</ul>
+
+<p>&nbsp;</p>
+<p><strong>Note:</strong> This question is the same as <a href="https://leetcode.com/problems/assign-cookies/description/" target="_blank"> 445: Assign Cookies.</a></p>

2497-maximum-matching-of-players-with-trainers/solution.py

@@ -0,0 +1,23 @@
+# Approach: Sorting + Two Pointers + Greedy
+
+# m = len(players), n = len(trainers)
+# Time: O(m log m + n log n)
+# Space: O(log m + log n)
+
+class Solution:
+    def matchPlayersAndTrainers(self, players: List[int], trainers: List[int]) -> int:
+        players.sort()
+        trainers.sort()
+        m, n = len(players), len(trainers)
+        i = j = count = 0
+
+        while i < m and j < n:
+            while j < n and players[i] > trainers[j]:
+                j += 1
+            if j < n:
+                count += 1
+            i += 1
+            j += 1
+
+        return count
+