title: Count Number Of Ways To Fill A N X 4 Grid Using 1 X 4 Tiles
signature: fun countNumberOfWaysToFillANX4GridUsing1X4Tiles(n: Int): Long {
test_code: package main
  
  import kotlin.text.*
  import kotlin.math.*
  
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  fun validateSolution(actual:Long, expected:Long):Boolean{
    return actual.equals(expected)
  }
  fun driver(n: Int, expected:Long):String {
      try{
        if (validateSolution(PLACEHOLDER_FN_NAME(n), expected)) {
                return "PASSED"
        }
        return "FAILED"
      } catch (e: Exception){
        return e::class.simpleName as String
      }
  
  }
  
  fun main() {
      var result: String = ""
      result = driver(61, 188941273)
      println("TEST-0...${result}")
      
      result = driver(22, 657)
      println("TEST-1...${result}")
      
      result = driver(65, 685792227)
      println("TEST-2...${result}")
      
      result = driver(57, 52054840)
      println("TEST-3...${result}")
      
      result = driver(36, 59864)
      println("TEST-4...${result}")
      
      result = driver(25, 1728)
      println("TEST-5...${result}")
      
      result = driver(16, 95)
      println("TEST-6...${result}")
      
      result = driver(26, 2385)
      println("TEST-7...${result}")
      
      result = driver(92, 4123691589365)
      println("TEST-8...${result}")
      
      result = driver(5, 3)
      println("TEST-9...${result}")
      
          
  }
  
  main()
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 ];
  }