Skip to content

Dynamic Programming

Jump to bottom
Justin edited this page Aug 23, 2016 · 5 revisions

  1. Fibonacci sequence using dynamic programming (Memoizing).

  2. Finding a sequence that gives the minimum multiplication operations for a given number of matrices. Matrix Chaining

  3. Given a set of coins, find the number of combinations that can be made to achieve a certain total. (Note this program is in South African Rands, customise it to your currency). Coin Changing

  4. Given two strings A and , we will find the minimum amount of edits (mutations) applied on string A to mutate it to string B. [Shortest Edit Distance] (https://github.com/UncleJustin13/Computer-ScienceUWC/blob/dynamic/tryEditDistance.java)

Clone this wiki locally