@jai yeah, it can be done using count sort logic but that will take O(n) extra space
which can be avoided by using XOR. On Fri, Dec 10, 2010 at 3:34 AM, jai gupta <[email protected]> wrote: > Algo: > In first traverse find the min and the max values. > if (max-min) not equals (N-1) > return false > In next traverse map each in a hashtable of size N where index=key-min. Now > in case of collision return false > return true > > -- > 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]<algogeeks%[email protected]> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- Regards Aditya Kumar B-tech 3rd year Computer Science & Engg. MNNIT, Allahabad. -- 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.
