Java program to check the balance of parenthesis

May 2, 2023

Balanced Parenthesis

To check balanced parenthesis is a basic interview question where we are asked to find whether the given string(of brackets) is balanced or not. To do this , the traditional way of doing is using stacks but we can also find by using normal programming techniques. Different brackets are  ( ) , [ ] , { }. Question can be asked on any type of bracket or of all types of brackets.

Balanced Parenthesis in Java

Algorithm :

  • Declare a character stack.
  • Now traverse the expression string exp.
    1. If the current character is a starting bracket (‘(‘ or ‘{‘ or ‘[‘) then push it to stack.
    2. If the current character is a closing bracket (‘)’ or ‘}’ or ‘]’) then pop from stack and if the popped character is the matching starting bracket then fine else brackets are not balanced.
  • After complete traversal, if there is some starting bracket left in stack then “not balanced”
java desk gif
java mob gif

Example Code in Java :

Run

import java.util.*;
public
class Main {
    public
    static boolean balancedParenthesis(String str) {
        Stack stack = new Stack();
        for (int i = 0; i < str.length(); i++) {
            char x = str.charAt(i);
            if (x == '(' || x == '[' || x == '{') {
                stack.push(x);
                continue;
            }
            if (stack.isEmpty()) return false;
            char check;
            switch (x) {
                case ')':
                    check = stack.pop();
                    if (check == '{' || check == '[') return false;
                    break;
                case '}':
                    check = stack.pop();
                    if (check == '(' || check == '[') return false;
                    break;
                case ']':
                    check = stack.pop();
                    if (check == '(' || check == '{') return false;
                    break;
            }
        }
        return (stack.isEmpty());
    }
    public
    static void main(String[] args) {
        String str = "()(())";
        if (balancedParenthesis(str))
            System.out.println("True");
        else
            System.out.println("False");
    }
}

Output :

True

Finding Arrays are disjoint or not

Determine Array is a subset of another array or not

Finding Minimum sum of absolute difference of given array

Sort an array according to the order defined by another array 

Replace each element of the array by its rank in the array

Prime Course Trailer

Related Banners

Get PrepInsta Prime & get Access to all 200+ courses offered by PrepInsta in One Subscription

Get Prime
Java Online Course Banner

Get over 200+ course One Subscription

Courses like AI/ML, Cloud Computing, Ethical Hacking, C, C++, Java, Python, DSA (All Languages), Competitive Coding (All Languages), TCS, Infosys, Wipro, Amazon, DBMS, SQL and others

Get Prime
Course List
Course List

Checkout list of all the video courses in PrepInsta Prime Subscription

Checkout list of all the video courses in PrepInsta Prime Subscription

Checkout
Checkout

One comment on “Java program to check the balance of parenthesis”


  • Gyanendra

    import java.util.*;
    public class Main
    {
    public static void main(String[] args) {
    Scanner scn=new Scanner(System.in);
    String str=”()(())”;
    System.out.println(balance_bracket(str));

    }

    public static boolean balance_bracket(String str){
    Stack st=new Stack();
    st.push(str.charAt(0));
    for(int i=1;i<str.length();i++){
    char ch=str.charAt(i);

    if(ch=='[' || ch=='{' || ch=='('){
    st.push(ch);
    }

    if(ch==')'){
    if(st.peek()=='(')
    st.pop();
    else
    return false;
    }
    else if(ch=='}'){
    if(st.peek()=='{')
    st.pop();
    else
    return false;
    }
    else if(ch==']'){
    if(st.peek()=='[')
    st.pop();
    else
    return false;
    }
    }

    if(st.size()!=0)
    return false;

    return true;
    }

    }