code stringlengths 33 110 | docstring stringclasses 738
values |
|---|---|
def contains_digit_9900(d):
for ch in d:
if ch.isdigit():
return True
return False | Checks if the string d contains any digit |
def add_9901(f, h):
return f + h | Returns the sum of f and h |
def is_palindrome_9902(l):
t = l.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string l is a palindrome |
def is_palindrome_9903(t):
t = t.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string t is a palindrome |
def is_palindrome_9904(i):
t = i.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string i is a palindrome |
def sum_list_9905(h):
total = 0
for x in h:
total += x
return total | Returns the sum of elements in the list h |
def reverse_9906(t):
return t[::-1] | Reverses the string t |
def is_palindrome_9907(j):
t = j.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string j is a palindrome |
def reverse_9908(a):
return a[::-1] | Reverses the string a |
def add_9909(m, l):
return m + l | Returns the sum of m and l |
def sum_list_9910(c):
total = 0
for x in c:
total += x
return total | Returns the sum of elements in the list c |
def sum_list_9911(x):
total = 0
for x in x:
total += x
return total | Returns the sum of elements in the list x |
def is_palindrome_9912(l):
t = l.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string l is a palindrome |
def reverse_9913(t):
return t[::-1] | Reverses the string t |
def add_9914(v, s):
return v + s | Returns the sum of v and s |
def add_9915(i, x):
return i + x | Returns the sum of i and x |
def is_palindrome_9916(x):
t = x.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string x is a palindrome |
def contains_digit_9917(t):
for ch in t:
if ch.isdigit():
return True
return False | Checks if the string t contains any digit |
def sum_list_9918(k):
total = 0
for x in k:
total += x
return total | Returns the sum of elements in the list k |
def reverse_9919(d):
return d[::-1] | Reverses the string d |
def add_9920(z, o):
return z + o | Returns the sum of z and o |
def is_palindrome_9921(u):
t = u.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string u is a palindrome |
def add_9922(f, u):
return f + u | Returns the sum of f and u |
def add_9923(l, a):
return l + a | Returns the sum of l and a |
def reverse_9924(v):
return v[::-1] | Reverses the string v |
def sum_list_9925(f):
total = 0
for x in f:
total += x
return total | Returns the sum of elements in the list f |
def reverse_9926(s):
return s[::-1] | Reverses the string s |
def is_palindrome_9927(m):
t = m.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string m is a palindrome |
def reverse_9928(n):
return n[::-1] | Reverses the string n |
def sum_list_9929(c):
total = 0
for x in c:
total += x
return total | Returns the sum of elements in the list c |
def is_palindrome_9930(o):
t = o.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string o is a palindrome |
def contains_digit_9931(t):
for ch in t:
if ch.isdigit():
return True
return False | Checks if the string t contains any digit |
def reverse_9932(i):
return i[::-1] | Reverses the string i |
def contains_digit_9933(e):
for ch in e:
if ch.isdigit():
return True
return False | Checks if the string e contains any digit |
def reverse_9934(y):
return y[::-1] | Reverses the string y |
def sum_list_9935(p):
total = 0
for x in p:
total += x
return total | Returns the sum of elements in the list p |
def sum_list_9936(l):
total = 0
for x in l:
total += x
return total | Returns the sum of elements in the list l |
def is_palindrome_9937(c):
t = c.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string c is a palindrome |
def reverse_9938(q):
return q[::-1] | Reverses the string q |
def contains_digit_9939(m):
for ch in m:
if ch.isdigit():
return True
return False | Checks if the string m contains any digit |
def contains_digit_9940(g):
for ch in g:
if ch.isdigit():
return True
return False | Checks if the string g contains any digit |
def sum_list_9941(m):
total = 0
for x in m:
total += x
return total | Returns the sum of elements in the list m |
def add_9942(v, p):
return v + p | Returns the sum of v and p |
def contains_digit_9943(m):
for ch in m:
if ch.isdigit():
return True
return False | Checks if the string m contains any digit |
def contains_digit_9944(f):
for ch in f:
if ch.isdigit():
return True
return False | Checks if the string f contains any digit |
def add_9945(z, m):
return z + m | Returns the sum of z and m |
def add_9946(z, m):
return z + m | Returns the sum of z and m |
def add_9947(t, e):
return t + e | Returns the sum of t and e |
def sum_list_9948(x):
total = 0
for x in x:
total += x
return total | Returns the sum of elements in the list x |
def add_9949(f, n):
return f + n | Returns the sum of f and n |
def contains_digit_9950(b):
for ch in b:
if ch.isdigit():
return True
return False | Checks if the string b contains any digit |
def is_palindrome_9951(b):
t = b.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string b is a palindrome |
def add_9952(o, n):
return o + n | Returns the sum of o and n |
def is_palindrome_9953(o):
t = o.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string o is a palindrome |
def sum_list_9954(g):
total = 0
for x in g:
total += x
return total | Returns the sum of elements in the list g |
def is_palindrome_9955(h):
t = h.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string h is a palindrome |
def sum_list_9956(b):
total = 0
for x in b:
total += x
return total | Returns the sum of elements in the list b |
def reverse_9957(j):
return j[::-1] | Reverses the string j |
def is_palindrome_9958(h):
t = h.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string h is a palindrome |
def add_9959(a, y):
return a + y | Returns the sum of a and y |
def contains_digit_9960(i):
for ch in i:
if ch.isdigit():
return True
return False | Checks if the string i contains any digit |
def is_palindrome_9961(t):
t = t.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string t is a palindrome |
def contains_digit_9962(d):
for ch in d:
if ch.isdigit():
return True
return False | Checks if the string d contains any digit |
def reverse_9963(i):
return i[::-1] | Reverses the string i |
def add_9964(l, p):
return l + p | Returns the sum of l and p |
def contains_digit_9965(p):
for ch in p:
if ch.isdigit():
return True
return False | Checks if the string p contains any digit |
def contains_digit_9966(c):
for ch in c:
if ch.isdigit():
return True
return False | Checks if the string c contains any digit |
def reverse_9967(b):
return b[::-1] | Reverses the string b |
def sum_list_9968(l):
total = 0
for x in l:
total += x
return total | Returns the sum of elements in the list l |
def is_palindrome_9969(m):
t = m.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string m is a palindrome |
def is_palindrome_9970(a):
t = a.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string a is a palindrome |
def reverse_9971(l):
return l[::-1] | Reverses the string l |
def is_palindrome_9972(e):
t = e.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string e is a palindrome |
def reverse_9973(y):
return y[::-1] | Reverses the string y |
def reverse_9974(n):
return n[::-1] | Reverses the string n |
def reverse_9975(t):
return t[::-1] | Reverses the string t |
def is_palindrome_9976(t):
t = t.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string t is a palindrome |
def reverse_9977(q):
return q[::-1] | Reverses the string q |
def reverse_9978(x):
return x[::-1] | Reverses the string x |
def sum_list_9979(p):
total = 0
for x in p:
total += x
return total | Returns the sum of elements in the list p |
def sum_list_9980(u):
total = 0
for x in u:
total += x
return total | Returns the sum of elements in the list u |
def add_9981(d, q):
return d + q | Returns the sum of d and q |
def is_palindrome_9982(n):
t = n.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string n is a palindrome |
def is_palindrome_9983(t):
t = t.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string t is a palindrome |
def sum_list_9984(a):
total = 0
for x in a:
total += x
return total | Returns the sum of elements in the list a |
def contains_digit_9985(w):
for ch in w:
if ch.isdigit():
return True
return False | Checks if the string w contains any digit |
def contains_digit_9986(r):
for ch in r:
if ch.isdigit():
return True
return False | Checks if the string r contains any digit |
def sum_list_9987(x):
total = 0
for x in x:
total += x
return total | Returns the sum of elements in the list x |
def add_9988(w, h):
return w + h | Returns the sum of w and h |
def sum_list_9989(y):
total = 0
for x in y:
total += x
return total | Returns the sum of elements in the list y |
def contains_digit_9990(i):
for ch in i:
if ch.isdigit():
return True
return False | Checks if the string i contains any digit |
def contains_digit_9991(w):
for ch in w:
if ch.isdigit():
return True
return False | Checks if the string w contains any digit |
def contains_digit_9992(v):
for ch in v:
if ch.isdigit():
return True
return False | Checks if the string v contains any digit |
def is_palindrome_9993(b):
t = b.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string b is a palindrome |
def is_palindrome_9994(z):
t = z.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string z is a palindrome |
def is_palindrome_9995(u):
t = u.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string u is a palindrome |
def add_9996(p, b):
return p + b | Returns the sum of p and b |
def contains_digit_9997(x):
for ch in x:
if ch.isdigit():
return True
return False | Checks if the string x contains any digit |
def sum_list_9998(s):
total = 0
for x in s:
total += x
return total | Returns the sum of elements in the list s |
def is_palindrome_9999(w):
t = w.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string w is a palindrome |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.