Algorithm
Lexicographically Smallest Generated String
Solution
# process the case of 'T'
for i, ch in enumerate(str1):
if ch == "T":
for j, c in enumerate(str2, i):
if fixed[j] and s[j] != c:
return ""
s[j], fixed[j] = c, TrueVideo GuideLeetcode Daily
Time Complexity
O(nm)
Space Complexity
O(n + m)