id stringlengths 35 39 | content stringlengths 44 3.85k | max_stars_repo_path stringlengths 52 57 |
|---|---|---|
refactory_data_question_3_wrong_3_262 | def remove_extras(lst):
for element in lst:
if lst.count(element) > 1:
lst.remove(element)
return lst
| ./refactory/data/question_3/code/wrong/wrong_3_262.py |
refactory_data_question_3_wrong_3_258 | def remove_extras(lst):
lst.sort()
i = len(lst)-1
while i > 0:
if lst[i] == lst[i - 1]:
lst.pop(i)
i=i-1
return lst
| ./refactory/data/question_3/code/wrong/wrong_3_258.py |
refactory_data_question_3_wrong_3_064 | def remove_extras(lst):
new_lst = lst[0]
for e in lst:
if e in new_lst:
continue
else:
new_lst.append(e)
return new_lst
| ./refactory/data/question_3/code/wrong/wrong_3_064.py |
refactory_data_question_3_wrong_3_215 | def remove_extras(lst):
i=0
while i<len(lst):
curr = lst[i]
new = []
for ele in lst:
if ele == curr:
continue
new += [ele,]
lst = new.copy
i +=1
return lst
| ./refactory/data/question_3/code/wrong/wrong_3_215.py |
refactory_data_question_3_wrong_3_174 | def remove_extras(lst):
for i in range(len(lst)):
print(lst[i:])
print(lst[i:].count(lst[i]))
if lst.count(lst[i]) > 1:
element = lst[i]
lst.reverse()
lst.remove(element)
lst.reverse()
return lst
| ./refactory/data/question_3/code/wrong/wrong_3_174.py |
refactory_data_question_3_wrong_3_284 | def remove_extras(lst):
for x in range(len(lst)):
if lst[x] in lst[:x] or lst[x] in ls[x+1:]:
lst.remove(lst[x])
return lst
| ./refactory/data/question_3/code/wrong/wrong_3_284.py |
refactory_data_question_3_wrong_3_242 | def remove_extras(lst):
new_list=[lst[0]]
for i in lst:
if i in new_list == True:
continue
else:
new_list.append(i)
return new_list
| ./refactory/data/question_3/code/wrong/wrong_3_242.py |
refactory_data_question_3_wrong_3_302 | def remove_extras(lst):
return list(set(lst))
| ./refactory/data/question_3/code/wrong/wrong_3_302.py |
refactory_data_question_3_wrong_3_145 | def remove_extras(lst):
new_lst = []
for i in lst:
new_lst.append(i)
if new_lst.count(i) > 1:
new_lst.pop
return new_lst
| ./refactory/data/question_3/code/wrong/wrong_3_145.py |
refactory_data_question_3_wrong_3_038 | def remove_extras(lst):
new_lst=()
for element in lst:
if element not in new_lst:
new_lst += (element,)
return new_lst
| ./refactory/data/question_3/code/wrong/wrong_3_038.py |
refactory_data_question_3_wrong_3_307 | def remove_extras(lst):
t=[]
for i in lst:
if i not in t:
t.append(i)
| ./refactory/data/question_3/code/wrong/wrong_3_307.py |
refactory_data_question_3_wrong_3_269 | def remove_extras(lst):
return list(OrderedDict.fromkeys(lst))
| ./refactory/data/question_3/code/wrong/wrong_3_269.py |
refactory_data_question_3_wrong_3_206 | def remove_extras(lst):
lst.sort()
result = []
for i in lst:
if i not in result:
result = result + [i]
return result
| ./refactory/data/question_3/code/wrong/wrong_3_206.py |
refactory_data_question_3_wrong_3_037 | def remove_extras(lst):
output = []
for entry in lst:
if output.count[entry] == 0:
output == output.append[entry]
return output
| ./refactory/data/question_3/code/wrong/wrong_3_037.py |
refactory_data_question_3_wrong_3_025 | def remove_extras(lst):
return list(set(lst))
| ./refactory/data/question_3/code/wrong/wrong_3_025.py |
refactory_data_question_3_wrong_3_077 | def remove_extras(lst):
newlst=[]
for i in lst:
if i not in newlst:
newlst=newlst.append(i)
return newlst
# your code here
pass
| ./refactory/data/question_3/code/wrong/wrong_3_077.py |
refactory_data_question_3_wrong_3_251 | def remove_extras(lst):
result = lst
for i in result:
if lst.count(i) > 1:
result.remove(i)
continue
return result
pass
| ./refactory/data/question_3/code/wrong/wrong_3_251.py |
refactory_data_question_3_wrong_3_138 | def remove_extras(lst):
lst1 = []
for i in range(len(lst)):
if lst[i] in lst1:
lst1.remove(lst[i])
return lst1
else:
return []
| ./refactory/data/question_3/code/wrong/wrong_3_138.py |
refactory_data_question_3_wrong_3_264 | def remove_extras(lst):
return list(set(lst))
| ./refactory/data/question_3/code/wrong/wrong_3_264.py |
refactory_data_question_3_wrong_3_017 | def remove_extras(lst):
for i in range(len(lst)):
for j in range(j+1, len(lst)):
if lst[j] == lst[i]:
lst = lst[:j] + lst[j+1:]
return lst
| ./refactory/data/question_3/code/wrong/wrong_3_017.py |
refactory_data_question_3_wrong_3_076 | def remove_extras(list):
list.reverse()
for element in list:
if list.count(element)>1:
list.remove(element)
return list.reverse()
| ./refactory/data/question_3/code/wrong/wrong_3_076.py |
refactory_data_question_3_wrong_3_140 | def remove_extras(lst):
my_lst = []
for i in lst:
if i not in my_lst:
my_lst.append(i)
return my_lst
| ./refactory/data/question_3/code/wrong/wrong_3_140.py |
refactory_data_question_3_wrong_3_034 | def remove_extras(lst):
new_lst = []
for ele in lst:
if not (ele in new_lst):
new_lst.insert(len[new_lst]-1, ele)
return new_lst
| ./refactory/data/question_3/code/wrong/wrong_3_034.py |
refactory_data_question_3_wrong_3_259 | def remove_extras(lst):
new_list = []
for number in list:
if number not in new_list:
new_list.append(number)
return new_list
| ./refactory/data/question_3/code/wrong/wrong_3_259.py |
refactory_data_question_3_wrong_3_039 | def remove_extras(lst):
return list(set(lst))
| ./refactory/data/question_3/code/wrong/wrong_3_039.py |
refactory_data_question_3_wrong_3_159 | def remove_extras(lst):
newlist = []
for i in lst:
if i not in newlist:
newlist.append(i)
| ./refactory/data/question_3/code/wrong/wrong_3_159.py |
refactory_data_question_3_wrong_3_139 | def remove_extras(lst):
lst1 = []
for i in range(len(lst)):
if lst[i] in lst1:
lst1.remove(lst[i])
return lst1
else:
return lst
| ./refactory/data/question_3/code/wrong/wrong_3_139.py |
refactory_data_question_3_wrong_3_290 | def remove_extras(lst):
new_list=[]
for e in lst:
if not is_same(element,new_list):
new_list.append(element)
else:
continue
return new_list
def is_same(test,lst):
for e in lst:
if e == test:
return True
else:
continue
... | ./refactory/data/question_3/code/wrong/wrong_3_290.py |
refactory_data_question_3_wrong_3_114 | def remove_extras(lst):
# your code here
new_lst = []
for i in lst:
if i not in lst:
new_lst += [i,]
return new_lst
| ./refactory/data/question_3/code/wrong/wrong_3_114.py |
refactory_data_question_3_wrong_3_105 | def remove_extras(lst):
for k in range(len(lst)):
if lst[k] in lst[:k]:
return lst.remove(lst[k])
else:
return lst
| ./refactory/data/question_3/code/wrong/wrong_3_105.py |
refactory_data_question_3_wrong_3_300 | def remove_extras(lst):
new = []
for x in lst:
if x not in new:
new.append(x)
return x
| ./refactory/data/question_3/code/wrong/wrong_3_300.py |
refactory_data_question_3_wrong_3_252 | def remove_extras(lst):
new = []
for ele in lst:
if ele not in lst:
new = new + [ele,]
return new# your code here
| ./refactory/data/question_3/code/wrong/wrong_3_252.py |
refactory_data_question_3_wrong_3_179 | def remove_extras(lst):
# your code here
n = 0
while n < len(lst):
if lst[n] in lst[n+1:]:
lst = lst[:n+1] + lst[n+1:].remove(lst[n])
n = n + 1
return lst
| ./refactory/data/question_3/code/wrong/wrong_3_179.py |
refactory_data_question_3_wrong_3_093 | def remove_extras(lst):
sub_list = []
for elem in lst:
if elem not in lst[lst.index(elem)+1:]:
return lst
elif elem in lst[lst.index(elem)+1:]:
sub_list += lst[lst.index(elem)+1:]
while elem in sub_list:
sub_list.remove(elem)
... | ./refactory/data/question_3/code/wrong/wrong_3_093.py |
refactory_data_question_3_wrong_3_035 | def remove_extras(lst):
new_lst = []
for ele in lst:
if not (ele in new_lst):
new_lst.insert(0, ele)
return new_lst
| ./refactory/data/question_3/code/wrong/wrong_3_035.py |
refactory_data_question_3_wrong_3_014 | def remove_extras(lst):
result = []
for i in lst:
if i not in result:
result += result + list(i)
return result
| ./refactory/data/question_3/code/wrong/wrong_3_014.py |
refactory_data_question_3_wrong_3_168 | def remove_extras(lst):
a = []
for repeat in range(len(lst) + 1):
if repeat != a:
a += repeat
return a
| ./refactory/data/question_3/code/wrong/wrong_3_168.py |
refactory_data_question_3_wrong_3_182 | def remove_extras(lst):
a =[lst[0]]
i = lst[0]
for j in range (1,len(lst)): #while lst is not empty
if i == lst[j]:
continue
else:
a += [lst[j]]
return a
| ./refactory/data/question_3/code/wrong/wrong_3_182.py |
refactory_data_question_3_wrong_3_111 | def remove_extras(lst):
final=[]
for x in lst:
if x !=final:
final.append(x)
return final
pass
| ./refactory/data/question_3/code/wrong/wrong_3_111.py |
refactory_data_question_3_wrong_3_040 | def remove_extras(lst):
s = []
for i in lst:
if i not in lst:
s.append(i)
return s
# your code here
pass
| ./refactory/data/question_3/code/wrong/wrong_3_040.py |
refactory_data_question_3_wrong_3_153 | def remove_extras(lst):
result = []
for ele in lst:
if x not in result:
result += x
return result
| ./refactory/data/question_3/code/wrong/wrong_3_153.py |
refactory_data_question_3_wrong_3_107 | def remove_extras(lst):
# your code here
result = (lst[0],)
for item in lst[1:]:
if item in result:
continue
else:
result +=(item,)
return result
| ./refactory/data/question_3/code/wrong/wrong_3_107.py |
refactory_data_question_3_wrong_3_180 | def remove_extras(lst):
lst.sort()
i=0
while i<len(lst):
if i==len(lst)-1:
break
elif lst[i]==lst[i+1]:
lst.remove(lst[i])
else:
i+=1
return lst
| ./refactory/data/question_3/code/wrong/wrong_3_180.py |
refactory_data_question_3_wrong_3_241 | def remove_extras(lst):
new_lst = []
if lst == []:
return new_lst
elif lst[0] not in lst:
new_lst += lst[0] + remove_extras(lst[1:])
else:
new_lst += remove_extras(lst[1:])
| ./refactory/data/question_3/code/wrong/wrong_3_241.py |
refactory_data_question_3_wrong_3_282 | def remove_extras(lst):
new_list = ()
for x in lst:
if x not in new_list:
new_list += x
return new_list
| ./refactory/data/question_3/code/wrong/wrong_3_282.py |
refactory_data_question_3_wrong_3_192 | def remove_extras(lst):
count=0
rev_lst=lst.reverse()
ori_len=len(lst)
for i in range(ori_len):
if rev_lst[i] in rev_lst[i+1:]:
lst.pop(ori_len-i-1)
return lst
| ./refactory/data/question_3/code/wrong/wrong_3_192.py |
refactory_data_question_3_wrong_3_081 | def remove_extras(lst):
newlst=[]
for i in lst:
if i not in newlst:
newlst=newlst.append(i)
return newlst
# your code here
pass
| ./refactory/data/question_3/code/wrong/wrong_3_081.py |
refactory_data_question_3_wrong_3_006 | def remove_extras(lst):
new_list = []
for number in list:
if number not in new_list:
new_list.append(number)
return new_list
| ./refactory/data/question_3/code/wrong/wrong_3_006.py |
refactory_data_question_3_wrong_3_044 | def remove_extras(lst):
new_lst = []
for i in lst:
if i == lst[i+1]:
continue
else:
new_list += i
return new_lst
| ./refactory/data/question_3/code/wrong/wrong_3_044.py |
refactory_data_question_3_wrong_3_010 | def remove_extras(lst):
for i in range(len(lst)):
if lst[i] in lst[:i]+lst[i+1:]:
lst.pop(i)
return lst
| ./refactory/data/question_3/code/wrong/wrong_3_010.py |
refactory_data_question_3_wrong_3_062 | def remove_extras(lst):
o = []
for i in lst:
if i not in o:
o.append(lst.remove(i))
return o
| ./refactory/data/question_3/code/wrong/wrong_3_062.py |
refactory_data_question_3_wrong_3_121 | def remove_extras(lst):
seq = (lst[0],)
for i in lst:
if i not in seq:
seq = seq + (i,)
return seq
| ./refactory/data/question_3/code/wrong/wrong_3_121.py |
refactory_data_question_3_wrong_3_088 | def remove_extras(lst):
sub_list = []
for elem in lst:
if elem not in lst[lst.index(elem)+1:]:
return lst
elif elem in lst[lst.index(elem)+1:]:
sub_list += lst[lst.index(elem)+1:]
sub_list.remove(elem)
return lst[:lst.index(elem)] + sub_list
| ./refactory/data/question_3/code/wrong/wrong_3_088.py |
refactory_data_question_3_wrong_3_080 | def remove_extras(lst):
new_lst = []
for x in lst:
if x not in new_lst:
new_lst += [x]
return lst
| ./refactory/data/question_3/code/wrong/wrong_3_080.py |
refactory_data_question_3_wrong_3_020 | def remove_extras(lst):
i = 0
while i < len(lst):
j = i + 1
while j < len(lst):
if lst[i] == lst[j]:
lst = lst[:j] + lst[j+1:]
j += 1
return lst
| ./refactory/data/question_3/code/wrong/wrong_3_020.py |
refactory_data_question_3_wrong_3_224 | def remove_extras(lst):
for i in range(0, len(lst)-1):
if lst.count(lst[i]) > 1:
lst.pop(i)
return lst
| ./refactory/data/question_3/code/wrong/wrong_3_224.py |
refactory_data_question_3_wrong_3_278 | def remove_extras(lst):
if lst == []:
return None
else:
result = [lst[0],]
for e in lst:
if e not in result:
result.append(e)
else:
continue
return result
| ./refactory/data/question_3/code/wrong/wrong_3_278.py |
refactory_data_question_3_wrong_3_043 | def remove_extras(lst):
return list(set(lst))
| ./refactory/data/question_3/code/wrong/wrong_3_043.py |
refactory_data_question_3_wrong_3_303 | def remove_extras(lst):
a = []
for i in lst:
if i in a:
continue
a.extend(i)
return a
| ./refactory/data/question_3/code/wrong/wrong_3_303.py |
refactory_data_question_3_wrong_3_082 | def remove_extras(lst):
new_lst = [lst[0]]
for i in range(0,len(lst)):
a=lst[i]
for h in range(i,len(lst)):
if a!=lst[h]:
ele=lst[h]
new_lst.append(ele)
return new_lst
return new_lst
| ./refactory/data/question_3/code/wrong/wrong_3_082.py |
refactory_data_question_3_wrong_3_115 | def remove_extras(lst):
# your code here
return list(set(lst))
| ./refactory/data/question_3/code/wrong/wrong_3_115.py |
refactory_data_question_3_wrong_3_090 | def remove_extras(lst):
result=[]
for i in lst:
if i in lst[:i]:
continue
result+= [i]
return result
| ./refactory/data/question_3/code/wrong/wrong_3_090.py |
refactory_data_question_3_wrong_3_007 | def remove_extras(lst):
lst1 = lst.reverse
for i in lst:
if lst.count(i) >1:
lst1.remove(i) * (i-1)
return lst1.reverse
| ./refactory/data/question_3/code/wrong/wrong_3_007.py |
refactory_data_question_3_wrong_3_280 | def remove_extras(lst):
new_list = ()
for x in lst:
if x not in new_list:
new_list.append(x)
return new_list
| ./refactory/data/question_3/code/wrong/wrong_3_280.py |
refactory_data_question_3_wrong_3_210 | def remove_extras(lst):
new_list = []
for elem in lst:
if elem not in new_list:
new_list += new.append(elem)
return new_list
| ./refactory/data/question_3/code/wrong/wrong_3_210.py |
refactory_data_question_3_wrong_3_220 | def remove_extras(lst):
for i in lst:
if lst.count(i) > 1:
lst.remove(i)
return lst
| ./refactory/data/question_3/code/wrong/wrong_3_220.py |
refactory_data_question_3_wrong_3_261 | def remove_extras(lst):
lst.sort()
i = len(lst)-1
while i > 0:
if lst[i] == lst[i - 1]:
lst.pop(i)
i=i-1
return lst
| ./refactory/data/question_3/code/wrong/wrong_3_261.py |
refactory_data_question_3_wrong_3_123 | def remove_extras(lst):
seq = (lst[0],)
for i in lst:
if i not in seq:
seq = seq + (i,)
return seq
| ./refactory/data/question_3/code/wrong/wrong_3_123.py |
refactory_data_question_3_wrong_3_231 | def remove_extras(lst):
lst = []
for i in lst:
if lst.count(i) == 1:
lst += i
return lst
| ./refactory/data/question_3/code/wrong/wrong_3_231.py |
refactory_data_question_3_wrong_3_291 | def remove_extras(lst):
lst1 = []
for i in lst:
if i not in newlist:
lst1.append(i)
return lst1
| ./refactory/data/question_3/code/wrong/wrong_3_291.py |
refactory_data_question_3_wrong_3_056 | def remove_extras(lst):
new_lst = []
for i in lst:
if lst not in new_lst:
new_lst += [i,]
return new_lst
pass
| ./refactory/data/question_3/code/wrong/wrong_3_056.py |
refactory_data_question_3_wrong_3_189 | def remove_extras(lst):
for i in lst:
lst.remove(i)
lst.remove(i)
return lst
| ./refactory/data/question_3/code/wrong/wrong_3_189.py |
refactory_data_question_3_wrong_3_068 | def remove_extras(lst):
extra = []
for i in lst:
if i not in lst:
continue
else:
extra += i
return lst.remove(int(extra))
| ./refactory/data/question_3/code/wrong/wrong_3_068.py |
refactory_data_question_3_wrong_3_013 | def remove_extras(lst):
result = []
for i in lst:
if i not in result:
result += result + i
return result
| ./refactory/data/question_3/code/wrong/wrong_3_013.py |
refactory_data_question_3_wrong_3_128 | def remove_extras(lst):
i = -1
while i > (-len(lst)):
if lst[i] in lst[:i]:
lst.pop[i]
i = i + 1
return lst
| ./refactory/data/question_3/code/wrong/wrong_3_128.py |
refactory_data_question_3_wrong_3_211 | def remove_extras(lst):
for element in lst:
for count in lst:
if count +2 > len(lst):
return lst
elif lst[count+1] == element:
lst.remove(element)
continue
return lst
| ./refactory/data/question_3/code/wrong/wrong_3_211.py |
refactory_data_question_3_wrong_3_296 | def remove_extras(lst):
new = []
x = 0
while x < len(lst)+1:
if lst[x] in new:
new += lst[x]
else:
continue
return new
| ./refactory/data/question_3/code/wrong/wrong_3_296.py |
refactory_data_question_3_wrong_3_050 | def remove_extras(lst):
lst.sort()
store = []
for ele in lst:
if ele not in store:
store += [ele]
return store
| ./refactory/data/question_3/code/wrong/wrong_3_050.py |
refactory_data_question_3_wrong_3_230 | def remove_extras(lst):
new_lst = []
for i in lst:
if i not in lst[i:]:
new_lst = new_lst.append(i)
return new_lst
pass
| ./refactory/data/question_3/code/wrong/wrong_3_230.py |
refactory_data_question_3_wrong_3_154 | def remove_extras(lst):
result = []
for ele in lst:
if ele not in result:
result += ele
return result
| ./refactory/data/question_3/code/wrong/wrong_3_154.py |
refactory_data_question_3_wrong_3_005 | def remove_extras(lst):
length = len(lst)
result = [lst[0]]
for i in range(1,length):
if lst[i] not in result:
result = result + [lst[i]]
return result
| ./refactory/data/question_3/code/wrong/wrong_3_005.py |
refactory_data_question_3_wrong_3_203 | def remove_extras(lst):
for elem in lst:
while elem in lst[lst.index(elem)+1:]:
lst.remove(elem)
return lst
| ./refactory/data/question_3/code/wrong/wrong_3_203.py |
refactory_data_question_3_wrong_3_201 | def remove_extras(lst):
lst1 = []
for item in lst:
if (item in lst1):
continue
else:
lst1 += item
return lst1
| ./refactory/data/question_3/code/wrong/wrong_3_201.py |
refactory_data_question_3_wrong_3_158 | def remove_extras(lst):
new_lst = lst
for i in lst:
n = new_lst.count(i)
while True:
if n <= 1:
break
else:
new_lst.remove(i)
n -= 1
return new_lst
| ./refactory/data/question_3/code/wrong/wrong_3_158.py |
refactory_data_question_3_wrong_3_132 | def remove_extras(lst):
i = -1
while i > (-len(lst)):
if lst[i] in lst[:i]:
lst.pop(i)
i = i - 1
return lst
| ./refactory/data/question_3/code/wrong/wrong_3_132.py |
refactory_data_question_3_wrong_3_223 | def remove_extras(lst):
new_lst = []
for i in list:
if i not in lst[i:]:
new_lst = new_lst.append(i)
return new_lst
pass
| ./refactory/data/question_3/code/wrong/wrong_3_223.py |
refactory_data_question_3_wrong_3_066 | def remove_extras(lst):
result =[]
for element in lst:
if element not in result:
result.append[element]
return result
| ./refactory/data/question_3/code/wrong/wrong_3_066.py |
refactory_data_question_3_wrong_3_162 | def remove_extras(lst):
newlst = []
for i in lst:
if i not in lst:
newlst.append(i)
return newlst
| ./refactory/data/question_3/code/wrong/wrong_3_162.py |
refactory_data_question_3_wrong_3_176 | def remove_extras(lst):
for i in range(len(lst)-1):
if lst[i] in lst[i+1:]:
lst.pop(i)
return lst
| ./refactory/data/question_3/code/wrong/wrong_3_176.py |
refactory_data_question_3_wrong_3_276 | def remove_extras(lst):
result = [lst[0],]
for e in lst:
if e not in result:
result.append(e)
else:
continue
return result
| ./refactory/data/question_3/code/wrong/wrong_3_276.py |
refactory_data_question_3_wrong_3_287 | def remove_extras(lst):
for element in lst:
while lst.count(element) > 1:
lst.remove(element)
if lst.count(element) == 1:
break
return lst
| ./refactory/data/question_3/code/wrong/wrong_3_287.py |
refactory_data_question_3_wrong_3_120 | def remove_extras(lst):
seq = (lst[0],)
for i in lst:
if i not in seq:
seq = seq + (lst[i],)
return seq
pass
| ./refactory/data/question_3/code/wrong/wrong_3_120.py |
refactory_data_question_3_wrong_3_142 | def remove_extras(lst):
for i in range (0, len(lst)):
for j in range (i + 1, len(lst)):
if lst[j] == lst[i]:
lst.pop(j)
print (lst)
else:
continue
return remove_extras(lst)
| ./refactory/data/question_3/code/wrong/wrong_3_142.py |
refactory_data_question_3_wrong_3_255 | from collections import OrderedDict
def remove_extras(lst):
return lists(OrderedDict.fromkeys(lst))
| ./refactory/data/question_3/code/wrong/wrong_3_255.py |
refactory_data_question_3_wrong_3_058 | from collections import OrderedDict
def remove_extras(lst):
return (OrderedDict.fromkeys(lst))
| ./refactory/data/question_3/code/wrong/wrong_3_058.py |
refactory_data_question_3_wrong_3_306 | def remove_extras(lst):
return list(set(lst))
| ./refactory/data/question_3/code/wrong/wrong_3_306.py |
refactory_data_question_3_wrong_3_167 | def remove_extras(lst):
newlst = lst(0)
for i in lst:
if i not in newlst:
newlst += [i]
return newlst
| ./refactory/data/question_3/code/wrong/wrong_3_167.py |
refactory_data_question_3_wrong_3_289 | def remove_extras(lst):
new_list=[]
for i in range(len(lst)):
judge=0
for j in range(i):
if lst[i]==lst[j]:
judge=1
if judge==0:
new_list+=[lst[i],]
return new_lst
# your code here
pass
| ./refactory/data/question_3/code/wrong/wrong_3_289.py |
refactory_data_question_3_wrong_3_183 | def remove_extras(lst):
removed = []
for e in lst:
if e not in lst:
removed.append(e)
return removed
| ./refactory/data/question_3/code/wrong/wrong_3_183.py |
refactory_data_question_3_wrong_3_023 | def remove_extras(lst):
list1 = []
for i in lst:
if i not in list1:
list1 += i
return list1
| ./refactory/data/question_3/code/wrong/wrong_3_023.py |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.