LeetCode 2982: Find Longest Special Substring That Occurs Thrice II Solution

Master LeetCode problem 2982 (Find Longest Special Substring That Occurs Thrice II), a medium challenge, with our optimized solutions in Java, C++, and Python. Explore detailed explanations, test your code in our interactive editor, and prepare for coding interviews.

2982. Find Longest Special Substring That Occurs Thrice II

Medium

Hash Table String Binary Search Sliding Window Counting

Problem Explanation

Explanation

To solve this problem, we can iterate through the input string s and check each character. We maintain a count of consecutive occurrences of the current character. If this count reaches 3, we update the longest special substring length found so far. If the next character is different, we reset the count. We repeat this process until we reach the end of the string. Finally, we return the maximum special substring length found, or -1 if no special substring occurs at least thrice.

Time complexity: O(n), where n is the length of the input string s.
Space complexity: O(1), as we only use a constant amount of extra space.

Solution Code

class Solution {
    public int longestSpecialSubstring(String s) {
        int longestLength = -1;
        int count = 1;
        
        for (int i = 1; i < s.length(); i++) {
            if (s.charAt(i) == s.charAt(i - 1)) {
                count++;
                if (count == 3) {
                    longestLength = Math.max(longestLength, i - i + 1);
                }
            } else {
                count = 1;
            }
        }
        
        return longestLength;
    }
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 2982 (Find Longest Special Substring That Occurs Thrice II)?

This page provides optimized solutions for LeetCode problem 2982 (Find Longest Special Substring That Occurs Thrice II) in Java, C++, and Python, along with a detailed explanation and an interactive code editor to test your code.

What is the time complexity of LeetCode 2982 (Find Longest Special Substring That Occurs Thrice II)?

The time complexity for LeetCode 2982 (Find Longest Special Substring That Occurs Thrice II) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 2982 on DevExCode?

Yes, DevExCode provides an interactive code editor where you can write, test, and run your code for LeetCode 2982 in Java, C++, or Python.

Back to LeetCode Solutions