Add solution #1726

Author: JoshCrozier

README.md

@@ -463,6 +463,7 @@
 1672|[Richest Customer Wealth](./1672-richest-customer-wealth.js)|Easy|
 1679|[Max Number of K-Sum Pairs](./1679-max-number-of-k-sum-pairs.js)|Medium|
 1716|[Calculate Money in Leetcode Bank](./1716-calculate-money-in-leetcode-bank.js)|Easy|
+1726|[Tuple with Same Product](./1726-tuple-with-same-product.js)|Medium|
 1732|[Find the Highest Altitude](./1732-find-the-highest-altitude.js)|Easy|
 1748|[Sum of Unique Elements](./1748-sum-of-unique-elements.js)|Easy|
 1752|[Check if Array Is Sorted and Rotated](./1752-check-if-array-is-sorted-and-rotated.js)|Easy|

solutions/1726-tuple-with-same-product.js

@@ -0,0 +1,29 @@
+/**
+ * 1726. Tuple with Same Product
+ * https://leetcode.com/problems/tuple-with-same-product/
+ * Difficulty: Medium
+ *
+ * Given an array nums of distinct positive integers, return the number of tuples (a, b, c, d)
+ * such that a * b = c * d where a, b, c, and d are elements of nums, and a != b != c != d.
+ */
+
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var tupleSameProduct = function(nums) {
+  const map = new Map();
+  let count = 0;
+
+  for (let i = 0; i < nums.length; i++) {
+    for (let j = i + 1; j < nums.length; j++) {
+      map.set(nums[i] * nums[j], map.get(nums[i] * nums[j]) + 1 || 1);
+    }
+  }
+
+  Array.from(map).forEach(([key, value]) => {
+    count += value > 1 ? value * (value - 1) / 2 : 0;
+  });
+
+  return count * 8;
+};