@akshay

Does the array contain numbers in the range 1 to n?

On Jul 28, 8:16 pm, akshay <akshayrastogi2...@gmail.com> wrote:
> An array of unsorted numbers n is given with one no.repeated once ie
> n-1 distinct nos to find duplicate no. in o(n) complexity

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Reply via email to