In this HackerEarth Chandu and Consecutive Letters problem solution Chandu is very fond of strings. (Or so he thinks!) But, he does not like strings which have same consecutive letters. No one has any idea why it is so. He calls these strings as Bad strings. So, Good strings are the strings which do not have same consecutive letters. Now, the problem is quite simple. Given a string S, you need to convert it into a Good String.

You simply need to perform one operation - if there are two same consecutive letters, delete one of them.

## HackerEarth Chandu and Consecutive Letters problem solution.

`#include <bits/stdc++.h>using namespace std;int main(){    int testCases;    string s, ans;    cin >> testCases;    assert(1 <= testCases && testCases <= 10);    while(testCases--)    {        cin >> s;        ans = "";        ans += s;        for(int i = 1;i < s.length();++i)            if(s[i] != s[i-1])                ans += s[i];        cout << ans << endl;    }    return 0;}`

### Second solution

`tc = int(raw_input())while tc>0:    tc = tc - 1    ans = ""    a = raw_input()    ans = ans + a    for i in xrange(1,len(a)):        if a[i] != a[i-1]:            ans = ans + a[i]    print ans`