submission_id
int32 10
42.5k
| func_code
stringlengths 22
782
| assignment_id
stringlengths 4
23
| func_name
stringlengths 4
23
| description
stringlengths 26
128
| test
stringlengths 45
1.22k
| correct
bool 2
classes | user
stringlengths 36
36
| academic_year
int32 2.02k
2.02k
|
|---|---|---|---|---|---|---|---|---|
15,453 | def fibonacci(n):
i = 1
z = 0
x = 0
if n > 0:
while i < n:
x = i
i = i + z
z = x
return i
else:
return 0 | fibonacci_recur | fibonacci | Recursively compute the value of the fibonacci series at position n. | assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657 | false | 329aa290-1bfb-4cf3-82e0-ca13ee54db0f | 2,016 |
41,254 | def search(str, letter):
for item in str:
if item == letter:
return True
return False | search_recur | search | Recursively search for a letter in a string | assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True | true | 329aa290-1bfb-4cf3-82e0-ca13ee54db0f | 2,016 |
18,896 | def index(str, letter, x):
i = 0
while i < len(str):
if str[i] == letter:
return i
i = i + 1
return -1 | index_recur | index | Recursively search for the position of letter in str, return -1 if it is not there. | assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2 | true | 329aa290-1bfb-4cf3-82e0-ca13ee54db0f | 2,016 |
16,255 | def fibonacci(n):
i = 1
z = 0
x = 0
if n > 0:
while i < n:
x = i
i = i + z
z = x
return i
else:
return 0 | fibonacci_recur | fibonacci | Recursively compute the value of the fibonacci series at position n. | assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657 | false | 329aa290-1bfb-4cf3-82e0-ca13ee54db0f | 2,016 |
22,860 | def fibonacci(n):
i = 1
z = 0
x = 0
if n > 0:
while i < n:
x = i
i = i + z
z = x
return i
else:
return 0 | fibonacci_recur | fibonacci | Recursively compute the value of the fibonacci series at position n. | assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657 | false | 329aa290-1bfb-4cf3-82e0-ca13ee54db0f | 2,016 |
34,464 | def fibonacci(n):
i = 1
z = 0
x = 0
if n > 0:
while i < n:
x = i
i = i + z
z = x
return i
else:
return 0 | fibonacci_recur | fibonacci | Recursively compute the value of the fibonacci series at position n. | assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657 | false | 329aa290-1bfb-4cf3-82e0-ca13ee54db0f | 2,016 |
4,785 | def search(str, letter):
for item in str:
if item == letter:
return True
return False | search_recur | search | Recursively search for a letter in a string | assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True | true | 329aa290-1bfb-4cf3-82e0-ca13ee54db0f | 2,016 |
27,889 | def index(str, letter, x):
i = 0
while i < len(str):
if str[i] == letter:
return i
i = i + 1
return -1 | index_recur | index | Recursively search for the position of letter in str, return -1 if it is not there. | assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2 | true | 329aa290-1bfb-4cf3-82e0-ca13ee54db0f | 2,016 |
8,659 | def index(str, letter, x):
i = 0
while i < len(str):
if str[i] == letter:
return i
i = i + 1
return -1 | index_recur | index | Recursively search for the position of letter in str, return -1 if it is not there. | assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2 | true | 329aa290-1bfb-4cf3-82e0-ca13ee54db0f | 2,016 |
19,192 | def search(str, letter):
for item in str:
if item == letter:
return True
return False | search_recur | search | Recursively search for a letter in a string | assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True | true | 329aa290-1bfb-4cf3-82e0-ca13ee54db0f | 2,016 |
33,548 | def index(str, letter):
i = 0
if letter in str:
c = letter[0]
for ch in str:
if ch == c:
if str[i:i + len(letter)] == letter:
return i
i += 1
return -1 | index_recur | index | Recursively search for the position of letter in str, return -1 if it is not there. | assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2 | false | 52070898-b2dd-4882-a9a9-65bd9d55725a | 2,016 |
20,182 | def fibonacci(n):
if n == 0:
return 0
elif n == 1:
return 1
else:
return fibonacci(n - 1) + fibonacci(n - 2) | fibonacci_recur | fibonacci | Recursively compute the value of the fibonacci series at position n. | assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657 | true | 52070898-b2dd-4882-a9a9-65bd9d55725a | 2,016 |
6,967 | def search(str, letter):
for item in str:
if item == letter:
return True
return False | search_recur | search | Recursively search for a letter in a string | assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True | true | 52070898-b2dd-4882-a9a9-65bd9d55725a | 2,016 |
2,795 | def index(str, letter):
i = 0
if letter in str:
x = letter[0]
for ch in str:
if ch == x:
if str[i:i + len(letter)] == letter:
return i
i += 1
return -1 | index_iter | index | Iteratively search for the position of letter in str, return -1 if it is not there. | assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0 | true | 73cbe3a2-8a2b-4c7f-8b9e-a7db4b1d6f36 | 2,016 |
31,458 | def search(str, letter):
for item in str:
if item == letter:
return True
return False | search_iter | search | Iteratively search for a letter in a string | assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True | true | 73cbe3a2-8a2b-4c7f-8b9e-a7db4b1d6f36 | 2,016 |
33,040 | def fibonacci(n):
if n == 0:
return 0
elif n == 1:
return 1
else:
return fibonacci(n - 1) + fibonacci(n - 2) | fibonacci_iter | fibonacci | Iteratively compute the value of the fibonacci series at position n. | assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309 | false | 73cbe3a2-8a2b-4c7f-8b9e-a7db4b1d6f36 | 2,016 |
26,172 | def search(str, letter):
for item in str:
if item == letter:
return True
return False | search_iter | search | Iteratively search for a letter in a string | assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True | true | 73cbe3a2-8a2b-4c7f-8b9e-a7db4b1d6f36 | 2,016 |
35,094 | def index(str, letter):
i = 0
if letter in str:
x = letter[0]
for ch in str:
if ch == x:
if str[i:i + len(letter)] == letter:
return i
i += 1
return -1 | index_iter | index | Iteratively search for the position of letter in str, return -1 if it is not there. | assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0 | true | 73cbe3a2-8a2b-4c7f-8b9e-a7db4b1d6f36 | 2,016 |
3,853 | def fibonacci(n):
if n == 0:
return 0
elif n == 1:
return 1
else:
return fibonacci(n - 1) + fibonacci(n - 2) | fibonacci_iter | fibonacci | Iteratively compute the value of the fibonacci series at position n. | assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309 | false | 73cbe3a2-8a2b-4c7f-8b9e-a7db4b1d6f36 | 2,016 |
20,585 | def index(str, letter):
i = 0
if letter in str:
x = letter[0]
for ch in str:
if ch == x:
if str[i:i + len(letter)] == letter:
return i
i += 1
return -1 | index_iter | index | Iteratively search for the position of letter in str, return -1 if it is not there. | assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0 | true | 73cbe3a2-8a2b-4c7f-8b9e-a7db4b1d6f36 | 2,016 |
7,976 | def index(str, letter):
i = 0
if letter in str:
x = letter[0]
for ch in str:
if ch == x:
if str[i:i + len(letter)] == letter:
return i
i += 1
return -1 | index_iter | index | Iteratively search for the position of letter in str, return -1 if it is not there. | assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0 | true | 73cbe3a2-8a2b-4c7f-8b9e-a7db4b1d6f36 | 2,016 |
26,961 | def index(str, letter):
i = 0
if letter in str:
x = letter[0]
for ch in str:
if ch == x:
if str[i:i + len(letter)] == letter:
return i
i += 1
return -1 | index_iter | index | Iteratively search for the position of letter in str, return -1 if it is not there. | assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0 | true | 73cbe3a2-8a2b-4c7f-8b9e-a7db4b1d6f36 | 2,016 |
41,019 | def search(str, letter):
for item in str:
if item == letter:
return True
return False | search_iter | search | Iteratively search for a letter in a string | assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True | true | 73cbe3a2-8a2b-4c7f-8b9e-a7db4b1d6f36 | 2,016 |
14,276 | def fibonacci(n):
if n == 0:
return 0
elif n == 1:
return 1
else:
return fibonacci(n - 1) + fibonacci(n - 2) | fibonacci_iter | fibonacci | Iteratively compute the value of the fibonacci series at position n. | assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309 | false | 73cbe3a2-8a2b-4c7f-8b9e-a7db4b1d6f36 | 2,016 |
3,828 | def search(str, letter):
for item in str:
if item == letter:
return True
return False | search_iter | search | Iteratively search for a letter in a string | assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True | true | 73cbe3a2-8a2b-4c7f-8b9e-a7db4b1d6f36 | 2,016 |
19,036 | def fibonacci(n):
if n == 0:
return 0
elif n == 1:
return 1
else:
return fibonacci(n - 1) + fibonacci(n - 2) | fibonacci_iter | fibonacci | Iteratively compute the value of the fibonacci series at position n. | assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309 | false | 73cbe3a2-8a2b-4c7f-8b9e-a7db4b1d6f36 | 2,016 |
14,912 | def fibonacci(n):
if n == 0:
return 0
elif n == 1:
return 1
else:
return fibonacci(n - 1) + fibonacci(n - 2) | fibonacci_iter | fibonacci | Iteratively compute the value of the fibonacci series at position n. | assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309 | false | 73cbe3a2-8a2b-4c7f-8b9e-a7db4b1d6f36 | 2,016 |
7,835 | def search(str, letter):
for item in str:
if item == letter:
return True
return False | search_iter | search | Iteratively search for a letter in a string | assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True | true | 73cbe3a2-8a2b-4c7f-8b9e-a7db4b1d6f36 | 2,016 |
1,978 | def search(ls, val):
for item in ls:
if item == val:
return True
return False | search_iter | search | Iteratively search for a letter in a string | assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True | true | 77d2e8c4-7a6c-4b2b-a2c4-40bb9700563f | 2,016 |
5,039 | def fibonacci(n):
fib = [0, 1, 1]
for f in range(2, n):
fib.append(fib[-1] + fib[-2])
return fin[n] | fibonacci_iter | fibonacci | Iteratively compute the value of the fibonacci series at position n. | assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309 | false | 77d2e8c4-7a6c-4b2b-a2c4-40bb9700563f | 2,016 |
31,442 | def index(str, letter):
i = 0
while i < len(str):
if str[i] == letter:
return i
i = i + 1
return -1 | index_iter | index | Iteratively search for the position of letter in str, return -1 if it is not there. | assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0 | true | 77d2e8c4-7a6c-4b2b-a2c4-40bb9700563f | 2,016 |
9,692 | def fibonacci(n):
fib = [0, 1, 1]
for f in range(2, n):
fib.append(fib[-1] + fib[-2])
return fib[n] | fibonacci_iter | fibonacci | Iteratively compute the value of the fibonacci series at position n. | assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309 | true | 77d2e8c4-7a6c-4b2b-a2c4-40bb9700563f | 2,016 |
18,460 | def search(ls, val):
for item in ls:
if item == val:
return True
return False | search_iter | search | Iteratively search for a letter in a string | assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True | true | 77d2e8c4-7a6c-4b2b-a2c4-40bb9700563f | 2,016 |
11,627 | def fibonacci(n):
fib = [0, 1, 1]
for f in range(2, n):
fib.append(fib[-1] + fib[-2])
return fib[n] | fibonacci_iter | fibonacci | Iteratively compute the value of the fibonacci series at position n. | assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309 | true | 77d2e8c4-7a6c-4b2b-a2c4-40bb9700563f | 2,016 |
16,334 | def index(str, letter):
i = 0
while i < len(str):
if str[i] == letter:
return i
i = i + 1
return -1 | index_iter | index | Iteratively search for the position of letter in str, return -1 if it is not there. | assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0 | true | 77d2e8c4-7a6c-4b2b-a2c4-40bb9700563f | 2,016 |
41,298 | def index(str, letter):
i = 0
while i < len(str):
if str[i] == letter:
return i
i = i + 1
return -1 | index_iter | index | Iteratively search for the position of letter in str, return -1 if it is not there. | assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0 | true | 77d2e8c4-7a6c-4b2b-a2c4-40bb9700563f | 2,016 |
36,653 | def search(ls, val):
for item in ls:
if item == val:
return True
return False | search_iter | search | Iteratively search for a letter in a string | assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True | true | 77d2e8c4-7a6c-4b2b-a2c4-40bb9700563f | 2,016 |
15,958 | def index(str, letter):
i = 0
while i < len(str):
if str[i] == letter:
return i
i = i + 1
return -1 | index_recur | index | Recursively search for the position of letter in str, return -1 if it is not there. | assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2 | false | 77d2e8c4-7a6c-4b2b-a2c4-40bb9700563f | 2,016 |
13,204 | def fibonacci(n):
fib = [0, 1, 1]
for f in range(2, n):
fib.append(fib[-1] + fib[-2])
return fib[n] | fibonacci_recur | fibonacci | Recursively compute the value of the fibonacci series at position n. | assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657 | true | 77d2e8c4-7a6c-4b2b-a2c4-40bb9700563f | 2,016 |
17,242 | def search(ls, val):
for item in ls:
if item == val:
return True
return False | search_recur | search | Recursively search for a letter in a string | assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True | true | 77d2e8c4-7a6c-4b2b-a2c4-40bb9700563f | 2,016 |
12,096 | def fibonacci(n):
fib = [0, 1, 1]
for f in range(2, n):
fib.append(fib[-1] + fib[-2])
return fib[n] | fibonacci_recur | fibonacci | Recursively compute the value of the fibonacci series at position n. | assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657 | true | 77d2e8c4-7a6c-4b2b-a2c4-40bb9700563f | 2,016 |
21,507 | def search(ls, val):
for item in ls:
if item == val:
return True
return False | search_recur | search | Recursively search for a letter in a string | assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True | true | 77d2e8c4-7a6c-4b2b-a2c4-40bb9700563f | 2,016 |
20,711 | def search(ls, val):
for item in ls:
if item == val:
return True
return False | search_recur | search | Recursively search for a letter in a string | assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True | true | 77d2e8c4-7a6c-4b2b-a2c4-40bb9700563f | 2,016 |
38,578 | def index(str, letter, num):
i = 0
while i < len(str):
if str[i] == letter:
return i
i = i + 1
return -1 | index_recur | index | Recursively search for the position of letter in str, return -1 if it is not there. | assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2 | true | 77d2e8c4-7a6c-4b2b-a2c4-40bb9700563f | 2,016 |
20,601 | def fibonacci(n):
fib = [0, 1, 1]
for f in range(2, n):
fib.append(fib[-1] + fib[-2])
return fib[n] | fibonacci_recur | fibonacci | Recursively compute the value of the fibonacci series at position n. | assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657 | true | 77d2e8c4-7a6c-4b2b-a2c4-40bb9700563f | 2,016 |
35,273 | def index(str, letter, num):
i = 0
while i < len(str):
if str[i] == letter:
return i
i = i + 1
return -1 | index_recur | index | Recursively search for the position of letter in str, return -1 if it is not there. | assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2 | true | 77d2e8c4-7a6c-4b2b-a2c4-40bb9700563f | 2,016 |
40,351 | def search(ls, val):
for item in ls:
if item == val:
return True
return False | search_recur | search | Recursively search for a letter in a string | assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True | true | 77d2e8c4-7a6c-4b2b-a2c4-40bb9700563f | 2,016 |
33,034 | def index(str, letter, num):
i = 0
while i < len(str):
if str[i] == letter:
return i
i = i + 1
return -1 | index_recur | index | Recursively search for the position of letter in str, return -1 if it is not there. | assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2 | true | 77d2e8c4-7a6c-4b2b-a2c4-40bb9700563f | 2,016 |
6,512 | def fibonacci(n):
fib = [0, 1, 1]
for f in range(2, n):
fib.append(fib[-1] + fib[-2])
return fib[n] | fibonacci_recur | fibonacci | Recursively compute the value of the fibonacci series at position n. | assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657 | true | 77d2e8c4-7a6c-4b2b-a2c4-40bb9700563f | 2,016 |
1,583 | def index(str, letter):
i = 0
while i < len(str):
if str[i] == letter:
return i
i += 1
return -1 | index_iter | index | Iteratively search for the position of letter in str, return -1 if it is not there. | assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0 | true | df44f889-e513-4dcf-9230-82eca3e43f36 | 2,016 |
29,458 | def search(str, letter):
i = 0
while i < len(str):
if str[i] == letter:
return True
i += 1
return False | search_iter | search | Iteratively search for a letter in a string | assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True | true | df44f889-e513-4dcf-9230-82eca3e43f36 | 2,016 |
17,162 | def fibonacci(n):
fib = [0, 1, 1]
for f in range(2, n):
fib.append(fib[-1] + fib[-2])
return fib[n] | fibonacci_iter | fibonacci | Iteratively compute the value of the fibonacci series at position n. | assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309 | true | df44f889-e513-4dcf-9230-82eca3e43f36 | 2,016 |
22,237 | def index(str, letter):
i = 0
while i < len(str):
if str[i] == letter:
return i
i += 1
return -1 | index_iter | index | Iteratively search for the position of letter in str, return -1 if it is not there. | assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0 | true | df44f889-e513-4dcf-9230-82eca3e43f36 | 2,016 |
3,598 | def search(str, letter):
i = 0
while i < len(str):
if str[i] == letter:
return True
i += 1
return False | search_iter | search | Iteratively search for a letter in a string | assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True | true | df44f889-e513-4dcf-9230-82eca3e43f36 | 2,016 |
18,899 | def fibonacci(n):
fib = [0, 1, 1]
for f in range(2, n):
fib.append(fib[-1] + fib[-2])
return fib[n] | fibonacci_iter | fibonacci | Iteratively compute the value of the fibonacci series at position n. | assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309 | true | df44f889-e513-4dcf-9230-82eca3e43f36 | 2,016 |
17,314 | def search(str, letter):
i = 0
while i < len(str):
if str[i] == letter:
return True
i += 1
return False | search_iter | search | Iteratively search for a letter in a string | assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True | true | df44f889-e513-4dcf-9230-82eca3e43f36 | 2,016 |
35,291 | def fibonacci(n):
fib = [0, 1, 1]
for f in range(2, n):
fib.append(fib[-1] + fib[-2])
return fib[n] | fibonacci_iter | fibonacci | Iteratively compute the value of the fibonacci series at position n. | assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309 | true | df44f889-e513-4dcf-9230-82eca3e43f36 | 2,016 |
23,299 | def index(str, letter):
i = 0
while i < len(str):
if str[i] == letter:
return i
i += 1
return -1 | index_iter | index | Iteratively search for the position of letter in str, return -1 if it is not there. | assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0 | true | df44f889-e513-4dcf-9230-82eca3e43f36 | 2,016 |
42,482 | def index(str, letter):
i = 0
while i < len(str):
if str[i] == letter:
return i
i += 1
return -1 | index_iter | index | Iteratively search for the position of letter in str, return -1 if it is not there. | assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0 | true | df44f889-e513-4dcf-9230-82eca3e43f36 | 2,016 |
3,639 | def fibonacci(n):
fib = [0, 1, 1]
for f in range(2, n):
fib.append(fib[-1] + fib[-2])
return fib[n] | fibonacci_iter | fibonacci | Iteratively compute the value of the fibonacci series at position n. | assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309 | true | df44f889-e513-4dcf-9230-82eca3e43f36 | 2,016 |
3,126 | def search(str, letter):
i = 0
while i < len(str):
if str[i] == letter:
return True
i += 1
return False | search_iter | search | Iteratively search for a letter in a string | assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True | true | df44f889-e513-4dcf-9230-82eca3e43f36 | 2,016 |
31,313 | def search(x, letter):
if letter.isalpha() and type(x) == str:
print('ok')
else:
print('false') | search_iter | search | Iteratively search for a letter in a string | assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True | false | 44c97823-e1ac-4434-b296-79fbeb51fa5a | 2,016 |
33,194 | def search(x, letter):
if letter.isalpha() and type(x) == str:
print('True')
else:
print('False') | search_iter | search | Iteratively search for a letter in a string | assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True | false | 44c97823-e1ac-4434-b296-79fbeb51fa5a | 2,016 |
21,503 | def search(x, letter):
if letter.isalpha() and type(x) == str:
print('True')
else:
print('False')
return | search_iter | search | Iteratively search for a letter in a string | assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True | false | 44c97823-e1ac-4434-b296-79fbeb51fa5a | 2,016 |
20,978 | def search(x, letter):
if letter.isalpha() and type(x) == str:
return 'True'
else:
return 'False' | search_iter | search | Iteratively search for a letter in a string | assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True | false | 44c97823-e1ac-4434-b296-79fbeb51fa5a | 2,016 |
16,003 | def search(x, letter):
if type(x) == str and letter.isalpha():
return 'True'
else:
return 'False' | search_iter | search | Iteratively search for a letter in a string | assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True | false | 44c97823-e1ac-4434-b296-79fbeb51fa5a | 2,016 |
23,223 | def search(string, letter):
i = 0
while i < len(string):
if letter in string:
return 'True'
else:
return 'False' | search_iter | search | Iteratively search for a letter in a string | assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True | false | 44c97823-e1ac-4434-b296-79fbeb51fa5a | 2,016 |
8,179 | def index(string, letter):
i = 0
while i < len(string):
if letter == string[i]:
return i
i = i + 1
return '-1' | index_iter | index | Iteratively search for the position of letter in str, return -1 if it is not there. | assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0 | false | 44c97823-e1ac-4434-b296-79fbeb51fa5a | 2,016 |
2,395 | def search(string, letter):
if letter in string:
return 'True'
else:
return 'False' | search_iter | search | Iteratively search for a letter in a string | assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True | false | 44c97823-e1ac-4434-b296-79fbeb51fa5a | 2,016 |
30,285 | def search(string, letter):
i = 0
while i < len(string):
if letter == string[i]:
return True
i = i + 1
return False | search_iter | search | Iteratively search for a letter in a string | assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True | true | 44c97823-e1ac-4434-b296-79fbeb51fa5a | 2,016 |
9,627 | def index(string, letter):
i = 0
while i < len(string):
if letter == string[i]:
return i
i = i + 1
return '-1' | index_iter | index | Iteratively search for the position of letter in str, return -1 if it is not there. | assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0 | false | 44c97823-e1ac-4434-b296-79fbeb51fa5a | 2,016 |
38,395 | def index(string, letter):
i = 0
while i < len(string):
if letter == string[i]:
return i
i = i + 1
return '-1' | index_iter | index | Iteratively search for the position of letter in str, return -1 if it is not there. | assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0 | false | 44c97823-e1ac-4434-b296-79fbeb51fa5a | 2,016 |
40,371 | def fibonacci(n):
if n == 0:
return 0
elif n == 1:
return 1
else:
a = 0
b = 1
i = 2
while i <= n:
sum1 = a + b
a = b
b = sum1
i += 1
return sum1 | fibonacci_iter | fibonacci | Iteratively compute the value of the fibonacci series at position n. | assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309 | true | 44c97823-e1ac-4434-b296-79fbeb51fa5a | 2,016 |
27,548 | def search(string, letter):
i = 0
while i < len(string):
if letter == string[i]:
return True
i = i + 1
return False | search_iter | search | Iteratively search for a letter in a string | assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True | true | 44c97823-e1ac-4434-b296-79fbeb51fa5a | 2,016 |
38,183 | def fibonacci(n):
if n == 0:
return 0
elif n == 1:
return 1
else:
a = 0
b = 1
i = 2
while i <= n:
sum1 = a + b
a = b
b = sum1
i += 1
return sum1 | fibonacci_iter | fibonacci | Iteratively compute the value of the fibonacci series at position n. | assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309 | true | 44c97823-e1ac-4434-b296-79fbeb51fa5a | 2,016 |
8,262 | def search(string, letter):
i = 0
while i < len(string):
if letter == string[i]:
return True
i = i + 1
return False | search_iter | search | Iteratively search for a letter in a string | assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True | true | 44c97823-e1ac-4434-b296-79fbeb51fa5a | 2,016 |
19,802 | def fibonacci(n):
if n == 0:
return 0
elif n == 1:
return 1
else:
a = 0
b = 1
i = 2
while i <= n:
sum1 = a + b
a = b
b = sum1
i += 1
return sum1 | fibonacci_iter | fibonacci | Iteratively compute the value of the fibonacci series at position n. | assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309 | true | 44c97823-e1ac-4434-b296-79fbeb51fa5a | 2,016 |
32,555 | def index(string, letter):
i = 0
while i < len(string):
if letter == string[i]:
return i
i = i + 1
return '-1' | index_iter | index | Iteratively search for the position of letter in str, return -1 if it is not there. | assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0 | false | 44c97823-e1ac-4434-b296-79fbeb51fa5a | 2,016 |
29,067 | def search(string, letter):
i = 0
while i < len(string):
if letter == string[i]:
return True
i = i + 1
return False | search_iter | search | Iteratively search for a letter in a string | assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True | true | 44c97823-e1ac-4434-b296-79fbeb51fa5a | 2,016 |
26,536 | def index(string, letter):
i = 0
while i < len(string):
if letter == string[i]:
return i
i = i + 1
return '-1' | index_iter | index | Iteratively search for the position of letter in str, return -1 if it is not there. | assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0 | false | 44c97823-e1ac-4434-b296-79fbeb51fa5a | 2,016 |
33,219 | def index(str, letter):
i = 0
while i < len(str):
if str[i] == letter:
return i
i = i + 1
return '-1' | index_iter | index | Iteratively search for the position of letter in str, return -1 if it is not there. | assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0 | false | 46432289-e1c4-49da-8392-8dfa0d08a950 | 2,016 |
39,706 | def fibonacci(n):
a = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
return a[n] | fibonacci_iter | fibonacci | Iteratively compute the value of the fibonacci series at position n. | assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309 | false | 46432289-e1c4-49da-8392-8dfa0d08a950 | 2,016 |
13,081 | def index(str, letter):
i = 0
while i < len(str):
if str[i] == letter:
return i
i = i + 1
return '-1' | index_iter | index | Iteratively search for the position of letter in str, return -1 if it is not there. | assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0 | false | 46432289-e1c4-49da-8392-8dfa0d08a950 | 2,016 |
20,210 | def fibonacci(n):
a = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
return a[n] | fibonacci_iter | fibonacci | Iteratively compute the value of the fibonacci series at position n. | assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309 | false | 46432289-e1c4-49da-8392-8dfa0d08a950 | 2,016 |
21,850 | def index(str, letter):
i = 0
while i < len(str):
if str[i] == letter:
return i
i = i + 1
return '-1' | index_iter | index | Iteratively search for the position of letter in str, return -1 if it is not there. | assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0 | false | 46432289-e1c4-49da-8392-8dfa0d08a950 | 2,016 |
23,215 | def fibonacci(n):
a = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
return a[n] | fibonacci_iter | fibonacci | Iteratively compute the value of the fibonacci series at position n. | assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309 | false | 46432289-e1c4-49da-8392-8dfa0d08a950 | 2,016 |
2,249 | def search(str, letter):
for item in str:
if item == letter:
return True
return False | search_iter | search | Iteratively search for a letter in a string | assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True | true | 46432289-e1c4-49da-8392-8dfa0d08a950 | 2,016 |
17,221 | def search(str, letter):
for item in str:
if item == letter:
return True
return False | search_iter | search | Iteratively search for a letter in a string | assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True | true | 46432289-e1c4-49da-8392-8dfa0d08a950 | 2,016 |
15,189 | def index(str, letter):
i = 0
while i < len(str):
if str[i] == letter:
return i
i = i + 1
return '-1' | index_iter | index | Iteratively search for the position of letter in str, return -1 if it is not there. | assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0 | false | 46432289-e1c4-49da-8392-8dfa0d08a950 | 2,016 |
30,719 | def fibonacci(n):
a = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
return a[n] | fibonacci_iter | fibonacci | Iteratively compute the value of the fibonacci series at position n. | assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309 | false | 46432289-e1c4-49da-8392-8dfa0d08a950 | 2,016 |
12,459 | def search(str, letter):
for item in str:
if item == letter:
return True
return False | search_iter | search | Iteratively search for a letter in a string | assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True | true | 8ed5ee6f-d6e7-4caf-8917-36bbe373ffac | 2,016 |
11,736 | def fibonacci(n):
a = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
return a[n] | fibonacci_iter | fibonacci | Iteratively compute the value of the fibonacci series at position n. | assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309 | false | 8ed5ee6f-d6e7-4caf-8917-36bbe373ffac | 2,016 |
34,083 | def index(str, letter):
i = 0
while i < len(str):
if str[i] == letter:
return i
i = i + 1
return '-1' | index_iter | index | Iteratively search for the position of letter in str, return -1 if it is not there. | assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0 | false | 8ed5ee6f-d6e7-4caf-8917-36bbe373ffac | 2,016 |
20,138 | def index(str, letter):
i = 0
while i < len(str):
if str[i] == letter:
return i
i = i + 1
return '-1' | index_iter | index | Iteratively search for the position of letter in str, return -1 if it is not there. | assert index('','0')==-1 and index('0','0')==0 and index('11','1')==0 | false | 8ed5ee6f-d6e7-4caf-8917-36bbe373ffac | 2,016 |
4,803 | def fibonacci(n):
a = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
return a[n] | fibonacci_iter | fibonacci | Iteratively compute the value of the fibonacci series at position n. | assert fibonacci(1)==1 and fibonacci(41)==165580141 and fibonacci(3)==2 and fibonacci(91)==4660046610375530309 | false | 8ed5ee6f-d6e7-4caf-8917-36bbe373ffac | 2,016 |
28,739 | def search(str, letter):
for item in str:
if item == letter:
return True
return False | search_iter | search | Iteratively search for a letter in a string | assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True | true | 8ed5ee6f-d6e7-4caf-8917-36bbe373ffac | 2,016 |
16,655 | def fibonacci(n):
a = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
return a[n] | fibonacci_recur | fibonacci | Recursively compute the value of the fibonacci series at position n. | assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657 | false | 8ed5ee6f-d6e7-4caf-8917-36bbe373ffac | 2,016 |
41,295 | def search(str, letter):
for item in str:
if item == letter:
return True
return False | search_recur | search | Recursively search for a letter in a string | assert search('','0')==False and search('0','0')==True and search('ERFE0Rfsef','0')==True and search('ERFERfsef0','0')==True and search('','a')==False and search('cbzeycuzbvyzuvb','a')==False and search('cbsducsvdbcyts','c')==True and search('dbzeducvbzy','y')==True and search('xqvsgxcutvy','u')==True | true | 8ed5ee6f-d6e7-4caf-8917-36bbe373ffac | 2,016 |
111 | def index(str, letter):
i = 0
while i < len(str):
if str[i] == letter:
return i
i = i + 1
return '-1' | index_recur | index | Recursively search for the position of letter in str, return -1 if it is not there. | assert index('','0',0)==-1 and index('0','0',0)==0 and index('a','8',0)==-1 and index('tV2','2',0)==2 | false | 8ed5ee6f-d6e7-4caf-8917-36bbe373ffac | 2,016 |
32,487 | def fibonacci(n):
a = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
return a[n] | fibonacci_recur | fibonacci | Recursively compute the value of the fibonacci series at position n. | assert fibonacci(0)==0 and fibonacci(1)==1 and fibonacci(2)==1 and fibonacci(10)==55 and fibonacci(23)==28657 | false | 8ed5ee6f-d6e7-4caf-8917-36bbe373ffac | 2,016 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.