title: Count Number Binary Strings Without Consecutive 1S
signature: countNumberBinaryStringsWithoutConsecutive1S :: Integer -> Integer
  countNumberBinaryStringsWithoutConsecutive1S 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 -> String
  driver n expected = do
      if (validateSolution (PLACEHOLDER_FN_NAME n) expected)
          then "PASSED"
      else "FAILED"
  
  main = do
      printf "TEST-0...%s\n" (driver (75) (5527939700884757) )
  
      printf "TEST-1...%s\n" (driver (14) (987) )
  
      printf "TEST-2...%s\n" (driver (5) (13) )
  
      printf "TEST-3...%s\n" (driver (41) (433494437) )
  
      printf "TEST-4...%s\n" (driver (35) (24157817) )
  
      printf "TEST-5...%s\n" (driver (30) (2178309) )
  
      printf "TEST-6...%s\n" (driver (84) (420196140727489673) )
  
      printf "TEST-7...%s\n" (driver (53) (139583862445) )
  
source_py: def count_number_binary_strings_without_consecutive_1s(n):
      a = [0 for i in range(n)]
      b = [0 for i in range(n)]
      a[0] = b[0] = 1
      for i in range(1, n):
          a[i] = (a[(i - 1)] + b[(i - 1)])
          b[i] = a[(i - 1)]
      return (a[(n - 1)] + b[(n - 1)])
source_cpp: int count_number_binary_strings_without_consecutive_1s(int n) {
    int a [ n ], b [ n ];
    a [ 0 ] = b [ 0 ] = 1;
    for ( int i = 1;
    i < n;
    i ++ ) {
      a [ i ] = a [ i - 1 ] + b [ i - 1 ];
      b [ i ] = a [ i - 1 ];
    }
    return a [ n - 1 ] + b [ n - 1 ];
  }