Caesar cipher in Java
Java interview exercise on Strings, difficulty 2 of 3. Solve it in the editor beside a worked example; the tests run the moment you do.
Write caesar(s, shift) that shifts every letter of s by shift places through the alphabet, wrapping around (z + 1 = a), keeping its case, and leaving every other character alone. shift may be negative or larger than 26.
Each exercise pairs a worked example with a twin problem to solve in a real editor; the tests run the moment you do. Progress is saved in your browser, and in your account if you sign in.