Array range queries over range queries

Queries to calculate sum of squares of array elements over range of indices [L, R] with updates

Queries to check if subarrays over given range of indices is non-decreasing or not

Count of all possible Arrays such that each array element can be over the range [1, arr[i]]

Minimum absolute value of (K – arr[i]) for all possible values of K over the range [0, N – 1]

Maximum cost of a value over the range [1, N] such that values lies in at most K given ranges

Sum of f(a[i], a[j]) over all pairs in an array of n integers

Advantages of vector over array in C++

Iterating over all possible combinations in an Array using Bits

Binary Indexed Tree : Range Update and Range Queries

Queries for elements having values within the range A to B in the given index range using Segment Tree

Range Queries to count elements lying in a given Range : MO's Algorithm

Find the Initial Array from given array after range sum queries

Count of Ks in the Array for a given range of indices after array updates for Q queries

Compute maximum of the function efficiently over all sub-arrays

Find the maximum possible value of a[i] % a[j] over all pairs of i and j

Find all unique pairs of maximum and second maximum elements over all sub-arrays in O(NlogN)

Calculate the Sum of GCD over all subarrays

Minimum product of maximum and minimum element over all possible subarrays

Maximum sum of points over K buildings of N floors with M jumps

Find sum of difference of maximum and minimum over all possible subsets of size K

Queries for GCD of all numbers of an array except elements in a given range

Queries for counts of array elements with values in given range

Array range queries for elements with frequency same as value

Array range queries for searching an element