String Ignorance

Author: spaceman-dev

Some_More_Strings/README.md

@@ -16,3 +16,16 @@
   Pattern="WTG"
  Output: WelcomeToGeeksForGeeks
  Explanation: Since only WelcomeToGeeksForGeeks matches the pattern, it is the only answer.
+
+## 3. String Ignorance:
+ Given a string of both uppercase and lowercase alphabets, the task is to print the string with alternate occurrences of any character dropped(including space and consider upper and lowercase as same).
+ Input: First line consists of T test cases. First line of every test case consists of String S.
+ Output: Single line output, print the updated string.
+ Example:
+ Input: 2
+  It is a long day dear.
+  Geeks for geeks
+ Output:
+  It sa longdy ear.
+  Geks fore
+ Explanation:For the 1st test case. Print first "I" and then ignore next "i". Similarly print first space then ignore next space. and so on.

Some_More_Strings/StringIgnorance.cpp

@@ -0,0 +1,46 @@
+#include <bits/stdc++.h>
+using namespace std;
+string stringIgnorance(string str)
+{
+ bool hash[256] = {0};
+ string res;
+ for(int i = 0 ; i < str.length() ; i++)
+ {
+ if(isalpha(str[i]))
+ {
+ if(hash[tolower(str[i])] == 0)
+ {
+ res += str[i];
+ hash[tolower(str[i])] = 1;
+ }
+ else
+ hash[tolower(str[i])] = 0;
+ }
+ else
+ {
+ if(hash[str[i]] == 0)
+ {
+ res += str[i];
+ hash[str[i]] = 1;
+ }
+ else
+ hash[str[i]] = 0;
+ }
+ }
+ return res;
+}
+int main()
+{
+ ios_base::sync_with_stdio(false); 
+ cin.tie(NULL);
+ int t;
+ cin >> t;
+ cin.ignore();
+ while(t--)
+ {
+ string str;
+ getline(cin, str);
+ cout << stringIgnorance(str) << endl;
+ }
+ return 0;
+}