Update readme.md

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/readme.md

@@ -1,7 +1,7 @@
 ---
 comments: true
 difficulty: Medium
-edit_url: https://github.com/doocs/leetcode/edit/main/solution/1200-1299/1268.Search%20Suggestions%20System/README_EN.md
+edit_url: Antim
 rating: 1573
 source: Weekly Contest 164 Q3
 tags:
@@ -17,7 +17,7 @@ tags:
 
 # [1268. Search Suggestions System](https://leetcode.com/problems/search-suggestions-system)
 
-[中文文档](/solution/1200-1299/1268.Search%20Suggestions%20System/README.md)
+
 
 ## Description
 
@@ -243,63 +243,6 @@ public:
 };
 ```
 
-#### Go
-
-```go
-type Trie struct {
-	children [26]*Trie
-	v        []int
-}
-
-func newTrie() *Trie {
-	return &Trie{}
-}
-func (this *Trie) insert(w string, i int) {
-	node := this
-	for _, c := range w {
-		c -= 'a'
-		if node.children[c] == nil {
-			node.children[c] = newTrie()
-		}
-		node = node.children[c]
-		if len(node.v) < 3 {
-			node.v = append(node.v, i)
-		}
-	}
-}
-
-func (this *Trie) search(w string) [][]int {
-	node := this
-	n := len(w)
-	ans := make([][]int, n)
-	for i, c := range w {
-		c -= 'a'
-		if node.children[c] == nil {
-			break
-		}
-		node = node.children[c]
-		ans[i] = node.v
-	}
-	return ans
-}
-
-func suggestedProducts(products []string, searchWord string) (ans [][]string) {
-	sort.Strings(products)
-	trie := newTrie()
-	for i, w := range products {
-		trie.insert(w, i)
-	}
-	for _, v := range trie.search(searchWord) {
-		t := []string{}
-		for _, i := range v {
-			t = append(t, products[i])
-		}
-		ans = append(ans, t)
-	}
-	return
-}
-```
-
 <!-- tabs:end -->
 
 <!-- solution:end -->