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

Product of Digits in C

Supermarket Pricing – Product of Digits in C

Product of Digits in C

A supermarket maintains a pricing format for all its products. A value N is printed on each product. When the scanner reads the value N on the item, the product of all the digits in the value N is the price of the item.

The task here is to design the software such that given the code of any item N the product (multiplication) of all the digits of value should be computed (price).

Example 1:

Input :

5244 -> Value of N

Output :
160 -> Price
  

Explanation:

From the input above

Product of the digits 5, 2, 4, 4

5 * 2 * 4 * 4 = 160

Hence, output is 160.
  

#include <stdio.h>

int subtractProductAndSum(int n)
{
    int product = 1;
    int sum = 0;

    while (n > 0)
    {
        int digit = n % 10;
        product *= digit;
        sum += digit;
        n /= 10;
    }

    return product - sum;
}

int main()
{
    int n;
    printf("Enter the value of N: ");
    scanf("%d", &n);

    int result = subtractProductAndSum(n);

    printf("Result (Product - Sum of digits): %d\n", result);

    return 0;
}
  

๐Ÿ“Œ Hashtags:

#CProgramming #NumberProblems #DigitsProduct #CodingPractice #1printf

Comments

Popular Posts

๐ŸŒ™