Skip to main content

The Missing Number - Easy

For my first post, let's start with an easy one. It's a popular question among interviewers and you prolly have heard about this one. Never the less, let's solve it, for old times sake. :)

Problem : Given an Array of integers of size N. The array contains all the numbers from 1 to N in arbitrary order. But one number (say X) has been replaced with 0. Find the missing number in the most efficient way possible.

Solution:

Before we get to the solution, we'll build a test case using the following Python Snippet.

The Naive method is an O(n^2) algorithm, where we perform a linear search (ie O(n) ) for each element 1-N.
For small values of N, this is perfectly fine but can we do better?

Of course, with a small bit of help from 8th grade maths. Hopefully, you remember that,
1+2+3....+n = n (n+1)/2
So how does that help? Say we didn't have any missing number and the problem was simply to sum all the elements of the array? Since we know the array contains all the values of the range [1,N] we know the sum will be N * (N + 1) /2 

 If we replaced one arbitrary element with 0, the expected sum will be (N * (N + 1) / 2) - X  
But we can calculate the Expected sum by iterating through the array and adding all the elements, so we finally have
X = (N * (N+1) / 2) - sum(array)
Here's the Python solution
Now, the inbuilt sum() function in Python is linear.

This solution is perfectly fine for Python, but if we translate this to an High Level Language (HLL) like Java or C, you'll end up with this.
Can you spot the problem with the above snippet? How will you solve it? Answer during the next update.

Update: Python supports arbitrary precision numbers by default, unlike Java. Therefore the above code might fail for Large values of N. More specifically N > sqrt(Integer.MAX_VALUE). How do we solve it? Use a bigger datatype (long,BigInteger).

Alternate Solutions:

Using a Hash Table/Bit Array: This solution is quite obvious. Have a Bit Array of size N, Iterate over the array and mark true the index of the bit array for each value in the array. Find the only element that is false.
Note: If there were multiple numbers missing, this will find all of them. So this is probably the best method for multiple missing numbers. We'll discuss other methods in the future.
Space Complexity : O(n/8), Time : O(n)

The XOR method : This is pretty smart method and doesn't even have the possibility of Integer Overflows. The idea is we can determine (1^2^3....^N) in O(1). (see below) Say P = (1 ^ 2 ^ .... ^ N), we then Xor all the values in the Array which will be Q = (1^2^...(X-1)^(X+1)^....N)
Our missing X = P ^ Q

To find the the Xor result of the range 1 to N, we observe the following pattern.

N = 0, P= 0
1,1
2,3
3,0
4,4
.....
84,84
85,1
86,87
87,0
88,88


The pattern repeats with a period of 4,

  1. When N is divisible by 4, the Xored value is N itself
  2. When N % 4 is 1, the Xored value is 1
  3. When N % 4 is 2, the Xored value is N+1
  4. When N % 4 is 3, the Xored value is 0
Here's a small python snippet for the same. Time Complexity : O(n)

You can find the entire source code here.
Labels:

Comments

Post a Comment

Popular posts from this blog

Find Increasing Triplet Subsequence - Medium

Problem - Given an integer array A[1..n], find an instance of i,j,k where 0 < i < j < k <= n and A[i] < A[j] < A[k]. Let's start with the obvious solution, bruteforce every three element combination until we find a solution. Let's try to reduce this by searching left and right for each element, we search left for an element smaller than the current one, towards the right an element greater than the current one. When we find an element that has both such elements, we found the solution. The complexity of this solution is O(n^2). To reduce this even further, One can simply apply the longest increasing subsequence algorithm and break when we get an LIS of length 3. But the best algorithm that can find an LIS is O(nlogn) with O( n ) space . An O(nlogn) algorithm seems like an overkill! Can this be done in linear time? The Algorithm: We iterate over the array and keep track of two things. The minimum value iterated over (min) The minimum increa...
2 comments
Read more

Inversion Count - Medium

Given an Array A[1..n] of distinct integers find out how many instances are there where A[i] > A[j] where i < j. Such instances can be called Inversions. Say, [100,20,10,30] the inversions are (100,20), (100, 10), (100,30), (20,10) and the count is of course 4 The question appears as an exercise in the  Chapter 4 of Introduction to Algorithms .  (3rd Edition) As per our tradition we'll start with the worst algorithm and incrementally improve upon it. So on with it. So the complexity of the algorithm is O(n^2). We can do this even faster using divide and conquer, more aptly if we use a variation of Merge Sort . To do this, unfortunately, we will have to mutate the array. The key to the algorithm is to understand that in an ascending sorted array the inversion count is zero. Say [10,20,30] If we perhaps have an element 100 before the rest of the array, the inversion count becomes 3. [100,10,20,30]. If we placed the 100 at the second position the in...
Post a Comment
Read more

Merge k-sorted lists - Medium

Problem - Given k-sorted lists, merge them into a single sorted list. A daft way of doing this would be to copy all the list into a new array and sorting the new array. ie O(n log(n)) The naive method would be to simply perform k-way merge similar to the auxiliary method in Merge Sort. But that is reduces the problem to a minimum selection from a list of k-elements. The Complexity of this algorithm is an abysmal O(nk). Here's how it looks in Python. We maintain an additional array called Index[1..k] to maintain the head of each list. We improve upon this by optimizing the minimum selection process by using a familiar data structure, the Heap! Using a MinHeap, we extract the minimum element from a list and then push the next element from the same list into the heap, until all the list get exhausted. This reduces the Time complexity to O(nlogk) since for each element we perform O(logk) operations on the heap. An important implementation detail is we need to keep track ...
Post a Comment
Read more