You are given a string S of length N and an integer K. Your task is to determine the minimum number of characters of S that need to be changed such that there exists a special substring of length K in S. For example, let N = 6, K = 4, and S = ABBCCC. In this example, we only need to change the third character of S to C (i.e. ABBCCC → ABCCCC) so that we have a special substring CCCC of length 4. Input Input begins with a line containing two integers: N K (1 ≤ K ≤ N ≤ 100 000) representing the length of the string and the length of a special substring that should be produced, respectively. The next line contains a string S containing N uppercase alphabetical character, i.e. Si ∈ [A-Z]. Output Output in a line an integer representing the minimum number of characters of S that need to be changed such that there exists a special substring of length K in the given S.

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

A substring of a string is a contiguous sequence of characters from the string. For example, BC is a substring
of ABCD which starts from the second character of ABCD. Another example, ABC is a substring of ABCD which
starts from the first character of ABCD. Note that ABCD itself is also a substring of ABCD.
In this problem, we define a special substring as a non-empty substring that contains only the same character.
For example, B and CC are special substrings of ABBCCC, while ABBC and BC are not special substrings.
You are given a string S of length N and an integer K. Your task is to determine the minimum number of
characters of S that need to be changed such that there exists a special substring of length K in S.
For example, let N = 6, K = 4, and S = ABBCCC. In this example, we only need to change the third character
of S to C (i.e. ABBCCC → ABCCCC) so that we have a special substring CCCC of length 4.
Input
Input begins with a line containing two integers: N K (1 ≤ K ≤ N ≤ 100 000) representing the length of the
string and the length of a special substring that should be produced, respectively. The next line contains a
string S containing N uppercase alphabetical character, i.e. Si ∈ [A-Z].
Output
Output in a line an integer representing the minimum number of characters of S that need to be changed
such that there exists a special substring of length K in the given S.

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 3 images

Blurred answer
Knowledge Booster
Potential Method of Analysis
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education