Ordered Set Problems

Ordered Set LeetCode Problems List

• 315. Count of Smaller Numbers After Self - Hard - Ordered SetGiven an integer array nums, return an integer array counts where counts[i] is the number of smaller elements to the right of nums[i].... Topics: Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set
• 456. 132 Pattern - Medium - Ordered SetGiven an array of n integers nums, a 132 pattern is a subsequence of three integers nums[i], nums[j] and nums[k] such that i < j < k and nums[i] < num... Topics: Array, Binary Search, Stack, Monotonic Stack, Ordered Set
• 3863. Power Grid Maintenance - Medium - Ordered SetYou are given an integer c representing c power stations, each with a unique identifier id from 1 to c (1‑based indexing). These stations are intercon... Topics: Array, Hash Table, Depth-First Search, Breadth-First Search, Union Find, Graph, Heap (Priority Queue), Ordered Set
• 715. Range Module - Hard - Ordered SetA Range Module is a module that tracks ranges of numbers. Design a data structure to track the ranges represented as half-open intervals and query abo... Topics: Design, Segment Tree, Ordered Set
• 699. Falling Squares - Hard - Ordered SetThere are several squares being dropped onto the X-axis of a 2D plane. You are given a 2D integer array positions where positions[i] = [lefti, sideLen... Topics: Array, Segment Tree, Ordered Set
• 885. Exam Room - Medium - Ordered SetThere is an exam room with n seats in a single row labeled from 0 to n - 1. When a student enters the room, they must sit in the seat that maximizes t... Topics: Design, Heap (Priority Queue), Ordered Set
• 2868. Continuous Subarrays - Medium - Ordered SetYou are given a 0-indexed integer array nums. A subarray of nums is called continuous if: Let i, i + 1, ..., j be the indices in the subarray. Then, f... Topics: Array, Queue, Sliding Window, Heap (Priority Queue), Ordered Set, Monotonic Queue
• 3790. Fruits Into Baskets II - Easy - Ordered SetYou are given two arrays of integers, fruits and baskets, each of length n, where fruits[i] represents the quantity of the ith type of fruit, and bask... Topics: Array, Binary Search, Segment Tree, Simulation, Ordered Set
• 218. The Skyline Problem - Hard - Ordered SetA city's skyline is the outer contour of the silhouette formed by all the buildings in that city when viewed from a distance. Given the locations and ... Topics: Array, Divide and Conquer, Binary Indexed Tree, Segment Tree, Line Sweep, Heap (Priority Queue), Ordered Set
• 2161. Stock Price Fluctuation - Medium - Ordered SetYou are given a stream of records about a particular stock. Each record contains a timestamp and the corresponding price of the stock at that timestam... Topics: Hash Table, Design, Heap (Priority Queue), Data Stream, Ordered Set
• 931. Maximum Frequency Stack - Hard - Ordered SetDesign a stack-like data structure to push elements to the stack and pop the most frequent element from the stack. Implement the FreqStack class: Freq... Topics: Hash Table, Stack, Design, Ordered Set
• 2357. Count Integers in Intervals - Hard - Ordered SetGiven an empty set of intervals, implement a data structure that can: Add an interval to the set of intervals. Count the number of integers that are p... Topics: Design, Segment Tree, Ordered Set
• 352. Data Stream as Disjoint Intervals - Hard - Ordered SetGiven a data stream input of non-negative integers a1, a2, ..., an, summarize the numbers seen so far as a list of disjoint intervals. Implement the S... Topics: Binary Search, Design, Ordered Set
• 220. Contains Duplicate III - Hard - Ordered SetYou are given an integer array nums and two integers indexDiff and valueDiff. Find a pair of indices (i, j) such that: i != j, abs(i - j) <= indexDiff... Topics: Array, Sliding Window, Sorting, Bucket Sort, Ordered Set
• 2162. Partition Array Into Two Arrays to Minimize Sum Difference - Hard - Ordered SetYou are given an integer array nums of 2 * n integers. You need to partition nums into two arrays of length n to minimize the absolute difference of t... Topics: Array, Two Pointers, Binary Search, Dynamic Programming, Bit Manipulation, Ordered Set, Bitmask
• 1549. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit - Medium - Ordered SetGiven an array of integers nums and an integer limit, return the size of the longest non-empty subarray such that the absolute difference between any ... Topics: Array, Queue, Sliding Window, Heap (Priority Queue), Ordered Set, Monotonic Queue
• 1957. Closest Room - Hard - Ordered SetThere is a hotel with n rooms. The rooms are represented by a 2D integer array rooms where rooms[i] = [roomIdi, sizei] denotes that there is a room wi... Topics: Array, Binary Search, Sorting, Ordered Set
• 2429. Design a Food Rating System - Medium - Ordered SetDesign a food rating system that can do the following: Modify the rating of a food item listed in the system. Return the highest-rated food item for a... Topics: Array, Hash Table, String, Design, Heap (Priority Queue), Ordered Set
• 327. Count of Range Sum - Hard - Ordered SetGiven an integer array nums and two integers lower and upper, return the number of range sums that lie in [lower, upper] inclusive. Range sum S(i, j) ... Topics: Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set
• 1946. Minimum Absolute Sum Difference - Medium - Ordered SetYou are given two positive integer arrays nums1 and nums2, both of length n. The absolute sum difference of arrays nums1 and nums2 is defined as the s... Topics: Array, Binary Search, Sorting, Ordered Set
• 2207. Sequentially Ordinal Rank Tracker - Hard - Ordered SetA scenic location is represented by its name and attractiveness score, where name is a unique string among all locations and score is an integer. Loca... Topics: Design, Heap (Priority Queue), Data Stream, Ordered Set
• 732. My Calendar III - Hard - Ordered SetA k-booking happens when k events have some non-empty intersection (i.e., there is some time that is common to all k events.) You are given some event... Topics: Binary Search, Design, Segment Tree, Prefix Sum, Ordered Set
• 2319. Longest Substring of One Repeating Character - Hard - Ordered SetYou 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 queryIn... Topics: Array, String, Segment Tree, Ordered Set
• 3791. Fruits Into Baskets III - Medium - Ordered SetYou are given two arrays of integers, fruits and baskets, each of length n, where fruits[i] represents the quantity of the ith type of fruit, and bask... Topics: Array, Binary Search, Segment Tree, Ordered Set
• 880. Rectangle Area II - Hard - Ordered SetYou are given a 2D array of axis-aligned rectangles. Each rectangle[i] = [xi1, yi1, xi2, yi2] denotes the ith rectangle where (xi1, yi1) are the coord... Topics: Array, Segment Tree, Line Sweep, Ordered Set
• 493. Reverse Pairs - Hard - Ordered SetGiven an integer array nums, return the number of reverse pairs in the array. A reverse pair is a pair (i, j) where: 0 <= i < j < nums.length and nums... Topics: Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set
• 2334. Number of Flowers in Full Bloom - Hard - Ordered SetYou are given a 0-indexed 2D integer array flowers, where flowers[i] = [starti, endi] means the ith flower will be in full bloom from starti to endi (... Topics: Array, Hash Table, Binary Search, Sorting, Prefix Sum, Ordered Set
• 1710. Find Servers That Handled Most Number of Requests - Hard - Ordered SetYou have k servers numbered from 0 to k-1 that are being used to handle multiple requests simultaneously. Each server has infinite computational capac... Topics: Array, Greedy, Heap (Priority Queue), Ordered Set
• 3344. Minimize Manhattan Distances - Hard - Ordered SetYou are given an array points representing integer coordinates of some points on a 2D plane, where points[i] = [xi, yi]. The distance between two poin... Topics: Array, Math, Geometry, Sorting, Ordered Set
• 1772. Create Sorted Array through Instructions - Hard - Ordered SetGiven an integer array instructions, you are asked to create a sorted array from the elements in instructions. You start with an empty container nums.... Topics: Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set
• 3906. Kth Smallest Path XOR Sum - Hard - Ordered SetYou are given an undirected tree rooted at node 0 with n nodes numbered from 0 to n - 1. Each node i has an integer value vals[i], and its parent is g... Topics: Array, Tree, Depth-First Search, Ordered Set
• 1533. Display Table of Food Orders in a Restaurant - Medium - Ordered SetGiven the array orders, which represents the orders that customers have done in a restaurant. More specifically orders[i]=[customerNamei,tableNumberi,... Topics: Array, Hash Table, String, Sorting, Ordered Set
• 1017. Odd Even Jump - Hard - Ordered SetYou are given an integer array arr. From some starting index, you can make a series of jumps. The (1st, 3rd, 5th, ...) jumps in the series are called ... Topics: Array, Dynamic Programming, Stack, Sorting, Monotonic Stack, Ordered Set
• 2023. Design Movie Rental System - Hard - Ordered SetYou have a movie renting company consisting of n shops. You want to implement a renting system that supports searching for, booking, and returning mov... Topics: Array, Hash Table, Design, Heap (Priority Queue), Ordered Set
• 2447. Merge Similar Items - Easy - Ordered SetYou are given two 2D integer arrays, items1 and items2, representing two sets of items. Each array items has the following properties: items[i] = [val... Topics: Array, Hash Table, Sorting, Ordered Set
• 1953. Finding MK Average - Hard - Ordered SetYou are given two integers, m and k, and a stream of integers. You are tasked to implement a data structure that calculates the MKAverage for the stre... Topics: Design, Queue, Heap (Priority Queue), Data Stream, Ordered Set
• 2513. Number of Pairs Satisfying Inequality - Hard - Ordered SetYou are given two 0-indexed integer arrays nums1 and nums2, each of size n, and an integer diff. Find the number of pairs (i, j) such that: 0 <= i < j... Topics: Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set
• 2765. Make Array Empty - Hard - Ordered SetYou are given an integer array nums containing distinct numbers, and you can perform the following operations until the array is empty: If the first e... Topics: Array, Binary Search, Greedy, Binary Indexed Tree, Segment Tree, Sorting, Ordered Set
• 3000. Minimum Absolute Difference Between Elements With Constraint - Medium - Ordered SetYou are given a 0-indexed integer array nums and an integer x. Find the minimum absolute difference between two elements in the array that are at leas... Topics: Array, Binary Search, Ordered Set
• 2280. Count Good Triplets in an Array - Hard - Ordered SetYou are given two 0-indexed arrays nums1 and nums2 of length n, both of which are permutations of [0, 1, ..., n - 1]. A good triplet is a set of 3 dis... Topics: Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set
• 2413. Smallest Number in Infinite Set - Medium - Ordered SetYou have a set which contains all positive integers [1, 2, 3, 4, 5, ...]. Implement the SmallestInfiniteSet class: SmallestInfiniteSet() Initializes t... Topics: Hash Table, Design, Heap (Priority Queue), Ordered Set
• 3514. Shortest Distance After Road Addition Queries II - Hard - Ordered SetYou are given an integer n and a 2D integer array queries. There are n cities numbered from 0 to n - 1. Initially, there is a unidirectional road from... Topics: Array, Greedy, Graph, Ordered Set
• 2434. Design a Number Container System - Medium - Ordered SetDesign a number container system that can do the following: Insert or Replace a number at the given index in the system. Return the smallest index for... Topics: Hash Table, Design, Heap (Priority Queue), Ordered Set
• 914. Random Point in Non-overlapping Rectangles - Medium - Ordered SetYou are given an array of non-overlapping axis-aligned rectangles rects where rects[i] = [ai, bi, xi, yi] indicates that (ai, bi) is the bottom-left c... Topics: Array, Math, Binary Search, Reservoir Sampling, Prefix Sum, Ordered Set, Randomized
• 1470. Tweet Counts Per Frequency - Medium - Ordered SetA social media company is trying to monitor activity on their site by analyzing the number of tweets that occur in select periods of time. These perio... Topics: Hash Table, Binary Search, Design, Sorting, Ordered Set
• 731. My Calendar II - Medium - Ordered SetYou are implementing a program to use as your calendar. We can add a new event if adding the event will not cause a triple booking. A triple booking h... Topics: Array, Binary Search, Design, Segment Tree, Prefix Sum, Ordered Set
• 363. Max Sum of Rectangle No Larger Than K - Hard - Ordered SetGiven an m x n matrix matrix and an integer k, return the max sum of a rectangle in the matrix such that its sum is no larger than k. It is guaranteed... Topics: Array, Binary Search, Matrix, Prefix Sum, Ordered Set
• 729. My Calendar I - Medium - Ordered SetYou are implementing a program to use as your calendar. We can add a new event if adding the event will not cause a double booking. A double booking h... Topics: Array, Binary Search, Design, Segment Tree, Ordered Set

Related LeetCode Topics

• Array LeetCode Problems
• Backtracking LeetCode Problems
• Biconnected Component LeetCode Problems
• Binary Indexed Tree LeetCode Problems
• Binary Search LeetCode Problems
• Binary Search Tree LeetCode Problems
• Binary Tree LeetCode Problems
• Bit Manipulation LeetCode Problems
• Bitmask LeetCode Problems
• Brainteaser LeetCode Problems
• Breadth-First Search LeetCode Problems
• Bucket Sort LeetCode Problems
• Combinatorics LeetCode Problems
• Concurrency LeetCode Problems
• Counting LeetCode Problems
• Counting Sort LeetCode Problems
• Data Stream LeetCode Problems
• Database LeetCode Problems
• Depth-First Search LeetCode Problems
• Design LeetCode Problems