Caesar cipher decryption
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) → strExamples
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.
0:00 of about 12 min
solution.py
InputExpectedGot
["KHOOR",3]"HELLO"not run yetsample