Google Interview Question
SDE1sCountry: United States
int arr[]={2,2,2,3};
HashSet<Integer> set=new HashSet<>();
Queue<Integer> temp=new LinkedBlockingQueue<>();
boolean flag=true;
for(int j=0;j<arr.length;j++){
flag=set.add(arr[j]);
if(!flag){
temp.add(arr[j]);
}
}
while(!temp.isEmpty()){
int k=temp.poll();
k=k+1;
while(!set.add(k)){
k=k+1;
}
}
System.out.println(set.toString());
Javascript -- O(n) time and O(1) space
- renemidouin December 14, 2017