Spoiler
Scroll to see replies
Spoiler
Spoiler
Spoiler
Spoiler
Spoiler
Spoiler
Spoiler
def pattern_sum(k, m):
return sum([int(str(k) * a) for a in range(1, m + 1)])
def unique_common(a, b):
return sorted(list(set(a).intersection(set(b)))) or None
def case_insensitive_palindrome(s):
return s.lower() == s.lower()[::-1]
def strip_whitespace(s):
return reduce(lambda x, y: x + y, [x])
def count_first_letter(s, c):
return len([word for word in s.split(' ') if word[0] == c])
.def cons(str1):
str1 = str1.replace(" ", "").lower()
print str1
a = ["a", "e", "i", "o", "u"]
count = 0
for i in str1:
if i in a:
continue
count += 1
return count
Spoiler
Spoiler
Spoiler
Spoiler
Spoiler
Spoiler