Sum of two digits

[shorodilov]

In a sorted list of int find two elements with sum of target.
Return these elements within a new list or an empty list in case it's impossible to obtain the target value.

Optional:
return elements with sum which is the most close to the target.

[tarun212001]

Hey @shorodilov I would like to work on this issue. Please assign it to me. Please let me know what is needed to solve this issue

[shorodilov]

Hi @tarun212001.

The overall development process is described in comments to #87.
Let me know in case you need help, I'll do my best to provide it.

Solution

To tell you the truth, I did not think about the implementation for this issue.
I believe the best way is to use the sorted nature of the input list. So, bisearch package is the good place to start the work.