leetcode.com 2026-02-10
🟡3719.longest-balanced-subarray-i
🏷️ Tags
#segment_tree #array #hash_table #divide_and_conquer #prefix_sum
🟡3719.longest-balanced-subarray-i
🏷️ Tags
#segment_tree #array #hash_table #divide_and_conquer #prefix_sum
Telegraph
longest-balanced-subarray-i
You are given an integer array nums. A subarray is called balanced if the number of distinct even numbers in the subarray is equal to the number of distinct odd numbers. Return the length of the longest balanced subarray. Example 1: Input: nums = [2,5,4…
leetcode.cn 2026-02-11
🔴3721.longest-balanced-subarray-ii
🏷️ Tags
#segment_tree #array #hash_table #divide_and_conquer #prefix_sum
🔴3721.longest-balanced-subarray-ii
🏷️ Tags
#segment_tree #array #hash_table #divide_and_conquer #prefix_sum
Telegraph
longest-balanced-subarray-ii
给你一个整数数组 nums。
leetcode.com 2026-02-11
🔴3721.longest-balanced-subarray-ii
🏷️ Tags
#segment_tree #array #hash_table #divide_and_conquer #prefix_sum
🔴3721.longest-balanced-subarray-ii
🏷️ Tags
#segment_tree #array #hash_table #divide_and_conquer #prefix_sum
Telegraph
longest-balanced-subarray-ii
You are given an integer array nums. A subarray is called balanced if the number of distinct even numbers in the subarray is equal to the number of distinct odd numbers. Return the length of the longest balanced subarray. Example 1: Input: nums = [2,5,4…
leetcode.cn 2026-05-30
🔴3161.block-placement-queries
🏷️ Tags
#binary_indexed_tree #segment_tree #array #binary_search
🔴3161.block-placement-queries
🏷️ Tags
#binary_indexed_tree #segment_tree #array #binary_search
Telegraph
block-placement-queries
有一条无限长的数轴,原点在 0 处,沿着 x 轴 正 方向无限延伸。 给你一个二维数组 queries ,它包含两种操作:
leetcode.com 2026-05-30
🔴3161.block-placement-queries
🏷️ Tags
#binary_indexed_tree #segment_tree #array #binary_search
🔴3161.block-placement-queries
🏷️ Tags
#binary_indexed_tree #segment_tree #array #binary_search
Telegraph
block-placement-queries
There exists an infinite number line, with its origin at 0 and extending towards the positive x-axis. You are given a 2D array queries, which contains two types of queries:
leetcode.cn 2026-06-10
🔴3691.maximum-total-subarray-value-ii
🏷️ Tags
#greedy #segment_tree #array #heap_priority_queue
🔴3691.maximum-total-subarray-value-ii
🏷️ Tags
#greedy #segment_tree #array #heap_priority_queue
Telegraph
maximum-total-subarray-value-ii
给你一个长度为 n 的整数数组 nums 和一个整数 k。
leetcode.com 2026-06-10
🔴3691.maximum-total-subarray-value-ii
🏷️ Tags
#greedy #segment_tree #array #heap_priority_queue
🔴3691.maximum-total-subarray-value-ii
🏷️ Tags
#greedy #segment_tree #array #heap_priority_queue
Telegraph
maximum-total-subarray-value-ii
You are given an integer array nums of length n and an integer k. You must select exactly k distinct non-empty subarrays nums[l..r] of nums. Subarrays may overlap, but the exact same subarray (same l and r) cannot be chosen more than once. The value of a…
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。