## Find all possible ways to Split the given string into Primes

Given a string str that represents a number. The task is to find all possible ways to split the given string such that each segment… Read More »

- Count number of binary strings without consecutive 1’s : Set 2
- Count numbers in a range with digit sum divisible by K having first and last digit different
- Count numbers less than N containing digits from the given set : Digit DP
- Count numbers with exactly K non-zero digits and distinct odd digit sum
- Number of integers in a range [L, R] which are divisible by exactly K of it's digits
- Count the numbers with N digits and whose suffix is divisible by K
- Split the given string into Odds: Digit DP

Given a string str that represents a number. The task is to find all possible ways to split the given string such that each segment… Read More »

Given a range in the form of L and R, and a value K, the task is to count the numbers between the range L… 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… 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 »

Given a range of values [L, R] and a value K, the task is to count the numbers in the given range which are divisible… Read More »

Given two integers N and K, the task is to calculate the number of integers in the range [0, N] whose digit sum is a… Read More »

Given two integers N and K, the task is to find the count of all the integer in base K which satisfy the following conditions:… Read More »

Given two integers L and R denoting a range [L, R]. The task is to find the total count of numbers in the given range… Read More »

Given n, find count of n digit Stepping numbers. A number is called stepping number if all adjacent digits have an absolute difference of 1.… Read More »

Given an array arr[] of N integers, the task is to find the length of the longest sub-sequence such that adjacent elements of the sub-sequence… Read More »

Given a range [L, R]. The task is to count the numbers in the range having difference between the sum of digits at even position… Read More »

Given a range [L, R] and two positive integers N and M. The task is to count the numbers in the range containing only non-zero… Read More »