Jan 7

Author: siddydutta

2025-01-January-LeetCoding-Challenge/README.md

@@ -9,7 +9,7 @@
 | January 4  | [1930. Unique Length-3 Palindromic Subsequences](https://leetcode.com/problems/unique-length-3-palindromic-subsequences/) | Medium | Solved |
 | January 5  | [2381. Shifting Letters II](https://leetcode.com/problems/shifting-letters-ii/) | Medium | Solved |
 | January 6  | [1769. Minimum Number of Operations to Move All Balls to Each Box](https://leetcode.com/problems/minimum-number-of-operations-to-move-all-balls-to-each-box/) | Medium | Solved |
-| January 7  | []() |  |  |
+| January 7  | [1408. String Matching in an Array](https://leetcode.com/problems/string-matching-in-an-array/) | Easy | Solved |
 | January 8  | []() |  |  |
 | January 9  | []() |  |  |
 | January 10 | []() |  |  |
@@ -39,6 +39,6 @@
 ## Summary
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
-| Easy   | 1 | 1 | 0 |
+| Easy   | 2 | 2 | 0 |
 | Medium | 5 | 5 | 0 |
 | Hard   | 0 | 0 | 0 |

2025-01-January-LeetCoding-Challenge/String Matching in an Array.py

@@ -0,0 +1,25 @@
+from typing import List
+
+
+class Solution:
+    def stringMatching(self, words: List[str]) -> List[str]:
+        words.sort(key=len)
+        subs = []
+        for i in range(len(words)):
+            for j in range(i + 1, len(words)):
+                if words[i] in words[j]:
+                    subs.append(words[i])
+                    break
+        return subs
+
+
+def main():
+    words = ['mass', 'as', 'hero', 'superhero']
+    assert Solution().stringMatching(words) == ['as', 'hero']
+
+    words = ['leetcode', 'et', 'code']
+    assert Solution().stringMatching(words) == ['et', 'code']
+
+
+if __name__ == '__main__':
+    main()