Solve the 'distinct sequences' problem in leetcode using DP. O(n^2) time and space complexity with a bottom up DP approach. Top down approach was implemented first but failed to pass one of the long string test case due to stack overflow.