NeetCode #732LC-115Hard2-D Dynamic ProgrammingNC 150NC 250
← Back to All Problems#732 · #115 · Distinct Subsequences(不同的子序列)
📌 Problem Statement & Constraints
Given strings
s and t, return the number of distinct subsequences of s that equal t. The answer fits in a signed 32-bit integer. Constraints: 1 <= s.length, t.length <= 1000, lowercase English letters.🔒
Sign In to Unlock Full Solutions for All 973 Problems
Sign in to access step-by-step logic, benchmark Python3 code, complexity breakdown, and offline export!