Welcome to Joey’s Dynamic programming tutorial.
In this video of Joey’sTech, you are going to learn one very interesting dynamic programming problem which is ‘count sorted vowel strings’
This dynamic programming example problem is from the world of strings and I have taken it from the website of Leetcode.
Count Sorted Vowel Strings can be one of the next dynamic programming interview questions for you thus, understanding it completely is necessary.
And to understand it completely, all you have to do is watch this video till the end. I have tried to keep the explanation as simple as possible so I am certain that you are going to enjoy learning it.
Let’s check out its problem statement now
Given an integer N,
You need to find out the number of strings that can be formed only with the vowels of length N.
Yes, the vowels are a,e, I, o, and u. The strings should be lexicographically sorted.
By lexicographically, I mean that the strings should have vowels in the same order format as they appear in the dictionary.
Below are a couple of examples of strings that are lexicographically sorted -
1. ‘aa’
2. ‘ae’
To clarify further the below strings are not lexicographically sorted
‘ia’
‘ea’
We will find out the number of strings for N=2 that can be formed only with vowels, which are lexicographically sorted.
We will solve it using our favorite dynamic programming approach but before that I want you to subscribe to my channel and press the bell icon that is next to it because that way you will get notified whenever I release new videos on my channel.
So to learn how to solve this DP problem, watch this video till the end.
https://github.com/joeystech2020/dyna...
Sur cette page du site, vous pouvez voir la vidéo en ligne Count Sorted Vowel Strings | dynamic programming tutorial | Leetcode 1641 durée heure minute seconde en bonne qualité , qui a été Téléchargé par l'utilisateur Joey'sTech 10 juillet 2021, Partagez le lien avec vos amis et connaissances, sur youtube cette vidéo a déjà été regardée 325 fois et il a aimé 8 téléspectateurs. Bon visionnage!