def caesarCipher(s, k):
    alphabets = 'abcdefghijklmnopqrstuvwxyz'
    encrypted_str = ""
    for i in range(len(s)):
        char = s[i]
        if char.isalpha():
            next_idx = alphabets.index(char.lower()) + k
            next_letter = alphabets[next_idx % 26]
            encrypted_str += next_letter.upper() if char.isupper() else next_letter
        else:
            encrypted_str += char
    return encrypted_str

def caesar_cipher(s, k):
    # Time complexity: O(n)
    # Space complexity (ignoring input): O(n)
    new_string = ""
    for letter in s:
        if (letter.lower() <= "z") and (letter.lower() >= "a"):
            if letter == letter.lower():
                sum_a = ord("a")
            else:
                sum_a = ord("A")
            new_string += chr(
                ((ord(letter) - sum_a + k) % (ord("z") - ord("a") + 1)) + sum_a
            )
        else:
            new_string += letter

    return new_string

fn caesar_cipher(s: &str, k: i32) -> String {
    //Time complexity: O(n)
    //Space complexity (ignoring input): O(n)
    let mut new_string = String::with_capacity(s.len());
    let k = k as u8;
    for letter in s.chars() {
        if letter.is_alphabetic() {
            let sum_a = if letter.is_uppercase() { b'A' } else { b'a' };
            new_string.push(((letter as u8 - sum_a + k) % (b'z' - b'a' + 1) + sum_a) as char);
        } else {
            new_string.push(letter);
        }
    }
    new_string
}

def caesarCipher(s, k):
    # Write your code here
    rotatedString=""
    allApha="abcdefghijklmnopqrstuvwxyz"
    for string in s:
        if string.isalpha():
            newIndx = allApha.index(string.lower()) + k
            if newIndx >= 26:
                newIndx = newIndx % 26 
            newChar= allApha[newIndx].upper() if string.isupper() else allApha[newIndx]
            rotatedString+= newChar
        else:
            rotatedString += string
    return rotatedString