TheRealSamuel/LeetCodeProblem

1{2    "id": 3267,3    "name": "find_longest_special_substring_that_occurs_thrice_i",4    "difficulty": "Medium",5    "link": "https://leetcode.com/problems/find-longest-special-substring-that-occurs-thrice-i/",6    "date": "2023-12-24 00:00:00",7    "task_description": "You are given a string `s` that consists of lowercase English letters. A string is called **special** if it is made up of only a single character. For example, the string `\"abc\"` is not special, whereas the strings `\"ddd\"`, `\"zz\"`, and `\"f\"` are special. Return _the length of the **longest special substring** of _`s` _which occurs **at least thrice**_, _or _`-1`_ if no special substring occurs at least thrice_. A **substring** is a contiguous **non-empty** sequence of characters within a string. **Example 1:** ``` **Input:** s = \"aaaa\" **Output:** 2 **Explanation:** The longest special substring which occurs thrice is \"aa\": substrings \"**aa**aa\", \"a**aa**a\", and \"aa**aa**\". It can be shown that the maximum length achievable is 2. ``` **Example 2:** ``` **Input:** s = \"abcdef\" **Output:** -1 **Explanation:** There exists no special substring which occurs at least thrice. Hence return -1. ``` **Example 3:** ``` **Input:** s = \"abcaba\" **Output:** 1 **Explanation:** The longest special substring which occurs thrice is \"a\": substrings \"**a**bcaba\", \"abc**a**ba\", and \"abcab**a**\". It can be shown that the maximum length achievable is 1. ``` **Constraints:** `3 <= s.length <= 50` `s` consists of only lowercase English letters.",8    "public_test_cases": [9        {10            "label": "Example 1",11            "input": "s = \"aaaa\"",12            "output": "2 "13        },14        {15            "label": "Example 2",16            "input": "s = \"abcdef\"",17            "output": "-1 "18        },19        {20            "label": "Example 3",21            "input": "s = \"abcaba\"",22            "output": "1 "23        }24    ],25    "private_test_cases": [26        {27            "input": "rtvqrqplwqwhohb",28            "output": 129        },30        {31            "input": "xuahwjpnrhthxtrnysnrgpjvpailaipvldkwrxoggnbnbr",32            "output": 133        },34        {35            "input": "jzbdb",36            "output": -137        },38        {39            "input": "tsfqnlfjvbbxjsczxlpgnmtcmqqclovkwmgthrzujhp",40            "output": 141        },42        {43            "input": "qjolfyfhzktymvstcyt",44            "output": 145        },46        {47            "input": "ikrgjmmumyvfhlbfucjxr",48            "output": 149        },50        {51            "input": "nwdqygkwdfaixpmcgmuqbebgmygvesmswwpohkhgajyg",52            "output": 153        },54        {55            "input": "jlvbfyumquwudcwiubdrsenzbiztcinqprkenrcnqpypatowg",56            "output": 157        },58        {59            "input": "uxvrfcrdlotkahfdfqphk",60            "output": 161        },62        {63            "input": "senqeulwarfewyfbncmsfpfj",64            "output": 165        }66    ],67    "haskell_template": "maximumLength :: String -> Int\nmaximumLength s ",68    "ocaml_template": "let maximumLength (s: string) : int =  ",69    "scala_template": "def maximumLength(s: String): Int = { \n    \n}",70    "java_template": "class Solution {\n    public int maximumLength(String s) {\n        \n    }\n}",71    "python_template": "class Solution(object):\n    def maximumLength(self, s):\n        \"\"\"\n        :type s: str\n        :rtype: int\n        \"\"\"\n        "72}