I am learning segment tree recently. But when I search the "data structures" tag I found some problems which obviously can't be solved by a segment tree. So can anyone please suggest some segment tree problems that are suitable for me (with difficulty 1600-1800)?
By the way, I suggest using tags of "segment tree" "deque" "BIT" "stack" instead of "data structures". It makes searching problems easier.(Sorry for my poor English :D)
Usually Problems with rating [1600 — 1800] don`t require advanced data structures like segment tree or bit.
Just problems that are suitable for people who has just started to learn segment tree.
Here
Check this blog out
In range queries section of this site.
https://www.hackerearth.com/practice/data-structures/advanced-data-structures/segment-trees/practice-problems/