Longest repeated substring in a string

Question

I have this code that gives us all the substrings of a string of my choice :

static void subString(char str[], int n) {
    
    for (int len = 1; len <= n; len++) {
       
        for (int i = 0; i <= n - len; i++) {
           
            int j = i + len - 1;
            for (int k = i; k <= j; k++) {
                System.out.print(str[k]);
            }

           System.out.println();
        }

How can I rewrite it in a way that show us the most frequent substring?

See this link: https://stackoverflow.com/questions/10355103/finding-the-longest-repeated-substring — Neto Deolino, May 05 '21 at 18:16
Basicamente, if I use the string "ovov" I get the following output : o v o v ov vo ov ovo vov ovov And now I want to know the number of times the most frequent substring is used aswell as the most used substring — Matheus Quintas, May 05 '21 at 18:18

score 0 · Accepted Answer · answered May 05 '21 at 18:27

If you just want a count of all substrings, you can do something like this

public static void main( String[] args ) {
    char[] ch = {'o','v', 'o', 'v'};
    Map<String, Integer> count = subString(ch, ch.length);

    for(var entry : count.entrySet()) {
        System.out.println(entry.getKey() + ":" + entry.getValue());
    }
}

public static Map<String, Integer> subString(char ch[], int n) {
    Map<String, Integer> count = new HashMap<>();

    for(int i = 0; i < n; i++)
        for(int j = 1; j <= n-i; j++) {
            String str = String.valueOf(ch, i, j);
            count.put(str, count.getOrDefault(str, 0)+1);
        }

    return count;
}

Longest repeated substring in a string

1 Answers1