Caesar cipher
Implement the Caesar cipher for an internal puzzle hunt. Given a message and a shift k (0 to 25), move every letter k positions forward in the alphabet, wrapping from 'z' back to 'a' (and 'Z' to 'A'). Preserve each letter's case, and leave digits, spaces, and punctuation unchanged. For example, 'Hello, World!' shifted by 3 becomes 'Khoor, Zruog!'.
Implement
caesar(message: str, k: int) → strExamples
in
["Hello, World!",3]out"Khoor, Zruog!"What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 12 min
solution.py
InputExpectedGot
["Hello, World!",3]"Khoor, Zruog!"not run yetsample