Update 1268. Search Suggestions System.py

Co-Authored-By: Antim-IWP <203163676+Antim-IWP@users.noreply.github.com>
Co-Authored-By: Shiwangi Srivastava <174641070+IamShiwangi@users.noreply.github.com>

Author: 3 people

Solution/1268. Search Suggestions System/1268. Search Suggestions System.py

@@ -0,0 +1,36 @@
+class Trie:
+    def __init__(self):
+        self.children: List[Union[Trie, None]] = [None] * 26
+        self.v: List[int] = []
+
+    def insert(self, w, i):
+        node = self
+        for c in w:
+            idx = ord(c) - ord('a')
+            if node.children[idx] is None:
+                node.children[idx] = Trie()
+            node = node.children[idx]
+            if len(node.v) < 3:
+                node.v.append(i)
+
+    def search(self, w):
+        node = self
+        ans = [[] for _ in range(len(w))]
+        for i, c in enumerate(w):
+            idx = ord(c) - ord('a')
+            if node.children[idx] is None:
+                break
+            node = node.children[idx]
+            ans[i] = node.v
+        return ans
+
+
+class Solution:
+    def suggestedProducts(
+        self, products: List[str], searchWord: str
+    ) -> List[List[str]]:
+        products.sort()
+        trie = Trie()
+        for i, w in enumerate(products):
+            trie.insert(w, i)
+        return [[products[i] for i in v] for v in trie.search(searchWord)]