add tries examples

Barklim · Barklim · commit 0276071783b9 · 2025-03-15T14:32:47.000+03:00
diff --git a/example/7.Tries/0208.js b/example/7.Tries/0208.js
@@ -0,0 +1,36 @@
+
+var Trie = function() {
+    
+};
+
+/** 
+ * @param {string} word
+ * @return {void}
+ */
+Trie.prototype.insert = function(word) {
+    
+};
+
+/** 
+ * @param {string} word
+ * @return {boolean}
+ */
+Trie.prototype.search = function(word) {
+    
+};
+
+/** 
+ * @param {string} prefix
+ * @return {boolean}
+ */
+Trie.prototype.startsWith = function(prefix) {
+    
+};
+
+/** 
+ * Your Trie object will be instantiated and called as such:
+ * var obj = new Trie()
+ * obj.insert(word)
+ * var param_2 = obj.search(word)
+ * var param_3 = obj.startsWith(prefix)
+ */
diff --git a/example/7.Tries/0211.js b/example/7.Tries/0211.js
@@ -0,0 +1,27 @@
+
+var WordDictionary = function() {
+    
+};
+
+/** 
+ * @param {string} word
+ * @return {void}
+ */
+WordDictionary.prototype.addWord = function(word) {
+    
+};
+
+/** 
+ * @param {string} word
+ * @return {boolean}
+ */
+WordDictionary.prototype.search = function(word) {
+    
+};
+
+/** 
+ * Your WordDictionary object will be instantiated and called as such:
+ * var obj = new WordDictionary()
+ * obj.addWord(word)
+ * var param_2 = obj.search(word)
+ */
diff --git a/example/7.Tries/0212.js b/example/7.Tries/0212.js
@@ -0,0 +1,15 @@
+/**
+ * @param {character[][]} board
+ * @param {string[]} words
+ * @return {string[]}
+ */
+var findWords = function(board, words) {
+    
+};
+
+const example1 = suggestedProducts([["o","a","a","n"],["e","t","a","e"],["i","h","k","r"],["i","f","l","v"]], ["oath","pea","eat","rain"]); // ["eat","oath"]
+const example2 = suggestedProducts([["a","b"],["c","d"]], ["abcb"]); // []
+
+console.log(example1);
+console.log(example2);
+
diff --git a/example/7.Tries/1268.js b/example/7.Tries/1268.js
@@ -0,0 +1,15 @@
+/**
+ * @param {string[]} products
+ * @param {string} searchWord
+ * @return {string[][]}
+ */
+var suggestedProducts = function(products, searchWord) {
+    
+};
+
+const example1 = suggestedProducts(["mobile","mouse","moneypot","monitor","mousepad"], "mouse"); // [["mobile","moneypot","monitor"],["mobile","moneypot","monitor"],["mouse","mousepad"],["mouse","mousepad"],["mouse","mousepad"]]
+const example2 = suggestedProducts(["havana"], "havana"); // [["havana"],["havana"],["havana"],["havana"],["havana"],["havana"]]
+
+console.log(example1);
+console.log(example2);
+
diff --git a/example/README.md b/example/README.md
@@ -134,7 +134,7 @@ Better order to solve problems
 124. Binary Tree Maximum Path Sum
 297. Serialize and Deserialize Binary Tree
 
-### Trie, Autocomplete
+### [Trie, Autocomplete](https://github.com/Barklim/leetcode-javascript/tree/master/example/7.Tries)
 
 208. Implement trie
 1268. Search suggestion system
