Add solution #982

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,064 LeetCode solutions in JavaScript
+# 1,065 LeetCode solutions in JavaScript
 
 [https://leetcode.com/](https://leetcode.com/)
 
@@ -790,6 +790,7 @@
 979|[Distribute Coins in Binary Tree](./solutions/0979-distribute-coins-in-binary-tree.js)|Medium|
 980|[Unique Paths III](./solutions/0980-unique-paths-iii.js)|Hard|
 981|[Time Based Key-Value Store](./solutions/0981-time-based-key-value-store.js)|Medium|
+982|[Triples with Bitwise AND Equal To Zero](./solutions/0982-triples-with-bitwise-and-equal-to-zero.js)|Hard|
 985|[Sum of Even Numbers After Queries](./solutions/0985-sum-of-even-numbers-after-queries.js)|Easy|
 989|[Add to Array-Form of Integer](./solutions/0989-add-to-array-form-of-integer.js)|Easy|
 994|[Rotting Oranges](./solutions/0994-rotting-oranges.js)|Medium|

solutions/0982-triples-with-bitwise-and-equal-to-zero.js

@@ -0,0 +1,39 @@
+/**
+ * 982. Triples with Bitwise AND Equal To Zero
+ * https://leetcode.com/problems/triples-with-bitwise-and-equal-to-zero/
+ * Difficulty: Hard
+ *
+ * Given an integer array nums, return the number of AND triples.
+ *
+ * An AND triple is a triple of indices (i, j, k) such that:
+ * - 0 <= i < nums.length
+ * - 0 <= j < nums.length
+ * - 0 <= k < nums.length
+ * - nums[i] & nums[j] & nums[k] == 0, where & represents the bitwise-AND operator.
+ */
+
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var countTriplets = function(nums) {
+  const map = new Map();
+
+  for (const first of nums) {
+    for (const second of nums) {
+      const pairAnd = first & second;
+      map.set(pairAnd, (map.get(pairAnd) || 0) + 1);
+    }
+  }
+
+  let result = 0;
+  for (const third of nums) {
+    for (const [pair, count] of map) {
+      if ((pair & third) === 0) {
+        result += count;
+      }
+    }
+  }
+
+  return result;
+};