# Find number of substrings of length k whose sum of ASCII value of characters is divisible by k

Given a string and a number k, the task is to find the number of substrings of length k whose sum of ASCII value of characters is divisible by k.

Examples:

Input : str = “bcgabc”, k = 3
Output : 2
Substring “bcg” has sum of ASCII values 300 and “abc” has sum of ASCII values 294 which are divisible by 3.

Input : str = “adkf”, k = 3
Output : 1

## Recommended: Please try your approach on {IDE} first, before moving on to the solution.

Approach: First, we find the sum of ASCII value of characters of first substring of length k, then using sliding window technique subtract ASCII value of first character of the previous substring and add ASCII value of the current character. We will increase the counter at each step if sum is divisible by k.

Below is the implementation of above approach:

## C++

 // C++ program to find number of substrings // of length k whose sum of ASCII value of  // characters is divisible by k  #include using namespace std;    int count(string s, int k) {            // Finding length of string     int n = s.length();      int d = 0 ,i;     int count = 0 ;            for (i = 0; i

## Java

 // Java program to find number of substrings // of length k whose sum of ASCII value of  // characters is divisible by k        public class GFG{        static int count(String s, int k){            // Finding length of string     int n = s.length() ;      int d = 0 ,i;     int count = 0 ;            for (i = 0; i

## Python3

 # Python3 program to find number of substrings # of length k whose sum of ASCII value of  # characters is divisible by k     def count(s, k):            # Finding length of string     n = len(s)      d, count = 0, 0     for i in range(k):                     # finding sum of ASCII value of first          # substring         d += ord(s[i])         if (d % k == 0):             count += 1             for i in range(k, n):                                    # Using sliding window technique to                  # find sum of ASCII value of rest of                  # the substring                 prev = ord(s[i-k])                 d -= prev                 d += ord(s[i])                                    # checking if sum is divisible by k                 if (d % k == 0):                     count += 1                     return count # Driver code s = "bcgabc" k = 3 ans = count(s, k)  print(ans)

## C#

 // C# program to find number of substrings // of length k whose sum of ASCII value of  // characters is divisible by k          using System; public class GFG{         static int count(string s, int k){             // Finding length of string     int n = s.Length ;      int d = 0 ,i;     int count = 0 ;             for (i = 0; i

Output:

2

My Personal Notes arrow_drop_up

Article Tags :
Practice Tags :

1

Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.