Skip to main content

Featured

C Program to Check Prime Number Using Efficient Logic

  Introduction A prime number is a number that has exactly two distinct positive divisors: 1 and itself. In this program, we check whether a given number is prime or not using a simple and efficient logic. This type of program is commonly used in mathematics, competitive programming, and basic algorithm learning for beginners in C programming. Problem Statement The task is to write a C program that determines whether a given integer is a prime number or not. The program takes a single integer input from the user and analyzes its divisibility. If the number has no divisors other than 1 and itself, it should be identified as a prime number; otherwise, it is not prime. This problem is important in number theory and has practical relevance in areas such as cryptography, data validation, and algorithm design.  Algorithm / Logic Explanation To check whether a number is prime, we need to verify that it is not divisible by any number other than 1 and itself. The algorithm follows a si...

Maximum Number of Aqua Curtains in a Box in C

Maximum Aqua Curtains in a Box

Maximum Number of Aqua Curtains in a Box

A furnishing company is manufacturing a new collection of curtains. The curtains are of two colors aqua(a) and black (b). The curtains color is represented as a string(str) consisting of a’s and b’s of length N.

Then, they are packed (substring) into L number of curtains in each box. The box with the maximum number of ‘aqua’ (a) color curtains is labeled. The task here is to find the number of ‘aqua’ color curtains in the labeled box.

Note :

If ‘L’ is not a multiple of N, the remaining number of curtains should be considered as a substring too.

Example 1:

Input :

bbbaaababa -> Value of str

3    -> Value of L

Output:

3   -> Maximum number of a’s
  

Explanation:

Dividing the string into sets of 3 characters each 

Set 1: {b,b,b}

Set 2: {a,a,a}

Set 3: {b,a,b}

Set 4: {a} -> leftover characters also as taken as another set

Among all the sets, Set 2 has more number of a’s.
The number of a’s in set 2 is 3.

Hence, the output is 3.
  

Example 2:

Input :

abbbaabbb -> Value of str

5   -> Value of L

Output:

2   -> Maximum number of a’s
  

Constraints:

1<=L<=10
1<=N<=50
  

Input Format:

First input - Accept string that contains character a and b only
Second input - Accept value for N (Positive integer)
  

#include <stdio.h>
#include <string.h>

// Function to check if a character is a vowel
int isVowel(char c)
{
    return (c == 'a' || c == 'e' || c == 'i' ||
            c == 'o' || c == 'u');
}

// LeetCode function
int maxVowels(char* s, int k)
{
    int count = 0, maxCount = 0;

    // Count vowels in the first window
    for (int i = 0; i < k && s[i] != '\0'; i++)
    {
        if (isVowel(s[i]))
            count++;
    }

    maxCount = count;

    // Sliding window
    for (int i = k; s[i] != '\0'; i++)
    {
        if (isVowel(s[i]))
            count++;

        if (isVowel(s[i - k]))
            count--;

        if (count > maxCount)
            maxCount = count;
    }

    return maxCount;
}

int main()
{
    char s[100];
    int k;

    printf("Enter the string: ");
    scanf("%s", s);

    printf("Enter the value of k: ");
    scanf("%d", &k);

    int result = maxVowels(s, k);

    printf("Maximum number of vowels in any substring of length %d is: %d\n", k, result);

    return 0;
}
  

๐Ÿ“Œ Hashtags:

#CProgramming #StringProblems #SlidingWindow #ProblemSolving #1printf

Comments

Popular Posts

๐ŸŒ™