# Find the String having each substring with exactly K distinct characters

Given two integers **N **and **K**. The task is to find the **string of length N**, such that each substring of length greater than equal to **K**, has exactly **K** distinct characters.

**Examples:**

Input:N=10, K=3Output :ABCABCABCAExplanation:The output string has 3 distinct characters.Input :N=20, K=7Output :ABCDEFGABCDEFGABCDEFExplanation:The output string has 7 distinct characters.

**Approach:**

To solve the problem mentioned above the main idea is to print distinct elements up to length **K**, and then repeat the same elements up to **N**.

Below is the implementation of the above approach:

## C++

`// C++ Program to Find the ` `// String having each substring ` `// with exactly K distinct characters ` `#include <bits/stdc++.h> ` `using` `namespace` `std; ` ` ` `// Function to find the ` `// required output string ` `void` `findString(` `int` `N, ` `int` `K) ` `{ ` ` ` `// Each element at index ` ` ` `// i is modulus of K ` ` ` `for` `(` `int` `i = 0; i < N; i++) { ` ` ` ` ` `cout << ` `char` `(` `'A'` `+ i % K); ` ` ` `} ` `} ` ` ` `// Driver code ` `int` `main() ` `{ ` ` ` `// initialise integers N and K ` ` ` `int` `N = 10; ` ` ` `int` `K = 3; ` ` ` ` ` `findString(N, K); ` ` ` ` ` `return` `0; ` `} ` |

*chevron_right*

*filter_none*

## Java

`// Java program to find the ` `// string having each substring ` `// with exactly K distinct characters ` `import` `java.io.*; ` ` ` `class` `GFG { ` ` ` `// Function to find the ` `// required output string ` `static` `void` `findString(` `int` `N, ` `int` `K) ` `{ ` ` ` ` ` `// Each element at index ` ` ` `// i is modulus of K ` ` ` `for` `(` `int` `i = ` `0` `; i < N; i++) ` ` ` `{ ` ` ` `System.out.print((` `char` `)(` `'A'` `+ i % K)); ` ` ` `} ` `} ` ` ` `// Driver code ` `public` `static` `void` `main(String[] args) ` `{ ` ` ` `// Initialise integers N and K ` ` ` `int` `N = ` `10` `; ` ` ` `int` `K = ` `3` `; ` ` ` `findString(N, K); ` `} ` `} ` ` ` `// This code is contributed by shivanisinghss2110` |

*chevron_right*

*filter_none*

## Python3

`# Python3 Program to Find the ` `# String having each substring ` `# with exactly K distinct characters ` ` ` `# Function to find the ` `# required output string ` `def` `findString(N, K) : ` ` ` `# Each element at index ` ` ` `# i is modulus of K ` ` ` `for` `i ` `in` `range` `(N) : ` ` ` ` ` `print` `(` `chr` `(` `ord` `(` `'A'` `) ` `+` `i ` `%` `K),end` `=` `""); ` ` ` `# Driver code ` `if` `__name__ ` `=` `=` `"__main__"` `: ` ` ` `# initialise integers N and K ` ` ` `N ` `=` `10` `; ` ` ` `K ` `=` `3` `; ` ` ` ` ` `findString(N, K); ` ` ` `# This code is contributed by AnkitRai01 ` |

*chevron_right*

*filter_none*

## C#

`// C# program to find the ` `// string having each substring ` `// with exactly K distinct characters ` `using` `System; ` ` ` `class` `GFG { ` ` ` `// Function to find the ` `// required output string ` `static` `void` `findString(` `int` `N, ` `int` `K) ` `{ ` ` ` ` ` `// Each element at index ` ` ` `// i is modulus of K ` ` ` `for` `(` `int` `i = 0; i < N; i++) ` ` ` `{ ` ` ` `Console.Write((` `char` `)(` `'A'` `+ i % K)); ` ` ` `} ` `} ` ` ` `// Driver code ` `public` `static` `void` `Main(String[] args) ` `{ ` ` ` ` ` `// Initialise integers N and K ` ` ` `int` `N = 10; ` ` ` `int` `K = 3; ` ` ` ` ` `findString(N, K); ` `} ` `} ` ` ` `// This code is contributed by 29AjayKumar ` |

*chevron_right*

*filter_none*

**Output:**

ABCABCABCA

**Time Complexity:**O(N)

Don’t stop now and take your learning to the next level. Learn all the important concepts of Data Structures and Algorithms with the help of the most trusted course: DSA Self Paced. Become industry ready at a student-friendly price.

## Recommended Posts:

- Find distinct characters in distinct substrings of a string
- Generate a string of size N whose each substring of size M has exactly K distinct characters
- Find the longest substring with k unique characters in a given string
- Find the number of strings formed using distinct characters of a given string
- Minimum length substring with exactly K distinct characters
- Count of distinct characters in a substring by given range for Q queries
- Count of ungrouped characters after dividing a string into K groups of distinct characters
- String with k distinct characters and no same characters adjacent
- Find if a given string can be represented from a substring by iterating the substring “n” times
- Longest substring of only 4's from the first N characters of the infinite string
- Searching characters and substring in a String in Java
- Convert given string so that it holds only distinct characters
- Check whether count of distinct characters in a string is Prime or not
- Contiguous subsegments of a string having distinct subsequent characters
- Print all distinct characters of a string in order (3 Methods)
- Minimum steps to delete a string by deleting substring comprising of same characters
- Length of the smallest sub-string consisting of maximum distinct characters
- Number of Positions to partition the string such that atleast m characters with same frequency are present in each substring
- Find length of longest substring with at most K normal characters
- Count ways to partition a string such that both parts have equal distinct characters

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.