Added C++ code for stack problem - Remove all adjacent duplicates in string (codedecks-in#92)

* Added C++ code for stack question- Remove all adjacent duplicates in String

* Updated README.md

* Update README.md

* Update README.md

* Updated README.md

Author: Shamoyeeta

C++/remove-all-adjacent-duplicates-in-string.cpp

@@ -0,0 +1,30 @@
+class Solution {
+public:
+    string removeDuplicates(string str) {
+        stack<char> s;
+        string answer="";
+        for(int i=0;i<str.length();i++)
+        {
+            if(s.empty())
+                s.push(str[i]);
+            else if(str[i]==s.top())
+            {
+                s.pop();
+            }
+            else
+                s.push(str[i]);
+        }
+        while(!s.empty())
+        {
+            answer.push_back(s.top());  //pop values from stack and add it to back of the string answer(hense answer string is in reverse order)
+            s.pop();
+        }
+        auto it=answer.rbegin();
+        string val="";
+        for (; it!=answer.rend(); it++) //this reverses the answer string
+        {
+            val.push_back(*it);
+        }
+        return val;
+    }
+};

README.md

@@ -155,6 +155,8 @@ Check out ---> [Sample PR](https://github.com/codedecks-in/LeetCode-Solutions/pu
 | --- | --------------------------------------------------------------------------------------------------- | ------------------------------------------------------- | ------ | ------ | ---------- | ----- | ---- |
 | 020 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/)                               | [Python](./Python/20_ValidParentheses.py)               | _O(n)_ | _O(n)_ | Easy       | Stack |      |
 | 150 | [Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation/) | [Python](./Python/150.EvaluateReversePolishNotation.py) | _O(n)_ | _O(1)_ | Medium     | Stack |      |
+| 1047 | [Remove All Adjacent Duplicates In String](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string/) | [C++](./C++/remove-all-adjacent-duplicates-in-string.cpp) | _O(n)_ | _O(n)_ | Easy     | Stack |      |
+
 
 <br/>
 <div align="right">
@@ -393,7 +395,8 @@ DISCLAIMER: This above mentioned resources have affiliate links, which means if
 | [Hardik Gupta](https://github.com/harrdy272) <br> <img src="https://avatars3.githubusercontent.com/u/42604986?s=460&u=609a0839312a620d3d658ef19e8eac1e226a6eb4&v=4" width="100" height="100">   | India   | C++                  | [codeforces](https://codeforces.com/profile/harrdy272) <br>[codechef](https://www.codechef.com/users/hardikg272) <br> [Hackerrank](https://www.hackerrank.com/hardikg272) <br> [LeetCode](https://leetcode.com/hardikg272/) |
 | [Jaseem ck](https://github.com/Jaseemck) <br> <img src="https://github.com/Optider.png" width="100" height="100">                                                                               | India   | Python               | [Github](https://github.com/Jaseemck)                                                                                                                                                                                       |
 | [Ilias Khan](https://github.com/IliasKhan) <br> <img src="https://avatars3.githubusercontent.com/u/26863936?s=460&u=4501ffba5efd1a7b978416e8e434dff599c85384&v=4" width="100" height="100"> | India   | C++                  | [codechef](https://www.codechef.com/users/iliaskhan) <br> [Hackerrank](ckerrank.com/iliaskhan57) <br> [LeetCode](https://leetcode.com/ilias_khan/) <br> [codeforces](http://codeforces.com/profile/iliaskhan) |
-
+| [Shamoyeeta Saha](https://github.com/Shamoyeeta) <br> <img src="https://i.pinimg.com/236x/dc/ef/3a/dcef3abedf0e0761203aaeb85886a6f3--jedi-knight-open-source.jpg" width="100" height="100"> | India     | C++                  | [Hackerrank](https://www.hackerrank.com/sahashamoyeeta) <br> [Github](https://github.com/Shamoyeeta) |
+|
 <br/>
 <div align="right">
     <b><a href="#algorithms">⬆️ Back to Top</a></b>