Problem
Leaderboard
🎁 September Giveaway
This September, you have the opportunity to hone your skills and win the Macbook Air, Sony WH-1000XM4 headphones, $50 gift card and much more.
🎮 How to Play
Complete Educative’s daily coding challenge all month.
Choose your preferred programming language before you start, you can switch it anytime, even mid-problem.
Be mindful of your attempts, you only get a limited number, so make each one count.
Keep your streak alive, the longer it runs, the more raffle entry tickets you rack up.
Earn tickets and increase your chances of winning the draw.
🎟️ How to earn Tickets
ActionTickets Earned
Complete Daily Challenge
+1
10-Day Streak
+10
20-Day Streak
+20
30-Day Streak
+30
LinkedIn post with #30DaysofCode Everyday (and tag Educative)
+2 per post
Most-Liked Post Overall
+20
Top of Leaderboard
+50
Leaderboard: 2nd place
+30
Leaderboard: 3rd place
+20

Problem: Distinct Subsequences

Statement

Given two strings, s and t, determine how many distinct subsequences of s match t exactly.

Note: A subsequence is formed by deleting zero or more characters from s without changing the relative order of the remaining characters.

You may assume the result will always fit within a 3232-bit signed integer.

Constraints:

  • 1≤1 \leq s.length, t.length ≤1000\leq 1000

  • s and t consist of English letters.

Problem
Leaderboard
🎁 September Giveaway
This September, you have the opportunity to hone your skills and win the Macbook Air, Sony WH-1000XM4 headphones, $50 gift card and much more.
🎮 How to Play
Complete Educative’s daily coding challenge all month.
Choose your preferred programming language before you start, you can switch it anytime, even mid-problem.
Be mindful of your attempts, you only get a limited number, so make each one count.
Keep your streak alive, the longer it runs, the more raffle entry tickets you rack up.
Earn tickets and increase your chances of winning the draw.
🎟️ How to earn Tickets
ActionTickets Earned
Complete Daily Challenge
+1
10-Day Streak
+10
20-Day Streak
+20
30-Day Streak
+30
LinkedIn post with #30DaysofCode Everyday (and tag Educative)
+2 per post
Most-Liked Post Overall
+20
Top of Leaderboard
+50
Leaderboard: 2nd place
+30
Leaderboard: 3rd place
+20

Problem: Distinct Subsequences

Statement

Given two strings, s and t, determine how many distinct subsequences of s match t exactly.

Note: A subsequence is formed by deleting zero or more characters from s without changing the relative order of the remaining characters.

You may assume the result will always fit within a 3232-bit signed integer.

Constraints:

  • 1≤1 \leq s.length, t.length ≤1000\leq 1000

  • s and t consist of English letters.