Skip to content
Merged
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
32 changes: 32 additions & 0 deletions Recursive/SubsequenceRecursive.js
Original file line number Diff line number Diff line change
@@ -0,0 +1,32 @@
/*
* Problem Statement: Find all distinct, non-empty subsequence of given string in lexicographical order using recursive approach.
*
* What is subsequence?
* A Subsequence is sequence obtained by deleting some or no elements without changing the order of elements
* Example: Given a string = "abcd"
* 1. "abc" is a subsequence
* 2. "abd" is a subsequence
* 3. But "ba" is not a subsequence (because order is changed)
*
* What is lexicographical order?
* In simple terms, lexicographical order is dictionary order.
* Example: Given a string = "abcd"
* 1. "abc" will come before "abcd".
* 2. "abd" will come before "ac".
*
* References for meaning of subsequence & lexicographical:
* https://en.wikipedia.org/wiki/Subsequence
* https://en.wikipedia.org/wiki/Lexicographic_order
*/

const subsequence = (str, seq, low) => {
if (low <= str.length && str.length !== 0) {
console.log(seq)
}
for (let i = low; i < str.length; i++) {
subsequence(str, seq + str[i], i + 1)
}
}

const str = 'abcd'
subsequence(str, '', 0)