Section 2 of 2 Section #2 CHALLENGE Find the minimum substring fragment in S which will contain all the characters present in T. CONDITIONS 1. The order of characters in string T is not important. 2. If there are no matching fragments in S with all characters from T, return "NONE". 3. If there are multiple fragments identified, only return the shortest fragment in S with all matching characters from T. 4. If there are multiple fragments of the same shortest length identified, return the first fragment. (S Example 1: INPUT1: "ABODE" INPUT2: "AX" (T) OUTPUT: "NONE". Minimum window is "NONE". Example 2: INPUT1: "ABBBCDAB" INPUT2: "ABCD"
Answers
Answered by
0
Question doesn't make sense...
sorry ¯\_(☯෴☯)_/¯
Similar questions