Sync LeetCode submission Runtime - 66 ms (84.05%), Memory - 38.8 MB (59.29%)

Author: jimit105

2448-count-number-of-bad-pairs/README.md

@@ -0,0 +1,33 @@
+<p>You are given a <strong>0-indexed</strong> integer array <code>nums</code>. A pair of indices <code>(i, j)</code> is a <strong>bad pair</strong> if <code>i &lt; j</code> and <code>j - i != nums[j] - nums[i]</code>.</p>
+
+<p>Return<em> the total number of <strong>bad pairs</strong> in </em><code>nums</code>.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [4,1,3,3]
+<strong>Output:</strong> 5
+<strong>Explanation:</strong> The pair (0, 1) is a bad pair since 1 - 0 != 1 - 4.
+The pair (0, 2) is a bad pair since 2 - 0 != 3 - 4, 2 != -1.
+The pair (0, 3) is a bad pair since 3 - 0 != 3 - 4, 3 != -1.
+The pair (1, 2) is a bad pair since 2 - 1 != 3 - 1, 1 != 2.
+The pair (2, 3) is a bad pair since 3 - 2 != 3 - 3, 1 != 0.
+There are a total of 5 bad pairs, so we return 5.
+</pre>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [1,2,3,4,5]
+<strong>Output:</strong> 0
+<strong>Explanation:</strong> There are no bad pairs.
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= nums.length &lt;= 10<sup>5</sup></code></li>
+	<li><code>1 &lt;= nums[i] &lt;= 10<sup>9</sup></code></li>
+</ul>

2448-count-number-of-bad-pairs/solution.py

@@ -0,0 +1,21 @@
+# Approach: Hash Map
+
+# Time: O(n)
+# Space: O(n)
+
+class Solution:
+    def countBadPairs(self, nums: List[int]) -> int:
+        bad_pairs = 0
+        diff_count = {}
+
+        for pos in range(len(nums)):
+            diff = pos - nums[pos]
+
+            good_pairs_count = diff_count.get(diff, 0)
+
+            bad_pairs += pos - good_pairs_count
+
+            diff_count[diff] = good_pairs_count + 1
+
+        return bad_pairs
+