## Split array in three equal sum subarrays

Consider an array A of n integers. Determine if array A can be split into three consecutive parts such that sum of each part is… 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

Consider an array A of n integers. Determine if array A can be split into three consecutive parts such that sum of each part is… Read More »

Given an array arr[] of n integers. The task is to find the sum of product of each element with each element after it in… Read More »

Given N numbers and Q queries, every query consists of L and R, task is to find the number of such integers i (L<=i<R) such… Read More »

Given an array of 0’s and 1’s, we need to write a program to find the minimum number of swaps required to group all 1’s… Read More »

Given an array of N integers. We need to find an index such that Frequency of Even numbers on its left side is equal to… Read More »

Given a string s, count special substrings in it. A Substring of S is said to be special if either of the following properties is… Read More »

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 »