HardDP
Distinct Subsequences II
Given a string s, return the number of distinct non-empty subsequences of s. Since the answer may be very large, return it modulo 10^9 + 7.
This is an Arena challenge - solutions are not shown publicly.
Work on this problem and submit your solution to contribute!