title: Even Fibonacci Numbers Sum
signature: def evenFibonacciNumbersSum(limit: Int) = {
test_code: import scala.collection.mutable.HashMap
  import scala.collection.immutable.HashSet
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  
  // TESTING CODE 
  // ============================================
  def validateSolution(actual: Int , expected: Int): Boolean = {
      actual.toString == expected.toString
  }
  
  def driver(limit: Int, expected: Int): String = {
      try {
          if (validateSolution(PLACEHOLDER_FN_NAME(limit),expected)) {
              "PASSED"
          } else{
              "FAILED"
          }
      }catch{
          case e: Exception => {e.getClass.getName}
      }
  
  }
  object QuestionEvaluator extends App {
  
      println(s"TEST-0...${driver(
        67, 
        44    
      )}")   
  
  
      println(s"TEST-1...${driver(
        89, 
        44    
      )}")   
  
  
      println(s"TEST-2...${driver(
        12, 
        10    
      )}")   
  
  
      println(s"TEST-3...${driver(
        94, 
        44    
      )}")   
  
  
      println(s"TEST-4...${driver(
        96, 
        44    
      )}")   
  
  
      println(s"TEST-5...${driver(
        25, 
        10    
      )}")   
  
  
      println(s"TEST-6...${driver(
        49, 
        44    
      )}")   
  
  
      println(s"TEST-7...${driver(
        8, 
        10    
      )}")   
  
  
      println(s"TEST-8...${driver(
        33, 
        10    
      )}")   
  
  
      println(s"TEST-9...${driver(
        59, 
        44    
      )}")   
  
  }
  
source_py: def even_fibonacci_numbers_sum(limit):
      if (limit < 2):
          return 0
      ef1 = 0
      ef2 = 2
      sm = (ef1 + ef2)
      while (ef2 <= limit):
          ef3 = ((4 * ef2) + ef1)
          if (ef3 > limit):
              break
          ef1 = ef2
          ef2 = ef3
          sm = (sm + ef2)
      return sm
source_cpp: int even_fibonacci_numbers_sum(int limit) {
    if ( limit < 2 ) return 0;
    long long int ef1 = 0, ef2 = 2;
    long long int sum = ef1 + ef2;
    while ( ef2 <= limit ) {
      long long int ef3 = 4 * ef2 + ef1;
      if ( ef3 > limit ) break;
      ef1 = ef2;
      ef2 = ef3;
      sum += ef2;
    }
    return sum;
  }