## Maximum number that can be display on Seven Segment Display using N segments

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 »

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

Given an array arr[] of digits and an integer K, the task is to find num(arr) + K where num(arr) is the number formed by… Read More »

Given an array of N integers, the task is to find the length of the longest subarray such that adjacent elements of the subarray have… Read More »

Given a positive integer N. The task is to find the value of 3rd digit from last (right-most) of 5N. Examples: Input : N =… Read More »

Given a number N. Find the count of such numbers that can be formed using digits 3 and 4 only and having length at max… Read More »

Given two integers A and B, the task is to find the greatest number ≤ B that can be formed using all the digits of… Read More »

Given an integer N, the task is to check whether the product of digits at even and odd places of a number are equal. If… Read More »

Given an integer K and a range of consecutive numbers [L, R]. The task is to count the numbers from the given range which have… Read More »

Given a number X ( 1<= X <= 9) and a positive number N, find the Nth positive number whose digital root is X. Digital… Read More »

Given an array arr[] of N non-negative integers, the task is to sort these integers according to sum of their digits. Examples: Input: arr[] =… Read More »

Given three integers A, B and C, the task is to find the count of values of X such that the following condition is satisfied,… Read More »

Given a number N(1 ≤ N ≤ 1018) without leading zeros. The task is to find the minimum number of moves required to make N… Read More »