42:"static/chunks/13e96535-94b8213582025904.js?dpl=dpl_Ac61x1zTjqdEE5Lbe42XrJsDp9ZY" 43:"static/chunks/98f82933-589eefb75fa3923d.js?dpl=dpl_Ac61x1zTjqdEE5Lbe42XrJsDp9ZY" 44:"static/chunks/6b3bb038-e7f190346bb1f466.js?dpl=dpl_Ac61x1zTjqdEE5Lbe42XrJsDp9ZY" 45:"static/chunks/7bf36345-71f46e146bf494a8.js?dpl=dpl_Ac61x1zTjqdEE5Lbe42XrJsDp9ZY" 46:"static/chunks/98474-570534d8884fdb81.js?dpl=dpl_Ac61x1zTjqdEE5Lbe42XrJsDp9ZY" 47:"static/chunks/70717-732b6e3f51327198.js?dpl=dpl_Ac61x1zTjqdEE5Lbe42XrJsDp9ZY" 48:"static/chunks/78199-0ac5fc8c6f9f208b.js?dpl=dpl_Ac61x1zTjqdEE5Lbe42XrJsDp9ZY" 49:"static/chunks/45758-cad0e6d206f33d51.js?dpl=dpl_Ac61x1zTjqdEE5Lbe42XrJsDp9ZY" 4a:"static/chunks/7094-a9e43a2938c32c34.js?dpl=dpl_Ac61x1zTjqdEE5Lbe42XrJsDp9ZY" 4b:"static/chunks/82154-26d50c64ef5f0337.js?dpl=dpl_Ac61x1zTjqdEE5Lbe42XrJsDp9ZY" 4c:"static/chunks/68883-db099184e8e0f762.js?dpl=dpl_Ac61x1zTjqdEE5Lbe42XrJsDp9ZY" 4d:"static/chunks/92655-977cd8cb54e54ee8.js?dpl=dpl_Ac61x1zTjqdEE5Lbe42XrJsDp9ZY" 4e:"static/chunks/36830-0f35f306cb4bdfae.js?dpl=dpl_Ac61x1zTjqdEE5Lbe42XrJsDp9ZY" 4f:"static/chunks/96183-8d8991f4ffd19783.js?dpl=dpl_Ac61x1zTjqdEE5Lbe42XrJsDp9ZY" 50:"static/chunks/55807-59ab3fc7e55be3a5.js?dpl=dpl_Ac61x1zTjqdEE5Lbe42XrJsDp9ZY" 51:"static/chunks/65133-e758ae0d8ae0ef56.js?dpl=dpl_Ac61x1zTjqdEE5Lbe42XrJsDp9ZY" 52:"static/chunks/73562-5add2e277d971b26.js?dpl=dpl_Ac61x1zTjqdEE5Lbe42XrJsDp9ZY" 53:"static/chunks/33944-ae484311ab7075e2.js?dpl=dpl_Ac61x1zTjqdEE5Lbe42XrJsDp9ZY" 54:"static/chunks/76825-2d3fb820fe4969dc.js?dpl=dpl_Ac61x1zTjqdEE5Lbe42XrJsDp9ZY" 55:"static/chunks/27450-e98224f50c0e73be.js?dpl=dpl_Ac61x1zTjqdEE5Lbe42XrJsDp9ZY" 56:"static/chunks/48249-36975bdaeb79aed0.js?dpl=dpl_Ac61x1zTjqdEE5Lbe42XrJsDp9ZY" 57:"static/chunks/37136-a50a0edabe4cabab.js?dpl=dpl_Ac61x1zTjqdEE5Lbe42XrJsDp9ZY" 58:"static/chunks/80412-2f54c990d0fdf792.js?dpl=dpl_Ac61x1zTjqdEE5Lbe42XrJsDp9ZY" 59:"static/chunks/16243-e0198083b9797cf2.js?dpl=dpl_Ac61x1zTjqdEE5Lbe42XrJsDp9ZY" 5a:"static/chunks/10426-c86859dbfb4ab19f.js?dpl=dpl_Ac61x1zTjqdEE5Lbe42XrJsDp9ZY" 5b:"static/chunks/73840-5f4b504728e0a91d.js?dpl=dpl_Ac61x1zTjqdEE5Lbe42XrJsDp9ZY" 5c:"static/chunks/47093-6fb66c79d505405d.js?dpl=dpl_Ac61x1zTjqdEE5Lbe42XrJsDp9ZY" 5d:"static/chunks/app/viewer/%5B...param%5D/page-a3d173094eff40dc.js?dpl=dpl_Ac61x1zTjqdEE5Lbe42XrJsDp9ZY" 5e:I[82954,["88483","$15","93249","$16","803","$17","25746","$42","52571","$43","1383","$44","54129","$45","56019","$19","94957","$1a","19837","$1b","8337","$1c","92928","$1d","33001","$1e","95488","$1f","26901","$20","60144","$21","88786","$22","63334","$24","37267","$26","94169","$29","43442","$2a","8210","$2b","98474","$46","21491","$2d","70717","$47","78199","$48","45758","$49","7094","$4a","82154","$4b","68883","$4c","92655","$4d","36830","$4e","96183","$4f","55807","$50","65133","$51","73562","$52","33944","$53","76825","$54","27450","$55","11114","$34","60430","$35","1849","$36","48249","$56","37136","$57","80412","$58","16243","$59","10426","$5a","73840","$5b","87445","$37","47093","$5c","30635","$5d"],"default"] c:null 12:[["$","title","0",{"children":"Split a String Into the Max Number of Unique Substrings (medium)"}],["$","meta","1",{"name":"description","content":"Design Gurus - Split a String Into the Max Number of Unique Substrings (medium)"}],["$","link","2",{"rel":"canonical","href":"https://www.designgurus.io/viewer/document/grokking-the-coding-interview/63d50832298d8670e11747b4"}],["$","meta","3",{"property":"og:title","content":"Split a String Into the Max Number of Unique Substrings (medium)"}],["$","meta","4",{"property":"og:description","content":"Design Gurus - Split a String Into the Max Number of Unique Substrings (medium)"}],["$","meta","5",{"property":"og:url","content":"https://www.designgurus.io/viewer/document/grokking-the-coding-interview/63d50832298d8670e11747b4"}],["$","meta","6",{"property":"og:site_name","content":"Design Gurus"}],["$","meta","7",{"property":"og:locale","content":"en_US"}],["$","meta","8",{"property":"og:image","content":"https://www.designgurus.io/imgs/dg_default.png"}],["$","meta","9",{"property":"og:image:width","content":"1200"}],["$","meta","10",{"property":"og:image:height","content":"630"}],["$","meta","11",{"property":"og:image:alt","content":"Split a String Into the Max Number of Unique Substrings (medium)"}],["$","meta","12",{"property":"og:type","content":"website"}],["$","meta","13",{"name":"twitter:card","content":"summary_large_image"}],["$","meta","14",{"name":"twitter:site","content":"@sysdesigngurus"}],["$","meta","15",{"name":"twitter:title","content":"Split a String Into the Max Number of Unique Substrings (medium)"}],["$","meta","16",{"name":"twitter:description","content":"Design Gurus - Split a String Into the Max Number of Unique Substrings (medium)"}],["$","meta","17",{"name":"twitter:image","content":"https://www.designgurus.io/imgs/dg_default.png"}]] 5f:T46c,import java.util.HashSet; import java.util.Set; class Solution { public int maxUniqueSplit(String s) { // TODO: Write your code here return 0; } public static void main(String[] args) { Solution sol = new Solution(); // Test Case 1 String input1 = "abcabc"; int output1 = sol.maxUniqueSplit(input1); System.out.println("maxUniqueSplit(" + input1 + ") = " + output1); //Expected: 4 // Test Case 2 String input2 = "aab"; int output2 = sol.maxUniqueSplit(input2); System.out.println("maxUniqueSplit(" + input2 + ") = " + output2); //Expected: 2 // Test Case 3 String input3 = "ababab"; int output3 = sol.maxUniqueSplit(input3); System.out.println("maxUniqueSplit(" + input3 + ") = " + output3); //Expected: 4 // Test Case 4 String input4 = ""; int output4 = sol.maxUniqueSplit(input4); System.out.println("maxUniqueSplit(" + input4 + ") = " + output4); //Expected: 0 // Test Case 5 String input5 = "a"; int output5 = sol.maxUniqueSplit(input5); System.out.println("maxUniqueSplit(" + input5 + ") = " + output5); //Expected: 1 } } 60:T436,#include #include using namespace std; class Solution { public: int maxUniqueSplit(string s) { // TODO: Write your code here return 0; } }; int main() { Solution sol; // Test Case 1 string input1 = "abcabc"; int output1 = sol.maxUniqueSplit(input1); cout << "maxUniqueSplit(" << input1 << ") = " << output1 << endl; // Expected: 4 // Test Case 2 string input2 = "aab"; int output2 = sol.maxUniqueSplit(input2); cout << "maxUniqueSplit(" << input2 << ") = " << output2 << endl; // Expected: 2 // Test Case 3 string input3 = "ababab"; int output3 = sol.maxUniqueSplit(input3); cout << "maxUniqueSplit(" << input3 << ") = " << output3 << endl; // Expected: 4 // Test Case 4 string input4 = ""; int output4 = sol.maxUniqueSplit(input4); cout << "maxUniqueSplit(" << input4 << ") = " << output4 << endl; // Expected: 0 // Test Case 5 string input5 = "a"; int output5 = sol.maxUniqueSplit(input5); cout << "maxUniqueSplit(" << input5 << ") = " << output5 << endl; // Expected: 1 return 0; } 61:T46c,import java.util.HashSet; import java.util.Set; class Solution { public int maxUniqueSplit(String s) { // TODO: Write your code here return 0; } public static void main(String[] args) { Solution sol = new Solution(); // Test Case 1 String input1 = "abcabc"; int output1 = sol.maxUniqueSplit(input1); System.out.println("maxUniqueSplit(" + input1 + ") = " + output1); //Expected: 4 // Test Case 2 String input2 = "aab"; int output2 = sol.maxUniqueSplit(input2); System.out.println("maxUniqueSplit(" + input2 + ") = " + output2); //Expected: 2 // Test Case 3 String input3 = "ababab"; int output3 = sol.maxUniqueSplit(input3); System.out.println("maxUniqueSplit(" + input3 + ") = " + output3); //Expected: 4 // Test Case 4 String input4 = ""; int output4 = sol.maxUniqueSplit(input4); System.out.println("maxUniqueSplit(" + input4 + ") = " + output4); //Expected: 0 // Test Case 5 String input5 = "a"; int output5 = sol.maxUniqueSplit(input5); System.out.println("maxUniqueSplit(" + input5 + ") = " + output5); //Expected: 1 } } 62:T436,#include #include using namespace std; class Solution { public: int maxUniqueSplit(string s) { // TODO: Write your code here return 0; } }; int main() { Solution sol; // Test Case 1 string input1 = "abcabc"; int output1 = sol.maxUniqueSplit(input1); cout << "maxUniqueSplit(" << input1 << ") = " << output1 << endl; // Expected: 4 // Test Case 2 string input2 = "aab"; int output2 = sol.maxUniqueSplit(input2); cout << "maxUniqueSplit(" << input2 << ") = " << output2 << endl; // Expected: 2 // Test Case 3 string input3 = "ababab"; int output3 = sol.maxUniqueSplit(input3); cout << "maxUniqueSplit(" << input3 << ") = " << output3 << endl; // Expected: 4 // Test Case 4 string input4 = ""; int output4 = sol.maxUniqueSplit(input4); cout << "maxUniqueSplit(" << input4 << ") = " << output4 << endl; // Expected: 0 // Test Case 5 string input5 = "a"; int output5 = sol.maxUniqueSplit(input5); cout << "maxUniqueSplit(" << input5 << ") = " << output5 << endl; // Expected: 1 return 0; } 63:T46c,import java.util.HashSet; import java.util.Set; class Solution { public int maxUniqueSplit(String s) { // TODO: Write your code here return 0; } public static void main(String[] args) { Solution sol = new Solution(); // Test Case 1 String input1 = "abcabc"; int output1 = sol.maxUniqueSplit(input1); System.out.println("maxUniqueSplit(" + input1 + ") = " + output1); //Expected: 4 // Test Case 2 String input2 = "aab"; int output2 = sol.maxUniqueSplit(input2); System.out.println("maxUniqueSplit(" + input2 + ") = " + output2); //Expected: 2 // Test Case 3 String input3 = "ababab"; int output3 = sol.maxUniqueSplit(input3); System.out.println("maxUniqueSplit(" + input3 + ") = " + output3); //Expected: 4 // Test Case 4 String input4 = ""; int output4 = sol.maxUniqueSplit(input4); System.out.println("maxUniqueSplit(" + input4 + ") = " + output4); //Expected: 0 // Test Case 5 String input5 = "a"; int output5 = sol.maxUniqueSplit(input5); System.out.println("maxUniqueSplit(" + input5 + ") = " + output5); //Expected: 1 } } 64:T436,#include #include using namespace std; class Solution { public: int maxUniqueSplit(string s) { // TODO: Write your code here return 0; } }; int main() { Solution sol; // Test Case 1 string input1 = "abcabc"; int output1 = sol.maxUniqueSplit(input1); cout << "maxUniqueSplit(" << input1 << ") = " << output1 << endl; // Expected: 4 // Test Case 2 string input2 = "aab"; int output2 = sol.maxUniqueSplit(input2); cout << "maxUniqueSplit(" << input2 << ") = " << output2 << endl; // Expected: 2 // Test Case 3 string input3 = "ababab"; int output3 = sol.maxUniqueSplit(input3); cout << "maxUniqueSplit(" << input3 << ") = " << output3 << endl; // Expected: 4 // Test Case 4 string input4 = ""; int output4 = sol.maxUniqueSplit(input4); cout << "maxUniqueSplit(" << input4 << ") = " << output4 << endl; // Expected: 0 // Test Case 5 string input5 = "a"; int output5 = sol.maxUniqueSplit(input5); cout << "maxUniqueSplit(" << input5 << ") = " << output5 << endl; // Expected: 1 return 0; } 65:T46c,import java.util.HashSet; import java.util.Set; class Solution { public int maxUniqueSplit(String s) { // TODO: Write your code here return 0; } public static void main(String[] args) { Solution sol = new Solution(); // Test Case 1 String input1 = "abcabc"; int output1 = sol.maxUniqueSplit(input1); System.out.println("maxUniqueSplit(" + input1 + ") = " + output1); //Expected: 4 // Test Case 2 String input2 = "aab"; int output2 = sol.maxUniqueSplit(input2); System.out.println("maxUniqueSplit(" + input2 + ") = " + output2); //Expected: 2 // Test Case 3 String input3 = "ababab"; int output3 = sol.maxUniqueSplit(input3); System.out.println("maxUniqueSplit(" + input3 + ") = " + output3); //Expected: 4 // Test Case 4 String input4 = ""; int output4 = sol.maxUniqueSplit(input4); System.out.println("maxUniqueSplit(" + input4 + ") = " + output4); //Expected: 0 // Test Case 5 String input5 = "a"; int output5 = sol.maxUniqueSplit(input5); System.out.println("maxUniqueSplit(" + input5 + ") = " + output5); //Expected: 1 } } 66:T436,#include #include using namespace std; class Solution { public: int maxUniqueSplit(string s) { // TODO: Write your code here return 0; } }; int main() { Solution sol; // Test Case 1 string input1 = "abcabc"; int output1 = sol.maxUniqueSplit(input1); cout << "maxUniqueSplit(" << input1 << ") = " << output1 << endl; // Expected: 4 // Test Case 2 string input2 = "aab"; int output2 = sol.maxUniqueSplit(input2); cout << "maxUniqueSplit(" << input2 << ") = " << output2 << endl; // Expected: 2 // Test Case 3 string input3 = "ababab"; int output3 = sol.maxUniqueSplit(input3); cout << "maxUniqueSplit(" << input3 << ") = " << output3 << endl; // Expected: 4 // Test Case 4 string input4 = ""; int output4 = sol.maxUniqueSplit(input4); cout << "maxUniqueSplit(" << input4 << ") = " << output4 << endl; // Expected: 0 // Test Case 5 string input5 = "a"; int output5 = sol.maxUniqueSplit(input5); cout << "maxUniqueSplit(" << input5 << ") = " << output5 << endl; // Expected: 1 return 0; } 67:T46c,import java.util.HashSet; import java.util.Set; class Solution { public int maxUniqueSplit(String s) { // TODO: Write your code here return 0; } public static void main(String[] args) { Solution sol = new Solution(); // Test Case 1 String input1 = "abcabc"; int output1 = sol.maxUniqueSplit(input1); System.out.println("maxUniqueSplit(" + input1 + ") = " + output1); //Expected: 4 // Test Case 2 String input2 = "aab"; int output2 = sol.maxUniqueSplit(input2); System.out.println("maxUniqueSplit(" + input2 + ") = " + output2); //Expected: 2 // Test Case 3 String input3 = "ababab"; int output3 = sol.maxUniqueSplit(input3); System.out.println("maxUniqueSplit(" + input3 + ") = " + output3); //Expected: 4 // Test Case 4 String input4 = ""; int output4 = sol.maxUniqueSplit(input4); System.out.println("maxUniqueSplit(" + input4 + ") = " + output4); //Expected: 0 // Test Case 5 String input5 = "a"; int output5 = sol.maxUniqueSplit(input5); System.out.println("maxUniqueSplit(" + input5 + ") = " + output5); //Expected: 1 } } 68:T436,#include #include using namespace std; class Solution { public: int maxUniqueSplit(string s) { // TODO: Write your code here return 0; } }; int main() { Solution sol; // Test Case 1 string input1 = "abcabc"; int output1 = sol.maxUniqueSplit(input1); cout << "maxUniqueSplit(" << input1 << ") = " << output1 << endl; // Expected: 4 // Test Case 2 string input2 = "aab"; int output2 = sol.maxUniqueSplit(input2); cout << "maxUniqueSplit(" << input2 << ") = " << output2 << endl; // Expected: 2 // Test Case 3 string input3 = "ababab"; int output3 = sol.maxUniqueSplit(input3); cout << "maxUniqueSplit(" << input3 << ") = " << output3 << endl; // Expected: 4 // Test Case 4 string input4 = ""; int output4 = sol.maxUniqueSplit(input4); cout << "maxUniqueSplit(" << input4 << ") = " << output4 << endl; // Expected: 0 // Test Case 5 string input5 = "a"; int output5 = sol.maxUniqueSplit(input5); cout << "maxUniqueSplit(" << input5 << ") = " << output5 << endl; // Expected: 1 return 0; } 69:T46c,import java.util.HashSet; import java.util.Set; class Solution { public int maxUniqueSplit(String s) { // TODO: Write your code here return 0; } public static void main(String[] args) { Solution sol = new Solution(); // Test Case 1 String input1 = "abcabc"; int output1 = sol.maxUniqueSplit(input1); System.out.println("maxUniqueSplit(" + input1 + ") = " + output1); //Expected: 4 // Test Case 2 String input2 = "aab"; int output2 = sol.maxUniqueSplit(input2); System.out.println("maxUniqueSplit(" + input2 + ") = " + output2); //Expected: 2 // Test Case 3 String input3 = "ababab"; int output3 = sol.maxUniqueSplit(input3); System.out.println("maxUniqueSplit(" + input3 + ") = " + output3); //Expected: 4 // Test Case 4 String input4 = ""; int output4 = sol.maxUniqueSplit(input4); System.out.println("maxUniqueSplit(" + input4 + ") = " + output4); //Expected: 0 // Test Case 5 String input5 = "a"; int output5 = sol.maxUniqueSplit(input5); System.out.println("maxUniqueSplit(" + input5 + ") = " + output5); //Expected: 1 } } 6a:T436,#include #include using namespace std; class Solution { public: int maxUniqueSplit(string s) { // TODO: Write your code here return 0; } }; int main() { Solution sol; // Test Case 1 string input1 = "abcabc"; int output1 = sol.maxUniqueSplit(input1); cout << "maxUniqueSplit(" << input1 << ") = " << output1 << endl; // Expected: 4 // Test Case 2 string input2 = "aab"; int output2 = sol.maxUniqueSplit(input2); cout << "maxUniqueSplit(" << input2 << ") = " << output2 << endl; // Expected: 2 // Test Case 3 string input3 = "ababab"; int output3 = sol.maxUniqueSplit(input3); cout << "maxUniqueSplit(" << input3 << ") = " << output3 << endl; // Expected: 4 // Test Case 4 string input4 = ""; int output4 = sol.maxUniqueSplit(input4); cout << "maxUniqueSplit(" << input4 << ") = " << output4 << endl; // Expected: 0 // Test Case 5 string input5 = "a"; int output5 = sol.maxUniqueSplit(input5); cout << "maxUniqueSplit(" << input5 << ") = " << output5 << endl; // Expected: 1 return 0; } 6b:T60f,public class DriverCode { public static TestCaseRunResult RunTestCase(Queue inputStream) throws InvalidInputException, InvalidOutputException { if (inputStream.size() < 1) { throw new InvalidInputException(); } ArrayList testInput = new ArrayList(); testInput.add(inputStream.peek()); inputStream.remove(); Type type0 = new TypeToken(){}.getType(); String s = Parser.parse(testInput.get(0),type0); Solution sol = new Solution(); int result = sol.maxUniqueSplit(s); ArrayList userOutput = new ArrayList(); String outputType = "int"; userOutput.add(Parser.toString(result,outputType)); return new TestCaseRunResult(testInput, userOutput); } public static TestCaseVerificationResult VerifyTestCaseResult( ArrayList userOutput, Queue expectedOutputStream ) throws InvalidInputException , InvalidOutputException { if (userOutput.isEmpty()) { throw new InvalidOutputException(); } assert expectedOutputStream.size() >= 1; ArrayList expectedOutput = new ArrayList(); expectedOutput.add(expectedOutputStream.peek()); expectedOutputStream.remove(); Type type = new TypeToken(){}.getType(); boolean passed = expectedOutput.equals(userOutput); return new TestCaseVerificationResult(passed, expectedOutput); } } 6c:T439,#include #include using namespace std; class Solution { public: int maxUniqueSplit(string s) { return splitAndCount(s, 0, unordered_set()); } private: int splitAndCount(string s, int start, unordered_set set) { // base case, if we have reached the end of the input string, return the size of the set if (start == s.length()) return set.size(); int count = 0; // loop through all substrings starting from the current start position for (int i = start + 1; i <= s.length(); i++) { string string = s.substr(start, i - start); // if the substring is not in the set, add it and recursively call the function with the new start position if (set.count(string) == 0) { set.insert(string); count = max(count, splitAndCount(s, i, set)); set.erase(string); // remove the substring from the set and backtrack } } return count; // return the maximum count of unique substrings found } }; 6d:T60f,public class DriverCode { public static TestCaseRunResult RunTestCase(Queue inputStream) throws InvalidInputException, InvalidOutputException { if (inputStream.size() < 1) { throw new InvalidInputException(); } ArrayList testInput = new ArrayList(); testInput.add(inputStream.peek()); inputStream.remove(); Type type0 = new TypeToken(){}.getType(); String s = Parser.parse(testInput.get(0),type0); Solution sol = new Solution(); int result = sol.maxUniqueSplit(s); ArrayList userOutput = new ArrayList(); String outputType = "int"; userOutput.add(Parser.toString(result,outputType)); return new TestCaseRunResult(testInput, userOutput); } public static TestCaseVerificationResult VerifyTestCaseResult( ArrayList userOutput, Queue expectedOutputStream ) throws InvalidInputException , InvalidOutputException { if (userOutput.isEmpty()) { throw new InvalidOutputException(); } assert expectedOutputStream.size() >= 1; ArrayList expectedOutput = new ArrayList(); expectedOutput.add(expectedOutputStream.peek()); expectedOutputStream.remove(); Type type = new TypeToken(){}.getType(); boolean passed = expectedOutput.equals(userOutput); return new TestCaseVerificationResult(passed, expectedOutput); } } 6e:T439,#include #include using namespace std; class Solution { public: int maxUniqueSplit(string s) { return splitAndCount(s, 0, unordered_set()); } private: int splitAndCount(string s, int start, unordered_set set) { // base case, if we have reached the end of the input string, return the size of the set if (start == s.length()) return set.size(); int count = 0; // loop through all substrings starting from the current start position for (int i = start + 1; i <= s.length(); i++) { string string = s.substr(start, i - start); // if the substring is not in the set, add it and recursively call the function with the new start position if (set.count(string) == 0) { set.insert(string); count = max(count, splitAndCount(s, i, set)); set.erase(string); // remove the substring from the set and backtrack } } return count; // return the maximum count of unique substrings found } }; 6f:T562,namespace csharp.dynamic { using csharp.pkg; public class DriverCode { public static TestCaseRunResult RunTestCase(Queue inputStream) { if (inputStream.Count < 1) { throw new InvalidInputException(); } List testInput = new List(); testInput.Add(inputStream.Peek()); inputStream.Dequeue(); Type type0 = typeof(string); string s = Parser.Parse(testInput[0], type0); Solution sol = new Solution(); int result = sol.maxUniqueSplit(s); List userOutput = new List(); string outputType = "int"; userOutput.Add(Parser.ToString(result, outputType)); return new TestCaseRunResult(testInput, userOutput); } public static TestCaseVerificationResult VerifyTestCaseResult( List userOutput, Queue expectedOutputStream ) { if (userOutput.Count == 0) { throw new InvalidOutputException(); } List expectedOutput = new List(); expectedOutput.Add(expectedOutputStream.Peek()); expectedOutputStream.Dequeue(); Type type = typeof(int); bool passed = expectedOutput.SequenceEqual(userOutput); return new TestCaseVerificationResult(passed, expectedOutput); } }} 70:T421,using System; using System.Collections.Generic; public class Solution { public int maxUniqueSplit(string s) { return splitAndCount(s, 0, new HashSet()); } private int splitAndCount(string s, int start, HashSet set) { // base case, if we have reached the end of the input string, return the size of the set if (start == s.Length) return set.Count; int count = 0; // loop through all substrings starting from the current start position for (int i = start + 1; i <= s.Length; i++) { string substring = s.Substring(start, i - start); // if the substring is not in the set, add it and recursively call the function with the new start position if (set.Add(substring)) { count = Math.Max(count, splitAndCount(s, i, set)); set.Remove(substring); // remove the substring from the set and backtrack } } return count; // return the maximum count of unique substrings found } } 71:T60f,public class DriverCode { public static TestCaseRunResult RunTestCase(Queue inputStream) throws InvalidInputException, InvalidOutputException { if (inputStream.size() < 1) { throw new InvalidInputException(); } ArrayList testInput = new ArrayList(); testInput.add(inputStream.peek()); inputStream.remove(); Type type0 = new TypeToken(){}.getType(); String s = Parser.parse(testInput.get(0),type0); Solution sol = new Solution(); int result = sol.maxUniqueSplit(s); ArrayList userOutput = new ArrayList(); String outputType = "int"; userOutput.add(Parser.toString(result,outputType)); return new TestCaseRunResult(testInput, userOutput); } public static TestCaseVerificationResult VerifyTestCaseResult( ArrayList userOutput, Queue expectedOutputStream ) throws InvalidInputException , InvalidOutputException { if (userOutput.isEmpty()) { throw new InvalidOutputException(); } assert expectedOutputStream.size() >= 1; ArrayList expectedOutput = new ArrayList(); expectedOutput.add(expectedOutputStream.peek()); expectedOutputStream.remove(); Type type = new TypeToken(){}.getType(); boolean passed = expectedOutput.equals(userOutput); return new TestCaseVerificationResult(passed, expectedOutput); } } 72:T439,#include #include using namespace std; class Solution { public: int maxUniqueSplit(string s) { return splitAndCount(s, 0, unordered_set()); } private: int splitAndCount(string s, int start, unordered_set set) { // base case, if we have reached the end of the input string, return the size of the set if (start == s.length()) return set.size(); int count = 0; // loop through all substrings starting from the current start position for (int i = start + 1; i <= s.length(); i++) { string string = s.substr(start, i - start); // if the substring is not in the set, add it and recursively call the function with the new start position if (set.count(string) == 0) { set.insert(string); count = max(count, splitAndCount(s, i, set)); set.erase(string); // remove the substring from the set and backtrack } } return count; // return the maximum count of unique substrings found } }; 73:T562,namespace csharp.dynamic { using csharp.pkg; public class DriverCode { public static TestCaseRunResult RunTestCase(Queue inputStream) { if (inputStream.Count < 1) { throw new InvalidInputException(); } List testInput = new List(); testInput.Add(inputStream.Peek()); inputStream.Dequeue(); Type type0 = typeof(string); string s = Parser.Parse(testInput[0], type0); Solution sol = new Solution(); int result = sol.maxUniqueSplit(s); List userOutput = new List(); string outputType = "int"; userOutput.Add(Parser.ToString(result, outputType)); return new TestCaseRunResult(testInput, userOutput); } public static TestCaseVerificationResult VerifyTestCaseResult( List userOutput, Queue expectedOutputStream ) { if (userOutput.Count == 0) { throw new InvalidOutputException(); } List expectedOutput = new List(); expectedOutput.Add(expectedOutputStream.Peek()); expectedOutputStream.Dequeue(); Type type = typeof(int); bool passed = expectedOutput.SequenceEqual(userOutput); return new TestCaseVerificationResult(passed, expectedOutput); } }} 74:T421,using System; using System.Collections.Generic; public class Solution { public int maxUniqueSplit(string s) { return splitAndCount(s, 0, new HashSet()); } private int splitAndCount(string s, int start, HashSet set) { // base case, if we have reached the end of the input string, return the size of the set if (start == s.Length) return set.Count; int count = 0; // loop through all substrings starting from the current start position for (int i = start + 1; i <= s.Length; i++) { string substring = s.Substring(start, i - start); // if the substring is not in the set, add it and recursively call the function with the new start position if (set.Add(substring)) { count = Math.Max(count, splitAndCount(s, i, set)); set.Remove(substring); // remove the substring from the set and backtrack } } return count; // return the maximum count of unique substrings found } } 75:T594,package main import ("fmt" "os") type DriverCode struct{} func (s *DriverCode) RunTestCase(inputStream *[]string) (*TestCaseRunResult, error) { if inputStream != nil { slice := *inputStream length := len(slice) if length < 1 { return nil, NewInvalidInputException() } } testInput := []string{(*inputStream)[0]} *inputStream = (*inputStream)[1:] parser := Parser{} str, err0 := parser.parse(testInput[0], "string", "") if err0 != nil { return nil, err0 } var strParsed string = str.(string) sol := Solution{} result := sol.maxUniqueSplit(strParsed) userParsedOutput, errOutput := parser.toString(result, "int", "") if errOutput != nil { fmt.Fprintf(os.Stderr, "Runtime error: %v", errOutput) return nil, errOutput } userOutput := []string{userParsedOutput} return NewTestCaseRunResult(testInput, userOutput), nil } func (s *DriverCode) VerifyTestCaseResult(userOutput []string, expectedOutputStream *[]string) (*TestCaseVerificationResult, error) { if len(userOutput) == 0 { return nil, NewInvalidOutputException() } if len(*expectedOutputStream) < 1 { return nil, NewInvalidOutputException() } expectedOutput := []string{(*expectedOutputStream)[0]} *expectedOutputStream = (*expectedOutputStream)[1:] parser := Parser{} passed := parser.StringSliceEqual(expectedOutput, userOutput) return NewTestCaseVerificationResult(passed, expectedOutput), nil } 76:T45a,## Problem Statement 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 1**: ``` Input: s = "aab" Output: 2 Explanation: Two possible ways to split the given string into maximum unique substrings are: ['a', 'ab'] & ['aa', 'b'], both have 2 substrings; hence the maximum number of unique substrings in which the given string can be split is 2. ``` **Example 2**: ``` Input: s = "abcabc" Output: 4 Explanation: Four possible ways to split into maximum unique substrings are: ['a', 'b', 'c', 'abc'] & ['a', 'b', 'cab', 'c'] & ['a', 'bca', 'b', 'c'] & ['abc', 'a', 'b', 'c'], all have 4 substrings. ``` **Constraints:** - `1 <= s.length <= 16` - `s` contains only lower case English letters. ## Try it yourself Try solving this question here:77:T60f,public class DriverCode { public static TestCaseRunResult RunTestCase(Queue inputStream) throws InvalidInputException, InvalidOutputException { if (inputStream.size() < 1) { throw new InvalidInputException(); } ArrayList testInput = new ArrayList(); testInput.add(inputStream.peek()); inputStream.remove(); Type type0 = new TypeToken(){}.getType(); String s = Parser.parse(testInput.get(0),type0); Solution sol = new Solution(); int result = sol.maxUniqueSplit(s); ArrayList userOutput = new ArrayList(); String outputType = "int"; userOutput.add(Parser.toString(result,outputType)); return new TestCaseRunResult(testInput, userOutput); } public static TestCaseVerificationResult VerifyTestCaseResult( ArrayList userOutput, Queue expectedOutputStream ) throws InvalidInputException , InvalidOutputException { if (userOutput.isEmpty()) { throw new InvalidOutputException(); } assert expectedOutputStream.size() >= 1; ArrayList expectedOutput = new ArrayList(); expectedOutput.add(expectedOutputStream.peek()); expectedOutputStream.remove(); Type type = new TypeToken(){}.getType(); boolean passed = expectedOutput.equals(userOutput); return new TestCaseVerificationResult(passed, expectedOutput); } } 78:T439,#include #include using namespace std; class Solution { public: int maxUniqueSplit(string s) { return splitAndCount(s, 0, unordered_set()); } private: int splitAndCount(string s, int start, unordered_set set) { // base case, if we have reached the end of the input string, return the size of the set if (start == s.length()) return set.size(); int count = 0; // loop through all substrings starting from the current start position for (int i = start + 1; i <= s.length(); i++) { string string = s.substr(start, i - start); // if the substring is not in the set, add it and recursively call the function with the new start position if (set.count(string) == 0) { set.insert(string); count = max(count, splitAndCount(s, i, set)); set.erase(string); // remove the substring from the set and backtrack } } return count; // return the maximum count of unique substrings found } }; 79:T562,namespace csharp.dynamic { using csharp.pkg; public class DriverCode { public static TestCaseRunResult RunTestCase(Queue inputStream) { if (inputStream.Count < 1) { throw new InvalidInputException(); } List testInput = new List(); testInput.Add(inputStream.Peek()); inputStream.Dequeue(); Type type0 = typeof(string); string s = Parser.Parse(testInput[0], type0); Solution sol = new Solution(); int result = sol.maxUniqueSplit(s); List userOutput = new List(); string outputType = "int"; userOutput.Add(Parser.ToString(result, outputType)); return new TestCaseRunResult(testInput, userOutput); } public static TestCaseVerificationResult VerifyTestCaseResult( List userOutput, Queue expectedOutputStream ) { if (userOutput.Count == 0) { throw new InvalidOutputException(); } List expectedOutput = new List(); expectedOutput.Add(expectedOutputStream.Peek()); expectedOutputStream.Dequeue(); Type type = typeof(int); bool passed = expectedOutput.SequenceEqual(userOutput); return new TestCaseVerificationResult(passed, expectedOutput); } }} 7a:T421,using System; using System.Collections.Generic; public class Solution { public int maxUniqueSplit(string s) { return splitAndCount(s, 0, new HashSet()); } private int splitAndCount(string s, int start, HashSet set) { // base case, if we have reached the end of the input string, return the size of the set if (start == s.Length) return set.Count; int count = 0; // loop through all substrings starting from the current start position for (int i = start + 1; i <= s.Length; i++) { string substring = s.Substring(start, i - start); // if the substring is not in the set, add it and recursively call the function with the new start position if (set.Add(substring)) { count = Math.Max(count, splitAndCount(s, i, set)); set.Remove(substring); // remove the substring from the set and backtrack } } return count; // return the maximum count of unique substrings found } } 7b:T594,package main import ("fmt" "os") type DriverCode struct{} func (s *DriverCode) RunTestCase(inputStream *[]string) (*TestCaseRunResult, error) { if inputStream != nil { slice := *inputStream length := len(slice) if length < 1 { return nil, NewInvalidInputException() } } testInput := []string{(*inputStream)[0]} *inputStream = (*inputStream)[1:] parser := Parser{} str, err0 := parser.parse(testInput[0], "string", "") if err0 != nil { return nil, err0 } var strParsed string = str.(string) sol := Solution{} result := sol.maxUniqueSplit(strParsed) userParsedOutput, errOutput := parser.toString(result, "int", "") if errOutput != nil { fmt.Fprintf(os.Stderr, "Runtime error: %v", errOutput) return nil, errOutput } userOutput := []string{userParsedOutput} return NewTestCaseRunResult(testInput, userOutput), nil } func (s *DriverCode) VerifyTestCaseResult(userOutput []string, expectedOutputStream *[]string) (*TestCaseVerificationResult, error) { if len(userOutput) == 0 { return nil, NewInvalidOutputException() } if len(*expectedOutputStream) < 1 { return nil, NewInvalidOutputException() } expectedOutput := []string{(*expectedOutputStream)[0]} *expectedOutputStream = (*expectedOutputStream)[1:] parser := Parser{} passed := parser.StringSliceEqual(expectedOutput, userOutput) return NewTestCaseVerificationResult(passed, expectedOutput), nil } 9:["$","$L5e",null,{"document":{"latestDocument":{"tags":[],"updated":"2025-02-27T05:48:24.199Z","sections":[],"outline":[]},"_id":"63d50832298d8670e11747b4","owners":["636b1d083b22faa3e89b243a"],"createdAt":"2023-01-28T11:24:16.989Z","updatedAt":"2025-02-27T05:48:24.199Z","rvn":0,"oldVersions":[{"addedByAi":false,"document":{"updated":"2023-01-28T11:34:10.916Z","sections":[{"databaseExercise":{"makeReadOnly":false,"showExecuteButton":true,"showSubmitButton":false,"showRunButton":false,"showSolutionButton":false,"showSolutionCode":false,"skipOutputVerification":false,"script":[],"databaseSchema":[],"exampleTestData":[],"internalTestData":[]},"webExercise":{"makeReadOnly":false,"showSolutionCode":false,"code":[]},"codeExercise":{"executeWithCustomClasses":false,"code":[],"exampleTestCases":[],"internalTestCases":[],"makeReadOnly":false,"showExecuteButton":true,"showSubmitButton":false,"showRunButton":false,"showSolutionButton":false,"showSolutionCode":false,"skipOutputVerification":false},"markdown":{"text":"## Problem Statement\n\nGiven a string `s`, return the maximum number of unique substrings that the given string can be split into.\n\nYou 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**.\n\nA substring is a contiguous sequence of characters within a string.\n\n**Example 1**: \n```\nInput: s = \"aab\" \nOutput: 2 \nExplanation: Two possible ways to split the given string into maximum unique substrings are: ['a', 'ab'] & ['aa', 'b'], both have 2 substrings; hence the maximum number of unique substrings in which the given string can be split is 2.\n``` \n\n**Example 2**: \n```\nInput: s = \"abcabc\" \nOutput: 4 \nExplanation: Four possible ways to split into maximum unique substrings are: ['a', 'b', 'c', 'abc'] & ['a', 'b', 'cab', 'c'] & ['a', 'bca', 'b', 'c'] & ['abc', 'a', 'b', 'c'], all have 4 substrings.\n```\n\n## Try it yourself\nTry solving this question here:"},"quiz":{"options":[]},"slider":{"images":[]},"input":{"type":"text"},"productList":[],"sectionId":"63d50ef56fd4da3d333ae842","sectionType":"markdown","_id":"63d50ef56fd4da3d333ae841","collapse":[]},{"databaseExercise":{"makeReadOnly":false,"showExecuteButton":true,"showSubmitButton":false,"showRunButton":false,"showSolutionButton":false,"showSolutionCode":false,"skipOutputVerification":false,"script":[],"databaseSchema":[],"exampleTestData":[],"internalTestData":[]},"webExercise":{"makeReadOnly":false,"showSolutionCode":false,"code":[]},"codeExercise":{"executeWithCustomClasses":false,"code":[{"driverCodeGenerated":"NOT_GENERATED","language":"java","userCode":"$5f","userCodeHighlight":[],"solutionCodeHighlight":[],"_id":"636b1d083b22faa3e89b2450"},{"driverCodeGenerated":"NOT_GENERATED","language":"python3","userCode":"class Solution:\n def maxUniqueSplit(self, s: str) -> int:\n # TODO: Write your code here\n return 0\n\nif __name__ == \"__main__\":\n sol = Solution()\n\n # Test Case 1\n input1 = \"abcabc\"\n output1 = sol.maxUniqueSplit(input1)\n print(\"maxUniqueSplit(\" + input1 + \") = \" + str(output1)) # Expected: 4\n\n # Test Case 2\n input2 = \"aab\"\n output2 = sol.maxUniqueSplit(input2)\n print(\"maxUniqueSplit(\" + input2 + \") = \" + str(output2)) # Expected: 2\n\n # Test Case 3\n input3 = \"ababab\"\n output3 = sol.maxUniqueSplit(input3)\n print(\"maxUniqueSplit(\" + input3 + \") = \" + str(output3)) # Expected: 4\n\n # Test Case 4\n input4 = \"\"\n output4 = sol.maxUniqueSplit(input4)\n print(\"maxUniqueSplit(\" + input4 + \") = \" + str(output4)) # Expected: 0\n\n # Test Case 5\n input5 = \"a\"\n output5 = sol.maxUniqueSplit(input5)\n print(\"maxUniqueSplit(\" + input5 + \") = \" + str(output5)) # Expected: 1\n","userCodeHighlight":[],"solutionCodeHighlight":[],"_id":"636b1d083b22faa3e89b2451"},{"driverCodeGenerated":"NOT_GENERATED","language":"cpp","userCode":"$60","userCodeHighlight":[],"solutionCodeHighlight":[],"_id":"6388d17620aeb9f745472058"},{"driverCodeGenerated":"NOT_GENERATED","language":"javascript","userCode":"class Solution {\n maxUniqueSplit(s) {\n // TODO: Write your code here\n return 0;\n }\n}\n\nlet sol = new Solution();\n\n// Test Case 1\nlet input1 = \"abcabc\";\nlet output1 = sol.maxUniqueSplit(input1);\nconsole.log(\"maxUniqueSplit(\" + input1 + \") = \" + output1); //Expected: 4\n\n// Test Case 2\nlet input2 = \"aab\";\nlet output2 = sol.maxUniqueSplit(input2);\nconsole.log(\"maxUniqueSplit(\" + input2 + \") = \" + output2); //Expected: 2\n\n// Test Case 3\nlet input3 = \"ababab\";\nlet output3 = sol.maxUniqueSplit(input3);\nconsole.log(\"maxUniqueSplit(\" + input3 + \") = \" + output3); //Expected: 4\n\n// Test Case 4\nlet input4 = \"\";\nlet output4 = sol.maxUniqueSplit(input4);\nconsole.log(\"maxUniqueSplit(\" + input4 + \") = \" + output4); //Expected: 0\n\n// Test Case 5\nlet input5 = \"a\";\nlet output5 = sol.maxUniqueSplit(input5);\nconsole.log(\"maxUniqueSplit(\" + input5 + \") = \" + output5); //Expected: 1\n","userCodeHighlight":[],"solutionCodeHighlight":[],"_id":"6388d17620aeb9f745472059"}],"exampleTestCases":[],"internalTestCases":[],"makeReadOnly":false,"showExecuteButton":false,"showSubmitButton":false,"showRunButton":true,"showSolutionButton":false,"showSolutionCode":false,"skipOutputVerification":false},"quiz":{"options":[]},"slider":{"images":[]},"input":{"type":"text"},"productList":[],"sectionId":"63d50ef56fd4da3d333ae844","sectionType":"codeExercise","_id":"63d50ef56fd4da3d333ae843","collapse":[]}],"_id":"6490d84b9e7257c974039669","tags":[]},"versionTimestamp":"2023-01-28T11:34:10.916Z","_id":"6490d84b9e7257c974039668"},{"addedByAi":false,"document":{"updated":"2023-01-28T11:34:10.916Z","sections":[{"databaseExercise":{"makeReadOnly":false,"showExecuteButton":true,"showSubmitButton":false,"showRunButton":false,"showSolutionButton":false,"showSolutionCode":false,"skipOutputVerification":false,"script":[],"databaseSchema":[],"exampleTestData":[],"internalTestData":[]},"webExercise":{"makeReadOnly":false,"showSolutionCode":false,"code":[]},"codeExercise":{"executeWithCustomClasses":false,"code":[],"exampleTestCases":[],"internalTestCases":[],"makeReadOnly":false,"showExecuteButton":true,"showSubmitButton":false,"showRunButton":false,"showSolutionButton":false,"showSolutionCode":false,"skipOutputVerification":false},"markdown":{"text":"## Problem Statement\n\nGiven a string `s`, return the maximum number of unique substrings that the given string can be split into.\n\nYou 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**.\n\nA substring is a contiguous sequence of characters within a string.\n\n**Example 1**: \n```\nInput: s = \"aab\" \nOutput: 2 \nExplanation: Two possible ways to split the given string into maximum unique substrings are: ['a', 'ab'] & ['aa', 'b'], both have 2 substrings; hence the maximum number of unique substrings in which the given string can be split is 2.\n``` \n\n**Example 2**: \n```\nInput: s = \"abcabc\" \nOutput: 4 \nExplanation: Four possible ways to split into maximum unique substrings are: ['a', 'b', 'c', 'abc'] & ['a', 'b', 'cab', 'c'] & ['a', 'bca', 'b', 'c'] & ['abc', 'a', 'b', 'c'], all have 4 substrings.\n```\n\n## Try it yourself\nTry solving this question here:"},"quiz":{"options":[]},"slider":{"images":[]},"input":{"type":"text"},"productList":[],"sectionId":"63d50ef56fd4da3d333ae842","sectionType":"markdown","_id":"63d50ef56fd4da3d333ae841","collapse":[]},{"databaseExercise":{"makeReadOnly":false,"showExecuteButton":true,"showSubmitButton":false,"showRunButton":false,"showSolutionButton":false,"showSolutionCode":false,"skipOutputVerification":false,"script":[],"databaseSchema":[],"exampleTestData":[],"internalTestData":[]},"webExercise":{"makeReadOnly":false,"showSolutionCode":false,"code":[]},"codeExercise":{"executeWithCustomClasses":false,"code":[{"driverCodeGenerated":"NOT_GENERATED","language":"java","userCode":"$61","userCodeHighlight":[],"solutionCodeHighlight":[],"_id":"636b1d083b22faa3e89b2450"},{"driverCodeGenerated":"NOT_GENERATED","language":"python3","userCode":"class Solution:\n def maxUniqueSplit(self, s: str) -> int:\n # TODO: Write your code here\n return 0\n\nif __name__ == \"__main__\":\n sol = Solution()\n\n # Test Case 1\n input1 = \"abcabc\"\n output1 = sol.maxUniqueSplit(input1)\n print(\"maxUniqueSplit(\" + input1 + \") = \" + str(output1)) # Expected: 4\n\n # Test Case 2\n input2 = \"aab\"\n output2 = sol.maxUniqueSplit(input2)\n print(\"maxUniqueSplit(\" + input2 + \") = \" + str(output2)) # Expected: 2\n\n # Test Case 3\n input3 = \"ababab\"\n output3 = sol.maxUniqueSplit(input3)\n print(\"maxUniqueSplit(\" + input3 + \") = \" + str(output3)) # Expected: 4\n\n # Test Case 4\n input4 = \"\"\n output4 = sol.maxUniqueSplit(input4)\n print(\"maxUniqueSplit(\" + input4 + \") = \" + str(output4)) # Expected: 0\n\n # Test Case 5\n input5 = \"a\"\n output5 = sol.maxUniqueSplit(input5)\n print(\"maxUniqueSplit(\" + input5 + \") = \" + str(output5)) # Expected: 1\n","userCodeHighlight":[],"solutionCodeHighlight":[],"_id":"636b1d083b22faa3e89b2451"},{"driverCodeGenerated":"NOT_GENERATED","language":"cpp","userCode":"$62","userCodeHighlight":[],"solutionCodeHighlight":[],"_id":"6388d17620aeb9f745472058"},{"driverCodeGenerated":"NOT_GENERATED","language":"javascript","userCode":"class Solution {\n maxUniqueSplit(s) {\n // TODO: Write your code here\n return 0;\n }\n}\n\nlet sol = new Solution();\n\n// Test Case 1\nlet input1 = \"abcabc\";\nlet output1 = sol.maxUniqueSplit(input1);\nconsole.log(\"maxUniqueSplit(\" + input1 + \") = \" + output1); //Expected: 4\n\n// Test Case 2\nlet input2 = \"aab\";\nlet output2 = sol.maxUniqueSplit(input2);\nconsole.log(\"maxUniqueSplit(\" + input2 + \") = \" + output2); //Expected: 2\n\n// Test Case 3\nlet input3 = \"ababab\";\nlet output3 = sol.maxUniqueSplit(input3);\nconsole.log(\"maxUniqueSplit(\" + input3 + \") = \" + output3); //Expected: 4\n\n// Test Case 4\nlet input4 = \"\";\nlet output4 = sol.maxUniqueSplit(input4);\nconsole.log(\"maxUniqueSplit(\" + input4 + \") = \" + output4); //Expected: 0\n\n// Test Case 5\nlet input5 = \"a\";\nlet output5 = sol.maxUniqueSplit(input5);\nconsole.log(\"maxUniqueSplit(\" + input5 + \") = \" + output5); //Expected: 1\n","userCodeHighlight":[],"solutionCodeHighlight":[],"_id":"6388d17620aeb9f745472059"}],"exampleTestCases":[],"internalTestCases":[],"makeReadOnly":false,"showExecuteButton":false,"showSubmitButton":false,"showRunButton":true,"showSolutionButton":false,"showSolutionCode":false,"skipOutputVerification":false},"quiz":{"options":[]},"slider":{"images":[]},"input":{"type":"text"},"productList":[],"sectionId":"63d50ef56fd4da3d333ae844","sectionType":"codeExercise","_id":"63d50ef56fd4da3d333ae843","collapse":[]}],"_id":"64915bbef9a743d966b86b1e","tags":[]},"versionTimestamp":"2023-01-28T11:34:10.916Z","_id":"64915bbef9a743d966b86b1d"},{"addedByAi":false,"document":{"updated":"2023-01-28T11:34:10.916Z","sections":[{"databaseExercise":{"makeReadOnly":false,"showExecuteButton":true,"showSubmitButton":false,"showRunButton":false,"showSolutionButton":false,"showSolutionCode":false,"skipOutputVerification":false,"script":[],"databaseSchema":[],"exampleTestData":[],"internalTestData":[]},"webExercise":{"makeReadOnly":false,"showSolutionCode":false,"code":[]},"codeExercise":{"executeWithCustomClasses":false,"code":[],"exampleTestCases":[],"internalTestCases":[],"makeReadOnly":false,"showExecuteButton":true,"showSubmitButton":false,"showRunButton":false,"showSolutionButton":false,"showSolutionCode":false,"skipOutputVerification":false},"markdown":{"text":"## Problem Statement\n\nGiven a string `s`, return the maximum number of unique substrings that the given string can be split into.\n\nYou 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**.\n\nA substring is a contiguous sequence of characters within a string.\n\n**Example 1**: \n```\nInput: s = \"aab\" \nOutput: 2 \nExplanation: Two possible ways to split the given string into maximum unique substrings are: ['a', 'ab'] & ['aa', 'b'], both have 2 substrings; hence the maximum number of unique substrings in which the given string can be split is 2.\n``` \n\n**Example 2**: \n```\nInput: s = \"abcabc\" \nOutput: 4 \nExplanation: Four possible ways to split into maximum unique substrings are: ['a', 'b', 'c', 'abc'] & ['a', 'b', 'cab', 'c'] & ['a', 'bca', 'b', 'c'] & ['abc', 'a', 'b', 'c'], all have 4 substrings.\n```\n\n## Try it yourself\nTry solving this question here:"},"quiz":{"options":[]},"slider":{"images":[]},"input":{"type":"text"},"productList":[],"sectionId":"63d50ef56fd4da3d333ae842","sectionType":"markdown","_id":"63d50ef56fd4da3d333ae841","collapse":[]},{"databaseExercise":{"makeReadOnly":false,"showExecuteButton":true,"showSubmitButton":false,"showRunButton":false,"showSolutionButton":false,"showSolutionCode":false,"skipOutputVerification":false,"script":[],"databaseSchema":[],"exampleTestData":[],"internalTestData":[]},"webExercise":{"makeReadOnly":false,"showSolutionCode":false,"code":[]},"codeExercise":{"executeWithCustomClasses":false,"code":[{"driverCodeGenerated":"NOT_GENERATED","language":"java","userCode":"$63","userCodeHighlight":[],"solutionCodeHighlight":[],"_id":"636b1d083b22faa3e89b2450"},{"driverCodeGenerated":"NOT_GENERATED","language":"python3","userCode":"class Solution:\n def maxUniqueSplit(self, s: str) -> int:\n # TODO: Write your code here\n return 0\n\nif __name__ == \"__main__\":\n sol = Solution()\n\n # Test Case 1\n input1 = \"abcabc\"\n output1 = sol.maxUniqueSplit(input1)\n print(\"maxUniqueSplit(\" + input1 + \") = \" + str(output1)) # Expected: 4\n\n # Test Case 2\n input2 = \"aab\"\n output2 = sol.maxUniqueSplit(input2)\n print(\"maxUniqueSplit(\" + input2 + \") = \" + str(output2)) # Expected: 2\n\n # Test Case 3\n input3 = \"ababab\"\n output3 = sol.maxUniqueSplit(input3)\n print(\"maxUniqueSplit(\" + input3 + \") = \" + str(output3)) # Expected: 4\n\n # Test Case 4\n input4 = \"\"\n output4 = sol.maxUniqueSplit(input4)\n print(\"maxUniqueSplit(\" + input4 + \") = \" + str(output4)) # Expected: 0\n\n # Test Case 5\n input5 = \"a\"\n output5 = sol.maxUniqueSplit(input5)\n print(\"maxUniqueSplit(\" + input5 + \") = \" + str(output5)) # Expected: 1\n","userCodeHighlight":[],"solutionCodeHighlight":[],"_id":"636b1d083b22faa3e89b2451"},{"driverCodeGenerated":"NOT_GENERATED","language":"cpp","userCode":"$64","userCodeHighlight":[],"solutionCodeHighlight":[],"_id":"6388d17620aeb9f745472058"},{"driverCodeGenerated":"NOT_GENERATED","language":"javascript","userCode":"class Solution {\n maxUniqueSplit(s) {\n // TODO: Write your code here\n return 0;\n }\n}\n\nlet sol = new Solution();\n\n// Test Case 1\nlet input1 = \"abcabc\";\nlet output1 = sol.maxUniqueSplit(input1);\nconsole.log(\"maxUniqueSplit(\" + input1 + \") = \" + output1); //Expected: 4\n\n// Test Case 2\nlet input2 = \"aab\";\nlet output2 = sol.maxUniqueSplit(input2);\nconsole.log(\"maxUniqueSplit(\" + input2 + \") = \" + output2); //Expected: 2\n\n// Test Case 3\nlet input3 = \"ababab\";\nlet output3 = sol.maxUniqueSplit(input3);\nconsole.log(\"maxUniqueSplit(\" + input3 + \") = \" + output3); //Expected: 4\n\n// Test Case 4\nlet input4 = \"\";\nlet output4 = sol.maxUniqueSplit(input4);\nconsole.log(\"maxUniqueSplit(\" + input4 + \") = \" + output4); //Expected: 0\n\n// Test Case 5\nlet input5 = \"a\";\nlet output5 = sol.maxUniqueSplit(input5);\nconsole.log(\"maxUniqueSplit(\" + input5 + \") = \" + output5); //Expected: 1\n","userCodeHighlight":[],"solutionCodeHighlight":[],"_id":"6388d17620aeb9f745472059"}],"exampleTestCases":[],"internalTestCases":[],"makeReadOnly":false,"showExecuteButton":false,"showSubmitButton":false,"showRunButton":true,"showSolutionButton":false,"showSolutionCode":false,"skipOutputVerification":false},"quiz":{"options":[]},"slider":{"images":[]},"input":{"type":"text"},"productList":[],"sectionId":"63d50ef56fd4da3d333ae844","sectionType":"codeExercise","_id":"63d50ef56fd4da3d333ae843","collapse":[]}],"_id":"6491658535a7c730084bae41","tags":[]},"versionTimestamp":"2023-01-28T11:34:10.916Z","_id":"6491658535a7c730084bae40"},{"addedByAi":false,"document":{"updated":"2023-01-28T11:34:10.916Z","sections":[{"databaseExercise":{"makeReadOnly":false,"showExecuteButton":true,"showSubmitButton":false,"showRunButton":false,"showSolutionButton":false,"showSolutionCode":false,"skipOutputVerification":false,"script":[],"databaseSchema":[],"exampleTestData":[],"internalTestData":[]},"webExercise":{"makeReadOnly":false,"showSolutionCode":false,"code":[]},"codeExercise":{"executeWithCustomClasses":false,"code":[],"exampleTestCases":[],"internalTestCases":[],"makeReadOnly":false,"showExecuteButton":true,"showSubmitButton":false,"showRunButton":false,"showSolutionButton":false,"showSolutionCode":false,"skipOutputVerification":false},"markdown":{"text":"## Problem Statement\n\nGiven a string `s`, return the maximum number of unique substrings that the given string can be split into.\n\nYou 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**.\n\nA substring is a contiguous sequence of characters within a string.\n\n**Example 1**: \n```\nInput: s = \"aab\" \nOutput: 2 \nExplanation: Two possible ways to split the given string into maximum unique substrings are: ['a', 'ab'] & ['aa', 'b'], both have 2 substrings; hence the maximum number of unique substrings in which the given string can be split is 2.\n``` \n\n**Example 2**: \n```\nInput: s = \"abcabc\" \nOutput: 4 \nExplanation: Four possible ways to split into maximum unique substrings are: ['a', 'b', 'c', 'abc'] & ['a', 'b', 'cab', 'c'] & ['a', 'bca', 'b', 'c'] & ['abc', 'a', 'b', 'c'], all have 4 substrings.\n```\n\n## Try it yourself\nTry solving this question here:"},"quiz":{"options":[]},"slider":{"images":[]},"input":{"type":"text"},"productList":[],"sectionId":"63d50ef56fd4da3d333ae842","sectionType":"markdown","_id":"63d50ef56fd4da3d333ae841","collapse":[]},{"databaseExercise":{"makeReadOnly":false,"showExecuteButton":true,"showSubmitButton":false,"showRunButton":false,"showSolutionButton":false,"showSolutionCode":false,"skipOutputVerification":false,"script":[],"databaseSchema":[],"exampleTestData":[],"internalTestData":[]},"webExercise":{"makeReadOnly":false,"showSolutionCode":false,"code":[]},"codeExercise":{"executeWithCustomClasses":false,"code":[{"driverCodeGenerated":"NOT_GENERATED","language":"java","userCode":"$65","userCodeHighlight":[],"solutionCodeHighlight":[],"_id":"636b1d083b22faa3e89b2450"},{"driverCodeGenerated":"NOT_GENERATED","language":"python3","userCode":"class Solution:\n def maxUniqueSplit(self, s: str) -> int:\n # TODO: Write your code here\n return 0\n\nif __name__ == \"__main__\":\n sol = Solution()\n\n # Test Case 1\n input1 = \"abcabc\"\n output1 = sol.maxUniqueSplit(input1)\n print(\"maxUniqueSplit(\" + input1 + \") = \" + str(output1)) # Expected: 4\n\n # Test Case 2\n input2 = \"aab\"\n output2 = sol.maxUniqueSplit(input2)\n print(\"maxUniqueSplit(\" + input2 + \") = \" + str(output2)) # Expected: 2\n\n # Test Case 3\n input3 = \"ababab\"\n output3 = sol.maxUniqueSplit(input3)\n print(\"maxUniqueSplit(\" + input3 + \") = \" + str(output3)) # Expected: 4\n\n # Test Case 4\n input4 = \"\"\n output4 = sol.maxUniqueSplit(input4)\n print(\"maxUniqueSplit(\" + input4 + \") = \" + str(output4)) # Expected: 0\n\n # Test Case 5\n input5 = \"a\"\n output5 = sol.maxUniqueSplit(input5)\n print(\"maxUniqueSplit(\" + input5 + \") = \" + str(output5)) # Expected: 1\n","userCodeHighlight":[],"solutionCodeHighlight":[],"_id":"636b1d083b22faa3e89b2451"},{"driverCodeGenerated":"NOT_GENERATED","language":"cpp","userCode":"$66","userCodeHighlight":[],"solutionCodeHighlight":[],"_id":"6388d17620aeb9f745472058"},{"driverCodeGenerated":"NOT_GENERATED","language":"javascript","userCode":"class Solution {\n maxUniqueSplit(s) {\n // TODO: Write your code here\n return 0;\n }\n}\n\nlet sol = new Solution();\n\n// Test Case 1\nlet input1 = \"abcabc\";\nlet output1 = sol.maxUniqueSplit(input1);\nconsole.log(\"maxUniqueSplit(\" + input1 + \") = \" + output1); //Expected: 4\n\n// Test Case 2\nlet input2 = \"aab\";\nlet output2 = sol.maxUniqueSplit(input2);\nconsole.log(\"maxUniqueSplit(\" + input2 + \") = \" + output2); //Expected: 2\n\n// Test Case 3\nlet input3 = \"ababab\";\nlet output3 = sol.maxUniqueSplit(input3);\nconsole.log(\"maxUniqueSplit(\" + input3 + \") = \" + output3); //Expected: 4\n\n// Test Case 4\nlet input4 = \"\";\nlet output4 = sol.maxUniqueSplit(input4);\nconsole.log(\"maxUniqueSplit(\" + input4 + \") = \" + output4); //Expected: 0\n\n// Test Case 5\nlet input5 = \"a\";\nlet output5 = sol.maxUniqueSplit(input5);\nconsole.log(\"maxUniqueSplit(\" + input5 + \") = \" + output5); //Expected: 1\n","userCodeHighlight":[],"solutionCodeHighlight":[],"_id":"6388d17620aeb9f745472059"}],"exampleTestCases":[],"internalTestCases":[],"makeReadOnly":false,"showExecuteButton":false,"showSubmitButton":false,"showRunButton":true,"showSolutionButton":false,"showSolutionCode":false,"skipOutputVerification":false},"quiz":{"options":[]},"slider":{"images":[]},"input":{"type":"text"},"productList":[],"sectionId":"63d50ef56fd4da3d333ae844","sectionType":"codeExercise","_id":"63d50ef56fd4da3d333ae843","collapse":[]}],"_id":"64916da45ee73601daed01b0","tags":[]},"versionTimestamp":"2023-01-28T11:34:10.916Z","_id":"64916da45ee73601daed01af"},{"addedByAi":false,"document":{"updated":"2023-01-28T11:34:10.916Z","sections":[{"databaseExercise":{"makeReadOnly":false,"showExecuteButton":true,"showSubmitButton":false,"showRunButton":false,"showSolutionButton":false,"showSolutionCode":false,"skipOutputVerification":false,"script":[],"databaseSchema":[],"exampleTestData":[],"internalTestData":[]},"webExercise":{"makeReadOnly":false,"showSolutionCode":false,"code":[]},"codeExercise":{"executeWithCustomClasses":false,"code":[],"exampleTestCases":[],"internalTestCases":[],"makeReadOnly":false,"showExecuteButton":true,"showSubmitButton":false,"showRunButton":false,"showSolutionButton":false,"showSolutionCode":false,"skipOutputVerification":false},"markdown":{"text":"## Problem Statement\n\nGiven a string `s`, return the maximum number of unique substrings that the given string can be split into.\n\nYou 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**.\n\nA substring is a contiguous sequence of characters within a string.\n\n**Example 1**: \n```\nInput: s = \"aab\" \nOutput: 2 \nExplanation: Two possible ways to split the given string into maximum unique substrings are: ['a', 'ab'] & ['aa', 'b'], both have 2 substrings; hence the maximum number of unique substrings in which the given string can be split is 2.\n``` \n\n**Example 2**: \n```\nInput: s = \"abcabc\" \nOutput: 4 \nExplanation: Four possible ways to split into maximum unique substrings are: ['a', 'b', 'c', 'abc'] & ['a', 'b', 'cab', 'c'] & ['a', 'bca', 'b', 'c'] & ['abc', 'a', 'b', 'c'], all have 4 substrings.\n```\n\n## Try it yourself\nTry solving this question here:"},"quiz":{"options":[]},"slider":{"images":[]},"input":{"type":"text"},"productList":[],"sectionId":"63d50ef56fd4da3d333ae842","sectionType":"markdown","_id":"63d50ef56fd4da3d333ae841","collapse":[]},{"databaseExercise":{"makeReadOnly":false,"showExecuteButton":true,"showSubmitButton":false,"showRunButton":false,"showSolutionButton":false,"showSolutionCode":false,"skipOutputVerification":false,"script":[],"databaseSchema":[],"exampleTestData":[],"internalTestData":[]},"webExercise":{"makeReadOnly":false,"showSolutionCode":false,"code":[]},"codeExercise":{"executeWithCustomClasses":false,"code":[{"driverCodeGenerated":"NOT_GENERATED","language":"java","userCode":"$67","userCodeHighlight":[],"solutionCodeHighlight":[],"_id":"636b1d083b22faa3e89b2450"},{"driverCodeGenerated":"NOT_GENERATED","language":"python3","userCode":"class Solution:\n def maxUniqueSplit(self, s: str) -> int:\n # TODO: Write your code here\n return 0\n\nif __name__ == \"__main__\":\n sol = Solution()\n\n # Test Case 1\n input1 = \"abcabc\"\n output1 = sol.maxUniqueSplit(input1)\n print(\"maxUniqueSplit(\" + input1 + \") = \" + str(output1)) # Expected: 4\n\n # Test Case 2\n input2 = \"aab\"\n output2 = sol.maxUniqueSplit(input2)\n print(\"maxUniqueSplit(\" + input2 + \") = \" + str(output2)) # Expected: 2\n\n # Test Case 3\n input3 = \"ababab\"\n output3 = sol.maxUniqueSplit(input3)\n print(\"maxUniqueSplit(\" + input3 + \") = \" + str(output3)) # Expected: 4\n\n # Test Case 4\n input4 = \"\"\n output4 = sol.maxUniqueSplit(input4)\n print(\"maxUniqueSplit(\" + input4 + \") = \" + str(output4)) # Expected: 0\n\n # Test Case 5\n input5 = \"a\"\n output5 = sol.maxUniqueSplit(input5)\n print(\"maxUniqueSplit(\" + input5 + \") = \" + str(output5)) # Expected: 1\n","userCodeHighlight":[],"solutionCodeHighlight":[],"_id":"636b1d083b22faa3e89b2451"},{"driverCodeGenerated":"NOT_GENERATED","language":"cpp","userCode":"$68","userCodeHighlight":[],"solutionCodeHighlight":[],"_id":"6388d17620aeb9f745472058"},{"driverCodeGenerated":"NOT_GENERATED","language":"javascript","userCode":"class Solution {\n maxUniqueSplit(s) {\n // TODO: Write your code here\n return 0;\n }\n}\n\nlet sol = new Solution();\n\n// Test Case 1\nlet input1 = \"abcabc\";\nlet output1 = sol.maxUniqueSplit(input1);\nconsole.log(\"maxUniqueSplit(\" + input1 + \") = \" + output1); //Expected: 4\n\n// Test Case 2\nlet input2 = \"aab\";\nlet output2 = sol.maxUniqueSplit(input2);\nconsole.log(\"maxUniqueSplit(\" + input2 + \") = \" + output2); //Expected: 2\n\n// Test Case 3\nlet input3 = \"ababab\";\nlet output3 = sol.maxUniqueSplit(input3);\nconsole.log(\"maxUniqueSplit(\" + input3 + \") = \" + output3); //Expected: 4\n\n// Test Case 4\nlet input4 = \"\";\nlet output4 = sol.maxUniqueSplit(input4);\nconsole.log(\"maxUniqueSplit(\" + input4 + \") = \" + output4); //Expected: 0\n\n// Test Case 5\nlet input5 = \"a\";\nlet output5 = sol.maxUniqueSplit(input5);\nconsole.log(\"maxUniqueSplit(\" + input5 + \") = \" + output5); //Expected: 1\n","userCodeHighlight":[],"solutionCodeHighlight":[],"_id":"6388d17620aeb9f745472059"}],"exampleTestCases":[],"internalTestCases":[],"makeReadOnly":false,"showExecuteButton":false,"showSubmitButton":false,"showRunButton":true,"showSolutionButton":false,"showSolutionCode":false,"skipOutputVerification":false},"quiz":{"options":[]},"slider":{"images":[]},"input":{"type":"text"},"productList":[],"sectionId":"63d50ef56fd4da3d333ae844","sectionType":"codeExercise","_id":"63d50ef56fd4da3d333ae843","collapse":[]}],"_id":"649177b45729d176d6540409","tags":[]},"versionTimestamp":"2023-01-28T11:34:10.916Z","_id":"649177b45729d176d6540408"},{"addedByAi":false,"document":{"updated":"2023-01-28T11:34:10.916Z","sections":[{"databaseExercise":{"makeReadOnly":false,"showExecuteButton":true,"showSubmitButton":false,"showRunButton":false,"showSolutionButton":false,"showSolutionCode":false,"skipOutputVerification":false,"script":[],"databaseSchema":[],"exampleTestData":[],"internalTestData":[]},"webExercise":{"makeReadOnly":false,"showSolutionCode":false,"code":[]},"codeExercise":{"executeWithCustomClasses":false,"code":[],"exampleTestCases":[],"internalTestCases":[],"makeReadOnly":false,"showExecuteButton":true,"showSubmitButton":false,"showRunButton":false,"showSolutionButton":false,"showSolutionCode":false,"skipOutputVerification":false},"markdown":{"text":"## Problem Statement\n\nGiven a string `s`, return the maximum number of unique substrings that the given string can be split into.\n\nYou 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**.\n\nA substring is a contiguous sequence of characters within a string.\n\n**Example 1**: \n```\nInput: s = \"aab\" \nOutput: 2 \nExplanation: Two possible ways to split the given string into maximum unique substrings are: ['a', 'ab'] & ['aa', 'b'], both have 2 substrings; hence the maximum number of unique substrings in which the given string can be split is 2.\n``` \n\n**Example 2**: \n```\nInput: s = \"abcabc\" \nOutput: 4 \nExplanation: Four possible ways to split into maximum unique substrings are: ['a', 'b', 'c', 'abc'] & ['a', 'b', 'cab', 'c'] & ['a', 'bca', 'b', 'c'] & ['abc', 'a', 'b', 'c'], all have 4 substrings.\n```\n\n## Try it yourself\nTry solving this question here:"},"quiz":{"options":[]},"slider":{"images":[]},"input":{"type":"text"},"productList":[],"sectionId":"63d50ef56fd4da3d333ae842","sectionType":"markdown","_id":"63d50ef56fd4da3d333ae841","collapse":[]},{"databaseExercise":{"makeReadOnly":false,"showExecuteButton":true,"showSubmitButton":false,"showRunButton":false,"showSolutionButton":false,"showSolutionCode":false,"skipOutputVerification":false,"script":[],"databaseSchema":[],"exampleTestData":[],"internalTestData":[]},"webExercise":{"makeReadOnly":false,"showSolutionCode":false,"code":[]},"codeExercise":{"executeWithCustomClasses":false,"code":[{"driverCodeGenerated":"NOT_GENERATED","language":"java","userCode":"$69","userCodeHighlight":[],"solutionCodeHighlight":[],"_id":"636b1d083b22faa3e89b2450"},{"driverCodeGenerated":"NOT_GENERATED","language":"python3","userCode":"class Solution:\n def maxUniqueSplit(self, s: str) -> int:\n # TODO: Write your code here\n return 0\n\nif __name__ == \"__main__\":\n sol = Solution()\n\n # Test Case 1\n input1 = \"abcabc\"\n output1 = sol.maxUniqueSplit(input1)\n print(\"maxUniqueSplit(\" + input1 + \") = \" + str(output1)) # Expected: 4\n\n # Test Case 2\n input2 = \"aab\"\n output2 = sol.maxUniqueSplit(input2)\n print(\"maxUniqueSplit(\" + input2 + \") = \" + str(output2)) # Expected: 2\n\n # Test Case 3\n input3 = \"ababab\"\n output3 = sol.maxUniqueSplit(input3)\n print(\"maxUniqueSplit(\" + input3 + \") = \" + str(output3)) # Expected: 4\n\n # Test Case 4\n input4 = \"\"\n output4 = sol.maxUniqueSplit(input4)\n print(\"maxUniqueSplit(\" + input4 + \") = \" + str(output4)) # Expected: 0\n\n # Test Case 5\n input5 = \"a\"\n output5 = sol.maxUniqueSplit(input5)\n print(\"maxUniqueSplit(\" + input5 + \") = \" + str(output5)) # Expected: 1\n","userCodeHighlight":[],"solutionCodeHighlight":[],"_id":"636b1d083b22faa3e89b2451"},{"driverCodeGenerated":"NOT_GENERATED","language":"cpp","userCode":"$6a","userCodeHighlight":[],"solutionCodeHighlight":[],"_id":"6388d17620aeb9f745472058"},{"driverCodeGenerated":"NOT_GENERATED","language":"javascript","userCode":"class Solution {\n maxUniqueSplit(s) {\n // TODO: Write your code here\n return 0;\n }\n}\n\nlet sol = new Solution();\n\n// Test Case 1\nlet input1 = \"abcabc\";\nlet output1 = sol.maxUniqueSplit(input1);\nconsole.log(\"maxUniqueSplit(\" + input1 + \") = \" + output1); //Expected: 4\n\n// Test Case 2\nlet input2 = \"aab\";\nlet output2 = sol.maxUniqueSplit(input2);\nconsole.log(\"maxUniqueSplit(\" + input2 + \") = \" + output2); //Expected: 2\n\n// Test Case 3\nlet input3 = \"ababab\";\nlet output3 = sol.maxUniqueSplit(input3);\nconsole.log(\"maxUniqueSplit(\" + input3 + \") = \" + output3); //Expected: 4\n\n// Test Case 4\nlet input4 = \"\";\nlet output4 = sol.maxUniqueSplit(input4);\nconsole.log(\"maxUniqueSplit(\" + input4 + \") = \" + output4); //Expected: 0\n\n// Test Case 5\nlet input5 = \"a\";\nlet output5 = sol.maxUniqueSplit(input5);\nconsole.log(\"maxUniqueSplit(\" + input5 + \") = \" + output5); //Expected: 1\n","userCodeHighlight":[],"solutionCodeHighlight":[],"_id":"6388d17620aeb9f745472059"}],"exampleTestCases":[],"internalTestCases":[],"makeReadOnly":false,"showExecuteButton":false,"showSubmitButton":false,"showRunButton":true,"showSolutionButton":false,"showSolutionCode":false,"skipOutputVerification":false},"quiz":{"options":[]},"slider":{"images":[]},"input":{"type":"text"},"productList":[],"sectionId":"63d50ef56fd4da3d333ae844","sectionType":"codeExercise","_id":"63d50ef56fd4da3d333ae843","collapse":[]}],"_id":"64928780de16969a47cafa48","tags":[]},"versionTimestamp":"2023-01-28T11:34:10.916Z","_id":"64928780de16969a47cafa47"},{"addedByAi":false,"document":{"updated":"2023-01-28T11:34:10.916Z","sections":[{"databaseExercise":{"makeReadOnly":false,"showExecuteButton":true,"showSubmitButton":false,"showRunButton":false,"showSolutionButton":false,"showSolutionCode":false,"skipOutputVerification":false,"script":[],"databaseSchema":[],"exampleTestData":[],"internalTestData":[]},"webExercise":{"makeReadOnly":false,"showSolutionCode":false,"code":[]},"codeExercise":{"executeWithCustomClasses":false,"code":[],"exampleTestCases":[],"internalTestCases":[],"makeReadOnly":false,"showExecuteButton":true,"showSubmitButton":false,"showRunButton":false,"showSolutionButton":false,"showSolutionCode":false,"skipOutputVerification":false},"markdown":{"text":"## Problem Statement \n\nGiven a string `s`, return the maximum number of unique substrings that the given string can be split into.\n\nYou 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**.\n\nA substring is a contiguous sequence of characters within a string.\n\n**Example 1**: \n```\nInput: s = \"aab\" \nOutput: 2 \nExplanation: Two possible ways to split the given string into maximum unique substrings are: ['a', 'ab'] & ['aa', 'b'], both have 2 substrings; hence the maximum number of unique substrings in which the given string can be split is 2.\n``` \n\n**Example 2**: \n```\nInput: s = \"abcabc\" \nOutput: 4 \nExplanation: Four possible ways to split into maximum unique substrings are: ['a', 'b', 'c', 'abc'] & ['a', 'b', 'cab', 'c'] & ['a', 'bca', 'b', 'c'] & ['abc', 'a', 'b', 'c'], all have 4 substrings.\n```\n\n## Try it yourself\nTry solving this question here:"},"quiz":{"options":[]},"slider":{"images":[]},"input":{"type":"text"},"productList":[],"sectionId":"63d50ef56fd4da3d333ae842","sectionType":"markdown","_id":"63d50ef56fd4da3d333ae841","collapse":[]},{"databaseExercise":{"makeReadOnly":false,"showExecuteButton":true,"showSubmitButton":false,"showRunButton":false,"showSolutionButton":false,"showSolutionCode":false,"skipOutputVerification":false,"script":[],"databaseSchema":[],"exampleTestData":[],"internalTestData":[]},"webExercise":{"makeReadOnly":false,"showSolutionCode":false,"code":[]},"codeExercise":{"executeWithCustomClasses":false,"code":[{"driverCodeGenerated":"NOT_GENERATED","language":"java","userCode":"import java.util.HashSet;\nimport java.util.Set;\n\nclass Solution {\n public int maxUniqueSplit(String s) {\n // TODO: Write your code here\n return 0;\n }\n }\n","userCodeHighlight":[],"driverCode":"$6b","solutionCode":"import java.util.HashSet;\nimport java.util.Set;\n\nclass Solution {\n public int maxUniqueSplit(String s) {\n return splitAndCount(s, 0, new HashSet<>());\n }\n\n private int splitAndCount(String s, int start, Set set) {\n // base case, if we have reached the end of the input string, return the size of the set\n if (start == s.length())\n return set.size();\n\n int count = 0;\n // loop through all substrings starting from the current start position\n for (int i = start + 1; i <= s.length(); i++) {\n String string = s.substring(start, i);\n // if the substring is not in the set, add it and recursively call the function with the new start position\n if (set.add(string)) {\n count = Math.max(count, splitAndCount(s, i, set));\n set.remove(string); // remove the substring from the set and backtrack\n }\n }\n return count; // return the maximum count of unique substrings found\n }\n }\n","solutionCodeHighlight":[],"_id":"636b1d083b22faa3e89b2450"},{"driverCodeGenerated":"NOT_GENERATED","language":"python3","userCode":"class Solution:\n def maxUniqueSplit(self, s: str) -> int:\n # TODO: Write your code here\n return 0\n","userCodeHighlight":[],"driverCode":"def RunTestCase(inputStream: deque):\n if len(inputStream) < 1:\n raise InvalidInputException()\n\n testInput: List[str] = [inputStream.popleft()]\n s = Parser.parse(testInput[0],'str')\n\n sol = Solution()\n userResult = sol.maxUniqueSplit(s)\n\n userOutput: List[str] = [Parser.toStr(userResult,'int')]\n\n return TestCaseRunResult(testInput=testInput, userOutput=userOutput)\n\ndef VerifyTestCaseResult(userOutput: List[str], expectedOutputStream: deque) -> TestCaseVerificationResult:\n if len(userOutput) == 0:\n raise InvalidInputException()\n assert len(expectedOutputStream) >= 1\n\n # consume lines from expectedOutputStream\n expectedOutput: List[str] = [expectedOutputStream.popleft()]\n\n # Method#1 (compare using strings)\n passed: bool = userOutput == expectedOutput\n\n return TestCaseVerificationResult(passed, expectedOutput)","solutionCode":"class Solution:\n def maxUniqueSplit(self, s: str) -> int:\n return self.splitAndCount(s, 0, set())\n\n def splitAndCount(self, s: str, start: int, set) -> int:\n # base case, if we have reached the end of the input string, return the size of the set\n if start == len(s):\n return len(set)\n\n count = 0\n # loop through all substrings starting from the current start position\n for i in range(start + 1, len(s) + 1):\n string = s[start:i]\n # if the substring is not in the set, add it and recursively call the function with the new start position\n if string not in set:\n set.add(string)\n count = max(count, self.splitAndCount(s, i, set))\n set.remove(string) # remove the substring from the set and backtrack\n\n return count # return the maximum count of unique substrings found\n","solutionCodeHighlight":[],"_id":"636b1d083b22faa3e89b2451"},{"driverCodeGenerated":"NOT_GENERATED","language":"cpp","userCode":"#include \n#include \nusing namespace std;\n\nclass Solution\n{\npublic:\n int maxUniqueSplit(string s)\n {\n // TODO: Write your code here\n return 0;\n }\n};\n","userCodeHighlight":[],"driverCode":"TestCaseRunResult RunTestCase(queue& inputStream) {\n if (inputStream.size() < 1) {\n throw InvalidInputException();\n }\n vector testInput;\n testInput.push_back(inputStream.front()); inputStream.pop();\n auto s = parseString(testInput[0]);\n Solution sol;\n int result = sol.maxUniqueSplit(s);\n\n vector userOutput;\n userOutput.push_back(toString(result));\n return TestCaseRunResult(testInput, userOutput);\n}\n\nTestCaseVerificationResult VerifyTestCaseResult(const vector& userOutput, queue& expectedOutputStream) {\n if (userOutput.empty()) {\n throw InvalidOutputException();\n }\n ASSERT(expectedOutputStream.size() >= 1);\n vector expectedOutput;\n expectedOutput.push_back(expectedOutputStream.front());\n expectedOutputStream.pop();\n bool passed = userOutput[0].compare(expectedOutput[0]) == 0;\n return TestCaseVerificationResult(passed, expectedOutput);\n}\n","solutionCode":"$6c","solutionCodeHighlight":[],"_id":"6388d17620aeb9f745472058"},{"driverCodeGenerated":"NOT_GENERATED","language":"javascript","userCode":"class Solution {\n maxUniqueSplit(s) {\n // TODO: Write your code here\n return 0;\n }\n}\n","userCodeHighlight":[],"driverCode":"RunTestCase = function(inputStream) {\n if (inputStream.length < 1) {\n throw new InvalidInputException();\n }\n // consume input lines required for this test\n let testInput = inputStream.splice(0,1);\n const s = parse(testInput[0],'string');\n let sol = new Solution();\n let userResult = sol.maxUniqueSplit(s);\n let userOutput = [];\n userOutput.push(toStr(userResult,'number'));\n\n return {\n testInput: testInput,\n userOutput: userOutput,\n };\n}\n\nVerifyTestCaseResult = function(userOutput, expectedOutputStream) {\n if (userOutput.length == 0) {\n throw new InvalidOutputException();\n }\n assert(expectedOutputStream.length >= 1);\n let expectedOutput = expectedOutputStream.splice(0, 1);\n\n const passed = JSON.stringify(userOutput) == JSON.stringify(expectedOutput);\n\n return {\n passed: passed,\n expectedOutput: expectedOutput,\n };\n}","solutionCode":"class Solution {\n maxUniqueSplit(s) {\n return this.splitAndCount(s, 0, new Set());\n }\n\n splitAndCount(s, start, set) {\n // base case, if we have reached the end of the input string, return the size of the set\n if (start === s.length)\n return set.size;\n\n let count = 0;\n // loop through all substrings starting from the current start position\n for (let i = start + 1; i <= s.length; i++) {\n let string = s.substring(start, i);\n // if the substring is not in the set, add it and recursively call the function with the new start position\n if (!set.has(string)) {\n set.add(string);\n count = Math.max(count, this.splitAndCount(s, i, set));\n set.delete(string); // remove the substring from the set and backtrack\n }\n }\n return count; // return the maximum count of unique substrings found\n }\n}\n","solutionCodeHighlight":[],"_id":"6388d17620aeb9f745472059"}],"exampleTestCases":[{"input":"\"abcabc\"\n","expectedOutput":"4\n","_id":"63b877d6a4deb0091e9f8da1"},{"input":"\"aab\"\n","expectedOutput":"2\n","_id":"63b877d6a4deb0091e9f8da2"},{"input":"\"ababab\"\n","expectedOutput":"4\n","_id":"63b877d6a4deb0091e9f8da3"}],"internalTestCases":[{"input":"\"abcabc\"\n","expectedOutput":"4\n","_id":"63b877d6a4deb0091e9f8da1"},{"input":"\"aab\"\n","expectedOutput":"2\n","_id":"63b877d6a4deb0091e9f8da2"},{"input":"\"ababab\"\n","expectedOutput":"4\n","_id":"63b877d6a4deb0091e9f8da3"},{"input":"\"\"\n","expectedOutput":"0\n","_id":"63b877d6a4deb0091e9f8da4"},{"input":"\"a\"\n","expectedOutput":"1\n","_id":"63b877d6a4deb0091e9f8da5"},{"input":"\"aaaaa\"\n","expectedOutput":"2\n","_id":"63b877d6a4deb0091e9f8da6"},{"input":"\"abc\"\n","expectedOutput":"3\n","_id":"63b877d6a4deb0091e9f8da7"},{"input":"\"abacabadabacaba\"\n","expectedOutput":"8\n","_id":"63b877d6a4deb0091e9f8da8"},{"input":"\"abcdabcdabcdabcd\"\n","expectedOutput":"9\n","_id":"63b877d6a4deb0091e9f8da9"}],"makeReadOnly":false,"showExecuteButton":true,"showSubmitButton":true,"showRunButton":false,"showSolutionButton":false,"showSolutionCode":false,"skipOutputVerification":false},"quiz":{"options":[]},"slider":{"images":[]},"input":{"type":"text"},"productList":[],"sectionId":"63d50ef56fd4da3d333ae844","sectionType":"codeExercise","_id":"63d50ef56fd4da3d333ae843","collapse":[]}],"_id":"6509787c72a0549f20e84408","tags":[]},"versionTimestamp":"2023-01-28T11:34:10.916Z","_id":"6509787c72a0549f20e84407"},{"addedByAi":false,"document":{"updated":"2023-10-23T12:38:08.449Z","sections":[{"databaseExercise":{"makeReadOnly":false,"showExecuteButton":true,"showSubmitButton":false,"showRunButton":false,"showSolutionButton":false,"showSolutionCode":false,"skipOutputVerification":false,"script":[],"databaseSchema":[],"exampleTestData":[],"internalTestData":[]},"webExercise":{"makeReadOnly":false,"showSolutionCode":false,"code":[]},"codeExercise":{"executeWithCustomClasses":false,"code":[],"exampleTestCases":[],"internalTestCases":[],"makeReadOnly":false,"showExecuteButton":true,"showSubmitButton":false,"showRunButton":false,"showSolutionButton":false,"showSolutionCode":false,"skipOutputVerification":false},"markdown":{"text":"## Problem Statement \n\nGiven a string `s`, return the maximum number of unique substrings that the given string can be split into.\n\nYou 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**.\n\nA substring is a contiguous sequence of characters within a string.\n\n**Example 1**: \n```\nInput: s = \"aab\" \nOutput: 2 \nExplanation: Two possible ways to split the given string into maximum unique substrings are: ['a', 'ab'] & ['aa', 'b'], both have 2 substrings; hence the maximum number of unique substrings in which the given string can be split is 2.\n``` \n\n**Example 2**: \n```\nInput: s = \"abcabc\" \nOutput: 4 \nExplanation: Four possible ways to split into maximum unique substrings are: ['a', 'b', 'c', 'abc'] & ['a', 'b', 'cab', 'c'] & ['a', 'bca', 'b', 'c'] & ['abc', 'a', 'b', 'c'], all have 4 substrings.\n```\n\n## Try it yourself\nTry solving this question here:"},"quiz":{"options":[]},"slider":{"images":[]},"input":{"type":"text"},"productList":[],"sectionId":"63d50ef56fd4da3d333ae842","sectionType":"markdown","_id":"63d50ef56fd4da3d333ae841","collapse":[]},{"databaseExercise":{"makeReadOnly":false,"showExecuteButton":true,"showSubmitButton":false,"showRunButton":false,"showSolutionButton":false,"showSolutionCode":false,"skipOutputVerification":false,"script":[],"databaseSchema":[],"exampleTestData":[],"internalTestData":[]},"webExercise":{"makeReadOnly":false,"showSolutionCode":false,"code":[]},"codeExercise":{"executeWithCustomClasses":false,"code":[{"driverCodeGenerated":"NOT_GENERATED","language":"java","userCode":"import java.util.HashSet;\nimport java.util.Set;\n\nclass Solution {\n public int maxUniqueSplit(String s) {\n // TODO: Write your code here\n return 0;\n }\n }\n","userCodeHighlight":[],"driverCode":"$6d","solutionCode":"import java.util.HashSet;\nimport java.util.Set;\n\nclass Solution {\n public int maxUniqueSplit(String s) {\n return splitAndCount(s, 0, new HashSet<>());\n }\n\n private int splitAndCount(String s, int start, Set set) {\n // base case, if we have reached the end of the input string, return the size of the set\n if (start == s.length())\n return set.size();\n\n int count = 0;\n // loop through all substrings starting from the current start position\n for (int i = start + 1; i <= s.length(); i++) {\n String string = s.substring(start, i);\n // if the substring is not in the set, add it and recursively call the function with the new start position\n if (set.add(string)) {\n count = Math.max(count, splitAndCount(s, i, set));\n set.remove(string); // remove the substring from the set and backtrack\n }\n }\n return count; // return the maximum count of unique substrings found\n }\n }\n","solutionCodeHighlight":[],"_id":"636b1d083b22faa3e89b2450"},{"driverCodeGenerated":"NOT_GENERATED","language":"python3","userCode":"class Solution:\n def maxUniqueSplit(self, s: str) -> int:\n # TODO: Write your code here\n return 0\n","userCodeHighlight":[],"driverCode":"def RunTestCase(inputStream: deque):\n if len(inputStream) < 1:\n raise InvalidInputException()\n\n testInput: List[str] = [inputStream.popleft()]\n s = Parser.parse(testInput[0],'str')\n\n sol = Solution()\n userResult = sol.maxUniqueSplit(s)\n\n userOutput: List[str] = [Parser.toStr(userResult,'int')]\n\n return TestCaseRunResult(testInput=testInput, userOutput=userOutput)\n\ndef VerifyTestCaseResult(userOutput: List[str], expectedOutputStream: deque) -> TestCaseVerificationResult:\n if len(userOutput) == 0:\n raise InvalidInputException()\n assert len(expectedOutputStream) >= 1\n\n # consume lines from expectedOutputStream\n expectedOutput: List[str] = [expectedOutputStream.popleft()]\n\n # Method#1 (compare using strings)\n passed: bool = userOutput == expectedOutput\n\n return TestCaseVerificationResult(passed, expectedOutput)","solutionCode":"class Solution:\n def maxUniqueSplit(self, s: str) -> int:\n return self.splitAndCount(s, 0, set())\n\n def splitAndCount(self, s: str, start: int, set) -> int:\n # base case, if we have reached the end of the input string, return the size of the set\n if start == len(s):\n return len(set)\n\n count = 0\n # loop through all substrings starting from the current start position\n for i in range(start + 1, len(s) + 1):\n string = s[start:i]\n # if the substring is not in the set, add it and recursively call the function with the new start position\n if string not in set:\n set.add(string)\n count = max(count, self.splitAndCount(s, i, set))\n set.remove(string) # remove the substring from the set and backtrack\n\n return count # return the maximum count of unique substrings found\n","solutionCodeHighlight":[],"_id":"636b1d083b22faa3e89b2451"},{"driverCodeGenerated":"NOT_GENERATED","language":"cpp","userCode":"#include \n#include \nusing namespace std;\n\nclass Solution\n{\npublic:\n int maxUniqueSplit(string s)\n {\n // TODO: Write your code here\n return 0;\n }\n};\n","userCodeHighlight":[],"driverCode":"TestCaseRunResult RunTestCase(queue& inputStream) {\n if (inputStream.size() < 1) {\n throw InvalidInputException();\n }\n vector testInput;\n testInput.push_back(inputStream.front()); inputStream.pop();\n auto s = parseString(testInput[0]);\n Solution sol;\n int result = sol.maxUniqueSplit(s);\n\n vector userOutput;\n userOutput.push_back(toString(result));\n return TestCaseRunResult(testInput, userOutput);\n}\n\nTestCaseVerificationResult VerifyTestCaseResult(const vector& userOutput, queue& expectedOutputStream) {\n if (userOutput.empty()) {\n throw InvalidOutputException();\n }\n ASSERT(expectedOutputStream.size() >= 1);\n vector expectedOutput;\n expectedOutput.push_back(expectedOutputStream.front());\n expectedOutputStream.pop();\n bool passed = userOutput[0].compare(expectedOutput[0]) == 0;\n return TestCaseVerificationResult(passed, expectedOutput);\n}\n","solutionCode":"$6e","solutionCodeHighlight":[],"_id":"6388d17620aeb9f745472058"},{"driverCodeGenerated":"NOT_GENERATED","language":"javascript","userCode":"class Solution {\n maxUniqueSplit(s) {\n // TODO: Write your code here\n return 0;\n }\n}\n","userCodeHighlight":[],"driverCode":"RunTestCase = function(inputStream) {\n if (inputStream.length < 1) {\n throw new InvalidInputException();\n }\n // consume input lines required for this test\n let testInput = inputStream.splice(0,1);\n const s = parse(testInput[0],'string');\n let sol = new Solution();\n let userResult = sol.maxUniqueSplit(s);\n let userOutput = [];\n userOutput.push(toStr(userResult,'number'));\n\n return {\n testInput: testInput,\n userOutput: userOutput,\n };\n}\n\nVerifyTestCaseResult = function(userOutput, expectedOutputStream) {\n if (userOutput.length == 0) {\n throw new InvalidOutputException();\n }\n assert(expectedOutputStream.length >= 1);\n let expectedOutput = expectedOutputStream.splice(0, 1);\n\n const passed = JSON.stringify(userOutput) == JSON.stringify(expectedOutput);\n\n return {\n passed: passed,\n expectedOutput: expectedOutput,\n };\n}","solutionCode":"class Solution {\n maxUniqueSplit(s) {\n return this.splitAndCount(s, 0, new Set());\n }\n\n splitAndCount(s, start, set) {\n // base case, if we have reached the end of the input string, return the size of the set\n if (start === s.length)\n return set.size;\n\n let count = 0;\n // loop through all substrings starting from the current start position\n for (let i = start + 1; i <= s.length; i++) {\n let string = s.substring(start, i);\n // if the substring is not in the set, add it and recursively call the function with the new start position\n if (!set.has(string)) {\n set.add(string);\n count = Math.max(count, this.splitAndCount(s, i, set));\n set.delete(string); // remove the substring from the set and backtrack\n }\n }\n return count; // return the maximum count of unique substrings found\n }\n}\n","solutionCodeHighlight":[],"_id":"6388d17620aeb9f745472059"},{"driverCodeGenerated":"NOT_GENERATED","language":"csharp","userCode":"using System;\nusing System.Collections.Generic;\n\npublic class Solution {\n public int maxUniqueSplit(string s) {\n // TODO: Write your code here\n return 0;\n }\n}\n","userCodeHighlight":[],"driverCode":"$6f","solutionCode":"$70","solutionCodeHighlight":[],"_id":"636b1d083b22faa3e89b2450"}],"exampleTestCases":[{"input":"\"abcabc\"\n","expectedOutput":"4\n","_id":"63b877d6a4deb0091e9f8da1"},{"input":"\"aab\"\n","expectedOutput":"2\n","_id":"63b877d6a4deb0091e9f8da2"},{"input":"\"ababab\"\n","expectedOutput":"4\n","_id":"63b877d6a4deb0091e9f8da3"}],"internalTestCases":[{"input":"\"abcabc\"\n","expectedOutput":"4\n","_id":"63b877d6a4deb0091e9f8da1"},{"input":"\"aab\"\n","expectedOutput":"2\n","_id":"63b877d6a4deb0091e9f8da2"},{"input":"\"ababab\"\n","expectedOutput":"4\n","_id":"63b877d6a4deb0091e9f8da3"},{"input":"\"\"\n","expectedOutput":"0\n","_id":"63b877d6a4deb0091e9f8da4"},{"input":"\"a\"\n","expectedOutput":"1\n","_id":"63b877d6a4deb0091e9f8da5"},{"input":"\"aaaaa\"\n","expectedOutput":"2\n","_id":"63b877d6a4deb0091e9f8da6"},{"input":"\"abc\"\n","expectedOutput":"3\n","_id":"63b877d6a4deb0091e9f8da7"},{"input":"\"abacabadabacaba\"\n","expectedOutput":"8\n","_id":"63b877d6a4deb0091e9f8da8"},{"input":"\"abcdabcdabcdabcd\"\n","expectedOutput":"9\n","_id":"63b877d6a4deb0091e9f8da9"}],"makeReadOnly":false,"showExecuteButton":true,"showSubmitButton":true,"showRunButton":false,"showSolutionButton":false,"showSolutionCode":false,"skipOutputVerification":false},"quiz":{"options":[]},"slider":{"images":[]},"input":{"type":"text"},"productList":[],"sectionId":"63d50ef56fd4da3d333ae844","sectionType":"codeExercise","_id":"63d50ef56fd4da3d333ae843","collapse":[]}],"_id":"65366930a6bbedcc8e81e618","tags":[]},"versionTimestamp":"2023-10-23T12:38:08.449Z","_id":"65366930a6bbedcc8e81e617"},{"addedByAi":false,"document":{"updated":"2023-11-28T02:46:03.299Z","sections":[{"databaseExercise":{"makeReadOnly":false,"showExecuteButton":true,"showSubmitButton":false,"showRunButton":false,"showSolutionButton":false,"showSolutionCode":false,"skipOutputVerification":false,"script":[],"databaseSchema":[],"exampleTestData":[],"internalTestData":[]},"webExercise":{"makeReadOnly":false,"showSolutionCode":false,"code":[]},"codeExercise":{"executeWithCustomClasses":false,"code":[],"exampleTestCases":[],"internalTestCases":[],"makeReadOnly":false,"showExecuteButton":true,"showSubmitButton":false,"showRunButton":false,"showSolutionButton":false,"showSolutionCode":false,"skipOutputVerification":false},"markdown":{"text":"## Problem Statement \n\nGiven a string `s`, return the maximum number of unique substrings that the given string can be split into.\n\nYou 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**.\n\nA substring is a contiguous sequence of characters within a string.\n\n**Example 1**: \n```\nInput: s = \"aab\" \nOutput: 2 \nExplanation: Two possible ways to split the given string into maximum unique substrings are: ['a', 'ab'] & ['aa', 'b'], both have 2 substrings; hence the maximum number of unique substrings in which the given string can be split is 2.\n``` \n\n**Example 2**: \n```\nInput: s = \"abcabc\" \nOutput: 4 \nExplanation: Four possible ways to split into maximum unique substrings are: ['a', 'b', 'c', 'abc'] & ['a', 'b', 'cab', 'c'] & ['a', 'bca', 'b', 'c'] & ['abc', 'a', 'b', 'c'], all have 4 substrings.\n```\n\n## Try it yourself\nTry solving this question here:"},"quiz":{"options":[]},"slider":{"images":[]},"input":{"type":"text"},"productList":[],"sectionId":"63d50ef56fd4da3d333ae842","sectionType":"markdown","_id":"63d50ef56fd4da3d333ae841","collapse":[]},{"databaseExercise":{"makeReadOnly":false,"showExecuteButton":true,"showSubmitButton":false,"showRunButton":false,"showSolutionButton":false,"showSolutionCode":false,"skipOutputVerification":false,"script":[],"databaseSchema":[],"exampleTestData":[],"internalTestData":[]},"webExercise":{"makeReadOnly":false,"showSolutionCode":false,"code":[]},"codeExercise":{"executeWithCustomClasses":false,"code":[{"driverCodeGenerated":"NOT_GENERATED","language":"python3","userCode":"class Solution:\n def maxUniqueSplit(self, s: str) -> int:\n # TODO: Write your code here\n return 0\n","userCodeHighlight":[],"driverCode":"def RunTestCase(inputStream: deque):\n if len(inputStream) < 1:\n raise InvalidInputException()\n\n testInput: List[str] = [inputStream.popleft()]\n s = Parser.parse(testInput[0],'str')\n\n sol = Solution()\n userResult = sol.maxUniqueSplit(s)\n\n userOutput: List[str] = [Parser.toStr(userResult,'int')]\n\n return TestCaseRunResult(testInput=testInput, userOutput=userOutput)\n\ndef VerifyTestCaseResult(userOutput: List[str], expectedOutputStream: deque) -> TestCaseVerificationResult:\n if len(userOutput) == 0:\n raise InvalidInputException()\n assert len(expectedOutputStream) >= 1\n\n # consume lines from expectedOutputStream\n expectedOutput: List[str] = [expectedOutputStream.popleft()]\n\n # Method#1 (compare using strings)\n passed: bool = userOutput == expectedOutput\n\n return TestCaseVerificationResult(passed, expectedOutput)","solutionCode":"class Solution:\n def maxUniqueSplit(self, s: str) -> int:\n return self.splitAndCount(s, 0, set())\n\n def splitAndCount(self, s: str, start: int, set) -> int:\n # base case, if we have reached the end of the input string, return the size of the set\n if start == len(s):\n return len(set)\n\n count = 0\n # loop through all substrings starting from the current start position\n for i in range(start + 1, len(s) + 1):\n string = s[start:i]\n # if the substring is not in the set, add it and recursively call the function with the new start position\n if string not in set:\n set.add(string)\n count = max(count, self.splitAndCount(s, i, set))\n set.remove(string) # remove the substring from the set and backtrack\n\n return count # return the maximum count of unique substrings found\n","solutionCodeHighlight":[],"_id":"636b1d083b22faa3e89b2451"},{"driverCodeGenerated":"NOT_GENERATED","language":"java","userCode":"import java.util.HashSet;\nimport java.util.Set;\n\nclass Solution {\n public int maxUniqueSplit(String s) {\n // TODO: Write your code here\n return 0;\n }\n }\n","userCodeHighlight":[],"driverCode":"$71","solutionCode":"import java.util.HashSet;\nimport java.util.Set;\n\nclass Solution {\n public int maxUniqueSplit(String s) {\n return splitAndCount(s, 0, new HashSet<>());\n }\n\n private int splitAndCount(String s, int start, Set set) {\n // base case, if we have reached the end of the input string, return the size of the set\n if (start == s.length())\n return set.size();\n\n int count = 0;\n // loop through all substrings starting from the current start position\n for (int i = start + 1; i <= s.length(); i++) {\n String string = s.substring(start, i);\n // if the substring is not in the set, add it and recursively call the function with the new start position\n if (set.add(string)) {\n count = Math.max(count, splitAndCount(s, i, set));\n set.remove(string); // remove the substring from the set and backtrack\n }\n }\n return count; // return the maximum count of unique substrings found\n }\n }\n","solutionCodeHighlight":[],"_id":"636b1d083b22faa3e89b2450"},{"driverCodeGenerated":"NOT_GENERATED","language":"javascript","userCode":"class Solution {\n maxUniqueSplit(s) {\n // TODO: Write your code here\n return 0;\n }\n}\n","userCodeHighlight":[],"driverCode":"RunTestCase = function(inputStream) {\n if (inputStream.length < 1) {\n throw new InvalidInputException();\n }\n // consume input lines required for this test\n let testInput = inputStream.splice(0,1);\n const s = parse(testInput[0],'string');\n let sol = new Solution();\n let userResult = sol.maxUniqueSplit(s);\n let userOutput = [];\n userOutput.push(toStr(userResult,'number'));\n\n return {\n testInput: testInput,\n userOutput: userOutput,\n };\n}\n\nVerifyTestCaseResult = function(userOutput, expectedOutputStream) {\n if (userOutput.length == 0) {\n throw new InvalidOutputException();\n }\n assert(expectedOutputStream.length >= 1);\n let expectedOutput = expectedOutputStream.splice(0, 1);\n\n const passed = JSON.stringify(userOutput) == JSON.stringify(expectedOutput);\n\n return {\n passed: passed,\n expectedOutput: expectedOutput,\n };\n}","solutionCode":"class Solution {\n maxUniqueSplit(s) {\n return this.splitAndCount(s, 0, new Set());\n }\n\n splitAndCount(s, start, set) {\n // base case, if we have reached the end of the input string, return the size of the set\n if (start === s.length)\n return set.size;\n\n let count = 0;\n // loop through all substrings starting from the current start position\n for (let i = start + 1; i <= s.length; i++) {\n let string = s.substring(start, i);\n // if the substring is not in the set, add it and recursively call the function with the new start position\n if (!set.has(string)) {\n set.add(string);\n count = Math.max(count, this.splitAndCount(s, i, set));\n set.delete(string); // remove the substring from the set and backtrack\n }\n }\n return count; // return the maximum count of unique substrings found\n }\n}\n","solutionCodeHighlight":[],"_id":"6388d17620aeb9f745472059"},{"driverCodeGenerated":"NOT_GENERATED","language":"cpp","userCode":"#include \n#include \nusing namespace std;\n\nclass Solution\n{\npublic:\n int maxUniqueSplit(string s)\n {\n // TODO: Write your code here\n return 0;\n }\n};\n","userCodeHighlight":[],"driverCode":"TestCaseRunResult RunTestCase(queue& inputStream) {\n if (inputStream.size() < 1) {\n throw InvalidInputException();\n }\n vector testInput;\n testInput.push_back(inputStream.front()); inputStream.pop();\n auto s = parseString(testInput[0]);\n Solution sol;\n int result = sol.maxUniqueSplit(s);\n\n vector userOutput;\n userOutput.push_back(toString(result));\n return TestCaseRunResult(testInput, userOutput);\n}\n\nTestCaseVerificationResult VerifyTestCaseResult(const vector& userOutput, queue& expectedOutputStream) {\n if (userOutput.empty()) {\n throw InvalidOutputException();\n }\n ASSERT(expectedOutputStream.size() >= 1);\n vector expectedOutput;\n expectedOutput.push_back(expectedOutputStream.front());\n expectedOutputStream.pop();\n bool passed = userOutput[0].compare(expectedOutput[0]) == 0;\n return TestCaseVerificationResult(passed, expectedOutput);\n}\n","solutionCode":"$72","solutionCodeHighlight":[],"_id":"6388d17620aeb9f745472058"},{"driverCodeGenerated":"NOT_GENERATED","language":"csharp","userCode":"using System;\nusing System.Collections.Generic;\n\npublic class Solution {\n public int maxUniqueSplit(string s) {\n // TODO: Write your code here\n return 0;\n }\n}\n","userCodeHighlight":[],"driverCode":"$73","solutionCode":"$74","solutionCodeHighlight":[],"_id":"636b1d083b22faa3e89b2450"},{"driverCodeGenerated":"NOT_GENERATED","language":"go","userCode":"type Solution struct{}\n\nfunc (s *Solution) maxUniqueSplit(str string) int {\n\t// TODO: Write your code here\n return 0;\n}\n\n","userCodeHighlight":[],"driverCode":"$75","solutionCode":"type Solution struct{}\n\nfunc (s *Solution) maxUniqueSplit(str string) int {\n\treturn s.splitAndCount(str, 0, make(map[string]bool))\n}\n\nfunc (s *Solution) splitAndCount(str string, start int, set map[string]bool) int {\n\tif start == len(str) {\n\t\treturn len(set)\n\t}\n\n\tcount := 0\n\tfor i := start + 1; i <= len(str); i++ {\n\t\tsubstr := str[start:i]\n\t\tif _, ok := set[substr]; !ok {\n\t\t\tset[substr] = true\n\t\t\tcount = max(count, s.splitAndCount(str, i, set))\n\t\t\tdelete(set, substr)\n\t\t}\n\t}\n\treturn count\n}\n\nfunc max(a, b int) int {\n\tif a > b {\n\t\treturn a\n\t}\n\treturn b\n}\n\n","solutionCodeHighlight":[],"_id":"636b1d083b22faa3e89b2450"}],"exampleTestCases":[{"input":"\"abcabc\"\n","expectedOutput":"4\n","_id":"63b877d6a4deb0091e9f8da1"},{"input":"\"aab\"\n","expectedOutput":"2\n","_id":"63b877d6a4deb0091e9f8da2"},{"input":"\"ababab\"\n","expectedOutput":"4\n","_id":"63b877d6a4deb0091e9f8da3"}],"internalTestCases":[{"input":"\"abcabc\"\n","expectedOutput":"4\n","_id":"63b877d6a4deb0091e9f8da1"},{"input":"\"aab\"\n","expectedOutput":"2\n","_id":"63b877d6a4deb0091e9f8da2"},{"input":"\"ababab\"\n","expectedOutput":"4\n","_id":"63b877d6a4deb0091e9f8da3"},{"input":"\"\"\n","expectedOutput":"0\n","_id":"63b877d6a4deb0091e9f8da4"},{"input":"\"a\"\n","expectedOutput":"1\n","_id":"63b877d6a4deb0091e9f8da5"},{"input":"\"aaaaa\"\n","expectedOutput":"2\n","_id":"63b877d6a4deb0091e9f8da6"},{"input":"\"abc\"\n","expectedOutput":"3\n","_id":"63b877d6a4deb0091e9f8da7"},{"input":"\"abacabadabacaba\"\n","expectedOutput":"8\n","_id":"63b877d6a4deb0091e9f8da8"},{"input":"\"abcdabcdabcdabcd\"\n","expectedOutput":"9\n","_id":"63b877d6a4deb0091e9f8da9"}],"makeReadOnly":false,"showExecuteButton":true,"showSubmitButton":true,"showRunButton":false,"showSolutionButton":false,"showSolutionCode":false,"skipOutputVerification":false},"quiz":{"options":[]},"slider":{"images":[]},"input":{"type":"text"},"productList":[],"sectionId":"63d50ef56fd4da3d333ae844","sectionType":"codeExercise","_id":"63d50ef56fd4da3d333ae843","collapse":[]}],"_id":"6565546cfc8584ae127b5cfe","tags":[]},"versionTimestamp":"2023-11-28T02:46:03.299Z","_id":"6565546cfc8584ae127b5cfd"},{"addedByAi":false,"document":{"updated":"2024-03-21T02:08:45.896Z","sections":[{"databaseExercise":{"makeReadOnly":false,"showExecuteButton":true,"showSubmitButton":false,"showRunButton":false,"showSolutionButton":false,"showSolutionCode":false,"skipOutputVerification":false,"script":[],"databaseSchema":[],"exampleTestData":[],"internalTestData":[]},"webExercise":{"makeReadOnly":false,"showSolutionCode":false,"code":[]},"codeExercise":{"code":[],"exampleTestCases":[],"internalTestCases":[],"makeReadOnly":false,"showExecuteButton":true,"showSubmitButton":false,"showRunButton":false,"showSolutionButton":false,"executeWithCustomClasses":false,"showSolutionCode":false,"skipOutputVerification":false},"markdown":{"text":"$76"},"quiz":{"options":[]},"slider":{"images":[]},"input":{"type":"text"},"sectionId":"63d50ef56fd4da3d333ae842","sectionType":"markdown","productList":[],"_id":"63d50ef56fd4da3d333ae841","collapse":[]},{"databaseExercise":{"makeReadOnly":false,"showExecuteButton":true,"showSubmitButton":false,"showRunButton":false,"showSolutionButton":false,"showSolutionCode":false,"skipOutputVerification":false,"script":[],"databaseSchema":[],"exampleTestData":[],"internalTestData":[]},"webExercise":{"makeReadOnly":false,"showSolutionCode":false,"code":[]},"codeExercise":{"code":[{"driverCodeGenerated":"NOT_GENERATED","language":"python3","userCode":"class Solution:\n def maxUniqueSplit(self, s: str) -> int:\n # TODO: Write your code here\n return 0\n","userCodeHighlight":[],"driverCode":"def RunTestCase(inputStream: deque):\n if len(inputStream) < 1:\n raise InvalidInputException()\n\n testInput: List[str] = [inputStream.popleft()]\n s = Parser.parse(testInput[0],'str')\n\n sol = Solution()\n userResult = sol.maxUniqueSplit(s)\n\n userOutput: List[str] = [Parser.toStr(userResult,'int')]\n\n return TestCaseRunResult(testInput=testInput, userOutput=userOutput)\n\ndef VerifyTestCaseResult(userOutput: List[str], expectedOutputStream: deque) -> TestCaseVerificationResult:\n if len(userOutput) == 0:\n raise InvalidInputException()\n assert len(expectedOutputStream) >= 1\n\n # consume lines from expectedOutputStream\n expectedOutput: List[str] = [expectedOutputStream.popleft()]\n\n # Method#1 (compare using strings)\n passed: bool = userOutput == expectedOutput\n\n return TestCaseVerificationResult(passed, expectedOutput)","solutionCode":"class Solution:\n def maxUniqueSplit(self, s: str) -> int:\n return self.splitAndCount(s, 0, set())\n\n def splitAndCount(self, s: str, start: int, set) -> int:\n # base case, if we have reached the end of the input string, return the size of the set\n if start == len(s):\n return len(set)\n\n count = 0\n # loop through all substrings starting from the current start position\n for i in range(start + 1, len(s) + 1):\n string = s[start:i]\n # if the substring is not in the set, add it and recursively call the function with the new start position\n if string not in set:\n set.add(string)\n count = max(count, self.splitAndCount(s, i, set))\n set.remove(string) # remove the substring from the set and backtrack\n\n return count # return the maximum count of unique substrings found\n","solutionCodeHighlight":[],"_id":"636b1d083b22faa3e89b2451"},{"driverCodeGenerated":"NOT_GENERATED","language":"java","userCode":"import java.util.HashSet;\nimport java.util.Set;\n\nclass Solution {\n public int maxUniqueSplit(String s) {\n // TODO: Write your code here\n return 0;\n }\n }\n","userCodeHighlight":[],"driverCode":"$77","solutionCode":"import java.util.HashSet;\nimport java.util.Set;\n\nclass Solution {\n public int maxUniqueSplit(String s) {\n return splitAndCount(s, 0, new HashSet<>());\n }\n\n private int splitAndCount(String s, int start, Set set) {\n // base case, if we have reached the end of the input string, return the size of the set\n if (start == s.length())\n return set.size();\n\n int count = 0;\n // loop through all substrings starting from the current start position\n for (int i = start + 1; i <= s.length(); i++) {\n String string = s.substring(start, i);\n // if the substring is not in the set, add it and recursively call the function with the new start position\n if (set.add(string)) {\n count = Math.max(count, splitAndCount(s, i, set));\n set.remove(string); // remove the substring from the set and backtrack\n }\n }\n return count; // return the maximum count of unique substrings found\n }\n }\n","solutionCodeHighlight":[],"_id":"636b1d083b22faa3e89b2450"},{"driverCodeGenerated":"NOT_GENERATED","language":"javascript","userCode":"class Solution {\n maxUniqueSplit(s) {\n // TODO: Write your code here\n return 0;\n }\n}\n","userCodeHighlight":[],"driverCode":"RunTestCase = function(inputStream) {\n if (inputStream.length < 1) {\n throw new InvalidInputException();\n }\n // consume input lines required for this test\n let testInput = inputStream.splice(0,1);\n const s = parse(testInput[0],'string');\n let sol = new Solution();\n let userResult = sol.maxUniqueSplit(s);\n let userOutput = [];\n userOutput.push(toStr(userResult,'number'));\n\n return {\n testInput: testInput,\n userOutput: userOutput,\n };\n}\n\nVerifyTestCaseResult = function(userOutput, expectedOutputStream) {\n if (userOutput.length == 0) {\n throw new InvalidOutputException();\n }\n assert(expectedOutputStream.length >= 1);\n let expectedOutput = expectedOutputStream.splice(0, 1);\n\n const passed = JSON.stringify(userOutput) == JSON.stringify(expectedOutput);\n\n return {\n passed: passed,\n expectedOutput: expectedOutput,\n };\n}","solutionCode":"class Solution {\n maxUniqueSplit(s) {\n return this.splitAndCount(s, 0, new Set());\n }\n\n splitAndCount(s, start, set) {\n // base case, if we have reached the end of the input string, return the size of the set\n if (start === s.length)\n return set.size;\n\n let count = 0;\n // loop through all substrings starting from the current start position\n for (let i = start + 1; i <= s.length; i++) {\n let string = s.substring(start, i);\n // if the substring is not in the set, add it and recursively call the function with the new start position\n if (!set.has(string)) {\n set.add(string);\n count = Math.max(count, this.splitAndCount(s, i, set));\n set.delete(string); // remove the substring from the set and backtrack\n }\n }\n return count; // return the maximum count of unique substrings found\n }\n}\n","solutionCodeHighlight":[],"_id":"6388d17620aeb9f745472059"},{"driverCodeGenerated":"NOT_GENERATED","language":"cpp","userCode":"#include \n#include \nusing namespace std;\n\nclass Solution\n{\npublic:\n int maxUniqueSplit(string s)\n {\n // TODO: Write your code here\n return 0;\n }\n};\n","userCodeHighlight":[],"driverCode":"TestCaseRunResult RunTestCase(queue& inputStream) {\n if (inputStream.size() < 1) {\n throw InvalidInputException();\n }\n vector testInput;\n testInput.push_back(inputStream.front()); inputStream.pop();\n auto s = parseString(testInput[0]);\n Solution sol;\n int result = sol.maxUniqueSplit(s);\n\n vector userOutput;\n userOutput.push_back(toString(result));\n return TestCaseRunResult(testInput, userOutput);\n}\n\nTestCaseVerificationResult VerifyTestCaseResult(const vector& userOutput, queue& expectedOutputStream) {\n if (userOutput.empty()) {\n throw InvalidOutputException();\n }\n ASSERT(expectedOutputStream.size() >= 1);\n vector expectedOutput;\n expectedOutput.push_back(expectedOutputStream.front());\n expectedOutputStream.pop();\n bool passed = userOutput[0].compare(expectedOutput[0]) == 0;\n return TestCaseVerificationResult(passed, expectedOutput);\n}\n","solutionCode":"$78","solutionCodeHighlight":[],"_id":"6388d17620aeb9f745472058"},{"driverCodeGenerated":"NOT_GENERATED","language":"csharp","userCode":"using System;\nusing System.Collections.Generic;\n\npublic class Solution {\n public int maxUniqueSplit(string s) {\n // TODO: Write your code here\n return 0;\n }\n}\n","userCodeHighlight":[],"driverCode":"$79","solutionCode":"$7a","solutionCodeHighlight":[],"_id":"636b1d083b22faa3e89b2450"},{"driverCodeGenerated":"NOT_GENERATED","language":"go","userCode":"type Solution struct{}\n\nfunc (s *Solution) maxUniqueSplit(str string) int {\n\t// TODO: Write your code here\n return 0;\n}\n\n","userCodeHighlight":[],"driverCode":"$7b","solutionCode":"type Solution struct{}\n\nfunc (s *Solution) maxUniqueSplit(str string) int {\n\treturn s.splitAndCount(str, 0, make(map[string]bool))\n}\n\nfunc (s *Solution) splitAndCount(str string, start int, set map[string]bool) int {\n\tif start == len(str) {\n\t\treturn len(set)\n\t}\n\n\tcount := 0\n\tfor i := start + 1; i <= len(str); i++ {\n\t\tsubstr := str[start:i]\n\t\tif _, ok := set[substr]; !ok {\n\t\t\tset[substr] = true\n\t\t\tcount = max(count, s.splitAndCount(str, i, set))\n\t\t\tdelete(set, substr)\n\t\t}\n\t}\n\treturn count\n}\n\nfunc max(a, b int) int {\n\tif a > b {\n\t\treturn a\n\t}\n\treturn b\n}\n\n","solutionCodeHighlight":[],"_id":"636b1d083b22faa3e89b2450"}],"exampleTestCases":[{"input":"\"abcabc\"\n","expectedOutput":"4\n","_id":"63b877d6a4deb0091e9f8da1"},{"input":"\"aab\"\n","expectedOutput":"2\n","_id":"63b877d6a4deb0091e9f8da2"},{"input":"\"ababab\"\n","expectedOutput":"4\n","_id":"63b877d6a4deb0091e9f8da3"}],"internalTestCases":[{"input":"\"abcabc\"\n","expectedOutput":"4\n","_id":"63b877d6a4deb0091e9f8da1"},{"input":"\"aab\"\n","expectedOutput":"2\n","_id":"63b877d6a4deb0091e9f8da2"},{"input":"\"ababab\"\n","expectedOutput":"4\n","_id":"63b877d6a4deb0091e9f8da3"},{"input":"\"\"\n","expectedOutput":"0\n","_id":"63b877d6a4deb0091e9f8da4"},{"input":"\"a\"\n","expectedOutput":"1\n","_id":"63b877d6a4deb0091e9f8da5"},{"input":"\"aaaaa\"\n","expectedOutput":"2\n","_id":"63b877d6a4deb0091e9f8da6"},{"input":"\"abc\"\n","expectedOutput":"3\n","_id":"63b877d6a4deb0091e9f8da7"},{"input":"\"abacabadabacaba\"\n","expectedOutput":"8\n","_id":"63b877d6a4deb0091e9f8da8"},{"input":"\"abcdabcdabcdabcd\"\n","expectedOutput":"9\n","_id":"63b877d6a4deb0091e9f8da9"}],"makeReadOnly":false,"showExecuteButton":true,"showSubmitButton":true,"showRunButton":false,"showSolutionButton":false,"executeWithCustomClasses":false,"showSolutionCode":false,"skipOutputVerification":false},"quiz":{"options":[]},"slider":{"images":[]},"input":{"type":"text"},"sectionId":"63d50ef56fd4da3d333ae844","sectionType":"codeExercise","productList":[],"_id":"63d50ef56fd4da3d333ae843","collapse":[]}],"_id":"65fb96af8d88d09332337745","tags":[]},"versionTimestamp":"2024-03-21T02:08:45.896Z","_id":"65fb96af8d88d09332337744"}],"__v":0,"draftDocuments":[]},"title":"Split a String Into the Max Number of Unique Substrings (medium)","url":"document/grokking-the-coding-interview/63d50832298d8670e11747b4","courseId":"636b1d083b22faa3e89b243a"}]