## Total numbers with no repeated digits in a range

Given a range find total such numbers in the given range such that they have no repeated digits. For example: 12 has no repeated digit.… Read More »

- Minimum value to add to arr[i] so that an array can be split at index i with equal sum
- Find the sums for which an array can be divided into sub-arrays of equal sum
- Partition the array into three equal sum segments
- Count number of ways to divide an array into two halves with same sum
- Find the number of sub arrays in the permutation of first N natural numbers such that their median is M
- Two equal sum segment range queries
- Count the number of sub-arrays such that the average of elements present in the sub-array is greater than that not present in the sub-array
- Rearrange the array to maximize the number of primes in prefix sum of the array
- Number of subarrays having sum of the form k^m, m >= 0
- Maximize the size of array by deleting exactly k sub-arrays to make array prime
- Sum of all odd factors of numbers in the range [l, r]
- Generate an Array in which count of even and odd sum sub-arrays are E and O respectively
- Sum of all even factors of numbers in the range [l, r]
- Queries to answer the number of ones and zero to the left of given index
- Count the number of primes in the prefix sum array of the given array
- Replace all elements by difference of sums of positive and negative numbers after that element
- Find the number of integers x in range (1,N) for which x and x+1 have same number of divisors
- Maximum sub-array sum after dividing array into sub-arrays based on the given queries

Given a range find total such numbers in the given range such that they have no repeated digits. For example: 12 has no repeated digit.… Read More »

Given an Array of Integers and an Integer value k, find out k sub-arrays(may be overlapping) which have k maximum sums. Examples: Input : arr… Read More »

Given an Array of Positive and Negative Integers, find out the Maximum Subarray Sum in that Array. Examples: Input1 : arr = {-2, -3, 4,… Read More »

Given an array of n non-negative integers. Choose three indices i.e. (0 <= index_1 <= index_ 2<= index_3 <= n) from the array to make… Read More »

Given a binary string containing only 0’s and 1’s. Write a program to find number of sub-strings of this string whose decimal representation is odd.… Read More »

Given a string of length n and a subsequence of length 3. Find the total number of occurrences of the subsequence in this string. Examples… Read More »

Given N elements (both positive and negative). Find the maximum sum, provided that the first operation is to take some prefix of the sequence and… Read More »

Given a binary string, find the longest subsequence of the form (0)*(1)*(0)* in it. Basically we need to divide the string into 3 non overlapping… Read More »

Given a range [L, R], we need to find the count of total numbers of prime numbers in the the range [L, R] where 0… Read More »

Given an array of n integers. You are given q queries. Write a program to print floor value of mean in range l to r… Read More »

Given an array of size ‘n’ and a given set of commands of size ‘m’. Every command consist of four integers q, l, r, k.… Read More »

Given a binary string of length N and an integer K, we need to find out how many substrings of this string are exist which… Read More »

Given, an array of size n. Find an element which divides the array in two sub-arrays with equal sum. Examples: Input : 1 4 2… Read More »

Given an array containing n numbers. The problem is to split the array into two subarrays such that the absolute difference of the xor values… Read More »

Given an array and two integers say, x and y, find the number of subarrays in which the number of occurrences of x is equal… Read More »