https://github.com/randhir200/substrings-with-k-distinct-letters

Given string str of lowercase alphabets of length n and an integer K, the task is to count all substrings of length K which have exactly K distinct characters.
https://github.com/randhir200/substrings-with-k-distinct-letters

Last synced: 1 day ago
JSON representation

Given string str of lowercase alphabets of length n and an integer K, the task is to count all substrings of length K which have exactly K distinct characters.

• Host: GitHub
• URL: https://github.com/randhir200/substrings-with-k-distinct-letters
• Owner: Randhir200
• Created: 2022-04-28T03:27:56.000Z (over 2 years ago)
• Default Branch: main
• Last Pushed: 2022-04-28T03:28:00.000Z (over 2 years ago)
• Last Synced: 2024-11-06T03:46:56.230Z (about 2 months ago)
• Size: 0 Bytes
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:

Awesome Lists containing this project