-
Notifications
You must be signed in to change notification settings - Fork 3
sum-pair-closest-to-X #2
Copy link
Copy link
Open
Labels
HacktoberfestdocumentationImprovements or additions to documentationImprovements or additions to documentationgood first issueGood for newcomersGood for newcomershelp wantedExtra attention is neededExtra attention is needed
Description
Activity
Metadata
Metadata
Assignees
Labels
HacktoberfestdocumentationImprovements or additions to documentationImprovements or additions to documentationgood first issueGood for newcomersGood for newcomershelp wantedExtra attention is neededExtra attention is needed
Given a sorted array arr[] of size N and a number X, find a pair in array whose sum is closest to X.
You can have more information at src/sum-pair-closest-to-X/problem.md
Feel free to add questions here.