@@ -0,0 +1,590 @@
+/**%0A * %0A */%0Apackage algorithms.strings;%0A%0Aimport java.util.Scanner;%0A%0A/**%0A * Challenge: https://www.hackerrank.com/challenges/the-love-letter-mystery%0A * %0A * @author Sudharsanan Muralidharan%0A */%0Apublic class LoveLetterMystery %7B%0A  public static void main(String%5B%5D args) %7B%0A    Scanner in = new Scanner(System.in);%0A    int t = in.nextInt();%0A    while (t-- %3E 0) %7B%0A      String s = in.next();%0A      int count = 0;%0A      for (int i = 0, j = s.length() - 1; i %3C j; i++, j--) %7B%0A        count += Math.abs(s.charAt(i) - s.charAt(j));%0A      %7D%0A      System.out.println(count);%0A    %7D%0A    in.close();%0A  %7D%0A%7D%0A

Add another easy solution