greedyPalindrome.py

def smoothPalindrome(string):
  count =0;
	dic =  {c:string.count(c) for c in string};
	
	i=0;
	
	while i < len(string):
		
		if(string[i] != string[len(string)-1-i]):
			
			if(dic[string[i]] > dic[string[len(string)-1-i]]):
				count += dic[string[len(string)-1-i]]
				string = string.replace(string[len(string)-1-i],string[i])
				
				


			elif (dic[string[i]] <= dic[string[len(string)-1-i]]):
				print dic[string[i]] , dic[string[len(string)-1-i]]
				count += dic[string[i]]
				string = string.replace(string[i],string[len(string)-1-i])
				
			

		if i == len(string)/2-1 :
			break;
		i=i+1;
	
	return count;
	

print smoothPalindrome('abaabb')