yes

97. Encryption Key

Time Limit: 1 seconds

Memory Limit: 256 MB

Rating: 1000

We've intercepted an encrypted message encoded with nested parentheses. Ensure the message is correctly structured—every opening parenthesis needs a matching closing one. 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.

You are given a string $S$, the length of which does not exceed $5{,}000$.

Output "true" in lowercase if $S$ is valid, and "false" otherwise.

Sample Input 1:
([{}])

Sample Output 1:
true


Sample Input 2:
[(])

Sample Output 2:
false

The first sample case satisfies both the matching and nesting rules, but the second sample case fails the nesting rule.

KL Coding Cup March 2025 > Speed Round > Problem 2