Java: Minimum Swaps for Bracket Balancing

Problem Statement:

You are given a string of 2N characters consisting of N ‘[‘ brackets and N ‘]’ brackets. A string is

considered balanced if it can be represented in the form S2[S1] where S1 and S2 are balanced

strings. We can make an unbalanced string balanced by swapping adjacent characters. Calculate

the minimum number of swaps necessary to make a string balanced.

Example

Input:

[]][][

Output:

2
First swap: Position 3 and 4
[][]][
Second swap: Position 5 and 6
[][][]