CareerCup

public List<Integer> uniqueSetOfDuplicateValues(int[] array) {
HashSet<Integer> valueSet = new HashSet<Integer>();
List<Integer> uniqueSet = new ArrayList();
for(int I=0;i< array.length; i++) {
    if(uniqueSet.add(array[I]))
	continue;
   else 
	uniqueSet.add(array[I]);
}

return uniqueSet;
}

x = input("please enter integers")
a = x.split(' ')
print(a)
d  = {}
for a1 in a:
    if(d.get(a1)==None):
        d[a1] = 1
    else:
        print(d)
        print('duplicate',a1)
        break

x = input("please enter integers")
a = x.split(' ')
print(a)
d = {}
for a1 in a:
if(d.get(a1)==None):
d[a1] = 1
else:
print(d)
print('duplicate',a1)
break

In python:
vals, counts = np.unique(a, return_counts=True)
vals[counts>1]

result = []
for i in range(0, len(arr)):
        for j in range(i+1, len(arr)):
                if arr[i] == arr[j]:
                    result.append(arr[i])
print(result)

result = []
for i in range(0, len(arr)):
for j in range(i+1, len(arr)):
if arr[i] == arr[j]:
result.append(arr[i])
print(result)

set(list)

>>> def duplicates(l):
... d={}
... for i in l:
... d[i]=d.get(i,0)+1
... for k,v in d.items():
... if v>1:
... print(k,'found ',v)
...

>>> def duplicates(l):
... d={}
... for i in l:
... d[i]=d.get(i,0)+1
... for k,v in d.items():
... if v>1:
... print(k,'found ',v)
...

print("Input")
duparr = input().split(' ')
#duparr = [1,1,2,3,4,10,9,8,7,6]
print(duparr)
h = {}
for d in duparr:
    if(d in h):
        print('duplicate')
        break
    else:
        h[d] = 1
        print(h)