##
Longest common subsequence with permutations allowed
October 23, 2016

Given two strings in lowercase, find the longest string whose permutations are subsequences of given two strings. The output longest string must be sorted. Examples: Input : str1 = “pink”, str2 = “kite” Output : “ik” The string “ik” is the longest sorted string whose one permutation “ik” is subsequence of “pink” and another permutation… Read More »