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
|
|---|---|---|---|---|---|---|---|---|
29,865 | def weird_case(some_str):
new_str = ''
i = 0
lc = 0
while i < len(some_str):
if some_str[i].isalpha():
if lc % 2 == 0:
new_str += some_str[i].upper()
else:
new_str += some_str[i].lower()
lc += 1
else:
new_str += some_str[i]
i = i + 1
return new_str | weird_case | weird_case | Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower. | assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj | false | 94e64aae-7bb0-45bd-8969-e98b17d0a3da | 2,016 |
19,621 | def remove_zeros(list):
while 0 in list:
list.remove(0) | remove_zeros | remove_zeros | Take a list of numbers and removes the zeros from it. | assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None | true | 94e64aae-7bb0-45bd-8969-e98b17d0a3da | 2,016 |
16,258 | def weird_case(some_str):
new_str = ''
i = 0
lc = 0
while i < len(some_str):
if some_str[i].isalpha():
if lc % 2 == 0:
new_str += some_str[i].upper()
else:
new_str += some_str[i].lower()
lc += 1
else:
new_str += some_str[i]
i = i + 1
return new_str | weird_case | weird_case | Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower. | assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj | false | 94e64aae-7bb0-45bd-8969-e98b17d0a3da | 2,016 |
9,215 | def weird_case(some_str):
new_str = ''
i = 0
lc = 0
while i < len(some_str):
if some_str[i].isalpha():
if lc % 2 == 0:
new_str += some_str[i].upper()
else:
new_str += some_str[i].lower()
lc += 1
else:
new_str += some_str[i]
i = i + 1
return new_str | weird_case | weird_case | Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower. | assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj | false | 94e64aae-7bb0-45bd-8969-e98b17d0a3da | 2,016 |
12,563 | def weird_case(some_str):
new_str = ''
i = 0
lc = 0
while i < len(some_str):
if some_str[i].isalpha():
if lc % 2 == 0:
new_str += some_str[i].upper()
else:
new_str += some_str[i].lower()
lc += 1
else:
new_str += some_str[i]
i = i + 1
return new_str | weird_case | weird_case | Takes a string some_str and contains a new string which is the same as some_str but the case alternates between upper and lower. | assert weird_case('au0x6')==Au0X6 and weird_case('F:BnJ')==F:bNj | false | 94e64aae-7bb0-45bd-8969-e98b17d0a3da | 2,016 |
29,879 | def remove_zeros(list):
while 0 in list:
list.remove(0) | remove_zeros | remove_zeros | Take a list of numbers and removes the zeros from it. | assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None | true | 94e64aae-7bb0-45bd-8969-e98b17d0a3da | 2,016 |
1,498 | def remove_zeros(list):
while 0 in list:
list.remove(0) | remove_zeros | remove_zeros | Take a list of numbers and removes the zeros from it. | assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None | true | 94e64aae-7bb0-45bd-8969-e98b17d0a3da | 2,016 |
15,050 | def search(str, sub):
i = 0
while i < len(str):
if sub == str[i]:
return i
i = i + 1
return -1 | 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 | 94e64aae-7bb0-45bd-8969-e98b17d0a3da | 2,016 |
30,823 | def merge_lists(l1, l2):
l3 = []
i = 0
while i < len(l1):
l3.append(l1[i])
i += 2
i = 0
while i < len(l2):
l3.append(l2[i])
i += 2
return l3 | merge_lists | merge_lists | Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2. | assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765] | true | 94e64aae-7bb0-45bd-8969-e98b17d0a3da | 2,016 |
27,780 | def search(str, sub):
i = 0
while i < len(str):
if sub == str[i]:
return i
i = i + 1
return -1 | 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 | 94e64aae-7bb0-45bd-8969-e98b17d0a3da | 2,016 |
7,928 | def merge_lists(l1, l2):
l3 = []
i = 0
while i < len(l1):
l3.append(l1[i])
i += 2
i = 0
while i < len(l2):
l3.append(l2[i])
i += 2
return l3 | merge_lists | merge_lists | Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2. | assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765] | true | 94e64aae-7bb0-45bd-8969-e98b17d0a3da | 2,016 |
9,477 | def search(str, sub):
i = 0
while i < len(str):
if sub == str[i]:
return i
i = i + 1
return -1 | 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 | 94e64aae-7bb0-45bd-8969-e98b17d0a3da | 2,016 |
40,370 | def remove_zeros(list):
while 0 in list:
list.remove(0) | remove_zeros | remove_zeros | Take a list of numbers and removes the zeros from it. | assert remove_zeros([])==None and remove_zeros([])==None and remove_zeros([5202, -24344, -6528])==None and remove_zeros([5202, -24344, -6528])==None | true | 94e64aae-7bb0-45bd-8969-e98b17d0a3da | 2,016 |
26,095 | def merge_lists(l1, l2):
l3 = []
i = 0
while i < len(l1):
l3.append(l1[i])
i += 2
i = 0
while i < len(l2):
l3.append(l2[i])
i += 2
return l3 | merge_lists | merge_lists | Take two lists l1 and l2 and return a third list which contains every second element of l1 and l2. | assert merge_lists([],[])==[] and merge_lists([],[1, 2, 3, 4])==[1, 3] and merge_lists([1, 2, 3, 4],[])==[1, 3] and merge_lists([10, 20, 45, 2, -10987, 89165],[9, 0, -6754, 5625264, 8765])==[10, 45, -10987, 9, -6754, 8765] | true | 94e64aae-7bb0-45bd-8969-e98b17d0a3da | 2,016 |
37,000 | def index(str, letter):
i = 0
while i < len(str):
if letter == str[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 | true | 94e64aae-7bb0-45bd-8969-e98b17d0a3da | 2,016 |
37,457 | def fibonacci(n):
if n == 0 or n == 1:
return 1
else:
fibN_2 = 1
fibN_1 = 1
i = 2
while i <= n:
fibN = fibN_2 + fibN_1
fibN_2 = fibN_1
fibN_1 = fibN
i = i + 1
return fibN | 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 | 94e64aae-7bb0-45bd-8969-e98b17d0a3da | 2,016 |
37,876 | def search(str, letter):
i = 0
while i < len(str):
if letter == str[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 | 94e64aae-7bb0-45bd-8969-e98b17d0a3da | 2,016 |
14,377 | def fibonacci(n):
if n == 0 or n == 1:
return 1
else:
fibN_2 = 1
fibN_1 = 1
i = 2
while i <= n:
fibN = fibN_2 + fibN_1
fibN_2 = fibN_1
fibN_1 = fibN
i = i + 1
return fibN | 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 | 94e64aae-7bb0-45bd-8969-e98b17d0a3da | 2,016 |
34,334 | def index(str, letter):
i = 0
while i < len(str):
if letter == str[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 | true | 94e64aae-7bb0-45bd-8969-e98b17d0a3da | 2,016 |
15,685 | def search(str, letter):
i = 0
while i < len(str):
if letter == str[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 | 94e64aae-7bb0-45bd-8969-e98b17d0a3da | 2,016 |
15,769 | def fibonacci(n):
if n == 0 or 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 | false | 94e64aae-7bb0-45bd-8969-e98b17d0a3da | 2,016 |
25,995 | def search(str, letter):
if str == '':
return False
elif str[0] == letter:
return True
else:
return search(str[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 | 94e64aae-7bb0-45bd-8969-e98b17d0a3da | 2,016 |
16,156 | def index(str, letter, pos):
if pos == len(str):
return -1
elif str[pos] == letter:
return pos
else:
return 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 | true | 94e64aae-7bb0-45bd-8969-e98b17d0a3da | 2,016 |
24,673 | def search(str, letter):
if str == '':
return False
elif str[0] == letter:
return True
else:
return search(str[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 | 94e64aae-7bb0-45bd-8969-e98b17d0a3da | 2,016 |
28,999 | def index(str, letter, pos):
if pos == len(str):
return -1
elif str[pos] == letter:
return pos
else:
return 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 | true | 94e64aae-7bb0-45bd-8969-e98b17d0a3da | 2,016 |
13,229 | def fibonacci(n):
if n == 0 or 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 | false | 94e64aae-7bb0-45bd-8969-e98b17d0a3da | 2,016 |
42,292 | def fibonacci(n):
if n == 0 or n == 1:
return 1
else:
fibN_2 = 1
fibN_1 = 1
i = 2
while i <= n:
fibN = fibN_2 + fibN_1
fibN_2 = fibN_1
fibN_1 = fibN
i = i + 1
return fibN | 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 | 94e64aae-7bb0-45bd-8969-e98b17d0a3da | 2,016 |
7,972 | def search(str, letter):
i = 0
while i < len(str):
if letter == str[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 | 94e64aae-7bb0-45bd-8969-e98b17d0a3da | 2,016 |
21,922 | def index(str, letter):
i = 0
while i < len(str):
if letter == str[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 | true | 94e64aae-7bb0-45bd-8969-e98b17d0a3da | 2,016 |
30,075 | def fibonacci(n):
if n == 0:
return 0
if n == 1:
return 1
else:
fibN_2 = 0
fibN_1 = 1
i = 2
while i <= n:
fibN = fibN_2 + fibN_1
fibN_2 = fibN_1
fibN_1 = fibN
i = i + 1
return fibN | 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 | 94e64aae-7bb0-45bd-8969-e98b17d0a3da | 2,016 |
10,080 | def index(str, letter):
i = 0
while i < len(str):
if letter == str[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 | true | 94e64aae-7bb0-45bd-8969-e98b17d0a3da | 2,016 |
12,762 | def search(str, letter):
i = 0
while i < len(str):
if letter == str[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 | 94e64aae-7bb0-45bd-8969-e98b17d0a3da | 2,016 |
13,111 | def search(str, letter):
i = 0
while i < len(str):
if letter == str[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 | 94e64aae-7bb0-45bd-8969-e98b17d0a3da | 2,016 |
39,668 | def index(str, letter):
i = 0
while i < len(str):
if letter == str[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 | true | 94e64aae-7bb0-45bd-8969-e98b17d0a3da | 2,016 |
34,755 | def fibonacci(n):
if n == 0:
return 0
if n == 1:
return 1
else:
fibN_2 = 0
fibN_1 = 1
i = 2
while i <= n:
fibN = fibN_2 + fibN_1
fibN_2 = fibN_1
fibN_1 = fibN
i = i + 1
return fibN | 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 | 94e64aae-7bb0-45bd-8969-e98b17d0a3da | 2,016 |
17,159 | 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 | 94e64aae-7bb0-45bd-8969-e98b17d0a3da | 2,016 |
22,291 | def index(str, letter, pos):
if pos == len(str):
return -1
elif str[pos] == letter:
return pos
else:
return 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 | true | 94e64aae-7bb0-45bd-8969-e98b17d0a3da | 2,016 |
41,631 | 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 | 94e64aae-7bb0-45bd-8969-e98b17d0a3da | 2,016 |
5,613 | def search(str, letter):
if str == '':
return False
elif str[0] == letter:
return True
else:
return search(str[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 | 94e64aae-7bb0-45bd-8969-e98b17d0a3da | 2,016 |
35,583 | def search(str, letter):
if str == '':
return False
elif str[0] == letter:
return True
else:
return search(str[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 | 94e64aae-7bb0-45bd-8969-e98b17d0a3da | 2,016 |
39,739 | def index(str, letter, pos):
if pos == len(str):
return -1
elif str[pos] == letter:
return pos
else:
return 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 | true | 94e64aae-7bb0-45bd-8969-e98b17d0a3da | 2,016 |
17,387 | def search(str, letter):
if str == '':
return False
elif str[0] == letter:
return True
else:
return search(str[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 | 94e64aae-7bb0-45bd-8969-e98b17d0a3da | 2,016 |
14,010 | def index(str, letter, pos):
if pos == len(str):
return -1
elif str[pos] == letter:
return pos
else:
return 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 | true | 94e64aae-7bb0-45bd-8969-e98b17d0a3da | 2,016 |
24,877 | 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 | 94e64aae-7bb0-45bd-8969-e98b17d0a3da | 2,016 |
37,372 | def index(steve, letter):
return steve.find(letter) | 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 | 0cf3795f-3d4f-4c32-b52b-4a8e4a33e09a | 2,016 |
23,593 | def fibonacci(n):
inc1 = 1
inc2 = 0
inc3 = ''
l1 = [0]
for fib in range(0, n + 1):
inc3 = inc2
inc2 = inc1
inc1 = inc3 + inc2
l1.append(inc3)
return l1[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 | 0cf3795f-3d4f-4c32-b52b-4a8e4a33e09a | 2,016 |
34,475 | def search(steve, letter):
if letter in steve:
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 | 0cf3795f-3d4f-4c32-b52b-4a8e4a33e09a | 2,016 |
35,706 | def index(steve, letter):
return steve.find(letter) | 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 | 0cf3795f-3d4f-4c32-b52b-4a8e4a33e09a | 2,016 |
1,571 | def fibonacci(n):
inc1 = 1
inc2 = 0
inc3 = ''
l1 = [0]
for fib in range(0, n + 1):
inc3 = inc2
inc2 = inc1
inc1 = inc3 + inc2
l1.append(inc3)
return l1[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 | 0cf3795f-3d4f-4c32-b52b-4a8e4a33e09a | 2,016 |
21,222 | def search(steve, letter):
if letter in steve:
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 | 0cf3795f-3d4f-4c32-b52b-4a8e4a33e09a | 2,016 |
23,046 | def index(steve, letter):
return steve.find(letter) | 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 | 0cf3795f-3d4f-4c32-b52b-4a8e4a33e09a | 2,016 |
9,814 | def fibonacci(n):
inc1 = 1
inc2 = 0
inc3 = ''
l1 = [0]
for fib in range(0, n + 1):
inc3 = inc2
inc2 = inc1
inc1 = inc3 + inc2
l1.append(inc3)
return l1[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 | 0cf3795f-3d4f-4c32-b52b-4a8e4a33e09a | 2,016 |
9,226 | def search(steve, letter):
if letter in steve:
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 | 0cf3795f-3d4f-4c32-b52b-4a8e4a33e09a | 2,016 |
40,156 | def index(steve, letter):
return steve.find(letter) | 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 | 0cf3795f-3d4f-4c32-b52b-4a8e4a33e09a | 2,016 |
235 | def search(steve, letter):
if letter in steve:
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 | 0cf3795f-3d4f-4c32-b52b-4a8e4a33e09a | 2,016 |
2,042 | def fibonacci(n):
inc1 = 1
inc2 = 0
inc3 = ''
l1 = []
for fib in range(0, n + 1):
inc3 = inc2
inc2 = inc1
inc1 = inc3 + inc2
l1.append(inc3)
return l1[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 | 0cf3795f-3d4f-4c32-b52b-4a8e4a33e09a | 2,016 |
28,484 | def search(steve, letter):
if letter in steve:
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 | 0cf3795f-3d4f-4c32-b52b-4a8e4a33e09a | 2,016 |
11,558 | def index(steve, letter):
return steve.find(letter) | 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 | 0cf3795f-3d4f-4c32-b52b-4a8e4a33e09a | 2,016 |
34,227 | def fibonacci(n):
inc1 = 1
inc2 = 0
inc3 = ''
l1 = []
for fib in range(0, n + 1):
inc3 = inc2
inc2 = inc1
inc1 = inc3 + inc2
l1.append(inc3)
return l1[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 | 0cf3795f-3d4f-4c32-b52b-4a8e4a33e09a | 2,016 |
32,092 | def search(steve, letter):
if letter in steve:
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 | 0cf3795f-3d4f-4c32-b52b-4a8e4a33e09a | 2,016 |
8,670 | def index(steve, letter):
return steve.find(letter) | 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 | 0cf3795f-3d4f-4c32-b52b-4a8e4a33e09a | 2,016 |
17,304 | def index(steve, letter):
return steve.find(letter) | 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 | 0cf3795f-3d4f-4c32-b52b-4a8e4a33e09a | 2,016 |
33,897 | def fibonacci(n):
inc1 = 1
inc2 = 0
inc3 = ''
l1 = []
for fib in range(0, n + 1):
inc3 = inc2
inc2 = inc1
inc1 = inc3 + inc2
l1.append(inc3)
return l1[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 | 0cf3795f-3d4f-4c32-b52b-4a8e4a33e09a | 2,016 |
9,382 | def index(steve, letter):
return steve.find(letter) | 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 | 0cf3795f-3d4f-4c32-b52b-4a8e4a33e09a | 2,016 |
11,716 | def fibonacci(n):
inc1 = 1
inc2 = 0
inc3 = ''
l1 = []
for fib in range(0, n + 1):
inc3 = inc2
inc2 = inc1
inc1 = inc3 + inc2
l1.append(inc3)
return l1[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 | 0cf3795f-3d4f-4c32-b52b-4a8e4a33e09a | 2,016 |
12,766 | def search(steve, letter):
if letter in steve:
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 | 0cf3795f-3d4f-4c32-b52b-4a8e4a33e09a | 2,016 |
39,555 | def search(steve, letter):
if letter in steve:
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 | 0cf3795f-3d4f-4c32-b52b-4a8e4a33e09a | 2,016 |
31,136 | def fibonacci(n):
inc1 = 1
inc2 = 0
inc3 = ''
l1 = []
for fib in range(0, n + 1):
inc3 = inc2
inc2 = inc1
inc1 = inc3 + inc2
l1.append(inc3)
return l1[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 | 0cf3795f-3d4f-4c32-b52b-4a8e4a33e09a | 2,016 |
39,429 | 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 |
22,953 | 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 | 46396c6c-a25c-4fd6-ac1b-a1163f81f5f8 | 2,016 |
10,088 | def index(str, letter):
i = 0
while i < len(str) and str[i] != letter:
i += 1
if letter in str:
print(i)
else:
print('-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 | ead2ade9-6c50-44a4-98f3-1d781d45a0f5 | 2,016 |
38,802 | 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 | ead2ade9-6c50-44a4-98f3-1d781d45a0f5 | 2,016 |
33,444 | 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 |
33,454 | def search(string, letter):
i = 0
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 | true | e787ded7-43af-4b69-82c1-c646ab388711 | 2,016 |
27,737 | 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 |
21,826 | 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 |
35,203 | def index(str, letter):
i = 0
while i < len(str) and str[i] != letter:
i += 1
if letter in str:
print(i)
else:
print('-1')
return str, letter | 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 | ead2ade9-6c50-44a4-98f3-1d781d45a0f5 | 2,016 |
16,664 | def search(str, letter):
if letter in str:
print(True)
else:
print(False)
return str, letter | 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 | ead2ade9-6c50-44a4-98f3-1d781d45a0f5 | 2,016 |
31,036 | def search(str, letter):
if letter in 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 | ead2ade9-6c50-44a4-98f3-1d781d45a0f5 | 2,016 |
1,557 | def index(str, letter):
i = 0
while i < len(str) and str[i] != letter:
i += 1
if letter in str:
print(i)
else:
print('-1')
return | 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 | ead2ade9-6c50-44a4-98f3-1d781d45a0f5 | 2,016 |
17,094 | 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 |
25,451 | def index(str, letter):
i = 0
while i < len(str) and str[i] != letter:
i += 1
if letter in str:
print(i)
else:
print('-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 | ead2ade9-6c50-44a4-98f3-1d781d45a0f5 | 2,016 |
15,943 | 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 | ead2ade9-6c50-44a4-98f3-1d781d45a0f5 | 2,016 |
33,343 | 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 |
31,310 | def index(string, letter):
i = 0
test = -1
while i < len(string):
if letter == string[i]:
test = i
i = i + 1
return test | 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 | e787ded7-43af-4b69-82c1-c646ab388711 | 2,016 |
24,650 | 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 | true | e787ded7-43af-4b69-82c1-c646ab388711 | 2,016 |
39,010 | 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 |
20,818 | 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 | ead2ade9-6c50-44a4-98f3-1d781d45a0f5 | 2,016 |
13,329 | def index(str, letter):
i = 0
while i < len(str) and str[i] != letter:
i += 1
if letter in str:
print(i)
else:
print('-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 | ead2ade9-6c50-44a4-98f3-1d781d45a0f5 | 2,016 |
2,259 | def index(str, letter):
i = 0
while i < len(str) and str[i] != letter:
i += 1
if letter in str:
print(i)
else:
print('-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 | ead2ade9-6c50-44a4-98f3-1d781d45a0f5 | 2,016 |
39,141 | 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 | ead2ade9-6c50-44a4-98f3-1d781d45a0f5 | 2,016 |
11,539 | def index(str, letter):
i = 0
while i < len(str) and str[i] != letter:
i += 1
if letter in str:
print(i)
else:
print('-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 | ead2ade9-6c50-44a4-98f3-1d781d45a0f5 | 2,016 |
16,385 | 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 | ead2ade9-6c50-44a4-98f3-1d781d45a0f5 | 2,016 |
18,670 | 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 | ead2ade9-6c50-44a4-98f3-1d781d45a0f5 | 2,016 |
7,136 | def index(str, letter):
i = 0
while i < len(str) and str[i] != letter:
i += 1
if letter in str:
return i
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 | ead2ade9-6c50-44a4-98f3-1d781d45a0f5 | 2,016 |
1,980 | def search(str, letter):
for item in str:
if item == 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 | 46396c6c-a25c-4fd6-ac1b-a1163f81f5f8 | 2,016 |
7,102 | def index(string, letter):
i = 0
test = -1
while i < len(string):
if letter == string[i]:
test = i
i = i + 1
return test | 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 | e787ded7-43af-4b69-82c1-c646ab388711 | 2,016 |
2,327 | def search(string, letter):
i = 0
test = 1
while i < len(string):
if letter == string[i]:
return true
test = 2
i = i + 1
if test == 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 | false | e787ded7-43af-4b69-82c1-c646ab388711 | 2,016 |
23,097 | def search(string, letter):
i = 0
test = 1
while i < len(string):
if letter == string[i]:
return True
test = 2
i = i + 1
if test == 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 | e787ded7-43af-4b69-82c1-c646ab388711 | 2,016 |
36,204 | def index(string, letter):
i = 0
test = -1
while i < len(string):
if letter == string[i]:
test = i
i = i + 1
return test | 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 | e787ded7-43af-4b69-82c1-c646ab388711 | 2,016 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.