LeetCode 1143 Longest Common Subsequence - Why Naive Fails

Generate all subsequences of text1 and check which appear in text2.

A string of length $m$ has $2^m$ subsequences. Checking each in text2 takes $O(n)$ time.

Total: $O(n \cdot 2^m)$. Way too slow.