There are 199 elements in array. It has only one distinct value? How will find this distinct value? Also for solution please tell about O(n)?How can you make it more efficient?

Question

Anonymous2 · Accepted Answer

Above answer won't work on a data set like: {3, 3, 3, 2, 2, 12} where there's an odd number of non-unique values.

The easy answer is that you could hash each element into a hash table which just contains a counter for each key add.  Then you could go through the array again and look at the hash table to find the element that was only added once.

Laiq B. · Answer

...
		for(int i=0 ; i entity : map.entrySet()){
			if (entity.getValue() == 1){
				System.out.println("distinct element is: " + entity.getKey());
				break;
			}
		}

Anoymous · Answer

XOR all the elements. 198 are the same. The result will be 0 for them: A XOR A = 0. The result will be the distinct value.

Anonymous · Answer

Forgot to indicate: 0 XOR B = B. Therefore, the overall result will be the distinct B.

Amazon

Amazon interview question

Interview Answers

Want the inside scoop on your own company?

Bowls

Followed companies

Job searches