## Hashing

##### Find the Largest Product of Two Integers in a List

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

187
Dec 11
##### Two Sum

Given an array of integers and a target value, return the indices of the two array elements that add up to the target value. Assume that each input will have only one solution, and that the same array element cannot be used twice.

181
Dec 10
##### Pair Sums to Target Value

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.

195
Dec 09
##### Sum of integers hashed to odd values

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

165
Dec 09
##### Two Sum

Given an array of integers and a target sum, return the indices of the two numbers that add up to the target sum.

133
Dec 08
##### Two Sum

The problem is to find the indices of two numbers in an array that add up to a specific target. For example, given an array of numbers and a target of 9, the indices of the two numbers that add up to 9 would be returned.

188
Dec 08
##### Two sum problem: Given an array of integers, return indices of the two...

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.

130
Dec 02
##### Determining If a Pair of Integers in an Array Sums to a Target Value

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.

159
Dec 01