Nishant. Your algorithm works for finding repeated nos. in a [n+2] array where [1-n] are present atleast once and the same number is not being repeated twice.
Reanalyze the question. -- 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.
