Hi, everyone.
So in this video, what we will do, we will store all the subsequent of string.
So in the previous video we write the code for printing all the subsequence.
So we were printing, but in this video we want to store.
So what we will do, we will modify our previous code.
So let's modify.
So let's remove this function.
So we have only one function, and instead of printing, instead of printing the subsequent says, we
will store it.
So frustrating.
What do you do?
So frustrating.
What do you do instead of printing it, sparser, Victor?
So let's create one vector here.
Vector of string.
We and we will pass director.
So we will pass the vector here.
This is vector of integers, vector of string.
We and this we will get updated, so instead of printing here, what we will do will not push back.
Output.
So we are not bending the story, so this we will get updated by this function and let's print all the
subsequence is here.
So I called zero, i.e., less than we thought.
Sighs So Vytautas will be the number of subsequence C++ and what will do?
You will write Kotva of a.
Simple, so if the input is basically A.B.C., if the input is ABC, ABC, then Vatterott size will
be it because of the subsequent tests will be true to the poetry, is it?
And we are printing all this subsequent years.
So we are just storing instead of printing, we are just storing all this up sequences.
But there is one problem with our code.
So we are printing this vector inside the main function.
So we need to pass the vector Bio-Reference.
So let's pass Director Bio-Reference.
And I think another function will work.
OK, so what is the problem in Subsequence?
So since we are using vectors, so we need to include the vector.
And we forgot to pass Victor in that equation gone, so the dedication also.
So the input is ABC and these are all subsequent subsequence, so basically our function is working,
so we are now able to store all our subsequence.
So this is from this video.
I will see you in the next one.