take two pointers first move pointer1 by a distance=n now move both the pointers till pointer1 reaches end you would see that pointer 2 points to nth node from last....
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.
take two pointers
ReplyDeletefirst move pointer1 by a distance=n
now move both the pointers till pointer1 reaches end
you would see that pointer 2 points to nth node from last....
@ankit absolutely correct approach...:)
ReplyDelete