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…
leetcode.com 2023-09-02
🟡2707.extra-characters-in-a-string
🏷️ Tags
#trie #array #hash_table #string #dynamic_programming
🟡2707.extra-characters-in-a-string
🏷️ Tags
#trie #array #hash_table #string #dynamic_programming
Telegraph
extra-characters-in-a-string
You are given a 0-indexed string s and a dictionary of words dictionary. You have to break s into one or more non-overlapping substrings such that each substring is present in dictionary. There may be some extra characters in s which are not present in any…
leetcode.cn 2023-11-04
🟡421.maximum-xor-of-two-numbers-in-an-array
🏷️ Tags
#bit_manipulation #trie #array #hash_table
🟡421.maximum-xor-of-two-numbers-in-an-array
🏷️ Tags
#bit_manipulation #trie #array #hash_table
Telegraph
maximum-xor-of-two-numbers-in-an-array
给你一个整数数组 nums ,返回 nums[i] XOR nums[j] 的最大运算结果,其中 0 ≤ i ≤ j < n 。 示例 1: 输入:nums = [3,10,5,25,2,8] 输出:28 解释:最大运算结果是 5 XOR 25 = 28. 示例 2: 输入:nums = [14,70,53,83,49,91,36,80,92,51,66,70] 输出:127 提示:
👍1