Game with string | Editorial by gg

Game with string | Editorial by gg_14

All we need to do is count the number of turns possible for a given string. If the number of possible turn are odd then the player who starts win i.e the answer is Yes, otherwise the answer is No. Number of possible turns can be counted using stack. Push the characters of the string in a stack one by one. Before pushing every character check if character at the top of stack is same as the current character, if so then pop a character from the stack and do not push the current character and increment the number of turns by 1, otherwise, push the current character on the stack and move to next character.
Sample code:
```
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define f first
#define ll long long
#define MOD7 1000000007
#define MOD9 1000000009
int main(){
	string str;
	cin >> str;
	int n=str.length();
	stack<char> s;
	int cnt=0;
	s.push(str[0]);
	for(int i=1;i<n;i++){
		if(!s.empty() && str[i]==s.top()){
			s.pop();
			cnt++;
		}else{
			s.push(str[i]);
		}
	}
	if(cnt%2)
		printf("Yes\n");
	else
		printf("No\n");
	return 0;
}
```

Game with string | Editorial by gg_14

Download submission

All caught up!

View submission

Is your resume even shortlisted?