We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Strings
  4. How Many Substrings?
  5. Discussions

How Many Substrings?

  • irrfankhann29
     + 0 comments

    solution in JS:

    getting timeout error because the time complexity is O(n*m*k), help me to reduce the complexity:

    function countSubstrings(s, queries) {
    // Write your code here
    let left;
    let right;
    queries.forEach((query, index) => {
        let mainSubString = [];
        left = query[0];
        right = query[1];
        const subString = s.slice(left, right+1);
        const sstrLength = subString.length;
        for(let i=0; i<sstrLength; i++){
        for (let j = i + 1; j <= sstrLength; j++) {
            if(!mainSubString.includes(
                subString.slice(i, j))){
            mainSubString.push(subString.slice(i, j))
            }

        }
        }
        console.log(mainSubString.length)  
    })

}