Google SDE Interview Question 2023 August | Dynamic Programming (Strings) | off-campus

Question 1: Distinct Subsequences Problem Statement Given two strings s and t, return the number of distinct subsequences of s which perfectly equal t. A string's subsequence is a new string formed from the original string by deleting some (can be none) of the characters without disturbing the remaining characters' relative positions. (i.e., "ACE" is a subsequence of "ABCDE" while "AEC" is not). The answer is mathematically guaranteed to fit within a 32-bit signed integer. Constraints 1 <= s.length, t.length ...