Given n elements find all the elements that appear morethan n/2 times.
Solve the same for elements appear n/4 times.
Should not use more than const memory and O(n) time.
Find the repeated element
Subscribe to:
Comments (Atom)
skip to main |
skip to sidebar
“The Journey of a Thousand Miles begins with a single step!” Unknown
"Anyone who has never made a mistake has never tried anything new." -- Albert Einstien
"Speech is silver, listening is gold but understanding others in their language is platinum" --Unknown
"Dream is not what you see while sleeping, Dream is that which doesn't allow you to sleep" --- A.P.J. Abdul Kalam
“It doesn't matter how beautiful your theory is, it doesn't matter how smart you are. If it doesn't agree with experiment, it's wrong.” -Richard P. Feynman
Thanks for giving your feedback
A place where we can play with PUZZLEs
Labels
- Easy Puzzles (16)
- Programming (1)
- Puzzles: at Interview (19)
- Puzzles: At MS interview (2)
- Puzzles: Comp. Sc. (2)
- Puzzles: Math. (6)
- Puzzles: Math. Algorithm.DS (3)
- Puzzles: Medium (3)
- Puzzles: Optimize (1)
Blog Archive
Need help? follow the links
Do you like to have "Certification"?
Intrested in stocks?
Followers
Posts
“The Journey of a Thousand Miles begins with a single step!” Unknown
"Anyone who has never made a mistake has never tried anything new." -- Albert Einstien
"Speech is silver, listening is gold but understanding others in their language is platinum" --Unknown
"Dream is not what you see while sleeping, Dream is that which doesn't allow you to sleep" --- A.P.J. Abdul Kalam
“It doesn't matter how beautiful your theory is, it doesn't matter how smart you are. If it doesn't agree with experiment, it's wrong.” -Richard P. Feynman
Thanks for giving your feedback