CodeSearch
pick a problem · learn it with an AI tutor — hints, not spoilers
37,000 problems · all sources
- 3181. Maximum Total Reward Using Operations IIHardLeetCodeArrayDynamic ProgrammingBit ManipulationSorting
- 3187. Peaks in ArrayHardLeetCodeArrayBinary Indexed TreeSegment Tree
- 3188. Find Top Scoring Students IIHardLeetCodeDatabase
- 3193. Count the Number of InversionsHardLeetCodeArrayDynamic Programming
- 3197. Find the Minimum Area to Cover All Ones IIHardLeetCodeArrayMatrixEnumeration
- 32. Longest Valid ParenthesesHardLeetCodeStringDynamic ProgrammingStack
- 3203. Find Minimum Diameter After Merging Two TreesHardLeetCodeTreeDepth-First SearchBreadth-First SearchGraph Theory
- 3209. Number of Subarrays With AND Value of KHardLeetCodeArrayBinary SearchBit ManipulationSegment Tree
- 321. Create Maximum NumberHardLeetCodeArrayTwo PointersStackGreedy
- 3213. Construct String with Minimum CostHardLeetCodeArrayStringDynamic ProgrammingSuffix Array
- 3214. Year on Year Growth RateHardLeetCodeDatabase
- 3219. Minimum Cost for Cutting Cake IIHardLeetCodeArrayGreedySorting
- 3225. Maximum Score From Grid OperationsHardLeetCodeArrayDynamic ProgrammingMatrixPrefix Sum
- 3229. Minimum Operations to Make Array Equal to TargetHardLeetCodeArrayDynamic ProgrammingStackGreedy
- 3231. Minimum Number of Increasing Subsequence to Be RemovedHardLeetCodeArrayBinary Search
- 3235. Check if the Rectangle Corner Is ReachableHardLeetCodeArrayMathDepth-First SearchBreadth-First Search
- 3236. CEO Subordinate HierarchyHardLeetCodeDatabase
- 3241. Time Taken to Mark All NodesHardLeetCodeDynamic ProgrammingTreeDepth-First SearchGraph Theory
- 3244. Shortest Distance After Road Addition Queries IIHardLeetCodeArrayGreedyGraph TheoryOrdered Set
- 3245. Alternating Groups IIIHardLeetCodeArrayBinary Indexed TreeOrdered Set
- 3250. Find the Count of Monotonic Pairs IHardLeetCodeArrayMathDynamic ProgrammingCombinatorics
- 3251. Find the Count of Monotonic Pairs IIHardLeetCodeArrayMathDynamic ProgrammingCombinatorics
- 3256. Maximum Value Sum by Placing Three Rooks IHardLeetCodeArrayDynamic ProgrammingMatrixEnumeration
- 3257. Maximum Value Sum by Placing Three Rooks IIHardLeetCodeArrayDynamic ProgrammingMatrixEnumeration
- 3260. Find the Largest Palindrome Divisible by KHardLeetCodeMathStringDynamic ProgrammingGreedy
- 3261. Count Substrings That Satisfy K-Constraint IIHardLeetCodeArrayStringBinary SearchSliding Window
- 3266. Final Array State After K Multiplication Operations IIHardLeetCodeArrayHeap (Priority Queue)Simulation
- 3267. Count Almost Equal Pairs IIHardLeetCodeArrayHash TableSortingCounting
- 3268. Find Overlapping Shifts IIHardLeetCodeDatabase
- 3269. Constructing Two Increasing ArraysHardLeetCodeArrayDynamic Programming
- 327. Count of Range SumHardLeetCodeArrayBinary SearchDivide and ConquerBinary Indexed Tree
- 3272. Find the Count of Good IntegersHardLeetCodeHash TableMathCombinatoricsEnumeration
- 3273. Minimum Amount of Damage Dealt to BobHardLeetCodeArrayGreedySorting
- 3276. Select Cells in Grid With Maximum ScoreHardLeetCodeArrayDynamic ProgrammingBit ManipulationMatrix
- 3277. Maximum XOR Score Subarray QueriesHardLeetCodeArrayDynamic Programming
- 3279. Maximum Total Area Occupied by PistonsHardLeetCodeArrayHash TableStringSimulation
- 3283. Maximum Number of Moves to Kill All PawnsHardLeetCodeArrayMathBit ManipulationBreadth-First Search
- 3287. Find the Maximum Sequence Value of ArrayHardLeetCodeArrayDynamic ProgrammingBit Manipulation
- 3288. Length of the Longest Increasing PathHardLeetCodeArrayBinary SearchSorting
- 329. Longest Increasing Path in a MatrixHardLeetCodeArrayDynamic ProgrammingDepth-First SearchBreadth-First Search
- 3292. Minimum Number of Valid Strings to Form Target IIHardLeetCodeArrayStringBinary SearchDynamic Programming
- 3298. Count Substrings That Can Be Rearranged to Contain a String IIHardLeetCodeHash TableStringSliding Window
- 3299. Sum of Consecutive SubsequencesHardLeetCodeArrayHash TableDynamic Programming
- 330. Patching ArrayHardLeetCodeArrayGreedy
- 3303. Find the Occurrence of First Almost Equal SubstringHardLeetCodeStringString Matching
- 3307. Find the K-th Character in String Game IIHardLeetCodeMathBit ManipulationRecursion
- 3311. Construct 2D Grid Matching Graph LayoutHardLeetCodeArrayHash TableGraph TheoryMatrix
- 3312. Sorted GCD Pair QueriesHardLeetCodeArrayHash TableMathBinary Search
- 3313. Find the Last Marked Nodes in TreeHardLeetCodeTreeDepth-First Search
- 3317. Find the Number of Possible Ways for an EventHardLeetCodeMathDynamic ProgrammingCombinatorics
- 332. Reconstruct ItineraryHardLeetCodeArrayStringDepth-First SearchGraph Theory
- 3320. Count The Number of Winning SequencesHardLeetCodeStringDynamic Programming
- 3321. Find X-Sum of All K-Long Subarrays IIHardLeetCodeArrayHash TableSliding WindowHeap (Priority Queue)
- 3327. Check if DFS Strings Are PalindromesHardLeetCodeArrayHash TableStringTree
- 3329. Count Substrings With K-Frequency Characters IIHardLeetCodeHash TableStringSliding Window
- 3333. Find the Original Typed String IIHardLeetCodeStringDynamic ProgrammingPrefix Sum
- 3336. Find the Number of Subsequences With Equal GCDHardLeetCodeArrayMathDynamic ProgrammingNumber Theory
- 3337. Total Characters in String After Transformations IIHardLeetCodeHash TableMathStringDynamic Programming
- 3343. Count Number of Balanced PermutationsHardLeetCodeMathStringDynamic ProgrammingCombinatorics
- 3347. Maximum Frequency of an Element After Performing Operations IIHardLeetCodeArrayBinary SearchSliding WindowSorting