Runtime: 72 ms (Top 48.8%) | Memory: 17.70 MB (Top 9.21%)

Author: AnasImloul

scripts/algorithms/I/Increasing Decreasing String/Increasing Decreasing String.py

@@ -1,20 +1,14 @@
-from collections import Counter
+// Runtime: 72 ms (Top 48.8%) | Memory: 17.70 MB (Top 9.21%)
+
 class Solution:
     def sortString(self, s: str) -> str:
-        counter = Counter(s)
-        alphabets = "abcdefghijklmnopqrstuvwxyz"
-        rev_alphabets = alphabets[::-1]
-        total = len(s)
-        res = []
-        while total > 0:
-            for c in alphabets:
-                if counter[c]: 
-                    res.append(c)
-                    counter[c] -= 1
-                    total -= 1
-            for c in rev_alphabets:
-                if counter[c]:
-                    res.append(c)
-                    counter[c] -= 1
-                    total -= 1
-        return "".join(res)
+        s = list(s)
+        result = ''
+        while s:
+            for letter in sorted(set(s)):
+                s.remove(letter)
+                result += letter
+            for letter in sorted(set(s), reverse=True):
+                s.remove(letter)
+                result += letter
+        return result