ri, Jul 22, 2011 at 7:21 PM, vaibhavmitta...@gmail.com> wrote:
>
> > > > String is "abcded"
> > > > l =0, h = 0
>
> > > > i = 1, l = 0, h = 1, max = 1, A[a]=1
> > > > i = 2, l = 0, h = 2, max = 2, A[b] = 2
>
> > >
My algo for this prob:
Maintain an array A for characters from a-z which stores the index of
character encountered in the string. (initially all = -1)
iterate over all the characters in the string maintaining low and high
variables (initially both = 0) and max (initially = 0, stores length
of large
