Consonants Count in Sliding Window

PKJ

 Coding Problem Keys 

 Consonants Count in Sliding Window 

 Problem Statement 

The program must accept an integer K and a string S containing only alphabets as the input. The program must print the count of consonants in each sliding window of size K in the string S as the output.

 Input Format 

The first line contains K.
The second line contains S.

 Output Format 

The first line contains the count of consonants in each sliding window of size K in the string S.

 Example Input/Output 1 

 Input 

3
pineapple

 Output 

2 1 1 1 2 3 2

 Explanation 

The sliding window size K = 3.
1st window is pin -> 2 consonants
2nd window is ine -> 1 consonants
3rd window is nea -> 1 consonants
4th window is eap -> 1 consonants
5th window is app -> 2 consonants
6th window is ppl -> 3 consonants
7th window is ple -> 2 consonants

 Example Input/Output 2 

 Input 

2
PROGRAMMING

 Output 

2 1 1 2 1 1 2 1 1 2

 Max Execution Time Limit: 10 millisecs 

 Solution 

 Programming Language: C Language 

#include <stdio.h>
#include <stdlib.h>

int isConsonant(char ch){
    ch=tolower(ch);
    if(ch=='a'||ch=='e'||ch=='i'||ch=='o'||ch=='u')
        return 0;
    else
        return 1;
}

int main() {
    int k,count=0;
    scanf("%d",&k);
    char str[100001];
    scanf("%s",str);
    for(int index=0;index<k;index++){
        if(isConsonant(str[index])){
            count++;
        }
    }
    printf("%d ",count);
    for(int index=1;index<=strlen(str)-k;index++){
        if(isConsonant(str[index-1])){
            count--;
        }
        if(isConsonant(str[index+k-1])){
            count++;
        }
        printf("%d ",count);
    }
}

