seems like quesion of permutation, it will take all the permutation to check which one can lead to answer, there will be always be more than one solution
complexity ((n-1)!) anyone for better solution ?? On Nov 12, 4:27 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.
