Enlightenment of the Day 21.01.11
Situation Solving the following task on Programmers (Link) Task An interger array ‘numbers’ is given. Create a function that returns an array consisting of sums of 2 numbers of different index sorted in an ascending order.
Resitrictions The length of ‘numbers’ is between 2 to 100. All of the numbers of are bewtween 0 to 100. Input/Output example numbers result [2, 1, 3, 4, 1] [2, 3, 4, 5, 6, 7] [5, 0, 2, 7] [2, 5, 7, 9, 12] My Approach to the Solution Initially Logic Sort the input array in ascending order => loop through the array using forEach => in each iteration, map the array, adding the current value to the array => add all that to a result array => using Set, pick out unique values