Subsequence Of A Given String In Java Using Recursion | FREE DSA Course in JAVA | Lecture 39

preview_player
Показать описание
Today we will be solving a very interesting question known as subsequence of a given string.

We have to write a program in Java to find all the subsequence of a given string using recursion.

What is a subsequence? This might be the first question in your mind.

A subsequence of a given sequence is a sequence that can be derived from the given sequence by deleting some of the elements or no elements without changing the order of the remaining elements.

For eg for a string abc or we call for a sequence abc.

The subsequences will be abc, bc, ac, ab, a, b, c and the empty string as well.

To find the total number of subsequences the formula is 2^n where n is the length of the string.

The next question is, can be solved recursively?

You all know the answer to this question is hidden in the 3 base questions of recursion.

With the course of this lecture, you will find that this problem can be easily solved recursively.

Complete the lecture to understand the concept behind the program and the program for finding all the subsequence of a given string using recursion in java.

Subscribe to our channel for regular updates on the dsa course and click on the bell icon to never miss an update from our dsa course.

or call us at 8884881203

#dsa #dsacourse #java #dsainjava #javaprogramming #coding #coder
Рекомендации по теме
Комментарии
Автор

Crystal clear teaching is possible with you only sir ..if it is any type of difficulty 😊

ravitejasunny
Автор

u deserve everything man seriously ur effort is 200% more then other youtubers and they were noob till now . proud 2 be a tap academian

JavaDevoloper
Автор

ur teching method and personality is awesome. if i don't understand a problem's solution anywhere then i definately understand here.

shubhammuthariya
Автор

I come right to your videos whenever I have any doubt in the self paced course of DSA by Geeks For Geeks

RealThorphin
Автор

great explanation, ,u made me understand very easily thank u

sasisasidhar
Автор

crystal clear explanation thank you so much sir

-Joshna
Автор

Wow ohh my god what an explanation, everyone can easily understand. Awesome. Please make vedios some more problems in recursion problems that will be very helpful

deviandiboina
Автор

nice explanation bro ...deserving much more views

jojolynchgaming
Автор

Don't use the language specific that will reduce the viewers since this video can be easily understandable by non java programmers as well

salihedneer
Автор

Thank so much sir wonderful explanation 🙏😁.

brajeshmohanty
Автор

Thank u brother. Best explanation ever❤

softwareengineering
Автор

Pls also add some leetcode questions so the students will have more confidence

brajeshmohanty
Автор

@TAP ACADEMY, Hello Sir, Your explanation is very nice, but I would like to inform you that your voice is very low, so kindly do what is required for this.

yashaswisharma
Автор

Very good explanation sir can u plz upload other topics as well like trees, graphs also

Shorts_Editer_Launda
Автор

on both leetcode and gfg, this solution through TLE(time limit exceed). sir how we can optimize this solution ???

YashSharma-osng
Автор

Bro how to join your complete dsa course

yarramneninikhil
Автор

But u took too much time for explanation!!!

bandaruneeraj
join shbcf.ru