Problem: Find the Number of Winning Players

Problem Statement:

We are given a 2D array pick where:

• The first column represents the ball number.
• The second column represents the color of the ball.

The task is to return the count of balls that satisfy the following condition:

• For a particular ball number in the first column, it should be less than the count of balls with the same color as indicated by the second column.

---

Approach:

Step 1: Sorting the Array

• Sort by Ball Number (First Column):
  First, sort the array based on the first column (ball number) in ascending order.

• Sort by Ball Color (Second Column):
  Without altering the first column, sort the array again based on the second column (ball color) in ascending order.

Step 2: Initial Setup

• Base Condition for Ball Number 0:
  • If ball number 0 is present in the array, it automatically satisfies the condition. In this case, increment the count by one.
  • Set prev1 to 0 (representing the ball number) and prev2 to the color of the ball in the last occurrence of ball number 0.
  • Increment the pointer to point to the ball number next to 0.

Step 3: Iterative Process

• Pointer Initialization:

  • If the base condition is not met, point to the second row with a pointer ti, and assign the current count of balls with the same color as the ti-th ball number to ccount.
  • Set prev1 and prev2 to the first and second column values of the 0th row, respectively.

• Loop through the Array:

  • Iterate through the array using the ti pointer.

  • Skipping Unnecessary Iterations:

    • If pick[i][0] - ccount > (pick.size() - i) - 1, skip the rest of the loop. This condition checks if the current ball number is greater than the number of remaining rows in the array.

Step 4: Updating the Count

• Check Matching Condition:

  • If the current ball number (pick[i][0]) and ball color (pick[i][1]) match prev1 and prev2, respectively, increment the current count (ccount).

• Final Condition:

  • If ccount == pick[i][1] + 1, increment the final count.

Step 5: Reset Counters

• If the current ball number or color does not match prev1 or prev2, update prev1 to the current ball number, prev2 to the current ball color, and reset ccount to 1.

Step 6: Final Step

• After iterating through the entire array, return the final count of balls that satisfy the condition.

---

Example Walkthrough

Example 1:

Input:

pick = [
  [0, 3],
  [1, 3],
  [2, 4],
  [3, 2],
  [4, 2]
]

```Output:

1```