LeetCode 392. Is Subsequence

Author: raul-sauco

README.md

@@ -37,7 +37,8 @@ Proposed solutions to some LeetCode problems. The first column links to the prob
 | [226. Invert Binary Tree][lc226]                                        | Easy       | [python](leetcode/invert-binary-tree.py)                                      |
 | [242. Valid Anagram][lc242]                                             | Easy       | [python](leetcode/valid-anagram.py)                                           |
 | [304. Range Sum Query 2D - Immutable][lc304]                            | Medium     | [python](leetcode/divide_two_integers.py)                                     |
-| [406. Queue Reconstruction by Height][lc304]                            | Medium     | [python](leetcode/queue-reconstruction-by-height.py)                          |
+| [392. Is Subsequence][lc392]                                            | Easy       | [python](leetcode/is-subsequence.py)                                          |
+| [406. Queue Reconstruction by Height][lc406]                            | Medium     | [python](leetcode/queue-reconstruction-by-height.py)                          |
 | [509. Fibonacci Number][lc509]                                          | Easy       | [python](leetcode/fibonacci-number.py)                                        |
 | [583. Delete Operation for Two Strings][lc583]                          | Medium     | [python](leetcode/delete-operation-for-two-strings.py)                        |
 | [596. Classes More Than 5 Students][lc596]                              | Easy       | [mysql](leetcode/classes_more_than_5_students.sql)                            |
@@ -96,6 +97,7 @@ Proposed solutions to some LeetCode problems. The first column links to the prob
 [lc226]: https://leetcode.com/problems/invert-binary-tree/
 [lc242]: https://leetcode.com/problems/valid-anagram/
 [lc304]: https://leetcode.com/problems/range-sum-query-2d-immutable/
+[lc392]: https://leetcode.com/problems/is-subsequence/
 [lc406]: https://leetcode.com/problems/queue-reconstruction-by-height/
 [lc509]: https://leetcode.com/problems/fibonacci-number/
 [lc583]: https://leetcode.com/problems/delete-operation-for-two-strings/

leetcode/is-subsequence.py

@@ -0,0 +1,49 @@
+# https://leetcode.com/problems/is-subsequence/
+
+import timeit
+
+
+# Runtime: 48 ms, faster than 57.69% of Python3 online submissions for Is Subsequence.
+# Memory Usage: 13.9 MB, less than 44.81 % of Python3 online submissions for Is Subsequence.
+class Solution:
+    def isSubsequence(self, s: str, t: str) -> bool:
+        if len(s) > len(t):
+            return False
+        if not s:
+            return True
+        pointer = 0
+        for char in t:
+            if pointer == len(s):
+                return True
+            if char == s[pointer]:
+                pointer += 1
+        return pointer == len(s)
+
+
+def test():
+    executor = [
+        {'executor': Solution, 'title': 'Solution', },
+    ]
+    tests = [
+        ["", "", True],
+        ["", "abc", True],
+        ["b", "abc", True],
+        ["d", "abcabcabcabcabcd", True],
+        ["d", "abcabcabcabcabc", False],
+        ["abc", "ahbgdc", True],
+        ["axc", "ahbgdc", False],
+    ]
+    for e in executor:
+        start = timeit.default_timer()
+        for _ in range(int(float('1'))):
+            for t in tests:
+                sol = e['executor']()
+                result = sol.isSubsequence(t[0], t[1])
+                expected = t[2]
+                assert result == expected, f'{result} != {expected} for {t[0]}:{t[1]} using {e["title"]} solution'
+        used = str(round(timeit.default_timer() - start, 5))
+        result = "{0:20}{1:10}{2:10}".format(e['title'], used, "seconds")
+        print(f"\033[92m» {result}\033[0m")
+
+
+test()