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

Video Description

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. Data Structures and Algorithms Free Course (Learn DSA Without Paise) Playlist - https://youtube.com/playlist?list=PLU83Ru7iGtAvP1rqt65MCDSBPFCzUKGXG For more information, fill this form: https://forms.gle/8eiUmM92Fx563Aen9 or call us at 8884881203 Facebook: https://www.facebook.com/thetapacademy Instagram:https://www.instagram.com/tapacademy_online Linkedin: https://www.linkedin.com/company/73820805 Website: https://www.thetapacademy.com​ #dsa #dsacourse #java #dsainjava #javaprogramming #coding #coder