Problem done

Author: Kyrylo-Ktl

Python/Count Unreachable Pairs of Nodes in an Undirected Graph.py

@@ -0,0 +1,23 @@
+from collections import defaultdict
+from typing import List
+
+
+class Solution:
+    """
+    Time:   O(n)
+    Memory: O(n)
+    """
+
+    def countPairs(self, n: int, edges: List[List[int]]) -> int:
+        def dfs(u: int, visited: set = set()) -> int:
+            if u in visited:
+                return 0
+            visited.add(u)
+            return 1 + sum(dfs(v) for v in graph[u])
+
+        graph = defaultdict(set)
+        for u, v in edges:
+            graph[u].add(v)
+            graph[v].add(u)
+
+        return sum(reached * (n - reached) for reached in map(dfs, range(n))) // 2

Python/Minimum Amount of Time to Collect Garbage.py

@@ -0,0 +1,18 @@
+from typing import List
+
+
+class Solution:
+    """
+    Time:   O(n)
+    Memory: O(1)
+    """
+
+    TYPES = 'PGM'
+
+    def garbageCollection(self, garbage: List[str], travel: List[int]) -> int:
+        last = {c: i for i, grb in enumerate(garbage) for c in grb}
+
+        for i in range(1, len(travel)):
+            travel[i] += travel[i - 1]
+
+        return sum(map(len, garbage)) + sum(travel[i - 1] if i > 0 else 0 for c, i in last.items())

README.md

@@ -114,7 +114,6 @@ The repository contains the best versions of my solutions to LeetCode problems
 | 2309 | [Greatest English Letter in Upper and Lower Case](https://leetcode.com/problems/greatest-english-letter-in-upper-and-lower-case/) | [Python](Python/Greatest%20English%20Letter%20in%20Upper%20and%20Lower%20Case.py) | $O(1)$ | $O(1)$ | Easy | - |
 | 2315 | [Count Asterisks](https://leetcode.com/problems/count-asterisks/) | [Python](Python/Count%20Asterisks.py) | $O(n)$ | $O(1)$ | Easy | - |
 | 2331 | [Evaluate Boolean Binary Tree](https://leetcode.com/problems/evaluate-boolean-binary-tree/) | [Python](Python/Evaluate%20Boolean%20Binary%20Tree.py) | $O(n)$ | $O(n)$ | Easy | - |
-| 2335 | [Minimum Amount of Time to Fill Cups](https://leetcode.com/problems/minimum-amount-of-time-to-fill-cups/) | [Python](Python/Minimum%20Amount%20of%20Time%20to%20Fill%20Cups.py) | - | - | Easy | - |
 | 2341 | [Maximum Number of Pairs in Array](https://leetcode.com/problems/maximum-number-of-pairs-in-array/) | [Python](Python/Maximum%20Number%20of%20Pairs%20in%20Array.py) | $O(n)$ | $O(n)$ | Easy | - |
 | 2347 | [Best Poker Hand](https://leetcode.com/problems/best-poker-hand/) | [Python](Python/Best%20Poker%20Hand.py) | $O(1)$ | $O(1)$ | Easy | - |
 | 2351 | [First Letter to Appear Twice](https://leetcode.com/problems/first-letter-to-appear-twice/) | [Python](Python/First%20Letter%20to%20Appear%20Twice.py) | $O(n)$ | $O(1)$ | Easy | - |
@@ -135,4 +134,4 @@ The repository contains the best versions of my solutions to LeetCode problems
 
 ## Last update
 
-Solution table for problems was generated automatically on 2022-09-10 18:01 +0000
+Solution table for problems was generated automatically on 2022-09-10 15:54 +0000

infrastructure/src/parser.py

@@ -21,7 +21,7 @@ def get_problem_data(cls, title: str) -> Optional[dict]:
             return None
 
         if 'errors' in response:
-            logger.error('Response errors', response['errors'])
+            logger.error(f'Response errors: {response["errors"]}')
             return None
 
         problem_data = response['data']['question']