count-substrings-with-k-frequency-characters-i

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

Given a string <code>s</code> and an integer <code>k</code>, return the total number of substrings of <code>s</code> where at least one character appears at least <code>k</code> times.

&nbsp;
Example 1:

<div class="example-block">
Input: s = &quot;abacb&quot;, k = 2

Output: 4

Explanation:

The valid substrings are:

<ul>
	<li><code>&quot;aba&quot;</code> (character <code>&#39;a&#39;</code> appears 2 times).</li>
	<li><code>&quot;abac&quot;</code> (character <code>&#39;a&#39;</code> appears 2 times).</li>
	<li><code>&quot;abacb&quot;</code> (character <code>&#39;a&#39;</code> appears 2 times).</li>
	<li><code>&quot;bacb&quot;</code> (character <code>&#39;b&#39;</code> appears 2 times).</li>
</ul>
</div>

Example 2:

<div class="example-block">
Input: s = &quot;abcde&quot;, k = 1

Output: 15

Explanation:

All substrings are valid because every character appears at least once.
</div>

&nbsp;
Constraints:

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

Weekly Contest 420

weekly-contest-420

numberOfSubstrings

Staff

Count Substrings With K-Frequency Characters I

Hash Table

String

Sliding Window

Accepted

Wrong Answer

Memory Limit Exceeded

Output Limit Exceeded

Time Limit Exceeded

Runtime Error

Internal Error

Compile Error

Timeout

Restrictions Failed

cangjie

react

vanillajs

Given a string s and an integer k, return the total number of substrings of s where at least one character appears at least k times.

 

Example 1:

Input: s = "abacb", k = 2

Output: 4

Explanation:

The valid substrings are:

 * "aba" (character 'a' appears 2 times).
 * "abac" (character 'a' appears 2 times).
 * "abacb" (character 'a' appears 2 times).
 * "bacb" (character 'b' appears 2 times).

Example 2:

Input: s = "abcde", k = 1

Output: 15

Explanation:

All substrings are valid because every character appears at least once.

 

Constraints:

 * 1 <= s.length <= 3000
 * 1 <= k <= s.length
 * s consists only of lowercase English letters.