Closed sukritidawar closed 3 years ago
I want to work on this issue in c++
I want to work on this issue in python
I want to work on this issue in C
I would like to do this in java
I want to work on this issue in c++
@sukritidawar Go ahead with C++ All the very best
I want to work on this issue in python
@narayan2111 Go ahead with Python All the very best
I want to work on this issue in C
@ag278 Go ahead with C All the very best
I would like to do this in java
@rutujadhanawade Go ahead with Java All the very best
kindly add hacktoberfest label on this issue ,this issue is counted towards hacktobefest. @iamrajiv @plazzy99
Please reopen this issue once you add more information and updates here. If this is not the case and you need some help, feel free to seek help from our Telegram or ping one of the reviewers. Thank you for your contributions!
🚀 Feature
Given a string, print all the possible subsequences of the string, using recursion. “abcd” has following subsequences “”, “d”, “c”, “cd”, “b”, “bd”, “bc”, “bcd”, “a”, “ad”, “ac”, “acd”, “ab”, “abd”, “abc”, “abcd” Example: Input : abcd Output:
d c cd b bd bc bcd a ad ac acd ab abd abc abcd
Have you read the Contributing Guidelines on Pull Requests?
Yes
Motivation
Helps in understanding the basics of recursion.
Pitch
(Please explain why this feature should be implemented and how it would be used.)