Repository metrics
- Stars
- (2 stars)
- PR merge metrics
- (PR metrics pending)
Description
Problem: You are provided with a string word and a non-negative integer k. Your objective is to determine how many substrings of that word exist that contain all five vowels ('a', 'e', 'i', 'o', and 'u') at least once in any order and exactly k consonants.
Return the count of total number of substrings that satisfy this condition (Question)
-
Follow and Read the Contributing Guidelines.
-
Only the assigned person is allowed to raise the PR on this Issue.
-
To get this issue assigned to you comment on this issue, along with your name, branch, year and college name.
Note: Make sure to put the question under the relevant folder structure, and then make another folder having the question name and inside that folder you can write your solution in any preferred language.