Skip to main content

Featured

Solve LeetCode 30 Substring with Concatenation of All Words in C++ using sliding window and frequency maps

Substring with Concatenation of All Words in C++ LeetCode 30 · sliding window · frequency maps · string_view Table of Contents Problem Statement Approach Algorithm C++ Program Input Sample Output Output Explanation Dry Run Flow of Execution Time Complexity Space Complexity Applications Key Points Interview Questions Frequently Asked Questions Conclusion Problem Statement 30. Substring with Concatenation of All Words Given a string s and an array of strings words , where every word has the same length, find all starting indices of substrings that are a concatenation of every word exactly once, in any order. Approach This solution uses a sliding window and two frequency maps. Since every word has the same length, the string is checked in chunks of len characters. freq stores the required frequency of each word. temp stores the frequencies in the current window. count tracks the number of word-sized chunks in the window. If a word occurs too ...

Double Diamond Star Pattern in C :Star, Number, Alphabet & Binary Patterns with Output

Diamond Star Pattern in C

Diamond Star Pattern in C

This program prints a diamond shaped star pattern using nested loops and conditional statements in C.

๐Ÿ” C Program Code:

#include <stdio.h>

int main() {
    int num;
    printf("Enter the number:\n");
    scanf("%d", &num);

    // Upper part of diamond
    for(int i = 0; i < num; i++) {
        for(int j = 0; j < (2 * num); j++) {
            if(i + j <= num - 1) {
                printf("*");
            } else {
                printf(" ");
            }
            if(i + num <= j) {
                printf("*");
            } else {
                printf(" ");
            }
        }
        printf("\n");
    }

    // Lower part of diamond
    for(int i = 0; i < num; i++) {
        for(int j = 0; j < (2 * num); j++) {
            if(i >= j) {
                printf("*");
            } else {
                printf(" ");
            }
            if(i >= ((2 * num) - 1) - j) {
                printf("*");
            } else {
                printf(" ");
            }
        }
        printf("\n");
    }

    return 0;
}

๐Ÿ“Œ How It Works:

  • The program takes an integer input num which controls the size of the diamond.
  • The first pair of nested loops prints the upper half of the diamond:
    • Stars are printed on the left and right edges based on the conditions i + j <= num - 1 and i + num <= j.
    • Spaces fill the middle region, creating a hollow diamond shape.
  • The second pair of nested loops prints the lower half of the diamond:
    • Stars print based on conditions i >= j and i >= (2*num - 1) - j forming the symmetrical bottom.
  • Together, these loops form a complete diamond star pattern.

๐Ÿ’ป Sample Output for num=7:

* * * * * * * * * * * * * *
* * * * * * * * * * * *
* * * * * * * * * *
* * * * * * * *
* * * * * *
* * * *
* *
* *
* * * *
* * * * * *
* * * * * * * *
* * * * * * * * * *
* * * * * * * * * * * *
* * * * * * * * * * * * * *

Double Diamond Star Pattern in C

Double Diamond Star Pattern in C

This program prints a double diamond pattern of stars using nested loops in C.

๐Ÿ” C Program Code:

#include <stdio.h>

int main() {
    int n;
    printf("Enter the number:\n");
    scanf("%d", &n);

    // Upper part of pattern
    for (int i = 0; i < n; i++) {
        // Left stars
        for (int j = 0; j < n - i; j++) {
            printf("* ");
        }
        // Spaces in middle
        for (int j = 0; j < 2 * i; j++) {
            printf("  ");
        }
        // Right stars
        for (int j = 0; j < n - i; j++) {
            printf("* ");
        }
        printf("\n");
    }

    // Lower part of pattern
    for (int i = 0; i < n; i++) {
        // Left stars
        for (int j = 0; j <= i; j++) {
            printf("* ");
        }
        // Spaces in middle
        for (int j = 0; j < 2 * (n - i - 1); j++) {
            printf("  ");
        }
        // Right stars
        for (int j = 0; j <= i; j++) {
            printf("* ");
        }
        printf("\n");
    }

    return 0;
}

๐Ÿ“Œ How It Works:

  • The first for loop prints the upper half of the double diamond.
  • It prints decreasing stars on the sides and increasing spaces in the center.
  • The second for loop prints the lower half with increasing stars on the sides and decreasing spaces in the center.
  • This creates a symmetric double diamond star pattern.

๐Ÿ’ป Sample Output for n=7:

* * * * * * * * * * * * * *
* * * * * * * * * * * *
* * * * * * * * * *
* * * * * * * *
* * * * * *
* * * *
* *
* *
* * * *
* * * * * *
* * * * * * * *
* * * * * * * * * *
* * * * * * * * * * * *
* * * * * * * * * * * * * *

Comments

Popular Posts

๐ŸŒ™