public static void main(String args[]) {
        DistinctSubsequence ds = new DistinctSubsequence();
        System.out.println(ds.numDistinct("abdacgblc", "abc"));
    }
Date 03/20/2016
@author Tushar Roy

Given a string S and a string T, count the number of distinct subsequences of T in S.

Time complexity O(n^2)
Space complexity O(n^2)

https://leetcode.com/problems/distinct-subsequences/
src/com/interview/dynamic/DistinctSubsequence.java