| 2867 | Count Valid Paths in a Tree | MathDynamic ProgrammingTree+2 | Hard |
| 2872 | Maximum Number of K-Divisible Components | TreeDepth-First Search | Hard |
| 2876 | Count Visited Nodes in a Directed Graph | Dynamic ProgrammingGraphMemoization | Hard |
| 2897 | Apply Operations on Array to Maximize Sum of Squares | ArrayHash TableGreedy+1 | Hard |
| 2902 | Count of Sub-Multisets With Bounded Sum | ArrayHash TableDynamic Programming+1 | Hard |
| 2911 | Minimum Changes to Make K Semi-palindromes | Two PointersStringDynamic Programming | Hard |
| 2916 | Subarrays Distinct Element Sum of Squares II | ArrayDynamic ProgrammingBinary Indexed Tree+1 | Hard |
| 2920 | Maximum Points After Collecting Coins From All Nodes | ArrayDynamic ProgrammingBit Manipulation+3 | Hard |
| 2926 | Maximum Balanced Subsequence Sum | ArrayBinary SearchDynamic Programming+2 | Hard |
| 2931 | Maximum Spending After Buying Items | ArrayGreedySorting+2 | Hard |
| 2935 | Maximum Strong Pair XOR II | ArrayHash TableBit Manipulation+2 | Hard |
| 2940 | Find Building Where Alice and Bob Can Meet | ArrayBinary SearchStack+4 | Hard |
| 2945 | Find Maximum Non-decreasing Array Length | ArrayBinary SearchDynamic Programming+4 | Hard |
| 2949 | Count Beautiful Substrings II | Hash TableMathString+2 | Hard |
| 2953 | Count Complete Substrings | Hash TableStringSliding Window | Hard |
| 2954 | Count the Number of Infection Sequences | ArrayMathCombinatorics | Hard |
| 2959 | Number of Possible Sets of Closing Branches | Bit ManipulationGraphHeap (Priority Queue)+2 | Hard |
| 2963 | Count the Number of Good Partitions | ArrayHash TableMath+1 | Hard |
| 2968 | Apply Operations to Maximize Frequency Score | ArrayBinary SearchSliding Window+2 | Hard |
| 2972 | Count the Number of Incremovable Subarrays II | ArrayTwo PointersBinary Search | Hard |
| 2973 | Find Number of Coins to Place in Tree Nodes | Dynamic ProgrammingTreeDepth-First Search+2 | Hard |
| 2977 | Minimum Cost to Convert String II | ArrayStringDynamic Programming+3 | Hard |
| 2983 | Palindrome Rearrangement Queries | Hash TableStringPrefix Sum | Hard |
| 2999 | Count the Number of Powerful Integers | MathStringDynamic Programming | Hard |
| 3003 | Maximize the Number of Partitions After Operations | StringDynamic ProgrammingBit Manipulation+1 | Hard |
| 3008 | Find Beautiful Indices in the Given Array II | Two PointersStringBinary Search+3 | Hard |
| 3013 | Divide an Array Into Subarrays With Minimum Cost II | ArrayHash TableSliding Window+1 | Hard |
| 3017 | Count the Number of Houses at a Certain Distance II | GraphPrefix Sum | Hard |
| 3022 | Minimize OR of Remaining Elements Using Operations | ArrayGreedyBit Manipulation | Hard |
| 3027 | Find the Number of Ways to Place People II | ArrayMathGeometry+2 | Hard |
| 3031 | Minimum Time to Revert Word to Initial State II | StringRolling HashString Matching+1 | Hard |
| 3036 | Number of Subarrays That Match a Pattern II | ArrayRolling HashString Matching+1 | Hard |
| 3041 | Maximize Consecutive Elements in an Array After Modification | ArrayDynamic ProgrammingSorting | Hard |
| 3045 | Count Prefix and Suffix Pairs II | ArrayStringTrie+3 | Hard |
| 3049 | Earliest Second to Mark Indices II | ArrayBinary SearchGreedy+1 | Hard |
| 3068 | Find the Maximum Sum of Node Values | ArrayDynamic ProgrammingGreedy+3 | Hard |
| 3072 | Distribute Elements Into Two Arrays II | ArrayBinary Indexed TreeSegment Tree+1 | Hard |
| 3077 | Maximum Strength of K Disjoint Subarrays | ArrayDynamic ProgrammingPrefix Sum | Hard |
| 3082 | Find the Sum of the Power of All Subsequences | ArrayDynamic Programming | Hard |
| 3086 | Minimum Moves to Pick K Ones | ArrayGreedySliding Window+1 | Hard |
| 3093 | Longest Common Suffix Queries | ArrayStringTrie | Hard |
| 3098 | Find the Sum of Subsequence Powers | ArrayDynamic ProgrammingSorting | Hard |
| 3102 | Minimize Manhattan Distances | ArrayMathGeometry+2 | Hard |
| 3108 | Minimum Cost Walk in Weighted Graph | ArrayBit ManipulationUnion Find+1 | Hard |
| 3113 | Find the Number of Subarrays Where Boundary Elements Are Maximum | ArrayBinary SearchStack+1 | Hard |
| 3116 | Kth Smallest Amount With Single Denomination Combination | ArrayMathBinary Search+3 | Hard |
| 3117 | Minimum Sum of Values by Dividing Array | ArrayBinary SearchDynamic Programming+3 | Hard |
| 3123 | Find Edges in Shortest Paths | Depth-First SearchBreadth-First SearchGraph+2 | Hard |
| 3130 | Find All Possible Stable Binary Arrays II | Dynamic ProgrammingPrefix Sum | Hard |
| 3134 | Find the Median of the Uniqueness Array | ArrayHash TableBinary Search+1 | Hard |