686 problems · Solve with AI-powered hints & explanations
| # | Title | Difficulty |
|---|---|---|
| 2867 | Count Valid Paths in a Tree | Hard |
| 2872 | Maximum Number of K-Divisible Components | Hard |
| 2876 | Count Visited Nodes in a Directed Graph |
Page 11 of 14
| Hard |
| 2897 | Apply Operations on Array to Maximize Sum of Squares | Hard |
| 2902 | Count of Sub-Multisets With Bounded Sum | Hard |
| 2911 | Minimum Changes to Make K Semi-palindromes | Hard |
| 2916 | Subarrays Distinct Element Sum of Squares II | Hard |
| 2920 | Maximum Points After Collecting Coins From All Nodes | Hard |
| 2926 | Maximum Balanced Subsequence Sum | Hard |
| 2931 | Maximum Spending After Buying Items | Hard |
| 2935 | Maximum Strong Pair XOR II | Hard |
| 2940 | Find Building Where Alice and Bob Can Meet | Hard |
| 2945 | Find Maximum Non-decreasing Array Length | Hard |
| 2949 | Count Beautiful Substrings II | Hard |
| 2953 | Count Complete Substrings | Hard |
| 2954 | Count the Number of Infection Sequences | Hard |
| 2959 | Number of Possible Sets of Closing Branches | Hard |
| 2963 | Count the Number of Good Partitions | Hard |
| 2968 | Apply Operations to Maximize Frequency Score | Hard |
| 2972 | Count the Number of Incremovable Subarrays II | Hard |
| 2973 | Find Number of Coins to Place in Tree Nodes | Hard |
| 2977 | Minimum Cost to Convert String II | Hard |
| 2983 | Palindrome Rearrangement Queries | Hard |
| 2999 | Count the Number of Powerful Integers | Hard |
| 3003 | Maximize the Number of Partitions After Operations | Hard |
| 3008 | Find Beautiful Indices in the Given Array II | Hard |
| 3013 | Divide an Array Into Subarrays With Minimum Cost II | Hard |
| 3017 | Count the Number of Houses at a Certain Distance II | Hard |
| 3022 | Minimize OR of Remaining Elements Using Operations | Hard |
| 3027 | Find the Number of Ways to Place People II | Hard |
| 3031 | Minimum Time to Revert Word to Initial State II | Hard |
| 3036 | Number of Subarrays That Match a Pattern II | Hard |
| 3041 | Maximize Consecutive Elements in an Array After Modification | Hard |
| 3045 | Count Prefix and Suffix Pairs II | Hard |
| 3049 | Earliest Second to Mark Indices II | Hard |
| 3068 | Find the Maximum Sum of Node Values | Hard |
| 3072 | Distribute Elements Into Two Arrays II | Hard |
| 3077 | Maximum Strength of K Disjoint Subarrays | Hard |
| 3082 | Find the Sum of the Power of All Subsequences | Hard |
| 3086 | Minimum Moves to Pick K Ones | Hard |
| 3093 | Longest Common Suffix Queries | Hard |
| 3098 | Find the Sum of Subsequence Powers | Hard |
| 3102 | Minimize Manhattan Distances | Hard |
| 3108 | Minimum Cost Walk in Weighted Graph | Hard |
| 3113 | Find the Number of Subarrays Where Boundary Elements Are Maximum | Hard |
| 3116 | Kth Smallest Amount With Single Denomination Combination | Hard |
| 3117 | Minimum Sum of Values by Dividing Array | Hard |
| 3123 | Find Edges in Shortest Paths | Hard |
| 3130 | Find All Possible Stable Binary Arrays II | Hard |
| 3134 | Find the Median of the Uniqueness Array | Hard |
© 2026 PhantomCodeAI. All rights reserved.