### Reverse String - Leet Code Solution

Problem Statement Write a function that reverses a string. The input string is…

October 04, 2020

Given a string s, return the maximum number of unique substrings that the given string can be split into.

You can split string s into any list of non-empty substrings, where the concatenation of the substrings forms the original string. However, you must split the substrings such that all of them are unique.

A substring is a contiguous sequence of characters within a string.

**Example**

```
Input: s = "ababccc"
Output: 5
Explanation: ['a', 'b', 'ab', 'c', 'cc']
Input: s = "aba"
Output: 2
Explanation: ['a', 'ba']
Example 3:
Input: s = "aa"
Output: 1
Explanation: It is impossible to split the string any further.
```

Problems like these are solved through recursions, where you want to extract a portion of string and repeat the same algorithm on the rest of string.

Lets look at the algorithm:

- For checking unique substrings, you need to take a HashSet
- We would take a substring, check it if its unique.
- If its unique, we will move forward with rest of string in the same algorithm.

Lets look at one of example:

```
input=aba
a + (ba)
a + b + (a)
# a is duplicate, it will only (a, b)
Next iteration
ab + (a)
Next Iteration
aba + ()
```

Lets look at the code:

```
private int find(String s, Set<String> set) {
int max = 0;
for (int i=0; i<s.length(); i++) {
String sub = s.substring(0, i+1);
if (!set.contains(sub)) {
set.add(sub);
max = Math.max(max, 1 + find(s.substring(i+1), set));
set.remove(sub);
}
}
return max;
}
public int maxUniqueSplit(String s) {
Set<String> set = new HashSet<>();
return this.find(s, set);
}
```

Its `O(n!)`

, factorial of n.

Problem Statement Write a function that reverses a string. The input string is…

Sorting Problems Merge Sort Quick Sort Heap Sort Bubble Sort Selection Sort…

Its a tree based data structure which is a complete binary tree(all nodes have…

Problem Statement Given a sorted array nums, remove the duplicates in-place such…

This is kind of preliminary technique of sorting. And, this is the first…

Problem Statement Roman numerals are represented by seven different symbols: I…

In this post, we will see some of the frequently used concepts/vocabulary in…

System design interview is pretty common these days, specially if you are having…

Introduction You are given an array of integers with size N, and a number K…

Graph Topological Sorting This is a well known problem in graph world…

Problem Statement Given a Binary tree, print out nodes in level order traversal…

Problem Statement Given an array nums of n integers and an integer target, are…