Skip to main content

Balanced brackets in C++

It was a question on coursera course in Data structure and I spent some time on the program. Though I had taught the program to students earlier.

But somehow coursera is not accepting my submission:( So why not blog it?

The question is Write a program to balance brackets using stack. This is fundamental requirement in any programming language.

Let us look at some valid and invalid  strings.

{[]}()   valid
[]{}()[] valid
{([([])])} valid

{}) invalid
([)] invalid
({[]} invalid

You are getting the gist, right? When ever there is an opening bracket, there should be a corresponding closing bracket of matching type. And order is important, you can not have round bracket , square bracket followed by closing round bracket first and square bracket next.

So the algorithm is very simple
  1. create a stack of characters
  2. repeat for each i from 0 to length of string
    1. ch = ith character
    2. if ch is either { or [ or (, push it to stack
    3. if ch is closing bracket i.e. } or ] or } 
      1. get stack top charcter ch2
      2. if ch and ch2 are of same type pop the  char
      3. if not return a false
  3. if stack is empty all opening brackets are popped. Return true
  4. if stack is not empty, there are some extra opening brackets. Return false

Now for the code. I used the stack from stl in c++. Here is the code.


#include<stack>
#include<iostream>
using namespace std;
bool isBalanced(string str,char &wrongChar);
int main()
{
    
    string str;
    cout<<"Enter your string";
     getline(cin,str,'\n');
    char ch;
    bool bal = isBalanced(str,ch);
    if(bal)
      cout<<"success";
    else
      cout<<ch;
}

bool isBalanced(string str,char &wrongChar)
{
    stack<char> brackStack;
    int len = str.length();
    for(int i=0;i<len;i++)
        {
           char ch= str[i];
           if(ch=='(' || ch=='[' || ch=='{')
              brackStack.push(ch);
           else if ( ch==')' || ch==']' || ch=='}')
              {
                  char topChar = brackStack.top();
                  if(  (ch==')' && topChar=='(') ||
   (ch==']' && topChar=='[') ||
   (ch=='}' && topChar=='{') )
                   {
                      brackStack.pop();
                      continue;
                   }
                   else{
            /* not matching*/
            wrongChar = ch;
            return false;
     }
               }
         }
      if(brackStack.empty())
         return true;
      else
         {
           wrongChar = brackStack.top();
           return false;
          }
}

Not so tough? Isn't  it?

For more such questions and notes on all advanced topics, download my app c++ notes
Labels:

Comments

Post a Comment

Popular posts from this blog

In order traversal of nodes in the range x to y

Question : Write a function for in-order traversal of nodes in the range x to y from a binary search tree. This is quite a simple function. As a first solution we can just traverse our binary search tree in inorder and display only the nodes which are in the range x to y. But if the current node has a value less than x, do we have to traverse its left subtree? No. Because all the nodes in left subtree will be smaller than x. Similarly if the current node has a key value more than y, we need not visit its right subtree. Now we are ready to write our algorithm.     if nd is NOT NULL  if nd->val >=x then visit all the nodes of left subtree of nd recursively display nd->val if nd->val <y then visit all the nodes of right subtree of nd recursively  That's all. We have our function ready. void in_order_middle (NODEPTR nd, int x, int y) { if (nd) { if (nd -> val >= x) in_order_middle(nd...
Post a Comment
Read more

Josephus problem

Question: Write a function to delete every k th node from circular linked list until only one node is left. This has a story associated with it. Flavius Josephus was Jewish Historian from 1st century. He and 40 other soldiers were trapped in a cave by Romans. They decided to kill themselves rather than surrendering to Romans. Their method was like this. All the soldiers will stand in a circle and every k th soldier will be shot dead. Josephus said to have calculated the starting point so that he would remain alive. So we have similar problem at hand. We delete every kth node in a circular list. Eventually only one node will be left. e.g. Let us say this is our list And we are deleting every third node.  We will delete 30. Then we delete 60. Next we delete 10. Next it will be 50. Next to be deleted is 20. Next 80. This continues. Implementation   We can count k-1 nodes and delete next node. This can be repeated in  a loop. What must be the termina...
Post a Comment
Read more

Lowest common ancestor of binary search tree

Question : Write a function to print the lowest common ancestor of two nodes in a binary search tree.  Lowest common ancestor of two nodes x and y in a binary tree is the lowest node that has both x and y as descendants. Here lowest common ancestor of 1 and 7 is 3. LCA of 13 and 7 is root - 8. And LCA of 6 and 7 is 6 itself. The program to find gets complicated for an ordinary binary tree. But for a binary search tree, it is quite simple. As we see from the diagram above, the paths to 1 and 4 are common till the node 3. And at 3 they branch in different directions. So 3 is our LCA. That is lowest common ancestor is the node where the paths to x and y from root deviate. As long as they branch in same direction, we continue to traverse. When they branch in different directions, that is the lowest common ancestor. So let us write a simple algorithm, set temp=root if temp->val >x and temp->val>y temp = temp->left else if temp->val<x and ...
Post a Comment
Read more