Split a String Into the Max Number of Unique Substrings

Try to solve the Split a String Into the Max Number of Unique Substrings problem.

Statement

Given a string, s, determine the maximum number of unique substringsA substring is defined as a continuous sequence of characters within a string. into which s can be split. You can divide s into any sequence of nonempty substrings, ensuring their concatenation reconstructs the original string. However, each substring in the split must be distinct.

Constraints:

  • 11 \leq s.length 16\leq 16

  • s contains only lowercase English letters.

Example

Level up your interview prep. Join Educative to access 70+ hands-on prep courses.