longest-substring-with-at-least-k-repeating-characters

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given a string <code>s</code> and an integer <code>k</code>, return the length of the longest substring of <code>s</code> such that the frequency of each character in this substring is greater than or equal to <code>k</code>.

if no such substring exists, return 0.

&nbsp;
Example 1:

<pre>
Input: s = &quot;aaabb&quot;, k = 3
Output: 3
Explanation: The longest substring is &quot;aaa&quot;, as &#39;a&#39; is repeated 3 times.
</pre>

Example 2:

<pre>
Input: s = &quot;ababbc&quot;, k = 2
Output: 5
Explanation: The longest substring is &quot;ababb&quot;, as &#39;a&#39; is repeated 2 times and &#39;b&#39; is repeated 3 times.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= s.length &lt;= 104</code></li>
	<li><code>s</code> consists of only lowercase English letters.</li>
	<li><code>1 &lt;= k &lt;= 105</code></li>
</ul>

longestSubstring

Longest Substring with At Least K Repeating Characters

Longest Subsequence Repeated k Times

longest-subsequence-repeated-k-times

重复 K 次的最长子序列

Number of Equal Count Substrings

number-of-equal-count-substrings

等计数子串的数量

Optimal Partition of String

optimal-partition-of-string

子字符串的最优划分

Length of Longest Subarray With at Most K Frequency

length-of-longest-subarray-with-at-most-k-frequency

最多 K 个重复元素的最长子数组

Find Longest Special Substring That Occurs Thrice II

find-longest-special-substring-that-occurs-thrice-ii

找出出现至少三次的最长特殊子字符串 II

Find Longest Special Substring That Occurs Thrice I

find-longest-special-substring-that-occurs-thrice-i

找出出现至少三次的最长特殊子字符串 I

Hash Table

String

Divide and Conquer

Sliding Window

给你一个字符串 <code>s</code> 和一个整数 <code>k</code> ，请你找出 <code>s</code> 中的最长子串，&nbsp;要求该子串中的每一字符出现次数都不少于 <code>k</code> 。返回这一子串的长度。

如果不存在这样的子字符串，则返回 0。

&nbsp;

示例 1：

<pre>
输入：s = "aaabb", k = 3
输出：3
解释：最长子串为 "aaa" ，其中 'a' 重复了 3 次。
</pre>

示例 2：

<pre>
输入：s = "ababbc", k = 2
输出：5
解释：最长子串为 "ababb" ，其中 'a' 重复了 2 次， 'b' 重复了 3 次。</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= s.length &lt;= 104</code></li>
	<li><code>s</code> 仅由小写英文字母组成</li>
	<li><code>1 &lt;= k &lt;= 105</code></li>
</ul>