- [Maximum Path Quality of a Graph](https://leetcode.com/problems/maximum-path-quality-of-a-graph/description/)\n- [Search Suggestion System](https://leetcode.com/problems/search-suggestions-system/description/)\n\t- Their constructor also takes k and search returns top k results. \n\t- Your search results should contain the prefix, don\'t need to return results as if every letter was being typed like LC question asks\n\t- Tips: Do not store results in every node (as leetcode solution may suggest) as you insert if you go with trie tree, but instead search up to the word in trie tree. Then recursively find the rest below that node until k elements are reached, similar [LC](https://leetcode.com/problems/design-add-and-search-words-data-structure/description/). Add a cache so subsequent search requests don\'t need to search trie tree.

Maximum Path Quality of a Graph\n- Search Suggestion System\n\t- Their constructor also takes k and search returns top k results. \n\t- Your search results shou