GO Solution For UVa 10069 - Distinct Subsequences. In this post we will see how we can solve this challenge in GoLang for UVa Online Judge.

Problem Description

A subsequence of a given sequence is just the given sequence with some elements (possibly none) left out. Formally, given a sequence X = x1x2 . . . xm, another sequence Z = z1z2 . . . zk is a subsequence of X if there exists a strictly increasing sequence < i1, i2, . . . , ik > of indices of X such

...

You can find the full details of the problem Distinct Subsequences at UVa Online Judge

Sample Input

2
babgbag
bag
rabbbit
rabbit

Sample Output

5
3

Solution: Please check the main.go snippet for the solution.

Solution originally posted at: Github by @codingsince1985