Sync LeetCode submission Runtime - 0 ms (100.00%), Memory - 9.8 MB (22.81%)

Author: koralkulacoglu

LeetCode/1635-number-of-good-pairs/README.md

@@ -0,0 +1,35 @@
+<p>Given an array of integers <code>nums</code>, return <em>the number of <strong>good pairs</strong></em>.</p>
+
+<p>A pair <code>(i, j)</code> is called <em>good</em> if <code>nums[i] == nums[j]</code> and <code>i</code> &lt; <code>j</code>.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [1,2,3,1,1,3]
+<strong>Output:</strong> 4
+<strong>Explanation:</strong> There are 4 good pairs (0,3), (0,4), (3,4), (2,5) 0-indexed.
+</pre>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [1,1,1,1]
+<strong>Output:</strong> 6
+<strong>Explanation:</strong> Each pair in the array are <em>good</em>.
+</pre>
+
+<p><strong class="example">Example 3:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [1,2,3]
+<strong>Output:</strong> 0
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= nums.length &lt;= 100</code></li>
+	<li><code>1 &lt;= nums[i] &lt;= 100</code></li>
+</ul>

LeetCode/1635-number-of-good-pairs/solution.cpp

@@ -0,0 +1,13 @@
+class Solution {
+public:
+    int numIdenticalPairs(vector<int>& nums) {
+        int n = nums.size();
+        vector<int> freq(101, 0);
+        int ans = 0;
+        for (int num : nums) {
+            ans += freq[num];
+            freq[num]++;
+        }
+        return ans;
+    }
+};