Comment by 0xc0der

I have been recently thinking about the NP-complete class of problems particularly the knapsack problem (it is easy to understand and attack). And I think it is really solvable in polynomial time. I actually tried and posted my solution here. https://news.ycombinator.com/item?id=41341608 a bit of feedback would be really helpful.