Challenge

Problem

Solutions

Submissions

Minimum Number of Swaps to Make the String Balanced

Challenge Points: 20

Level: Medium

You are given a string s of even length, made up of equal numbers of [ and ].
The goal is to make the string balanced, meaning it follows valid bracket pairing rules.

You are allowed to swap any two characters in the string.
Your task is to determine the minimum number of swaps needed to make the entire string balanced.

A string is considered balanced if:

It is empty, or
It can be formed by joining two balanced strings, or
It can be formed by placing a balanced string inside brackets like this: [ C ].

Example 1:

Input: s = "[]][[]"

Output: 1

Explanation:

Only one swap is required to correct the imbalance.

Example 2:

Input: s = "[][][][]"

Output: 0

Explanation:

Already balanced; no swaps required.

Example 3:

Input: s = "][[]"

Output: 1

Explanation:

Swap positions 0 and 1 → "[][]" which is balanced.

to Continue

Accepted:

Submission:

Report an issue

Code

You need toto run or submitYou need toto run or submit

Test Case

Test Result