leetcode.com 2026-11-09
🔴1606.find-servers-that-handled-most-number-of-requests
🏷️ Tags
#array #ordered_set #simulation #heap_priority_queue
🔴1606.find-servers-that-handled-most-number-of-requests
🏷️ Tags
#array #ordered_set #simulation #heap_priority_queue
Telegraph
find-servers-that-handled-most-number-of-requests
You have k servers numbered from 0 to k-1 that are being used to handle multiple requests simultaneously. Each server has infinite computational capacity but cannot handle more than one request at a time. The requests are assigned to servers according to…
leetcode.cn 2026-11-12
🟢3105.longest-strictly-increasing-or-strictly-decreasing-subarray
🏷️ Tags
#array
🟢3105.longest-strictly-increasing-or-strictly-decreasing-subarray
🏷️ Tags
#array
Telegraph
longest-strictly-increasing-or-strictly-decreasing-subarray
给你一个整数数组 nums 。 返回数组 nums 中 严格递增 或 严格递减 的最长非空子数组的长度。 示例 1: 输入:nums = [1,4,3,3,2] 输出:2 解释: nums 中严格递增的子数组有[1]、[2]、[3]、[3]、[4] 以及 [1,4] 。 nums 中严格递减的子数组有[1]、[2]、[3]、[3]、[4]、[3,2] 以及 [4,3] 。 因此,返回 2 。 示例 2: 输入:nums = [3,3,3,3] 输出:1 解释: nums 中严格递增的子数组有 [3]、[3]、[3]…
leetcode.com 2026-11-12
🟢3105.longest-strictly-increasing-or-strictly-decreasing-subarray
🏷️ Tags
#array
🟢3105.longest-strictly-increasing-or-strictly-decreasing-subarray
🏷️ Tags
#array
Telegraph
longest-strictly-increasing-or-strictly-decreasing-subarray
You are given an array of integers nums. Return the length of the longest subarray of nums which is either strictly increasing or strictly decreasing. Example 1: Input: nums = [1,4,3,3,2] Output: 2 Explanation: The strictly increasing subarrays of nums…
leetcode.cn 2026-11-13
🔴3420.count-non-decreasing-subarrays-after-k-operations
🏷️ Tags
#stack #segment_tree #queue #array #sliding_window #monotonic_queue #monotonic_stack
🔴3420.count-non-decreasing-subarrays-after-k-operations
🏷️ Tags
#stack #segment_tree #queue #array #sliding_window #monotonic_queue #monotonic_stack
Telegraph
count-non-decreasing-subarrays-after-k-operations
给你一个长度为 n 的数组 nums 和一个整数 k 。 对于 nums 中的每一个子数组,你可以对它进行 至多 k 次操作。每次操作中,你可以将子数组中的任意一个元素增加 1 。 注意 ,每个子数组都是独立的,也就是说你对一个子数组的修改不会保留到另一个子数组中。 请你返回最多 k 次操作以内,有多少个子数组可以变成 非递减 的。 如果一个数组中的每一个元素都大于等于前一个元素(如果前一个元素存在),那么我们称这个数组是 非递减 的。 示例 1: 输入:nums = [6,3,1,2,4,4], k…
leetcode.com 2026-11-13
🔴3420.count-non-decreasing-subarrays-after-k-operations
🏷️ Tags
#stack #segment_tree #queue #array #sliding_window #monotonic_queue #monotonic_stack
🔴3420.count-non-decreasing-subarrays-after-k-operations
🏷️ Tags
#stack #segment_tree #queue #array #sliding_window #monotonic_queue #monotonic_stack
Telegraph
count-non-decreasing-subarrays-after-k-operations
You are given an array nums of n integers and an integer k. For each subarray of nums, you can apply up to k operations on it. In each operation, you increment any element of the subarray by 1. Note that each subarray is considered independently, meaning…
leetcode.cn 2026-11-15
🟡1524.number-of-sub-arrays-with-odd-sum
🏷️ Tags
#array #math #dynamic_programming #prefix_sum
🟡1524.number-of-sub-arrays-with-odd-sum
🏷️ Tags
#array #math #dynamic_programming #prefix_sum
Telegraph
number-of-sub-arrays-with-odd-sum
给你一个整数数组 arr 。请你返回和为 奇数 的子数组数目。 由于答案可能会很大,请你将结果对 10^9 + 7 取余后返回。 示例 1: 输入:arr = [1,3,5] 输出:4 解释:所有的子数组为 [[1],[1,3],[1,3,5],[3],[3,5],[5]] 。 所有子数组的和为 [1,4,9,3,8,5]. 奇数和包括 [1,9,3,5] ,所以答案为 4 。 示例 2 : 输入:arr = [2,4,6] 输出:0 解释:所有子数组为 [[2],[2,4],[2,4,6],[4]…
leetcode.com 2026-11-15
🟡1524.number-of-sub-arrays-with-odd-sum
🏷️ Tags
#array #math #dynamic_programming #prefix_sum
🟡1524.number-of-sub-arrays-with-odd-sum
🏷️ Tags
#array #math #dynamic_programming #prefix_sum
Telegraph
number-of-sub-arrays-with-odd-sum
Given an array of integers arr, return the number of subarrays with an odd sum. Since the answer can be very large, return it modulo 109 + 7. Example 1: Input: arr = [1,3,5] Output: 4 Explanation: All subarrays are [[1],[1,3],[1,3,5],[3],[3,5],[5]] All…
leetcode.cn 2026-11-20
🔴3041.maximize-consecutive-elements-in-an-array-after-modification
🏷️ Tags
#array #dynamic_programming #sorting
🔴3041.maximize-consecutive-elements-in-an-array-after-modification
🏷️ Tags
#array #dynamic_programming #sorting
Telegraph
maximize-consecutive-elements-in-an-array-after-modification
给你一个下标从 0 开始只包含 正 整数的数组 nums 。 一开始,你可以将数组中 任意数量 元素增加 至多 1 。 修改后,你可以从最终数组中选择 一个或者更多 元素,并确保这些元素升序排序后是 连续 的。比方说,[3, 4, 5] 是连续的,但是 [3, 4, 6] 和 [1, 1, 2, 3] 不是连续的。 请你返回 最多 可以选出的元素数目。 示例 1: 输入:nums = [2,1,5,1,1] 输出:3 解释:我们将下标 0 和 3 处的元素增加 1 ,得到结果数组 nums = [3…
leetcode.com 2026-11-20
🔴3041.maximize-consecutive-elements-in-an-array-after-modification
🏷️ Tags
#array #dynamic_programming #sorting
🔴3041.maximize-consecutive-elements-in-an-array-after-modification
🏷️ Tags
#array #dynamic_programming #sorting
Telegraph
maximize-consecutive-elements-in-an-array-after-modification
You are given a 0-indexed array nums consisting of positive integers. Initially, you can increase the value of any element in the array by at most 1. After that, you need to select one or more elements from the final array such that those elements are consecutive…
leetcode.cn 2026-11-21
🟡3331.find-subtree-sizes-after-changes
🏷️ Tags
#tree #depth_first_search #array #hash_table #string
🟡3331.find-subtree-sizes-after-changes
🏷️ Tags
#tree #depth_first_search #array #hash_table #string
Telegraph
find-subtree-sizes-after-changes
给你一棵 n 个节点且根节点为编号 0 的树,节点编号为 0 到 n - 1 。这棵树用一个长度为 n 的数组 parent 表示,其中 parent[i] 是第 i 个节点的父亲节点的编号。由于节点 0 是根,parent[0] == -1 。 给你一个长度为 n 的字符串 s ,其中 s[i] 是节点 i 对应的字符。 对于节点编号从 1 到 n - 1 的每个节点 x ,我们 同时 执行以下操作 一次 :
leetcode.com 2026-11-21
🟡3331.find-subtree-sizes-after-changes
🏷️ Tags
#tree #depth_first_search #array #hash_table #string
🟡3331.find-subtree-sizes-after-changes
🏷️ Tags
#tree #depth_first_search #array #hash_table #string
Telegraph
find-subtree-sizes-after-changes
You are given a tree rooted at node 0 that consists of n nodes numbered from 0 to n - 1. The tree is represented by an array parent of size n, where parent[i] is the parent of node i. Since node 0 is the root, parent[0] == -1. You are also given a string…