We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Strings
  4. The Love-Letter Mystery
  5. Discussions

The Love-Letter Mystery

  • yli131
     + 6 comments

    public class Solution {

    public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int n = sc.nextInt();
    for(int ii = 0; ii < n; ii++){
        String s = sc.next();
        int count = 0;
        // use two pointers;
        int i = 0, j = s.length() - 1;
        while(i < j){
            count += Math.abs(s.charAt(i) - s.charAt(j));
            i++; j--;
        }
        System.out.println(count);
    }
}

    }