1626. Best Team With No Conflicts

Problem Description

In this problem, you are playing the role of a manager who is forming a basketball team for a tournament. The primary goal is to assemble a team with the highest possible aggregate score. The overall score of a team is calculated by adding up the individual scores of all the players on the team. However, assembling the team comes with a constraint to avoid conflicts. A conflict is defined as a situation where a younger player has a higher score than an older player. If two players have the same age, then there is no conflict regardless of their scores.

You are provided with two lists: scores and ages. The scores list contains the score for each player, while the ages list contains ages of the players. The indices of the two lists correspond, meaning scores[i] and ages[i] represent the score and age of the same player.

The task is to find the highest team score possible without any conflicts arising from the age and score constraints when picking team members.

Intuition

To solve the problem of assembling a conflict-free team with the maximum possible score, we can leverage a variation of the classic Dynamic Programming (DP) approach known as the Longest Increasing Subsequence (LIS). The LIS typically aims to find the longest increasing subsequence within a sequence of numbers.

However, in this scenario, because we need to respect both the age and the scores of players, and since we cannot have a younger player with a higher score than an older player, the players must be sorted in a way that respects both conditions. We sort the players by age and then by score when the ages are identical.

Once the players are sorted, we can then use a data structure called a Binary Indexed Tree (BIT) or Fenwick Tree to efficiently calculate the final solution. BIT is usually used for range queries and updates in log(n) time, but in this scenario, it is used to find the maximum cumulative score while updating age-score pairs.

The core idea of the solution code is to iterate through each player, as sorted by age, and at each step, update their respective position in the BIT with their score plus the maximum score obtained from all players of a lesser or equal age. The update operation in the BIT involves setting the current index with the maximum of its current value and the new cumulative score. The query operation retrieves the maximum cumulative score up until the given index.

This will result in the BIT reflecting the maximum cumulative scores obtainable up until each age, ensuring no age-based conflicts. The final answer is obtained by querying the maximum cumulative score from the BIT which reflects the maximum overall score for the entire team.

Learn more about Dynamic Programming and Sorting patterns.

Solution Approach

The solution uses a Binary Indexed Tree (BIT), which is a data structure that helps with range sum queries and updates in logarithmic time. It allows us to efficiently keep track of the maximum score we can achieve up to a certain age without having to compare each player with every other player.

The approach requires sorting the players first. This sorting is not just by age or score, but it's a composite sort: primarily by age, and secondarily by score within the same age group. This ensures that whenever we are processing a player, all potential team members that won't cause conflicts due to age have already been considered.

The BinaryIndexedTree class provides two main methods: update and query. The update method is used to update the BIT with the maximum score for a given age while the query method is used to retrieve the maximum score up to a certain age.

Here's a step-by-step breakdown of the implementation steps:

Create an instance of the BinaryIndexedTree class, called tree, with a size that is equal to the maximum age of the players.
Sort the players by their ages and scores as explained before.
Iterate through each player in the sorted order and perform the following actions:
- Query the current maximum score we can get with a team of the current player's age or younger using tree.query(age).
- Calculate the new score by adding the current player's score to this queried score.
- Update the BIT at the index corresponding to the player's age with the new score if it's greater than what's currently stored there.

The final maximum team score is found by querying the BIT for the maximum cumulative score after we have iterated through all players.

Each update and query operation in the BIT runs in O(log(m)), where m is the maximum age. Since each player is processed exactly once, and assuming that sorting the players takes O(n log n), where n is the number of players, the total time complexity of the solution is O(n log n + n log(m)).

The usage of BIT in this problem is akin to the dynamic programming approach for calculating LIS, except that it's optimized with a tree structure for faster updates and queries. The overall method finds an optimized subset of players that adheres to the non-conflict criteria and sums up to the largest possible team score.

Ready to land your dream job?

Unlock your dream job with a 2-minute evaluator for a personalized learning plan!

Start Evaluator

Example Walkthrough

Let's walk through the solution approach with a small example:

Suppose we are given two lists as input:

scores = [4, 3, 5, 7, 2]
ages = [23, 24, 22, 22, 25]

The objective is to create a team with maximum total score without any conflicts regarding the ages and scores.

