CodeSearch
pick a problem · learn it with an AI tutor — hints, not spoilers
37,000 problems · all sources
- 3377. Digit Operations to Make Two Integers EqualMediumLeetCodeMathGraph TheoryHeap (Priority Queue)Number Theory
- 3380. Maximum Area Rectangle With Point Constraints IMediumLeetCodeArrayMathBinary Indexed TreeSegment Tree
- 3381. Maximum Subarray Sum With Length Divisible by KMediumLeetCodeArrayHash TablePrefix Sum
- 3387. Maximize Amount After Two Days of ConversionsMediumLeetCodeArrayStringDepth-First SearchBreadth-First Search
- 3388. Count Beautiful Splits in an ArrayMediumLeetCodeArrayDynamic Programming
- 339. Nested List Weight SumMediumLeetCodeDepth-First SearchBreadth-First Search
- 3391. Design a 3D Binary Matrix with Efficient Layer TrackingMediumLeetCodeArrayHash TableDesignHeap (Priority Queue)
- 3393. Count Paths With the Given XOR ValueMediumLeetCodeArrayDynamic ProgrammingBit ManipulationMatrix
- 3394. Check if Grid can be Cut into SectionsMediumLeetCodeArraySorting
- 3397. Maximum Number of Distinct Elements After OperationsMediumLeetCodeArrayGreedySorting
- 34. Find First and Last Position of Element in Sorted ArrayMediumLeetCodeArrayBinary Search
- 340. Longest Substring with At Most K Distinct CharactersMediumLeetCodeHash TableStringSliding Window
- 3400. Maximum Number of Matching Indices After Right ShiftsMediumLeetCodeArrayTwo PointersSimulation
- 3403. Find the Lexicographically Largest String From the Box IMediumLeetCodeTwo PointersStringEnumeration
- 3404. Count Special SubsequencesMediumLeetCodeArrayHash TableMathEnumeration
- 3408. Design Task ManagerMediumLeetCodeHash TableDesignHeap (Priority Queue)Ordered Set
- 3409. Longest Subsequence With Decreasing Adjacent DifferenceMediumLeetCodeArrayDynamic Programming
- 341. Flatten Nested List IteratorMediumLeetCodeStackTreeDepth-First SearchDesign
- 3412. Find Mirror Score of a StringMediumLeetCodeHash TableStringStackSimulation
- 3413. Maximum Coins From K Consecutive BagsMediumLeetCodeArrayBinary SearchGreedySliding Window
- 3418. Maximum Amount of Money Robot Can EarnMediumLeetCodeArrayDynamic ProgrammingMatrix
- 3419. Minimize the Maximum Edge Weight of GraphMediumLeetCodeBinary SearchDepth-First SearchBreadth-First SearchGraph Theory
- 3421. Find Students Who ImprovedMediumLeetCodeDatabase
- 3422. Minimum Operations to Make Subarray Elements EqualMediumLeetCodeArrayHash TableMathSliding Window
- 3424. Minimum Cost to Make Arrays IdenticalMediumLeetCodeArrayGreedySorting
- 3428. Maximum and Minimum Sums of at Most Size K SubsequencesMediumLeetCodeArrayMathDynamic ProgrammingSorting
- 3429. Paint House IVMediumLeetCodeArrayDynamic Programming
- 343. Integer BreakMediumLeetCodeMathDynamic Programming
- 3431. Minimum Unlocked Indices to Sort NumsMediumLeetCodeArrayHash Table
- 3433. Count Mentions Per UserMediumLeetCodeArrayMathSortingSimulation
- 3434. Maximum Frequency After Subarray OperationMediumLeetCodeArrayHash TableDynamic ProgrammingGreedy
- 3437. Permutations IIIMediumLeetCodeArrayBacktracking
- 3439. Reschedule Meetings for Maximum Free Time IMediumLeetCodeArrayGreedySliding Window
- 3440. Reschedule Meetings for Maximum Free Time IIMediumLeetCodeArrayGreedyEnumeration
- 3443. Maximum Manhattan Distance After K ChangesMediumLeetCodeHash TableMathStringCounting
- 3446. Sort Matrix by DiagonalsMediumLeetCodeArraySortingMatrix
- 3447. Assign Elements to Groups with ConstraintsMediumLeetCodeArrayHash Table
- 3453. Separate Squares IMediumLeetCodeArrayBinary Search
- 3457. Eat Pizzas!MediumLeetCodeArrayGreedySorting
- 3458. Select K Disjoint Special SubstringsMediumLeetCodeHash TableStringDynamic ProgrammingGreedy
- 3460. Longest Common Prefix After at Most One RemovalMediumLeetCodeTwo PointersString
- 3462. Maximum Sum With at Most K ElementsMediumLeetCodeArrayGreedySortingHeap (Priority Queue)
- 3466. Maximum Coin Collection MediumLeetCodeArrayDynamic Programming
- 3468. Find the Number of Copy ArraysMediumLeetCodeArrayMath
- 3469. Find Minimum Cost to Remove Array ElementsMediumLeetCodeArrayDynamic Programming
- 347. Top K Frequent ElementsMediumLeetCodeArrayHash TableDivide and ConquerSorting
- 3472. Longest Palindromic Subsequence After at Most K OperationsMediumLeetCodeStringDynamic Programming
- 3473. Sum of K Subarrays With Length at Least MMediumLeetCodeArrayDynamic ProgrammingPrefix Sum
- 3475. DNA Pattern Recognition MediumLeetCodeDatabase
- 3476. Maximize Profit from Task AssignmentMediumLeetCodeArrayGreedySortingHeap (Priority Queue)
- 3478. Choose K Elements With Maximum SumMediumLeetCodeArraySortingHeap (Priority Queue)
- 3479. Fruits Into Baskets IIIMediumLeetCodeArrayBinary SearchSegment TreeOrdered Set
- 348. Design Tic-Tac-ToeMediumLeetCodeArrayHash TableDesignMatrix
- 3481. Apply SubstitutionsMediumLeetCodeArrayHash TableStringDepth-First Search
- 3484. Design SpreadsheetMediumLeetCodeArrayHash TableStringDesign
- 3488. Closest Equal Element QueriesMediumLeetCodeArrayHash TableBinary Search
- 3489. Zero Array Transformation IVMediumLeetCodeArrayDynamic Programming
- 3493. Properties GraphMediumLeetCodeArrayHash TableDepth-First SearchBreadth-First Search
- 3494. Find the Minimum Amount of Time to Brew PotionsMediumLeetCodeArraySimulationPrefix Sum
- 3496. Maximize Score After Pair DeletionsMediumLeetCodeArrayGreedy