I am trying to use the suffix array, and the LCP array to count all distinct substrings of a specified length.
I started with the algorithm for counting ALL distinct substrings. I solved it after this explanation: https://www.geeksforgeeks.org/count-distinct-substrings-string-using-suffix-array/ . The problem right now is that I can’t figure out how to only count the substrings of my given length, and not all possibilities.
I also computed the array which tells me how many suffixes are lexicographically smaller than suffix_array[i].
Any ideas what I could use to do it?