Practice problems across 75+ categories
Practice problems frequently asked at Binary Indexed Tree • 42 problems | 1 Easy | 12 Medium | 29 Hard
| # | Problem | Difficulty | Topics |
|---|---|---|---|
| 31 | Minimum Threshold for Inversion Pairs Count | Medium | ArrayBinary SearchBinary Indexed Tree |
| 32 | Number of Longest Increasing Subsequence | Medium | ArrayDynamic ProgrammingBinary Indexed Tree |
| 33 | Number of Pairs Satisfying Inequality | Hard | ArrayBinary SearchDivide and Conquer |
| 34 | Online Majority Element In Subarray | Hard | ArrayBinary SearchDesign |
| 35 | Peaks in Array | Hard | ArrayBinary Indexed TreeSegment Tree |
| 36 | Queries on a Permutation With Key | Medium | ArrayBinary Indexed TreeSimulation |
| 37 | Queue Reconstruction by Height | Medium | ArrayBinary Indexed TreeSegment Tree |
| 38 | Range Sum Query 2D - Mutable | Medium | ArrayDesignBinary Indexed Tree |
| 39 | Range Sum Query - Mutable | Easy | ArrayDivide and ConquerDesign |
| 40 | Reverse Pairs | Hard | ArrayBinary SearchDivide and Conquer |
| 41 | Shortest Path in a Weighted Tree | Hard | ArrayTreeDepth-First Search |
| 42 | Subarrays Distinct Element Sum of Squares II | Hard | ArrayDynamic ProgrammingBinary Indexed Tree |
| 43 | The Skyline Problem | Hard | ArrayDivide and ConquerBinary Indexed Tree |
Powerful online tools to boost your productivity
Coding Ground For Developers
Code, Edit, Run and ShareIgnite your coding potential on Coding Ground - an immersive online platform for hands-on learning, collaboration, and skill development.
