Skip to content

Practice Count Substrings That Satisfy K-Constraint I

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Easy#3258
LeetCode Problem

Count Substrings That Satisfy K-Constraint I

Problem Statement

Given a binary string s and k, count nonempty substrings satisfying at least one of these conditions: the substring contains at most k zeroes, or it contains at most k ones.

Source: Count Substrings That Satisfy K-Constraint I on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
s = "10101", k = 1
Output
12

# Example 2

Input
s = "1010101", k = 2
Output
25

# Example 3

Input
s = "11111", k = 1
Output
15

Constraints

1 <= s.length <= 50
1 <= k <= s.length
s[i] is either '0' or '1'.

Related LeetCode Problems

Practice more problems similar to Count Substrings That Satisfy K-Constraint I.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.