monotonic-queue

Practice › LeetCode › LeetCode 38xx ›

LeetCode 3845 - Maximum Subarray XOR with Bounded Range

LeetCode Problem 3845 Difficulty: 🔴 Hard Topics: Array, Bit Manipulation, Trie, Queue, Sliding Window, Prefix Sum, Monotonic Queue Solution Problem Understanding The problem asks us to find a subarray of a given non-negative integer array nums such that the difference between the maximum and minimum elements of the subarray does not exceed a given integer k . Once such a subarray is chosen, we compute the XOR of all its...

Practice › LeetCode › LeetCode 38xx ›

LeetCode 3835 - Count Subarrays With Cost Less Than or Equal to K

LeetCode Problem 3835 Difficulty: 🟡 Medium Topics: Array, Queue, Monotonic Queue Solution LeetCode 3835 - Count Subarrays With Cost Less Than or Equal to K Problem Understanding We are given an array nums and an integer k . For every subarray nums[l..r] , its cost is defined as: $$(\max(nums[l..r]) - \min(nums[l..r])) \times (r-l+1)$$ The first part measures the range of values inside the subarray, while the second part measures the...

Practice › LeetCode › LeetCode 38xx ›

LeetCode 3826 - Minimum Partition Score

LeetCode Problem 3826 Difficulty: 🔴 Hard Topics: Array, Divide and Conquer, Dynamic Programming, Queue, Prefix Sum, Monotonic Queue Solution LeetCode 3826 - Minimum Partition Score Problem Understanding We are given an array nums and must divide it into exactly k contiguous subarrays. For every subarray, we first compute its sum: $$\text{sumArr} = \sum \text{elements in the subarray}$$ Its value is then defined as: $$\text{value} = \frac{\text{sumArr} \cdot (\text{sumArr}+1)}{2}$$ The score...

Practice › LeetCode › LeetCode 35xx ›

LeetCode 3589 - Count Prime-Gap Balanced Subarrays

LeetCode Problem 3589 Difficulty: 🟡 Medium Topics: Array, Math, Queue, Sliding Window, Number Theory, Monotonic Queue Solution Count Prime-Gap Balanced Subarrays Problem Understanding We are given an integer array nums and an integer k . We must count how many contiguous subarrays satisfy two conditions: The subarray contains at least two prime numbers. Among all prime numbers inside that subarray, the difference between the largest prime and the smallest prime...

Practice › LeetCode › LeetCode 35xx ›

LeetCode 3578 - Count Partitions With Max-Min Difference at Most K

LeetCode Problem 3578 Difficulty: 🟡 Medium Topics: Array, Dynamic Programming, Queue, Sliding Window, Prefix Sum, Monotonic Queue Solution LeetCode 3578 - Count Partitions With Max-Min Difference at Most K Problem Understanding We are given an array nums and an integer k . We want to split the array into one or more contiguous, non-empty segments. Every element must belong to exactly one segment, and the segments must preserve the original...

Practice › LeetCode › LeetCode 34xx ›

LeetCode 3420 - Count Non-Decreasing Subarrays After K Operations

LeetCode Problem 3420 Difficulty: 🔴 Hard Topics: Array, Stack, Segment Tree, Queue, Sliding Window, Monotonic Stack, Monotonic Queue Solution Problem Understanding You are given an array nums and a budget of at most k increment operations. For any chosen subarray, you may repeatedly pick an element inside that subarray and increase it by 1 . The goal is to determine whether that subarray can be transformed into a non-decreasing array...

Practice › LeetCode › LeetCode 23xx ›

LeetCode 2398 - Maximum Number of Robots Within Budget

LeetCode Problem 2398 Difficulty: 🔴 Hard Topics: Array, Binary Search, Queue, Sliding Window, Heap (Priority Queue), Prefix Sum, Monotonic Queue Solution Problem Understanding This problem asks us to determine the maximum number of consecutive robots that can be run without exceeding a given budget. We are given two arrays of length n : chargeTimes and runningCosts . For any consecutive subset of k robots, the total cost is computed as:...

Practice › LeetCode › LeetCode 24xx ›

LeetCode 2444 - Count Subarrays With Fixed Bounds

LeetCode Problem 2444 Difficulty: 🔴 Hard Topics: Array, Queue, Sliding Window, Monotonic Queue Solution Problem Understanding This problem asks us to count how many contiguous subarrays satisfy two exact boundary conditions at the same time: The minimum element in the subarray must be exactly minK . The maximum element in the subarray must be exactly maxK . The key detail is that these are exact matches , not inequalities. A...

Practice › LeetCode › LeetCode 24xx ›

LeetCode 2407 - Longest Increasing Subsequence II

LeetCode Problem 2407 Difficulty: 🔴 Hard Topics: Array, Divide and Conquer, Dynamic Programming, Binary Indexed Tree, Segment Tree, Queue, Monotonic Queue Solution Problem Understanding The problem asks us to find the length of the longest subsequence in an integer array nums such that the subsequence is strictly increasing and the difference between consecutive elements does not exceed a given integer k . A subsequence is formed by deleting zero or...

