Dynamic Programming - Tag
2013
-
▸
Project Euler - 15 - Lattice paths
Project Euler Problem 15 - Lattice paths. Count routes through an NxN grid moving only right and down using dynamic programming. Solution builds from bottom-right corner.
-
▸
Project Euler - 14 - Longest Collatz sequence - memoization
Project Euler Problem 14 - Longest Collatz sequence. Demonstrates memoization to dramatically speed up computing chain lengths for the Collatz conjecture.
-
▸
Project Euler - Problem 18, Problem 67 - Maximum path sum
Project Euler problems 18 and 67 - Maximum path sum. Classic DP problem: find the maximum sum from top to bottom of a triangular number pyramid by propagating maximums upward.
-
▸
SPOJ - ACODE - AlphaCode
SPOJ ACODE - AlphaCode. Counts possible decodings of a numeric string where 1=A, 2=B, ..., 26=Z using dynamic programming. Handles single and double digit interpretations.
-
▸
Timus - 1018 - Binary Apple Tree - Dynamic Programming
Timus problem 1018 - Binary Apple Tree. Uses dynamic programming to determine which branches to keep to maximize apples collected when only Q branches can be retained.
-
▸
UVa 11259 - Coin Changing Again
UVa 11259 - Coin Changing Again. Uses top-down dynamic programming with state encoding to find all possible ways to make change with limited coin counts. Includes solution with memoization.
-
▸
Number of ways to change making (Dynamic Programming)
A variant of the change making problem that counts the number of distinct ways to make change for a given amount using dynamic programming with coin denominations.
-
▸
Change Making (Dynamic Programming) Problem
Classic dynamic programming problem to find the minimum number of coins needed to make a given change. Uses a bottom-up approach with sorted denominations to compute optimal solution.