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

Write a program to find the max of two numbers in c

 Description : 

You have to read two integers from user and find the maximum of two integers.

Sample Execution : 

Test case 1 : 

Enter the num1 : 10

Enter the num2 : 20 

Max of two numbers is 20

Test case 2 :

Enter the num1 : 95

Enter the num2 : 25 

Max of two numbers is 95

PROGRAM:

---------------------------------------------------------------------------------------------------------------

#include<stdio.h>

int main()

{

    int num1,num2;

      printf("Enter the num1:");

     scanf("%d",&num1);

   printf("Enter the num2:");

    scanf("%d",&num2);

   if(num1>=num2)

    {

    printf("max of two numbers is %d",num1);

    }

else if(num2>=num1)

{

printf("max of two numbers is %d",num2);

}

}

---------------------------------------------------------------------------------------------------------------

Comments

Popular Posts

🌙