← back
Segment Tree
66 questions · 0 seen
All Segment Tree problems
Segment Tree
1
Actions
⊣ Practice
Segment Tree
⊣ Quiz
Segment Tree
Problems
⊣ 218 The Skyline Problem
Hard
⊣ 307 Range Sum Query - Mutable
Medium
⊣ 315 Count of Smaller Numbers After Self
Hard
⊣ 327 Count of Range Sum
Hard
⊣ 406 Queue Reconstruction by Height
Medium
⊣ 493 Reverse Pairs
Hard
⊣ 673 Number of Longest Increasing Subsequence
Medium
⊣ 699 Falling Squares
Hard
⊣ 715 Range Module
Hard
⊣ 729 My Calendar I
Medium
⊣ 731 My Calendar II
Medium
⊣ 732 My Calendar III
Hard
⊣ 850 Rectangle Area II
Hard
⊣ 1157 Online Majority Element In Subarray
Hard
⊣ 1395 Count Number of Teams
Medium
⊣ 1505 Minimum Possible Integer After at Most K Adjacent Swaps On Digits
Hard
⊣ 1521 Find a Value of a Mysterious Function Closest to Target
Hard
⊣ 1622 Fancy Sequence
Hard
⊣ 1649 Create Sorted Array through Instructions (PRO)
Hard
⊣ 1687 Delivering Boxes from Storage to Ports
Hard
⊣ 2080 Range Frequency Queries
Medium
⊣ 2179 Count Good Triplets in an Array
Hard
⊣ 2213 Longest Substring of One Repeating Character
Hard
⊣ 2276 Count Integers in Intervals
Hard
⊣ 2286 Booking Concert Tickets in Groups
Hard
⊣ 2407 Longest Increasing Subsequence II
Hard
⊣ 2424 Longest Uploaded Prefix
Medium
⊣ 2426 Number of Pairs Satisfying Inequality
Hard
⊣ 2569 Handling Sum Queries After Update
Hard
⊣ 2659 Make Array Empty
Hard
⊣ 2736 Maximum Sum Queries
Hard
⊣ 2916 Subarrays Distinct Element Sum of Squares II
Hard
⊣ 2926 Maximum Balanced Subsequence Sum
Hard
⊣ 2940 Find Building Where Alice and Bob Can Meet
Hard
⊣ 3072 Distribute Elements Into Two Arrays II
Hard
⊣ 3117 Minimum Sum of Values by Dividing Array
Hard
⊣ 3161 Block Placement Queries
Hard
⊣ 3165 Maximum Sum of Subsequence With Non-adjacent Elements
Hard
⊣ 3171 Find Subarray With Bitwise OR Closest to K
Hard
⊣ 3187 Peaks in Array
Hard
⊣ 3209 Number of Subarrays With AND Value of K
Hard
⊣ 3291 Minimum Number of Valid Strings to Form Target I
Medium
⊣ 3292 Minimum Number of Valid Strings to Form Target II
Hard
⊣ 3380 Maximum Area Rectangle With Point Constraints I
Medium
⊣ 3382 Maximum Area Rectangle With Point Constraints II
Hard
⊣ 3410 Maximize Subarray Sum After Removing All Occurrences of One Element
Hard
⊣ 3420 Count Non-Decreasing Subarrays After K Operations
Hard
⊣ 3454 Separate Squares II
Hard
⊣ 3477 Fruits Into Baskets II
Easy
⊣ 3479 Fruits Into Baskets III
Medium
⊣ 3480 Maximize Subarrays After Removing One Conflicting Pair
Hard
⊣ 3501 Maximize Active Section with Trade II
Hard
⊣ 3515 Shortest Path in a Weighted Tree
Hard
⊣ 3525 Find X Value of Array II
Hard
⊣ 3569 Maximize Count of Distinct Primes After Split
Hard
⊣ 3605 Minimum Stability Factor of Array
Hard
⊣ 3624 Number of Integers With Popcount-Depth Equal to K II
Hard
⊣ 3691 Maximum Total Subarray Value II
Hard
⊣ 3719 Longest Balanced Subarray I
Medium
⊣ 3721 Longest Balanced Subarray II
Hard
⊣ 3737 Count Subarrays With Majority Element I
Medium
⊣ 3739 Count Subarrays With Majority Element II
Hard
⊣ 3762 Minimum Operations to Equalize Subarrays
Hard
⊣ 3768 Minimum Inversion Count in Subarrays of Fixed Length
Hard
⊣ 3777 Minimum Deletions to Make Alternating Substring (PRO)
Hard
⊣ 3841 Palindromic Path Queries in a Tree
Hard