• Skip to primary navigation
  • Skip to content
  • Skip to primary sidebar
  • Skip to secondary sidebar

GoHired

Interview Questions asked in Google, Microsoft, Amazon

Join WeekEnd Online Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

  • Home
  • Best Java Books
  • Algorithm
  • Internship
  • Certificates
  • About Us
  • Contact Us
  • Privacy Policy
  • Array
  • Stack
  • Queue
  • LinkedList
  • DP
  • Strings
  • Tree
  • Mathametical
  • Puzzles
  • Graph

Closed Parentheses checker

December 26, 2017 by Dhaval Dave

‏Problem Statement:

You are given 3 types of parentheses (),{},[]. Now you are supposed to check whether a given string containing some parentheses is closed or not.

example depicting closed sequence

Now there is a twist. Instead of checking whether a complete sequence is closed or not, you will be given a incomplete sequence containing a ‘X’ indicating a empty space and then you will have to output whether a closed sequence is possible or not.

example explaining problem

NOTE – There will at most 5 ‘X’ in a sequence and sequence can be of at most 10000.

Required Knowledge:

Backtracking

Time Complexity:

O(n*6(# of ‘X’))

 

Solution:

Here the important thing to note is that running time depends on no. of X which as defined in the question is at most 5. So we can use backtracking to solve this problem.

Now, let us see how we will apply backtracking in solving this parenthesis problem. First we will define the the base and recursion for backtracking.

The base condition is if it the sequence contains no ‘X’ then we will check whether the sequence is closed or not using the check function whose functioning we will discuss later.

The recursive condition is that we will replace each ‘X’ with one of the six parenthesis and then continue with the recursion.

Now let us discuss the functioning of the check functioning. In the check function, if the parenthesis is a left one, then we push a unique number corresponding to 3 pair of parentheses in a stack. If it is a right one, then we check whether the stack is empty or not. If it is empty then it is sure shot that it is impossible to form a closed sequence. Now if it is not, then there still remains a possibility. Now we check whether its corresponding left exists as top or not. If it exists then we continue or we return false.

 

Now,let us see working for an example.

example for working

(i) For the first one

first case(ii) For the second case

third case(iii) For the third case

third case

After this we stop, since we have already confirmed there is a closed sequence possible from the given incomplete sequence.

Code

Implemented in C++

#include <bits/stdc++.h>
using namespace std;

bool check(string s){                       // This function is used to check a parenthesis sequence 
  stack<int > st;                           // is closed or not
                                            // The idea behind this function is:
  for(int i=0;i<s.length();i++){            // 1. if it's left parenthesis, then push it
    if(s[i]=='{')				// 2. it it's right parenthesis, then check if its 
      st.push(1);				//    corresponding left occurs or not. if not then return
    else if(s[i]=='[')			//    false or else continue
      st.push(2);
    else if(s[i]=='(')
      st.push(3);
    else if(s[i]==')'){
      if(st.empty())
        return false;
      int t=st.top();
      //cout<<t<<endl;
      if(t==3){
        st.pop();
        if(st.empty())st.push(0);
      }
      else
        return false;
    }
    else if(s[i]==']'){
      if(st.empty())
        return false;
      int t=st.top();
      //cout<<t<<endl;
      if(t==2){
        st.pop();
        if(st.empty())st.push(0);
      }
      else
        return false;
    }
    else{
      if(st.empty())
        return false;
      int t=st.top();
      //cout<<t<<endl;
      if(t==1){
        st.pop();
        if(st.empty())st.push(0);
      }
      else
        return false;
    }
  }

  while(!st.empty()){
    int t=st.top();
    if(t!=0)
      return false;
    st.pop();
  }
  return true;
}

bool ans=false;				// This is a global var which contains true/false
char possible[]={'{','[','(',')',']','}'};		// This contains all possible parentheses

void rec(string s,int k,int x){			// This recursion is defined as following:
	if(ans)return;
	if(x==0){				// 1. Base case: if x=0 then check for closed
		if(ans==true)return;							
		ans=check(s);
		return;
	}
	for(int i=k;i<s.length();i++){		// 2. Recursion: change a 'X' to a parenthesis
		if(s[i]=='X'){			//    then check for the rest
			for(int j=0;j<6;j++){ 
                                s[i]=possible[j]; 
                                rec(s,i+1,x-1); 
                        } 
                } 
        } 
} 

int main(){ 
  string s; 
  cin>>s;
  int x=0;
  for(int i=0;i<s.length();i++)if(s[i]=='X')x++;
  rec(s,0,x);
  (ans==1)?cout<<"Possible\n":cout<<"Impossible\n";
  return 0;
}

 

This Article is Published by Arnab Ghosh.
If you want to be a content writer with Gohired.in, please write at career@gohired.in or at admin@gohired.in.

 

Similar Articles

Filed Under: Amazon Interview Question, Interview Questions Tagged With: algorithm, backtracking

Reader Interactions

Primary Sidebar

Join WeekEnd Online/Offline Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

Join WeekEnd Online/Offline Batch from 4-April-2020

WhatsApp us

Secondary Sidebar

Custom Search

  • How I cracked AMAZON
  • LeetCode
  • Adobe
  • Amazon
  • Facebook
  • Microsoft
  • Hacker Earth
  • CSE Interview

Top Rated Questions

Rectangular chocolate bar Create at least one piece which consists of exactly nTiles tiles

Interfaces in C++ (Abstract Classes in C++)

Check if an array has duplicate numbers in O(n) time and O(1) space

Memory Efficient LinkedList

Print vertical sum of all the axis in the given binary tree

Right view of Binary tree

Printing each word reverse in string

Possible sizes of bus to carry n groups of friends

Maximum sum contiguous subarray of an Array

Check a String is SUBSEQUENCE of another String Find Minimum length for that ( DNA Matching )

Circular Linked List

Maximum path sum between two leaves

Microsoft BING Interview Experience

Trie Dictionary

Leetcode: Edit Distance

Coin Collection Dynamic Programming

LeetCode: Container With Most Water

Count Possible Decodings of a given Digit Sequence

Python List

Serialise Deserialise N-ary Tree

Printing Longest Common Subsequence

Find min element in Sorted Rotated Array (With Duplicates)

Cisco Hiring Event 21st – 22nd Feb 2015

Password Predictor

Test Cases for Round Function

Check Binary Tree is Binary Search Tree or not

C++ OOPs Part1

Fibonacci Hashing & Fastest Hashtable

FizzBuzz Solution C C++

write a c program that given a set a of n numbers and another number x determines whether or not there exist two elements in s whose sum is exactly x

Copyright © 2023 · Genesis Framework · WordPress · Log in