Implemented Minimum Swaps to Balance Bracket String

[vineet28sept]

This pull request introduces a solution to the problem of determining the minimum number of swaps required to balance a string of brackets. The solution efficiently counts unmatched opening and closing brackets and calculates the required swaps based on these counts.

🚀 What does this PR do?

• Adds solution for LeetCode Daily Challenge on (Day and Date) in (Programming Language).
• Briefly explain the approach taken to solve the problem.

📝 Issue Reference:

Fixes issue: # (Mention the issue number this PR solves)

🔍 Checklist:

Please ensure the following before submitting your PR:

• [x] I have placed my solution in the correct folder (solutions/dayXX/).
• [x] My code follows clean coding practices and is efficient.
• [x] I have added comments in my code to explain the approach.
• [x] I have updated the README.md for the specific day with a brief explanation of my solution.
• [x] I have tested the solution on LeetCode and it works correctly.

🔧 Solution Details:

• Language Used: (e.g., Python, Java, C++, etc.)
• Time Complexity: (e.g., O(n log n), O(n), etc.)
• Space Complexity: (e.g., O(1), O(n), etc.)

🌟 Additional Notes (if any):