Segment Tree

66 LeetCode questions

Difficulty Distribution

Easy
2
3%
Medium
17
26%
Hard
47
71%

Top Companies

Questions

TitleDifficulty
Range Sum Query - MutableMedium
Create Sorted Array through InstructionsHard
Reverse PairsHard
Separate Squares IIHard
Longest Balanced Subarray IIHard
Fancy SequenceHard
Count of Smaller Numbers After SelfHard
Longest Balanced Subarray IMedium
Count of Range SumHard
Number of Pairs Satisfying InequalityHard
My Calendar IMedium
Queue Reconstruction by HeightMedium
The Skyline ProblemHard
Maximize Subarrays After Removing One Conflicting PairHard
Fruits Into Baskets IIEasy
Count Number of TeamsMedium
Range Sum Query 2D - MutableMedium
Fruits Into Baskets IIIMedium
Range ModuleHard
Find Building Where Alice and Bob Can MeetHard
Count the Number of K-Big IndicesHard
Subarrays Distinct Element Sum of Squares IIHard
Maximum Balanced Subsequence SumHard
My Calendar IIMedium
Falling SquaresHard
Number of Longest Increasing SubsequenceMedium
Minimum Stability Factor of ArrayHard
Maximum Total Subarray Value IIHard
Find a Value of a Mysterious Function Closest to TargetHard
Distribute Elements Into Two Arrays IIHard
Count Good Triplets in an ArrayHard
Block Placement QueriesHard
Count Integers in IntervalsHard
Number of Subarrays With AND Value of KHard
Rectangle Area IIHard
Subarrays Distinct Element Sum of Squares IEasy
Count Subarrays With Majority Element IMedium
Count Non-Decreasing Subarrays After K OperationsHard
Maximum Area Rectangle With Point Constraints IMedium
Longest Increasing Subsequence IIHard
Maximize Subarray Sum After Removing All Occurrences of One ElementHard
My Calendar IIIHard
Maximum Sum of Subsequence With Non-adjacent ElementsHard
Longest Uploaded PrefixMedium
K Empty SlotsHard
Amount of New Area Painted Each DayHard
Booking Concert Tickets in GroupsHard
Count Subarrays With More Ones Than ZerosMedium
Minimum Sum of Values by Dividing ArrayHard
Maximum Area Rectangle With Point Constraints IIHard
Make Array EmptyHard
Power Update After K-th Largest Insertion IMedium
Maximize Count of Distinct Primes After SplitHard
Maximum Profitable Triplets With Increasing Prices IMedium
Maximum Profitable Triplets With Increasing Prices IIHard
Shortest Path in a Weighted TreeHard
Minimum Number of Valid Strings to Form Target IMedium
Online Majority Element In SubarrayHard
Delivering Boxes from Storage to PortsHard
Longest Substring of One Repeating CharacterHard
Range Frequency QueriesMedium
Find X Value of Array IIHard
Find Subarray With Bitwise OR Closest to KHard
Peaks in ArrayHard
Handling Sum Queries After UpdateHard
Maximum Sum of Alternating Subsequence With Distance at Least KHard

Showing 66 of 66 questions