1111. Maximum Nesting Depth of Two Valid Parentheses Strings

Yesterday's daily wanted the nesting depth of one VPS. This one hands back the same kind of string and asks you to tear it into two subsequences so the deeper of the two is as shallow as it can be, and the whole problem collapses into a counting argument. At the moment seq reaches its deepest point