title: Maximal subset sum smaller than a given value
body: <p>You are given an array of integers and a number k. The question is to find a subset such that the sum is maximal and smaller than given number k.
  I feel like there is a dynamic programming approach to solve this but I am not sure how to solve this problem efficiently. </p>