Skip to main content

Featured

Solve LeetCode 3 Longest Substring Without Repeating Characters in C++ using the sliding window

Longest Substring Without Repeating Characters in C++ LeetCode 3 · sliding window · last index array 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 3. Longest Substring Without Repeating Characters Given a string s , find the length of the longest substring that contains no repeating characters. A substring is a continuous part of the string, so "pwke" is a subsequence of "pwwkew" but not a substring. Approach We use a sliding window . The window is the part of the string between start and end , and we always keep it free of repeated characters. An array lastIndex of size 128 remembers the most recent position of every ASCII ...

Multiply Two Numbers Without Using * Operator in C

C Program to Multiply Two Numbers Without Using * Operator

✅ C Program to Multiply Two Numbers Without Using * Operator

#include <stdio.h>
int main() {
    int a, b, result = 0;
    printf("Enter two numbers (a * b):\n");
    scanf("%d %d", &a, &b);

    int x = a, y = b;
    while (y > 0) {
        if (y & 1) {        // if last bit of y is 1
            result += x;    // add current value of x
        }
        x <<= 1;            // multiply x by 2
        y >>= 1;            // divide y by 2
    }

    printf("Product is: %d\n", result);
    return 0;
}
  

πŸ“˜ Explanation:

This program performs multiplication without using the multiplication (*) operator. It applies the Russian Peasant Multiplication Algorithm:

  • if (y & 1) → If last bit of multiplier is 1, add current value of multiplicand.
  • x <<= 1 → Left shift doubles the multiplicand.
  • y >>= 1 → Right shift halves the multiplier.
  • Loop continues until multiplier becomes 0.

🧾 Sample Output:

Enter two numbers (a * b):
6 7
Product is: 42
  

πŸ”‘ Keywords:

C program multiplication without *, bitwise multiplication in C, multiply without arithmetic operator, coding interview bitwise questions

πŸ“Œ Hashtags:

#CProgramming #BitwiseOperators #Multiplication #InterviewPrep #LearnC

πŸ” Search Description:

Learn how to multiply two numbers in C without using the multiplication operator (*). Uses bitwise shift and addition. Explained with code and output.

Multiply Two Numbers Without Using * Operator in C

✅ Multiply Two Numbers Without Using * Operator in C

#include <stdio.h>
int main() {
    int a, b, mul = 0;
    printf("Enter any two numbers:\n");
    scanf("%d %d", &a, &b);

    int positive = 1;

    // Handle negative values
    if (b < 0) {
        b = -b;
        positive = -1;
    }

    for (int i = 1; i <= b; i++) {
        mul = mul + a;
    }

    mul = positive * mul;  // Adjust sign

    printf("Multiplication of given numbers is: %d\n", mul);
    return 0;
}
  

πŸ“˜ Explanation:

This program multiplies two numbers without using the * operator. It performs multiplication using repeated addition logic. Here's how it works:

  • If the second number is negative, we make it positive and remember the sign.
  • We add a to the result b times using a loop.
  • Finally, we apply the sign to get the correct result.

πŸ–₯️ Sample Output:

Enter any two numbers:
5 -4
Multiplication of given numbers is: -20
  

πŸ”‘ Keywords:

multiply without star, no multiplication operator, C multiplication with addition, how to multiply in C, multiplication tricks in C, logic building programs

πŸ“Œ Hashtags:

#CProgramming #MultiplyWithoutOperator #BitwiseLogic #NoMultiplication #BeginnerC #OperatorTricks #LogicalCPrograms

πŸ” Search Description:

This C program multiplies two integers without using the multiplication operator (*). It uses a loop with repeated addition, includes sign adjustment for negative numbers, and is useful for learning low-level logic implementation.

Comments

Popular Posts

πŸŒ™