Question: Remove All Adjacent Duplicates in String
You are given a string s consisting of lowercase English letters. A duplicate removal consists of
choosing two adjacent and equal letters and removing them.
We repeatedly make duplicate removals on s until we no longer can.
Return the final string after all such duplicate removals have been made. It can be proven that the answer
is unique.
ممكن حل هذا السؤال بالlinked list
C++
تم التعديل في بواسطة Mustafa Suleiman تعديل عنوان السؤال
السؤال
احمد محمد عبدالله زاهر
Question: Remove All Adjacent Duplicates in String
You are given a string s consisting of lowercase English letters. A duplicate removal consists of
choosing two adjacent and equal letters and removing them.
We repeatedly make duplicate removals on s until we no longer can.
Return the final string after all such duplicate removals have been made. It can be proven that the answer
is unique.
ممكن حل هذا السؤال بالlinked list
C++
تم التعديل في بواسطة Mustafa Suleimanتعديل عنوان السؤال
1 جواب على هذا السؤال
Recommended Posts
انضم إلى النقاش
يمكنك أن تنشر الآن وتسجل لاحقًا. إذا كان لديك حساب، فسجل الدخول الآن لتنشر باسم حسابك.