Create 1963-minimum-number-of-swaps-to-make-the-string-balanced.py

Create the Python solution as the same solution in the YouTube video "https://www.youtube.com/watch?v=3YDBT9ZrfaU"

Author: MHamiid

python/1963-minimum-number-of-swaps-to-make-the-string-balanced.py

@@ -0,0 +1,13 @@
+class Solution:
+    def minSwaps(self, s: str) -> int:
+        extraClose, maxClose = 0, 0
+
+        for c in s:
+            if c == "[":
+                extraClose -= 1
+            else:
+                extraClose += 1
+
+            maxClose = max(maxClose, extraClose)
+
+        return (maxClose + 1) // 2  # Or math.ceil(maxClose / 2)