Dynamic programming patterns and optimizations
Maximum contiguous subarray sum in O(n) time using linear DP.
Count numbers in [L, R] satisfying digit-level constraints using memoized recursion.
Dynamic line container with O(log C) insert and min query using Li Chao segment tree.