Home > AI > Data Structure > Stack >

(HackerRank) Balanced Brackets

https://www.hackerrank.com/challenges/balanced-brackets/problem

Solution (Java)

import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.regex.*;

public class Solution {

    // Complete the isBalanced function below.
    static String isBalanced(String s) {
        Stack<Character> st = new Stack();

        for (int i=0; i<s.length(); i++) {
            char c = s.charAt(i);
            if (c == '{' || c == '[' || c == '(') {
                st.push(c);
            } else {
                if (c == '}') {
                    if (st.isEmpty() || st.pop() != '{') {
                        return "NO";
                    }
                } else if (c == ']') {
                    if (st.isEmpty() || st.pop() != '[') {
                        return "NO";
                    }
                } else if (c == ')') {
                    if (st.isEmpty() || st.pop() != '(') {
                        return "NO";
                    }
                }
            }
        }

        if (st.isEmpty()) {
            return "YES";
        } else {
            return "NO";
        }
    }

    private static final Scanner scanner = new Scanner(System.in);

    public static void main(String[] args) throws IOException {
        BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));

        int t = scanner.nextInt();
        scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");

        for (int tItr = 0; tItr < t; tItr++) {
            String s = scanner.nextLine();

            String result = isBalanced(s);

            bufferedWriter.write(result);
            bufferedWriter.newLine();
        }

        bufferedWriter.close();

        scanner.close();
    }
}

Leave a Reply