Given a sequence of numbers, find the largest pair sum in the sequence.

For example
```
[10, 14, 2, 23, 19] -->  42 (= 23 + 19)
[99, 2, 2, 23, 19]  --> 122 (= 99 + 23)
```

Input sequence contains minimum two elements and every element is an integer.

Difficulty: introductory

Starter code:

def largest_pair_sum(numbers):
	

Solutions:
def largest_pair_sum(numbers): 
    return sum(sorted(numbers)[-2:])

from heapq import nlargest

def largest_pair_sum(a):
    return sum(nlargest(2, a))

def largest_pair_sum(a): 
    return a.pop(a.index(max(a))) + a.pop(a.index(max(a)))

def largest_pair_sum(numbers): 
    return sorted(numbers)[-2]+max(numbers)

def largest_pair_sum(numbers):
   from heapq import nlargest
   return sum(nlargest(2, numbers))

def largest_pair_sum(numbers): 
    largest=-10000
    for nums in numbers:
        if nums>largest:
            largest=nums
    second_largest=-10000
    numbers.remove(largest)
    for nums in numbers:
        if nums>second_largest:
            second_largest=nums
    return largest+second_largest

def largest_pair_sum(num): 
    return num.pop(num.index(max(num))) + max(num)

import math

def largest_pair_sum(numbers):
    a, b = -math.inf, -math.inf
    for n in numbers:
        if n > a:
            if a > b:
                b = a
            a = n
        elif n > b:
            b = n
    return a + b

largest_pair_sum = lambda a: max(a) + sorted(a)[-2]

def largest_pair_sum(numbers): 
    # set swapped to true
    swapped = True
    # while loop if counter is not 1:
    while swapped:
        # set swapped to false and only stay in while loop if we swap in for loop
        swapped = False
        # loop thru nums using len of array - 1
        for i in range(len(numbers)-1):
            if numbers[i] > numbers[i + 1]:
                hold_value = numbers[i]
                numbers[i] = numbers[i+1]
                numbers[i+1] = hold_value
                swapped = True

    return numbers[-1] + numbers[-2]