Sort Players: The first step is to sort the players by their ages, and scores if the ages are equal. After sorting, our lists will look like:
- Ages Sorted: ages = [22, 22, 23, 24, 25]
- Scores Sorted with Ages: scores = [5, 7, 4, 3, 2]
Binary Indexed Tree (BIT) Initialization: We initialize a BIT based on the maximum age which is 25. This means that the BIT will have indices ranging from 1 to 25 (the value at index 0 is not used).
Iterate and Update BIT: The third step is to iterate over the sorted players and use their scores to update the BIT.
- For the player with age 22 and score 5, the tree does not have any score yet, so we update index 22 with 5.
- For the next player with age 22 and score 7, we query the BIT at index 22, which is 5, add the player's score to get 12, and update the BIT at index 22 with 12 because it's higher than the existing score.
- For the player with age 23, we query BIT at index 23. As there are no players with age 23 or less with scores in the BIT, the maximum score is zero, so we add this player's score to 0, getting 4, and update the tree at index 23 with 4.
- For the player with age 24, we query the BIT for the maximum score at index 24, which would be the maximum we updated for age 22 or 23, which is 12. We add the current player's score to 12, getting 15, and update the BIT at index 24 if 15 is higher than what's already there.
- For the last player with age 25, the process is the same, fetching the maximum score up to age 25 (which is still 15), adding the player's score of 2 to get 17, and updating the BIT with 17 at index 25.
Retrieve Maximum Score: The final maximum score is the maximum value in the BIT at the end of processing, which is 17 at index 25.

Throughout the process, we have ensured no conflicts arose due to age, as all updates to a certain age index only consider scores from the same age or younger. The running time for this process is efficient because each update and query on the BIT happens in logarithmic time and we update each player exactly once.

Solution Implementation

1class BinaryIndexedTree:
2    # Initialize the BinaryIndexedTree with a given size.
3    def __init__(self, size):
4        self.size = size
5        self.tree = [0] * (size + 1)
6
7    # Update the BinaryIndexedTree by setting the value at index x to the maximum of the current value and val.
8    # Progress upward through the tree by jumping from one index to another by utilizing the least significant bit (LSB).
9    def update(self, index, val):
10        while index <= self.size:
11            self.tree[index] = max(self.tree[index], val)
12            index += index & -index
13
14    # Query the maximum value in the BinaryIndexedTree from index 1 to x.
15    # Start at index x and move downward through the tree by subtracting the least significant bit (LSB).
16    def query(self, index):
17        max_val = 0
18        while index > 0:
19            max_val = max(max_val, self.tree[index])
20            index -= index & -index
21        return max_val
22
23
24class Solution:
25    # Calculate the best team score given the scores and ages of the players.
26    # The function sorts the players by their scores and ages, then utilizes a BinaryIndexedTree to find the optimal score.
27    def bestTeamScore(self, scores: List[int], ages: List[int]) -> int:
28        max_age = max(ages)  # Find the maximum age.
29        tree = BinaryIndexedTree(max_age)
30
31        # Pair each player's score with their age, and sort the list of pairs.
32        player_info = sorted(zip(scores, ages))
33      
34        # Iterate over the sorted player_info.
35        for score, age in player_info:
36            # Update the BinaryIndexedTree:
37            # for each player, find the best previous score including players with equal or lesser age
38            # and update the tree with the new score if it's higher.
39            tree.update(age, score + tree.query(age))
40      
41        # Query the BinaryIndexedTree for the maximum score possible with the given conditions.
42        return tree.query(max_age)
43```
44
45Please note, the type hint `List[int]` should be imported from the `typing` module for the code to work correctly. You can add the following import statement at the beginning of the code:
46
47```python
48from typing import List
49

