Find the two numbers whose difference is minimum among the set of numbers. For example the sequence is 5, 13, 7, 0, 10, 20, 1, 15, 4, 19 The algorithm should return min diff = 20-19 = 1. Make an efficient algorithm, yeah best could be O(n). Not sure if i could use DP here, will post a solution tommorow. Let me know if you find a answer. Algorithm:MiniMumDiffN Get the size of array , say n. Get the range of array, range. Bucket Sort the above array. Search the above sorted array for minimum difference. This will be the minimum difference numbers. Now question comes where the range of above given array is very big. Algorithm:DivideArray Take an random element. Search for its position in array. Return the index of element. Algorithm:MiniMumDiff if array_range > MAXRANGE int mid = divideArray (arr,start,end); d1,max1 = MiniMumDiff( arr,start,mid-1); d2,max2 = MiniMumDIff(arr,mid+1,end); d3 = difference max1 and arr[mid] d4 = difference max2 and arr[mid] return minimum( d1,d2
18. Reverse the doubly link list.
ReplyDeleteFor ( p = head; p->next != head; p = p->prev )
Swap (&p->next,&p->prev);
19. Doubly link list a single pointer.
While storing the address store address as xor of the previous and next.
20. Reverse the link list with ‘k’ nodes.
Take the k+1 the element pointer and put as the next for first element . Reverse the K sized list .
21. Find a list in palindrome or not.
a) Find the middle node, reverse link list after that. Start comparing from head and the node after the middle node.