[Tutor] how to find the maximum length substring with equal 'a' and 'b' ?
aruprakshit at rocketmail.com
Sun Apr 6 20:27:55 CEST 2014
Suppose, if I have the string 'aababbb', I want to get the output as 'aababb'. I want the output in time complexity O(N) and space complexity O(1). when input string is 'abababa', output should be same as input.
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the Tutor