If yes, how do you prove it? On Sat, Nov 12, 2011 at 8:18 PM, Nitin Garg <[email protected]>wrote:
> I can prove that the size of resulting string will be 1 or 2. > > @surender - > what do you mean by no of distinct characters? they are 3 in this case - > a,b and c. > Do you mean to say that the no. of times each character appears are equal > then the final string is of size 2. and 1 otherwise????? > > > On Sat, Nov 12, 2011 at 4:57 PM, surender sanke <[email protected]>wrote: > >> @myself >> >> if number of distinct characters are equal then its final string size is >> 2. >> else there are more repeated characters other than distinct characters >> then its 1 >> >> correct me !!! >> surender >> >> On Sat, Nov 12, 2011 at 4:46 PM, surender sanke <[email protected]>wrote: >> >>> All distinct combinations will result in string size of 2 + rest >>> repeated characters >>> eg >>> abcabcabc ->aabbcc->abc->aa or bb or cc >>> >>> surender >>> >>> On Sat, Nov 12, 2011 at 4:24 PM, Snoopy Me <[email protected]>wrote: >>> >>>> Given a string consisting of a,b and c's, we can perform the >>>> following >>>> operation: >>>> Take any two adjacent distinct characters and replace it with the >>>> third character. For example, if 'a' and 'c' are adjacent, they can >>>> replaced with 'b'. >>>> What is the smallest string which can result by applying this >>>> operation repeatedly? >>>> >>>> -- >>>> You received this message because you are subscribed to the Google >>>> Groups "Algorithm Geeks" group. >>>> To post to this group, send email to [email protected]. >>>> To unsubscribe from this group, send email to >>>> [email protected]. >>>> For more options, visit this group at >>>> http://groups.google.com/group/algogeeks?hl=en. >>>> >>>> >>> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To post to this group, send email to [email protected]. >> To unsubscribe from this group, send email to >> [email protected]. >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> > > > > -- > Nitin Garg > > "Personality can open doors, but only Character can keep them open" > -- Nitin Garg "Personality can open doors, but only Character can keep them open" -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