Practice › LeetCode › LeetCode 27xx ›

LeetCode 2762 - Continuous Subarrays

LeetCode Problem 2762 Difficulty: 🟡 Medium Topics: Array, Queue, Sliding Window, Heap (Priority Queue), Ordered Set, Monotonic Queue Solution That is a long, structured technical guide. To make sure I target the correct problem and avoid wasting your time, can you confirm the exact LeetCode problem title for 2762 ? I believe it is “Continuous Subarrays” , but I want to ensure I generate the full guide for the right...

Practice › LeetCode › LeetCode 29xx ›

LeetCode 2945 - Find Maximum Non-decreasing Array Length

LeetCode Problem 2945 Difficulty: 🔴 Hard Topics: Array, Binary Search, Dynamic Programming, Stack, Queue, Monotonic Stack, Monotonic Queue Solution Problem Understanding This problem asks us to determine the maximum length of a non-decreasing array that can be obtained from a given integer array nums by performing a sequence of subarray sum operations . In each operation, we can choose any contiguous subarray, replace it with a single element equal to...

Practice › LeetCode › LeetCode 20xx ›

LeetCode 2071 - Maximum Number of Tasks You Can Assign

LeetCode Problem 2071 Difficulty: 🔴 Hard Topics: Array, Two Pointers, Binary Search, Greedy, Queue, Sorting, Monotonic Queue Solution Problem Understanding This problem asks us to maximize the number of tasks that can be completed using a group of workers, where each worker can perform at most one task. Each task has a required strength value, and each worker has a current strength value. A worker can complete a task if...

Practice › LeetCode › LeetCode 29xx ›

LeetCode 2969 - Minimum Number of Coins for Fruits II

LeetCode Problem 2969 Difficulty: 🔴 Hard Topics: Array, Dynamic Programming, Queue, Heap (Priority Queue), Monotonic Queue Solution Problem Understanding The problem asks us to determine the minimum number of coins required to purchase all fruits in a market, given a special offer. You are provided with a 1-indexed array prices , where prices[i] denotes the number of coins needed to buy the ith fruit. The market has a special offer:...

Practice › LeetCode › LeetCode 29xx ›

LeetCode 2944 - Minimum Number of Coins for Fruits

LeetCode Problem 2944 Difficulty: 🟡 Medium Topics: Array, Dynamic Programming, Queue, Heap (Priority Queue), Monotonic Queue Solution Problem Understanding This problem asks us to determine the minimum number of coins required to acquire all fruits in a market where buying a fruit grants a special reward. You are given a 0-indexed array prices , where prices[i] represents the cost of purchasing the (i + 1) th fruit. The important twist...

Practice › LeetCode › LeetCode 14xx ›

LeetCode 1438 - Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit

LeetCode Problem 1438 Difficulty: 🟡 Medium Topics: Array, Queue, Sliding Window, Heap (Priority Queue), Ordered Set, Monotonic Queue Solution Problem Understanding The problem asks us to find the length of the longest contiguous subarray in an integer array nums such that the absolute difference between any two elements in that subarray does not exceed a given limit . In other words, for any valid subarray, if max_val is the maximum...

Practice › LeetCode › LeetCode 16xx ›

LeetCode 1687 - Delivering Boxes from Storage to Ports

LeetCode Problem 1687 Difficulty: 🔴 Hard Topics: Array, Dynamic Programming, Segment Tree, Queue, Heap (Priority Queue), Prefix Sum, Monotonic Queue Solution Problem Understanding This problem asks us to minimize the total number of ship trips required to deliver boxes from storage to ports, while respecting two constraints: The ship can carry at most maxBoxes boxes at once. The total weight of the loaded boxes cannot exceed maxWeight . The boxes...

Practice › LeetCode › LeetCode 02xx ›

LeetCode 239 - Sliding Window Maximum

LeetCode Problem 239 Difficulty: 🔴 Hard Topics: Array, Queue, Sliding Window, Heap (Priority Queue), Monotonic Queue Solution LeetCode 239 - Sliding Window Maximum Problem Understanding The problem gives us an integer array nums and a window size k . A sliding window of length k starts at the beginning of the array and moves one position to the right at a time. For every position of this window, we must...

Practice › LeetCode › LeetCode 16xx ›

LeetCode 1696 - Jump Game VI

LeetCode Problem 1696 Difficulty: 🟡 Medium Topics: Array, Dynamic Programming, Queue, Heap (Priority Queue), Monotonic Queue Solution Problem Understanding The problem gives us an integer array nums and a maximum jump distance k . We start at index 0 , and from any position i , we may jump forward to any index between i + 1 and i + k , as long as the destination remains inside the...

Practice › LeetCode › LeetCode 08xx ›

LeetCode 862 - Shortest Subarray with Sum at Least K

