AlgoExpert Generate Document

Author: raul-sauco

README.md

@@ -987,14 +987,17 @@ First column links to the problem in AlgoExpert, second is the problem's difficu
 
 [🔝 Back to Top 🔝](#coding-challenges)
 
-| AlgoExpert Link                     | Difficulty   | Solutions                                     |
-| ----------------------------------- | ------------ | --------------------------------------------- |
-| [Insertion Sort][ae&insertion-sort] | 🟢 Easy      | [![python](res/py.png)][ae&insertion-sort#py] |
-| [Merge Sort][ae&merge-sort]         | 🟣 Very Hard | [![python](res/py.png)][ae&merge-sort#py]     |
-| [Remove Islands][ae&remove-islands] | 🟠 Medium    | [![python](res/py.png)][ae&remove-islands#py] |
+| AlgoExpert Link                           | Difficulty   | Solutions                                        |
+| ----------------------------------------- | ------------ | ------------------------------------------------ |
+| [Generate Document][ae&generate-document] | 🟢 Easy      | [![python](res/py.png)][ae&generate-document#py] |
+| [Insertion Sort][ae&insertion-sort]       | 🟢 Easy      | [![python](res/py.png)][ae&insertion-sort#py]    |
+| [Merge Sort][ae&merge-sort]               | 🟣 Very Hard | [![python](res/py.png)][ae&merge-sort#py]        |
+| [Remove Islands][ae&remove-islands]       | 🟠 Medium    | [![python](res/py.png)][ae&remove-islands#py]    |
 
 [🔝 Back to Top 🔝](#coding-challenges)
 
+[ae&generate-document]: https://www.algoexpert.io/questions/generate-document
+[ae&generate-document#py]: algoexpert/generate-document.py
 [ae&insertion-sort]: https://www.algoexpert.io/questions/merge-sort
 [ae&insertion-sort#py]: algoexpert/insertion-sort.py
 [ae&merge-sort]: https://www.algoexpert.io/questions/merge-sort

algoexpert/generate-document.py

@@ -0,0 +1,50 @@
+# Generate Document
+# 🟢 Easy
+#
+# https://www.algoexpert.io/questions/generate-document
+#
+# Tags: String - Hash Table
+
+import timeit
+from collections import Counter
+
+
+# Use two counters, frequencies needed and available, then make sure
+# that we have, at least, as many available of each as we need.
+#
+# Time complexity: O(m + n) - Where m and n are the lengths of the input
+# strings.
+# Space complexity: O(c) - Where c is the number of unique characters
+# between both input strings.
+class Solution:
+    def generateDocument(self, characters: str, document: str) -> bool:
+        need, available = Counter(document), Counter(characters)
+        return all(available[c] >= need[c] for c in need)
+
+
+def test():
+    executors = [Solution]
+    tests = [
+        ["A", "a", False],
+        ["a", "a", True],
+        ["Bste!hetsi ogEAxpelrt x ", "AlgoExpert is the Best!", True],
+    ]
+    for executor in executors:
+        start = timeit.default_timer()
+        for _ in range(1):
+            for col, t in enumerate(tests):
+                sol = executor()
+                result = sol.generateDocument(t[0], t[1])
+                exp = t[2]
+                assert result == exp, (
+                    f"\033[93m» {result} <> {exp}\033[91m for"
+                    + f" test {col} using \033[1m{executor.__name__}"
+                )
+        stop = timeit.default_timer()
+        used = str(round(stop - start, 5))
+        cols = "{0:20}{1:10}{2:10}"
+        res = cols.format(executor.__name__, used, "seconds")
+        print(f"\033[92m» {res}\033[0m")
+
+
+test()

algoexpert/solution.py

@@ -0,0 +1,42 @@
+# ####. Problem Name Here
+# 🟢 Easy
+# 🟠 Medium
+# 🔴 Hard
+# 🟣 Very Hard
+#
+# https://www.algoexpert.io/questions/problem-name
+#
+# Tags: ...
+
+import timeit
+
+
+# This is a template that can be used as the starting point of a
+# solution with minimal changes.
+class Solution:
+    def methodCall(self, args: int) -> bool:
+        pass
+
+
+def test():
+    executors = [Solution]
+    tests = []
+    for executor in executors:
+        start = timeit.default_timer()
+        for _ in range(1):
+            for col, t in enumerate(tests):
+                sol = executor()
+                result = sol.methodCall(t[0])
+                exp = t[1]
+                assert result == exp, (
+                    f"\033[93m» {result} <> {exp}\033[91m for"
+                    + f" test {col} using \033[1m{executor.__name__}"
+                )
+        stop = timeit.default_timer()
+        used = str(round(stop - start, 5))
+        cols = "{0:20}{1:10}{2:10}"
+        res = cols.format(executor.__name__, used, "seconds")
+        print(f"\033[92m» {res}\033[0m")
+
+
+test()