Code : Balanced Parenthesis

 #include <iostream>

#include <string>
using namespace std;

#include "solution.h"

int main()
{
string input;
cin >> input;
cout << ((isBalanced(input)) ? "true" : "false");
}



// #include<bits/stdc++.h>
// bool isBalanced(string expression)
// {
// // Write your code here
// Stack<int>s;
// for(int i=0;i<expression.size();i++){
// if(s.empty())s.push(expression[i]);
// else if(s.top()=='(' && expression[i]==')' ||s.top()=='{' && expression[i]=='}' || s.top()=='[' && expression[i]==']') s.pop();
// else s.push(expression[i]);
// }
// if(s.empty()) return true;
// else return false;
// }

#include <bits/stdc++.h>

bool isBalanced(string expression)
{
// Write your code here
stack<char>s;
for(int i=0; i<expression.length(); i++){
if(s.empty()){
s.push(expression[i]);
}
else if(s.top()=='(' && expression[i]==')'){
s.pop();
}
else {
s.push(expression[i]);
}
}
if(s.empty()) return true;
return false;
}

Comments

Post a Comment

Popular posts from this blog

Code : All connected components

  Given an undirected graph G(V,E), find and print all the connected components of the given graph G. Note: 1. V is the number of vertices present in graph G and vertices are numbered from 0 to V-1. 2. E is the number of edges present in graph G. 3. You need to take input in main and create a function which should return all the connected components. And then print them in the main, not inside function. Print different components in new line. And each component should be printed in increasing order (separated by space). Order of different components doesn't matter. Input Format : The first line of input contains two integers, that denote the value of V and E. Each of the following E lines contains two space separated integers, that denote that there exists an edge between vertex a and b. Output Format : Print different components in new line. And each component should be printed in increasing order of vertices (separated by space). Order of different components doesn't matter....
Read more

Coding Ninjas

  Given a NxM matrix containing Uppercase English Alphabets only. Your task is to tell if there is a path in the given matrix which makes the sentence “CODINGNINJA” . There is a path from any cell to all its neighbouring cells. For a particular cell, neighbouring cells are those cells that share an edge or a corner with the cell. Input Format : The first line of input contains two space separated integers N and M, where N is number of rows and M is the number of columns in the matrix. Each of the following N lines contain M characters. Please note that characters are not space separated. Output Format : Print 1 if there is a path which makes the sentence “CODINGNINJA” else print 0. Constraints : 1 <= N <= 1000 1 <= M <= 1000 Time Limit: 1 second Sample Input 1: 2 11 CXDXNXNXNXA XOXIXGXIXJX Sample Output 1: 1 bool hasPath ( vector < vector < char >> & board , int n , int m ) { // Write your code here. } #include < iostream > #include ...
Read more