Skip to main content

Missing integer(s) in the array


You have given two array e.g.
A[] and B[].

Difference between two arrays that A[] have two additional numbers than B[].
both the array is randomized and not in order.  

We have to find out both the number in array A[] in most effcient way. Dont try to sort and compare as time complexity is nlogn. Need a faster solution.


Assume We have elements in array A are a0, a1, a2, ................an
And Array B are b0, b1, b2, b3.....................bn.

Now as per above condition all the elements of B already present with A.
So we can represent like A[] = B[]+ai+aj where ai and aj is the missing number.

Step1: XOR all the elements for A[] XOR B[]. So result will ai XOR aj as remaining elements will be removed by XOR. 

Step2: Now take any bit set in above result. Assume we have result in variable result. Any bit set in result will be either set in ai or aj. Can not be in both the variable.  Assume set bit is 5th bit.

A B XOR
0  0   0
0  1   1
1  0   1
1  1   0

Now divide both the array A and B around set bit .  Any element of A whose fifth bit is set will be placed in upper half of array and element whose fifth bit is not set will go in lower half of array.


Now A will look like below


{a1,a2,a5, a8,.....},{a3,a4,a6,a7,.....}
Same for array B
{b1,b4,......},{b2,b3,......}


Now one unknown number will be in first half and another in second half.
Same done with array B will make sure above equation Afirst[]=Bfirst[]+ai and Asecond[]=Bsecond[]+aj still holds true.


Step3: Now XOR all the element for Afirst XOR Bfirst and result will be first unknown number.
            Repeat the same for second part of array and get the second unknown number.
Labels:

Comments

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

DEShaw Interview Questions

ther are N numbers frm 1 to N and starting from index 1 we will keep deleting every alternate going in cyclic order with array. Only one element will be left at the end. Tell us the index of element in array we started. e.g. there are 5 nums 1 2 3 4 5 then after 1st iteration 1 3 5 will be remained. .. then 1 will be next to be elliminated and then 5 3 will remain alone... give sum efficient algorithm to calculate which numer will remain at the end Answer: 2*(n-2^p)+1 where p=floor(log2 n)
Post a Comment
Read more

Scaling application

 We all wish that our application used by maximum people on Earth. To make sure we have the right scalable application, please follow below guidelines  1. Load balancing at all level of application i.e. web server, application server and DB server 2. Remote caching to be enabled for a fast response.  3. Load balancer will equally distribute the traffic to existing servers, what if enough capacity is not enough. We should have a mechanism to increase the server capacity (esp horizontally ).  All the cloud service provider has provision for autoscaling, so do Kubernetes.  Use them.  4. Most of the NoSQL DB comes with good support for horizontal scalability. So if you chosse NoSQL you can easily scale them. But if your application requires RDBMS (SQL) then plan should be with sharding in place.  5. Server should be stateless. Any server should be able to serve an incoming request. No local storage, no IP binding. Having said newly added server will start ...
Post a Comment
Read more