# Introduction In this challenge, we will be writing a function called `numDistinct` that takes in two strings, `s` and `t`, and counts the number of distinct subsequences of `s` that equal `t`. The function should return the total count of distinct subsequences. We will need to implement the logic inside the `numDistinct` function to solve this problem.
Click the virtual machine below to start practicing