Leetcode 2756. Query Batching

Given a sequence of queries with per-query costs and batch-level constraints (like max batch size, per-batch overhead, or dependency/ordering rules), partition the sequence into batches to minimize total processing cost or latency. This typically requires interval/partition DP or greedy + auxiliary data structures (priority queue, sliding window, segment tree, or convex-hull/monotonic optimization) to compute optimal groupings efficiently.