CodeSearch

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

37,000 problems · all sources

1542. Find Longest Awesome SubstringHard
LeetCodeHash TableStringBit Manipulation
1547. Minimum Cost to Cut a StickHard
LeetCodeArrayDynamic ProgrammingSorting
1548. The Most Similar Path in a GraphHard
LeetCodeArrayStringDynamic ProgrammingGraph Theory
1553. Minimum Number of Days to Eat N OrangesHard
LeetCodeDynamic ProgrammingMemoization
1563. Stone Game VHard
LeetCodeArrayMathDynamic ProgrammingGame Theory
1568. Minimum Number of Days to Disconnect IslandHard
LeetCodeArrayDepth-First SearchBreadth-First SearchMatrix
1569. Number of Ways to Reorder Array to Get Same BSTHard
LeetCodeArrayMathDivide and ConquerDynamic Programming
1575. Count All Possible RoutesHard
LeetCodeArrayDynamic ProgrammingMemoization
1579. Remove Max Number of Edges to Keep Graph Fully TraversableHard
LeetCodeUnion-FindGraph Theory
158. Read N Characters Given read4 II - Call Multiple TimesHard
LeetCodeArraySimulationInteractive
1585. Check If String Is Transformable With Substring Sort OperationsHard
LeetCodeStringGreedySorting
1591. Strange Printer IIHard
LeetCodeArrayGraph TheoryTopological SortMatrix
1595. Minimum Cost to Connect Two Groups of PointsHard
LeetCodeArrayDynamic ProgrammingBit ManipulationMatrix
1597. Build Binary Expression Tree From Infix ExpressionHard
LeetCodeStringStackTreeBinary Tree
1601. Maximum Number of Achievable Transfer RequestsHard
LeetCodeArrayBacktrackingBit ManipulationEnumeration
1606. Find Servers That Handled Most Number of RequestsHard
LeetCodeArrayHeap (Priority Queue)SimulationOrdered Set
1610. Maximum Number of Visible PointsHard
LeetCodeArrayMathGeometrySliding Window
1611. Minimum One Bit Operations to Make Integers ZeroHard
LeetCodeMathDynamic ProgrammingBit ManipulationRecursion
1617. Count Subtrees With Max Distance Between CitiesHard
LeetCodeDynamic ProgrammingBit ManipulationTreeEnumeration
1622. Fancy SequenceHard
LeetCodeMathDesignSegment TreeNumber Theory
1627. Graph Connectivity With ThresholdHard
LeetCodeArrayMathUnion-FindNumber Theory
1632. Rank Transform of a MatrixHard
LeetCodeArrayUnion-FindGraph TheoryTopological Sort
1635. Hopper Company Queries IHard
LeetCodeDatabase
1639. Number of Ways to Form a Target String Given a DictionaryHard
LeetCodeArrayStringDynamic Programming
1643. Kth Smallest InstructionsHard
LeetCodeArrayMathDynamic ProgrammingCombinatorics
1645. Hopper Company Queries IIHard
LeetCodeDatabase
1649. Create Sorted Array through InstructionsHard
LeetCodeArrayBinary SearchDivide and ConquerBinary Indexed Tree
1651. Hopper Company Queries IIIHard
LeetCodeDatabase
1655. Distribute Repeating IntegersHard
LeetCodeArrayHash TableDynamic ProgrammingBacktracking
1659. Maximize Grid HappinessHard
LeetCodeDynamic ProgrammingBit ManipulationMemoizationBitmask
1665. Minimum Initial Energy to Finish TasksHard
LeetCodeArrayGreedySorting
1671. Minimum Number of Removals to Make Mountain ArrayHard
LeetCodeArrayBinary SearchDynamic ProgrammingGreedy
1675. Minimize Deviation in ArrayHard
LeetCodeArrayGreedyHeap (Priority Queue)Ordered Set
1681. Minimum IncompatibilityHard
LeetCodeArrayHash TableDynamic ProgrammingBit Manipulation
1687. Delivering Boxes from Storage to PortsHard
LeetCodeArrayDynamic ProgrammingSegment TreeQueue
1691. Maximum Height by Stacking Cuboids Hard
LeetCodeArrayDynamic ProgrammingSorting
1692. Count Ways to Distribute CandiesHard
LeetCodeDynamic Programming
1697. Checking Existence of Edge Length Limited PathsHard
LeetCodeArrayTwo PointersUnion-FindGraph Theory
1703. Minimum Adjacent Swaps for K Consecutive OnesHard
LeetCodeArrayGreedySliding WindowPrefix Sum
1707. Maximum XOR With an Element From ArrayHard
LeetCodeArrayBit ManipulationTrie
1713. Minimum Operations to Make a SubsequenceHard
LeetCodeArrayHash TableBinary SearchGreedy
1714. Sum Of Special Evenly-Spaced Elements In ArrayHard
LeetCodeArrayDynamic Programming
1719. Number Of Ways To Reconstruct A TreeHard
LeetCodeArrayHash TableTreeGraph Theory
1723. Find Minimum Time to Finish All JobsHard
LeetCodeArrayDynamic ProgrammingBacktrackingBit Manipulation
1724. Checking Existence of Edge Length Limited Paths IIHard
LeetCodeDepth-First SearchUnion-FindGraph TheoryDesign
1728. Cat and Mouse IIHard
LeetCodeArrayMathDynamic ProgrammingGraph Theory
1735. Count Ways to Make Array With ProductHard
LeetCodeArrayMathDynamic ProgrammingCombinatorics
1739. Building BoxesHard
LeetCodeMathBinary SearchGreedy
174. Dungeon GameHard
LeetCodeArrayDynamic ProgrammingMatrix
1745. Palindrome Partitioning IVHard
LeetCodeStringDynamic Programming
1751. Maximum Number of Events That Can Be Attended IIHard
LeetCodeArrayBinary SearchDynamic ProgrammingSorting
1755. Closest Subsequence SumHard
LeetCodeArrayTwo PointersDynamic ProgrammingBit Manipulation
1761. Minimum Degree of a Connected Trio in a GraphHard
LeetCodeGraph TheoryEnumeration
1766. Tree of CoprimesHard
LeetCodeArrayMathTreeDepth-First Search
1767. Find the Subtasks That Did Not ExecuteHard
LeetCodeDatabase
1770. Maximum Score from Performing Multiplication OperationsHard
LeetCodeArrayDynamic Programming
1771. Maximize Palindrome Length From SubsequencesHard
LeetCodeStringDynamic Programming
1776. Car Fleet IIHard
LeetCodeArrayMathStackHeap (Priority Queue)
1782. Count Pairs Of NodesHard
LeetCodeArrayHash TableTwo PointersBinary Search
1787. Make the XOR of All Segments Equal to ZeroHard
LeetCodeArrayHash TableDynamic ProgrammingBit Manipulation

← prevpage 220 / 617next →