Bracket Checker Using Stack and Queue in C#

Question

I am having an issue solving Bracket Checker .
i cant seem to solve the problem if user input this sequence of bracket then my program must print its not a right sequence

Input:

({}[)

Output:

Not a Right Sequence

My code is below

        Stack s = new Stack();

        Queue q = new Queue();

        bool isok = true;

        string FinalData = "0";            

        Console.WriteLine("Enter Brackets");

        string data = Console.ReadLine();

        for (int i = 0; i < data.Length; i++)
        {
            if (data.Substring(i, 1) == "{"
             || data.Substring(i, 1) == "["
             || data.Substring(i, 1) == "("
                )
            {
                s.Push(data.Substring(i, 1));
            }
            else
            {
                q.Enqueue(data.Substring(i, 1));
            }
        }
        while (s.Count > 0 && q.Count > 0)
        {
            FinalData = (String)s.Pop();
            string value = (String)q.Dequeue();
            if (FinalData == value)
            {
                isok = false;
                break;
            }                 
        }

        if (isok)
            Console.WriteLine(data + " is a Right Sequence.");
        else
            Console.WriteLine(data + " is Not a Right Sequence.");
        Console.ReadLine();
    }

Answer 1

I'l give you a few hints and the basic idea:

• you don't need the Queue, just a Stack<char>.
• read the input, for each char:
  • if the char is an open brace, push it
  • if the char is a close brace, pop the stack and compare.
  • discard other chars

Answer 2

public bool CheckBraces(string data)
{
    Stack<char> stack = new Stack<char>();
    foreach(char c in data){
        switch(c){
            case '(':
            case '[':
            case '{':
                stack.Push(c);
                break;
            case ')':
            case ']':
            case '}':
                if(!CheckMatch(stack.Pop(),c)){
                    return false;
                }
                break;
        }
   }
   return true;
}

private bool CheckMatch(char a, char b){
   return a=='(' && b==')' || 
          a=='[' && b==']' ||
          a=='{' && b=='}';
}

Answer 3

Thannks Guys I have Solved The Problem Using stack And Queue Both AT the Same time. Here's the code

        Stack s = new Stack();

        Queue q = new Queue();

        bool isRight = true;

        char OpeningBracket = ' ';

        char closingBracket = ' ';

        Console.WriteLine("Enter Brackets");
        string data = Console.ReadLine();
        char[] character = data.ToCharArray();
        for (int i = 0; i < character.Length; i++)
        {
            if (character[i] == '(' || character[i] == '{' ||
                character[i] == '[')
            {
                s.Push(character[i]);
            }
            else
                q.Enqueue(character[i]);
        }

        if (s.Count == 0 || q.Count == 0)            
            isRight = false;

        while (s.Count > 0 && q.Count > 0)
        {
            OpeningBracket = (char)s.Pop();
            closingBracket = (char)q.Dequeue();
            if ((OpeningBracket == '(' && closingBracket != ')')
           ||   (OpeningBracket == '[' && closingBracket != ']')
           ||   (OpeningBracket == '{' && closingBracket != '}')
                )
            {
                isRight = false;
            }

        }

        if (isRight)
            Console.WriteLine(data + " is a Right Sequence.");
        else
            Console.WriteLine(data + " is Not Right Sequence.");
        Console.ReadLine();
    }