I was wondering about a solution to the Ceaser Cipher challenge that would take any range of character or just sequential numbers and shift them any number of positions under the length of the range of the sequence. Like if an alphabet has 80 characters and str.charAtCode() for each character was sequential what kind of solutions would work to shift those characters any distance passed as an argument by the main function.
Using % doesnt seem to work but I am wondering if there is something I don’t grasp about that solution that would make it work?