How to do the same but with recursion?

Question

JavaScript

There is a code that returns an array of all possible combinations of 3 letters. Those. ['aaa', 'aab', 'aac', ..., 'zzy', 'zzz']

function getWords() {
    let arr = [];
    for (let i=0; i<26; i++) {
        let str = String.fromCharCode(97+i);
        for (let i=0; i<26; i++) {
            let str2 = str + String.fromCharCode(97+i);
            for (let i=0; i<26; i++) {
                arr.push(str2 + String.fromCharCode(97+i));
            }
        }
    }
    return arr
}

You need to make a getWords(size) format function that will return all possible combinations depending on the specified size. Naturally, you can’t do this with cycles, you need recursion.
Please help me write an algorithm for this function.

Answer 1

codereview.stackexchange.com/questions/7001/genera...