Skip to content

Tag Archives: digit-DP

Given three positive integers L, R and K, the task is to count the numbers in the range [L, R] whose product of digits is… Read More
Given three positive integers L, R and Y, the task is to count the numbers in the range [L, R] whose sum of digits is… Read More
Given an array arr[] consisting of N positive integers and the integers X and M, where 0 <= X < M, the task is to… Read More
Given three positive integers L, R, and K, the task is to find the count of numbers in the range [L, R] having K consecutive… Read More
Given an integer N, the task is to count the numbers up to N having an absolute difference of at most K between any two… Read More
Given an integer array arr of size N. The task is to find the maximum number of splits such that each split has sum divisible… Read More
Given string str that represents a number. The task is to find all possible ways to split the given string such that each segment is… Read More
Given an Integer N, and a number K, the task is to find out the total numbers from 0 to N which have exactly K… Read More
Prerequisites: Digit-DP Given string str that represents a large number, the task is to find the minimum number of segments the given string can be divided… Read More
Given two positive integers N and K, the task is to count the number of positive integers D such that D has N digits and… Read More
Given an integer N and set of digits D[], which consists of digits from [1, 9]. The task is to count the numbers possible less… Read More
Given a positive integer N, the task is to count all possible distinct binary strings of length N such that there are no consecutive 1’s.… Read More