Binary Indexed Tree Problems
33 Binary Indexed Tree LeetCode problems · Browse tasks by difficulty and choose your next practice problem.
Learn the coding interview patterns behind these problems.
All Binary Indexed Tree problems
218 The Skyline Problem Hard307 Range Sum Query - Mutable Medium315 Count of Smaller Numbers After Self Hard327 Count of Range Sum Hard406 Queue Reconstruction by Height Medium493 Reverse Pairs Hard673 Number of Longest Increasing Subsequence Medium1157 Online Majority Element In Subarray Hard1395 Count Number of Teams Medium1409 Queries on a Permutation With Key Medium1505 Minimum Possible Integer After at Most K Adjacent Swaps On Digits Hard1649 Create Sorted Array through Instructions Hard1964 Find the Longest Valid Obstacle Course at Each Position Hard2179 Count Good Triplets in an Array Hard2193 Minimum Number of Moves to Make Palindrome Hard2250 Count Number of Rectangles Containing Each Point Medium2286 Booking Concert Tickets in Groups Hard2407 Longest Increasing Subsequence II Hard2424 Longest Uploaded Prefix Medium2426 Number of Pairs Satisfying Inequality Hard2552 Count Increasing Quadruplets Hard2659 Make Array Empty Hard2736 Maximum Sum Queries Hard2916 Subarrays Distinct Element Sum of Squares II Hard2926 Maximum Balanced Subsequence Sum Hard2940 Find Building Where Alice and Bob Can Meet Hard3072 Distribute Elements Into Two Arrays II Hard3161 Block Placement Queries Hard3187 Peaks in Array Hard3245 Alternating Groups III Hard3380 Maximum Area Rectangle With Point Constraints I Medium3382 Maximum Area Rectangle With Point Constraints II Hard3515 Shortest Path in a Weighted Tree Hard