CodeSearch

pick a problem · learn it with an AI tutor — hints, not spoilers

37,000 problems · all sources

3497. Analyze Subscription Conversion Medium
LeetCodeDatabase
3499. Maximize Active Section with Trade IMedium
LeetCodeStringEnumeration
3503. Longest Palindrome After Substring Concatenation IMedium
LeetCodeTwo PointersStringDynamic ProgrammingEnumeration
3508. Implement RouterMedium
LeetCodeArrayHash TableBinary SearchDesign
351. Android Unlock PatternsMedium
LeetCodeDynamic ProgrammingBacktrackingBit ManipulationBitmask
3511. Make a Positive ArrayMedium
LeetCodeArrayGreedyPrefix Sum
3513. Number of Unique XOR Triplets IMedium
LeetCodeArrayMathBit Manipulation
3514. Number of Unique XOR Triplets IIMedium
LeetCodeArrayMathBit ManipulationEnumeration
3517. Smallest Palindromic Rearrangement IMedium
LeetCodeStringSortingCounting Sort
3520. Minimum Threshold for Inversion Pairs CountMedium
LeetCodeArrayBinary SearchDivide and ConquerBinary Indexed Tree
3521. Find Product Recommendation PairsMedium
LeetCodeDatabase
3522. Calculate Score After Performing InstructionsMedium
LeetCodeArrayHash TableStringSimulation
3523. Make Array Non-decreasingMedium
LeetCodeArrayStackGreedyMonotonic Stack
3524. Find X Value of Array IMedium
LeetCodeArrayMathDynamic Programming
3527. Find the Most Common ResponseMedium
LeetCodeArrayHash TableStringCounting
3528. Unit Conversion IMedium
LeetCodeDepth-First SearchBreadth-First SearchGraph Theory
3529. Count Cells in Overlapping Horizontal and Vertical SubstringsMedium
LeetCodeArrayStringRolling HashString Matching
353. Design Snake GameMedium
LeetCodeArrayHash TableDesignQueue
3531. Count Covered BuildingsMedium
LeetCodeArrayHash TableSorting
3532. Path Existence Queries in a Graph IMedium
LeetCodeArrayHash TableBinary SearchUnion-Find
3535. Unit Conversion IIMedium
LeetCodeArrayMathDepth-First SearchBreadth-First Search
3537. Fill a Special GridMedium
LeetCodeArrayDivide and ConquerMatrix
3540. Minimum Time to Visit All HousesMedium
LeetCodeArrayPrefix Sum
3542. Minimum Operations to Convert All Elements to ZeroMedium
LeetCodeArrayHash TableStackGreedy
3543. Maximum Weighted K-Edge PathMedium
LeetCodeHash TableDynamic ProgrammingGraph Theory
3546. Equal Sum Grid Partition IMedium
LeetCodeArrayMatrixEnumerationPrefix Sum
355. Design TwitterMedium
LeetCodeHash TableLinked ListDesignHeap (Priority Queue)
3551. Minimum Swaps to Sort by Digit SumMedium
LeetCodeArrayHash TableSorting
3552. Grid Teleportation TraversalMedium
LeetCodeArrayHash TableBreadth-First SearchMatrix
3555. Smallest Subarray to Sort in Every Sliding WindowMedium
LeetCodeArrayTwo PointersStackGreedy
3556. Sum of Largest Prime SubstringsMedium
LeetCodeHash TableMathStringSorting
3557. Find Maximum Number of Non Intersecting SubstringsMedium
LeetCodeHash TableStringDynamic ProgrammingGreedy
3558. Number of Ways to Assign Edge Weights IMedium
LeetCodeMathTreeDepth-First Search
356. Line ReflectionMedium
LeetCodeArrayHash TableMath
3561. Resulting String After Adjacent RemovalsMedium
LeetCodeStringStackSimulation
3564. Seasonal Sales AnalysisMedium
LeetCodeDatabase
3565. Sequential Grid Path CoverMedium
LeetCodeArrayRecursionMatrix
3566. Partition Array into Two Equal Product SubsetsMedium
LeetCodeArrayBit ManipulationRecursionEnumeration
3567. Minimum Absolute Difference in Sliding SubmatrixMedium
LeetCodeArraySortingMatrix
3568. Minimum Moves to Clean the ClassroomMedium
LeetCodeArrayHash TableBit ManipulationBreadth-First Search
357. Count Numbers with Unique DigitsMedium
LeetCodeMathDynamic ProgrammingBacktracking
3572. Maximize Y‑Sum by Picking a Triplet of Distinct X‑ValuesMedium
LeetCodeArrayHash TableGreedySorting
3573. Best Time to Buy and Sell Stock VMedium
LeetCodeArrayDynamic Programming
3576. Transform Array to All Equal ElementsMedium
LeetCodeArrayGreedy
3577. Count the Number of Computer Unlocking PermutationsMedium
LeetCodeArrayMathBrainteaserCombinatorics
3578. Count Partitions With Max-Min Difference at Most KMedium
LeetCodeArrayDynamic ProgrammingQueueSliding Window
3580. Find Consistently Improving EmployeesMedium
LeetCodeDatabase
3583. Count Special TripletsMedium
LeetCodeArrayHash TableCounting
3584. Maximum Product of First and Last Elements of a SubsequenceMedium
LeetCodeArrayTwo Pointers
3586. Find COVID Recovery PatientsMedium
LeetCodeDatabase
3587. Minimum Adjacent Swaps to Alternate ParityMedium
LeetCodeArrayGreedy
3588. Find Maximum Area of a TriangleMedium
LeetCodeArrayHash TableMathGreedy
3589. Count Prime-Gap Balanced SubarraysMedium
LeetCodeArrayMathQueueSliding Window
3592. Inverse Coin ChangeMedium
LeetCodeArrayDynamic Programming
3593. Minimum Increments to Equalize Leaf PathsMedium
LeetCodeArrayDynamic ProgrammingTreeDepth-First Search
3595. Once TwiceMedium
LeetCodeArrayBit Manipulation
3596. Minimum Cost Path with Alternating Directions IMedium
LeetCodeMathBrainteaser
3597. Partition String Medium
LeetCodeHash TableStringTrieSimulation
3598. Longest Common Prefix Between Adjacent Strings After RemovalsMedium
LeetCodeArrayString
3599. Partition Array to Minimize XORMedium
LeetCodeArrayDynamic ProgrammingBit ManipulationPrefix Sum

← prevpage 136 / 617next →