[Tutor] how to find the maximum length substring with equal 'a' and 'b' ?

[Arup Rakshit]

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...
URL: <http://mail.python.org/pipermail/tutor/attachments/20140407/6ecc951e/attachment.html>