Replace wildcards in a binary string avoiding three identical consecutive letters
Given a string S of length N, return a string that is the result of replacing each '?'
in the string S with an 'a'
or a 'b'
character and does not contain three identical consecutive letters (in other words, neither 'aaa'
not 'bbb'
may occur in the processed string).
Examples:
Given S="a?bb", output= "aabb"
Given S="??abb", output= "ababb" or "bbabb" or "baabb"
Given S="a?b?aa", output= "aabbaa"
1<=n<= 500000
I solved the problem using backtracking, but my solution is slow and won't work for greater N values, is there a better approach?
from Recent Questions - Stack Overflow https://ift.tt/3ESZAnF
https://ift.tt/eA8V8J
Comments
Post a Comment