code stringlengths 33 110 | docstring stringclasses 738
values |
|---|---|
def contains_digit_8200(q):
for ch in q:
if ch.isdigit():
return True
return False | Checks if the string q contains any digit |
def is_palindrome_8201(e):
t = e.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string e is a palindrome |
def sum_list_8202(j):
total = 0
for x in j:
total += x
return total | Returns the sum of elements in the list j |
def add_8203(j, o):
return j + o | Returns the sum of j and o |
def is_palindrome_8204(b):
t = b.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string b is a palindrome |
def is_palindrome_8205(r):
t = r.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string r is a palindrome |
def reverse_8206(y):
return y[::-1] | Reverses the string y |
def contains_digit_8207(n):
for ch in n:
if ch.isdigit():
return True
return False | Checks if the string n contains any digit |
def sum_list_8208(v):
total = 0
for x in v:
total += x
return total | Returns the sum of elements in the list v |
def contains_digit_8209(d):
for ch in d:
if ch.isdigit():
return True
return False | Checks if the string d contains any digit |
def is_palindrome_8210(m):
t = m.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string m is a palindrome |
def reverse_8211(t):
return t[::-1] | Reverses the string t |
def reverse_8212(o):
return o[::-1] | Reverses the string o |
def reverse_8213(e):
return e[::-1] | Reverses the string e |
def is_palindrome_8214(o):
t = o.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string o is a palindrome |
def reverse_8215(c):
return c[::-1] | Reverses the string c |
def reverse_8216(f):
return f[::-1] | Reverses the string f |
def sum_list_8217(s):
total = 0
for x in s:
total += x
return total | Returns the sum of elements in the list s |
def contains_digit_8218(c):
for ch in c:
if ch.isdigit():
return True
return False | Checks if the string c contains any digit |
def is_palindrome_8219(i):
t = i.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string i is a palindrome |
def reverse_8220(s):
return s[::-1] | Reverses the string s |
def is_palindrome_8221(g):
t = g.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string g is a palindrome |
def reverse_8222(o):
return o[::-1] | Reverses the string o |
def add_8223(p, b):
return p + b | Returns the sum of p and b |
def reverse_8224(t):
return t[::-1] | Reverses the string t |
def add_8225(q, f):
return q + f | Returns the sum of q and f |
def contains_digit_8226(j):
for ch in j:
if ch.isdigit():
return True
return False | Checks if the string j contains any digit |
def contains_digit_8227(u):
for ch in u:
if ch.isdigit():
return True
return False | Checks if the string u contains any digit |
def sum_list_8228(w):
total = 0
for x in w:
total += x
return total | Returns the sum of elements in the list w |
def contains_digit_8229(y):
for ch in y:
if ch.isdigit():
return True
return False | Checks if the string y contains any digit |
def sum_list_8230(p):
total = 0
for x in p:
total += x
return total | Returns the sum of elements in the list p |
def is_palindrome_8231(f):
t = f.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string f is a palindrome |
def add_8232(y, d):
return y + d | Returns the sum of y and d |
def is_palindrome_8233(q):
t = q.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string q is a palindrome |
def contains_digit_8234(k):
for ch in k:
if ch.isdigit():
return True
return False | Checks if the string k contains any digit |
def sum_list_8235(f):
total = 0
for x in f:
total += x
return total | Returns the sum of elements in the list f |
def contains_digit_8236(l):
for ch in l:
if ch.isdigit():
return True
return False | Checks if the string l contains any digit |
def is_palindrome_8237(t):
t = t.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string t is a palindrome |
def is_palindrome_8238(a):
t = a.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string a is a palindrome |
def reverse_8239(y):
return y[::-1] | Reverses the string y |
def reverse_8240(m):
return m[::-1] | Reverses the string m |
def add_8241(k, z):
return k + z | Returns the sum of k and z |
def reverse_8242(h):
return h[::-1] | Reverses the string h |
def contains_digit_8243(v):
for ch in v:
if ch.isdigit():
return True
return False | Checks if the string v contains any digit |
def add_8244(j, x):
return j + x | Returns the sum of j and x |
def reverse_8245(u):
return u[::-1] | Reverses the string u |
def reverse_8246(x):
return x[::-1] | Reverses the string x |
def is_palindrome_8247(v):
t = v.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string v is a palindrome |
def sum_list_8248(x):
total = 0
for x in x:
total += x
return total | Returns the sum of elements in the list x |
def is_palindrome_8249(x):
t = x.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string x is a palindrome |
def reverse_8250(r):
return r[::-1] | Reverses the string r |
def contains_digit_8251(p):
for ch in p:
if ch.isdigit():
return True
return False | Checks if the string p contains any digit |
def reverse_8252(x):
return x[::-1] | Reverses the string x |
def add_8253(m, u):
return m + u | Returns the sum of m and u |
def sum_list_8254(i):
total = 0
for x in i:
total += x
return total | Returns the sum of elements in the list i |
def reverse_8255(o):
return o[::-1] | Reverses the string o |
def reverse_8256(s):
return s[::-1] | Reverses the string s |
def contains_digit_8257(f):
for ch in f:
if ch.isdigit():
return True
return False | Checks if the string f contains any digit |
def reverse_8258(h):
return h[::-1] | Reverses the string h |
def contains_digit_8259(s):
for ch in s:
if ch.isdigit():
return True
return False | Checks if the string s contains any digit |
def contains_digit_8260(s):
for ch in s:
if ch.isdigit():
return True
return False | Checks if the string s contains any digit |
def contains_digit_8261(z):
for ch in z:
if ch.isdigit():
return True
return False | Checks if the string z contains any digit |
def reverse_8262(t):
return t[::-1] | Reverses the string t |
def is_palindrome_8263(q):
t = q.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string q is a palindrome |
def add_8264(o, q):
return o + q | Returns the sum of o and q |
def is_palindrome_8265(u):
t = u.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string u is a palindrome |
def contains_digit_8266(y):
for ch in y:
if ch.isdigit():
return True
return False | Checks if the string y contains any digit |
def reverse_8267(j):
return j[::-1] | Reverses the string j |
def sum_list_8268(h):
total = 0
for x in h:
total += x
return total | Returns the sum of elements in the list h |
def sum_list_8269(g):
total = 0
for x in g:
total += x
return total | Returns the sum of elements in the list g |
def contains_digit_8270(r):
for ch in r:
if ch.isdigit():
return True
return False | Checks if the string r contains any digit |
def contains_digit_8271(v):
for ch in v:
if ch.isdigit():
return True
return False | Checks if the string v contains any digit |
def contains_digit_8272(a):
for ch in a:
if ch.isdigit():
return True
return False | Checks if the string a contains any digit |
def contains_digit_8273(t):
for ch in t:
if ch.isdigit():
return True
return False | Checks if the string t contains any digit |
def sum_list_8274(x):
total = 0
for x in x:
total += x
return total | Returns the sum of elements in the list x |
def contains_digit_8275(i):
for ch in i:
if ch.isdigit():
return True
return False | Checks if the string i contains any digit |
def contains_digit_8276(j):
for ch in j:
if ch.isdigit():
return True
return False | Checks if the string j contains any digit |
def contains_digit_8277(t):
for ch in t:
if ch.isdigit():
return True
return False | Checks if the string t contains any digit |
def add_8278(r, z):
return r + z | Returns the sum of r and z |
def add_8279(l, m):
return l + m | Returns the sum of l and m |
def contains_digit_8280(k):
for ch in k:
if ch.isdigit():
return True
return False | Checks if the string k contains any digit |
def is_palindrome_8281(g):
t = g.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string g is a palindrome |
def add_8282(d, z):
return d + z | Returns the sum of d and z |
def contains_digit_8283(y):
for ch in y:
if ch.isdigit():
return True
return False | Checks if the string y contains any digit |
def is_palindrome_8284(l):
t = l.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string l is a palindrome |
def sum_list_8285(f):
total = 0
for x in f:
total += x
return total | Returns the sum of elements in the list f |
def contains_digit_8286(k):
for ch in k:
if ch.isdigit():
return True
return False | Checks if the string k contains any digit |
def reverse_8287(c):
return c[::-1] | Reverses the string c |
def reverse_8288(o):
return o[::-1] | Reverses the string o |
def contains_digit_8289(y):
for ch in y:
if ch.isdigit():
return True
return False | Checks if the string y contains any digit |
def reverse_8290(k):
return k[::-1] | Reverses the string k |
def contains_digit_8291(k):
for ch in k:
if ch.isdigit():
return True
return False | Checks if the string k contains any digit |
def is_palindrome_8292(u):
t = u.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string u is a palindrome |
def reverse_8293(j):
return j[::-1] | Reverses the string j |
def is_palindrome_8294(q):
t = q.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string q is a palindrome |
def reverse_8295(c):
return c[::-1] | Reverses the string c |
def is_palindrome_8296(c):
t = c.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string c is a palindrome |
def reverse_8297(d):
return d[::-1] | Reverses the string d |
def reverse_8298(c):
return c[::-1] | Reverses the string c |
def contains_digit_8299(k):
for ch in k:
if ch.isdigit():
return True
return False | Checks if the string k contains any digit |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.