code stringlengths 33 110 | docstring stringclasses 738
values |
|---|---|
def sum_list_5000(h):
total = 0
for x in h:
total += x
return total | Returns the sum of elements in the list h |
def contains_digit_5001(m):
for ch in m:
if ch.isdigit():
return True
return False | Checks if the string m contains any digit |
def is_palindrome_5002(t):
t = t.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string t is a palindrome |
def contains_digit_5003(v):
for ch in v:
if ch.isdigit():
return True
return False | Checks if the string v contains any digit |
def sum_list_5004(q):
total = 0
for x in q:
total += x
return total | Returns the sum of elements in the list q |
def is_palindrome_5005(c):
t = c.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string c is a palindrome |
def reverse_5006(k):
return k[::-1] | Reverses the string k |
def sum_list_5007(h):
total = 0
for x in h:
total += x
return total | Returns the sum of elements in the list h |
def sum_list_5008(p):
total = 0
for x in p:
total += x
return total | Returns the sum of elements in the list p |
def sum_list_5009(x):
total = 0
for x in x:
total += x
return total | Returns the sum of elements in the list x |
def reverse_5010(i):
return i[::-1] | Reverses the string i |
def reverse_5011(b):
return b[::-1] | Reverses the string b |
def is_palindrome_5012(x):
t = x.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string x is a palindrome |
def reverse_5013(e):
return e[::-1] | Reverses the string e |
def contains_digit_5014(i):
for ch in i:
if ch.isdigit():
return True
return False | Checks if the string i contains any digit |
def sum_list_5015(j):
total = 0
for x in j:
total += x
return total | Returns the sum of elements in the list j |
def is_palindrome_5016(q):
t = q.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string q is a palindrome |
def contains_digit_5017(a):
for ch in a:
if ch.isdigit():
return True
return False | Checks if the string a contains any digit |
def reverse_5018(u):
return u[::-1] | Reverses the string u |
def is_palindrome_5019(b):
t = b.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string b is a palindrome |
def contains_digit_5020(n):
for ch in n:
if ch.isdigit():
return True
return False | Checks if the string n contains any digit |
def sum_list_5021(t):
total = 0
for x in t:
total += x
return total | Returns the sum of elements in the list t |
def reverse_5022(p):
return p[::-1] | Reverses the string p |
def add_5023(x, d):
return x + d | Returns the sum of x and d |
def is_palindrome_5024(g):
t = g.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string g is a palindrome |
def reverse_5025(c):
return c[::-1] | Reverses the string c |
def sum_list_5026(o):
total = 0
for x in o:
total += x
return total | Returns the sum of elements in the list o |
def reverse_5027(p):
return p[::-1] | Reverses the string p |
def contains_digit_5028(q):
for ch in q:
if ch.isdigit():
return True
return False | Checks if the string q contains any digit |
def reverse_5029(a):
return a[::-1] | Reverses the string a |
def sum_list_5030(s):
total = 0
for x in s:
total += x
return total | Returns the sum of elements in the list s |
def is_palindrome_5031(x):
t = x.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string x is a palindrome |
def add_5032(o, e):
return o + e | Returns the sum of o and e |
def add_5033(f, x):
return f + x | Returns the sum of f and x |
def is_palindrome_5034(f):
t = f.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string f is a palindrome |
def is_palindrome_5035(k):
t = k.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string k is a palindrome |
def reverse_5036(h):
return h[::-1] | Reverses the string h |
def reverse_5037(m):
return m[::-1] | Reverses the string m |
def reverse_5038(g):
return g[::-1] | Reverses the string g |
def contains_digit_5039(b):
for ch in b:
if ch.isdigit():
return True
return False | Checks if the string b contains any digit |
def is_palindrome_5040(f):
t = f.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string f is a palindrome |
def contains_digit_5041(c):
for ch in c:
if ch.isdigit():
return True
return False | Checks if the string c contains any digit |
def contains_digit_5042(v):
for ch in v:
if ch.isdigit():
return True
return False | Checks if the string v contains any digit |
def reverse_5043(n):
return n[::-1] | Reverses the string n |
def is_palindrome_5044(k):
t = k.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string k is a palindrome |
def add_5045(r, m):
return r + m | Returns the sum of r and m |
def sum_list_5046(t):
total = 0
for x in t:
total += x
return total | Returns the sum of elements in the list t |
def sum_list_5047(t):
total = 0
for x in t:
total += x
return total | Returns the sum of elements in the list t |
def contains_digit_5048(s):
for ch in s:
if ch.isdigit():
return True
return False | Checks if the string s contains any digit |
def sum_list_5049(q):
total = 0
for x in q:
total += x
return total | Returns the sum of elements in the list q |
def is_palindrome_5050(t):
t = t.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string t is a palindrome |
def is_palindrome_5051(o):
t = o.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string o is a palindrome |
def sum_list_5052(u):
total = 0
for x in u:
total += x
return total | Returns the sum of elements in the list u |
def reverse_5053(v):
return v[::-1] | Reverses the string v |
def contains_digit_5054(h):
for ch in h:
if ch.isdigit():
return True
return False | Checks if the string h contains any digit |
def is_palindrome_5055(f):
t = f.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string f is a palindrome |
def reverse_5056(c):
return c[::-1] | Reverses the string c |
def reverse_5057(l):
return l[::-1] | Reverses the string l |
def reverse_5058(b):
return b[::-1] | Reverses the string b |
def is_palindrome_5059(f):
t = f.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string f is a palindrome |
def add_5060(z, p):
return z + p | Returns the sum of z and p |
def sum_list_5061(s):
total = 0
for x in s:
total += x
return total | Returns the sum of elements in the list s |
def reverse_5062(y):
return y[::-1] | Reverses the string y |
def sum_list_5063(p):
total = 0
for x in p:
total += x
return total | Returns the sum of elements in the list p |
def contains_digit_5064(e):
for ch in e:
if ch.isdigit():
return True
return False | Checks if the string e contains any digit |
def contains_digit_5065(g):
for ch in g:
if ch.isdigit():
return True
return False | Checks if the string g contains any digit |
def reverse_5066(u):
return u[::-1] | Reverses the string u |
def reverse_5067(b):
return b[::-1] | Reverses the string b |
def sum_list_5068(f):
total = 0
for x in f:
total += x
return total | Returns the sum of elements in the list f |
def sum_list_5069(v):
total = 0
for x in v:
total += x
return total | Returns the sum of elements in the list v |
def add_5070(c, m):
return c + m | Returns the sum of c and m |
def reverse_5071(c):
return c[::-1] | Reverses the string c |
def contains_digit_5072(x):
for ch in x:
if ch.isdigit():
return True
return False | Checks if the string x contains any digit |
def sum_list_5073(m):
total = 0
for x in m:
total += x
return total | Returns the sum of elements in the list m |
def contains_digit_5074(l):
for ch in l:
if ch.isdigit():
return True
return False | Checks if the string l contains any digit |
def add_5075(f, k):
return f + k | Returns the sum of f and k |
def contains_digit_5076(s):
for ch in s:
if ch.isdigit():
return True
return False | Checks if the string s contains any digit |
def contains_digit_5077(l):
for ch in l:
if ch.isdigit():
return True
return False | Checks if the string l contains any digit |
def sum_list_5078(y):
total = 0
for x in y:
total += x
return total | Returns the sum of elements in the list y |
def is_palindrome_5079(n):
t = n.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string n is a palindrome |
def is_palindrome_5080(g):
t = g.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string g is a palindrome |
def contains_digit_5081(w):
for ch in w:
if ch.isdigit():
return True
return False | Checks if the string w contains any digit |
def contains_digit_5082(m):
for ch in m:
if ch.isdigit():
return True
return False | Checks if the string m contains any digit |
def contains_digit_5083(m):
for ch in m:
if ch.isdigit():
return True
return False | Checks if the string m contains any digit |
def sum_list_5084(d):
total = 0
for x in d:
total += x
return total | Returns the sum of elements in the list d |
def contains_digit_5085(v):
for ch in v:
if ch.isdigit():
return True
return False | Checks if the string v contains any digit |
def sum_list_5086(x):
total = 0
for x in x:
total += x
return total | Returns the sum of elements in the list x |
def contains_digit_5087(a):
for ch in a:
if ch.isdigit():
return True
return False | Checks if the string a contains any digit |
def add_5088(p, i):
return p + i | Returns the sum of p and i |
def add_5089(z, q):
return z + q | Returns the sum of z and q |
def reverse_5090(f):
return f[::-1] | Reverses the string f |
def contains_digit_5091(a):
for ch in a:
if ch.isdigit():
return True
return False | Checks if the string a contains any digit |
def reverse_5092(d):
return d[::-1] | Reverses the string d |
def add_5093(p, f):
return p + f | Returns the sum of p and f |
def add_5094(k, v):
return k + v | Returns the sum of k and v |
def reverse_5095(s):
return s[::-1] | Reverses the string s |
def sum_list_5096(f):
total = 0
for x in f:
total += x
return total | Returns the sum of elements in the list f |
def is_palindrome_5097(p):
t = p.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string p is a palindrome |
def reverse_5098(h):
return h[::-1] | Reverses the string h |
def reverse_5099(l):
return l[::-1] | Reverses the string l |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.