// Published By PKJCODERS

 (Note: Incase If the code doesn't Pass the output kindly comment us with your feedback to help us improvise.) 

Comments

Post a Comment

Popular Posts

Vaccine Distribution

PKJ
 Coding Problem Keys   Vaccine Distribution    Problem Statement  There is a large manufacturer of vaccine which produces M types of vaccines (whose formulas are derived from different pharma brands). The manufacturer needs to divide all the vaccines between N dealers. It is acceptable if some dealers do not get any vaccine. However, no dealer wants vaccine of different kinds which means that all vaccines that a dealer gets need to be of the same type. The manufacturer also knows that dealers will be jealous if a dealer gets too many vaccines. As an approximation, the jealousy level among the dealers is defined as the largest number of vaccines given to any dealer.  Task  Help the manufacturer to divide all the vaccines among the dealers such that the jealousy level is minimized.  Example  Assumptions N = 5 M = 2 arr = [7, 4]  Approach  There are 7 vaccines of 1st type and 4 vaccines of 2nd type. Let the two types be defined by...
Click to Continue...

Highly Profitable Months

PKJ
 Coding Problem Keys   Highly Profitable Months   Problem Statement  The stocks of a company are being surveyed to analyse the net profit of the company over a period of several months. For an analysis parameter k, a group of k consecutive months is said to be highly profitable if the values of the stock prices are strictly increasing for those months. Given the stock prices of the company for n months and the analysis parameter k, find the number of highly profitable months  Example  Let the number of months be n = 8, the stock prices be stockPrices = [5, 3, 5, 7, 8] and the analysis parameter be k = 3. Following are the groups of k months in which the stock prices are strictly increasing: Hence the answer is 2.  Function Description  Complete the function countHighlyProfitableMonths in the editor below. countHighlyProfitableMonths has the following parameters:     int stockPrices[n]: the stock prices for n months.   ...
Click to Continue...

Desktop Products

PKJ
 Coding Problem Keys   Desktop Products   Problem Statement  A company DigiComparts manufactures 52 types of unique products for laptop and desktop computers. It manufactures 10 types of laptop products and 42 types of desktop products. Each product manufactured by the company has a unique productID from a-z and and A-Z. The laptop products have productIDs (a, i, e, o, u, A, I, E, O, U) while the rest of the productIDs are assigned to the desktop products. The company manager wishes to find the sales data for the desktop products. Given a list of productIDs of the sales of the last N products, write an algorithm to help the manager find the productIDs of the desktop products.  Input Format  The first line of the input consists of an integer numOfProducts, representing the number of products to be considered in the sales data (N). The second line consists of N space-separated characters - productID 1 , productID 2 , ... , productID N  represen...
Click to Continue...

Largest Integer

PKJ
 Coding Problem Keys   Largest Integer    Problem Statement  An array of N integers is read from a file. The file name is stored in the variable fileName. Fill in the missing lines of code to print the largest of N integers.  Boundary Condition(s)  1 <= N <= 1000  Input File Format  The first line contains N. The second line contains N integers separated by space(s).  Output File Format The first line contains an integer.  Example Input/Output 1   Input  5 21 56 23 89 64  Output  89  Example Input/Output 2   Input  6 102 456 28 10 23 666  Output  666  Note:  Max Execution Time Limit: 5000 millisecs  ...
Click to Continue...

String Rotation Odd and Even Positions

PKJ
 Coding Problem Keys   String Rotation Odd and Even Positions   Problem Statement  A string S and two integers M and N are passed as input. The program must rotate the characters present in the odd positions of the string M times and rotate characters present in the even positions of the string N times.  Boundary Condition(s)  2 <= Length of the string <= 1000. 1 <= M, N <= 1000.  Input Format  The first line contains the values of S, M and N separated by space(s).  Output Format  The first line contains the rotated string.  Example Input/Output 1   Input  technology 2 3  Output  logotycenh  Explanation  The characters present in the odd positions are 'tcnlg'. When rotated 2 positions, the value is 'lgtcn'. The characters present in the even position are 'ehooy', When rotated 3 positions, the value is 'ooyeh'. Hence the rotated string value is 'logotycenh'.  Example Input...
Click to Continue...

Flowchart Logic 047

PKJ
 Coding Problem Keys   Flowchart Logic 047   Problem Statement  Please fill in the lines of code to implement the logic present in the flowchart.  Example Input/Output 1   Input  18 4 10  Output  1 2 11 13 14 16 17  Note: Max Execution Time Limit: 50 millisecs   Solution   Programming Language: Python 3 Language  N,X,Y= map ( int , input ().split()) ctr= 1 while (ctr<=N): if ((ctr<X or ctr>Y) and ctr% 3 != 0 ): print (ctr,end= " " ) ctr+= 1 # Published By PKJCODERS  Programming Language: C Language  #include <stdio.h> #include <stdlib.h> int main () { int N,X,Y; scanf( "%d%d%d" ,&N,&X,&Y); int ctr= 1 ; while (ctr<=N){ if ((ctr<X || ctr>Y) && ctr% 3 != 0 ){ printf( "%d " ,ctr); } ctr++; } } // Published By PKJCODERS  ( Note:  Inca...
Click to Continue...

Words Starting with Upper Case

PKJ
 Coding Problem Keys    Words Starting with Upper Case    Problem Statement  The program must accept a string S containing multiple words as the input. The program must print the words starting with an upper case alphabet in S as the output. If there is no such word, the program must print -1 as the output.  Input Format  The first line contains N. The second line contains N integers separated by a space.  Output Format  The first line contains the integer value(s) based on the given conditions.  Boundary Condition(s)  3 <= Length of S < 100  Example Input/Output 1   Input  How are you? I am FINE   Output  How I FINE  Explanation  The words starting with an upper case alphabets are How , I and FINE . Hence the output is How I FINE.  Example Input/Output 2   Input  Cricket Match 1: India vs Pakistan   Output  Cricket Match India Pakistan  Example...
Click to Continue...