@Aditya : Since k<m and we need the element that apears exactly k times, i think u need to find the smallest number in the array and the corresponding index is the number that is repeated most number of times.
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. For more options, visit https://groups.google.com/groups/opt_out.
