You are given a string, s, consisting of lowercase English letters. Your task is to find the length of the longest self-contained substring of s.
A substring t of s is called self-contained if:
In other words, all characters in t are completely unique to that substring within the string s.
Return the length of the longest self-contained substring. If no such substring exists, return -1.
Constraints: