title: Padovan Sequence
signature: def padovanSequence(n: Int) = {
test_code: import scala.collection.mutable.HashMap
  import scala.collection.immutable.HashSet
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  
  // TESTING CODE 
  // ============================================
  def validateSolution(actual: Long , expected: Long): Boolean = {
      actual.toString == expected.toString
  }
  
  def driver(n: Int, expected: Long): String = {
      try {
          if (validateSolution(PLACEHOLDER_FN_NAME(n),expected)) {
              "PASSED"
          } else{
              "FAILED"
          }
      }catch{
          case e: Exception => {e.getClass.getName}
      }
  
  }
  object QuestionEvaluator extends App {
  
      println(s"TEST-0...${driver(
        1, 
        1L    
      )}")   
  
  
      println(s"TEST-1...${driver(
        92, 
        124155792775L    
      )}")   
  
  
      println(s"TEST-2...${driver(
        29, 
        2513L    
      )}")   
  
  
      println(s"TEST-3...${driver(
        52, 
        1618192L    
      )}")   
  
  
      println(s"TEST-4...${driver(
        55, 
        3761840L    
      )}")   
  
  
      println(s"TEST-5...${driver(
        13, 
        28L    
      )}")   
  
  
      println(s"TEST-6...${driver(
        83, 
        9882257736L    
      )}")   
  
  
      println(s"TEST-7...${driver(
        83, 
        9882257736L    
      )}")   
  
  
      println(s"TEST-8...${driver(
        10, 
        12L    
      )}")   
  
  
      println(s"TEST-9...${driver(
        67, 
        109870576L    
      )}")   
  
  }
  
source_py: def padovan_sequence(n):
      (pPrevPrev, pPrev, pCurr, pNext) = (1, 1, 1, 1)
      for i in range(3, (n + 1)):
          pNext = (pPrevPrev + pPrev)
          pPrevPrev = pPrev
          pPrev = pCurr
          pCurr = pNext
      return pNext
source_cpp: int padovan_sequence(int n) {
    int pPrevPrev = 1, pPrev = 1, pCurr = 1, pNext = 1;
    for ( int i = 3;
    i <= n;
    i ++ ) {
      pNext = pPrevPrev + pPrev;
      pPrevPrev = pPrev;
      pPrev = pCurr;
      pCurr = pNext;
    }
    return pNext;
  }