What was given:

nums = [6, 7, -2, 4, -4, 6, 12, 5]

# find max subarray

What was generated:

max_sum = float('-inf')
current_sum = 0
for i in range(len(nums)):
    current_sum += nums[i]
    if current_sum > max_sum:
        max_sum = current_sum
    if current_sum < 0:
        current_sum = 0
        
print(max_sum)

What was given:

nums = [6, 7, -2, 4, -4, 6, 12, 5]

# Find a pair of numbers that sum to n.

What was generated (1st solution):

def pair_sum(nums, n):
    seen = set()
    output = set()
    for num in nums:
        target = n — num
        if target not in seen:
            seen.add(num)
        else:
            output.add((min(num, target), max(num, target)))
    return len(output)

Second Solution (brute force)

def find_pair(nums, n):
    for i in range(len(nums)):
        for j in range(i + 1, len(nums)):
            if nums[i] + nums[j] == n:
                return nums[i], nums[j]
    return None

What was given

coins = [1, 2, 4, 5, 9, 69, 420]

# minimum number of coins needed to make n cents
# dynamic programming

What was generated (1st Solution)

def minCoins(n):
	if n < 0:
		return 0
	elif n in coins:
		return 1
	else:
		return 1 + min(minCoins(n-i) for i in coins if i <= n)

What was generated (4th Solution) (Rest are garbage code)

def min_coins(n):
        table = [0] + [10000] * n
        for i in range(1, n + 1):
                for j in coins:
                        if i >= j and table[i - j] + 1 < table[i]:
                                table[i] = table[i - j] + 1
        return table[n]