DESTROY - Editorial

rahul1995 · January 25, 2016, 1:08am

Oh yes! Couldn’t think of that…Thanks

bodmas · January 25, 2016, 1:08am

Excellent. How did you come up with that? Why does it work?

drgn_hart · January 25, 2016, 5:27pm

I used a similar approach but not O(n). I think it is correct because there will exist a number different than itself to pair it with if occurrence of a number is less than half of the size of the array. On the other hand if a number repeats more than n/2 times you cannot find a number to pair it with after (size - maxcount) times. Hope you understood why it is right.
I used a different approch to calculate count and CodeChef: Practical coding for everyone is the link to my solution.

archit910 · January 27, 2016, 6:22pm

excellent

nil96 · January 28, 2016, 1:36pm

@rednivrug15 there are 8 elements hence we need atleast 4 to destroy i guess

shubham99 · February 3, 2016, 1:27am

Thanks for sharing this. I learned something new today

ketan_mehta · March 21, 2020, 9:43pm

nice approach