1class BinaryIndexedTree {
2    private int size; // The number of elements
3    private int[] tree; // Binary Indexed Tree array
4
5    // Constructor to initialize the tree array based on the given size
6    public BinaryIndexedTree(int size) {
7        this.size = size;
8        this.tree = new int[size + 1];
9    }
10
11    // Update the tree with a given value at a specified index
12    public void update(int index, int value) {
13        while (index <= size) {
14            // Store the maximum value for the current index
15            tree[index] = Math.max(tree[index], value);
16            // Move to the next index to update the tree
17            index += index & -index;
18        }
19    }
20
21    // Query the tree for the maximum value up to a given index
22    public int query(int index) {
23        int max = 0; // Initialize the maximum value
24        while (index > 0) {
25            // Compare and get the maximum value encountered
26            max = Math.max(max, tree[index]);
27            // Move to the previous index to continue the query
28            index -= index & -index;
29        }
30        return max; // Return the maximum value found
31    }
32}
33
34class Solution {
35    public int bestTeamScore(int[] scores, int[] ages) {
36        int playerCount = ages.length; // Number of players
37        // Array to store the pairs of score and age
38        int[][] playerInfo = new int[playerCount][2];
39        for (int i = 0; i < playerCount; ++i) {
40            playerInfo[i] = new int[] {scores[i], ages[i]};
41        }
42        // Sort the player information based on scores, and then by age if scores are the same
43        Arrays.sort(playerInfo, (a, b) -> a[0] == b[0] ? a[1] - b[1] : a[0] - b[0]);
44      
45        int maxAge = 0; // Variable to store the maximum age
46        // Find the maximum age among all players
47        for (int age : ages) {
48            maxAge = Math.max(maxAge, age);
49        }
50        // Initialize the Binary Indexed Tree with the maximum age
51        BinaryIndexedTree tree = new BinaryIndexedTree(maxAge);
52        // Fill the tree with the scores using the ages as indices
53        for (int[] player : playerInfo) {
54            int age = player[1];
55            int score = player[0];
56            // Update the tree: maximum score for the age considering the current score and previous scores
57            tree.update(age, score + tree.query(age));
58        }
59        // Query the tree to find the best team score
60        return tree.query(maxAge);
61    }
62}
63

1#include <vector>
2#include <algorithm>
3
4using namespace std;
5
6// BinaryIndexedTree (Fenwick Tree) class for efficient updates and queries on prefix maximums.
7class BinaryIndexedTree {
8public:
9    // Constructor initializes the tree with given size.
10    explicit BinaryIndexedTree(int size)
11        : size(size),
12        tree(size + 1) {}
13
14    // Update method to set the maximum value at a specific position.
15    void update(int index, int value) {
16        while (index <= size) {
17            // Assign the maximum value at the current index.
18            tree[index] = max(tree[index], value);
19            // Move to the next index to update.
20            index += index & -index;
21        }
22    }
23
24    // Query method to find the maximum value up to a specific position.
25    int query(int index) {
26        int maximumValue = 0;
27        while (index > 0) {
28            // Get the maximum value encountered so far.
29            maximumValue = max(maximumValue, tree[index]);
30            // Move to the previous index to continue the query.
31            index -= index & -index;
32        }
33        return maximumValue;
34    }
35
36private:
37    int size; // The size of the tree.
38    vector<int> tree; // The underlying container for the tree.
39};
40
41// Solution class to solve the problem.
42class Solution {
43public:
44    // Method to calculate the best team score given players' scores and ages.
45    int bestTeamScore(vector<int>& scores, vector<int>& ages) {
46        int n = ages.size(); // Number of players.
47        // Create a vector to store players' scores and ages together.
48        vector<pair<int, int>> players(n);
49        for (int i = 0; i < n; ++i) {
50            players[i] = {scores[i], ages[i]};
51        }
52        // Sort the players primarily by score and secondarily by age.
53        sort(players.begin(), players.end());
54        // Find the maximum age among all players.
55        int maxAge = *max_element(ages.begin(), ages.end());
56        // Create a Binary Indexed Tree with the maximum age as size.
57        BinaryIndexedTree tree(maxAge);
58        // Iterating over each player to populate the tree.
59        for (auto& [score, age] : players) {
60            // Update the tree by adding the player's score to the maximum score of the previous age.
61            tree.update(age, score + tree.query(age));
62        }
63        // Query the tree for the maximum score up to the maximum age.
64        return tree.query(maxAge);
65    }
66};
67

1function bestTeamScore(scores: number[], ages: number[]): number {
2    // Combine ages and scores into a single array of tuples
3    const ageScorePairs = ages.map((age, index) => [age, scores[index]]);
4  
5    // Sort the array of tuples by age, and then by score if ages are equal
6    ageScorePairs.sort((a, b) => (a[0] === b[0] ? a[1] - b[1] : a[0] - b[0]));
7  
8    const teamSize = ageScorePairs.length;
9    // Initialize an array to store the maximum score at each index
10    const dp = new Array(teamSize).fill(0);
11
12    // Iterate over the sorted age-scores pairs
13    for (let i = 0; i < teamSize; ++i) {
14        // Compare with each previous player
15        for (let j = 0; j < i; ++j) {
16            // If the current player's score is greater or equal,
17            // update the dp array with the maximum score found so far
18            if (ageScorePairs[i][1] >= ageScorePairs[j][1]) {
19                dp[i] = Math.max(dp[i], dp[j]);
20            }
21        }
22        // Add the current player's score to the maximum score at the current index
23        dp[i] += ageScorePairs[i][1];
24    }
25  
26    // Return the maximum score from the dp array
27    return Math.max(...dp);
28}
29

