Given an array of 10-digit numbers, you have to find the number in the array which is the closest to all the other numbers. A number is said to be close to the other if there are less than k different digits at corresponding positions in the number. Eg: 1234567890 and 1234567789 differ at 3 places.
The input given was an array of numbers and the value of k. Numbers could be preceded with 0s. In case 2 numbers are equally close to all other numbers, return the least of the two.