Solution to the problem 1512 vJechsmayr#588

tejasvicsr1 · tejasvicsr1 · commit 4ca12f3288b3 · 2020-10-10T17:29:33.000+05:30
diff --git a/LeetCode/1512_Number_of_Good_Pairs.py b/LeetCode/1512_Number_of_Good_Pairs.py
@@ -0,0 +1,8 @@
+class Solution:
+    def numIdenticalPairs(self, nums: List[int]) -> int:
+        ans = 0
+        for i in range(0, len(nums)):
+            for j in range(0, len(nums)):
+                if(nums[i] == nums[j] and i < j):
+                    ans += 1
+        return ans
