LeetCode 115: Distinct Subsequences — Step-by-Step Visual Trace

Hard — Dynamic Programming | String | Subsequence The Problem Given two strings s and t, return the number of distinct subsequences of s which equals t. A subsequence is formed by deleting some characters without changing the relative order of remain...