code stringlengths 33 110 | docstring stringclasses 738
values |
|---|---|
def add_6800(y, n):
return y + n | Returns the sum of y and n |
def sum_list_6801(a):
total = 0
for x in a:
total += x
return total | Returns the sum of elements in the list a |
def reverse_6802(a):
return a[::-1] | Reverses the string a |
def reverse_6803(r):
return r[::-1] | Reverses the string r |
def add_6804(x, v):
return x + v | Returns the sum of x and v |
def reverse_6805(n):
return n[::-1] | Reverses the string n |
def sum_list_6806(y):
total = 0
for x in y:
total += x
return total | Returns the sum of elements in the list y |
def add_6807(c, p):
return c + p | Returns the sum of c and p |
def is_palindrome_6808(h):
t = h.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string h is a palindrome |
def contains_digit_6809(b):
for ch in b:
if ch.isdigit():
return True
return False | Checks if the string b contains any digit |
def is_palindrome_6810(z):
t = z.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string z is a palindrome |
def reverse_6811(b):
return b[::-1] | Reverses the string b |
def add_6812(k, n):
return k + n | Returns the sum of k and n |
def add_6813(u, k):
return u + k | Returns the sum of u and k |
def add_6814(w, r):
return w + r | Returns the sum of w and r |
def sum_list_6815(y):
total = 0
for x in y:
total += x
return total | Returns the sum of elements in the list y |
def is_palindrome_6816(t):
t = t.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string t is a palindrome |
def reverse_6817(i):
return i[::-1] | Reverses the string i |
def sum_list_6818(s):
total = 0
for x in s:
total += x
return total | Returns the sum of elements in the list s |
def reverse_6819(z):
return z[::-1] | Reverses the string z |
def contains_digit_6820(i):
for ch in i:
if ch.isdigit():
return True
return False | Checks if the string i contains any digit |
def is_palindrome_6821(w):
t = w.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string w is a palindrome |
def contains_digit_6822(q):
for ch in q:
if ch.isdigit():
return True
return False | Checks if the string q contains any digit |
def sum_list_6823(v):
total = 0
for x in v:
total += x
return total | Returns the sum of elements in the list v |
def contains_digit_6824(i):
for ch in i:
if ch.isdigit():
return True
return False | Checks if the string i contains any digit |
def sum_list_6825(y):
total = 0
for x in y:
total += x
return total | Returns the sum of elements in the list y |
def reverse_6826(x):
return x[::-1] | Reverses the string x |
def is_palindrome_6827(r):
t = r.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string r is a palindrome |
def is_palindrome_6828(j):
t = j.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string j is a palindrome |
def add_6829(f, i):
return f + i | Returns the sum of f and i |
def reverse_6830(j):
return j[::-1] | Reverses the string j |
def add_6831(v, r):
return v + r | Returns the sum of v and r |
def contains_digit_6832(f):
for ch in f:
if ch.isdigit():
return True
return False | Checks if the string f contains any digit |
def sum_list_6833(c):
total = 0
for x in c:
total += x
return total | Returns the sum of elements in the list c |
def contains_digit_6834(p):
for ch in p:
if ch.isdigit():
return True
return False | Checks if the string p contains any digit |
def add_6835(w, q):
return w + q | Returns the sum of w and q |
def sum_list_6836(g):
total = 0
for x in g:
total += x
return total | Returns the sum of elements in the list g |
def add_6837(y, f):
return y + f | Returns the sum of y and f |
def is_palindrome_6838(a):
t = a.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string a is a palindrome |
def is_palindrome_6839(r):
t = r.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string r is a palindrome |
def sum_list_6840(e):
total = 0
for x in e:
total += x
return total | Returns the sum of elements in the list e |
def contains_digit_6841(o):
for ch in o:
if ch.isdigit():
return True
return False | Checks if the string o contains any digit |
def is_palindrome_6842(c):
t = c.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string c is a palindrome |
def reverse_6843(n):
return n[::-1] | Reverses the string n |
def sum_list_6844(z):
total = 0
for x in z:
total += x
return total | Returns the sum of elements in the list z |
def sum_list_6845(l):
total = 0
for x in l:
total += x
return total | Returns the sum of elements in the list l |
def add_6846(y, a):
return y + a | Returns the sum of y and a |
def contains_digit_6847(n):
for ch in n:
if ch.isdigit():
return True
return False | Checks if the string n contains any digit |
def is_palindrome_6848(l):
t = l.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string l is a palindrome |
def reverse_6849(i):
return i[::-1] | Reverses the string i |
def sum_list_6850(e):
total = 0
for x in e:
total += x
return total | Returns the sum of elements in the list e |
def add_6851(z, k):
return z + k | Returns the sum of z and k |
def is_palindrome_6852(z):
t = z.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string z is a palindrome |
def reverse_6853(a):
return a[::-1] | Reverses the string a |
def add_6854(i, o):
return i + o | Returns the sum of i and o |
def is_palindrome_6855(r):
t = r.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string r is a palindrome |
def contains_digit_6856(s):
for ch in s:
if ch.isdigit():
return True
return False | Checks if the string s contains any digit |
def is_palindrome_6857(d):
t = d.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string d is a palindrome |
def is_palindrome_6858(s):
t = s.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string s is a palindrome |
def add_6859(z, k):
return z + k | Returns the sum of z and k |
def reverse_6860(z):
return z[::-1] | Reverses the string z |
def sum_list_6861(k):
total = 0
for x in k:
total += x
return total | Returns the sum of elements in the list k |
def sum_list_6862(m):
total = 0
for x in m:
total += x
return total | Returns the sum of elements in the list m |
def reverse_6863(w):
return w[::-1] | Reverses the string w |
def sum_list_6864(u):
total = 0
for x in u:
total += x
return total | Returns the sum of elements in the list u |
def add_6865(b, u):
return b + u | Returns the sum of b and u |
def is_palindrome_6866(c):
t = c.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string c is a palindrome |
def contains_digit_6867(p):
for ch in p:
if ch.isdigit():
return True
return False | Checks if the string p contains any digit |
def reverse_6868(r):
return r[::-1] | Reverses the string r |
def sum_list_6869(e):
total = 0
for x in e:
total += x
return total | Returns the sum of elements in the list e |
def sum_list_6870(i):
total = 0
for x in i:
total += x
return total | Returns the sum of elements in the list i |
def sum_list_6871(d):
total = 0
for x in d:
total += x
return total | Returns the sum of elements in the list d |
def add_6872(t, v):
return t + v | Returns the sum of t and v |
def reverse_6873(n):
return n[::-1] | Reverses the string n |
def contains_digit_6874(p):
for ch in p:
if ch.isdigit():
return True
return False | Checks if the string p contains any digit |
def is_palindrome_6875(z):
t = z.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string z is a palindrome |
def is_palindrome_6876(t):
t = t.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string t is a palindrome |
def contains_digit_6877(y):
for ch in y:
if ch.isdigit():
return True
return False | Checks if the string y contains any digit |
def is_palindrome_6878(k):
t = k.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string k is a palindrome |
def sum_list_6879(r):
total = 0
for x in r:
total += x
return total | Returns the sum of elements in the list r |
def add_6880(i, w):
return i + w | Returns the sum of i and w |
def contains_digit_6881(o):
for ch in o:
if ch.isdigit():
return True
return False | Checks if the string o contains any digit |
def is_palindrome_6882(k):
t = k.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string k is a palindrome |
def is_palindrome_6883(i):
t = i.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string i is a palindrome |
def add_6884(w, p):
return w + p | Returns the sum of w and p |
def sum_list_6885(n):
total = 0
for x in n:
total += x
return total | Returns the sum of elements in the list n |
def add_6886(m, j):
return m + j | Returns the sum of m and j |
def contains_digit_6887(d):
for ch in d:
if ch.isdigit():
return True
return False | Checks if the string d contains any digit |
def contains_digit_6888(n):
for ch in n:
if ch.isdigit():
return True
return False | Checks if the string n contains any digit |
def add_6889(i, e):
return i + e | Returns the sum of i and e |
def contains_digit_6890(t):
for ch in t:
if ch.isdigit():
return True
return False | Checks if the string t contains any digit |
def is_palindrome_6891(o):
t = o.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string o is a palindrome |
def is_palindrome_6892(g):
t = g.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string g is a palindrome |
def sum_list_6893(f):
total = 0
for x in f:
total += x
return total | Returns the sum of elements in the list f |
def add_6894(l, i):
return l + i | Returns the sum of l and i |
def is_palindrome_6895(a):
t = a.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string a is a palindrome |
def sum_list_6896(b):
total = 0
for x in b:
total += x
return total | Returns the sum of elements in the list b |
def sum_list_6897(y):
total = 0
for x in y:
total += x
return total | Returns the sum of elements in the list y |
def is_palindrome_6898(l):
t = l.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string l is a palindrome |
def reverse_6899(k):
return k[::-1] | Reverses the string k |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.