Dec 18

Author: siddydutta

2024-12-December-LeetCoding-Challenge/Final Prices With a Special Discount in a Shop.py

@@ -0,0 +1,27 @@
+from typing import List
+
+
+class Solution:
+    def finalPrices(self, prices: List[int]) -> List[int]:
+        result = [price for price in prices]
+        stack = []
+        for idx, price in enumerate(prices):
+            while stack and prices[stack[-1]] >= price:
+                result[stack.pop()] -= price
+            stack.append(idx)
+        return result
+
+
+def main():
+    prices = [8, 4, 6, 2, 3]
+    assert Solution().finalPrices(prices) == [4, 2, 4, 2, 3]
+
+    prices = [1, 2, 3, 4, 5]
+    assert Solution().finalPrices(prices) == [1, 2, 3, 4, 5]
+
+    prices = [10, 1, 1, 6]
+    assert Solution().finalPrices(prices) == [9, 0, 1, 6]
+
+
+if __name__ == '__main__':
+    main()

2024-12-December-LeetCoding-Challenge/README.md

@@ -20,7 +20,7 @@
 | December 15 | [1792. Maximum Average Pass Ratio](https://leetcode.com/problems/maximum-average-pass-ratio/) | Medium | Unsolved |
 | December 16 | [3264. Final Array State After K Multiplication Operations I](https://leetcode.com/problems/final-array-state-after-k-multiplication-operations-i/) | Easy | Solved |
 | December 17 | [2182. Construct String With Repeat Limit](https://leetcode.com/problems/construct-string-with-repeat-limit/) | Medium | Solved |
-| December 18 | []() |  |  |
+| December 18 | [1475. Final Prices With a Special Discount in a Shop](https://leetcode.com/problems/final-prices-with-a-special-discount-in-a-shop/) | Easy | Solved |
 | December 19 | []() |  |  |
 | December 20 | []() |  |  |
 | December 21 | []() |  |  |
@@ -38,6 +38,6 @@
 ## Summary
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
-| Easy   | 4 | 4 | 0 |
+| Easy   | 5 | 5 | 0 |
 | Medium | 13 | 8 | 5 |
 | Hard   | 0 | 0 | 0 |