GO Solution For UVa 10252 - Common Permutation. In this post we will see how we can solve this challenge in GoLang for UVa Online Judge.

Problem Description

Given two strings of lowercase letters, a and b, print the longest string x of lowercase letters such that there is a permutation of x that is a subsequence of a and there is a permutation of x that is a subsequence of b.

Input Input file contains several lines of input. Consecutive two lines make

...

You can find the full details of the problem Common Permutation at UVa Online Judge

Sample Input

pretty
women
walking
down
the
street

Sample Output

e
nw
et

Solution: Please check the main.go snippet for the solution.

Solution originally posted at: Github by @codingsince1985