LeetCode 115 Distinct Subsequences - Why Naive Fails

Generate all subsequences of s and count matches with t.

A string of length $m$ has $2^m$ subsequences. Checking each against t is $O(n)$.

Total: $O(n \cdot 2^m)$. Exponential in s's length.