title: Minimum Sum Subsequence Least One Every Four Consecutive Elements Picked 1
signature: minimumSumSubsequenceLeastOneEveryFourConsecutiveElementsPicked1 :: [Integer] -> Integer -> Integer
  minimumSumSubsequenceLeastOneEveryFourConsecutiveElementsPicked1 ar n = 
test_code: import Text.Printf
  import Control.Exception (catch, SomeException)
  import Data.Typeable
  import qualified Data.List as List
  import qualified Data.Map as Map
  import qualified Data.Set as Set
  
  -- SOLUTION CODE
  -- ============================================
  
  PLACEHOLDER_CODE_BODY
  
  -- TESTING CODE 
  -- ============================================
  validateSolution :: Integer -> Integer -> Bool
  validateSolution actual expected = do
      actual == expected
  
  
  driver :: [Integer] -> Integer -> Integer -> String
  driver ar n expected = do
      if (validateSolution (PLACEHOLDER_FN_NAME ar n) expected)
          then "PASSED"
      else "FAILED"
  
  main = do
      printf "TEST-0...%s\n" (driver ([4, 4, 9, 26, 31, 31, 33, 35, 40, 45, 48, 52, 57, 60, 69, 75, 82, 89, 90, 92, 95, 97]) (19) (188) )
  
      printf "TEST-1...%s\n" (driver ([60, -68, 30, -62, -8, 48, -20, 30, 16, -60, -20]) (5) (-76) )
  
      printf "TEST-2...%s\n" (driver ([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]) (43) (6) )
  
      printf "TEST-3...%s\n" (driver ([15, 70, 50, 28, 67, 11, 27, 42, 1, 61, 37, 8, 66, 54, 50, 91, 86, 57, 4]) (15) (48) )
  
      printf "TEST-4...%s\n" (driver ([-98, -92, -84, -80, -70, -58, -58, -48, -42, -14, -8, 24, 30, 32, 42, 62, 68, 70, 72, 88]) (16) (-366) )
  
      printf "TEST-5...%s\n" (driver ([1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0]) (7) (1) )
  
      printf "TEST-6...%s\n" (driver ([4, 5, 5, 10, 12, 13, 16, 19, 19, 21, 22, 25, 26, 29, 30, 33, 34, 44, 46, 52, 55, 55, 56, 78, 86, 88, 88, 90, 92]) (16) (61) )
  
      printf "TEST-7...%s\n" (driver ([40, -50, -96, 78, 82, -16, 26, 8, 38, 38, 54, -24, 88, 96, -42, -84, -28, -32, -64, 74, 74, -10, -8, 66, 14, -78, 56, -22, -90, 66, -68]) (26) (-474) )
  
      printf "TEST-8...%s\n" (driver ([0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1]) (7) (0) )
  
      printf "TEST-9...%s\n" (driver ([29, 38, 20, 25, 16, 97, 16, 90, 30, 99]) (9) (36) )
  
source_py: def minimum_sum_subsequence_least_one_every_four_consecutive_elements_picked_1(ar, n):
      if (n <= 4):
          return min(ar)
      sum = [0 for i in range(n)]
      sum[0] = ar[0]
      sum[1] = ar[1]
      sum[2] = ar[2]
      sum[3] = ar[3]
      for i in range(4, n):
          sum[i] = (ar[i] + min(sum[(i - 4):i]))
      return min(sum[(n - 4):n])
source_cpp: int minimum_sum_subsequence_least_one_every_four_consecutive_elements_picked_1(vector<int> ar, int n) {
    if ( n <= 4 ) return * min_element(ar.begin(), ar.end());
    int sum [ n ];
    sum [ 0 ] = ar [ 0 ];
    sum [ 1 ] = ar [ 1 ];
    sum [ 2 ] = ar [ 2 ];
    sum [ 3 ] = ar [ 3 ];
    for ( int i = 4;
    i < n;
    i ++ ) sum [ i ] = ar [ i ] + ( * min_element ( sum + i - 4, sum + i ) );
    return * min_element ( sum + n - 4, sum + n );
  }