Leetcode.com 2021-07-08
🟡 718.maximum-length-of-repeated-subarray
🏷️ Tags
#array #binary_search #dynamic_programming #sliding_window #hash_function #rolling_hash
Description
Given two integer arrays
Example
🟡 718.maximum-length-of-repeated-subarray
🏷️ Tags
#array #binary_search #dynamic_programming #sliding_window #hash_function #rolling_hash
Description
Given two integer arrays
nums1 and nums2, return the maximum length of a subarray that appears in both arrays.Example
Input: nums1 = [1,2,3,2,1], nums2 = [3,2,1,4,7]
Output: 3
Explanation: The repeated subarray with maximum length is [3,2,1].
Leetcode-cn.com 2021-10-08
🟡 187.repeated-dna-sequences
🏷️ Tags
#bit_manipulation #hash_table #string #sliding_window #hash_function #rolling_hash
Description
所有 DNA 都由一系列缩写为
编写一个函数来找出所有目标子串，目标子串的长度为 10，且在 DNA 字符串
Example
🟡 187.repeated-dna-sequences
🏷️ Tags
#bit_manipulation #hash_table #string #sliding_window #hash_function #rolling_hash
Description
所有 DNA 都由一系列缩写为
'A'，'C'，'G' 和 'T' 的核苷酸组成，例如："ACGAATTCCG"。在研究 DNA 时，识别 DNA 中的重复序列有时会对研究非常有帮助。编写一个函数来找出所有目标子串，目标子串的长度为 10，且在 DNA 字符串
s 中出现次数超过一次。Example
输入：s = "AAAAACCCCCAAAAACCCCCCAAAAAGGGTTT"
输出：["AAAAACCCCC","CCCCCAAAAA"]
Leetcode-cn.com 2021-12-23
🔴 1044.longest-duplicate-substring
🏷️ Tags
#string #binary_search #suffix_array #sliding_window #hash_function #rolling_hash
Description
给你一个字符串
返回 任意一个 可能具有最长长度的重复子串。如果
Example
🔴 1044.longest-duplicate-substring
🏷️ Tags
#string #binary_search #suffix_array #sliding_window #hash_function #rolling_hash
Description
给你一个字符串
s ，考虑其所有 重复子串 ：即，s 的连续子串，在 s 中出现 2 次或更多次。这些出现之间可能存在重叠。返回 任意一个 可能具有最长长度的重复子串。如果
s 不含重复子串，那么答案为 "" 。Example
输入：s = "banana"
输出："ana"
718.maximum-length-of-repeated-subarray.pdf
71.1 KB
leetcode.com 2022-09-20
🟡718.maximum-length-of-repeated-subarray
🏷️ Tags
#array #binary_search #dynamic_programming #sliding_window #rolling_hash #hash_function
🟡718.maximum-length-of-repeated-subarray
🏷️ Tags
#array #binary_search #dynamic_programming #sliding_window #rolling_hash #hash_function
leetcode.cn 2023-04-12
🔴1147.longest-chunked-palindrome-decomposition
🏷️ Tags
#greedy #two_pointers #string #dynamic_programming #hash_function #rolling_hash
🔴1147.longest-chunked-palindrome-decomposition
🏷️ Tags
#greedy #two_pointers #string #dynamic_programming #hash_function #rolling_hash
Telegraph
longest-chunked-palindrome-decomposition
你会得到一个字符串 text 。你应该把它分成 k 个子字符串 (subtext1, subtext2，…， subtextk) ，要求满足:
leetcode.cn 2023-11-05
🟡187.repeated-dna-sequences
🏷️ Tags
#bit_manipulation #hash_table #string #sliding_window #hash_function #rolling_hash
🟡187.repeated-dna-sequences
🏷️ Tags
#bit_manipulation #hash_table #string #sliding_window #hash_function #rolling_hash
Telegraph
repeated-dna-sequences
DNA序列 由一系列核苷酸组成，缩写为 'A', 'C', 'G' 和 'T'.。
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.