Binary Search

Maximize Sum of Subsequence with Condition

Given an array of integers, maximize sub of subsequence such that the sum of any two elements in the subsequence is greater than or equal to any other element.


Find all the Pairs with Given Sum

Given a list of integers, find all pairs with given sum.