GO Solution For UVa 10739 - String to Palindrome. In this post we will see how we can solve this challenge in GoLang for UVa Online Judge.

Problem Description

In this problem you are asked to convert a string into a palindrome with minimum number of operations. The operations are described below:

Here you’d have the ultimate freedom. You are allowed to:

• Add any character at any position

• Remove any character from any position

• Replace any characte

...

You can find the full details of the problem String to Palindrome at UVa Online Judge

Sample Input

6
tanbirahmed
shahriarmanzoor
monirulhasan
syedmonowarhossain
sadrulhabibchowdhury
mohammadsajjadhossain

Sample Output

Case 1: 5
Case 2: 7
Case 3: 6
Case 4: 8
Case 5: 8
Case 6: 8

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

Solution originally posted at: Github by @codingsince1985