CodeSearch

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

37,000 problems · all sources

3515. Shortest Path in a Weighted TreeHard
LeetCodeArrayTreeDepth-First SearchBinary Indexed Tree
3518. Smallest Palindromic Rearrangement IIHard
LeetCodeHash TableMathStringCombinatorics
3519. Count Numbers with Non-Decreasing Digits Hard
LeetCodeMathStringDynamic Programming
352. Data Stream as Disjoint IntervalsHard
LeetCodeHash TableBinary SearchUnion-FindDesign
3525. Find X Value of Array IIHard
LeetCodeArrayMathSegment Tree
3526. Range XOR Queries with Subarray ReversalsHard
LeetCodeArrayTreeBinary Search TreeBinary Tree
3530. Maximum Profit from Valid Topological Order in DAGHard
LeetCodeArrayDynamic ProgrammingBit ManipulationGraph Theory
3533. Concatenated DivisibilityHard
LeetCodeArrayDynamic ProgrammingBit ManipulationBitmask
3534. Path Existence Queries in a Graph IIHard
LeetCodeArrayTwo PointersBinary SearchDynamic Programming
3538. Merge Operations for Minimum Travel TimeHard
LeetCodeArrayDynamic ProgrammingPrefix Sum
3539. Find Sum of Array Product of Magical SequencesHard
LeetCodeArrayMathDynamic ProgrammingBit Manipulation
354. Russian Doll EnvelopesHard
LeetCodeArrayBinary SearchDynamic ProgrammingSorting
3544. Subtree Inversion SumHard
LeetCodeArrayDynamic ProgrammingTreeDepth-First Search
3547. Maximum Sum of Edge Values in a GraphHard
LeetCodeMathGreedyGraph Theory
3548. Equal Sum Grid Partition IIHard
LeetCodeArrayHash TableMatrixEnumeration
3549. Multiply Two PolynomialsHard
LeetCodeArrayMath
3553. Minimum Weighted Subgraph With the Required Paths IIHard
LeetCodeArrayDynamic ProgrammingBit ManipulationTree
3554. Find Category Recommendation PairsHard
LeetCodeDatabase
3559. Number of Ways to Assign Edge Weights IIHard
LeetCodeArrayMathDynamic ProgrammingBit Manipulation
3562. Maximum Profit from Trading Stocks with DiscountsHard
LeetCodeArrayDynamic ProgrammingTreeDepth-First Search
3563. Lexicographically Smallest String After Adjacent RemovalsHard
LeetCodeStringDynamic Programming
3569. Maximize Count of Distinct Primes After SplitHard
LeetCodeArrayHash TableMathSegment Tree
3574. Maximize Subarray GCD ScoreHard
LeetCodeArrayMathEnumerationNumber Theory
3575. Maximum Good Subtree ScoreHard
LeetCodeArrayDynamic ProgrammingBit ManipulationTree
3579. Minimum Steps to Convert String with OperationsHard
LeetCodeStringDynamic Programming
358. Rearrange String k Distance ApartHard
LeetCodeHash TableStringGreedySorting
3585. Find Weighted Median Node in TreeHard
LeetCodeArrayBinary SearchDynamic ProgrammingBit Manipulation
3590. Kth Smallest Path XOR SumHard
LeetCodeArrayTreeDepth-First SearchOrdered Set
3594. Minimum Time to Transport All IndividualsHard
LeetCodeArrayBit ManipulationGraph TheoryHeap (Priority Queue)
3600. Maximize Spanning Tree Stability with UpgradesHard
LeetCodeBinary SearchGreedyUnion-FindGraph Theory
3605. Minimum Stability Factor of ArrayHard
LeetCodeArrayMathBinary SearchGreedy
3609. Minimum Moves to Reach Target in GridHard
LeetCodeMath
3614. Process String with Special Operations IIHard
LeetCodeStringSimulation
3615. Longest Palindromic Path in GraphHard
LeetCodeStringDynamic ProgrammingBit ManipulationGraph Theory
3617. Find Students with Study Spiral PatternHard
LeetCode
3620. Network Recovery PathwaysHard
LeetCodeArrayBinary SearchDynamic ProgrammingGraph Theory
3621. Number of Integers With Popcount-Depth Equal to K IHard
LeetCodeMathDynamic ProgrammingBit ManipulationCombinatorics
3624. Number of Integers With Popcount-Depth Equal to K IIHard
LeetCodeArrayDivide and ConquerBinary Indexed TreeSegment Tree
3625. Count Number of Trapezoids IIHard
LeetCodeArrayHash TableMathGeometry
363. Max Sum of Rectangle No Larger Than KHard
LeetCodeArrayBinary SearchMatrixPrefix Sum
3630. Partition Array for Maximum XOR and ANDHard
LeetCodeArrayMathGreedyBit Manipulation
3632. Subarrays with XOR at Least KHard
LeetCodeArrayBit ManipulationTriePrefix Sum
3636. Threshold Majority QueriesHard
LeetCodeArrayHash TableBinary SearchDivide and Conquer
3640. Trionic Array IIHard
LeetCodeArrayDynamic Programming
3646. Next Special Palindrome NumberHard
LeetCodeBacktrackingBit Manipulation
3651. Minimum Cost Path with TeleportationsHard
LeetCodeArrayDynamic ProgrammingMatrix
3655. XOR After Range Multiplication Queries IIHard
LeetCodeArrayDivide and ConquerPrefix Sum
3661. Maximum Walls Destroyed by RobotsHard
LeetCodeArrayBinary SearchDynamic ProgrammingSorting
3666. Minimum Operations to Equalize Binary StringHard
LeetCodeMathStringBreadth-First SearchUnion-Find
3671. Sum of Beautiful SubsequencesHard
LeetCodeArrayMathBinary Indexed TreeNumber Theory
3673. Find Zombie SessionsHard
LeetCode
3677. Count Binary Palindromic NumbersHard
LeetCodeMathBit Manipulation
3681. Maximum XOR of SubsequencesHard
LeetCodeArrayMathGreedyBit Manipulation
3686. Number of Stable SubsequencesHard
LeetCodeArrayDynamic Programming
3691. Maximum Total Subarray Value IIHard
LeetCodeArrayGreedySegment TreeHeap (Priority Queue)
3695. Maximize Alternating Sum Using SwapsHard
LeetCodeArrayGreedyUnion-FindSorting
3699. Number of ZigZag Arrays IHard
LeetCodeDynamic ProgrammingPrefix Sum
37. Sudoku SolverHard
LeetCodeArrayHash TableBacktrackingMatrix
3700. Number of ZigZag Arrays IIHard
LeetCodeMathDynamic Programming
3704. Count No-Zero Pairs That Sum to NHard
LeetCodeMathDynamic Programming

← prevpage 229 / 617next →