Adding interview question "redundant brackets"#115
Open
Shubh-k04 wants to merge 1 commit intoTharinduDilshan:mainfrom
Open
Adding interview question "redundant brackets"#115Shubh-k04 wants to merge 1 commit intoTharinduDilshan:mainfrom
Shubh-k04 wants to merge 1 commit intoTharinduDilshan:mainfrom
Conversation
For a given expression in the form of a string, find if there exist any redundant brackets or not. It is given that the expression contains only rounded brackets or parenthesis and the input expression will always be balanced. A pair of the bracket is said to be redundant when a sub-expression is surrounded by unnecessary or needless brackets. Example: Expression: (a+b)+c Since there are no needless brackets, hence, the output must be 'false'. Expression: ((a+b)) The expression can be reduced to (a+b). Hence the expression has redundant brackets and the output will be 'true'. Note: You will not get a partial score for this problem. You will get marks only if all the test cases are passed. Input Format : The first and the only line of input contains a string expression, without any spaces in between. Output Format : The first and the only line of output will print either 'true' or 'false'(without the quotes) denoting whether the input expression contains redundant brackets or not. Note: You are not required to print the expected result. It has already been taken care of.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
For a given expression in the form of a string, find if there exist any redundant brackets or not. It is given that the expression contains only rounded brackets or parenthesis and the input expression will always be balanced. A pair of the bracket is said to be redundant when a sub-expression is surrounded by unnecessary or needless brackets. Example:
Expression: (a+b)+c
Since there are no needless brackets, hence, the output must be 'false'.
Expression: ((a+b))
The expression can be reduced to (a+b). Hence the expression has redundant brackets and the output will be 'true'. Note:
You will not get a partial score for this problem. You will get marks only if all the test cases are passed. Input Format :
The first and the only line of input contains a string expression, without any spaces in between. Output Format :
The first and the only line of output will print either 'true' or 'false'(without the quotes) denoting whether the input expression contains redundant brackets or not. Note:
You are not required to print the expected result. It has already been taken care of.