Time and Space Complexity

Time Complexity:

The time complexity of the bestTeamScore function is determined by the iteration over the sorted list of player scores and ages, and operations using the Binary Indexed Tree (BIT).

Sorting the zip(scores, ages), which has a time complexity of O(N log N) where N is the number of players.
Iterating over the sorted list and performing update and query operations on the BIT for each player. Both update and query methods consist of a while loop that performs at most log M operations, where M is the maximum age. Because each player invokes one update and one query operation, the total number of operations is N * log M.

Combining these two steps, the overall time complexity is O(N log N) + O(N log M). Since the age can be considered constant for this question, it simplifies to O(N log N).

Space Complexity:

The space complexity is determined by the space needed to store the BIT and the space required for sorting.

The Binary Indexed Tree occupies a space of O(M) where M is the maximum age.
Sorting requires a space of O(N) to store the sorted pairs.

While sorting contributes O(N), the BIT contributes O(M), so the overall space complexity is O(N + M) where N is the number of players and M is the maximum possible age.

Learn more about how to find time and space complexity quickly using problem constraints.

Discover Your Strengths and Weaknesses: Take Our 2-Minute Quiz to Tailor Your Study Plan:

Question 1 out of 10

What's the output of running the following function using input 56?

1KEYBOARD = {
2    '2': 'abc',
3    '3': 'def',
4    '4': 'ghi',
5    '5': 'jkl',
6    '6': 'mno',
7    '7': 'pqrs',
8    '8': 'tuv',
9    '9': 'wxyz',
10}
11
12def letter_combinations_of_phone_number(digits):
13    def dfs(path, res):
14        if len(path) == len(digits):
15            res.append(''.join(path))
16            return
17
18        next_number = digits[len(path)]
19        for letter in KEYBOARD[next_number]:
20            path.append(letter)
21            dfs(path, res)
22            path.pop()
23
24    res = []
25    dfs([], res)
26    return res
27

1private static final Map<Character, char[]> KEYBOARD = Map.of(
2    '2', "abc".toCharArray(),
3    '3', "def".toCharArray(),
4    '4', "ghi".toCharArray(),
5    '5', "jkl".toCharArray(),
6    '6', "mno".toCharArray(),
7    '7', "pqrs".toCharArray(),
8    '8', "tuv".toCharArray(),
9    '9', "wxyz".toCharArray()
10);
11
12public static List<String> letterCombinationsOfPhoneNumber(String digits) {
13    List<String> res = new ArrayList<>();
14    dfs(new StringBuilder(), res, digits.toCharArray());
15    return res;
16}
17
18private static void dfs(StringBuilder path, List<String> res, char[] digits) {
19    if (path.length() == digits.length) {
20        res.add(path.toString());
21        return;
22    }
23    char next_digit = digits[path.length()];
24    for (char letter : KEYBOARD.get(next_digit)) {
25        path.append(letter);
26        dfs(path, res, digits);
27        path.deleteCharAt(path.length() - 1);
28    }
29}
30

1const KEYBOARD = {
2    '2': 'abc',
3    '3': 'def',
4    '4': 'ghi',
5    '5': 'jkl',
6    '6': 'mno',
7    '7': 'pqrs',
8    '8': 'tuv',
9    '9': 'wxyz',
10}
11
12function letter_combinations_of_phone_number(digits) {
13    let res = [];
14    dfs(digits, [], res);
15    return res;
16}
17
18function dfs(digits, path, res) {
19    if (path.length === digits.length) {
20        res.push(path.join(''));
21        return;
22    }
23    let next_number = digits.charAt(path.length);
24    for (let letter of KEYBOARD[next_number]) {
25        path.push(letter);
26        dfs(digits, path, res);
27        path.pop();
28    }
29}
30

["jk", "mno"]

["jm", "kn", "lo"]

["jklmnp"]

["jm","jn","jo","km","kn","ko","lm","ln","lo"]

I don’t know