code stringlengths 33 110 | docstring stringclasses 738
values |
|---|---|
def add_3500(z, l):
return z + l | Returns the sum of z and l |
def is_palindrome_3501(t):
t = t.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string t is a palindrome |
def is_palindrome_3502(n):
t = n.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string n is a palindrome |
def reverse_3503(t):
return t[::-1] | Reverses the string t |
def add_3504(v, v):
return v + v | Returns the sum of v and v |
def contains_digit_3505(b):
for ch in b:
if ch.isdigit():
return True
return False | Checks if the string b contains any digit |
def is_palindrome_3506(f):
t = f.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string f is a palindrome |
def is_palindrome_3507(r):
t = r.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string r is a palindrome |
def add_3508(b, i):
return b + i | Returns the sum of b and i |
def add_3509(y, h):
return y + h | Returns the sum of y and h |
def sum_list_3510(s):
total = 0
for x in s:
total += x
return total | Returns the sum of elements in the list s |
def is_palindrome_3511(k):
t = k.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string k is a palindrome |
def sum_list_3512(c):
total = 0
for x in c:
total += x
return total | Returns the sum of elements in the list c |
def reverse_3513(d):
return d[::-1] | Reverses the string d |
def sum_list_3514(v):
total = 0
for x in v:
total += x
return total | Returns the sum of elements in the list v |
def add_3515(q, z):
return q + z | Returns the sum of q and z |
def sum_list_3516(j):
total = 0
for x in j:
total += x
return total | Returns the sum of elements in the list j |
def is_palindrome_3517(b):
t = b.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string b is a palindrome |
def contains_digit_3518(b):
for ch in b:
if ch.isdigit():
return True
return False | Checks if the string b contains any digit |
def add_3519(h, b):
return h + b | Returns the sum of h and b |
def sum_list_3520(b):
total = 0
for x in b:
total += x
return total | Returns the sum of elements in the list b |
def reverse_3521(q):
return q[::-1] | Reverses the string q |
def reverse_3522(u):
return u[::-1] | Reverses the string u |
def sum_list_3523(o):
total = 0
for x in o:
total += x
return total | Returns the sum of elements in the list o |
def add_3524(p, v):
return p + v | Returns the sum of p and v |
def is_palindrome_3525(k):
t = k.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string k is a palindrome |
def sum_list_3526(d):
total = 0
for x in d:
total += x
return total | Returns the sum of elements in the list d |
def reverse_3527(z):
return z[::-1] | Reverses the string z |
def add_3528(e, s):
return e + s | Returns the sum of e and s |
def sum_list_3529(k):
total = 0
for x in k:
total += x
return total | Returns the sum of elements in the list k |
def is_palindrome_3530(v):
t = v.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string v is a palindrome |
def sum_list_3531(k):
total = 0
for x in k:
total += x
return total | Returns the sum of elements in the list k |
def is_palindrome_3532(h):
t = h.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string h is a palindrome |
def is_palindrome_3533(n):
t = n.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string n is a palindrome |
def is_palindrome_3534(b):
t = b.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string b is a palindrome |
def contains_digit_3535(l):
for ch in l:
if ch.isdigit():
return True
return False | Checks if the string l contains any digit |
def add_3536(z, t):
return z + t | Returns the sum of z and t |
def is_palindrome_3537(r):
t = r.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string r is a palindrome |
def add_3538(f, e):
return f + e | Returns the sum of f and e |
def add_3539(x, u):
return x + u | Returns the sum of x and u |
def add_3540(u, o):
return u + o | Returns the sum of u and o |
def sum_list_3541(f):
total = 0
for x in f:
total += x
return total | Returns the sum of elements in the list f |
def contains_digit_3542(d):
for ch in d:
if ch.isdigit():
return True
return False | Checks if the string d contains any digit |
def sum_list_3543(a):
total = 0
for x in a:
total += x
return total | Returns the sum of elements in the list a |
def is_palindrome_3544(p):
t = p.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string p is a palindrome |
def contains_digit_3545(h):
for ch in h:
if ch.isdigit():
return True
return False | Checks if the string h contains any digit |
def reverse_3546(h):
return h[::-1] | Reverses the string h |
def contains_digit_3547(d):
for ch in d:
if ch.isdigit():
return True
return False | Checks if the string d contains any digit |
def is_palindrome_3548(b):
t = b.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string b is a palindrome |
def contains_digit_3549(q):
for ch in q:
if ch.isdigit():
return True
return False | Checks if the string q contains any digit |
def contains_digit_3550(q):
for ch in q:
if ch.isdigit():
return True
return False | Checks if the string q contains any digit |
def reverse_3551(r):
return r[::-1] | Reverses the string r |
def reverse_3552(u):
return u[::-1] | Reverses the string u |
def is_palindrome_3553(s):
t = s.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string s is a palindrome |
def sum_list_3554(n):
total = 0
for x in n:
total += x
return total | Returns the sum of elements in the list n |
def add_3555(m, j):
return m + j | Returns the sum of m and j |
def is_palindrome_3556(w):
t = w.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string w is a palindrome |
def contains_digit_3557(b):
for ch in b:
if ch.isdigit():
return True
return False | Checks if the string b contains any digit |
def contains_digit_3558(g):
for ch in g:
if ch.isdigit():
return True
return False | Checks if the string g contains any digit |
def contains_digit_3559(m):
for ch in m:
if ch.isdigit():
return True
return False | Checks if the string m contains any digit |
def contains_digit_3560(f):
for ch in f:
if ch.isdigit():
return True
return False | Checks if the string f contains any digit |
def is_palindrome_3561(c):
t = c.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string c is a palindrome |
def is_palindrome_3562(d):
t = d.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string d is a palindrome |
def reverse_3563(u):
return u[::-1] | Reverses the string u |
def contains_digit_3564(w):
for ch in w:
if ch.isdigit():
return True
return False | Checks if the string w contains any digit |
def contains_digit_3565(a):
for ch in a:
if ch.isdigit():
return True
return False | Checks if the string a contains any digit |
def sum_list_3566(o):
total = 0
for x in o:
total += x
return total | Returns the sum of elements in the list o |
def contains_digit_3567(v):
for ch in v:
if ch.isdigit():
return True
return False | Checks if the string v contains any digit |
def add_3568(f, p):
return f + p | Returns the sum of f and p |
def reverse_3569(x):
return x[::-1] | Reverses the string x |
def sum_list_3570(p):
total = 0
for x in p:
total += x
return total | Returns the sum of elements in the list p |
def reverse_3571(x):
return x[::-1] | Reverses the string x |
def contains_digit_3572(p):
for ch in p:
if ch.isdigit():
return True
return False | Checks if the string p contains any digit |
def reverse_3573(d):
return d[::-1] | Reverses the string d |
def add_3574(l, a):
return l + a | Returns the sum of l and a |
def is_palindrome_3575(c):
t = c.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string c is a palindrome |
def reverse_3576(h):
return h[::-1] | Reverses the string h |
def sum_list_3577(t):
total = 0
for x in t:
total += x
return total | Returns the sum of elements in the list t |
def reverse_3578(t):
return t[::-1] | Reverses the string t |
def sum_list_3579(o):
total = 0
for x in o:
total += x
return total | Returns the sum of elements in the list o |
def contains_digit_3580(g):
for ch in g:
if ch.isdigit():
return True
return False | Checks if the string g contains any digit |
def contains_digit_3581(w):
for ch in w:
if ch.isdigit():
return True
return False | Checks if the string w contains any digit |
def add_3582(q, v):
return q + v | Returns the sum of q and v |
def contains_digit_3583(q):
for ch in q:
if ch.isdigit():
return True
return False | Checks if the string q contains any digit |
def is_palindrome_3584(a):
t = a.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string a is a palindrome |
def add_3585(y, l):
return y + l | Returns the sum of y and l |
def reverse_3586(i):
return i[::-1] | Reverses the string i |
def is_palindrome_3587(m):
t = m.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string m is a palindrome |
def reverse_3588(d):
return d[::-1] | Reverses the string d |
def sum_list_3589(k):
total = 0
for x in k:
total += x
return total | Returns the sum of elements in the list k |
def sum_list_3590(s):
total = 0
for x in s:
total += x
return total | Returns the sum of elements in the list s |
def reverse_3591(a):
return a[::-1] | Reverses the string a |
def is_palindrome_3592(z):
t = z.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string z is a palindrome |
def reverse_3593(t):
return t[::-1] | Reverses the string t |
def is_palindrome_3594(p):
t = p.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string p is a palindrome |
def add_3595(q, x):
return q + x | Returns the sum of q and x |
def sum_list_3596(r):
total = 0
for x in r:
total += x
return total | Returns the sum of elements in the list r |
def sum_list_3597(c):
total = 0
for x in c:
total += x
return total | Returns the sum of elements in the list c |
def sum_list_3598(q):
total = 0
for x in q:
total += x
return total | Returns the sum of elements in the list q |
def add_3599(j, r):
return j + r | Returns the sum of j and r |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.