Balanced parenthsis() sir could you check test cases paas ni ho rhhe hein

#include
#include
using namespace std;
bool isValidExp(char*s){
stackstk;
for(int i=0;s[i]!=’\0’;i++){
char ch=s[i];
if(ch==’(’&&’{’&&’[’){
stk.push(ch);

	}
	else if(ch==')'&&'}'&&']'){
		if(stk.empty()or stk.top()!='('){
			return false;
		}
		stk.pop();
	}
}
return stk.empty();

}
int main(){
char s[100]="((a+b)+(c-d+f))";

if(isValidExp(s)){
	cout<<"YES";
}
else{
	cout<<"NO";
}

}

hi @manishayadav1360_c0939b9a17f994ff,
https://ide.codingblocks.com/s/665996 updated

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.