HackerEarth String Game problem solution

In this HackerEarth String Game problem solution, Player1 and Player2 decided to play a game. The game comprises a String S which consists of lowercase English alphabets only and both players take alternative terms.

In each turn, a player chooses a character present in the string and remove all occurrences of the character. For each player to play his turn, there should be at least one character in the string. The Player who is not able to play his turn loses. Your task is to find the winner of the game if both the players play optimally and Player1 plays the first turn.

HackerEarth String Game problem solution.

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int t;
    cin>>t;
    while(t--)
    {   int a[26]={0};
        string s;
        cin>>s;
        int cnt_chars=0;
        for(int i=0;i<s.size();i++)
        {
            if(a[s[i]-'a']==0)
            {
                a[s[i]-'a']=1;
                cnt_chars++;
            }
        }
        if(cnt_chars%2)
            cout<<"Player1n";
        else
            cout<<"Player2n";
    }
    return 0;
}

HackerEarth String Game problem solution.

Leave a Reply