Feb 18

Author: siddydutta

2025-02-February-LeetCoding-Challenge/Construct Smallest Number From DI String.py

@@ -0,0 +1,22 @@
+class Solution:
+    def smallestNumber(self, pattern: str) -> str:
+        n = len(pattern)
+        result, stack = [], []
+        for idx in range(n+1):
+            stack.append(str(idx+1))
+            if idx == n or pattern[idx] == 'I':
+                while stack:
+                    result.append(stack.pop())
+        return ''.join(result)
+
+
+def main():
+    pattern = 'IIIDIDDD'
+    assert Solution().smallestNumber(pattern) == '123549876'
+
+    pattern = 'DDD'
+    assert Solution().smallestNumber(pattern) == '4321'
+
+
+if __name__ == '__main__':
+    main()

2025-02-February-LeetCoding-Challenge/README.md

@@ -21,7 +21,7 @@
 | February 15 | [2698. Find the Punishment Number of an Integer](https://leetcode.com/problems/find-the-punishment-number-of-an-integer/) | Medium | Solved |
 | February 16 | [1718. Construct the Lexicographically Largest Valid Sequence](https://leetcode.com/problems/construct-the-lexicographically-largest-valid-sequence/) | Medium | Unsolved |
 | February 17 | [1079. Letter Tile Possibilities](https://leetcode.com/problems/letter-tile-possibilities/) | Medium | Solved |
-| February 18 | []() |  |  |
+| February 18 | [2375. Construct Smallest Number From DI String](https://leetcode.com/problems/construct-smallest-number-from-di-string/) | Medium | Unsolved |
 | February 19 | []() |  |  |
 | February 20 | []() |  |  |
 | February 21 | []() |  |  |
@@ -38,5 +38,5 @@
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
 | Easy   | 6 | 6 | 0 |
-| Medium | 10 | 9 | 1 |
+| Medium | 11 | 9 | 2 |
 | Hard   | 0 | 0 | 0 |