gfg-potd

Trapping Rain Water

gfg-potd

Given an array arr[] with non-negative integers representing the height of blocks. If the width of each block is 1, compute how […]

Indexes of Subarray Sum

gfg-potd

Given an array arr[] containing only non-negative integers, your task is to find a continuous subarray (a contiguous sequence of elements) whose

Sum Pair closest to target

gfg-potd

Given an array arr[] and a number target, find a pair of elements (a, b) in arr[], where a<=b whose sum is closest to target.Note: Return the

Subarrays with sum K

gfg-potd

Given an unsorted array of integers, find the number of continuous subarrays having sum exactly equal to a given number k.

Longest Consecutive Subsequence

gfg-potd

Given an array arr[] of non-negative integers. Find the length of the longest sub-sequence such that elements in the subsequence are consecutive integers, the consecutive

Scroll to Top