thefourtheye.in

2013

• ▸
  Project Euler - 15 - Lattice paths

  15 June 2013 #Dynamic Programming #Project Euler #Sport Programming

  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

  15 June 2013 #Dynamic Programming #Project Euler #Mathematics #Sport Programming

  Project Euler Problem 14 - Longest Collatz sequence. Demonstrates memoization to dramatically speed up computing chain lengths for the Collatz conjecture.

• ▸
  Project Euler - Problem 5 - Smallest multiple

  15 June 2013 #Project Euler #Mathematics #Sport Programming

  Project Euler Problem 5 - Smallest Multiple. Finds the smallest number divisible by all numbers 1-20. Compares brute force approach to optimized LCM-based solution using GCD.

• ▸
  Project Euler - Problem 18, Problem 67 - Maximum path sum

  12 June 2013 #Dynamic Programming #Project Euler #Sport Programming

  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.