You are given n real numbers in an array. A number in the array is called a decimal dominant if it occurs more than n/10 times in the array. Give an O(n) time algorithm to determine if the given array has a decimal dominant.

Implement a function getbits, that returns the(right adjusted) n bits that begin at position p of an integer. Assume bit position 0 is at the right end and that n and p are sensible positive values.

Very tricky one but only factorial is the mathematical operation that can give result.

ReplyDelete(0!+0!+0!+0!+0!)! =(1+1+1+1+1)!=5!=120

@Mufaddal very nice solution..:)

ReplyDelete