title: Perfect Reversible String
signature: bool perfectReversibleString(string str) {
test_code: #include <algorithm>
  #include <assert.h>
  #include <cstdlib>
  #include <iostream>
  #include <map>
  #include <set>
  #include <string>
  #include <tuple> 
  #include <unordered_map>
  #include <vector>
  #include <math.h>
  #include <cmath>
  #include <bits/stdc++.h>
  #include <numeric>
  #include <functional>
  
  using namespace std;
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(bool actual, bool expected){
      return actual == expected;
  }
  
  string driver(string str, bool expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(str), expected)){
              return "PASSED";
          }
          return "FAILED";
      }
      catch (const std::overflow_error& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (const std::runtime_error& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (const std::exception& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (...)
      {
          return "UNK_ERROR";
      }
  }
  
  int main() {
      string result = "";
  
      result = driver("ab", false); 
      cout << "TEST-" << 0 << "..."
           <<  result
           << "\n";
  
      result = driver("303", true); 
      cout << "TEST-" << 1 << "..."
           <<  result
           << "\n";
  
      result = driver("11110000", false); 
      cout << "TEST-" << 2 << "..."
           <<  result
           << "\n";
  
      result = driver("aba", true); 
      cout << "TEST-" << 3 << "..."
           <<  result
           << "\n";
  
      result = driver("404", true); 
      cout << "TEST-" << 4 << "..."
           <<  result
           << "\n";
  
      result = driver("10101", true); 
      cout << "TEST-" << 5 << "..."
           <<  result
           << "\n";
  
      result = driver("abab", false); 
      cout << "TEST-" << 6 << "..."
           <<  result
           << "\n";
  
      result = driver("6366", false); 
      cout << "TEST-" << 7 << "..."
           <<  result
           << "\n";
  
      result = driver("001", false); 
      cout << "TEST-" << 8 << "..."
           <<  result
           << "\n";
  
      result = driver("", true); 
      cout << "TEST-" << 9 << "..."
           <<  result
           << "\n";
  
      return 0;
  }
source_py: def perfect_reversible_string(str):
      i = 0
      j = (len(str) - 1)
      while (i < j):
          if (str[i] != str[j]):
              return False
          i += 1
          j -= 1
      return True
source_cpp: bool perfect_reversible_string(string str) {
    int i = 0, j = str . length ( ) - 1;
    while ( i < j ) {
      if ( str [ i ] != str [ j ] ) return false;
      i ++;
      j --;
    }
    return true;
  }