code stringlengths 33 110 | docstring stringclasses 738
values |
|---|---|
def sum_list_1900(t):
total = 0
for x in t:
total += x
return total | Returns the sum of elements in the list t |
def add_1901(o, n):
return o + n | Returns the sum of o and n |
def add_1902(p, t):
return p + t | Returns the sum of p and t |
def add_1903(n, m):
return n + m | Returns the sum of n and m |
def sum_list_1904(i):
total = 0
for x in i:
total += x
return total | Returns the sum of elements in the list i |
def sum_list_1905(b):
total = 0
for x in b:
total += x
return total | Returns the sum of elements in the list b |
def add_1906(z, e):
return z + e | Returns the sum of z and e |
def reverse_1907(a):
return a[::-1] | Reverses the string a |
def reverse_1908(n):
return n[::-1] | Reverses the string n |
def contains_digit_1909(v):
for ch in v:
if ch.isdigit():
return True
return False | Checks if the string v contains any digit |
def add_1910(k, c):
return k + c | Returns the sum of k and c |
def reverse_1911(w):
return w[::-1] | Reverses the string w |
def add_1912(v, b):
return v + b | Returns the sum of v and b |
def sum_list_1913(a):
total = 0
for x in a:
total += x
return total | Returns the sum of elements in the list a |
def sum_list_1914(d):
total = 0
for x in d:
total += x
return total | Returns the sum of elements in the list d |
def reverse_1915(i):
return i[::-1] | Reverses the string i |
def is_palindrome_1916(i):
t = i.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string i is a palindrome |
def is_palindrome_1917(v):
t = v.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string v is a palindrome |
def is_palindrome_1918(o):
t = o.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string o is a palindrome |
def reverse_1919(e):
return e[::-1] | Reverses the string e |
def sum_list_1920(z):
total = 0
for x in z:
total += x
return total | Returns the sum of elements in the list z |
def reverse_1921(b):
return b[::-1] | Reverses the string b |
def is_palindrome_1922(y):
t = y.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string y is a palindrome |
def is_palindrome_1923(l):
t = l.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string l is a palindrome |
def add_1924(g, t):
return g + t | Returns the sum of g and t |
def reverse_1925(g):
return g[::-1] | Reverses the string g |
def reverse_1926(b):
return b[::-1] | Reverses the string b |
def reverse_1927(n):
return n[::-1] | Reverses the string n |
def is_palindrome_1928(n):
t = n.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string n is a palindrome |
def add_1929(z, r):
return z + r | Returns the sum of z and r |
def add_1930(t, k):
return t + k | Returns the sum of t and k |
def reverse_1931(g):
return g[::-1] | Reverses the string g |
def is_palindrome_1932(k):
t = k.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string k is a palindrome |
def contains_digit_1933(x):
for ch in x:
if ch.isdigit():
return True
return False | Checks if the string x contains any digit |
def is_palindrome_1934(o):
t = o.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string o is a palindrome |
def sum_list_1935(j):
total = 0
for x in j:
total += x
return total | Returns the sum of elements in the list j |
def reverse_1936(m):
return m[::-1] | Reverses the string m |
def contains_digit_1937(t):
for ch in t:
if ch.isdigit():
return True
return False | Checks if the string t contains any digit |
def add_1938(x, w):
return x + w | Returns the sum of x and w |
def is_palindrome_1939(n):
t = n.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string n is a palindrome |
def add_1940(d, k):
return d + k | Returns the sum of d and k |
def add_1941(l, z):
return l + z | Returns the sum of l and z |
def add_1942(o, x):
return o + x | Returns the sum of o and x |
def add_1943(q, r):
return q + r | Returns the sum of q and r |
def reverse_1944(l):
return l[::-1] | Reverses the string l |
def add_1945(r, z):
return r + z | Returns the sum of r and z |
def contains_digit_1946(f):
for ch in f:
if ch.isdigit():
return True
return False | Checks if the string f contains any digit |
def add_1947(f, y):
return f + y | Returns the sum of f and y |
def add_1948(u, k):
return u + k | Returns the sum of u and k |
def reverse_1949(d):
return d[::-1] | Reverses the string d |
def add_1950(s, q):
return s + q | Returns the sum of s and q |
def is_palindrome_1951(u):
t = u.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string u is a palindrome |
def add_1952(u, g):
return u + g | Returns the sum of u and g |
def reverse_1953(w):
return w[::-1] | Reverses the string w |
def add_1954(y, l):
return y + l | Returns the sum of y and l |
def add_1955(o, n):
return o + n | Returns the sum of o and n |
def add_1956(i, d):
return i + d | Returns the sum of i and d |
def add_1957(u, j):
return u + j | Returns the sum of u and j |
def reverse_1958(z):
return z[::-1] | Reverses the string z |
def add_1959(w, r):
return w + r | Returns the sum of w and r |
def is_palindrome_1960(v):
t = v.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string v is a palindrome |
def add_1961(e, b):
return e + b | Returns the sum of e and b |
def contains_digit_1962(g):
for ch in g:
if ch.isdigit():
return True
return False | Checks if the string g contains any digit |
def is_palindrome_1963(h):
t = h.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string h is a palindrome |
def contains_digit_1964(w):
for ch in w:
if ch.isdigit():
return True
return False | Checks if the string w contains any digit |
def reverse_1965(d):
return d[::-1] | Reverses the string d |
def add_1966(s, s):
return s + s | Returns the sum of s and s |
def is_palindrome_1967(g):
t = g.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string g is a palindrome |
def contains_digit_1968(c):
for ch in c:
if ch.isdigit():
return True
return False | Checks if the string c contains any digit |
def sum_list_1969(p):
total = 0
for x in p:
total += x
return total | Returns the sum of elements in the list p |
def is_palindrome_1970(t):
t = t.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string t is a palindrome |
def contains_digit_1971(n):
for ch in n:
if ch.isdigit():
return True
return False | Checks if the string n contains any digit |
def reverse_1972(w):
return w[::-1] | Reverses the string w |
def is_palindrome_1973(a):
t = a.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string a is a palindrome |
def reverse_1974(n):
return n[::-1] | Reverses the string n |
def sum_list_1975(p):
total = 0
for x in p:
total += x
return total | Returns the sum of elements in the list p |
def add_1976(k, m):
return k + m | Returns the sum of k and m |
def reverse_1977(h):
return h[::-1] | Reverses the string h |
def sum_list_1978(h):
total = 0
for x in h:
total += x
return total | Returns the sum of elements in the list h |
def is_palindrome_1979(v):
t = v.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string v is a palindrome |
def is_palindrome_1980(o):
t = o.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string o is a palindrome |
def sum_list_1981(t):
total = 0
for x in t:
total += x
return total | Returns the sum of elements in the list t |
def contains_digit_1982(j):
for ch in j:
if ch.isdigit():
return True
return False | Checks if the string j contains any digit |
def reverse_1983(n):
return n[::-1] | Reverses the string n |
def reverse_1984(a):
return a[::-1] | Reverses the string a |
def add_1985(j, u):
return j + u | Returns the sum of j and u |
def add_1986(r, p):
return r + p | Returns the sum of r and p |
def is_palindrome_1987(h):
t = h.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string h is a palindrome |
def sum_list_1988(u):
total = 0
for x in u:
total += x
return total | Returns the sum of elements in the list u |
def add_1989(i, h):
return i + h | Returns the sum of i and h |
def sum_list_1990(s):
total = 0
for x in s:
total += x
return total | Returns the sum of elements in the list s |
def is_palindrome_1991(t):
t = t.lower().replace(' ', '')
return t == t[::-1] | Checks whether the string t is a palindrome |
def contains_digit_1992(l):
for ch in l:
if ch.isdigit():
return True
return False | Checks if the string l contains any digit |
def reverse_1993(h):
return h[::-1] | Reverses the string h |
def contains_digit_1994(o):
for ch in o:
if ch.isdigit():
return True
return False | Checks if the string o contains any digit |
def contains_digit_1995(c):
for ch in c:
if ch.isdigit():
return True
return False | Checks if the string c contains any digit |
def reverse_1996(s):
return s[::-1] | Reverses the string s |
def reverse_1997(l):
return l[::-1] | Reverses the string l |
def add_1998(m, t):
return m + t | Returns the sum of m and t |
def sum_list_1999(u):
total = 0
for x in u:
total += x
return total | Returns the sum of elements in the list u |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.