Leetcode 1593. Split a String Into the Max Number of Unique Substrings

Given a string s (length ≤ 16), partition it into contiguous non-empty substrings whose concatenation equals s so that all substrings are distinct, and return the maximum possible number of substrings. This is a search/backtracking problem exploring all partitions under a uniqueness constraint (feasible due to the small n).