.

Track Occurrences of Each Special Substring:

Use a dictionary to record the frequency of each special substring.
Iterate through all possible special substrings to identify and count each one.

Determine the Longest Special Substring Meeting the Criteria:

From the dictionary, identify the longest special substring that appears at least three times.
If no such substring exists, return -1.

Code

[{"language":"Java","code":"public class Solution {\n    public int maximumLength(String s) {\n        // Dictionary to store occurrences of special substrings\n        Map<String, Integer> specialCounts = new HashMap<>();\n        int n = s.length();\n\n        for (int i = 0; i < n; i++) {\n            int j = i;\n            // Find all special substrings starting at index i\n            while (j < n && s.charAt(j) == s.charAt(i)) {\n                // Current special substring\n                String specialSub = s.substring(i, j + 1);\n                specialCounts.put(specialSub, specialCounts.getOrDefault(specialSub, 0) + 1);\n                j++;\n            }\n        }\n\n        // Find the longest special substring occurring at least thrice\n        int longestLength = -1;\n        for (Map.Entry<String, Integer> entry : specialCounts.entrySet()) {\n            if (entry.getValue() >= 3) {\n                longestLength = Math.max(longestLength, entry.getKey().length());\n            }\n        }\n\n        return longestLength;\n    }\n\n}","lang":"java","html":"<pre class=\"shiki shiki-themes github-light github-dark\" style=\"background-color:#fff;--shiki-dark-bg:#24292e;color:#24292e;--shiki-dark:#e1e4e8\" tabindex=\"0\"><code><span class=\"line\"><span style=\"color:#D73A49;--shiki-dark:#F97583\">public</span><span style=\"color:#D73A49;--shiki-dark:#F97583\"> class</span><span style=\"color:#6F42C1;--shiki-dark:#B392F0\"> Solution</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\"> {</span></span>\n<span class=\"line\"><span style=\"color:#D73A49;--shiki-dark:#F97583\">    public</span><span style=\"color:#D73A49;--shiki-dark:#F97583\"> int</span><span style=\"color:#6F42C1;--shiki-dark:#B392F0\"> maximumLength</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">(String </span><span style=\"color:#E36209;--shiki-dark:#FFAB70\">s</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">) {</span></span>\n<span class=\"line\"><span style=\"color:#6A737D;--shiki-dark:#6A737D\">        // Dictionary to store occurrences of special substrings</span></span>\n<span class=\"line\"><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">        Map&#x3C;</span><span style=\"color:#D73A49;--shiki-dark:#F97583\">String</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">, </span><span style=\"color:#D73A49;--shiki-dark:#F97583\">Integer</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\">> specialCounts </span><span style=\"color:#D73A49;--shiki-dark:#F97583\">=</span><span style=\"color:#D73A49;--shiki-dark:#F97583\"> new</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\"> HashMap&#x3C;>();</span></span>\n<span class=\"line\"><span style=\"color:#D73A49;--shiki-dark:#F97583\">        int</span><span style=\"color:#24292E;--shiki-dark:#E1E4E8\"> n </span><span style=\"color:#D73A49;--shiki-dark:#F97583\">=</span><span style=\"

Related Tags