def add_numbers(a, b):
return a + b
def is_even(n):
return n % 2 == 0
def reverse_string(s):
return s[::-1]
def factorial(n):
if n == 0 or n == 1:
return 1
else:
result = 1
for i in range(2, n + 1):
result *= i
return result
def find_max(numbers):
n = sorted(numbers)
return n[-1]
def count_vowels(s):
vowels = "aeiouAEIOU"
count = 0
for char in s:
if char in vowels:
count += 1
return count
def is_palindrome(s):
s = s.lower().replace(" ", "")
return s == s[::-1]
def remove_duplicates(numbers):
result = []
for num in numbers:
if num not in result:
result.append(num)
return result
def sum_of_squares(n):
return sum(i ** 2 for i in range(1, n + 1))
def find_second_largest(numbers):
m = sorted(numbers)
return m[-2]
def merge_sorted_lists(list1, list2):
list3 = list1 + list2
return sorted(list3)
def is_prime(n):
for i in range(2, n):
if n % i == 0:
return False
return True
def char_frequency(s):
dict1 = {}
for w in s:
dict1[w] = s.count(w)
return dict1
def fibonacci(n):
if n == 0:
return 0
elif n == 1 or n == 2:
return 1
else:
a, b = 1, 1
for i in range(3, n + 1):
c = a + b
a, b = b, c
return b
def list_intersection(list1, list2):
return [item for item in list1 if item in list2]
def word_count(text):
import re
words = re.findall(r'\w+', text)
return len(words)
def is_valid_parentheses(s):
stack = []
parentheses_dict = {')': '(', '}': '{', ']': '['}
for char in s:
if char in '({[':
stack.append(char)
elif char in ')}]':
if not stack or stack.pop()!= parentheses_dict[char]:
return False
return not stack
