CodingEasycod-g1391

Subject StringsLevel Entry–Mid~12 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

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) → str

Examples

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.

Learn the concepts

Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.

Run or narrate your approach, then ask the coach.