Question description

This post archives several questions of solving arithmatic sequence given a list.

Question description

Given the mapping a = 1, b = 2, … z = 26, and an encoded message, count the number of ways it can be decoded. For example, the message '111' would give 3 combinations, since it could be decoded as 'aaa', 'ka', and 'ak'. You can assume that the messages are decodable. For example, '001' is not allowed.

This blog is on how I set up my blog pulishing process in emacs org mode.

This blog documents the steps I took in order to build my first blog on my Windows laptop. I have never tried to do all the command line and git on a windows machine before. This should be fun.