Skip to main content

Featured

C Program to Solve Two Sum Using Brute Force (With Algorithm & Output)

 Introduction The Two Sum problem is a popular coding interview question where we must find two indices of an array whose values add up to a given target. This program demonstrates a simple brute-force solution in C using nested loops and dynamic memory allocation. Problem Statement Given an integer array and a target value, return the indices of the two numbers such that they add up to the target. Each input has exactly one solution, and the same element cannot be used twice. The result should return the indices, not the values. If no solution exists, return NULL.  Algorithm / Logic Explanation Start the program. Traverse the array using a loop from index 0 to numsSize - 1 . Inside this loop, use another loop starting from i + 1 to numsSize - 1 . For every pair (i, j) , check if nums[i] + nums[j] == target . If condition becomes true: Allocate memory for 2 integers using malloc() . Store indices i and j . Set returnSize = 2 . Return the result poi...

Double-Sided Number Pyramid in C

Full Diamond Number Pattern in C

Full Diamond Number Pattern in C

This C program prints a full diamond-like number pattern using nested for loops. It starts by printing numbers in increasing order and then prints them in decreasing order to form a symmetric structure.

✅ C Program Code:


#include <stdio.h>

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

    // Top half
    for (int i = 1; i <= num; i++)
    {
        for (int j = 1; j <= i; j++)
        {
            printf("%d ", j);
        }
        printf("\n");
    }

    // Bottom half
    for (int i = num; i >= 1; i--)
    {
        for (int j = 1; j <= i; j++)
        {
            printf("%d ", j);
        }
        printf("\n");
    }
}
  

๐Ÿ’ก Explanation:

  • The first for loop builds the upper part of the diamond using increasing rows.
  • The second for loop mirrors the top by printing decreasing rows.
  • Each row prints numbers from 1 up to the current row index.

๐Ÿ’ป Sample Output:

Enter the number:
3
1
1 2
1 2 3
1 2 3
1 2
1

๐Ÿ” Keywords:

Diamond number pattern in C, number pyramid in C, full pyramid C pattern, nested loops example in C, beginner pattern programs, mirror pyramid C

Comments

Popular Posts

๐ŸŒ™