diff --git a/buggy.py b/buggy.py
--- a/buggy.py
+++ b/buggy.py
@@ -5,16 +5,18 @@
 import bisect
 import itertools
 import functools
+
+
 class Solution:
     def numOfPairs(self, nums: List[str], target: str) -> int:
         d = defaultdict(int)
         for char in nums:
             d[char] += 1
-            
+
         arr = []
         for char in target:
             arr.append(char)
-        
+
         pairs = 0
         num = ""
         while len(arr) > 1:
@@ -24,9 +26,12 @@
                 continue
 
             c1 = d[num[::-1]]
-            d[num[::-1]] -= 1 #reduce the count as we dont want to count it again if the other part is also same.
-            var c2 = d[findNum]
-            d[num[::-1]] += 1 # make the count again same.
+            d[num[::-1]] -= (
+                1  # reduce the count as we dont want to count it again if the other part is also same.
+            )
+
+            c2 = d[findNum]
+            d[num[::-1]] += 1  # make the count again same.
 
             pairs += c1 * c2
         return pairs
