In: Advanced Math
1) Definition Knapsack problem: Given a knapsack with some maximum weight capacity W and a set of k items each with weight w_i and utility (in terms of amount/worth etc) u_i, we want to carry items so as to be within the capacity of the knapsack (else it might tear) all the while we want to increase the overall worth of the knapsack (maximize utility)
The number of each quantity must be integral (as we can't break the items into smaller chunks). This problem is an integer programming problem best solved by dynamic programming
2) In stagecoach problem we are looking to minimize the cost of the life insurance policy amount (thereby minimizing risk). Also in stagecoach problem, there are starting and ending points which are fixed whereas no such start/end point is fixed in case of knapsack problem.
Both are examples of integer programming problem best solved by dynamic programming
Hope this was helpful. Please do leave a positive rating if you liked this answer. Thanks and have a good day!