Add solution #1996

Author: JoshCrozier

README.md

@@ -213,6 +213,7 @@
 1880|[Check if Word Equals Summation of Two Words](./1880-check-if-word-equals-summation-of-two-words.js)|Easy|
 1929|[Concatenation of Array](./1929-concatenation-of-array.js)|Easy|
 1935|[Maximum Number of Words You Can Type](./1935-maximum-number-of-words-you-can-type.js)|Easy|
+1996|[The Number of Weak Characters in the Game](./1996-the-number-of-weak-characters-in-the-game.js)|Medium|
 2000|[Reverse Prefix of Word](./2000-reverse-prefix-of-word.js)|Easy|
 2011|[Final Value of Variable After Performing Operations](./2011-final-value-of-variable-after-performing-operations.js)|Easy|
 2016|[Maximum Difference Between Increasing Elements](./2016-maximum-difference-between-increasing-elements.js)|Easy|

solutions/1996-the-number-of-weak-characters-in-the-game.js

@@ -0,0 +1,35 @@
+/**
+ * 1996. The Number of Weak Characters in the Game
+ * https://leetcode.com/problems/the-number-of-weak-characters-in-the-game/
+ * Difficulty: Medium
+ *
+ * You are playing a game that contains multiple characters, and each of the
+ * characters has two main properties: attack and defense. You are given a 2D
+ * integer array properties where properties[i] = [attacki, defensei] represents
+ * the properties of the ith character in the game.
+ *
+ * A character is said to be weak if any other character has both attack and
+ * defense levels strictly greater than this character's attack and defense levels.
+ * More formally, a character i is said to be weak if there exists another character
+ * j where attackj > attacki and defensej > defensei.
+ *
+ * Return the number of weak characters.
+ */
+
+/**
+ * @param {number[][]} properties
+ * @return {number}
+ */
+var numberOfWeakCharacters = function(properties) {
+  let result = 0;
+  let max = 0;
+
+  properties.sort((a, b) => (b[0] === a[0]) ? a[1] - b[1] : b[0] - a[0]);
+
+  for (let i = 0; i < properties.length; i++) {
+    if (properties[i][1] < max) result++;
+    max = Math.max(max, properties[i][1]);
+  }
+
+  return result;
+};