Practice problems across 75+ categories
Practice problems frequently asked at Segment Tree • 65 problems | 2 Easy | 16 Medium | 47 Hard
| # | Problem | Difficulty | Topics |
|---|---|---|---|
| 46 | Minimum Sum of Values by Dividing Array | Hard | ArrayBinary SearchDynamic Programming |
| 47 | Minimum Threshold for Inversion Pairs Count | Medium | ArrayBinary SearchBinary Indexed Tree |
| 48 | My Calendar I | Medium | ArrayBinary SearchDesign |
| 49 | My Calendar II | Medium | ArrayBinary SearchDesign |
| 50 | My Calendar III | Hard | Binary SearchDesignSegment Tree |
| 51 | Number of Longest Increasing Subsequence | Medium | ArrayDynamic ProgrammingBinary Indexed Tree |
| 52 | Number of Pairs Satisfying Inequality | Hard | ArrayBinary SearchDivide and Conquer |
| 53 | Number of Subarrays With AND Value of K | Hard | ArrayBinary SearchBit Manipulation |
| 54 | Online Majority Element In Subarray | Hard | ArrayBinary SearchDesign |
| 55 | Peaks in Array | Hard | ArrayBinary Indexed TreeSegment Tree |
| 56 | Queue Reconstruction by Height | Medium | ArrayBinary Indexed TreeSegment Tree |
| 57 | Range Frequency Queries | Medium | ArrayHash TableBinary Search |
| 58 | Range Module | Hard | DesignSegment TreeOrdered Set |
| 59 | Range Sum Query 2D - Mutable | Medium | ArrayDesignBinary Indexed Tree |
| 60 | Range Sum Query - Mutable | Easy | ArrayDivide and ConquerDesign |
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.
