Code to find a repeated number in an array

Question

Samit Bhunia · Accepted Answer

public void unique(){
			
			int[] numbers = {1,2,2,3,4,5,5,6,7};
			
			Arrays.sort(numbers);
			System.out.println("Sorted : "+numbers.length);
			
			for(int i = 1; i < numbers.length; i++) {
			    if(numbers[i] == numbers[i - 1]) {
			        System.out.println("Duplicate: " + numbers[i]);
			    }
			}
		}

Shailaja Swami · Answer

public void CountTheRepeatedNumber(int[] arr){
Map map=new Hashmap();
for(Integer num:arr){
if(map.containsKey(num)){
map.put(num,map.get(num)+1); //increase the value if it is repeated
}
else{
map.put(num,1); // put 1 into value if number is first time present
}
}

Set key=map.KeySet(); //return you all the distinct integer number
for(Integer i:key){
if(map.get(i)>=0){
syso(i +" is " +map.get(i) +"Times in an array"); //simply print this  so u will get repeated numbers with count and just print it
}
}

Shabana Khan · Answer

//Finding the number which appeared twice
public static void findDuplicates(int[] a)
{
Map hashmap = new HashMap();
for(int i=0;i entries : hashmap.entrySet())
{
if(entries.getValue()>1)
{
System.out.print(entries.getKey()+" ");
}
}
}

Oracle

Oracle interview question

Interview Answers

Followed companies

Job searches

Bowls

Want the inside scoop on your own company?