Breaking News: Grepper is joining You.com. Read the official announcement!

first duplicate

vip_codes answered on May 15, 2022 Popularity 3/10 Helpfulness 1/10

answer first duplicate

related first duplicate

first duplicate

Comment

def solution(a):
    
    arr = []
    
    for i in range(len(a)):
        for j in range(i+1,len(a)):
            if a[i]==a[j]:
                hash.append(j)
    if len(hash) == 0:
        return -1
    else:
        idx = min(hash)
        return a[idx]

a = [2, 3, 4, 6, 5, 3]
Solution(a)

Popularity 3/10 Helpfulness 1/10 Language python

Source: Grepper

Tags: python

Link to this answer
Share Copy Link

Contributed on May 15 2022

vip_codes

0 Answers Avg Quality 2/10

Closely Related Answers

first duplicate

Comment

def Solution(a):
  arr = []
  value=[]
  for i in range(len(a)):
    if a[i] not in hash:
      hash.append(a[i])
    else:
      value.append(i)
  if len(value) ==0:
    return -1
  else:
    idx = min(value)
    return a[idx]

# a = [1,2,3,4,4,2]
a=[1,2,3,4]
Solution(a)

Popularity 3/10 Helpfulness 1/10 Language python

Source: Grepper

Tags: python

Link to this answer
Share Copy Link

Contributed on May 15 2022

vip_codes

0 Answers Avg Quality 2/10

Continue with Google

By continuing, I agree that I have read and agree to Greppers's Terms of Service and Privacy Policy.

first duplicate

Contents

More Related Answers

first duplicate

Closely Related Answers

first duplicate

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.