Shortest Unique Substring Length

Problem Statement

Shortest Unique Substring Length Problem Description Write a function solution that, given a string S of length N , returns the length of the shortest unique substring of S , that is, the length of the shortest word which occurs in S exactly once. Examples Example 1: Input: S = "abaaba" Output: 2 Explanation: The shortest unique substring of S is "aa". Example 2: Input: S = "zyzyzyz" Output: 5 Explanation: The shortest unique substring of S is "zyzyy". Note that there are shorter words, like "yzy", occurrences of which overlap, but they still count as multiple occurrences. Example 3: Input: S = "aabbbabaaa" Output: 3 Explanation: All substrings of size 2 occur in S at least twice. The shortest unique substring therefore has a length of 3. Constraints N is an integer within the range [1..200] . String S is made only of lowercase letters ( a - z ). In your solution, focus on correctness . The performance of your solution will not be the focus of the assessment.