Here is my solution in java, javascript, python, c, c++, Csharp HackerRank Super Functional Strings Solution

Here is the solution of Super Functional Strings Click Here

Here is Super functional strings problem solution in python java c++ and c programming - https://programs.programmingoneonone.com/2021/07/hackerrank-super-functional-strings-problem-solution.html

def superFunctionalStrings(s):
    sss = []
    sum_= 0
    for i in range(len(s)):
        for j in range(i+1,len(s)+1):
            if s[i:j] not in sss:
                sss.append(s[i:j])
                sum_ += (len(s[i:j])**len(set(list(s[i:j]))))%(1000000007)
    return(sum_%(1000000007))

it only passes test cases

I keep timing out on test cases 7,8,9. I compute suffix array and lcp using some piece of code I used in several others problem succesfully. so can someone look only at the function superFunctionalString and give me some insights ? https://github.com/pptacher/hackerrank/blob/master/dc3/functional.cc