The Subset Sum Problem Solved in Linear Time for Dense Enough Inputs | Towards Data Science

An optimal solution to the well-known NP-complete problem, when the input values are close enough to each other.