Divide and Conquer

Hard | Array, Hash Table, Divide and Conquer, Segment Tree, Prefix Sum

Medium | Array, Hash Table, Divide and Conquer, Segment Tree, Merge Sort, Counting, Prefix Sum

Hard | Array, Hash Table, Divide and Conquer, Segment Tree, Merge Sort, Prefix Sum

Medium | Array, Binary Search, Divide and Conquer, Sorting, Quickselect

Hard | Array, Divide and Conquer, Dynamic Programming, Queue, Prefix Sum, Monotonic Queue

Hard | Math, Divide and Conquer, Combinatorics, Number Theory

Hard | String, Divide and Conquer, Prefix Sum

Hard | Array, Divide and Conquer, Dynamic Programming, Segment Tree

Hard | Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set

Medium | Array, String, Divide and Conquer, Sorting, Heap (Priority Queue), Radix Sort, Quickselect