Stone Piles Discussions | Algorithms | HackerRank
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. Game Theory
  4. Stone Piles
  5. Discussions

Stone Piles

  • melroy_tellis
     + 2 comments

    This problem can be solved without explicitly finding the reverse of the string.

    bool is_funny(string &s)
{   
    for ( int i = 0, j = s.length() - 1 ; i <= j ;  )
    {
        if ( abs(s[i] - s[++i]) != abs(s[j] - s[--j]) )
            return false;
    }
    return true;    
}