added Treasure Island II and Search Suggestions System

Author: minhyeong-joe

README.md

@@ -130,6 +130,7 @@ Languages used: Java and Python
 - [Longest Common Prefix](String/LongestCommonPrefix)
 - [Minimum Steps to Make Two Strings Anagram](String/MinStepsToMakeTwoStringsAnagram)
 - [Rearrange Words in Sentence](String/RearrangeWordsInSentence)
+- [Search Suggestions System](String/SearchSuggestionsSystem)
 - [String Matching in Array](String/StringMatchingInArray)
 - [Substring with Exactly K Distinct Characters](String/SubstrWithExactKDistinctChars)
 

Recursion/TreasureIsland2/README.md

@@ -0,0 +1,24 @@
+# Treasure Island II
+
+[Leetcode Link](https://leetcode.com/discuss/interview-question/356150)
+
+## Problem:
+
+You have a map that marks the locations of treasure islands. Some of the map area has jagged rocks and dangerous reefs. Other areas are safe to sail in. There are other explorers trying to find the treasure. So you must figure out a shortest route to one of the treasure islands.
+
+Assume the map area is a two dimensional grid, represented by a matrix of characters. You must start from one of the starting point (marked as S) of the map and can move one block up, down, left or right at a time. The treasure island is marked as X. Any block with dangerous rocks or reefs will be marked as D. You must not enter dangerous blocks. You cannot leave the map area. Other areas O are safe to sail in. Output the minimum number of steps to get to any of the treasure islands.
+
+## Example:
+
+```
+Input:
+[['S', 'O', 'O', 'S', 'S'],
+ ['D', 'O', 'D', 'O', 'D'],
+ ['O', 'O', 'O', 'O', 'X'],
+ ['X', 'D', 'D', 'O', 'O'],
+ ['X', 'D', 'D', 'D', 'O']]
+
+Output: 3
+Explanation:
+You can start from (0,0), (0, 3) or (0, 4). The treasure locations are (2, 4) (3, 0) and (4, 0). Here the shortest route is (0, 3), (1, 3), (2, 3), (2, 4).
+```

Recursion/TreasureIsland2/solution.py

@@ -0,0 +1,42 @@
+SOURCE = 'S'
+DANGER = 'D'
+TREASURE = 'X'
+
+
+def shortestRoute(map):
+    routes = set()
+
+    def dfs(map, currentRow, currentCol, visited=list()):
+        # check for out of bound or dangerous or visited
+        if currentRow < 0 or currentRow >= len(map) or currentCol < 0 or currentCol >= len(map[currentRow]) or map[currentRow][currentCol] == DANGER or (currentRow, currentCol) in visited:
+            return
+        if map[currentRow][currentCol] == TREASURE:
+            # optional print route for debugging (if not used, visited can be set() instead of list() for a tiny performance improvement)
+            route = [v for v in visited]
+            route.append((currentRow, currentCol))
+            print("Route:", route)
+            routes.add(len(visited))
+            return
+        # navigate
+        # print(f'{map[currentRow][currentCol]} ({currentRow}, {currentCol})')
+        visited.append((currentRow, currentCol))
+        dfs(map, currentRow-1, currentCol, visited)  # up
+        dfs(map, currentRow, currentCol+1, visited)  # right
+        dfs(map, currentRow+1, currentCol, visited)  # down
+        dfs(map, currentRow, currentCol-1, visited)  # left
+        visited.remove((currentRow, currentCol))
+
+    for i, row in enumerate(map):
+        for j, mark in enumerate(row):
+            if mark == SOURCE:
+                dfs(map, i, j)
+    return min(routes) if routes else None
+
+
+map = [['S', 'O', 'O', 'S', 'S'],
+       ['D', 'O', 'D', 'O', 'D'],
+       ['O', 'O', 'O', 'O', 'X'],
+       ['X', 'D', 'D', 'O', 'O'],
+       ['X', 'D', 'D', 'D', 'O']]
+
+print(shortestRoute(map))

String/SearchSuggestionsSystem/README.md

@@ -0,0 +1,44 @@
+# Search Suggestions System
+
+[Leetcode Link](https://leetcode.com/problems/search-suggestions-system/)
+
+## Problem:
+
+Given an array of strings `products` and a string `searchWord`. We want to design a system that suggests at most three product names from `products` after each character of `searchWord` is typed. Suggested `products` should have common prefix with the `searchWord`. If there are more than three `products` with a common prefix return the three lexicographically minimums `products`.
+
+Return `list of lists` of the suggested products after each character of `searchWord` is typed.
+
+## Example:
+
+```
+Input: products = ["mobile","mouse","moneypot","monitor","mousepad"], searchWord = "mouse"
+Output: [
+["mobile","moneypot","monitor"],
+["mobile","moneypot","monitor"],
+["mouse","mousepad"],
+["mouse","mousepad"],
+["mouse","mousepad"]
+]
+Explanation: products sorted lexicographically = ["mobile","moneypot","monitor","mouse","mousepad"]
+After typing m and mo all products match and we show user ["mobile","moneypot","monitor"]
+After typing mou, mous and mouse the system suggests ["mouse","mousepad"]
+```
+
+```
+Input: products = ["bags","baggage","banner","box","cloths"], searchWord = "bags"
+Output: [["baggage","bags","banner"],["baggage","bags","banner"],["baggage","bags"],["bags"]]
+```
+
+```
+Input: products = ["havana"], searchWord = "tatiana"
+Output: [[],[],[],[],[],[],[]]
+```
+
+## Note:
+
+- 1 <= products.length <= 1000
+- There are no repeated elements in products.
+- 1 <= Σ products[i].length <= 2 \* 10^4
+- All characters of products[i] are lower-case English letters.
+- 1 <= searchWord.length <= 1000
+- All characters of searchWord are lower-case English letters.

String/SearchSuggestionsSystem/solution.py

@@ -0,0 +1,28 @@
+from typing import List
+
+
+class Solution:
+    def suggestedProducts(self, products: List[str], searchWord: str) -> List[List[str]]:
+        searchLists = list()
+        # lexigraphical sort
+        products.sort()
+        typed = ""
+        for ch in searchWord:
+            typed += ch
+            searchLists.append(
+                [p for p in products if p.startswith(typed)][:3])
+        return searchLists
+
+
+sol = Solution()
+products = ["mobile", "mouse", "moneypot", "monitor", "mousepad"]
+searchWord = "mouse"
+print(sol.suggestedProducts(products, searchWord))
+
+products = ["bags", "baggage", "banner", "box", "cloths"]
+searchWord = "bags"
+print(sol.suggestedProducts(products, searchWord))
+
+products = ["havana"]
+searchWord = "tatiana"
+print(sol.suggestedProducts(products, searchWord))