692.top-k-frequent-words.pdf
71.5 KB
leetcode.com 2022-10-19
🟡692.top-k-frequent-words
🏷️ Tags
#hash_table #string #trie #sorting #heap_priority_queue #bucket_sort #counting
🟡692.top-k-frequent-words
🏷️ Tags
#hash_table #string #trie #sorting #heap_priority_queue #bucket_sort #counting
472.concatenated-words.pdf
76.2 KB
leetcode.com 2023-01-27
🔴472.concatenated-words
🏷️ Tags
#array #string #dynamic_programming #depth_first_search #trie
🔴472.concatenated-words
🏷️ Tags
#array #string #dynamic_programming #depth_first_search #trie
211.design-add-and-search-words-data-structure.pdf
59.4 KB
leetcode.com 2023-03-19
🟡211.design-add-and-search-words-data-structure
🏷️ Tags
#string #depth_first_search #design #trie
🟡211.design-add-and-search-words-data-structure
🏷️ Tags
#string #depth_first_search #design #trie
leetcode.com 2023-08-04
🟡139.word-break
🏷️ Tags
#trie #memoization #array #hash_table #string #dynamic_programming
🟡139.word-break
🏷️ Tags
#trie #memoization #array #hash_table #string #dynamic_programming
Telegraph
word-break
Given a string s and a dictionary of strings wordDict, return true if s can be segmented into a space-separated sequence of one or more dictionary words. Note that the same word in the dictionary may be reused multiple times in the segmentation. Example…