ladderLength = function(beginWord, endWord, wordList) {
    const [ queue, wordSet, seen ] = [ new Queue([[ beginWord, 1 ]]), new Set(wordList), new Set([ beginWord ]) ];

    return bfs(queue, wordSet, seen, endWord);/* Time O(ROWS * COLS) | Space O(ROWS * COLS) */
}
https://leetcode.com/problems/word-ladder/
Time O(ROWS * COLS) | Space O(ROWS * COLS)
@param {string} beginWord
@param {string} endWord
@param {string[]} wordList
@return {number}