## Number of integers in a range [L, R] which are divisible by exactly K of it’s digits

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 »

- Minimum increment or decrement operations required to make the array sorted
- Longest Increasing Subsequence using Longest Common Subsequence Algorithm
- Largest sub-matrix with all equal elements
- Minimize the cost of partitioning an array into K groups
- Minimum halls required for class scheduling
- Convert N to M with given operations using dynamic programming
- Count of N-digit numbers in base K with no two consecutive zeroes
- Count number of Special Set
- Count number of ways to arrange first N numbers

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 a number in the form of a string s, the task is to calculate and display minimum splits required such that the segments formed… Read More »

Prerequisite: Print all prime factors and their powers Given natural numbers N and P, the task is to find the power of P in the… Read More »

Given two arrays A[] and B[] of N and M integers respectively, the task is to find the maximum length of equal subarray or the… Read More »

Given a number N (<1010), the task is to find the minimum number of factorials needed to represent N, as their sum. Also, print those… Read More »

Given an array of integers and a number K. The task is to find the maximum sum which is divisible by K from the given… Read More »

Given an array arr[] of N integers. The task is to find the length of the contiguous strictly decreasing sequence that can be derieved after… Read More »

Given an array arr[] of positive and negative numbers only. The task is to find the length of the longest alternating (means negative-positive-negative or positive-negative-positive)… Read More »

Given a number N. The task is to find the first N terms of the Golomb Sequence. Golomb sequence is a non-decreasing integer sequence where… Read More »

Given a number N which denotes the number of stairs, the task is to reach the Nth stair by taking 1, 2 steps any number… Read More »

Given an array arr[] of N integers, the task is to find the count of all the subsequences of the array that have a negative… Read More »

Given an array arr[], the task is to find the maximum number of indices j < i such that (arr[j] % arr[i]) = 0 among… Read More »

Given an array arr[] consisting of integers of length N and an integer K (1 ≤ k ≤ N), the task is to find the… Read More »

Given a binary string str of length N and an integer K, the task is to find the minimum number of steps required to move… Read More »

Given a string str, the task is to find the length of the longest palindromic subsequence of even length with no two adjacent characters same… Read More »