3605. 数组的最小稳定性因子
Hard | Array, Math, Binary Search, Greedy, Segment Tree, Number Theory
Segment Tree
3624. 具有相等popcount深度K的整数数量 II
Hard | Array, Divide and Conquer, Binary Indexed Tree, Segment Tree
3691. 最大子数组值总和 II
Hard | Array, Greedy, Segment Tree, Heap (Priority Queue)
3719. 最长平衡子数组 I
Medium | Array, Hash Table, Divide and Conquer, Segment Tree, Prefix Sum
3721. 最长平衡子数组 II
Hard | Array, Hash Table, Divide and Conquer, Segment Tree, Prefix Sum
3737. 统计具有主要元素的子数组数量 I
Medium | Array, Hash Table, Divide and Conquer, Segment Tree, Merge Sort, Counting, Prefix Sum
3739. 计算多数元素子数组 II
Hard | Array, Hash Table, Divide and Conquer, Segment Tree, Merge Sort, Prefix Sum
3762. 使子数组相等的最小操作次数
Hard | Array, Math, Binary Search, Segment Tree
3768. 固定长度子数组的最小逆序对数量
Hard | Array, Segment Tree, Sliding Window
3777. 使交替子串的最小删除次数
Hard | String, Segment Tree