## Find the maximum sum of digits of the product of two numbers

Given an array arr[] of size N( > 2). The task is to find the maximum sum of digits of the product of any two… Read More »

- Program to find the last two digits of x^y
- Nth number whose sum of digit is multiple of 10
- Reduce number to a single digit by subtracting adjacent digits repeatedly
- Append a digit in the end to make the number equal to the length of the remaining string
- Count of integers in a range which have even number of odd digits and odd number of even digits
- Check if the sum of digits of number is divisible by all of its digits
- Round the given number to nearest multiple of 10 | Set-2
- Maximum number formed from array with K number of adjacent swaps allowed
- First N terms whose sum of digits is a multiple of 10
- Find the maximum sum of digits of the product of two numbers
- Largest and smallest digit of a number
- Nearest greater number by interchanging the digits
- Find the smallest positive number which can not be represented by given digits
- Count the number of digits of palindrome numbers in an array
- Check if two numbers have same number of digits
- Reduce N to 1 with minimum number of given operations
- Count the number of occurrences of a particular digit in a number
- Count the nodes in the given tree whose sum of digits of weight is odd
- Maximum number that can be display on Seven Segment Display using N segments
- Sum of the digits of square of the given number which has only 1's as its digits
- Find the first N integers such that the sum of their digits is equal to 10
- Sum of last digit of all integers from 1 to N divisible by M
- Find the remainder when First digit of a number is divided by its Last digit
- Minimum possible number with the given operation
- Check if two Integer are anagrams of each other
- Count of matchsticks required to represent the given number
- Find the largest number that can be formed by changing at most K digits

Given an array arr[] of size N( > 2). The task is to find the maximum sum of digits of the product of any two… Read More »

The task is to find the last two digits of x^y. Since the digits with which it can end are 0-9, Hence this problem can… Read More »

Given a large positive integer represented as a string str. The task is to round this number to the nearest multiple of 10. Examples: Input:… Read More »

Given two integers A and B. The task is to find the nearest greater value to B by interchanging the digits of A. If no… Read More »

Given a string str in which an integer is appended in the end (with or without leading zeroes). The task is to find a single… Read More »

Given a number N. The task is to find the largest and the smallest digit of the number. Examples : Input : N = 2346… Read More »

Given an array a[ ] and the number of adjacent swap operations allowed are K. The task is to find the max number that can… Read More »

Content Removed My Personal Notes arrow_drop_up Save

Given two integers A and B, the task is to check whether both the numbers have equal number of digits. Examples: Input: A = 12,… Read More »

Given an array arr[] with N integers. The task is to count all the digits of all palindrome numbers present in the array. Examples: Input:… Read More »

Given a tree, and the weights of all the nodes, the task is to count the number of nodes whose sum of digits of weights… Read More »

Given a positive integer N. The task is to find the maximum number that can be displayed on seven segment display using N segments. Seven… Read More »

Given a number N, the task is to find the sum of digits of a number at even and odd places. Examples: Input: N =… Read More »

Given a number, the task is to find the product of the digits of a number. Examples: Input: n = 4513 Output: 60 Input: n… Read More »

Given an array arr[] of N elements and a positive integer K. The task is to find the longest sub-sequence in the array having LCM… Read More »