Skip to content

Latest commit

 

History

History
18 lines (11 loc) · 423 Bytes

File metadata and controls

18 lines (11 loc) · 423 Bytes

PairSum

Difficulty Tags Solution Link
Easy [Arrays, Integers] To Do

Problem Description

Write a function that takes an integer and an unsorted array of numbers and returns true if there's any pair of numbers in that array that can be summed up to the input integer.

Samples

Input Output
[1, 3, 5, 4, 2], 7 true
[1, 3, 5, 4, 2], 2 false