DFS + memo, cache on i & j indices to the # of distinct subseq 2 choices: if chars equal, look at remainder of both s & t if chars not equal, only look at remainder of s ...

Path can only have <= 1 split point, assume curPath has it, so return can't split again ...