Skip to main content

Array

1. Given a arrary return an element not in array.
2. Previous problem with number will be in range of 0- (n-1).
3. Find the number repeating most number of times in a n size array with no in the range of 0-(n-1).
4. Find whether a[i]+a[j]=x in a sorted and unsorted array.
5. Maximum of two number without if statement.
6. Print 1-100 without loop, if, goto etc.
7. Find the only non-repeating number in a array.
8. Find the two number which is non-repeating in a array

I am posting questions here only. I will shortly update with answer to them.
Till then keep trying.

Comments

  1. AnonymousJuly 20, 2010 at 10:55 PM

    Solution 7:
    Do an XOR of all the elements. The value after XOR is the non repeating element as rest would become 0 since X ^ X is 0 and X ^ 0 is X.

    Solution 6:
    print(int n)
    {
    if(n==0)
    return;
    print(n-1);
    cout << " " << n ;
    }

    Solution 5:
    max of x and y:
    x ^ ((x^y) & -(x < y))

    Solution 4:
    For sorted array use binary search
    For unsorted array use a hash

    Solution 3
    Use a bucket sort since the range of numbers is known. Time is O(N) and space is also O(N)

    ReplyDelete
  2. AnonymousJuly 20, 2010 at 11:03 PM

    Solution 8:Find the two number which is non-repeating in a array
    Step 1: Do XOR of all elements. This is actually the XOR of the two non repeating elements as rest would cancel each other.
    Step 2: Any set bit in the final XOR is set in either the first element or the second. Find any set bit of this XOR say the rightmost by doing x & (x-1). Call this as set_bit
    Step 3: Divide the original array in two subsets. One that has set_bit as set and the other as not.
    Step4: Both sets would have one non repeating element. Now do XOR of each subsets and find the respective non repeating element.

    ReplyDelete

Post a Comment

Popular posts from this blog

Car Parking Problem

There is n parking slots and n-1 car already parked. Lets say car parked with initial arrangement and we want to make the car to be parked to some other arrangement. Lets say n = 5, inital = free, 3, 4, 1, 2 desired = 1, free, 2, 4 ,3 Give an algorithm with minimum steps needed to get desired arrangement. Told by one of my friend and after a lot of search i really got a nice solution. I will post solution in comment part
3 comments
Read more

HTTP/2 : what and why

HTTP History In 1989, the hypertext transfer protocol have been invented. HTTP/1.1 has been released in 1997 and took the longest pause in evolution. In 2015, Google has redrafted its inhouse SPDY protocol to HTTP/2 to optimize the web page load time.  HTTP/1.1 Pitfalls Too heavy and big protocol. Too many parts have been added as optional led to complicating the protocols with less of usage. Since HTTP1.1 release, web technology have seen tremendous change. Page size has been increased to MBs, the number to pages increased manifolds and parallel components making HTTP calls increased too.  Each HTTP request has a separate TCP connection and its handshake does add to page load time.  Head of line blocking has slowed the page load. We can have a maximum 8 parallel connection to the same domain. Due to increase in multiple components making separate HTTP calls, this has been a bottleneck.  HTTP/2 Solution Binary framing layer: HTTP/1.1 was text-only messaging, which wa...
Post a Comment
Read more

Two numbers with minimum difference

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...
1 comment
Read more