Tag: binary-indexed-tree
- Alternating Groups III
- Block Placement Queries
- Booking Concert Tickets in Groups
- Count Good Triplets in an Array
- Count Increasing Quadruplets
- Count Number of Rectangles Containing Each Point
- Count Number of Teams
- Count of Range Sum
- Count of Smaller Numbers After Self
- Count Subarrays With More Ones Than Zeros
- Count the Number of K-Big Indices
- Create Sorted Array through Instructions
- Design Most Recently Used Queue
- Distribute Elements Into Two Arrays II
- Find Building Where Alice and Bob Can Meet
- Find the Index of Permutation
- Find the Longest Valid Obstacle Course at Each Position
- K Empty Slots
- Longest Increasing Subsequence II
- Longest Uploaded Prefix
- Make Array Empty
- Maximum Area Rectangle With Point Constraints I
- Maximum Area Rectangle With Point Constraints II
- Maximum Balanced Subsequence Sum
- Maximum Number of Intersections on the Chart
- Maximum Profitable Triplets With Increasing Prices I
- Maximum Profitable Triplets With Increasing Prices II
- Maximum Sum Queries
- Minimum Number of Moves to Make Palindrome
- Minimum Possible Integer After at Most K Adjacent Swaps On Digits
- Number of Longest Increasing Subsequence
- Number of Pairs Satisfying Inequality
- Online Majority Element In Subarray
- Peaks in Array
- Queries on a Permutation With Key
- Queue Reconstruction by Height
- Range Sum Query 2D - Mutable
- Range Sum Query - Mutable
- Reverse Pairs
- Subarrays Distinct Element Sum of Squares II
- The Skyline Problem