Add solution #1626

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,430 LeetCode solutions in JavaScript
+# 1,431 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1254,6 +1254,7 @@
 1622|[Fancy Sequence](./solutions/1622-fancy-sequence.js)|Hard|
 1624|[Largest Substring Between Two Equal Characters](./solutions/1624-largest-substring-between-two-equal-characters.js)|Easy|
 1625|[Lexicographically Smallest String After Applying Operations](./solutions/1625-lexicographically-smallest-string-after-applying-operations.js)|Medium|
+1626|[Best Team With No Conflicts](./solutions/1626-best-team-with-no-conflicts.js)|Medium|
 1657|[Determine if Two Strings Are Close](./solutions/1657-determine-if-two-strings-are-close.js)|Medium|
 1668|[Maximum Repeating Substring](./solutions/1668-maximum-repeating-substring.js)|Easy|
 1669|[Merge In Between Linked Lists](./solutions/1669-merge-in-between-linked-lists.js)|Medium|

solutions/1626-best-team-with-no-conflicts.js

@@ -0,0 +1,45 @@
+/**
+ * 1626. Best Team With No Conflicts
+ * https://leetcode.com/problems/best-team-with-no-conflicts/
+ * Difficulty: Medium
+ *
+ * You are the manager of a basketball team. For the upcoming tournament, you want to choose the
+ * team with the highest overall score. The score of the team is the sum of scores of all the
+ * players in the team.
+ *
+ * However, the basketball team is not allowed to have conflicts. A conflict exists if a younger
+ * player has a strictly higher score than an older player. A conflict does not occur between
+ * players of the same age.
+ *
+ * Given two lists, scores and ages, where each scores[i] and ages[i] represents the score and
+ * age of the ith player, respectively, return the highest overall score of all possible basketball
+ * teams.
+ */
+
+/**
+ * @param {number[]} scores
+ * @param {number[]} ages
+ * @return {number}
+ */
+var bestTeamScore = function(scores, ages) {
+  const players = ages.map((age, index) => ({ age, score: scores[index] }));
+  players.sort((a, b) => a.age - b.age || a.score - b.score);
+
+  const maxScores = new Array(players.length).fill(0);
+  let highestScore = 0;
+
+  for (let current = 0; current < players.length; current++) {
+    maxScores[current] = players[current].score;
+    for (let previous = 0; previous < current; previous++) {
+      if (players[previous].score <= players[current].score) {
+        maxScores[current] = Math.max(
+          maxScores[current],
+          maxScores[previous] + players[current].score
+        );
+      }
+    }
+    highestScore = Math.max(highestScore, maxScores[current]);
+  }
+
+  return highestScore;
+};