title: Decimal Representation Given Binary String Divisible 10 Not
signature: def decimalRepresentationGivenBinaryStringDivisible10Not(bin: String) = {
test_code: import scala.collection.mutable.HashMap
  import scala.collection.immutable.HashSet
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  
  // TESTING CODE 
  // ============================================
  def validateSolution(actual: Boolean , expected: Boolean): Boolean = {
      actual.toString == expected.toString
  }
  
  def driver(bin: String, expected: Boolean): String = {
      try {
          if (validateSolution(PLACEHOLDER_FN_NAME(bin),expected)) {
              "PASSED"
          } else{
              "FAILED"
          }
      }catch{
          case e: Exception => {e.getClass.getName}
      }
  
  }
  object QuestionEvaluator extends App {
  
      println(s"TEST-0...${driver(
        "101000", 
        true    
      )}")   
  
  
      println(s"TEST-1...${driver(
        "39613456759141", 
        false    
      )}")   
  
  
      println(s"TEST-2...${driver(
        "11", 
        false    
      )}")   
  
  
      println(s"TEST-3...${driver(
        "PoiHjo", 
        true    
      )}")   
  
  
      println(s"TEST-4...${driver(
        "2", 
        true    
      )}")   
  
  
      println(s"TEST-5...${driver(
        "0000101", 
        false    
      )}")   
  
  
      println(s"TEST-6...${driver(
        "T  s dZKeDX gK", 
        true    
      )}")   
  
  
      println(s"TEST-7...${driver(
        "3944713969", 
        false    
      )}")   
  
  
      println(s"TEST-8...${driver(
        "1000", 
        false    
      )}")   
  
  
      println(s"TEST-9...${driver(
        "ifYUgdpmt", 
        true    
      )}")   
  
  }
  
source_py: def decimal_representation_given_binary_string_divisible_10_not(bin):
      n = len(bin)
      if (bin[(n - 1)] == '1'):
          return False
      sum = 0
      i = (n - 2)
      while (i >= 0):
          if (bin[i] == '1'):
              posFromRight = ((n - i) - 1)
              if ((posFromRight % 4) == 1):
                  sum = (sum + 2)
              elif ((posFromRight % 4) == 2):
                  sum = (sum + 4)
              elif ((posFromRight % 4) == 3):
                  sum = (sum + 8)
              elif ((posFromRight % 4) == 0):
                  sum = (sum + 6)
          i = (i - 1)
      if ((sum % 10) == 0):
          return True
      return False
source_cpp: bool decimal_representation_given_binary_string_divisible_10_not(string bin) {
    int n = bin . size ( );
    if ( bin [ n - 1 ] == '1' ) return false;
    int sum = 0;
    for ( int i = n - 2;
    i >= 0;
    i -- ) {
      if ( bin [ i ] == '1' ) {
        int posFromRight = n - i - 1;
        if ( posFromRight % 4 == 1 ) sum = sum + 2;
        else if ( posFromRight % 4 == 2 ) sum = sum + 4;
        else if ( posFromRight % 4 == 3 ) sum = sum + 8;
        else if ( posFromRight % 4 == 0 ) sum = sum + 6;
      }
    }
    if ( sum % 10 == 0 ) return true;
    return false;
  }