Consecutive Strings Codewars, You are given an array strarr of strings and an integer k.

Consecutive Strings Codewars, length ? acc[0] = concatStr : null; //compare string len and replace if bigger return k < n ? longestConsec(strarr. . length > acc[0]. My code passed all the sample tests from CodeWars but can't seem to pass the random tests. Two strings are the longest: "folingtrashy" and "abcdefuvwxyz". Here I solve the Consecutive Strings Codewars problem using Ruby and Coderpad. You are given an array strarr of strings and an integer k. I recorded this while live streaming to practice the PEDAC process that's taught at Launch School. n being You are given an array (list) strarr of strings and an integer k. You are given an array (list) 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. longest_consec(strarr, 2) should return "folingtrashy". concatStr. slice(1), k, acc) : //recursive call while len of arr bigger than k instead, if these are the words length: [6, 1, 9, 2, 6, 6] and you have a k equal to 2 you need to return those two words with length 6+6 = 12, as that is the longest string you can do with two My task is to return the first longest string consisting of k consecutive strings taken in the array. jsiqo, e1yd, r7qe, tlp, gud, n37xjf, 3p5, mpmj, xbr, ats, vpmjfk, 39gp, 8wm, tp1bzszg, rha, uazxr, 8a7e, jqe, pbrbdtpn, oodekmx, nlazu, oxk43eb0, uk3rp, 8s0k, uzpyiap, hlz9, lqkgr0, gel8fe, 7ed, b27sf9q,