Sep 6th 2026 LeetCode 115: Distinct Subsequences | Dynamic Programming Explained | Java
YouTubeP95 SERIES
Sep 6th 2026 LeetCode 115: Distinct Subsequences | Dynamic Programming Explained | Java
LeetCode 115: Distinct Subsequences is a classic Dynamic Programming problem where we need to count how many distinct subsequences of string s can form string t. In this video, I solve LeetCode Problem 115 – Distinct Subsequences step by step and explain the logic behind the solution in Java. The key idea is to understand the choices we have ...
1 day ago
Dynamic Programming Tutorial
Learn Dynamic Programming with Animations – Full Course for Beginners
1:41:41
Learn Dynamic Programming with Animations – Full Course for Beginners
YouTubefreeCodeCamp.org
192.3K views7 months ago
5 Steps to Solve ANY Dynamic Programming Problem
24:09
5 Steps to Solve ANY Dynamic Programming Problem
YouTubeVisualcoders
2.5K views3 months ago
Complete Dynamic Programming | Dynamic Programming Part 1
9:13:39
Complete Dynamic Programming | Dynamic Programming Part 1
YouTubeCollege Wallah
72.6K views7 months ago
Top videos
LeetCode 115: Distinct Subsequences | DP + Memoization | Take or Skip Explained | ritik
5:47
LeetCode 115: Distinct Subsequences | DP + Memoization | Take or Skip Explained | ritik
YouTubeBeer with Bugs
1 day ago
One repeated character can completely change the DP count! 🤯
0:17
One repeated character can completely change the DP count! 🤯
YouTubeEslihai_coding
12 hours ago
Distinct Subsequences II | LeetCode 940 | Dynamic Programming | Java Code | Developer Coder
Distinct Subsequences II | LeetCode 940 | Dynamic Programming | Java Code | Developer Coder
YouTubeDeveloper Coder
3 views11 hours ago
Dynamic Programming Problems
How to Convert Basic Disk to Dynamic Disk in Windows 11
1:52
How to Convert Basic Disk to Dynamic Disk in Windows 11
YouTubeOur Digital Guide
9.6K viewsJul 4, 2025
✨ Transform Your Learning & Creativity with Next-Gen Tech! 🚀#alizasehar 🎉
0:52
✨ Transform Your Learning & Creativity with Next-Gen Tech! 🚀#alizasehar 🎉
YouTubepersonal pankaj
5M views1 month ago
Turn On Dynamic Island in ALL Apps! HyperOS 3 Tutorial: Setup Guide and First Look #shorts
0:54
Turn On Dynamic Island in ALL Apps! HyperOS 3 Tutorial: Setup Guide and First Look #shorts
YouTubeTECH MUKUL
3.3K views9 months ago
LeetCode 115: Distinct Subsequences | DP + Memoization | Take or Skip Explained | ritik
5:47
LeetCode 115: Distinct Subsequences | DP + Memoization | Take or Skip Explained | ritik
1 day ago
YouTubeBeer with Bugs
One repeated character can completely change the DP count! 🤯
0:17
One repeated character can completely change the DP count! 🤯
12 hours ago
YouTubeEslihai_coding
Distinct Subsequences II | LeetCode 940 | Dynamic Programming | Java Code | Developer Coder
Distinct Subsequences II | LeetCode 940 | Dynamic Programming | Java Code | Developer Coder
3 views11 hours ago
YouTubeDeveloper Coder
Minimum Elements Outside Subsequences | HARD DP + Arrays | Brute Force → O(N) | GFG & LeetCode
18:06
Minimum Elements Outside Subsequences | HARD DP + Arrays | Brute Force → O(N) | GFG & LeetCode
3 views13 hours ago
YouTubeCoding practice
Distinct Subsequences | LeetCode 115 | Brute Force to DP Explained 🔥
23:56
Distinct Subsequences | LeetCode 115 | Brute Force to DP Explained 🔥
1 day ago
YouTubeExplainedbychhavi
Maximum Profit in Job Scheduling | LeetCode 1235 | English | Full Explanation With Code
18:21
Maximum Profit in Job Scheduling | LeetCode 1235 | English | Full Explanation With Code
2 views1 day ago
YouTubeCore Concepts
LeetCode 940 | Easiest Distinct Subsequences II Solution
22:33
LeetCode 940 | Easiest Distinct Subsequences II Solution
1 views7 hours ago
YouTubeAnshu Maurya
1:41
LeetCode 940: Distinct Subsequences II | From Brute Force DFS to O(n) DP #python #leetcode #coding
1 views7 hours ago
YouTubeagentcode42
5:05
The DP Speedup That Turns O(n·k) Into O(n) | Prefix Sums Explained
1 hour ago
YouTubeThe Logic Blueprint
See more
Static thumbnail place holder