Each day, take the next subject in the list, watch some videos about that subject, and then write an implementation of that data structure or algorithm in the language you chose for this course. You can see my code here: C C++ Python You don't need to memorize every algorithm. You jus...
An optimal solution is reached by "greedily" choosing the locally optimal choice without ever reconsidering previous choices Example - Coin Change Given a target amount V cents and a list of denominations of n coins, i.e. we have coinValue[i] (in cents) for coin types i from [0...n ...