## Longest Common Subsequence | Finding all LCS

Given two sequences, print all the possible longest common subsequences present in them.

Read More Longest Common Subsequence | Finding all LCSCoding made easy

Given two sequences, print all the possible longest common subsequences present in them.

Read More Longest Common Subsequence | Finding all LCSWrite space optimized version of LCS problem.

Read More Longest Common Subsequence | Space optimized versionThe longest common subsequence (LCS) problem is the problem of finding the longest subsequence that is present in given two sequences in the same order. i.e. find a longest sequence which can be obtained from the first original sequence by deleting some items, and from the second original sequence by deleting other items.

Read More Longest Common Subsequence | Introduction & LCS LengthGiven a string, find all combinations of non-overlapping substrings of it. The solution should use parenthesis to split the string into non-overlapping substrings.

Read More Find all combinations of non-overlapping substrings of a stringGiven a positive number N, efficiently generate all binary numbers between 1 to N.

Read More Generate binary numbers between 1 to NPrint all N-digit binary numbers with k-bits set where k ranges from 1 to N. Numbers with same number of bits set should be printed together and in ascending order.

Read More Find all N-digit binary numbers with k-bits set where k ranges from 1 to NGiven a positive number n, find all strings of length n containing balanced parentheses.

Read More Find all strings of given length containing balanced parenthesesLexicographically minimal string rotation or lexicographically least circular substring is the problem of finding the rotation of a string possessing the lowest lexicographical order of all such rotations.

Read More Find Lexicographically minimal string rotationGiven a string sorted in ascending order, find all lexicographically next permutations of it.

Read More Find all lexicographically next permutations of a string sorted in ascending orderGiven a string containing all distinct characters, find all permutations of it.

Read More Find all Permutations of a given stringGiven a string, find the longest substring of given string containing distinct characters.

Read More Longest substring of given string containing distinct charactersFind all substrings of a string that contains all characters of another string. In other words, find all substrings of first string that are anagrams of second string.

Read More Find all substrings of a string that are permutation of a given stringGiven a string, find all palindromic permutations of it.

Read More Find all palindromic permutations of a stringGiven a string and a positive number k, find the longest substring of given string containing k distinct characters. If k is more than number of distinct characters in the string, return the whole string.

Read More Find the longest substring of given string containing k distinct characters