Sync LeetCode submission Runtime - 3 ms (81.54%), Memory - 13.7 MB (58.07%)

Author: koralkulacoglu

LeetCode/1128-remove-all-adjacent-duplicates-in-string/README.md

@@ -0,0 +1,30 @@
+<p>You are given a string <code>s</code> consisting of lowercase English letters. A <strong>duplicate removal</strong> consists of choosing two <strong>adjacent</strong> and <strong>equal</strong> letters and removing them.</p>
+
+<p>We repeatedly make <strong>duplicate removals</strong> on <code>s</code> until we no longer can.</p>
+
+<p>Return <em>the final string after all such duplicate removals have been made</em>. It can be proven that the answer is <strong>unique</strong>.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> s = &quot;abbaca&quot;
+<strong>Output:</strong> &quot;ca&quot;
+<strong>Explanation:</strong> 
+For example, in &quot;abbaca&quot; we could remove &quot;bb&quot; since the letters are adjacent and equal, and this is the only possible move.  The result of this move is that the string is &quot;aaca&quot;, of which only &quot;aa&quot; is possible, so the final string is &quot;ca&quot;.
+</pre>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> s = &quot;azxxzy&quot;
+<strong>Output:</strong> &quot;ay&quot;
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= s.length &lt;= 10<sup>5</sup></code></li>
+	<li><code>s</code> consists of lowercase English letters.</li>
+</ul>

LeetCode/1128-remove-all-adjacent-duplicates-in-string/solution.cpp

@@ -0,0 +1,11 @@
+class Solution {
+public:
+    string removeDuplicates(string s) {
+        string t;
+        for (char c : s) {
+            if (!t.empty() && c == t.back()) t.pop_back();
+            else t.push_back(c);
+        }
+        return t;
+    }
+};