leetcode.cn 2026-06-25
🟡3737.count-subarrays-with-majority-element-i
🏷️ Tags
#segment_tree #array #hash_table #divide_and_conquer #counting #prefix_sum #merge_sort
🟡3737.count-subarrays-with-majority-element-i
🏷️ Tags
#segment_tree #array #hash_table #divide_and_conquer #counting #prefix_sum #merge_sort
Telegraph
count-subarrays-with-majority-element-i
给你一个整数数组 nums 和一个整数 target。
leetcode.com 2026-06-25
🟡3737.count-subarrays-with-majority-element-i
🏷️ Tags
#segment_tree #array #hash_table #divide_and_conquer #counting #prefix_sum #merge_sort
🟡3737.count-subarrays-with-majority-element-i
🏷️ Tags
#segment_tree #array #hash_table #divide_and_conquer #counting #prefix_sum #merge_sort
Telegraph
count-subarrays-with-majority-element-i
You are given an integer array nums and an integer target. Return the number of subarrays of nums in which target is the majority element. The majority element of a subarray is the element that appears strictly more than half of the times in that subarray.…
leetcode.cn 2026-06-26
🔴3739.count-subarrays-with-majority-element-ii
🏷️ Tags
#segment_tree #array #hash_table #divide_and_conquer #prefix_sum #merge_sort
🔴3739.count-subarrays-with-majority-element-ii
🏷️ Tags
#segment_tree #array #hash_table #divide_and_conquer #prefix_sum #merge_sort
Telegraph
count-subarrays-with-majority-element-ii
给你一个整数数组 nums 和一个整数 target。
leetcode.com 2026-06-26
🔴3739.count-subarrays-with-majority-element-ii
🏷️ Tags
#segment_tree #array #hash_table #divide_and_conquer #prefix_sum #merge_sort
🔴3739.count-subarrays-with-majority-element-ii
🏷️ Tags
#segment_tree #array #hash_table #divide_and_conquer #prefix_sum #merge_sort
Telegraph
count-subarrays-with-majority-element-ii
You are given an integer array nums and an integer target. Return the number of subarrays of nums in which target is the majority element. The majority element of a subarray is the element that appears strictly more than half of the times in that subarray.…
leetcode.cn 2026-07-22
🔴3501.maximize-active-section-with-trade-ii
🏷️ Tags
#segment_tree #array #string #binary_search
🔴3501.maximize-active-section-with-trade-ii
🏷️ Tags
#segment_tree #array #string #binary_search
Telegraph
maximize-active-section-with-trade-ii
给你一个长度为 n 的二进制字符串 s ,其中:
leetcode.com 2026-07-22
🔴3501.maximize-active-section-with-trade-ii
🏷️ Tags
#segment_tree #array #string #binary_search
🔴3501.maximize-active-section-with-trade-ii
🏷️ Tags
#segment_tree #array #string #binary_search
Telegraph
maximize-active-section-with-trade-ii
You are given a binary string s of length n, where:
leetcode.cn 2026-08-13
🔴2213.longest-substring-of-one-repeating-character
🏷️ Tags
#segment_tree #array #string #ordered_set
🔴2213.longest-substring-of-one-repeating-character
🏷️ Tags
#segment_tree #array #string #ordered_set
Telegraph
longest-substring-of-one-repeating-character
给你一个下标从 0 开始的字符串 s 。另给你一个下标从 0 开始、长度为 k 的字符串 queryCharacters ,一个下标从 0 开始、长度也是 k 的整数 下标 数组 queryIndices ,这两个都用来描述 k 个查询。 第 i 个查询会将 s 中位于下标 queryIndices[i] 的字符更新为 queryCharacters[i] 。 返回一个长度为 k 的数组 lengths ,其中 lengths[i] 是在执行第 i 个查询 之后 s 中仅由 单个字符重复 组成的 最长子字符串…
leetcode.com 2026-08-13
🔴2213.longest-substring-of-one-repeating-character
🏷️ Tags
#segment_tree #array #string #ordered_set
🔴2213.longest-substring-of-one-repeating-character
🏷️ Tags
#segment_tree #array #string #ordered_set
Telegraph
longest-substring-of-one-repeating-character
You are given a 0-indexed string s. You are also given a 0-indexed string queryCharacters of length k and a 0-indexed array of integer indices queryIndices of length k, both of which are used to describe k queries. The ith query updates the character in s…
leetcode.cn 2026-10-15
🟢2913.subarrays-distinct-element-sum-of-squares-i
🏷️ Tags
#binary_indexed_tree #segment_tree #array #hash_table
🟢2913.subarrays-distinct-element-sum-of-squares-i
🏷️ Tags
#binary_indexed_tree #segment_tree #array #hash_table
Telegraph
subarrays-distinct-element-sum-of-squares-i
给你一个下标从 0 开始的整数数组 nums 。 定义 nums 一个子数组的 不同计数 值如下:
leetcode.com 2026-10-15
🟢2913.subarrays-distinct-element-sum-of-squares-i
🏷️ Tags
#binary_indexed_tree #segment_tree #array #hash_table
🟢2913.subarrays-distinct-element-sum-of-squares-i
🏷️ Tags
#binary_indexed_tree #segment_tree #array #hash_table
Telegraph
subarrays-distinct-element-sum-of-squares-i
You are given a 0-indexed integer array nums. The distinct count of a subarray of nums is defined as:
leetcode.cn 2026-10-16
🔴2916.subarrays-distinct-element-sum-of-squares-ii
🏷️ Tags
#binary_indexed_tree #segment_tree #array #hash_table
🔴2916.subarrays-distinct-element-sum-of-squares-ii
🏷️ Tags
#binary_indexed_tree #segment_tree #array #hash_table
Telegraph
subarrays-distinct-element-sum-of-squares-ii
给你一个下标从 0 开始的整数数组 nums 。 定义 nums 一个子数组的 不同计数 值如下:
leetcode.com 2026-10-16
🔴2916.subarrays-distinct-element-sum-of-squares-ii
🏷️ Tags
#binary_indexed_tree #segment_tree #array #hash_table
🔴2916.subarrays-distinct-element-sum-of-squares-ii
🏷️ Tags
#binary_indexed_tree #segment_tree #array #hash_table
Telegraph
subarrays-distinct-element-sum-of-squares-ii
You are given a 0-indexed integer array nums. The distinct count of a subarray of nums is defined as: