I’ve been working on problems at Project Euler in order to help myself grow as a programmer as of late. While I haven’t completed many at this point, it’s been fun to think about algorithm design and problem solving with such ‘simple’ problems.

I’ve really liked working on them as they build upon one another. Subsequent problems normally build (from a logical sense) upon the algorithms of previous problems. For example, the first problem is “Add all the natural numbers below one thousand that are multiples of 3 or 5,” while the second problem is “Find the sum of all the even-valued terms in the Fibonacci sequence which do not exceed four million.” Anyone can see how techniques developed for the first problem could be applied in the resolution of the second.

I definitely suggest visiting Project Euler to anyone who wants to code their way around a few brain teasers for fun!