Given two arrays and a number x, find the pair in arrays whose sum is closest to x.
sbcl --non-interactive --eval "(ql:quickload :pairs-sum/tests)" --eval "(asdf:test-system :pairs-sum)"
-
Notifications
You must be signed in to change notification settings - Fork 0
maruks/daily-coding-pairs-sum-lisp
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
No description or website provided.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published