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
leetcode.cn 2024-01-09
🟡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
给你一个下标从 0 开始的字符串 s 和一个单词字典 dictionary 。你需要将 s 分割成若干个 互不重叠 的子字符串,每个子字符串都在 dictionary 中出现过。s 中可能会有一些 额外的字符 不在任何子字符串中。 请你采取最优策略分割 s ,使剩下的字符 最少 。 示例 1: 输入:s = "leetscode", dictionary = ["leet","code","leetcode"] 输出:1 解释:将 s 分成两个子字符串:下标从 0 到 3 的 "leet" 和下标从…
leetcode.cn 2025-07-19
🟡1233.remove-sub-folders-from-the-filesystem
🏷️ Tags
#depth_first_search #trie #array #string
🟡1233.remove-sub-folders-from-the-filesystem
🏷️ Tags
#depth_first_search #trie #array #string
Telegraph
remove-sub-folders-from-the-filesystem
你是一位系统管理员,手里有一份文件夹列表 folder,你的任务是要删除该列表中的所有 子文件夹,并以 任意顺序 返回剩下的文件夹。 如果文件夹 folder[i] 位于另一个文件夹 folder[j] 下,那么 folder[i] 就是 folder[j] 的 子文件夹 。folder[j] 的子文件夹必须以 folder[j] 开头,后跟一个 "/"。例如,"/a/b" 是 "/a" 的一个子文件夹,但 "/b" 不是 "/a/b/c" 的一个子文件夹。 文件夹的「路径」是由一个或多个按以下格式串联…
leetcode.com 2025-07-19
🟡1233.remove-sub-folders-from-the-filesystem
🏷️ Tags
#depth_first_search #trie #array #string
🟡1233.remove-sub-folders-from-the-filesystem
🏷️ Tags
#depth_first_search #trie #array #string
Telegraph
remove-sub-folders-from-the-filesystem
Given a list of folders folder, return the folders after removing all sub-folders in those folders. You may return the answer in any order. If a folder[i] is located within another folder[j], it is called a sub-folder of it. A sub-folder of folder[j] must…
leetcode.cn 2025-07-20
🔴1948.delete-duplicate-folders-in-system
🏷️ Tags
#trie #array #hash_table #string #hash_function
🔴1948.delete-duplicate-folders-in-system
🏷️ Tags
#trie #array #hash_table #string #hash_function
Telegraph
delete-duplicate-folders-in-system
由于一个漏洞,文件系统中存在许多重复文件夹。给你一个二维数组 paths,其中 paths[i] 是一个表示文件系统中第 i 个文件夹的绝对路径的数组。
leetcode.com 2025-07-20
🔴1948.delete-duplicate-folders-in-system
🏷️ Tags
#trie #array #hash_table #string #hash_function
🔴1948.delete-duplicate-folders-in-system
🏷️ Tags
#trie #array #hash_table #string #hash_function
Telegraph
delete-duplicate-folders-in-system
Due to a bug, there are many duplicate folders in a file system. You are given a 2D array paths, where paths[i] is an array representing an absolute path to the ith folder in the file system.