Some Test cases are not accepted Please Help Balanced Paranthesis using stack

yashratnani6 · November 25, 2020, 12:07pm

https://hack.codingblocks.com/app/contests/1786/709/problem

mr.encoder · November 25, 2020, 12:26pm

Hey @yashratnani6 you haven’t noticed the input format as it is
Input Format
A string of ‘(’ , ‘)’ , ‘{’ , ‘}’ and ‘[’ , ‘]’ .

Take this code for reference

github.com

DivonilLiquid/Data-Structure-Algorithm/blob/master/Stack/ValidParentheses.cpp

/*
Given a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.

An input string is valid if:

Open brackets must be closed by the same type of brackets.
Open brackets must be closed in the correct order.
 

Example 1:

Input: s = "()"
Output: true
Example 2:

Input: s = "()[]{}"
Output: true
Example 3:

Input: s = "(]"

This file has been truncated. show original