Balanced Parentheses Checker

Objective: Write a Java program that checks if a string of parentheses and brackets $((),\{\},[])$ is balanced. A balanced string has every opening bracket correctly matched with a corresponding closing bracket.

Setting Up:

Start by creating a Java program with a main method.

Prompt the user to enter a string of parentheses and brackets.

Using a Stack:

Initialize an empty Stack to keep track of opening brackets.

Loop through each character in the input string:

If the character is an opening bracket $((,\{,[),$ push it onto the Stack.

If the character is a closing bracket $(),\},])$:

Check if the Stack is empty. If it is$,$ the string is unbalanced $($no opening bracket for this closing bracket$).$

Otherwise, pop the top element from the Stack and check if it matches the type of closing bracket. If they don$$t match, the string is unbalanced.

Final Check:

After processing all characters, if the Stack is empty, the string is balanced. If it$$s not empty, it means there are unmatched opening brackets.

Output the Result:

Display a message indicating whether the string is balanced or not.

Example:

For input $(\{[()]\}),$ your program should output: "The string is balanced."

For input $[\{(()\}]),$ it should output: "The string is not balanced."

Tips:

Use push, pop, and isEmpty methods of the Stack.

Write a helper function, like isMatchingPair$($char open, char close$),$ to simplify bracket matching.

Submission Requirements:

$1.$ Your $.$java source code file.

$2.$ A short document $($maximum length of half a page$)$ to describe your implemented algorithm and how the Stack data strucutre helped solve the problem.

Objective: Write a Java program that checks if a string of parentheses and brackets $((),\{\},[])$ is balanced. A balanced string has every opening bracket correctly matched with a corresponding closing bracket.

Setting Up:

Start by creating a Java program with a main method.Prompt the user to enter a string of parentheses and brackets.

Using a Stack:

Initialize an empty Stack to keep track of opening brackets.Loop through each character in the input string:

If the character is an opening bracket $((,\{,[),$ push it onto the Stack.If the character is a closing bracket $(),\},])$:

Check if the Stack is empty. If it is$,$ the string is unbalanced $($no opening bracket for this closing bracket$).$Otherwise, pop the top element from the Stack and check if it matches the type of closing bracket. If they don$$t match, the string is unbalanced.

Final Check:

After processing all characters, if the Stack is empty, the string is balanced. If it$$s not empty, it means there are unmatched opening brackets.

Output the Result:

Display a message indicating whether the string is balanced or not.

Example:

For input $(\{[()]\}),$ your program should output: "The string is balanced."For input $[\{(()\}]),$ it should output: "The string is not balanced."

Tips:

Use push, pop, and isEmpty methods of the Stack.Write a helper function, like isMatchingPair$($char open, char close$),$ to simplify bracket matching.

Submission Requirements:$$

$1.$ Your $.$java source code file.$$

$2.$ A short document $($maximum length of half a page$)$ to describe your implemented algorithm and how the Stack data strucutre helped solve the problem.