set of non-overlapping substrings of a string, **which include repeated substrings** …
Solution 1:
You have $n-1$ locations at which you could insert a break, and these choices are independent. So there are $ 2^{n-1}$ possible splittings, and these are easy to put into 1-1 correspondence with the bit strings of length $n-1$.