title: Count Number Of Ways To Fill A N X 4 Grid Using 1 X 4 Tiles
signature: def countNumberOfWaysToFillANX4GridUsing1X4Tiles(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(
        61, 
        188941273L    
      )}")   
  
  
      println(s"TEST-1...${driver(
        22, 
        657L    
      )}")   
  
  
      println(s"TEST-2...${driver(
        65, 
        685792227L    
      )}")   
  
  
      println(s"TEST-3...${driver(
        57, 
        52054840L    
      )}")   
  
  
      println(s"TEST-4...${driver(
        36, 
        59864L    
      )}")   
  
  
      println(s"TEST-5...${driver(
        25, 
        1728L    
      )}")   
  
  
      println(s"TEST-6...${driver(
        16, 
        95L    
      )}")   
  
  
      println(s"TEST-7...${driver(
        26, 
        2385L    
      )}")   
  
  
      println(s"TEST-8...${driver(
        92, 
        4123691589365L    
      )}")   
  
  
      println(s"TEST-9...${driver(
        5, 
        3L    
      )}")   
  
  }
  
source_py: def count_number_of_ways_to_fill_a_n_x_4_grid_using_1_x_4_tiles(n):
      dp = [0 for _ in range((n + 1))]
      for i in range(1, (n + 1)):
          if (i <= 3):
              dp[i] = 1
          elif (i == 4):
              dp[i] = 2
          else:
              dp[i] = (dp[(i - 1)] + dp[(i - 4)])
      return dp[n]
source_cpp: int count_number_of_ways_to_fill_a_n_x_4_grid_using_1_x_4_tiles(int n) {
    int dp [ n + 1 ];
    dp [ 0 ] = 0;
    for ( int i = 1;
    i <= n;
    i ++ ) {
      if ( i >= 1 && i <= 3 ) dp [ i ] = 1;
      else if ( i == 4 ) dp [ i ] = 2;
      else dp [ i ] = dp [ i - 1 ] + dp [ i - 4 ];
    }
    return dp [ n ];
  }