Codestin Search App

Practice › LeetCode › LeetCode 36xx ›

LeetCode 3671 - Sum of Beautiful Subsequences

LeetCode Problem 3671 Difficulty: 🔴 Hard Topics: Array, Math, Binary Indexed Tree, Number Theory Solution Problem Understanding Let a subsequence of nums be any sequence multiples. citeturn0search1turn0search2 check whether it is strictly increasing, compute its GCD, and add that GCD to the answer. This is correct because every valid subsequence is examined exactly once. Unfortunately, there are 2^n subsequences. Even for `n = um queries efficiently. citeturn0search1turn0 Force | O(2^n...

Practice › LeetCode › LeetCode 35xx ›

LeetCode 3520 - Minimum Threshold for Inversion Pairs Count

LeetCode Problem 3520 Difficulty: 🟡 Medium Topics: Array, Binary Search, Binary Indexed Tree, Segment Tree Solution Problem Understanding The problem asks us to find the minimum threshold x such that there are at least k inversion pairs in an array nums of integers. An inversion pair (i, j) is defined by three conditions: first, the indices satisfy i < j ; second, the values satisfy nums[i] > nums[j] ; and...

Practice › LeetCode › LeetCode 35xx ›

LeetCode 3515 - Shortest Path in a Weighted Tree

LeetCode Problem 3515 Difficulty: 🔴 Hard Topics: Array, Tree, Depth-First Search, Binary Indexed Tree, Segment Tree Solution LeetCode 3515. Shortest Path in a Weighted Tree Problem Understanding We are given a weighted tree with n nodes, rooted at node 1 . A tree has exactly one simple path between any pair of nodes. Since the tree is rooted at node 1 , every node has a unique path from the...

Practice › LeetCode › LeetCode 27xx ›

LeetCode 2736 - Maximum Sum Queries

LeetCode Problem 2736 Difficulty: 🔴 Hard Topics: Array, Binary Search, Stack, Binary Indexed Tree, Segment Tree, Sorting, Monotonic Stack Solution LeetCode 2736 - Maximum Sum Queries Problem Understanding We are given two arrays, nums1 and nums2 , both of length n . Each index j represents a point: $$(nums1[j], nums2[j])$$ and has an associated value: $$nums1[j] + nums2[j]$$ For every query [xi, yi] , we must find an index j...

Practice › LeetCode › LeetCode 33xx ›

LeetCode 3382 - Maximum Area Rectangle With Point Constraints II

LeetCode Problem 3382 Difficulty: 🔴 Hard Topics: Array, Math, Binary Indexed Tree, Segment Tree, Geometry, Sorting Solution Problem Understanding The problem asks us to find the maximum area rectangle that can be formed from a given set of points on a 2D plane, under strict constraints. Each rectangle must have its edges parallel to the x and y axes, must use exactly four points from the input as corners, and...

Practice › LeetCode › LeetCode 29xx ›

LeetCode 2916 - Subarrays Distinct Element Sum of Squares II

LeetCode Problem 2916 Difficulty: 🔴 Hard Topics: Array, Dynamic Programming, Binary Indexed Tree, Segment Tree Solution Problem Understanding The problem asks us to consider every possible non-empty subarray of the input array nums . For each subarray, we compute how many distinct values appear inside it. We then square that distinct count, and finally sum the squared values across all subarrays. Formally, if a subarray contains k distinct elements, then...

Practice › LeetCode › LeetCode 24xx ›

LeetCode 2426 - Number of Pairs Satisfying Inequality

LeetCode Problem 2426 Difficulty: 🔴 Hard Topics: Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set Solution LeetCode 2426 - Number of Pairs Satisfying Inequality Problem Understanding We are given two integer arrays, nums1 and nums2 , of the same length n , along with an integer diff . We must count how many index pairs (i, j) satisfy both: i < j nums1[i]...

Practice › LeetCode › LeetCode 29xx ›

LeetCode 2926 - Maximum Balanced Subsequence Sum

LeetCode Problem 2926 Difficulty: 🔴 Hard Topics: Array, Binary Search, Dynamic Programming, Binary Indexed Tree, Segment Tree Solution Problem Understanding This problem asks us to find the maximum sum of a balanced subsequence from a given integer array nums . A subsequence is a selection of elements from the array in their original order, possibly skipping elements. A subsequence is balanced if, for every pair of consecutive indices i and...

Practice › LeetCode › LeetCode 19xx ›

LeetCode 1964 - Find the Longest Valid Obstacle Course at Each Position

LeetCode Problem 1964 Difficulty: 🔴 Hard Topics: Array, Binary Search, Binary Indexed Tree Solution LeetCode 1964, Find the Longest Valid Obstacle Course at Each Position Problem Understanding The problem gives an array obstacles , where each value represents the height of an obstacle. For every position i , we must determine the length of the longest valid obstacle course that ends exactly at index i . A valid obstacle course...

Practice › LeetCode › LeetCode 24xx ›

LeetCode 2424 - Longest Uploaded Prefix

LeetCode Problem 2424 Difficulty: 🟡 Medium Topics: Hash Table, Binary Search, Union-Find, Design, Binary Indexed Tree, Segment Tree, Heap (Priority Queue), Ordered Set Solution Problem Understanding The problem asks us to design a data structure that tracks uploaded videos and continuously reports the length of the longest uploaded prefix. A prefix of uploaded videos means that every video from 1 through i has already been uploaded. The goal is to...

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 31xx ›

LeetCode 3161 - Block Placement Queries

LeetCode Problem 3161 Difficulty: 🔴 Hard Topics: Array, Binary Search, Binary Indexed Tree, Segment Tree Solution Problem Understanding The problem involves simulating operations on an infinite number line starting at 0 and extending towards the positive x-axis. There are two types of queries: placing obstacles at certain points, and checking whether a block of a given size can fit anywhere in the range [0, x] without overlapping any obstacles. A...

Practice › LeetCode › LeetCode 21xx ›

LeetCode 2193 - Minimum Number of Moves to Make Palindrome

LeetCode Problem 2193 Difficulty: 🔴 Hard Topics: Two Pointers, String, Greedy, Binary Indexed Tree Solution LeetCode 2193 - Minimum Number of Moves to Make Palindrome Problem Understanding This problem asks us to transform a given string into a palindrome using the minimum number of adjacent swaps. A palindrome is a string that reads the same forward and backward. For example, "abba" and "racecar" are palindromes. The only operation allowed is...

Practice › LeetCode › LeetCode 30xx ›

LeetCode 3072 - Distribute Elements Into Two Arrays II

LeetCode Problem 3072 Difficulty: 🔴 Hard Topics: Array, Binary Indexed Tree, Segment Tree, Simulation Solution Problem Understanding This problem requires simulating the distribution of elements from a 1-indexed array nums into two separate arrays arr1 and arr2 under specific rules. Each element in nums is assigned sequentially to one of the arrays according to a comparison of how many elements in each array are strictly greater than the current element....

Practice › LeetCode › LeetCode 21xx ›

LeetCode 2179 - Count Good Triplets in an Array

LeetCode Problem 2179 Difficulty: 🔴 Hard Topics: Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set Solution Problem Understanding In this problem, we are given two arrays, nums1 and nums2 , each containing every integer from 0 to n - 1 exactly once. In other words, both arrays are permutations of the same set of values. We need to count how many triplets (x,...

Practice › LeetCode › LeetCode 33xx ›

LeetCode 3380 - Maximum Area Rectangle With Point Constraints I

LeetCode Problem 3380 Difficulty: 🟡 Medium Topics: Array, Math, Binary Indexed Tree, Segment Tree, Geometry, Sorting, Enumeration Solution LeetCode 3380 - Maximum Area Rectangle With Point Constraints I Problem Understanding The problem gives us a set of unique points on a 2D plane. We need to determine the largest possible axis-aligned rectangle that can be formed using exactly four of those points as its corners. An axis-aligned rectangle means: The...

Practice › LeetCode › LeetCode 22xx ›

LeetCode 2250 - Count Number of Rectangles Containing Each Point

LeetCode Problem 2250 Difficulty: 🟡 Medium Topics: Array, Hash Table, Binary Search, Binary Indexed Tree, Sorting Solution Here is the complete, detailed technical solution guide for LeetCode 2250 - Count Number of Rectangles Containing Each Point in a single, comprehensive response. Problem Understanding The problem provides two arrays: rectangles and points . Each element of rectangles is [li, hi] , representing a rectangle with its bottom-left corner at (0, 0)...

Practice › LeetCode › LeetCode 32xx ›

LeetCode 3245 - Alternating Groups III

LeetCode Problem 3245 Difficulty: 🔴 Hard Topics: Array, Binary Indexed Tree, Ordered Set Solution Problem Understanding We are given a circular array called colors , where each element is either 0 or 1 . These represent red and blue tiles arranged in a ring, which means index 0 and index n - 1 are adjacent. A group is considered alternating if every adjacent pair inside that contiguous segment has different...

Practice › LeetCode › LeetCode 31xx ›

LeetCode 3187 - Peaks in Array

LeetCode Problem 3187 Difficulty: 🔴 Hard Topics: Array, Binary Indexed Tree, Segment Tree Solution Problem Understanding The problem asks us to process two kinds of operations on an integer array: Query how many peaks exist inside a subarray. Update a single element in the array. A peak is defined as an element that is strictly greater than both its immediate neighbors. Formally, an index i is a peak if: $nums[i]...

Practice › LeetCode › LeetCode 31xx ›

LeetCode 3109 - Find the Index of Permutation

LeetCode Problem 3109 Difficulty: 🟡 Medium Topics: Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set Solution Problem Understanding The problem gives us a permutation perm of the integers [1, 2, ..., n] . A permutation is simply an arrangement of all numbers from 1 to n where each number appears exactly once. We are asked to determine the lexicographic index of this permutation...

Practice › LeetCode › LeetCode 25xx ›

LeetCode 2519 - Count the Number of K-Big Indices

LeetCode Problem 2519 Difficulty: 🔴 Hard Topics: Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set Solution LeetCode 2519 - Count the Number of K-Big Indices Problem Understanding This problem asks us to determine how many indices in an array satisfy a very specific condition related to smaller values on both sides. For an index i to be considered k-big , two separate requirements...

Practice › LeetCode › LeetCode 29xx ›

LeetCode 2940 - Find Building Where Alice and Bob Can Meet

LeetCode Problem 2940 Difficulty: 🔴 Hard Topics: Array, Binary Search, Stack, Binary Indexed Tree, Segment Tree, Heap (Priority Queue), Monotonic Stack Solution Problem Understanding You are given an array heights , where each index represents a building and the value represents that building's height. A person standing at building i can move only to the right, meaning to some building j where j > i , and only if the...

Practice › LeetCode › LeetCode 22xx ›

LeetCode 2286 - Booking Concert Tickets in Groups

LeetCode Problem 2286 Difficulty: 🔴 Hard Topics: Binary Search, Design, Binary Indexed Tree, Segment Tree Solution Problem Understanding The problem asks us to design a ticket reservation system for a concert hall. The hall contains n rows, and each row contains exactly m seats. Seats in every row are numbered from left to right starting at 0 . We must support two different operations: The first operation, gather(k, maxRow) ,...

Practice › LeetCode › LeetCode 30xx ›

LeetCode 3009 - Maximum Number of Intersections on the Chart

LeetCode Problem 3009 Difficulty: 🔴 Hard Topics: Array, Hash Table, Math, Binary Indexed Tree, Geometry, Sweep Line, Sorting Solution I can provide the full guide, but I want to avoid giving you a technically incorrect reference document. For LeetCode 3009 , there are two subtly different interpretations that materially change the optimal algorithm and correctness proof: whether intersections at a chart vertex (k, y[k]) count once or twice when both...

Practice › LeetCode › LeetCode 25xx ›

LeetCode 2552 - Count Increasing Quadruplets

LeetCode Problem 2552 Difficulty: 🔴 Hard Topics: Array, Dynamic Programming, Binary Indexed Tree, Enumeration, Prefix Sum Solution Problem Understanding The problem asks us to count the number of increasing quadruplets (i, j, k, l) in a 0-indexed array nums of size n , where nums is a permutation of the integers from 1 to n . A quadruplet is considered increasing if it satisfies both the index order 0 <=...

Practice › LeetCode › LeetCode 26xx ›

LeetCode 2659 - Make Array Empty

LeetCode Problem 2659 Difficulty: 🔴 Hard Topics: Array, Binary Search, Greedy, Binary Indexed Tree, Segment Tree, Sorting, Ordered Set Solution LeetCode 2659 - Make Array Empty Problem Understanding The problem gives us an array of distinct integers and defines two possible operations: If the first element is currently the smallest value in the array, we remove it. Otherwise, we move the first element to the end of the array. We...

Practice › LeetCode › LeetCode 04xx ›

LeetCode 493 - Reverse Pairs

LeetCode Problem 493 Difficulty: 🔴 Hard Topics: Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set Solution Problem Understanding The problem asks us to count how many pairs of indices (i, j) satisfy two conditions: i < j nums[i] > 2 * nums[j] These pairs are called reverse pairs. Unlike the classic inversion count problem, where we check whether nums[i] > nums[j] , this...

Practice › LeetCode › LeetCode 03xx ›

LeetCode 308 - Range Sum Query 2D - Mutable

LeetCode Problem 308 Difficulty: 🟡 Medium Topics: Array, Design, Binary Indexed Tree, Segment Tree, Matrix Solution Problem Understanding The problem asks us to design a mutable 2D range sum data structure. We are given a matrix of integers, and we must support two operations efficiently: Update the value at a specific cell. Compute the sum of all values inside a rectangular submatrix. The rectangle is defined by two corners: Upper-left...

Practice › LeetCode › LeetCode 03xx ›

LeetCode 327 - Count of Range Sum

LeetCode Problem 327 Difficulty: 🔴 Hard Topics: Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set Solution LeetCode 327 - Count of Range Sum Problem Understanding This problem asks us to count how many subarrays have sums that fall within a given inclusive range [lower, upper] . A range sum S(i, j) represents the sum of all elements from index i through index j...

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 16xx ›

LeetCode 1649 - Create Sorted Array through Instructions

LeetCode Problem 1649 Difficulty: 🔴 Hard Topics: Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set Solution Problem Understanding The problem asks us to simulate building a sorted array incrementally. We process the instructions array from left to right, and for each value, we insert it into a container called nums while maintaining sorted order. However, the actual insertion is not the difficult part....

Practice › LeetCode › LeetCode 06xx ›

LeetCode 673 - Number of Longest Increasing Subsequence

LeetCode Problem 673 Difficulty: 🟡 Medium Topics: Array, Dynamic Programming, Binary Indexed Tree, Segment Tree Solution Problem Understanding The problem asks us to determine how many longest strictly increasing subsequences exist in a given integer array. A subsequence is formed by deleting zero or more elements without changing the relative order of the remaining elements. For example, from [1,3,5,4,7] , the subsequence [1,3,4,7] is valid because the order is preserved....

Practice › LeetCode › LeetCode 29xx ›

LeetCode 2921 - Maximum Profitable Triplets With Increasing Prices II

LeetCode Problem 2921 Difficulty: 🔴 Hard Topics: Array, Binary Indexed Tree, Segment Tree Solution Problem Understanding The problem asks us to select three items from a store such that their prices are strictly increasing and their indices are in order, i.e., if we pick items i , j , and k , we must have i < j < k and prices[i] < prices[j] < prices[k] . Each item also...

Practice › LeetCode › LeetCode 29xx ›

LeetCode 2907 - Maximum Profitable Triplets With Increasing Prices I

LeetCode Problem 2907 Difficulty: 🟡 Medium Topics: Array, Binary Indexed Tree, Segment Tree Solution LeetCode 2907 - Maximum Profitable Triplets With Increasing Prices I Problem Understanding This problem asks us to select exactly three items from a store while satisfying both an index ordering condition and a strictly increasing price condition. We are given two arrays: prices[i] represents the price of the i th item profits[i] represents the profit earned...

Practice › LeetCode › LeetCode 03xx ›

LeetCode 307 - Range Sum Query - Mutable

LeetCode Problem 307 Difficulty: 🟡 Medium Topics: Array, Divide and Conquer, Design, Binary Indexed Tree, Segment Tree Solution Problem Understanding The problem asks us to design a mutable range sum data structure. We are given an integer array nums , and we must efficiently support two operations: Updating the value at a specific index. Querying the sum of elements within a range [left, right] . The important detail is that...

Practice › LeetCode › LeetCode 03xx ›

LeetCode 315 - Count of Smaller Numbers After Self

LeetCode Problem 315 Difficulty: 🔴 Hard Topics: Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set Solution Problem Understanding The problem asks us to compute, for every element in the array, how many elements to its right are strictly smaller than it. Given an array nums , we must return another array counts of the same length. For each index i , counts[i] represents...

Practice › LeetCode › LeetCode 14xx ›

LeetCode 1409 - Queries on a Permutation With Key

LeetCode Problem 1409 Difficulty: 🟡 Medium Topics: Array, Binary Indexed Tree, Simulation Solution Problem Understanding This problem asks us to simulate a dynamic permutation of integers and answer position queries as elements continuously move. Initially, we are given a permutation: P = [1, 2, 3, ..., m] For every value in the queries array, we must perform two operations: Find the current position of queries[i] in the permutation P ,...

Practice › LeetCode › LeetCode 02xx ›

LeetCode 218 - The Skyline Problem

LeetCode Problem 218 Difficulty: 🔴 Hard Topics: Array, Divide and Conquer, Binary Indexed Tree, Segment Tree, Sweep Line, Sorting, Heap (Priority Queue), Ordered Set Solution Problem Understanding The Skyline Problem asks us to compute the visible outer contour formed by a collection of rectangular buildings when viewed from far away. Each building is represented by three integers: a left x-coordinate, a right x-coordinate, and a height. The buildings sit on...

Practice › LeetCode › LeetCode 11xx ›

LeetCode 1157 - Online Majority Element In Subarray

LeetCode Problem 1157 Difficulty: 🔴 Hard Topics: Array, Binary Search, Design, Binary Indexed Tree, Segment Tree Solution Problem Understanding The problem asks us to design a data structure that can efficiently answer majority element queries on subarrays of a given array. Specifically, given an array arr and multiple queries of the form (left, right, threshold) , the goal is to find an element within the subarray arr[left...right] that occurs at...

Practice › LeetCode › LeetCode 04xx ›

LeetCode 406 - Queue Reconstruction by Height

LeetCode Problem 406 Difficulty: 🟡 Medium Topics: Array, Binary Indexed Tree, Segment Tree, Sorting Solution LeetCode 406 - Queue Reconstruction by Height Problem Understanding This problem gives us a list of people where each person is represented as a pair [h, k] . The value h represents the person's height. The value k represents how many people standing in front of this person must have a height greater than or...

Practice › LeetCode › LeetCode 15xx ›

LeetCode 1505 - Minimum Possible Integer After at Most K Adjacent Swaps On Digits

LeetCode Problem 1505 Difficulty: 🔴 Hard Topics: String, Greedy, Binary Indexed Tree, Segment Tree Solution Problem Understanding The problem gives us a numeric string num and an integer k . Each operation allows us to swap two adjacent digits. We may perform at most k such swaps, and the goal is to construct the smallest possible integer, returned as a string. The important detail is that swaps are only allowed...

Practice › LeetCode › LeetCode 13xx ›

LeetCode 1395 - Count Number of Teams

LeetCode Problem 1395 Difficulty: 🟡 Medium Topics: Array, Dynamic Programming, Binary Indexed Tree, Segment Tree Solution Problem Understanding The problem asks us to count the number of valid teams of three soldiers from a line of n soldiers, where each soldier has a unique rating. A valid team consists of three indices (i, j, k) such that the ratings are strictly increasing ( rating[i] < rating[j] < rating[k] ) or...

Practice › LeetCode › LeetCode 20xx ›

LeetCode 2031 - Count Subarrays With More Ones Than Zeros

LeetCode Problem 2031 Difficulty: 🟡 Medium Topics: Array, Hash Table, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set Solution Problem Understanding This problem asks us to count all subarrays of a binary array nums that contain more 1 s than 0 s. In other words, for any contiguous slice of the array, if the number of 1 s exceeds the number of 0 s,...

Practice › LeetCode › LeetCode (archived) › LeetCode 04xx ›

LeetCode 493: Reverse Pairs

Problem Restatement We are given an integer array nums . We need to count pairs of indices (i, j) such that: 0 <= i < j < nums.length and: nums[i] > 2 * nums[j] These are called reverse pairs. The input length can be up to 5 * 10^4 , and values may be negative or as large as 32-bit signed integers. Input and Output Item Meaning Input Integer array...

Practice › LeetCode › LeetCode (archived) › LeetCode 03xx ›

LeetCode 315: Count of Smaller Numbers After Self

Problem Restatement We are given an integer array nums . For each index i , count how many numbers to the right of nums[i] are smaller than nums[i] . Return an array counts , where: counts[i] = number of smaller elements to the right of nums[i] For example, in: nums = [5, 2, 6, 1] the answer is: [2, 1, 1, 0] because: Index Value Smaller values to the right...

Practice › LeetCode › LeetCode (archived) › LeetCode 03xx ›

LeetCode 308: Range Sum Query 2D - Mutable

Problem Restatement We are given a 2D integer matrix. We need to implement a class called NumMatrix that supports two operations: Operation Meaning update(row, col, val) Change matrix[row][col] to val sumRegion(row1, col1, row2, col2) Return the sum of all cells inside the rectangle The rectangle is inclusive. Unlike LeetCode 304, the matrix can change after construction. So a fixed 2D prefix sum matrix is no longer enough. Input and Output...

Practice › LeetCode › LeetCode (archived) › LeetCode 03xx ›

LeetCode 307: Range Sum Query - Mutable

Problem Restatement We are given an integer array nums . We need to implement a class called NumArray that supports two operations: Operation Meaning update(index, val) Change nums[index] to val sumRange(left, right) Return the sum from left through right , inclusive Unlike LeetCode 303, the array is mutable. Values can change after initialization. The official problem expects many updates and many range queries, so recomputing sums from scratch every time...

#binary-indexed-tree

LeetCode 3671 - Sum of Beautiful Subsequences

LeetCode 3520 - Minimum Threshold for Inversion Pairs Count

LeetCode 3515 - Shortest Path in a Weighted Tree

LeetCode 2736 - Maximum Sum Queries

LeetCode 3382 - Maximum Area Rectangle With Point Constraints II

LeetCode 2916 - Subarrays Distinct Element Sum of Squares II

LeetCode 2426 - Number of Pairs Satisfying Inequality

LeetCode 2926 - Maximum Balanced Subsequence Sum

LeetCode 1964 - Find the Longest Valid Obstacle Course at Each Position

LeetCode 2424 - Longest Uploaded Prefix

LeetCode 2407 - Longest Increasing Subsequence II

LeetCode 3161 - Block Placement Queries

LeetCode 2193 - Minimum Number of Moves to Make Palindrome

LeetCode 3072 - Distribute Elements Into Two Arrays II

LeetCode 2179 - Count Good Triplets in an Array

LeetCode 3380 - Maximum Area Rectangle With Point Constraints I

LeetCode 2250 - Count Number of Rectangles Containing Each Point

LeetCode 3245 - Alternating Groups III

LeetCode 3187 - Peaks in Array

LeetCode 3109 - Find the Index of Permutation

LeetCode 2519 - Count the Number of K-Big Indices

LeetCode 2940 - Find Building Where Alice and Bob Can Meet

LeetCode 2286 - Booking Concert Tickets in Groups

LeetCode 3009 - Maximum Number of Intersections on the Chart

LeetCode 2552 - Count Increasing Quadruplets

LeetCode 2659 - Make Array Empty

LeetCode 493 - Reverse Pairs

LeetCode 308 - Range Sum Query 2D - Mutable

LeetCode 327 - Count of Range Sum

LeetCode 683 - K Empty Slots

LeetCode 1649 - Create Sorted Array through Instructions

LeetCode 673 - Number of Longest Increasing Subsequence

LeetCode 2921 - Maximum Profitable Triplets With Increasing Prices II

LeetCode 2907 - Maximum Profitable Triplets With Increasing Prices I

LeetCode 307 - Range Sum Query - Mutable

LeetCode 315 - Count of Smaller Numbers After Self

LeetCode 1409 - Queries on a Permutation With Key

LeetCode 218 - The Skyline Problem

LeetCode 1157 - Online Majority Element In Subarray

LeetCode 406 - Queue Reconstruction by Height

LeetCode 1505 - Minimum Possible Integer After at Most K Adjacent Swaps On Digits

LeetCode 1395 - Count Number of Teams

LeetCode 2031 - Count Subarrays With More Ones Than Zeros

LeetCode 493: Reverse Pairs

LeetCode 315: Count of Smaller Numbers After Self

LeetCode 308: Range Sum Query 2D - Mutable

LeetCode 307: Range Sum Query - Mutable