LeetCode Problem 862 Difficulty: 🔴 Hard Topics: Array, Binary Search, Queue, Sliding Window, Heap (Priority Queue), Prefix Sum, Monotonic Queue Solution Problem Understanding The problem asks us to find the length of the shortest contiguous subarray whose sum is at least k . We are given an integer array nums , which may contain both positive and negative numbers, and an integer k . We must return the minimum length...

Practice › LeetCode › LeetCode 14xx ›

LeetCode 1499 - Max Value of Equation

LeetCode Problem 1499 Difficulty: 🔴 Hard Topics: Array, Queue, Sliding Window, Heap (Priority Queue), Monotonic Queue Solution This guide will focus on the optimal monotonic queue solution, which achieves linear time complexity and is necessary to handle the input size limit of 10^5 . Problem Understanding We are given a list of 2D points sorted in strictly increasing order by their x-coordinate. Each point is represented as [xi, yi] ,...

Practice › LeetCode › LeetCode 09xx ›

LeetCode 918 - Maximum Sum Circular Subarray

LeetCode Problem 918 Difficulty: 🟡 Medium Topics: Array, Divide and Conquer, Dynamic Programming, Queue, Monotonic Queue Solution Problem Understanding The problem asks for the maximum sum of a subarray in a circular array . In simpler terms, we are given a list of integers nums where the end of the list wraps around to the start. We need to find a contiguous section of this list that has the highest...

Practice › LeetCode › LeetCode 14xx ›

LeetCode 1425 - Constrained Subsequence Sum

LeetCode Problem 1425 Difficulty: 🔴 Hard Topics: Array, Dynamic Programming, Queue, Sliding Window, Heap (Priority Queue), Monotonic Queue Solution That is a long, structured reference document. To make sure I target the exact problem correctly, please confirm the LeetCode problem number and title one more time. You mentioned LeetCode 1425 - Constrained Subsequence Sum , but the required output format is extensive, and I want to avoid generating a full...

Practice › LeetCode › LeetCode 06xx ›

LeetCode 683 - K Empty Slots

LeetCode Problem 683 Difficulty: 🔴 Hard Topics: Array, Binary Indexed Tree, Segment Tree, Queue, Sliding Window, Heap (Priority Queue), Ordered Set, Monotonic Queue Solution Let's go through a complete, detailed technical solution guide for LeetCode 683 - K Empty Slots following your formatting instructions. Problem Understanding The problem asks us to find the earliest day when there are exactly k bulbs turned off between two bulbs that are turned on....

Practice › LeetCode › LeetCode (archived) › LeetCode 08xx ›

LeetCode 862: Shortest Subarray with Sum at Least K

Problem Restatement We are given an integer array nums and an integer k . We need to return the length of the shortest non-empty contiguous subarray whose sum is at least k . If no such subarray exists, return -1 . A subarray must be contiguous. We cannot skip elements. Input and Output Item Meaning Input nums , an integer array Input k , the target minimum sum Output The...

Practice › LeetCode › LeetCode (archived) › LeetCode 02xx ›

LeetCode 239: Sliding Window Maximum

Problem Restatement We are given an integer array nums and an integer k . There is a sliding window of size k . It starts at the left side of the array and moves one position to the right each time. For each window, we need to return the maximum value inside that window. LeetCode gives this example: Input: nums = [1,3,-1,-3,5,3,6,7], k = 3 Output: [3,3,5,5,6,7] The constraints allow...

#monotonic-queue

LeetCode 3845 - Maximum Subarray XOR with Bounded Range

LeetCode 3835 - Count Subarrays With Cost Less Than or Equal to K

LeetCode 3826 - Minimum Partition Score

LeetCode 3589 - Count Prime-Gap Balanced Subarrays

LeetCode 3578 - Count Partitions With Max-Min Difference at Most K

LeetCode 3420 - Count Non-Decreasing Subarrays After K Operations

LeetCode 2398 - Maximum Number of Robots Within Budget

LeetCode 2444 - Count Subarrays With Fixed Bounds

LeetCode 2407 - Longest Increasing Subsequence II

LeetCode 2762 - Continuous Subarrays

LeetCode 2945 - Find Maximum Non-decreasing Array Length

LeetCode 2071 - Maximum Number of Tasks You Can Assign

LeetCode 2969 - Minimum Number of Coins for Fruits II

LeetCode 2944 - Minimum Number of Coins for Fruits

LeetCode 1438 - Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit

LeetCode 1687 - Delivering Boxes from Storage to Ports

LeetCode 239 - Sliding Window Maximum

LeetCode 1696 - Jump Game VI

LeetCode 862 - Shortest Subarray with Sum at Least K

LeetCode 1499 - Max Value of Equation

LeetCode 918 - Maximum Sum Circular Subarray

LeetCode 1425 - Constrained Subsequence Sum

LeetCode 683 - K Empty Slots

LeetCode 862: Shortest Subarray with Sum at Least K

LeetCode 239: Sliding Window Maximum