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

  • alban_tyrex
     + 0 comments

    Here is my c++ solution to the problem, explanation here : https://youtu.be/gIUqS2xO6lg

    int theLoveLetterMystery(string s) {
    int ans = 0 , start = 0, end = s.size() - 1;
    while(start < end){
        ans += abs(s[start] - s[end]);
        start++; end--;
    }
    return ans;
}