CodingEasycod-g1007

Subject CryptographyLevel Entry–Mid~12 minCommon in Security · Algorithms & data structures interviewsIndustries Software development

Question

Implement Caesar-cipher decryption. Given ciphertext `text` and an integer `shift`, recover the plaintext by shifting each alphabetic character BACKWARD by `shift` positions (wrapping within the alphabet), preserving case. The shift may be any non-negative integer (e.g. larger than 26). Non-alphabetic characters pass through unchanged.

Implement

caesar_decrypt(text: str, shift: int) → str

Examples

in["KHOOR",3]out"HELLO"

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.