We'll say that 2 strings "match" if they are non-empty and their first chars are the same. Loop over and then return the given array of non-empty strings as follows: if a string matches an earlier ...

/*Given two strings, a and b, create a bigger string made of the first char of a, the first char of b, * the second char of a, the second char of b, and so on. Any leftover chars go at the end of the ...