## Check if every index i has an index j such that sum of elements in both directions are equal

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 »

- Largest subarray having sum greater than k
- Kth Smallest sum of continuous subarrays of positive numbers
- Longest substring with count of 1s more than 0s
- Find the sums for which an array can be divided into sub-arrays of equal sum
- Count the number of vowels occurring in all the substrings of given string
- Sum of all Primes in a given range using Sieve of Eratosthenes
- Subarray whose absolute sum is closest to K
- Replace every element of the array by sum of all other elements
- Maximum sum subarray such that start and end values are same
- Product of all primes in the range from L to R
- Index with Minimum sum of prefix and suffix sums in an Array
- Sum of first N natural numbers by taking powers of 2 as negative number
- Longest subarray having average greater than or equal to x | Set-2
- Split array to three subarrays such that sum of first and third subarray is equal and maximum
- Find the value of max(f(x)) - min(f(x)) for a given F(x)
- Partition an array such into maximum increasing segments
- Sum of all prime divisors of all the numbers in range L-R
- Check if every index i has an index j such that sum of elements in both directions are equal
- Count number of indices such that s[i] = s[i+1] : Range queries
- 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
- Sudo Placement[1.5] | Partition
- Check if a large number can be divided into two or more segments of equal sum
- Maximum occurred integer in n ranges | Set-2
- Check whether two strings can be made equal by increasing prefixes
- First element greater than or equal to X in prefix sum of N numbers using Binary Lifting
- Check if a line at 45 degree can divide the plane into two equal weight parts

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 »

Given an array of integers and a value k, find length of largest subarray having sum greater than k. Examples: Input : arr[] = {-2,… Read More »

Given a binary string find the longest substring which contains 1’s more than 0’s. Examples: Input : 1010 Output : 3 Substring 101 has 1… Read More »

Given two integers L and R. The task is to find the sum of all prime factors of every number in the range[L-R]. Examples: Input:… Read More »

Given an array of positive and negative numbers. The task is to find a partition point such that none of the elements of left array… Read More »

Given an array of N positive integers, the task is to find the smallest positive integer that can be placed between any two elements of… Read More »

Given an array of N positive (32-bit)integers, the task is to answer Q queries of the following form: Query(L, R, K): Print the number of… Read More »

Given an array of n positive integers. Find a minimum positive element to be added to one of the indexes in the array such that… Read More »

Consider an array of size n with initial 0 values. How many indices will contain value at least x after performing m range updates. In… Read More »