import string

def caesar(text, shift, alphabets):
	def shift_alphabet(alphabet):
	    return alphabet[shift:] + alphabet[:shift]
	
	shifted_alphabets = tuple(map(shift_alphabet, alphabets))
	final_alphabet = "".join(alphabets)
	final_shifted_alphabet = "".join(shifted_alphabets)
	table = str.maketrans(final_alphabet, final_shifted_alphabet)
	return text.translate(table)

plain_text = "Hey Skrome, welcome to CodeCatch"
print(caesar(plain_text, 8, [string.ascii_lowercase, string.ascii_uppercase, string.punctuation]))

{"output":{"name":"format_final_json_response","arguments":{"output":{}}}}

import re
_proposal_regex = r'(?:(?:(IKE|ESP):)?[\w/]+(?:/NO_EXT_SEQ)?(?:, ?(IKE|ESP):[\w/]+(?:/NO_EXT_SEQ)?)*)?'
_proposals_re = rf'(?P<proposals>{_proposal_regex}|)'
pattern = rf'received proposals: {_proposals_re}'
match = re.match(pattern, 'received proposals: ')
print(match.group('proposals') if match else "No match")  # Prints "No match"

#You are given a two-digit integer n. Return the sum of its digits.
#Example
#For n = 29 the output should be solution (n) = 11
def solution(n):
    return (n//10 + n%10)

primes=[]
products=[]

def prime(num):
    if num > 1:
        for i in range(2,num):
            if (num % i) == 0:
                return False
        else:
            primes.append(num)
            return True

for n in range(30,1000):
    if len(primes) >= 20:
        break;
    else:
        prime(n)

for previous, current in zip(primes[::2], primes[1::2]):
    products.append(previous * current)
    
print (products)

def clamp_number(num, a, b):
  return max(min(num, max(a, b)), min(a, b))
  
clamp_number(2, 3, 5) # 3
clamp_number(1, -1, -5) # -1