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
|
|---|---|---|---|---|---|---|---|---|
10,739 | def search(string, letter):
if string == '':
return False
elif string[0] == letter:
return True
else:
search(string[1:], letter) | 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 | false | e787ded7-43af-4b69-82c1-c646ab388711 | 2,016 |
2,422 | 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 | 2bcea2a1-925b-4db5-8403-2d8af9d0bb46 | 2,016 |
25,162 | 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 | 2bcea2a1-925b-4db5-8403-2d8af9d0bb46 | 2,016 |
16,524 | 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 | 2bcea2a1-925b-4db5-8403-2d8af9d0bb46 | 2,016 |
37,111 | 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 | 2bcea2a1-925b-4db5-8403-2d8af9d0bb46 | 2,016 |
13,528 | 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 | 2bcea2a1-925b-4db5-8403-2d8af9d0bb46 | 2,016 |
40,672 | 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 | 2bcea2a1-925b-4db5-8403-2d8af9d0bb46 | 2,016 |
27,158 | def search(str, letter):
for n in str:
if n == 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 | 2bcea2a1-925b-4db5-8403-2d8af9d0bb46 | 2,016 |
19,932 | def search(str, letter):
for n in str:
if n == 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 | 2bcea2a1-925b-4db5-8403-2d8af9d0bb46 | 2,016 |
13,240 | def search(str, letter):
for n in str:
if n == 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 | 2bcea2a1-925b-4db5-8403-2d8af9d0bb46 | 2,016 |
6,539 | def search(string, letter):
if string == '':
return False
elif string[0] == letter:
return True
else:
search(string[1:], letter) | 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 | false | e787ded7-43af-4b69-82c1-c646ab388711 | 2,016 |
31,642 | def index(string, letter, count):
print(count)
k = len(string)
if count == k:
return -1
elif string[count] == letter:
return count
else:
return index(string, letter, count + 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 | e787ded7-43af-4b69-82c1-c646ab388711 | 2,016 |
30,595 | def fibonacci(n):
if n == 0:
return 0
elif n == 1:
return 1
else:
return fibonacci(n - 2) + fibonacci(n - 1) | 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 | e787ded7-43af-4b69-82c1-c646ab388711 | 2,016 |
38,586 | def index(string, letter, count):
k = len(string)
if count == k:
return -1
elif string[count] == letter:
return count
else:
return index(string, letter, count + 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 | e787ded7-43af-4b69-82c1-c646ab388711 | 2,016 |
33,913 | def fibonacci(n):
if n == 0:
return 0
elif n == 1:
return 1
else:
return fibonacci(n - 2) + fibonacci(n - 1) | 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 | e787ded7-43af-4b69-82c1-c646ab388711 | 2,016 |
38,764 | def search(string, letter):
if string == '':
return False
elif string[0] == letter:
return True
else:
search(string[1:], letter) | 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 | false | e787ded7-43af-4b69-82c1-c646ab388711 | 2,016 |
12,092 | def search(string, letter):
if string == '':
return False
elif string[0] == letter:
return True
else:
return search(string[1:], letter) | 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 | e787ded7-43af-4b69-82c1-c646ab388711 | 2,016 |
20,756 | def fibonacci(n):
if n == 0:
return 0
elif n == 1:
return 1
else:
return fibonacci(n - 2) + fibonacci(n - 1) | 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 | e787ded7-43af-4b69-82c1-c646ab388711 | 2,016 |
35,446 | def fibonacci(n):
if n == 0:
return 0
elif n == 1:
return 1
else:
return fibonacci(n - 2) + fibonacci(n - 1) | 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 | e787ded7-43af-4b69-82c1-c646ab388711 | 2,016 |
41,068 | def index(string, letter, count):
k = len(string)
if count == k:
return -1
elif string[count] == letter:
return count
else:
return index(string, letter, count + 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 | e787ded7-43af-4b69-82c1-c646ab388711 | 2,016 |
9,161 | def fibonacci(n):
if n == 0:
return 0
elif n == 1:
return 1
else:
return fibonacci(n - 2) + fibonacci(n - 1) | 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 | e787ded7-43af-4b69-82c1-c646ab388711 | 2,016 |
40,103 | def index(string, letter, count):
k = len(string)
if count == k:
return -1
elif string[count] == letter:
return count
else:
return index(string, letter, count + 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 | e787ded7-43af-4b69-82c1-c646ab388711 | 2,016 |
22,501 | def search(string, letter):
if string == '':
return False
elif string[0] == letter:
return True
else:
return search(string[1:], letter) | 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 | e787ded7-43af-4b69-82c1-c646ab388711 | 2,016 |
6,716 | def search(string, letter):
if string == '':
return False
elif string[0] == letter:
return True
else:
return search(string[1:], letter) | 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 | e787ded7-43af-4b69-82c1-c646ab388711 | 2,016 |
29,248 | def index(string, letter, count):
k = len(string)
if count == k:
return -1
elif string[count] == letter:
return count
else:
return index(string, letter, count + 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 | e787ded7-43af-4b69-82c1-c646ab388711 | 2,016 |
6,721 | def fibonacci(n):
old = 1
cur = 1
i = 1
while i < n:
cur, old, i = cur + old, cur, i + 1
return cur | 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 | 89186303-b7a8-4f4c-9627-06ba24e03bbb | 2,016 |
9,634 | def index(str, letter):
start = len(str) - 1
end = -1
while start > end:
if letter == str[start]:
return start
else:
start -= 1
return end | 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 | 89186303-b7a8-4f4c-9627-06ba24e03bbb | 2,016 |
15,723 | def search(str, letter):
for char in str:
if char == letter:
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 | 89186303-b7a8-4f4c-9627-06ba24e03bbb | 2,016 |
11,269 | def search(string, letter):
if len(string) == 0:
return 'False'
elif string[0] == letter:
return 'True'
else:
return search(string[1:], letter) | 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 | false | b9e7e608-6036-4d44-8770-a7036176b53c | 2,016 |
38,239 | def search(str, letter):
for c in str:
if c == letter:
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 | 89186303-b7a8-4f4c-9627-06ba24e03bbb | 2,016 |
20,939 | def index(str, letter):
start = len(str) - 1
end = -1
while start > end:
if letter == str[start]:
return start
else:
start -= 1
return end | 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 | 89186303-b7a8-4f4c-9627-06ba24e03bbb | 2,016 |
30,342 | def fibonacci(n):
i = 0
while n > i:
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 | 89186303-b7a8-4f4c-9627-06ba24e03bbb | 2,016 |
17,673 | def fibonacci(n):
if n == 0:
return n
elif n == 1:
return n
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 | 9b929794-1500-4125-bf6c-79d74c111918 | 2,016 |
5,746 | def fibonacci(n):
if n == 0:
return n
elif n == 1:
return n
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 | 9b929794-1500-4125-bf6c-79d74c111918 | 2,016 |
32,173 | def fibonacci(n):
if n == 0:
return n
elif n == 1:
return n
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 | 9b929794-1500-4125-bf6c-79d74c111918 | 2,016 |
965 | 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 | 9b929794-1500-4125-bf6c-79d74c111918 | 2,016 |
6,801 | 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 | 9b929794-1500-4125-bf6c-79d74c111918 | 2,016 |
5,732 | 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 | 9b929794-1500-4125-bf6c-79d74c111918 | 2,016 |
1,239 | 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 | 9b929794-1500-4125-bf6c-79d74c111918 | 2,016 |
28,725 | 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 | 9b929794-1500-4125-bf6c-79d74c111918 | 2,016 |
25,776 | 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 | 9b929794-1500-4125-bf6c-79d74c111918 | 2,016 |
18,880 | def search(string, letter):
if len(string) == 0:
return 'False'
elif string[0] == letter:
return 'True'
else:
return search(string[1:], letter) | 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 | false | b9e7e608-6036-4d44-8770-a7036176b53c | 2,016 |
15,329 | def index(string, letter, position):
if position == len(string):
return -1
elif string[position] == letter:
return position
else:
return index(string, letter, position + 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 | b9e7e608-6036-4d44-8770-a7036176b53c | 2,016 |
29,037 | def index(str, letter):
start = len(str) - 1
end = -1
while start > end:
if letter == str[start]:
return start
else:
start -= 1
return end | 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 | 89186303-b7a8-4f4c-9627-06ba24e03bbb | 2,016 |
37,048 | def search(str, letter):
for c in str:
if c == letter:
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 | 89186303-b7a8-4f4c-9627-06ba24e03bbb | 2,016 |
495 | def index(str, letter):
start = len(str) - 1
end = -1
while start > end:
if letter == str[start]:
return start
else:
start -= 1
return end | 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 | 89186303-b7a8-4f4c-9627-06ba24e03bbb | 2,016 |
30,639 | def search(str, letter):
for c in str:
if letter == c:
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 | 89186303-b7a8-4f4c-9627-06ba24e03bbb | 2,016 |
5,082 | def index(str, letter):
start = len(str) - 1
end = -1
while start > end:
if letter == str[start]:
return start
else:
start -= 1
return end | 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 | 89186303-b7a8-4f4c-9627-06ba24e03bbb | 2,016 |
32,252 | def search(str, letter):
if letter in 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 | true | 89186303-b7a8-4f4c-9627-06ba24e03bbb | 2,016 |
36,904 | def index(str, letter):
start = len(str) - 1
end = -1
while start > end:
if letter == str[start]:
return start
else:
start -= 1
return end | 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 | 89186303-b7a8-4f4c-9627-06ba24e03bbb | 2,016 |
14,183 | def index(str, letter):
start = len(str) - 1
end = -1
while start > end:
if letter == str[start]:
return start
else:
start -= 1
return end | 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 | 89186303-b7a8-4f4c-9627-06ba24e03bbb | 2,016 |
41,686 | def fibonacci(n):
a = 0
b = 1
for i in range(0, n):
temp = a
a = b
b = temp + b
return a | 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 | 89186303-b7a8-4f4c-9627-06ba24e03bbb | 2,016 |
36,658 | def search(str, letter):
if letter in 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 | true | 89186303-b7a8-4f4c-9627-06ba24e03bbb | 2,016 |
8,573 | def fibonacci(n):
a = 0
b = 1
for i in range(0, n):
temp = a
a = b
b = temp + b
return a | 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 | 89186303-b7a8-4f4c-9627-06ba24e03bbb | 2,016 |
5,666 | def search(str, letter):
if letter in 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 | true | 89186303-b7a8-4f4c-9627-06ba24e03bbb | 2,016 |
13,090 | def search(string, letter):
if len(string) == 0:
return 'False'
elif string[0] == letter:
return 'True'
else:
return search(string[1:], letter) | 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 | false | b9e7e608-6036-4d44-8770-a7036176b53c | 2,016 |
30,117 | def index(string, letter, position):
if position == len(string):
return -1
elif string[position] == letter:
return position
else:
return index(string, letter, position + 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 | b9e7e608-6036-4d44-8770-a7036176b53c | 2,016 |
37,190 | def search(string, letter):
if len(string) == 0:
return 'False'
elif string[0] == letter:
return 'True'
else:
return search(string[1:], letter) | 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 | false | b9e7e608-6036-4d44-8770-a7036176b53c | 2,016 |
1,054 | 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 | b9e7e608-6036-4d44-8770-a7036176b53c | 2,016 |
6,208 | 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 | b9e7e608-6036-4d44-8770-a7036176b53c | 2,016 |
28,329 | 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 | b9e7e608-6036-4d44-8770-a7036176b53c | 2,016 |
11,156 | def search(string, letter):
if len(string) == 0:
return 'False'
elif string[0] == letter:
return 'True'
else:
return search(string[1:], letter) | 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 | false | b9e7e608-6036-4d44-8770-a7036176b53c | 2,016 |
5,984 | def index(string, letter, position):
if position == len(string):
return -1
elif string[position] == letter:
return position
else:
return index(string, letter, position + 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 | b9e7e608-6036-4d44-8770-a7036176b53c | 2,016 |
9,092 | def index(string, letter, position):
if position == len(string):
return -1
elif string[position] == letter:
return position
else:
return index(string, letter, position + 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 | b9e7e608-6036-4d44-8770-a7036176b53c | 2,016 |
41,473 | def search(str, letter):
if letter in str:
return True
else:
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 | 89186303-b7a8-4f4c-9627-06ba24e03bbb | 2,016 |
35,084 | def index(str, letter):
a = len(str) - 1
b = -1
if letter == str[a]:
return start
else:
a -= 1
index(str, letter) | 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 | 89186303-b7a8-4f4c-9627-06ba24e03bbb | 2,016 |
8,416 | def search(str, letter):
if letter in str:
return True
else:
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 | 89186303-b7a8-4f4c-9627-06ba24e03bbb | 2,016 |
33,089 | def fibonacci(n):
a = 0
b = 1
for i in range(0, n):
temp = a
a = b
b = temp + b
return a | 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 | 89186303-b7a8-4f4c-9627-06ba24e03bbb | 2,016 |
1,129 | def search(str, letter):
if letter in str:
return True
else:
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 | 89186303-b7a8-4f4c-9627-06ba24e03bbb | 2,016 |
24,404 | def index(str, letter, pos):
if letter == str[pos]:
return pos
else:
index(str, letter, pos + 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 | 89186303-b7a8-4f4c-9627-06ba24e03bbb | 2,016 |
28,266 | def fibonacci(n):
a = 0
b = 1
for i in range(0, n):
temp = a
a = b
b = temp + b
return a | 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 | 89186303-b7a8-4f4c-9627-06ba24e03bbb | 2,016 |
26,281 | def fibonacci(n):
a = 0
b = 1
for i in range(0, n):
temp = a
a = b
b = temp + b
return a | 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 | 89186303-b7a8-4f4c-9627-06ba24e03bbb | 2,016 |
16,911 | def index(str, letter, pos):
pos = 0
if letter == str[pos]:
return pos
else:
index(str, letter, pos + 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 | 89186303-b7a8-4f4c-9627-06ba24e03bbb | 2,016 |
5,760 | def index(str, letter, pos):
pos = 0
if letter == str[pos]:
return pos
else:
index(str, letter, pos + 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 | 89186303-b7a8-4f4c-9627-06ba24e03bbb | 2,016 |
35,671 | def search(str, letter):
if letter in str:
return True
else:
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 | 89186303-b7a8-4f4c-9627-06ba24e03bbb | 2,016 |
4,479 | def fibonacci(n):
a = 0
b = 1
for i in range(0, n):
temp = a
a = b
b = temp + b
return a | 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 | 89186303-b7a8-4f4c-9627-06ba24e03bbb | 2,016 |
8,272 | def search(str, letter):
if letter in str:
return True
else:
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 | 89186303-b7a8-4f4c-9627-06ba24e03bbb | 2,016 |
4,147 | def search(str, letter):
if letter in str:
return True
else:
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 | 89186303-b7a8-4f4c-9627-06ba24e03bbb | 2,016 |
32,722 | def index(str, letter, pos):
pos = 0
if letter == str[pos]:
return pos
else:
index(str, letter, pos + 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 | 89186303-b7a8-4f4c-9627-06ba24e03bbb | 2,016 |
25,890 | def fibonacci(n):
a = 0
b = 1
for i in range(0, n):
temp = a
a = b
b = temp + b
return a | 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 | 89186303-b7a8-4f4c-9627-06ba24e03bbb | 2,016 |
30,973 | def fibonacci(n):
fib = [0, 1]
i = 2
while i < n + 1:
tmp = int(fib[i - 2]) + int(fib[i - 1])
fib.append(tmp)
i += 1
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 | 813b8c22-4514-4fed-ac48-d5a7a4b068dd | 2,016 |
14,710 | def index(string, letter):
if letter in string:
i = 0
while i < len(string):
if letter == string[i]:
return i
i += 1
else:
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 | 813b8c22-4514-4fed-ac48-d5a7a4b068dd | 2,016 |
10,804 | 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 | 813b8c22-4514-4fed-ac48-d5a7a4b068dd | 2,016 |
32,735 | 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 | 813b8c22-4514-4fed-ac48-d5a7a4b068dd | 2,016 |
808 | def index(string, letter):
if letter in string:
i = 0
while i < len(string):
if letter == string[i]:
return i
i += 1
else:
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 | 813b8c22-4514-4fed-ac48-d5a7a4b068dd | 2,016 |
17,675 | 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 | 813b8c22-4514-4fed-ac48-d5a7a4b068dd | 2,016 |
24,280 | def index(string, letter):
if letter in string:
i = 0
while i < len(string):
if letter == string[i]:
return i
i += 1
else:
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 | 813b8c22-4514-4fed-ac48-d5a7a4b068dd | 2,016 |
36,203 | def index(string, letter):
if letter in string:
i = 0
while i < len(string):
if letter == string[i]:
return i
i += 1
else:
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 | 813b8c22-4514-4fed-ac48-d5a7a4b068dd | 2,016 |
21,025 | 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 | 813b8c22-4514-4fed-ac48-d5a7a4b068dd | 2,016 |
32,114 | def fibonacci(n):
fib = [0, 1]
i = 2
while i < n + 1:
tmp = int(fib[i - 2]) + int(fib[i - 1])
fib.append(tmp)
i += 1
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 | 813b8c22-4514-4fed-ac48-d5a7a4b068dd | 2,016 |
11,182 | def fibonacci(n):
fib = [0, 1]
i = 2
while i < n + 1:
tmp = int(fib[i - 2]) + int(fib[i - 1])
fib.append(tmp)
i += 1
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 | 813b8c22-4514-4fed-ac48-d5a7a4b068dd | 2,016 |
40,752 | def fibonacci(n):
fib = [0, 1]
i = 2
while i < n + 1:
tmp = int(fib[i - 2]) + int(fib[i - 1])
fib.append(tmp)
i += 1
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 | 813b8c22-4514-4fed-ac48-d5a7a4b068dd | 2,016 |
37,212 | def swap_keys_values(d):
new_d = {v: k for k, v in list(d.items())}
return new_d | swap_keys_values | swap_keys_values | Swap the keys of a dictionary with its values. | assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'} | true | fe81d9d2-29fa-4a6b-abc0-109c9697b557 | 2,016 |
30,200 | def swap_keys_values(d):
new_d = {v: k for k, v in list(d.items())}
return new_d | swap_keys_values | swap_keys_values | Swap the keys of a dictionary with its values. | assert swap_keys_values({})=={} and swap_keys_values({'1': 'a'})=={'a': '1'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'a': '3', 'b': '2'} | true | fe81d9d2-29fa-4a6b-abc0-109c9697b557 | 2,016 |
19,219 | def swap_unique_keys_values(d):
seen = {}
result = {}
for k, v in list(d.items()):
if v in seen:
del seen[v]
else:
seen[v] = k
result[v] = k
return seen | swap_unique_keys_values | swap_unique_keys_values | Swap the keys of a dictionary with its unique values. | assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'} | true | fe81d9d2-29fa-4a6b-abc0-109c9697b557 | 2,016 |
13,009 | def swap_unique_keys_values(d):
seen = {}
result = {}
for k, v in list(d.items()):
if v in seen:
del seen[v]
else:
seen[v] = k
result[v] = k
return seen | swap_unique_keys_values | swap_unique_keys_values | Swap the keys of a dictionary with its unique values. | assert swap_unique_keys_values({})=={} and swap_unique_keys_values({'1': 'a'})=={'a': '1'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'c', '4': 'd'})=={'a': '1', 'b': '2', 'c': '3', 'd': '4'} and swap_unique_keys_values({'1': 'a', '2': 'b', '3': 'a'})=={'b': '2'} | true | fe81d9d2-29fa-4a6b-abc0-109c9697b557 | 2,016 |
26,276 | def search(str, letter):
if letter in 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 | 7761b9ac-f093-487b-8401-cf2d01636e78 | 2,016 |
19,306 | def search(str, letter):
if letter in str:
print('True')
elif letter not in str:
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 | 7761b9ac-f093-487b-8401-cf2d01636e78 | 2,016 |
8,133 | def search(str, letter):
i = 0
while i < len(str):
if letter == str[i]:
break
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 | 7761b9ac-f093-487b-8401-cf2d01636e78 | 2,016 |
15,930 | def search(str, letter):
i = 0
while i < len(str):
if letter == str[i]:
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 | 7761b9ac-f093-487b-8401-cf2d01636e78 | 2,016 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.