Number of distinct subsequences | 2 October | POTD | GFG Problem of the Day | C++ | Java | Python.
Hey guys!! In this video, I've explained the gfg potd( Problem of the Day) -
Number of distinct subsequences. This is really interesting problem based on Dynamic Programming. So do watch the full video and hit like if you like the video.
At last, I've explained the implementation in C++, Java and Python
Recommended speed is: 1.25x to 1.5x
POTD Link: https://practice.geeksforgeeks.org/pr...
Solution Link: https://github.com/BugsInCodeYT/Probl...
WhatsApp Channel Link: https://whatsapp.com/channel/0029Va4M...
CONNECT WITH ME: - / lalit-dungriyal-07a64017a
Timestamps: -
0:00 Understanding the Problem Statement( Don't miss)
03:33 why modulo 10^9+7
05:34 Solution Intuition and Approach
16:18 Code Explanation: C++, Java, Python
gfg potd, gfg potd today, potd gfg, potd, gfg, Problem of the Day, Number of distinct subsequences gfg, Number of distinct subsequences gfg potd, Number of distinct subsequences potd, Number of distinct subsequences problem of the day, Number of distinct subsequences potd today, Number of distinct subsequences 2 October potd,2 October gfg potd, 2 October gfg, 2 October, C++, Java, Python, Number of distinct subsequences gfg potd today, Number of distinct subsequences, Number of distinct subsequences gfg potd today
#gfg #potd #python #problemoftheday #leetcode #dsa #coding #arrays
Happy Coding :)
Keep Learning!!