You are given an array strarr of strings and an integer k. Your task is to return the first longest string consisting of k consecutive strings taken in the array.

consecutive_strings.ex

defmodule Longestconsec do
  
  def longest_consec(strarr, k) 
    when length(strarr) == 0 
    when k > length(strarr) 
    when k <= 0, 
    do: ""

  def longest_consec(strarr, k) do
    Enum.chunk_every(strarr, k, 1)
    |> Enum.map(&Enum.join/1)
    |> Enum.max_by(&String.length/1)
  end  
  
end