Segment Tree

Hard | Binary Search, Design, Binary Indexed Tree, Segment Tree

Hard | Array, Tree, Depth-First Search, Binary Indexed Tree, Segment Tree

Hard | Array, String, Divide and Conquer, Tree, Segment Tree

Hard | Array, Dynamic Programming, Segment Tree, Queue, Heap (Priority Queue), Prefix Sum, Monotonic Queue

Hard | String, Greedy, Binary Indexed Tree, Segment Tree

Medium | Array, Binary Indexed Tree, Segment Tree, Sorting

Hard | Array, Binary Search, Bit Manipulation, Segment Tree

Medium | Array, String, Binary Search, Dynamic Programming, Greedy, Trie, Segment Tree, Rolling Hash, String Matching, Hash Function

Hard | Array, String, Binary Search, Dynamic Programming, Greedy, Segment Tree, Rolling Hash, String Matching, Hash Function

Medium | Array, Math, Binary Indexed Tree, Segment Tree, Geometry, Sorting, Enumeration