Функциональное программирование

def prox(value, A):
    return list(filter(lambda x: x if x < int(value) else 0, A))
 
 
A = [1, 2, 34, 3, 45, 67, 28, 9, 19, 123, 234, 6, 7]
value = input("Введите значения - ")
print("Новый перечень чисел - " + str(prox(value, A)))

A = [1, 2, 34, 3, 45, 67, 28, 2, 44, 9, 19, 123, 134, 6, 7, 23, 4, 43]
#A = [1, 2, 34, 3, 45, 67, 28, 9, 19, 123, 234, 6, 7]
S = int(input("Введите предельное значение суммы  - "))
 
L = []
for i in range(len(A)):
    max_lst = []
    for j in range(len(A[i:])):
        s = sum(A[i:i+j+1])
        if s <= S:
            max_lst = A[i:i+j+1]
        else: break
    if max_lst != [] and not (max_lst in L):
        L.append(max_lst)
    max_lst = []
 
max_len = max(L, key=lambda x: len(x))
for lst in L:
    if len(lst) == len(max_len):
        print(lst)

Введите предельное значение суммы  - 2
[1]
[2]

[1]
[2]
[2]

[1]
[2]

from collections import deque
 
def foo(a, maxSum):
    d = deque()
    sum_ = 0
    result = 0
    for x in a:
        while sum_ + x > maxSum and d:
            sum_ -= d.popleft()
        if sum_ + x <= maxSum:
            d.append(x)
            sum_ += x
            result = max(result, sum_)
        elif d:
            d.clear()
            sum_ = 0
    return result
    
assert foo((1, 2, 34, 3, 45, 67, 28, 9, 19, 123, 234, 6, 7), 1) == 1
assert foo((1, 2, 34, 3, 45, 67, 28, 9, 19, 123, 234, 6, 7), 2) == 2
assert foo((1, 2, 34, 3, 45, 67, 28, 9, 19, 123, 234, 6, 7), 3) == 3
assert foo((1, 2, 34, 3, 45, 67, 28, 9, 19, 123, 234, 6, 7), 36) == 36

print(*(lambda a, limit: sorted(set(str(w) for win in [[[(sum(w), w) for w in [a[i:i+k] for i in range(len(a)-k+1)]] for k in range(1, len(a)+1)]] for s, w in win[max(k for e, k in [(min(s)[0], k) for k, s in enumerate(win)] if e <= limit)] if s <= limit)))([1, 2, 34, 3, 45, 67, 28, 2, 44, 9, 19, 123, 134, 6, 7, 23, 4, 43], int(input('введите предел суммы: '))), sep='\n')