Discover all substring of a given string in O(n^2) time.

operate genSubstrings(inputString){
    debugger;
    let resultArray = [];
    // outer loop to run n occasions [n = size of string]
    for(let i = 0; i < inputString.size; i++){
        // pushing first char of string as substring
        // as we all know that every char might be substring itself too.
        resultArray.push(inputString[i]);
        // inside loop to run n - 1 occasions;
        for(let j = i + 1; j < inputString.size; j++){
            // get final substring and append the brand new subsequent char
            resultArray.push(
              resultArray[resultArray.length - 1] + inputString[j]
            );
        }
    }

    return resultArray;
}

genSubstrings("abcd");

(10) ['a', 'ab', 'abc', 'abcd', 'b', 'bc', 'bcd', 'c', 'cd', 'd']