count minimum swaps to make string palindrome

Ashish Kyasari answered on August 15, 2022 Popularity 8/10 Helpfulness 1/10

answer count minimum swaps to make string palindrome

count minimum swaps to make string palindrome

Comment

#include <bits/stdc++.h>
using namespace std;
 
int minSwap(string s)
{
    unordered_map<char, int> unmp;
    int odd = 0, left = 0, right = s.size() - 1, result = 0;
 
    for (char ch : s)
        unmp[ch]++;
 
    for (auto i : unmp)
        if (i.second % 2 == 1)
            odd++;
 
    if (odd > 1)
        return -1;
 
    while (left < right) {
        int l = left, r = right;
        while (s[l] != s[r])
            r--;
        if (l == r) {
 
            // when we found odd element
            swap(s[r], s[r + 1]);
            result++;
            continue;
        }
        else {
            // Normal element
            while (r < right) {
                swap(s[r], s[r + 1]);
                result++;
                r++;
            }
        }
        left++, right--;
    }
    return result;
}
 
// Driver's code
int main()
{
    string s = "aabcc";
    cout << minSwap(s);
    return 0;
}

Popularity 8/10 Helpfulness 1/10 Language cpp

Source: www.geeksforgeeks.org

Tags: c++ count minimum palindrome string

Link to this answer
Share Copy Link

Contributed on Aug 15 2022

Ashish Kyasari

0 Answers Avg Quality 2/10

count minimum swaps to make string palindrome

Contents

More Related Answers

count minimum swaps to make string palindrome

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.