We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Balanced Brackets
  2. Discussions

Balanced Brackets

  • seanjennings976
     + 0 comments

    C# solution. For once I actually liked the question.

    public static string isBalanced(string s)
    {
        if (s.Length % 2 != 0) return "NO";
        
        var OpeningBrackets = new char[] {'[', '{', '('};
        var openingBracketsStack = new Stack<char>();
        
        foreach(var bracket in s)
        {
            if (OpeningBrackets.Contains(bracket))
            {
                openingBracketsStack.Push(bracket);
                continue;
            }
            
            if (openingBracketsStack.Count == 0) return "NO";
            
            switch (bracket)
            {
                case ']':
                    if (openingBracketsStack.Pop() != '[') return "NO";
                    continue;
                case '}':
                    if (openingBracketsStack.Pop() != '{') return "NO";
                    continue;
                case ')':
                    if (openingBracketsStack.Pop() != '(') return "NO";
                    continue;
                default:
                    return "NO";
            }
        }
        
        return openingBracketsStack.Count > 0 ? "NO" : "YES";
    }