How To Count Unique Paths In A Grid With Obstacles
A C++ solution to Leetcode 63. Unique Paths II, counting the number of unique paths in a grid with obstacles using dynamic programming.
Dynamic Programming
How To Find The Largest Divisible Subset of a Given Integer Set
Two C++ approaches to solve Leetcode 368. Largest Divisible Subset. One uses recursion with dynamic programming. The other saves the memory by only storing the representative of the chains.
How To Compute Fibonacci Number F(n)
Three approaches for solving Leetcode 509. Fibonacci Number. A classical example of Recursive, Dynamic Programming and where Coding meets Mathematics.