Question

Microsoft | OA Coding Questions and Solutions | Set - 70 | 2022

Answer 1

Given a string s, find the minimum number of substrings you can create without having the same letters repeating in each substring.
Example: 
    world -> 1, as the string has no letters that occur more than once. 
    dddd -> 4, as you can only create substring of each character.
    abba -> 2, as you can make substrings of ab, ba.	
    cycle-> 2, you can create substrings of (cy, cle) or (c, ycle)
 

Answer 2

 public static int subStringsWithNoRepeat(String s) {
		if (s == null || s.isEmpty()) {
			return 0;
		}
		Set set = new HashSet<>();
		int res = 1;
		for (char c : s.toCharArray()) {
			if (set.contains(c)) {
				res++;
				set.clear();
			}
			set.add(c);
		}
		return res;
	}