[FEATURE REQUEST] new dp algo UniqueSubsequenceCount

[Tuhinm2002]

What would you like to Propose?

This algo counts the number of unique subsequence or subsets can be produced from a string.

• Test cases

public class UniqueSubsequencesCountTest {

    @Test
    void subseqCountTestOne() {
        String s = "abc";

        assertEquals(7, UniqueSubsequencesCount.subseqCount(s));
    }

    @Test
    void subseqCountTestTwo() {
        String s = "abcdashgdhas";

        assertEquals(3592, UniqueSubsequencesCount.subseqCount(s));
    }

    @Test
    void subseqCountTestThree() {
        String s = "aaaaa";

        assertEquals(5, UniqueSubsequencesCount.subseqCount(s));
    }
}

Issue details

This algorithm is missing but is an important approach in dynamic programming

Additional Information

No response

[RahulMohanK]

@Tuhinm2002 I would like to add solution to this problem. Could you please assign it to me ?

[Tuhinm2002]

@Tuhinm2002 I would like to add solution to this problem. Could you please assign it to me ?

That's not an assignment that is a feature request created by me. There is already a PR for this

[Tuhinm2002]

@siriak hey i created a new pr for a new algo in dp check out here #5586

[Aastha-ojha-20]

please assign this to me