## Check whether two strings can be made equal by increasing prefixes

In this problem we have to check. whether two strings can be made equal by increasing the ASCII value of characters of the prefix of… Read More »

- Sum of all Primes in a given range using Sieve of Eratosthenes
- Count the number of vowels occurring in all the substrings of given string
- Kth Smallest sum of continuous subarrays of positive numbers
- Find the sums for which an array can be divided into sub-arrays of equal sum
- Replace every element of the array by sum of all other elements
- Maximum sum subarray such that start and end values are same
- Two equal sum segment range queries
- Product of all primes in the range from L to R
- Index with Minimum sum of prefix and suffix sums in an Array
- Partition an array such into maximum increasing segments
- Partition the array into three equal sum segments
- Sum of first N natural numbers by taking powers of 2 as negative number
- Find the value of max(f(x)) - min(f(x)) for a given F(x)
- Sum of all odd factors of numbers in the range [l, r]
- Minimum value to add to arr[i] so that an array can be split at index i with equal sum
- Count number of indices such that s[i] = s[i+1] : Range queries
- Check if a large number can be divided into two or more segments of equal sum
- Minimum elements to change so that for an index i all elements on the left are -ve and all elements on the right are +ve
- Check if every index i has an index j such that sum of elements in both directions are equal
- Maximum occurred integer in n ranges | Set-2
- Sum of all even factors of numbers in the range [l, r]
- Check whether two strings can be made equal by increasing prefixes
- Number of subarrays having sum of the form k^m, m >= 0
- Check if a line at 45 degree can divide the plane into two equal weight parts
- Maximum sub-array sum after dividing array into sub-arrays based on the given queries
- Replace all elements by difference of sums of positive and negative numbers after that element

In this problem we have to check. whether two strings can be made equal by increasing the ASCII value of characters of the prefix of… Read More »

Given two sequences of N integers consisting of both positive and negative integers inclusive 0 (sequence A and sequence B). Then there will be Q… Read More »

Given a range [L, R]. The task is to find the product of all the prime numbers in the given range from L to R… Read More »

Given a number N ( maybe up to 10^9 ). The task is to find the sum of first N natural number taking powers of… Read More »

Given a range [L, R]. The task is to find the sum of all the prime numbers in the given range from L to R… Read More »

Given an sorted array of positive numbers our tasks is to find the kth smallest sum of continuous subarray. Examples: Input : a[] = {1,… Read More »

Given a very large Number N. The task is to check if the number can be divided into two or more segments of an equal… Read More »

Given N ranges of L-R. The task is to print the number which occurs the maximum number of times in the given ranges. Note: 1… Read More »

Given a circular array of size N. The task is to check if, for every index i starting from 0 to N-1, there exists an… Read More »

Given a set of n points (xi, yi) in 2D coordinate. Each point has some weight wi. The task is to check whether a line… Read More »

Given an array of size N, the task is to find the encrypted array. The encrypted array is obtained by replacing each element of the… Read More »

Given an array of N integers. The task is to find the longest contiguous subarray so that the average of its elements is greater than… Read More »

Given an array of n elements and an integer K, the task is to find the subarray with minimum value of ||a[i] + a[i +… Read More »

Given an array of N integers, the task is to print the sum of the first subarray by splitting the array into exactly three subarrays… Read More »

Given an array of N integers and a number X. The task is to find the index of first element which is greater than or… Read More »