Sorting Problems

Sorting LeetCode Problems List

• 15. 3Sum - Medium - SortingGiven an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k]... Topics: Array, Two Pointers, Sorting
• 49. Group Anagrams - Medium - SortingGiven an array of strings strs, group the anagrams together. You can return the answer in any order.... Topics: Array, Hash Table, String, Sorting
• 347. Top K Frequent Elements - Medium - SortingGiven an integer array nums and an integer k, return the k most frequent elements. You may return the answer in any order.... Topics: Array, Hash Table, Divide and Conquer, Sorting, Heap (Priority Queue), Bucket Sort, Counting, Quickselect
• 88. Merge Sorted Array - Easy - SortingYou are given two integer arrays nums1 and nums2, sorted in non-decreasing order, and two integers m and n, representing the number of elements in num... Topics: Array, Two Pointers, Sorting
• 18. 4Sum - Medium - SortingGiven an array nums of n integers, return an array of all the unique quadruplets [nums[a], nums[b], nums[c], nums[d]] such that: 0 <= a, b, c, d < n a... Topics: Array, Two Pointers, Sorting
• 75. Sort Colors - Medium - SortingGiven an array nums with n objects colored red, white, or blue, sort them in-place so that objects of the same color are adjacent, with the colors in ... Topics: Array, Two Pointers, Sorting
• 1014. K Closest Points to Origin - Medium - SortingGiven an array of points where points[i] = [xi, yi] represents a point on the X-Y plane and an integer k, return the k closest points to the origin (0... Topics: Array, Math, Divide and Conquer, Geometry, Sorting, Heap (Priority Queue), Quickselect
• 56. Merge Intervals - Medium - SortingGiven an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals... Topics: Array, Sorting
• 721. Accounts Merge - Medium - SortingGiven a list of accounts where each element accounts[i] is a list of strings, where the first element accounts[i][0] is a name, and the rest of the el... Topics: Array, Hash Table, String, Depth-First Search, Breadth-First Search, Union Find, Sorting
• 169. Majority Element - Easy - SortingGiven an array nums of size n, return the majority element. The majority element is the element that appears more than ⌊n / 2⌋ times. You may assume t... Topics: Array, Hash Table, Divide and Conquer, Sorting, Counting
• 179. Largest Number - Medium - SortingGiven a list of non-negative integers nums, arrange them such that they form the largest number and return it. Since the result may be very large, so ... Topics: Array, String, Greedy, Sorting
• 268. Missing Number - Easy - SortingGiven an array nums containing n distinct numbers in the range [0, n], return the only number in the range that is missing from the array.... Topics: Array, Hash Table, Math, Binary Search, Bit Manipulation, Sorting
• 378. Kth Smallest Element in a Sorted Matrix - Medium - SortingGiven an n x n matrix where each of the rows and columns is sorted in ascending order, return the kth smallest element in the matrix. Note that it is ... Topics: Array, Binary Search, Sorting, Heap (Priority Queue), Matrix
• 295. Find Median from Data Stream - Hard - SortingThe median is the middle value in an ordered integer list. If the size of the list is even, there is no middle value, and the median is the mean of th... Topics: Two Pointers, Design, Sorting, Heap (Priority Queue), Data Stream
• 630. Course Schedule III - Hard - SortingThere are n different online courses numbered from 1 to n. You are given an array courses where courses[i] = [durationi, lastDayi] indicate that the i... Topics: Array, Greedy, Sorting, Heap (Priority Queue)
• 1029. Vertical Order Traversal of a Binary Tree - Hard - SortingGiven the root of a binary tree, calculate the vertical order traversal of the binary tree. For each node at position (row, col), its left and right c... Topics: Hash Table, Tree, Depth-First Search, Breadth-First Search, Sorting, Binary Tree
• 215. Kth Largest Element in an Array - Medium - SortingGiven an integer array nums and an integer k, return the kth largest element in the array. Note that it is the kth largest element in the sorted order... Topics: Array, Divide and Conquer, Sorting, Heap (Priority Queue), Quickselect
• 242. Valid Anagram - Easy - SortingGiven two strings s and t, return true if t is an anagram of s, and false otherwise.... Topics: Hash Table, String, Sorting
• 148. Sort List - Medium - SortingGiven the head of a linked list, return the list after sorting it in ascending order.... Topics: Linked List, Two Pointers, Divide and Conquer, Sorting, Merge Sort
• 621. Task Scheduler - Medium - SortingYou are given an array of CPU tasks, each labeled with a letter from A to Z, and a number n. Each CPU interval can be idle or allow the completion of ... Topics: Array, Hash Table, Greedy, Sorting, Heap (Priority Queue), Counting
• 1019. Squares of a Sorted Array - Easy - SortingGiven an integer array nums sorted in non-decreasing order, return an array of the squares of each number sorted in non-decreasing order.... Topics: Array, Two Pointers, Sorting
• 1137. Height Checker - Easy - SortingA school is trying to take an annual photo of all the students. The students are asked to stand in a single file line in non-decreasing order by heigh... Topics: Array, Sorting, Counting Sort
• 2479. Meeting Rooms III - Hard - SortingYou are given an integer n. There are n rooms numbered from 0 to n - 1. You are given a 2D integer array meetings where meetings[i] = [starti, endi] m... Topics: Array, Hash Table, Sorting, Heap (Priority Queue), Simulation
• 720. Longest Word in Dictionary - Medium - SortingGiven an array of strings words representing an English Dictionary, return the longest word in words that can be built one character at a time by othe... Topics: Array, Hash Table, String, Trie, Sorting
• 16. 3Sum Closest - Medium - SortingGiven an integer array nums of length n and an integer target, find three integers in nums such that the sum is closest to target. Return the sum of t... Topics: Array, Two Pointers, Sorting
• 3934. Coupon Code Validator - Easy - SortingYou are given three arrays of length n that describe the properties of n coupons: code, businessLine, and isActive. The ith coupon has: code[i]: a str... Topics: Array, Hash Table, String, Sorting
• 1352. Maximum Profit in Job Scheduling - Hard - SortingWe have n jobs, where every job is scheduled to be done from startTime[i] to endTime[i], obtaining a profit of profit[i]. You're given the startTime, ... Topics: Array, Binary Search, Dynamic Programming, Sorting
• 883. Car Fleet - Medium - SortingThere are n cars at given miles away from the starting mile 0, traveling to reach the mile target. You are given two integer arrays position and speed... Topics: Array, Stack, Sorting, Monotonic Stack
• 217. Contains Duplicate - Easy - SortingGiven an integer array nums, return true if any value appears at least twice in the array, and return false if every element is distinct.... Topics: Array, Hash Table, Sorting
• 47. Permutations II - Medium - SortingGiven a collection of numbers, nums, that might contain duplicates, return all possible unique permutations in any order.... Topics: Array, Backtracking, Sorting
• 658. Find K Closest Elements - Medium - SortingGiven a sorted integer array arr, two integers k and x, return the k closest integers to x in the array. The result should also be sorted in ascending... Topics: Array, Two Pointers, Binary Search, Sliding Window, Sorting, Heap (Priority Queue)
• 349. Intersection of Two Arrays - Easy - SortingGiven two integer arrays nums1 and nums2, return an array of their intersection. Each element in the result must be unique and you may return the resu... Topics: Array, Hash Table, Two Pointers, Binary Search, Sorting
• 948. Sort an Array - Medium - SortingGiven an array of integers nums, sort the array in ascending order and return it. You must solve the problem without using any built-in functions in O... Topics: Array, Divide and Conquer, Sorting, Heap (Priority Queue), Merge Sort, Bucket Sort, Radix Sort, Counting Sort
• 350. Intersection of Two Arrays II - Easy - SortingGiven two integer arrays nums1 and nums2, return an array of their intersection. Each element in the result must appear as many times as it shows in b... Topics: Array, Hash Table, Two Pointers, Binary Search, Sorting
• 147. Insertion Sort List - Medium - SortingGiven the head of a singly linked list, sort the list using insertion sort, and return the sorted list's head. The steps of the insertion sort algorit... Topics: Linked List, Sorting
• 726. Number of Atoms - Hard - SortingGiven a string formula representing a chemical formula, return the count of each atom. The atomic element always starts with an uppercase character, t... Topics: Hash Table, String, Stack, Sorting
• 3847. Minimum Swaps to Sort by Digit Sum - Medium - SortingYou are given an array nums of distinct positive integers. You need to sort the array in increasing order based on the sum of the digits of each numbe... Topics: Array, Hash Table, Sorting
• 435. Non-overlapping Intervals - Medium - SortingGiven an array of intervals intervals where intervals[i] = [starti, endi], return the minimum number of intervals you need to remove to make the rest ... Topics: Array, Dynamic Programming, Greedy, Sorting
• 451. Sort Characters By Frequency - Medium - SortingGiven a string s, sort it in decreasing order based on the frequency of the characters. The frequency of a character is the number of times it appears... Topics: Hash Table, String, Sorting, Heap (Priority Queue), Bucket Sort, Counting
• 807. Custom Sort String - Medium - SortingYou are given two strings order and s. All the characters of order are unique and were sorted in some custom order previously. Permute the characters ... Topics: Hash Table, String, Sorting
• 1669. Minimum Cost to Cut a Stick - Hard - SortingGiven a wooden stick of length n units. The stick is labelled from 0 to n. For example, a stick of length 6 is labelled as follows: Given an integer a... Topics: Array, Dynamic Programming, Sorting
• 1272. Invalid Transactions - Medium - SortingA transaction is possibly invalid if: the amount exceeds $1000, or; if it occurs within (and including) 60 minutes of another transaction with the sam... Topics: Array, Hash Table, String, Sorting
• 1966. Frequency of the Most Frequent Element - Medium - SortingThe frequency of an element is the number of times it occurs in an array. You are given an integer array nums and an integer k. In one operation, you ... Topics: Array, Binary Search, Greedy, Sliding Window, Sorting, Prefix Sum
• 1561. Rearrange Words in a Sentence - Medium - SortingGiven a sentence text (A sentence is a string of space-separated words) in the following format: First letter is in upper case. Each word in text are ... Topics: String, Sorting
• 2600. Maximum Tastiness of Candy Basket - Medium - SortingYou are given an array of positive integers price where price[i] denotes the price of the ith candy and a positive integer k. The store sells baskets ... Topics: Array, Binary Search, Greedy, Sorting
• 1009. Pancake Sorting - Medium - SortingGiven an array of integers arr, sort the array by performing a series of pancake flips. In one pancake flip we do the following steps: Choose an integ... Topics: Array, Two Pointers, Greedy, Sorting
• 2502. Sort the People - Easy - SortingYou are given an array of strings names, and an array heights that consists of distinct positive integers. Both arrays are of length n. For each index... Topics: Array, Hash Table, String, Sorting
• 1478. Maximum Number of Events That Can Be Attended - Medium - SortingYou are given an array of events where events[i] = [startDayi, endDayi]. Every event i starts at startDayi and ends at endDayi. You can attend an even... Topics: Array, Greedy, Sorting, Heap (Priority Queue)
• 324. Wiggle Sort II - Medium - SortingGiven an integer array nums, reorder it such that nums[0] < nums[1] > nums[2] < nums[3].... You may assume the input array always has a valid answer.... Topics: Array, Divide and Conquer, Greedy, Sorting, Quickselect
• 1798. Max Number of K-Sum Pairs - Medium - SortingYou are given an integer array nums and an integer k. In one operation, you can pick two numbers from the array whose sum equals k and remove them fro... Topics: Array, Hash Table, Two Pointers, Sorting
• 229. Majority Element II - Medium - SortingGiven an integer array of size n, find all elements that appear more than ⌊ n/3 ⌋ times.... Topics: Array, Hash Table, Sorting, Counting
• 581. Shortest Unsorted Continuous Subarray - Medium - SortingGiven an integer array nums, you need to find one continuous subarray such that if you only sort this subarray in non-decreasing order, then the whole... Topics: Array, Two Pointers, Stack, Greedy, Sorting, Monotonic Stack
• 3231. Minimum Number of Coins to be Added - Medium - SortingYou are given a 0-indexed integer array coins, representing the values of the coins available, and an integer target. An integer x is obtainable if th... Topics: Array, Greedy, Sorting
• 1184. Car Pooling - Medium - SortingThere is a car with capacity empty seats. The vehicle only drives east (i.e., it cannot turn around and drive west). You are given the integer capacit... Topics: Array, Sorting, Heap (Priority Queue), Simulation, Prefix Sum
• 1353. Find Resultant Array After Removing Anagrams - Easy - SortingYou are given a 0-indexed string array words, where words[i] consists of lowercase English letters. In one operation, select any index i such that 0 <... Topics: Array, Hash Table, String, Sorting
• 1584. Average Salary Excluding the Minimum and Maximum Salary - Easy - SortingYou are given an array of unique integers salary where salary[i] is the salary of the ith employee. Return the average salary of employees excluding t... Topics: Array, Sorting
• 389. Find the Difference - Easy - SortingYou are given two strings s and t. String t is generated by random shuffling string s and then add one more letter at a random position. Return the le... Topics: Hash Table, String, Bit Manipulation, Sorting
• 274. H-Index - Medium - SortingGiven an array of integers citations where citations[i] is the number of citations a researcher received for their ith paper, return the researcher's ... Topics: Array, Sorting, Counting Sort
• 1397. Search Suggestions System - Medium - SortingYou are given an array of strings products and a string searchWord. Design a system that suggests at most three product names from products after each... Topics: Array, String, Binary Search, Trie, Sorting, Heap (Priority Queue)
• 2113. Find the Kth Largest Integer in the Array - Medium - SortingYou are given an array of strings nums and an integer k. Each string in nums represents an integer without leading zeros. Return the string that repre... Topics: Array, String, Divide and Conquer, Sorting, Heap (Priority Queue), Quickselect
• 2204. Find Subsequence of Length K With the Largest Sum - Easy - SortingYou are given an integer array nums and an integer k. You want to find a subsequence of nums of length k that has the largest sum. Return any such sub... Topics: Array, Hash Table, Sorting, Heap (Priority Queue)
• 1129. Longest String Chain - Medium - SortingYou are given an array of words where each word consists of lowercase English letters. wordA is a predecessor of wordB if and only if we can insert ex... Topics: Array, Hash Table, Two Pointers, String, Dynamic Programming, Sorting
• 2248. Minimum Cost of Buying Candies With Discount - Easy - SortingA shop is selling candies at a discount. For every two candies sold, the shop gives a third candy for free. The customer can choose any candy to take ... Topics: Array, Greedy, Sorting
• 628. Maximum Product of Three Numbers - Easy - SortingGiven an integer array nums, find three numbers whose product is maximum and return the maximum product.... Topics: Array, Math, Sorting
• 414. Third Maximum Number - Easy - SortingGiven an integer array nums, return the third distinct maximum number in this array. If the third maximum does not exist, return the maximum number.... Topics: Array, Sorting
• 1458. Sort Integers by The Number of 1 Bits - Easy - SortingYou are given an integer array arr. Sort the integers in the array in ascending order by the number of 1's in their binary representation and in case ... Topics: Array, Bit Manipulation, Sorting, Counting
• 1367. Maximum Height by Stacking Cuboids - Hard - SortingGiven n cuboids where the dimensions of the ith cuboid is cuboids[i] = [widthi, lengthi, heighti] (0-indexed). Choose a subset of cuboids and place th... Topics: Array, Dynamic Programming, Sorting
• 2250. K Highest Ranked Items Within a Price Range - Medium - SortingYou are given a 0-indexed 2D integer array grid of size m x n that represents a map of the items in a shop. The integers in the grid represent the fol... Topics: Array, Breadth-First Search, Sorting, Heap (Priority Queue), Matrix
• 1970. Sorting the Sentence - Easy - SortingA sentence is a list of words that are separated by a single space with no leading or trailing spaces. Each word consists of lowercase and uppercase E... Topics: String, Sorting
• 2488. Divide Intervals Into Minimum Number of Groups - Medium - SortingYou are given a 2D integer array intervals where intervals[i] = [lefti, righti] represents the inclusive interval [lefti, righti]. You have to divide ... Topics: Array, Two Pointers, Greedy, Sorting, Heap (Priority Queue), Prefix Sum
• 220. Contains Duplicate III - Hard - SortingYou 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
• 976. Minimum Area Rectangle - Medium - SortingYou are given an array of points in the X-Y plane points where points[i] = [xi, yi]. Return the minimum area of a rectangle formed from these points, ... Topics: Array, Hash Table, Math, Geometry, Sorting
• 3437. Maximum Total Damage With Spell Casting - Medium - SortingA magician has various spells. You are given an array power, where each element represents the damage of a spell. Multiple spells can have the same da... Topics: Array, Hash Table, Two Pointers, Binary Search, Dynamic Programming, Sorting, Counting
• 2210. Find Target Indices After Sorting Array - Easy - SortingYou are given a 0-indexed integer array nums and a target element target. A target index is an index i such that nums[i] == target. Return a list of t... Topics: Array, Binary Search, Sorting
• 452. Minimum Number of Arrows to Burst Balloons - Medium - SortingThere are some spherical balloons taped onto a flat wall that represents the XY-plane. The balloons are represented as a 2D integer array points where... Topics: Array, Greedy, Sorting
• 2725. Mice and Cheese - Medium - SortingThere are two mice and n different types of cheese, each type of cheese should be eaten by exactly one mouse. A point of the cheese with index i (0-in... Topics: Array, Greedy, Sorting, Heap (Priority Queue)
• 1616. Minimum Difference Between Largest and Smallest Value in Three Moves - Medium - SortingYou are given an integer array nums. In one move, you can choose one element of nums and change it to any value. Return the minimum difference between... Topics: Array, Greedy, Sorting
• 1741. Sort Array by Increasing Frequency - Easy - SortingGiven an array of integers nums, sort the array in increasing order based on the frequency of the values. If multiple values have the same frequency, ... Topics: Array, Hash Table, Sorting
• 2670. Make K-Subarray Sums Equal - Medium - SortingYou are given a 0-indexed integer array arr and an integer k. The array arr is circular. In other words, the first element of the array is the next el... Topics: Array, Math, Greedy, Sorting, Number Theory
• 1777. Determine if Two Strings Are Close - Medium - SortingTwo strings are considered close if you can attain one from the other using the following operations: Operation 1: Swap any two existing characters. F... Topics: Hash Table, String, Sorting, Counting
• 987. Reveal Cards In Increasing Order - Medium - SortingYou are given an integer array deck. There is a deck of cards where every card has a unique integer. The integer on the ith card is deck[i]. You can o... Topics: Array, Queue, Sorting, Simulation
• 506. Relative Ranks - Easy - SortingYou are given an integer array score of size n, where score[i] is the score of the ith athlete in a competition. All the scores are guaranteed to be u... Topics: Array, Sorting, Heap (Priority Queue)
• 3104. Happy Students - Medium - SortingYou are given a 0-indexed integer array nums of length n where n is the total number of students in the class. The class teacher tries to select a gro... Topics: Array, Sorting, Enumeration
• 2392. Successful Pairs of Spells and Potions - Medium - SortingYou are given two positive integer arrays spells and potions, of length n and m respectively, where spells[i] represents the strength of the ith spell... Topics: Array, Two Pointers, Binary Search, Sorting
• 611. Valid Triangle Number - Medium - SortingGiven an integer array nums, return the number of triplets chosen from the array that can make triangles if we take them as side lengths of a triangle... Topics: Array, Two Pointers, Binary Search, Greedy, Sorting
• 1957. Closest Room - Hard - SortingThere 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
• 862. Find And Replace in String - Medium - SortingYou are given a 0-indexed string s that you must perform k replacement operations on. The replacement operations are given as three 0-indexed parallel... Topics: Array, Hash Table, String, Sorting
• 1482. How Many Numbers Are Smaller Than the Current Number - Easy - SortingGiven the array nums, for each nums[i] find out how many numbers in the array are smaller than it. That is, for each nums[i] you have to count the num... Topics: Array, Hash Table, Sorting, Counting Sort
• 1829. Maximum Units on a Truck - Easy - SortingYou are assigned to put some amount of boxes onto one truck. You are given a 2D array boxTypes, where boxTypes[i] = [numberOfBoxesi, numberOfUnitsPerB... Topics: Array, Greedy, Sorting
• 646. Maximum Length of Pair Chain - Medium - SortingYou are given an array of n pairs pairs where pairs[i] = [lefti, righti] and lefti < righti. A pair p2 = [c, d] follows a pair p1 = [a, b] if b < c. A... Topics: Array, Dynamic Programming, Greedy, Sorting
• 917. Boats to Save People - Medium - SortingYou are given an array people where people[i] is the weight of the ith person, and an infinite number of boats where each boat can carry a maximum wei... Topics: Array, Two Pointers, Greedy, Sorting
• 1253. Sort the Matrix Diagonally - Medium - SortingA matrix diagonal is a diagonal line of cells starting from some cell in either the topmost row or leftmost column and going in the bottom-right direc... Topics: Array, Sorting, Matrix
• 2118. Maximum Earnings From Taxi - Medium - SortingThere are n points on a road you are driving your taxi on. The n points on the road are labeled from 1 to n in the direction you are going, and you wa... Topics: Array, Hash Table, Binary Search, Dynamic Programming, Sorting
• 406. Queue Reconstruction by Height - Medium - SortingYou are given an array of people, people, which are the attributes of some people in a queue (not necessarily in order). Each people[i] = [hi, ki] rep... Topics: Array, Binary Indexed Tree, Segment Tree, Sorting
• 3620. Maximum Number of Distinct Elements After Operations - Medium - SortingYou are given an integer array nums and an integer k. You are allowed to perform the following operation on each element of the array at most once: Ad... Topics: Array, Greedy, Sorting
• 2049. Eliminate Maximum Number of Monsters - Medium - SortingYou are playing a video game where you are defending your city from a group of n monsters. You are given a 0-indexed integer array dist of size n, whe... Topics: Array, Greedy, Sorting
• 941. Sort Array By Parity - Easy - SortingGiven an integer array nums, move all the even integers at the beginning of the array followed by all the odd integers. Return any array that satisfie... Topics: Array, Two Pointers, Sorting
• 645. Set Mismatch - Easy - SortingYou have a set of integers s, which originally contains all the numbers from 1 to n. Unfortunately, due to some error, one of the numbers in s got dup... Topics: Array, Hash Table, Bit Manipulation, Sorting
• 2756. Buy Two Chocolates - Easy - SortingYou are given an integer array prices representing the prices of various chocolates in a store. You are also given a single integer money, which repre... Topics: Array, Greedy, Sorting
• 532. K-diff Pairs in an Array - Medium - SortingGiven an array of integers nums and an integer k, return the number of unique k-diff pairs in the array. A k-diff pair is an integer pair (nums[i], nu... Topics: Array, Hash Table, Two Pointers, Binary Search, Sorting
• 2646. Kth Largest Sum in a Binary Tree - Medium - SortingYou are given the root of a binary tree and a positive integer k. The level sum in the tree is the sum of the values of the nodes that are on the same... Topics: Tree, Breadth-First Search, Sorting, Binary Tree
• 3571. Length of the Longest Increasing Path - Hard - SortingYou are given a 2D array of integers coordinates of length n and an integer k, where 0 <= k < n. coordinates[i] = [xi, yi] indicates the point (xi, yi... Topics: Array, Binary Search, Sorting
• 1499. Maximum Performance of a Team - Hard - SortingYou are given two integers n and k and two integer arrays speed and efficiency both of length n. There are n engineers numbered from 1 to n. speed[i] ... Topics: Array, Greedy, Sorting, Heap (Priority Queue)
• 524. Longest Word in Dictionary through Deleting - Medium - SortingGiven a string s and a string array dictionary, return the longest string in the dictionary that can be formed by deleting some of the given string ch... Topics: Array, Two Pointers, String, Sorting
• 1946. Minimum Absolute Sum Difference - Medium - SortingYou 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
• 1851. Maximum Number of Events That Can Be Attended II - Hard - SortingYou are given an array of events where events[i] = [startDayi, endDayi, valuei]. The ith event starts at startDayi and ends at endDayi, and if you att... Topics: Array, Binary Search, Dynamic Programming, Sorting
• 1574. Maximum Product of Two Elements in an Array - Easy - SortingGiven the array of integers nums, you will choose two different indices i and j of that array. Return the maximum value of (nums[i]-1)*(nums[j]-1).... Topics: Array, Sorting, Heap (Priority Queue)
• 1018. Largest Perimeter Triangle - Easy - SortingGiven an integer array nums, return the largest perimeter of a triangle with a non-zero area, formed from three of these lengths. If it is impossible ... Topics: Array, Math, Greedy, Sorting
• 2245. Destroying Asteroids - Medium - SortingYou are given an integer mass, which represents the original mass of a planet. You are further given an integer array asteroids, where asteroids[i] is... Topics: Array, Greedy, Sorting
• 1962. Single-Threaded CPU - Medium - SortingYou are given n​​​​​​ tasks labeled from 0 to n - 1 represented by a 2D integer array tasks, where tasks[i] = [enqueueTimei, processingTimei] means th... Topics: Array, Sorting, Heap (Priority Queue)
• 1095. Two City Scheduling - Medium - SortingA company is planning to interview 2n people. Given the array costs where costs[i] = [aCosti, bCosti], the cost of flying the ith person to city a is ... Topics: Array, Greedy, Sorting
• 2123. The Number of Weak Characters in the Game - Medium - SortingYou are playing a game that contains multiple characters, and each of the characters has two main properties: attack and defense. You are given a 2D i... Topics: Array, Stack, Greedy, Sorting, Monotonic Stack
• 2636. Maximum Subsequence Score - Medium - SortingYou are given two 0-indexed integer arrays nums1 and nums2 of equal length n and a positive integer k. You must choose a subsequence of indices from n... Topics: Array, Greedy, Sorting, Heap (Priority Queue)
• 502. IPO - Hard - SortingSuppose LeetCode will start its IPO soon. In order to sell a good price of its shares to Venture Capital, LeetCode would like to work on some projects... Topics: Array, Greedy, Sorting, Heap (Priority Queue)
• 1539. Diagonal Traverse II - Medium - SortingGiven a 2D integer array nums, return all elements of nums in diagonal order as shown in the below images.... Topics: Array, Sorting, Heap (Priority Queue)
• 2283. Sort Even and Odd Indices Independently - Easy - SortingYou are given a 0-indexed integer array nums. Rearrange the values of nums according to the following rules: Sort the values at odd indices of nums in... Topics: Array, Sorting
• 2334. Number of Flowers in Full Bloom - Hard - SortingYou 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
• 894. Random Pick with Blacklist - Hard - SortingYou are given an integer n and an array of unique integers blacklist. Design an algorithm to pick a random integer in the range [0, n - 1] that is not... Topics: Array, Hash Table, Math, Binary Search, Sorting, Randomized
• 354. Russian Doll Envelopes - Hard - SortingYou are given a 2D array of integers envelopes where envelopes[i] = [wi, hi] represents the width and the height of an envelope. One envelope can fit ... Topics: Array, Binary Search, Dynamic Programming, Sorting
• 632. Smallest Range Covering Elements from K Lists - Hard - SortingYou have k lists of sorted integers in non-decreasing order. Find the smallest range that includes at least one number from each of the k lists. We de... Topics: Array, Hash Table, Greedy, Sliding Window, Sorting, Heap (Priority Queue)
• 924. Fair Candy Swap - Easy - SortingAlice and Bob have a different total number of candies. You are given two integer arrays aliceSizes and bobSizes where aliceSizes[i] is the number of ... Topics: Array, Hash Table, Binary Search, Sorting
• 876. Hand of Straights - Medium - SortingAlice has some number of cards and she wants to rearrange the cards into groups so that each group is of size groupSize, and consists of groupSize con... Topics: Array, Hash Table, Greedy, Sorting
• 2590. Maximum Star Sum of a Graph - Medium - SortingThere is an undirected graph consisting of n nodes numbered from 0 to n - 1. You are given a 0-indexed integer array vals of length n where vals[i] de... Topics: Array, Greedy, Graph, Sorting, Heap (Priority Queue)
• 1613. Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree - Hard - SortingGiven a weighted undirected connected graph with n vertices numbered from 0 to n - 1, and an array edges where edges[i] = [ai, bi, weighti] represents... Topics: Union Find, Graph, Sorting, Minimum Spanning Tree, Strongly Connected Component
• 2664. Maximize Greatness of an Array - Medium - SortingYou are given a 0-indexed integer array nums. You are allowed to permute nums into a new array perm of your choosing. We define the greatness of nums ... Topics: Array, Two Pointers, Greedy, Sorting
• 1556. Make Two Arrays Equal by Reversing Subarrays - Easy - SortingYou are given two integer arrays of equal length target and arr. In one step, you can select any non-empty subarray of arr and reverse it. You are all... Topics: Array, Hash Table, Sorting
• 2180. Maximum Number of Tasks You Can Assign - Hard - SortingYou have n tasks and m workers. Each task has a strength requirement stored in a 0-indexed integer array tasks, with the ith task requiring tasks[i] s... Topics: Array, Two Pointers, Binary Search, Greedy, Queue, Sorting, Monotonic Queue
• 1771. Sell Diminishing-Valued Colored Balls - Medium - SortingYou have an inventory of different colored balls, and there is a customer that wants orders balls of any color. The customer weirdly values the colore... Topics: Array, Math, Binary Search, Greedy, Sorting, Heap (Priority Queue)
• 455. Assign Cookies - Easy - SortingAssume you are an awesome parent and want to give your children some cookies. But, you should give each child at most one cookie. Each child i has a g... Topics: Array, Two Pointers, Greedy, Sorting
• 3712. Minimum Cost to Make Arrays Identical - Medium - SortingYou are given two integer arrays arr and brr of length n, and an integer k. You can perform the following operations on arr any number of times: Split... Topics: Array, Greedy, Sorting
• 2117. Find Original Array From Doubled Array - Medium - SortingAn integer array original is transformed into a doubled array changed by appending twice the value of every element in original, and then randomly shu... Topics: Array, Hash Table, Greedy, Sorting
• 3959. Maximum Total from Optimal Activation Order - Medium - SortingYou are given two integer arrays value and limit, both of length n. Initially, all elements are inactive. You may activate them in any order. To activ... Topics: Array, Two Pointers, Greedy, Sorting, Heap (Priority Queue)
• 2588. Maximum Number of Points From Grid Queries - Hard - SortingYou are given an m x n integer matrix grid and an array queries of size k. Find an array answer of size k such that for each integer queries[i] you st... Topics: Array, Two Pointers, Breadth-First Search, Union Find, Sorting, Heap (Priority Queue), Matrix
• 3967. Earliest Finish Time for Land and Water Rides II - Medium - SortingYou are given two categories of theme park attractions: land rides and water rides. Land rides landStartTime[i] – the earliest time the ith land ride ... Topics: Array, Two Pointers, Binary Search, Greedy, Sorting
• 3344. Minimize Manhattan Distances - Hard - SortingYou 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
• 1290. Make Array Strictly Increasing - Hard - SortingGiven two integer arrays arr1 and arr2, return the minimum number of operations (possibly zero) needed to make arr1 strictly increasing. In one operat... Topics: Array, Binary Search, Dynamic Programming, Sorting
• 3531. Minimum Amount of Damage Dealt to Bob - Hard - SortingYou are given an integer power and two integer arrays damage and health, both having length n. Bob has n enemies, where enemy i will deal Bob damage[i... Topics: Array, Greedy, Sorting
• 1257. Rank Transform of a Matrix - Hard - SortingGiven an m x n matrix, return a new matrix answer where answer[row][col] is the rank of matrix[row][col]. The rank is an integer that represents how l... Topics: Array, Union Find, Graph, Topological Sort, Sorting, Matrix
• 935. Orderly Queue - Hard - SortingYou are given a string s and an integer k. You can choose one of the first k letters of s and append it at the end of the string. Return the lexicogra... Topics: Math, String, Sorting
• 3908. Minimum Time for K Connected Components - Medium - SortingYou are given an integer n and an undirected graph with n nodes labeled from 0 to n - 1. This is represented by a 2D array edges, where edges[i] = [ui... Topics: Binary Search, Union Find, Graph, Sorting
• 3241. Divide Array Into Arrays With Max Difference - Medium - SortingYou are given an integer array nums of size n where n is a multiple of 3 and a positive integer k. Divide the array nums into n / 3 arrays of size 3 s... Topics: Array, Greedy, Sorting
• 2650. Split With Minimum Sum - Easy - SortingGiven a positive integer num, split it into two non-negative integers num1 and num2 such that: The concatenation of num1 and num2 is a permutation of ... Topics: Math, Greedy, Sorting
• 2681. Put Marbles in Bags - Hard - SortingYou have k bags. You are given a 0-indexed integer array weights where weights[i] is the weight of the ith marble. You are also given the integer k. D... Topics: Array, Greedy, Sorting, Heap (Priority Queue)
• 2539. Minimum Number of Operations to Make Arrays Similar - Hard - SortingYou are given two positive integer arrays nums and target, of the same length. In one operation, you can choose any two distinct indices i and j where... Topics: Array, Greedy, Sorting
• 2979. Maximize the Profit as the Salesman - Medium - SortingYou are given an integer n representing the number of houses on a number line, numbered from 0 to n - 1. Additionally, you are given a 2D integer arra... Topics: Array, Hash Table, Binary Search, Dynamic Programming, Sorting
• 164. Maximum Gap - Medium - SortingGiven an integer array nums, return the maximum difference between two successive elements in its sorted form. If the array contains less than two ele... Topics: Array, Sorting, Bucket Sort, Radix Sort
• 3399. Find the Integer Added to Array II - Medium - SortingYou are given two integer arrays nums1 and nums2. From nums1 two elements have been removed, and all other elements have been increased (or decreased ... Topics: Array, Two Pointers, Sorting, Enumeration
• 1427. All Elements in Two Binary Search Trees - Medium - SortingGiven two binary search trees root1 and root2, return a list containing all the integers from both trees sorted in ascending order.... Topics: Tree, Depth-First Search, Binary Search Tree, Sorting, Binary Tree
• 2497. Maximum Matching of Players With Trainers - Medium - SortingYou are given a 0-indexed integer array players, where players[i] represents the ability of the ith player. You are also given a 0-indexed integer arr... Topics: Array, Two Pointers, Greedy, Sorting
• 3494. Minimum Cost for Cutting Cake I - Medium - SortingThere is an m x n cake that needs to be cut into 1 x 1 pieces. You are given integers m, n, and two arrays: horizontalCut of size m - 1, where horizon... Topics: Array, Dynamic Programming, Greedy, Sorting
• 2888. Minimum Index of a Valid Split - Medium - SortingAn element x of an integer array arr of length m is dominant if more than half the elements of arr have a value of x. You are given a 0-indexed intege... Topics: Array, Hash Table, Sorting
• 2603. Reward Top K Students - Medium - SortingYou are given two string arrays positive_feedback and negative_feedback, containing the words denoting positive and negative feedback, respectively. N... Topics: Array, Hash Table, String, Sorting, Heap (Priority Queue)
• 2833. Count Zero Request Servers - Medium - SortingYou are given an integer n denoting the total number of servers and a 2D 0-indexed integer array logs, where logs[i] = [server_id, time] denotes that ... Topics: Array, Hash Table, Sliding Window, Sorting
• 853. Most Profit Assigning Work - Medium - SortingYou have n jobs and m workers. You are given three arrays: difficulty, profit, and worker where: difficulty[i] and profit[i] are the difficulty and th... Topics: Array, Two Pointers, Binary Search, Greedy, Sorting
• 748. Largest Number At Least Twice of Others - Easy - SortingYou are given an integer array nums where the largest integer is unique. Determine whether the largest element in the array is at least twice as much ... Topics: Array, Sorting
• 692. Top K Frequent Words - Medium - SortingGiven an array of strings words and an integer k, return the k most frequent strings. Return the answer sorted by the frequency from highest to lowest... Topics: Array, Hash Table, String, Trie, Sorting, Heap (Priority Queue), Bucket Sort, Counting
• 3657. Check if Grid can be Cut into Sections - Medium - SortingYou are given an integer n representing the dimensions of an n x n grid, with the origin at the bottom-left corner of the grid. You are also given a 2... Topics: Array, Sorting
• 1626. Can Make Arithmetic Progression From Sequence - Easy - SortingA sequence of numbers is called an arithmetic progression if the difference between any two consecutive elements is the same. Given an array of number... Topics: Array, Sorting
• 1519. Minimum Subsequence in Non-Increasing Order - Easy - SortingGiven the array nums, obtain a subsequence of the array whose sum of elements is strictly greater than the sum of the non included elements in such su... Topics: Array, Greedy, Sorting
• 1273. Compare Strings by Frequency of the Smallest Character - Medium - SortingLet the function f(s) be the frequency of the lexicographically smallest character in a non-empty string s. For example, if s = "dcce" then f(s) = 2 b... Topics: Array, Hash Table, String, Binary Search, Sorting
• 3321. Type of Triangle - Easy - SortingYou are given a 0-indexed integer array nums of size 3 which can form the sides of a triangle. A triangle is called equilateral if it has all sides of... Topics: Array, Math, Sorting
• 2305. Append K Integers With Minimal Sum - Medium - SortingYou are given an integer array nums and an integer k. Append k unique positive integers that do not appear in nums to nums such that the resulting tot... Topics: Array, Math, Greedy, Sorting
• 2018. Minimum Space Wasted From Packaging - Hard - SortingYou have n packages that you are trying to place in boxes, one package in each box. There are m suppliers that each produce boxes of different sizes (... Topics: Array, Binary Search, Sorting, Prefix Sum
• 900. Reordered Power of 2 - Medium - SortingYou are given an integer n. We reorder the digits in any order (including the original order) such that the leading digit is not zero. Return true if ... Topics: Hash Table, Math, Sorting, Counting, Enumeration
• 1466. Jump Game V - Hard - SortingGiven an array of integers arr and an integer d. In one step you can jump from index i to index: i + x where: i + x < arr.length and 0 < x <= d. i - ... Topics: Array, Dynamic Programming, Sorting
• 1533. Display Table of Food Orders in a Restaurant - Medium - SortingGiven 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
• 2112. Minimum Difference Between Highest and Lowest of K Scores - Easy - SortingYou are given a 0-indexed integer array nums, where nums[i] represents the score of the ith student. You are also given an integer k. Pick the scores ... Topics: Array, Sliding Window, Sorting
• 3819. Count Covered Buildings - Medium - SortingYou are given a positive integer n, representing an n x n city. You are also given a 2D grid buildings, where buildings[i] = [x, y] denotes a unique b... Topics: Array, Hash Table, Sorting
• 3262. Find Polygon With the Largest Perimeter - Medium - SortingYou are given an array of positive integers nums of length n. A polygon is a closed plane figure that has at least 3 sides. The longest side of a poly... Topics: Array, Greedy, Sorting, Prefix Sum
• 1017. Odd Even Jump - Hard - SortingYou 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
• 2215. Finding 3-Digit Even Numbers - Easy - SortingYou are given an integer array digits, where each element is a digit. The array may contain duplicates. You need to find all the unique integers that ... Topics: Array, Hash Table, Sorting, Enumeration
• 3965. Earliest Finish Time for Land and Water Rides I - Easy - SortingYou are given two categories of theme park attractions: land rides and water rides. Land rides landStartTime[i] – the earliest time the ith land ride ... Topics: Array, Two Pointers, Binary Search, Greedy, Sorting
• 1990. Get Biggest Three Rhombus Sums in a Grid - Medium - SortingYou are given an m x n integer matrix grid​​​. A rhombus sum is the sum of the elements that form the border of a regular rhombus shape in grid​​​. Th... Topics: Array, Math, Sorting, Heap (Priority Queue), Matrix, Prefix Sum
• 1675. Magnetic Force Between Two Balls - Medium - SortingIn the universe Earth C-137, Rick discovered a special form of magnetic force between two balls if they are put in his new invented basket. Rick has n... Topics: Array, Binary Search, Sorting
• 3562. Maximum Score of Non-overlapping Intervals - Hard - SortingYou are given a 2D integer array intervals, where intervals[i] = [li, ri, weighti]. Interval i starts at position li and ends at ri, and has a weight ... Topics: Array, Binary Search, Dynamic Programming, Sorting
• 2754. Maximum Strength of a Group - Medium - SortingYou are given a 0-indexed integer array nums representing the score of students in an exam. The teacher would like to form one non-empty group of stud... Topics: Array, Dynamic Programming, Backtracking, Greedy, Bit Manipulation, Sorting, Enumeration
• 3236. Smallest Missing Integer Greater Than Sequential Prefix Sum - Easy - SortingYou are given a 0-indexed array of integers nums. A prefix nums[0..i] is sequential if, for all 1 <= j <= i, nums[j] = nums[j - 1] + 1. In particular,... Topics: Array, Hash Table, Sorting
• 2892. Check if Array is Good - Easy - SortingYou are given an integer array nums. We consider an array good if it is a permutation of an array base[n]. base[n] = [1, 2, ..., n - 1, n, n] (in othe... Topics: Array, Hash Table, Sorting
• 2256. Count Words Obtained After Adding a Letter - Medium - SortingYou are given two 0-indexed arrays of strings startWords and targetWords. Each string consists of lowercase English letters only. For each string in t... Topics: Array, Hash Table, String, Bit Manipulation, Sorting
• 2447. Merge Similar Items - Easy - SortingYou 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
• 2651. Count Ways to Group Overlapping Ranges - Medium - SortingYou are given a 2D integer array ranges where ranges[i] = [starti, endi] denotes that all integers between starti and endi (both inclusive) are contai... Topics: Array, Sorting
• 2834. Relocate Marbles - Medium - SortingYou are given a 0-indexed integer array nums representing the initial positions of some marbles. You are also given two 0-indexed integer arrays moveF... Topics: Array, Hash Table, Sorting, Simulation
• 2355. Maximum Consecutive Floors Without Special Floors - Medium - SortingAlice manages a company and has rented some floors of a building as office space. Alice has decided some of these floors should be special floors, use... Topics: Array, Sorting
• 3334. Apple Redistribution into Boxes - Easy - SortingYou are given an array apple of size n and an array capacity of size m. There are n packs where the ith pack contains apple[i] apples. There are m box... Topics: Array, Greedy, Sorting
• 1530. Check If a String Can Break Another String - Medium - SortingGiven two strings: s1 and s2 with the same size, check if some permutation of string s1 can break some permutation of string s2 or vice-versa. In othe... Topics: String, Greedy, Sorting
• 958. Sort Array By Parity II - Easy - SortingGiven an array of integers nums, half of the integers in nums are odd, and the other half are even. Sort the array so that whenever nums[i] is odd, i ... Topics: Array, Two Pointers, Sorting
• 3647. Zero Array Transformation III - Medium - SortingYou are given an integer array nums of length n and a 2D array queries where queries[i] = [li, ri]. Each queries[i] represents the following action on... Topics: Array, Greedy, Sorting, Heap (Priority Queue), Prefix Sum
• 3958. Minimum Removals to Balance Array - Medium - SortingYou are given an integer array nums and an integer k. An array is considered balanced if the value of its maximum element is at most k times the minim... Topics: Array, Sliding Window, Sorting
• 3226. Minimum Number Game - Easy - SortingYou are given a 0-indexed integer array nums of even length and there is also an empty array arr. Alice and Bob decided to play a game where in every ... Topics: Array, Sorting, Heap (Priority Queue), Simulation
• 1968. Maximum Building Height - Hard - SortingYou want to build n new buildings in a city. The new buildings will be built in a line and are labeled from 1 to n. However, there are city restrictio... Topics: Array, Math, Sorting
• 802. K-th Smallest Prime Fraction - Medium - SortingYou are given a sorted integer array arr containing 1 and prime numbers, where all the integers of arr are unique. You are also given an integer k. Fo... Topics: Array, Two Pointers, Binary Search, Sorting, Heap (Priority Queue)
• 2284. Smallest Value of the Rearranged Number - Medium - SortingYou are given an integer num. Rearrange the digits of num such that its value is minimized and it does not contain any leading zeros. Return the rearr... Topics: Math, Sorting
• 887. Minimum Cost to Hire K Workers - Hard - SortingThere are n workers. You are given two integer arrays quality and wage where quality[i] is the quality of the ith worker and wage[i] is the minimum wa... Topics: Array, Greedy, Sorting, Heap (Priority Queue)
• 2436. Make Array Zero by Subtracting Equal Amounts - Easy - SortingYou are given a non-negative integer array nums. In one operation, you must: Choose a positive integer x such that x is less than or equal to the smal... Topics: Array, Hash Table, Greedy, Sorting, Heap (Priority Queue), Simulation
• 539. Minimum Time Difference - Medium - SortingGiven a list of 24-hour clock time points in "HH:MM" format, return the minimum minutes difference between any two time-points in the list.... Topics: Array, Math, String, Sorting
• 2978. Check if Strings Can be Made Equal With Operations II - Medium - SortingYou are given two strings s1 and s2, both of length n, consisting of lowercase English letters. You can apply the following operation on any of the tw... Topics: Hash Table, String, Sorting
• 2640. Maximum Number of Integers to Choose From a Range I - Medium - SortingYou are given an integer array banned and two integers n and maxSum. You are choosing some number of integers following the below rules: The chosen in... Topics: Array, Hash Table, Binary Search, Greedy, Sorting
• 3881. Minimize Maximum Component Cost - Medium - SortingYou are given an undirected connected graph with n nodes labeled from 0 to n - 1 and a 2D integer array edges where edges[i] = [ui, vi, wi] denotes an... Topics: Binary Search, Union Find, Graph, Sorting
• 2699. Count the Number of Fair Pairs - Medium - SortingGiven a 0-indexed integer array nums of size n and two integers lower and upper, return the number of fair pairs. A pair (i, j) is fair if: 0 <= i < j... Topics: Array, Two Pointers, Binary Search, Sorting
• 2765. Make Array Empty - Hard - SortingYou 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
• 2412. Minimum Amount of Time to Fill Cups - Easy - SortingYou have a water dispenser that can dispense cold, warm, and hot water. Every second, you can either fill up 2 cups with different types of water, or ... Topics: Array, Greedy, Sorting, Heap (Priority Queue)
• 3430. Count Days Without Meetings - Medium - SortingYou are given a positive integer days representing the total number of days an employee is available for work (starting from day 1). You are also give... Topics: Array, Sorting
• 2417. The Latest Time to Catch a Bus - Medium - SortingYou are given a 0-indexed integer array buses of length n, where buses[i] represents the departure time of the ith bus. You are also given a 0-indexed... Topics: Array, Two Pointers, Binary Search, Sorting
• 901. Advantage Shuffle - Medium - SortingYou are given two integer arrays nums1 and nums2 both of the same length. The advantage of nums1 with respect to nums2 is the number of indices i for ... Topics: Array, Two Pointers, Greedy, Sorting
• 1788. Stone Game VI - Medium - SortingAlice and Bob take turns playing a game, with Alice starting first. There are n stones in a pile. On each player's turn, they can remove a stone from ... Topics: Array, Math, Greedy, Sorting, Heap (Priority Queue), Game Theory
• 594. Longest Harmonious Subsequence - Easy - SortingWe define a harmonious array as an array where the difference between its maximum value and its minimum value is exactly 1. Given an integer array num... Topics: Array, Hash Table, Sliding Window, Sorting, Counting
• 3360. Minimum Deletions to Make String K-Special - Medium - SortingYou are given a string word and an integer k. We consider word to be k-special if |freq(word[i]) - freq(word[j])| <= k for all indices i and j in the ... Topics: Hash Table, String, Greedy, Sorting, Counting
• 3884. Minimum Absolute Difference in Sliding Submatrix - Medium - SortingYou are given an m x n integer matrix grid and an integer k. For every contiguous k x k submatrix of grid, compute the minimum absolute difference bet... Topics: Array, Sorting, Matrix
• 3107. Maximum Spending After Buying Items - Hard - SortingYou are given a 0-indexed m * n integer matrix values, representing the values of m * n different items in m different shops. Each shop has n items wh... Topics: Array, Greedy, Sorting, Heap (Priority Queue), Matrix
• 2164. Two Best Non-Overlapping Events - Medium - SortingYou are given a 0-indexed 2D integer array of events where events[i] = [startTimei, endTimei, valuei]. The ith event starts at startTimei and ends at ... Topics: Array, Binary Search, Dynamic Programming, Sorting, Heap (Priority Queue)
• 368. Largest Divisible Subset - Medium - SortingGiven a set of distinct positive integers nums, return the largest subset answer such that every pair (answer[i], answer[j]) of elements in this subse... Topics: Array, Math, Dynamic Programming, Sorting
• 1463. The K Weakest Rows in a Matrix - Easy - SortingYou are given an m x n binary matrix mat of 1's (representing soldiers) and 0's (representing civilians). The soldiers are positioned in front of the ... Topics: Array, Binary Search, Sorting, Heap (Priority Queue), Matrix
• 1047. Maximize Sum Of Array After K Negations - Easy - SortingGiven an integer array nums and an integer k, modify the array in the following way: choose an index i and replace nums[i] with -nums[i]. You should a... Topics: Array, Greedy, Sorting
• 3622. Maximum Frequency of an Element After Performing Operations I - Medium - SortingYou are given an integer array nums and two integers k and numOperations. You must perform an operation numOperations times on nums, where in each ope... Topics: Array, Binary Search, Sliding Window, Sorting, Prefix Sum
• 2891. Maximum Beauty of an Array After Applying Operation - Medium - SortingYou are given a 0-indexed array nums and a non-negative integer k. In one operation, you can do the following: Choose an index i that hasn't been chos... Topics: Array, Binary Search, Sliding Window, Sorting
• 3219. Make Lexicographically Smallest Array by Swapping Elements - Medium - SortingYou are given a 0-indexed array of positive integers nums and a positive integer limit. In one operation, you can choose any two indices i and j and s... Topics: Array, Union Find, Sorting
• 2561. Number of Distinct Averages - Easy - SortingYou are given a 0-indexed integer array nums of even length. As long as nums is not empty, you must repetitively: Find the minimum number in nums and ... Topics: Array, Hash Table, Two Pointers, Sorting
• 2836. Neither Minimum nor Maximum - Easy - SortingGiven an integer array nums containing distinct positive integers, find and return any number from the array that is neither the minimum nor the maxim... Topics: Array, Sorting
• 3390. Minimum Rectangles to Cover Points - Medium - SortingYou are given a 2D integer array points, where points[i] = [xi, yi]. You are also given an integer w. Your task is to cover all the given points with ... Topics: Array, Greedy, Sorting
• 2887. Sort Vowels in a String - Medium - SortingGiven a 0-indexed string s, permute s to get a new string t such that: All consonants remain in their original places. More formally, if there is an i... Topics: String, Sorting
• 3534. Count Almost Equal Pairs I - Medium - SortingYou are given an array nums consisting of positive integers. We call two integers x and y in this problem almost equal if both integers can become equ... Topics: Array, Hash Table, Sorting, Counting, Enumeration
• 2846. Robot Collisions - Hard - SortingThere are n 1-indexed robots, each having a position on a line, health, and movement direction. You are given 0-indexed integer arrays positions, heal... Topics: Array, Stack, Sorting, Simulation
• 1988. Minimize Maximum Pair Sum in Array - Medium - SortingThe pair sum of a pair (a,b) is equal to a + b. The maximum pair sum is the largest pair sum in a list of pairs. For example, if we have pairs (1,5), ... Topics: Array, Two Pointers, Greedy, Sorting
• 991. Array of Doubled Pairs - Medium - SortingGiven an integer array of even length arr, return true if it is possible to reorder arr such that arr[2 * i + 1] = 2 * arr[2 * i] for every 0 <= i < l... Topics: Array, Hash Table, Greedy, Sorting
• 2423. Minimum Deletions to Make Array Divisible - Hard - SortingYou are given two positive integer arrays nums and numsDivide. You can delete any number of elements from nums. Return the minimum number of deletions... Topics: Array, Math, Sorting, Heap (Priority Queue), Number Theory
• 1961. Maximum Ice Cream Bars - Medium - SortingIt is a sweltering summer day, and a boy wants to buy some ice cream bars. At the store, there are n ice cream bars. You are given an array costs of l... Topics: Array, Greedy, Sorting, Counting Sort
• 3894. Maximize Y‑Sum by Picking a Triplet of Distinct X‑Values - Medium - SortingYou are given two integer arrays x and y, each of length n. You must choose three distinct indices i, j, and k such that: x[i] != x[j] x[j] != x[k] x[... Topics: Array, Hash Table, Greedy, Sorting, Heap (Priority Queue)
• 779. Max Chunks To Make Sorted II - Hard - SortingYou are given an integer array arr. We split arr into some number of chunks (i.e., partitions), and individually sort each chunk. After concatenating ... Topics: Array, Stack, Greedy, Sorting, Monotonic Stack
• 2290. Removing Minimum Number of Magic Beans - Medium - SortingYou are given an array of positive integers beans, where each integer represents the number of magic beans found in a particular magic bag. Remove any... Topics: Array, Greedy, Sorting, Enumeration, Prefix Sum
• 2720. Minimize the Maximum Difference of Pairs - Medium - SortingYou are given a 0-indexed integer array nums and an integer p. Find p pairs of indices of nums such that the maximum difference amongst all the pairs ... Topics: Array, Binary Search, Dynamic Programming, Greedy, Sorting
• 2469. Longest Subsequence With Limited Sum - Easy - SortingYou are given an integer array nums of length n, and an integer array queries of length m. Return an array answer of length m where answer[i] is the m... Topics: Array, Binary Search, Greedy, Sorting, Prefix Sum
• 852. Friends Of Appropriate Ages - Medium - SortingThere are n persons on a social media website. You are given an integer array ages where ages[i] is the age of the ith person. A Person x will not sen... Topics: Array, Two Pointers, Binary Search, Sorting
• 780. Max Chunks To Make Sorted - Medium - SortingYou are given an integer array arr of length n that represents a permutation of the integers in the range [0, n - 1]. We split arr into some number of... Topics: Array, Stack, Greedy, Sorting, Monotonic Stack
• 2585. Delete Greatest Value in Each Row - Easy - SortingYou are given an m x n matrix grid consisting of positive integers. Perform the following operation until grid becomes empty: Delete the element with ... Topics: Array, Sorting, Heap (Priority Queue), Matrix, Simulation
• 2330. Maximum Total Beauty of the Gardens - Hard - SortingAlice is a caretaker of n gardens and she wants to plant flowers to maximize the total beauty of all her gardens. You are given a 0-indexed integer ar... Topics: Array, Two Pointers, Binary Search, Greedy, Sorting, Enumeration, Prefix Sum
• 778. Reorganize String - Medium - SortingGiven a string s, rearrange the characters of s so that any two adjacent characters are not the same. Return any possible rearrangement of s or return... Topics: Hash Table, String, Greedy, Sorting, Heap (Priority Queue), Counting
• 1707. Check If String Is Transformable With Substring Sort Operations - Hard - SortingGiven two strings s and t, transform string s into string t using the following operation any number of times: Choose a non-empty substring in s and s... Topics: String, Greedy, Sorting
• 1388. Greatest Sum Divisible by Three - Medium - SortingGiven an integer array nums, return the maximum possible sum of elements of the array such that it is divisible by three.... Topics: Array, Dynamic Programming, Greedy, Sorting
• 1210. Mean of Array After Removing Some Elements - Easy - SortingGiven an integer array arr, return the mean of the remaining integers after removing the smallest 5% and the largest 5% of the elements. Answers withi... Topics: Array, Sorting
• 3815. Sum of Largest Prime Substrings - Medium - SortingGiven a string s, find the sum of the 3 largest unique prime numbers that can be formed using any of its substrings. Return the sum of the three large... Topics: Hash Table, Math, String, Sorting, Number Theory
• 1468. Check If N and Its Double Exist - Easy - SortingGiven an array arr of integers, check if there exist two indices i and j such that : i != j 0 <= i, j < arr.length arr[i] == 2 * arr[j]... Topics: Array, Hash Table, Two Pointers, Binary Search, Sorting
• 1464. Reduce Array Size to The Half - Medium - SortingYou are given an integer array arr. You can choose a set of integers and remove all the occurrences of these integers in the array. Return the minimum... Topics: Array, Hash Table, Greedy, Sorting, Heap (Priority Queue)
• 808. Number of Matching Subsequences - Medium - SortingGiven a string s and an array of strings words, return the number of words[i] that is a subsequence of s. A subsequence of a string is a new string ge... Topics: Array, Hash Table, String, Binary Search, Dynamic Programming, Trie, Sorting
• 1277. Largest Multiple of Three - Hard - SortingGiven an array of digits digits, return the largest multiple of three that can be formed by concatenating some of the given digits in any order. If th... Topics: Array, Math, Dynamic Programming, Greedy, Sorting
• 1470. Tweet Counts Per Frequency - Medium - SortingA 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
• 3202. High-Access Employees - Medium - SortingYou are given a 2D 0-indexed array of strings, access_times, with size n. For each i where 0 <= i <= n - 1, access_times[i][0] represents the name of ... Topics: Array, Hash Table, String, Sorting
• 2366. Maximum Bags With Full Capacity of Rocks - Medium - SortingYou have n bags numbered from 0 to n - 1. You are given two 0-indexed integer arrays capacity and rocks. The ith bag can hold a maximum of capacity[i]... Topics: Array, Greedy, Sorting
• 1354. Find Players With Zero or One Losses - Medium - SortingYou are given an integer array matches where matches[i] = [winneri, loseri] indicates that the player winneri defeated player loseri in a match. Retur... Topics: Array, Hash Table, Sorting, Counting
• 2505. Number of Good Paths - Hard - SortingThere is a tree (i.e. a connected, undirected graph with no cycles) consisting of n nodes numbered from 0 to n - 1 and exactly n - 1 edges. You are gi... Topics: Array, Hash Table, Tree, Union Find, Graph, Sorting
• 3151. Minimum Processing Time - Medium - SortingYou have a certain number of processors, each having 4 cores. The number of tasks to be executed is four times the number of processors. Each task mus... Topics: Array, Greedy, Sorting
• 2787. Movement of Robots - Medium - SortingSome robots are standing on an infinite number line with their initial coordinates given by a 0-indexed integer array nums and will start moving once ... Topics: Array, Brainteaser, Sorting, Prefix Sum
• 1422. Divide Array in Sets of K Consecutive Numbers - Medium - SortingGiven an array of integers nums and a positive integer k, check whether it is possible to divide this array into sets of k consecutive numbers. Return... Topics: Array, Hash Table, Greedy, Sorting
• 1232. Sum of Mutated Array Closest to Target - Medium - SortingGiven an integer array arr and a target value target, return the integer value such that when we change all the integers larger than value in the give... Topics: Array, Binary Search, Sorting
• 2327. Largest Number After Digit Swaps by Parity - Easy - SortingYou are given a positive integer num. You may swap any two digits of num that have the same parity (i.e. both odd digits or both even digits). Return ... Topics: Sorting, Heap (Priority Queue)
• 2016. Reduction Operations to Make the Array Elements Equal - Medium - SortingGiven an integer array nums, your goal is to make all elements in nums equal. To complete one operation, follow these steps: Find the largest value in... Topics: Array, Sorting
• 2581. Divide Players Into Teams of Equal Skill - Medium - SortingYou are given a positive integer array skill of even length n where skill[i] denotes the skill of the ith player. Divide the players into n / 2 teams ... Topics: Array, Hash Table, Two Pointers, Sorting
• 1571. Allocate Mailboxes - Hard - SortingGiven the array houses where houses[i] is the location of the ith house along a street and an integer k, allocate k mailboxes in the street. Return th... Topics: Array, Math, Dynamic Programming, Sorting
• 3276. Minimum Number of Pushes to Type Word II - Medium - SortingYou are given a string word containing lowercase English letters. Telephone keypads have keys mapped with distinct collections of lowercase English le... Topics: Hash Table, String, Greedy, Sorting, Counting
• 1306. Minimum Absolute Difference - Easy - SortingGiven an array of distinct integers arr, find all pairs of elements with the minimum absolute difference of any two elements. Return a list of pairs i... Topics: Array, Sorting
• 3509. K-th Largest Perfect Subtree Size in Binary Tree - Medium - SortingYou are given the root of a binary tree and an integer k. Return an integer denoting the size of the kth largest perfect binary subtree, or -1 if it d... Topics: Tree, Depth-First Search, Sorting, Binary Tree
• 2274. Keep Multiplying Found Values by Two - Easy - SortingYou are given an array of integers nums. You are also given an integer original which is the first number that needs to be searched for in nums. You t... Topics: Array, Hash Table, Sorting, Simulation
• 2160. Minimum Operations to Make a Uni-Value Grid - Medium - SortingYou are given a 2D integer grid of size m x n and an integer x. In one operation, you can add x to or subtract x from any element in the grid. A uni-v... Topics: Array, Math, Sorting, Matrix
• 2042. Maximum Product Difference Between Two Pairs - Easy - SortingThe product difference between two pairs (a, b) and (c, d) is defined as (a * b) - (c * d). For example, the product difference between (5, 6) and (2,... Topics: Array, Sorting
• 2696. The Number of Beautiful Subsets - Medium - SortingYou are given an array nums of positive integers and a positive integer k. A subset of nums is beautiful if it does not contain two integers with an a... Topics: Array, Hash Table, Math, Dynamic Programming, Backtracking, Sorting, Combinatorics
• 3485. Maximize Score of Numbers in Ranges - Medium - SortingYou are given an array of integers start and an integer d, representing n intervals [start[i], start[i] + d]. You are asked to choose n integers where... Topics: Array, Binary Search, Greedy, Sorting
• 2538. Minimum Cost to Make Array Equal - Hard - SortingYou are given two 0-indexed arrays nums and cost consisting each of n positive integers. You can do the following operation any number of times: Incre... Topics: Array, Binary Search, Greedy, Sorting, Prefix Sum
• 959. 3Sum With Multiplicity - Medium - SortingGiven an integer array arr, and an integer target, return the number of tuples i, j, k such that i < j < k and arr[i] + arr[j] + arr[k] == target. As ... Topics: Array, Hash Table, Two Pointers, Sorting, Counting
• 3766. Maximum Median Sum of Subsequences of Size 3 - Medium - SortingYou are given an integer array nums with a length divisible by 3. You want to make the array empty in steps. In each step, you can select any three el... Topics: Array, Math, Greedy, Sorting, Game Theory
• 2055. Describe the Painting - Medium - SortingThere is a long and thin painting that can be represented by a number line. The painting was painted with multiple overlapping segments where each seg... Topics: Array, Hash Table, Sorting, Prefix Sum
• 462. Minimum Moves to Equal Array Elements II - Medium - SortingGiven an integer array nums of size n, return the minimum number of moves required to make all array elements equal. In one move, you can increment or... Topics: Array, Math, Sorting
• 1621. Number of Subsequences That Satisfy the Given Sum Condition - Medium - SortingYou are given an array of integers nums and an integer target. Return the number of non-empty subsequences of nums such that the sum of the minimum an... Topics: Array, Two Pointers, Binary Search, Sorting
• 843. Binary Trees With Factors - Medium - SortingGiven an array of unique integers, arr, where each integer arr[i] is strictly greater than 1. We make a binary tree using these integers, and each num... Topics: Array, Hash Table, Dynamic Programming, Sorting
• 475. Heaters - Medium - SortingWinter is coming! During the contest, your first job is to design a standard heater with a fixed warm radius to warm all the houses. Every house can b... Topics: Array, Two Pointers, Binary Search, Sorting
• 2631. Sort the Students by Their Kth Score - Medium - SortingThere is a class with m students and n exams. You are given a 0-indexed m x n integer matrix score, where each row represents one student and score[i]... Topics: Array, Sorting, Matrix
• 1770. Minimum Deletions to Make Character Frequencies Unique - Medium - SortingA string s is called good if there are no two different characters in s that have the same frequency. Given a string s, return the minimum number of c... Topics: Hash Table, String, Greedy, Sorting
• 2917. Count Pairs Whose Sum is Less than Target - Easy - SortingGiven a 0-indexed integer array nums of length n and an integer target, return the number of pairs (i, j) where 0 <= i < j < n and nums[i] + nums[j] <... Topics: Array, Two Pointers, Binary Search, Sorting
• 3812. Smallest Palindromic Rearrangement I - Medium - SortingYou are given a palindromic string s. Return the lexicographically smallest palindromic permutation of s.... Topics: String, Sorting, Counting Sort
• 2379. Maximum Total Importance of Roads - Medium - SortingYou are given an integer n denoting the number of cities in a country. The cities are numbered from 0 to n - 1. You are also given a 2D integer array ... Topics: Greedy, Graph, Sorting, Heap (Priority Queue)
• 2333. Count Number of Rectangles Containing Each Point - Medium - SortingYou are given a 2D integer array rectangles where rectangles[i] = [li, hi] indicates that ith rectangle has a length of li and a height of hi. You are... Topics: Array, Hash Table, Binary Search, Binary Indexed Tree, Sorting
• 1709. Alert Using Same Key-Card Three or More Times in a One Hour Period - Medium - SortingLeetCode company workers use key-cards to unlock office doors. Each time a worker uses their key-card, the security system saves the worker's name and... Topics: Array, Hash Table, String, Sorting
• 2257. Earliest Possible Day of Full Bloom - Hard - SortingYou have n flower seeds. Every seed must be planted first before it can begin to grow, then bloom. Planting a seed takes time and so does the growth o... Topics: Array, Greedy, Sorting
• 2728. Sum in a Matrix - Medium - SortingYou are given a 0-indexed 2D integer array nums. Initially, your score is 0. Perform the following operations until the matrix becomes empty: From eac... Topics: Array, Sorting, Heap (Priority Queue), Matrix, Simulation
• 2418. Minimum Sum of Squared Difference - Medium - SortingYou are given two positive 0-indexed integer arrays nums1 and nums2, both of length n. The sum of squared difference of arrays nums1 and nums2 is defi... Topics: Array, Binary Search, Greedy, Sorting, Heap (Priority Queue)
• 2367. Minimum Lines to Represent a Line Chart - Medium - SortingYou are given a 2D integer array stockPrices where stockPrices[i] = [dayi, pricei] indicates the price of the stock on day dayi is pricei. A line char... Topics: Array, Math, Geometry, Sorting, Number Theory
• 1094. Matrix Cells in Distance Order - Easy - SortingYou are given four integers row, cols, rCenter, and cCenter. There is a rows x cols matrix and you are on the cell with the coordinates (rCenter, cCen... Topics: Array, Math, Geometry, Sorting, Matrix
• 2549. Next Greater Element IV - Hard - SortingYou are given a 0-indexed array of non-negative integers nums. For each integer in nums, you must find its respective second greater integer. The seco... Topics: Array, Binary Search, Stack, Sorting, Heap (Priority Queue), Monotonic Stack
• 561. Array Partition - Easy - SortingGiven an integer array nums of 2n integers, group these integers into n pairs (a1, b1), (a2, b2), ..., (an, bn) such that the sum of min(ai, bi) for a... Topics: Array, Greedy, Sorting, Counting Sort
• 2359. Maximum White Tiles Covered by a Carpet - Medium - SortingYou are given a 2D integer array tiles where tiles[i] = [li, ri] represents that every tile j in the range li <= j <= ri is colored white. You are als... Topics: Array, Binary Search, Greedy, Sliding Window, Sorting, Prefix Sum
• 2712. Find the Maximum Number of Marked Indices - Medium - SortingYou are given a 0-indexed integer array nums. Initially, all of the indices are unmarked. You are allowed to make this operation any number of times: ... Topics: Array, Two Pointers, Binary Search, Greedy, Sorting
• 1256. Rank Transform of an Array - Easy - SortingGiven an array of integers arr, replace each element with its rank. The rank represents how large the element is. The rank has the following rules: Ra... Topics: Array, Hash Table, Sorting
• 472. Concatenated Words - Hard - SortingGiven an array of strings words (without duplicates), return all the concatenated words in the given list of words. A concatenated word is defined as ... Topics: Array, String, Dynamic Programming, Depth-First Search, Trie, Sorting
• 974. Reorder Data in Log Files - Medium - SortingYou are given an array of logs. Each log is a space-delimited string of words, where the first word is the identifier. There are two types of logs: Le... Topics: Array, String, Sorting
• 3764. Maximum Sum With at Most K Elements - Medium - SortingYou are given a 2D integer matrix grid of size n x m, an integer array limits of length n, and an integer k. The task is to find the maximum sum of at... Topics: Array, Greedy, Sorting, Heap (Priority Queue), Matrix
• 2387. Partition Array Such That Maximum Difference Is K - Medium - SortingYou are given an integer array nums and an integer k. You may partition nums into one or more subsequences such that each element in nums appears in e... Topics: Array, Greedy, Sorting
• 436. Find Right Interval - Medium - SortingYou are given an array of intervals, where intervals[i] = [starti, endi] and each starti is unique. The right interval for an interval i is an interva... Topics: Array, Binary Search, Sorting
• 1483. Rank Teams by Votes - Medium - SortingIn a special ranking system, each voter gives a rank from highest to lowest to all teams participating in the competition. The ordering of teams is de... Topics: Array, Hash Table, String, Sorting, Counting
• 1881. Closest Subsequence Sum - Hard - SortingYou are given an integer array nums and an integer goal. You want to choose a subsequence of nums such that the sum of its elements is the closest pos... Topics: Array, Two Pointers, Dynamic Programming, Bit Manipulation, Sorting, Bitmask
• 3510. Maximize the Total Height of Unique Towers - Medium - SortingYou are given an array maximumHeight, where maximumHeight[i] denotes the maximum height the ith tower can be assigned. Your task is to assign a height... Topics: Array, Greedy, Sorting
• 1733. Maximum Number of Visible Points - Hard - SortingYou are given an array points, an integer angle, and your location, where location = [posx, posy] and points[i] = [xi, yi] both denote integral coordi... Topics: Array, Math, Geometry, Sliding Window, Sorting
• 1217. Relative Sort Array - Easy - SortingGiven two arrays arr1 and arr2, the elements of arr2 are distinct, and all elements in arr2 are also in arr1. Sort the elements of arr1 such that the ... Topics: Array, Hash Table, Sorting, Counting Sort
• 2524. Largest Positive Integer That Exists With Its Negative - Easy - SortingGiven an integer array nums that does not contain any zeros, find the largest positive integer k such that -k also exists in the array. Return the pos... Topics: Array, Hash Table, Two Pointers, Sorting
• 2148. Minimum Number of Moves to Seat Everyone - Easy - SortingThere are n availabe seats and n students standing in a room. You are given an array seats of length n, where seats[i] is the position of the ith seat... Topics: Array, Greedy, Sorting, Counting Sort
• 1581. The k Strongest Values in an Array - Medium - SortingGiven an array of integers arr and an integer k. A value arr[i] is said to be stronger than a value arr[j] if |arr[i] - m| > |arr[j] - m| where m is t... Topics: Array, Two Pointers, Sorting
• 1815. Checking Existence of Edge Length Limited Paths - Hard - SortingAn undirected graph of n nodes is defined by edgeList, where edgeList[i] = [ui, vi, disi] denotes an edge between nodes ui and vi with distance disi. ... Topics: Array, Two Pointers, Union Find, Graph, Sorting
• 2543. Most Popular Video Creator - Medium - SortingYou are given two string arrays creators and ids, and an integer array views, all of length n. The ith video on a platform was created by creators[i],... Topics: Array, Hash Table, String, Sorting, Heap (Priority Queue)

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