wordsearch.js

//paired programming LHL May 25 Cohrt Rob W and Rubin J
const wordSearch = (letters, word) => {
    if (letters.length === 0) {
        return undefined;
    }

  for (let i = 0; i < letters[0].length; i++) {
    let result = '';
    for (const arr of letters) {
        if (typeof arr[i] !== 'string') {
            return undefined;
        }
        result += arr[i];
        if (result.includes(word)) {
            return true;
        }
    }
    }

 
    const horizontalJoin = letters.map(ls => ls.join(''))
    console.log("wordSearch -> horizontalJoin", horizontalJoin)
    //  
    for (l of horizontalJoin) {
        if (l.includes(word)) {
            return true;
        } 
    } return false;

    j
    
}; 

module.exports = wordSearch