You are viewing a single comment's thread. Return to all comments →
C++
int theLoveLetterMystery(string s) { int count{0}; for (int i = s.length() - 1; i >= s.length() / 2; i--) count += abs(s[i] - s[s.length() - 1 - i]); return count; }
Seems like cookies are disabled on this browser, please enable them to open this website
The Love-Letter Mystery
You are viewing a single comment's thread. Return to all comments →
C++