CodeSearch

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

37,000 problems · all sources

1574. Shortest Subarray to be Removed to Make Array SortedMedium
LeetCodeArrayTwo PointersBinary SearchStack
1577. Number of Ways Where Square of Number Is Equal to Product of Two NumbersMedium
LeetCodeArrayHash TableMathTwo Pointers
1578. Minimum Time to Make Rope ColorfulMedium
LeetCodeArrayStringDynamic ProgrammingGreedy
1580. Put Boxes Into the Warehouse IIMedium
LeetCodeArrayGreedySorting
1583. Count Unhappy FriendsMedium
LeetCodeArraySimulation
1584. Min Cost to Connect All PointsMedium
LeetCodeArrayUnion-FindGraph TheoryMinimum Spanning Tree
1586. Binary Search Tree Iterator IIMedium
LeetCodeStackTreeDesignBinary Search Tree
1589. Maximum Sum Obtained of Any PermutationMedium
LeetCodeArrayGreedySortingPrefix Sum
159. Longest Substring with At Most Two Distinct CharactersMedium
LeetCodeHash TableStringSliding Window
1590. Make Sum Divisible by PMedium
LeetCodeArrayHash TablePrefix Sum
1593. Split a String Into the Max Number of Unique SubstringsMedium
LeetCodeHash TableStringBacktracking
1594. Maximum Non Negative Product in a MatrixMedium
LeetCodeArrayDynamic ProgrammingMatrix
1596. The Most Frequently Ordered Products for Each CustomerMedium
LeetCodeDatabase
1599. Maximum Profit of Operating a Centennial WheelMedium
LeetCodeArraySimulation
16. 3Sum ClosestMedium
LeetCodeArrayTwo PointersSorting
1600. Throne InheritanceMedium
LeetCodeHash TableTreeDepth-First SearchDesign
1602. Find Nearest Right Node in Binary TreeMedium
LeetCodeTreeBreadth-First SearchBinary Tree
1604. Alert Using Same Key-Card Three or More Times in a One Hour PeriodMedium
LeetCodeArrayHash TableStringSorting
1605. Find Valid Matrix Given Row and Column SumsMedium
LeetCodeArrayGreedyMatrix
1609. Even Odd TreeMedium
LeetCodeTreeBreadth-First SearchBinary Tree
161. One Edit DistanceMedium
LeetCodeTwo PointersString
1612. Check If Two Expression Trees are EquivalentMedium
LeetCodeHash TableTreeDepth-First SearchBinary Tree
1613. Find the Missing IDsMedium
LeetCodeDatabase
1615. Maximal Network RankMedium
LeetCodeGraph Theory
1616. Split Two Strings to Make PalindromeMedium
LeetCodeTwo PointersString
1618. Maximum Font to Fit a Sentence in a ScreenMedium
LeetCodeArrayStringBinary SearchInteractive
162. Find Peak ElementMedium
LeetCodeArrayBinary Search
1620. Coordinate With Maximum Network QualityMedium
LeetCodeArrayEnumeration
1621. Number of Sets of K Non-Overlapping Line SegmentsMedium
LeetCodeMathDynamic ProgrammingCombinatoricsPrefix Sum
1625. Lexicographically Smallest String After Applying OperationsMedium
LeetCodeStringDepth-First SearchBreadth-First SearchEnumeration
1626. Best Team With No ConflictsMedium
LeetCodeArrayDynamic ProgrammingSorting
1628. Design an Expression Tree With Evaluate FunctionMedium
LeetCodeArrayMathStackTree
1630. Arithmetic SubarraysMedium
LeetCodeArrayHash TableSorting
1631. Path With Minimum EffortMedium
LeetCodeArrayBinary SearchDepth-First SearchBreadth-First Search
1634. Add Two Polynomials Represented as Linked ListsMedium
LeetCodeLinked ListMathTwo Pointers
1638. Count Substrings That Differ by One CharacterMedium
LeetCodeHash TableStringDynamic ProgrammingEnumeration
164. Maximum GapMedium
LeetCodeArraySortingBucket SortRadix Sort
1641. Count Sorted Vowel StringsMedium
LeetCodeMathDynamic ProgrammingCombinatorics
1642. Furthest Building You Can ReachMedium
LeetCodeArrayGreedyHeap (Priority Queue)
1644. Lowest Common Ancestor of a Binary Tree IIMedium
LeetCodeTreeDepth-First SearchBinary Tree
1647. Minimum Deletions to Make Character Frequencies UniqueMedium
LeetCodeHash TableStringGreedySorting
1648. Sell Diminishing-Valued Colored BallsMedium
LeetCodeArrayMathBinary SearchGreedy
165. Compare Version NumbersMedium
LeetCodeTwo PointersString
1650. Lowest Common Ancestor of a Binary Tree IIIMedium
LeetCodeHash TableTwo PointersTreeBinary Tree
1653. Minimum Deletions to Make String BalancedMedium
LeetCodeStringDynamic ProgrammingStack
1654. Minimum Jumps to Reach HomeMedium
LeetCodeArrayHash TableBreadth-First Search
1657. Determine if Two Strings Are CloseMedium
LeetCodeHash TableStringSortingCounting
1658. Minimum Operations to Reduce X to ZeroMedium
LeetCodeArrayHash TableBinary SearchSliding Window
166. Fraction to Recurring DecimalMedium
LeetCodeHash TableMathString
1660. Correct a Binary TreeMedium
LeetCodeHash TableTreeDepth-First SearchBreadth-First Search
1663. Smallest String With A Given Numeric ValueMedium
LeetCodeStringGreedy
1664. Ways to Make a Fair ArrayMedium
LeetCodeArrayPrefix Sum
1666. Change the Root of a Binary TreeMedium
LeetCodeTreeDepth-First SearchBinary Tree
1669. Merge In Between Linked ListsMedium
LeetCodeLinked List
167. Two Sum II - Input Array Is SortedMedium
LeetCodeArrayTwo PointersBinary Search
1670. Design Front Middle Back QueueMedium
LeetCodeArrayLinked ListDesignQueue
1673. Find the Most Competitive SubsequenceMedium
LeetCodeArrayStackGreedyMonotonic Stack
1674. Minimum Moves to Make Array ComplementaryMedium
LeetCodeArrayHash TablePrefix Sum
1676. Lowest Common Ancestor of a Binary Tree IVMedium
LeetCodeHash TableTreeDepth-First SearchBinary Tree
1679. Max Number of K-Sum PairsMedium
LeetCodeArrayHash TableTwo PointersSorting

← prevpage 118 / 617next →