Currently I have only one dynamic programming solution written in Python.
maxContiguousSubsequence --> Finds the maximum contiguous subsequence sum given a list of numbers and a rangel of indexes. This program takes input in the form of numbers separated by a space from the command line and also takes the range of indexes i.e. start index and end index separated by a space and provides the maximum contiguous sum.