Given a list of positive integers, this algorithm finds the two integers that have the largest product.

160

Dec 11
This function takes in a set of integers and a target value, and returns true if there is a pair of integers in the set that sum up to the target value. Otherwise, it returns false.

158

Dec 09
The function should return the sum of the integers that are hashed to odd values.

136

Dec 09
The "two sum problem" is a classic problem in computer science that involves finding two numbers in an array that add up to a given target. This problem can be solved using a simple brute -force approach, but more efficient solutions exist, such as using a hash table.

102

Dec 02
Given an array of integers and a target value, this problem asks if there is a pair of integers in the array that sums to the target value. An example input and output are given.

134

Dec 01