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 ...

C Pattern Program: Diagonal Number Pattern

C Pattern Program: Diagonal Number Pattern

๐Ÿ”ท C Pattern Program: Diagonal Number Pattern

#include <stdio.h>

int main()
{
    int num;
    printf("Enter the number:\n");
    scanf("%d", &num);
    
    for (int i = 0; i < num; i++)
    {
        for (int j = 0; j < num; j++)
        {
            if (j == i)
                printf("%d", i + 1);
            else if (j == num - 1 - i)
                printf("%d", num - i);
            else
                printf(" ");
        }
        printf("\n");
    }

    return 0;
}
  

๐Ÿ“˜ Explanation:

This C program prints a square pattern with two diagonal lines:

๐Ÿ”น On the **main diagonal** (from top-left to bottom-right), it prints i+1 (increasing number).
๐Ÿ”น On the **anti-diagonal** (from top-right to bottom-left), it prints num - i (decreasing number).
๐Ÿ”น All other positions are filled with spaces to maintain the structure.
๐Ÿ”น The result is a visually symmetric pattern based on the input size.

๐Ÿ” Sample Output:

Enter the number:
5
1   5
 2 4 
  3  
 2 4 
1   5
    

๐Ÿท️ Keywords:

C pattern printing, diagonal number pattern, matrix pattern in C, double diagonal number pattern, C loop-based programs

Comments

Popular Posts

๐ŸŒ™