Segment and Fenwick Tree Problems

Practise 25 segment tree and Fenwick tree problems from basics to advanced in Python, C++, Java, JavaScript and TypeScript.

This track covers point updates and range queries, Fenwick trees, segment trees, ordered sets and offline queries. The problems run from easy to hard, so each idea builds on the one before. Every problem is judged against hidden test cases in five languages.

What you will practise:

• Core Problems: 20 medium problems such as Diary Bookings, Live Range Minimum and Hotel Room Upgrades.
• Hard Problems: 5 hard problems such as Out-of-Order Pairs, Ordered in Both and Kth Smallest in Ranges.

Start with the basics, move on to the core problems, and try the hard ones when the pattern feels natural. Every problem comes with worked examples and clear constraints. For a full path across all of DSA, see Revquix 80, Revquix 150 and Revquix 300.