Add solution #1512

Author: JoshCrozier

1512-number-of-good-pairs.js

@@ -0,0 +1,18 @@
+/**
+ * 1512. Number of Good Pairs
+ * https://leetcode.com/problems/number-of-good-pairs/
+ * Difficulty: Easy
+ *
+ * Given an array of integers nums, return the number of good pairs.
+ *
+ * A pair (i, j) is called good if nums[i] == nums[j] and i < j.
+ */
+
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var numIdenticalPairs = function(nums) {
+  const map = new Array(101).fill(0);
+  return nums.reduce((sum, n) => sum += map[n]++, 0);
+};

README.md

@@ -234,6 +234,7 @@
 1496|[Path Crossing](./1496-path-crossing.js)|Easy|
 1502|[Can Make Arithmetic Progression From Sequence](./1502-can-make-arithmetic-progression-from-sequence.js)|Easy|
 1507|[Reformat Date](./1507-reformat-date.js)|Easy|
+1512|[Number of Good Pairs](./1512-number-of-good-pairs.js)|Easy|
 1550|[Three Consecutive Odds](./1550-three-consecutive-odds.js)|Easy|
 1551|[Minimum Operations to Make Array Equal](./1551-minimum-operations-to-make-array-equal.js)|Medium|
 1566|[Detect Pattern of Length M Repeated K or More Times](./1566-detect-pattern-of-length-m-repeated-k-or-more-times.js)|Easy|