Step-by-step solution for Caesar Cipher
View the challenge

This challenge requires you to encrypt a string by implementing a Caesar cipher shift. The program below shifts each character by N in the alphabet and then uses the modulo operation to get the number within the range of the alphabet (0...25).

You need to be a member to see the rest of this solution and code.