You are given a string composed entirely of ‘(’ and ‘)’ characters. Your goal is to identify the longest contiguous segment (substring) within this string that represents a “well-formed” or “valid” sequence of parentheses.

A substring is considered valid if:

1. Every opening parenthesis ‘(’ has a corresponding closing parenthesis ‘)’.

2. The pairs of parentheses are correctly nested.

Return the length of this longest valid substring.

Constraints:

• $0 \leq$ s.length $\leq 3 \times 10^3$

• s[i] is ‘(’, or ‘)’.

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.