Welcome to collectivesolver - Programming & Software Q&A with code examples. A website with trusted programming answers. All programs are tested and work.

Contact: aviboots(AT)netvision.net.il

Buy a domain name - Register cheap domain names from $0.99 - Namecheap

Scalable Hosting That Grows With You

Secure & Reliable Web Hosting, Free Domain, Free SSL, 1-Click WordPress Install, Expert 24/7 Support

Semrush - keyword research tool

Boost your online presence with premium web hosting and servers

Disclosure: My content contains affiliate links.

39,922 questions

51,855 answers

573 users

How to count the number of substrings with exactly k distinct characters in C#

1 Answer

0 votes
using System;
using System.Collections.Generic;

public class Program
{
	public static int CountSubstringWithKDistinctChars(string s, int k)	{
		int count = 0;

		for (int i = 0; i < s.Length; i++) {
			char ch = s[i];
			string tmp = "" + ch;
			ISet<char> set = new HashSet<char>();
			set.Add(ch);

			for (int j = i + 1; j < s.Length; j++) {
				char next_ch = s[j];
				set.Add(next_ch);
				tmp += next_ch;
				if (tmp.Length >= k && set.Count == k) {
					count++;
				}
			}
		}
		return count;

	}
	public static void Main(string[] args)
	{
		string str = "characters";
		int k = 4;

		Console.Write("Number of substrings with exactly k distinct characters = ");
		Console.Write(CountSubstringWithKDistinctChars(str, k));
	}
}





/*
run:
 
Number of substrings with exactly k distinct characters = 9
 
*/

 



answered Sep 17, 2022 by avibootz
...