Problem

Given a set of distinct integers, print the size of the largest subset such that no two integers in the subset sum to more than k.
Example input:
nums = [1, 2, 3, 4, 5], k = 6
Example output:
3

Solution

# Solution:
# The optimal solution is to sort the array and then iterate through the array, keeping track of the largest subset.
# The reason this is optimal is because the time complexity is O(n log n) because of the sorting, and O(n) for the iteration.
# The space complexity is O(1) because we are not storing any data.

def largest_subset(nums, k):
    nums.sort()
    largest_subset = 0
    for i in range(len(nums)):
        if nums[i] > k:
            break
        largest_subset += 1
    return largest_subset

print(largest_subset([1, 2, 3, 4, 5], 6))