@@ -0,0 +1,1517 @@
+package algorithm.implementation;%0D%0A%0D%0Aimport java.util.Scanner;%0D%0A%0D%0A/**%0D%0A *%0D%0A * @version $Revision$%0D%0A * @version $Date$%0D%0A * @author $Author$%0D%0A * @owner Sandro Mario Zbinden%0D%0A */%0D%0Apublic class CesarCipher %7B%0D%0A    public static class Solution %7B%0D%0A    %09%0D%0A    %09private static final char%5B%5D alphabetLower = %22abcdefghijklmnopqrstuvwxyz%22.toCharArray();%0D%0A    %09private static final char%5B%5D alphabetUpper = %22ABCDEFGHIJKLMNOPQRSTUVWXYZ%22.toCharArray();%0D%0A%0D%0A        public static String cesarCipher(String input, int rotation) %7B%0D%0A        %09StringBuilder result = new StringBuilder();%0D%0A        %09for (char c : input.toCharArray()) %7B%0D%0A        %09%09if (Character.isLetter(c) && Character.isUpperCase(c)) %7B%0D%0A        %09%09%09result.append(cesarCipher(c, alphabetUpper, rotation));%0D%0A        %09%09%7D else if (Character.isLetter(c) && Character.isLowerCase(c)) %7B%0D%0A        %09%09%09result.append(cesarCipher(c, alphabetLower, rotation));%0D%0A        %09%09%7D else %7B%0D%0A        %09%09%09result.append(c);%0D%0A        %09%09%7D%0D%0A        %09%7D%0D%0A        %09return result.toString();%0D%0A        %7D%0D%0A%0D%0A%09%09private static char cesarCipher(char character,char%5B%5D array, int rotation) %7B%0D%0A%09%09%09int index = character -array%5B0%5D ;%0D%0A%09%09%09return array%5B(index + rotation) %25 array.length%5D;%0D%0A%09%09%7D%0D%0A%0D%0A%09%09public static void main(String%5B%5D args) %7B%0D%0A            try (Scanner in = new Scanner(System.in)) %7B%0D%0A            %09in.nextInt();%0D%0A                System.out.println(cesarCipher(in.next(), in.nextInt()));%0D%0A            %7D%0D%0A        %7D%0D%0A    %7D%0D%0A%0D%0A    public static void main(String%5B%5D args) %7B%0D%0A        Solution.main(null);%0D%0A    %7D%0D%0A%7D%0D%0A

Add solution to the CesarCipher problem