upd

algorithms/labs/lab7/leetcode/2/link.txt

@@ -0,0 +1 @@
+https://leetcode.com/problems/candy/description/?envType=problem-list-v2&envId=greedy

algorithms/labs/lab7/leetcode/2/solution.py

@@ -0,0 +1,14 @@
+from typing import List
+
+
+class Solution:
+    def candy(self, ratings: List[int]) -> int:
+        n = len(ratings)
+        candies = [1] * n
+        for i in range(1, n):
+            if ratings[i] > ratings[i - 1]:
+                candies[i] = candies[i - 1] + 1
+        for i in range(n - 2, -1, -1):
+            if ratings[i] > ratings[i + 1]:
+                candies[i] = max(candies[i], candies[i + 1] + 1)
+        return sum(candies)