Given a string s and a set of n substrings. You are supposed to remove every instance of those n substrings from s so that s is of the minimum length and output this minimum length.

Have you met this question in a real interview? Yes
Example
Given s = ccdaabcdbb, substrs = ["ab", "cd"]
Return 2

Explanation: 
ccdaabcdbb -> ccdacdbb -> cabb -> cb (length = 2)

 1 public class Solution {
 2     /**
 3      * @param s a string
 4      * @param dict a set of n substrings
 5      * @return the minimum length
 6      */
 7     public int minLength(String s, Set<String> dict) {
 8         // Write your code here
 9         if (s == null) {
10             return 0;
11         }
12         if (s.length() == 0 || dict == null || dict.size() == 0) {
13             return s.length();
14         }
15         int result = s.length();
16         Queue<String> queue = new LinkedList<>();
17         Set<String> set = new HashSet<>();
18         queue.offer(s);
19         set.add(s);
20         while (!queue.isEmpty()) {
21             String str = queue.poll();
22             for (String subStr : dict) {
23                 int index = str.indexOf(subStr);
24                 while (index != -1) {
25                     String newStr = str.substring(0, index)
26                         + str.substring(index + subStr.length(), str.length());
27                     if (!set.contains(newStr)) {
28                         set.add(newStr);
29                         queue.offer(newStr);
30                         result = Math.min(result, newStr.length());
31                     }
32                     index = str.indexOf(subStr, index + 1);
33                 }
34             }
35         }
36         return result;
37     }
38 }