simple and easy Python solution
if it\'s help, please up \u2B06 vote! \u2764\uFE0F\n\n\n###### Let\'s Connect on LinkedIn: www.linkedin.com/in/shishirrsiam\n\n# Code\npython3 []\nclass Solutio
# if it\'s help, please up \u2B06 vote! \u2764\uFE0F\n\n\n###### Let\'s Connect on LinkedIn: www.linkedin.com/in/shishirrsiam\n\n# Code\n```python3 []\nclass Solution:\n    def minSwaps(self, s: str) -> int:\n        count = 0\n        stack = []\n        for ch in s:\n            if ch == \'[\':\n                stack.append(ch)\n            else:\n                if stack:\n                    stack.pop()\n                else:\n                    count += 1\n        return ceil(count / 2)\n```
['Two Pointers', 'String', 'Stack', 'Greedy', 'Python', 'Python3']