Encryption Key

We've intercepted an encrypted message encoded with nested parentheses. Ensure the message is correctly structured—every opening parenthesis needs a matching closing one.
Explanation
Input is denoted by:

s: A string containing only the characters '(', ')', '{', '}', '[', ']', '<', '>'

Your task is to determine if the input string is valid:

Every opening parenthesis/bracket/brace must have a matching closing one.
Pairs must be properly nested (e.g., "([{}])" is valid, but "[(])" is not).

For example, given s = "([{}])", the output would be true because the string is properly nested and balanced.

Example Case


                Input: s = "([{}])" 

                Explanation: Every opening character has a matching and properly
                nested closing one. 

                Expected Output: true

Case 1


                The input is too long, the file is space seperated! Download it
                from
                here

Case 2


                The input is too long, the file is space seperated! Download it
                from
                here

Case 3


                The input is too long, the file is space seperated! Download it
                from
                here

Submit Here