When you're going down the path of learning data structures and algorithms, it helps to be able to visualize how these algorithms work. That's also an inherently difficult thing to do. Luckily there's lots of engineers out there and they make pretty cool things.
I found a pretty good algorithm visualizer.
Dynamic Programming - Knapsack Problem
The knapsack problem or rucksack problem is a problem in combinatorial optimization: Given a set of items, each with a weight and a value, determine the number of each item to include in a collection so that the total weight is less than or equal to a given limit and the total value is as large as p…
I was working on a medium level Leetcode problem called "Ones and Zeros" (https://leetcode.com/problems/ones-and-zeroes/) that required an understanding of the 0/1 Knapsack problem.