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...
Post a Comment
Read more
Labels

Recursive String Reversal in C

Recursive String Reversal in C

✅ Recursive String Reversal in C

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

// Recursive function to reverse the string
void reverseString(char str[], int start, int end) {
    if (start >= end)
        return;

    // Swap characters
    char temp = str[start];
    str[start] = str[end];
    str[end] = temp;

    // Recur for next pair
    reverseString(str, start + 1, end - 1);
}

int main() {
    char str[100];
    printf("Enter a string:\n");
    scanf(" %[^\n]", str);  // Read string with spaces

    printf("Original String: %s\n", str);
    
    reverseString(str, 0, strlen(str) - 1);

    printf("Reversed String: %s\n", str);

    return 0;
}

📘 Explanation:

This program demonstrates how to reverse a string using a recursive approach:

  • It defines a recursive function reverseString() that swaps characters from the beginning and end, moving toward the center.
  • Base case: if start >= end, the function returns.
  • Each recursive call handles the next inner pair of characters.
  • scanf(" %[^\n]", str) reads input including spaces.

🧾 Sample Output:

Enter a string:
hello world
Original String: hello world
Reversed String: dlrow olleh

🔑 Keywords:

Recursion in C, reverse string recursively, string functions in C, string reverse logic, string manipulation, reverse using function

📌 Hashtags:

#CProgramming #Recursion #StringReversal #BeginnerC #CodeWithC #StringLogic

Labels:

Comments

Post a Comment

Popular Posts

🌙