A recursive solution that checks for each item x in the list if there is an item in the rest of the list that, added to x, results in the target value.
x
import Data.List (findIndex) twoSum :: [Int] -> Int -> (Int, Int) twoSum xs n = findSum (head xs) 0 (tail xs) where findSum x curr ys = case findIndex (isSum x) ys of Just(i) -> (curr, i + curr + 1) Nothing -> findSum (head ys) (curr + 1) (tail ys) isSum x y = x + y == n
Are you sure you want to hide this comment? It will become hidden in your post, but will still be visible via the comment's permalink.
Hide child comments as well
Confirm
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
Haskell
A recursive solution that checks for each item
x
in the list if there is an item in the rest of the list that, added tox
, results in the target value.