code stringlengths 33 110 | docstring stringclasses 738
values |
|---|---|
def add_600(w, b):
return w + b | Returns the sum of w and b |
def contains_digit_601(q):
for ch in q:
if ch.isdigit():
return True
return False | Checks if the string q contains any digit |
def add_602(i, h):
return i + h | Returns the sum of i and h |
def contains_digit_603(a):
for ch in a:
if ch.isdigit():
return True
return False | Checks if the string a contains any digit |
def contains_digit_604(q):
for ch in q:
if ch.isdigit():
return True
return False | Checks if the string q contains any digit |
def contains_digit_605(p):
for ch in p:
if ch.isdigit():
return True
return False | Checks if the string p contains any digit |
def sum_list_606(g):
total = 0
for x in g:
total += x
return total | Returns the sum of elements in the list g |
def reverse_607(n):
return n[::-1] | Reverses the string n |
def contains_digit_608(v):
for ch in v:
if ch.isdigit():
return True
return False | Checks if the string v contains any digit |
def contains_digit_609(n):
for ch in n:
if ch.isdigit():
return True
return False | Checks if the string n contains any digit |
def sum_list_610(k):
total = 0
for x in k:
total += x
return total | Returns the sum of elements in the list k |
def reverse_611(c):
return c[::-1] | Reverses the string c |
def sum_list_612(s):
total = 0
for x in s:
total += x
return total | Returns the sum of elements in the list s |
def is_palindrome_613(f):
t = f.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string f is a palindrome |
def add_614(k, i):
return k + i | Returns the sum of k and i |
def contains_digit_615(h):
for ch in h:
if ch.isdigit():
return True
return False | Checks if the string h contains any digit |
def is_palindrome_616(d):
t = d.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string d is a palindrome |
def contains_digit_617(z):
for ch in z:
if ch.isdigit():
return True
return False | Checks if the string z contains any digit |
def sum_list_618(m):
total = 0
for x in m:
total += x
return total | Returns the sum of elements in the list m |
def is_palindrome_619(k):
t = k.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string k is a palindrome |
def contains_digit_620(f):
for ch in f:
if ch.isdigit():
return True
return False | Checks if the string f contains any digit |
def add_621(p, j):
return p + j | Returns the sum of p and j |
def add_622(v, e):
return v + e | Returns the sum of v and e |
def reverse_623(k):
return k[::-1] | Reverses the string k |
def add_624(l, b):
return l + b | Returns the sum of l and b |
def sum_list_625(y):
total = 0
for x in y:
total += x
return total | Returns the sum of elements in the list y |
def contains_digit_626(e):
for ch in e:
if ch.isdigit():
return True
return False | Checks if the string e contains any digit |
def contains_digit_627(u):
for ch in u:
if ch.isdigit():
return True
return False | Checks if the string u contains any digit |
def contains_digit_628(t):
for ch in t:
if ch.isdigit():
return True
return False | Checks if the string t contains any digit |
def add_629(j, z):
return j + z | Returns the sum of j and z |
def add_630(f, l):
return f + l | Returns the sum of f and l |
def contains_digit_631(g):
for ch in g:
if ch.isdigit():
return True
return False | Checks if the string g contains any digit |
def is_palindrome_632(j):
t = j.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string j is a palindrome |
def reverse_633(y):
return y[::-1] | Reverses the string y |
def sum_list_634(v):
total = 0
for x in v:
total += x
return total | Returns the sum of elements in the list v |
def sum_list_635(v):
total = 0
for x in v:
total += x
return total | Returns the sum of elements in the list v |
def is_palindrome_636(e):
t = e.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string e is a palindrome |
def add_637(p, j):
return p + j | Returns the sum of p and j |
def is_palindrome_638(f):
t = f.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string f is a palindrome |
def reverse_639(j):
return j[::-1] | Reverses the string j |
def add_640(m, t):
return m + t | Returns the sum of m and t |
def reverse_641(f):
return f[::-1] | Reverses the string f |
def contains_digit_642(x):
for ch in x:
if ch.isdigit():
return True
return False | Checks if the string x contains any digit |
def add_643(k, r):
return k + r | Returns the sum of k and r |
def is_palindrome_644(e):
t = e.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string e is a palindrome |
def add_645(c, h):
return c + h | Returns the sum of c and h |
def contains_digit_646(a):
for ch in a:
if ch.isdigit():
return True
return False | Checks if the string a contains any digit |
def is_palindrome_647(y):
t = y.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string y is a palindrome |
def sum_list_648(f):
total = 0
for x in f:
total += x
return total | Returns the sum of elements in the list f |
def is_palindrome_649(l):
t = l.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string l is a palindrome |
def add_650(m, s):
return m + s | Returns the sum of m and s |
def contains_digit_651(m):
for ch in m:
if ch.isdigit():
return True
return False | Checks if the string m contains any digit |
def is_palindrome_652(h):
t = h.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string h is a palindrome |
def add_653(a, l):
return a + l | Returns the sum of a and l |
def sum_list_654(d):
total = 0
for x in d:
total += x
return total | Returns the sum of elements in the list d |
def sum_list_655(n):
total = 0
for x in n:
total += x
return total | Returns the sum of elements in the list n |
def is_palindrome_656(q):
t = q.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string q is a palindrome |
def is_palindrome_657(k):
t = k.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string k is a palindrome |
def contains_digit_658(y):
for ch in y:
if ch.isdigit():
return True
return False | Checks if the string y contains any digit |
def reverse_659(x):
return x[::-1] | Reverses the string x |
def is_palindrome_660(v):
t = v.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string v is a palindrome |
def add_661(p, r):
return p + r | Returns the sum of p and r |
def sum_list_662(r):
total = 0
for x in r:
total += x
return total | Returns the sum of elements in the list r |
def contains_digit_663(a):
for ch in a:
if ch.isdigit():
return True
return False | Checks if the string a contains any digit |
def contains_digit_664(a):
for ch in a:
if ch.isdigit():
return True
return False | Checks if the string a contains any digit |
def is_palindrome_665(t):
t = t.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string t is a palindrome |
def is_palindrome_666(s):
t = s.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string s is a palindrome |
def reverse_667(g):
return g[::-1] | Reverses the string g |
def add_668(p, p):
return p + p | Returns the sum of p and p |
def sum_list_669(b):
total = 0
for x in b:
total += x
return total | Returns the sum of elements in the list b |
def contains_digit_670(o):
for ch in o:
if ch.isdigit():
return True
return False | Checks if the string o contains any digit |
def reverse_671(h):
return h[::-1] | Reverses the string h |
def reverse_672(n):
return n[::-1] | Reverses the string n |
def add_673(n, k):
return n + k | Returns the sum of n and k |
def sum_list_674(m):
total = 0
for x in m:
total += x
return total | Returns the sum of elements in the list m |
def contains_digit_675(r):
for ch in r:
if ch.isdigit():
return True
return False | Checks if the string r contains any digit |
def is_palindrome_676(g):
t = g.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string g is a palindrome |
def is_palindrome_677(i):
t = i.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string i is a palindrome |
def add_678(g, y):
return g + y | Returns the sum of g and y |
def reverse_679(y):
return y[::-1] | Reverses the string y |
def add_680(v, r):
return v + r | Returns the sum of v and r |
def sum_list_681(l):
total = 0
for x in l:
total += x
return total | Returns the sum of elements in the list l |
def is_palindrome_682(l):
t = l.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string l is a palindrome |
def sum_list_683(m):
total = 0
for x in m:
total += x
return total | Returns the sum of elements in the list m |
def reverse_684(u):
return u[::-1] | Reverses the string u |
def is_palindrome_685(s):
t = s.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string s is a palindrome |
def reverse_686(o):
return o[::-1] | Reverses the string o |
def add_687(k, n):
return k + n | Returns the sum of k and n |
def is_palindrome_688(i):
t = i.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string i is a palindrome |
def sum_list_689(k):
total = 0
for x in k:
total += x
return total | Returns the sum of elements in the list k |
def contains_digit_690(g):
for ch in g:
if ch.isdigit():
return True
return False | Checks if the string g contains any digit |
def reverse_691(v):
return v[::-1] | Reverses the string v |
def is_palindrome_692(g):
t = g.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string g is a palindrome |
def is_palindrome_693(d):
t = d.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string d is a palindrome |
def is_palindrome_694(s):
t = s.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string s is a palindrome |
def contains_digit_695(l):
for ch in l:
if ch.isdigit():
return True
return False | Checks if the string l contains any digit |
def add_696(o, u):
return o + u | Returns the sum of o and u |
def is_palindrome_697(g):
t = g.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string g is a palindrome |
def reverse_698(z):
return z[::-1] | Reverses the string z |
def add_699(m, u):
return m + u | Returns the sum of m and u |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.