CodeSearch

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

37,000 problems · all sources

1471. The k Strongest Values in an ArrayMedium
LeetCodeArrayTwo PointersSorting
1472. Design Browser HistoryMedium
LeetCodeArrayLinked ListStackDesign
1476. Subrectangle QueriesMedium
LeetCodeArrayDesignMatrix
1477. Find Two Non-overlapping Sub-arrays Each With Target SumMedium
LeetCodeArrayHash TableBinary SearchDynamic Programming
148. Sort ListMedium
LeetCodeLinked ListTwo PointersDivide and ConquerSorting
1481. Least Number of Unique Integers after K RemovalsMedium
LeetCodeArrayHash TableGreedySorting
1482. Minimum Number of Days to Make m BouquetsMedium
LeetCodeArrayBinary Search
1485. Clone Binary Tree With Random PointerMedium
LeetCodeHash TableTreeDepth-First SearchBreadth-First Search
1487. Making File Names UniqueMedium
LeetCodeArrayHash TableString
1488. Avoid Flood in The CityMedium
LeetCodeArrayHash TableBinary SearchGreedy
1490. Clone N-ary TreeMedium
LeetCodeHash TableTreeDepth-First SearchBreadth-First Search
1492. The kth Factor of nMedium
LeetCodeMathNumber Theory
1493. Longest Subarray of 1's After Deleting One ElementMedium
LeetCodeArrayDynamic ProgrammingSliding Window
1497. Check If Array Pairs Are Divisible by kMedium
LeetCodeArrayHash TableCounting
1498. Number of Subsequences That Satisfy the Given Sum ConditionMedium
LeetCodeArrayTwo PointersBinary SearchSorting
15. 3SumMedium
LeetCodeArrayTwo PointersSorting
150. Evaluate Reverse Polish NotationMedium
LeetCodeArrayMathStack
1500. Design a File Sharing SystemMedium
LeetCodeHash TableDesignSortingHeap (Priority Queue)
1501. Countries You Can Safely Invest InMedium
LeetCodeDatabase
1503. Last Moment Before All Ants Fall Out of a PlankMedium
LeetCodeArrayBrainteaserSimulation
1504. Count Submatrices With All OnesMedium
LeetCodeArrayDynamic ProgrammingStackMatrix
1506. Find Root of N-Ary TreeMedium
LeetCodeHash TableBit ManipulationTreeDepth-First Search
1508. Range Sum of Sorted Subarray SumsMedium
LeetCodeArrayTwo PointersBinary SearchSorting
1509. Minimum Difference Between Largest and Smallest Value in Three MovesMedium
LeetCodeArrayGreedySorting
151. Reverse Words in a StringMedium
LeetCodeTwo PointersString
1513. Number of Substrings With Only 1sMedium
LeetCodeMathString
1514. Path with Maximum ProbabilityMedium
LeetCodeArrayGraph TheoryHeap (Priority Queue)Shortest Path
1519. Number of Nodes in the Sub-Tree With the Same LabelMedium
LeetCodeHash TableTreeDepth-First SearchBreadth-First Search
152. Maximum Product SubarrayMedium
LeetCodeArrayDynamic Programming
1522. Diameter of N-Ary TreeMedium
LeetCodeTreeDepth-First Search
1524. Number of Sub-arrays With Odd SumMedium
LeetCodeArrayMathDynamic ProgrammingPrefix Sum
1525. Number of Good Ways to Split a StringMedium
LeetCodeHash TableStringDynamic ProgrammingBit Manipulation
1529. Minimum Suffix FlipsMedium
LeetCodeStringGreedy
153. Find Minimum in Rotated Sorted ArrayMedium
LeetCodeArrayBinary Search
1530. Number of Good Leaf Nodes PairsMedium
LeetCodeTreeDepth-First SearchBinary Tree
1532. The Most Recent Three OrdersMedium
LeetCodeDatabase
1533. Find the Index of the Large IntegerMedium
LeetCodeArrayBinary SearchInteractive
1535. Find the Winner of an Array GameMedium
LeetCodeArraySimulation
1536. Minimum Swaps to Arrange a Binary GridMedium
LeetCodeArrayGreedyMatrix
1538. Guess the Majority in a Hidden ArrayMedium
LeetCodeArrayMathInteractive
1540. Can Convert String in K MovesMedium
LeetCodeHash TableString
1541. Minimum Insertions to Balance a Parentheses StringMedium
LeetCodeStringStackGreedy
1545. Find Kth Bit in Nth Binary StringMedium
LeetCodeStringRecursionSimulation
1546. Maximum Number of Non-Overlapping Subarrays With Sum Equals TargetMedium
LeetCodeArrayHash TableGreedyPrefix Sum
1549. The Most Recent Orders for Each ProductMedium
LeetCodeDatabase
155. Min StackMedium
LeetCodeStackDesign
1551. Minimum Operations to Make Array EqualMedium
LeetCodeMath
1552. Magnetic Force Between Two BallsMedium
LeetCodeArrayBinary SearchSorting
1554. Strings Differ by One CharacterMedium
LeetCodeHash TableStringRolling HashHash Function
1555. Bank Account SummaryMedium
LeetCodeDatabase
1557. Minimum Number of Vertices to Reach All NodesMedium
LeetCodeGraph Theory
1558. Minimum Numbers of Function Calls to Make Target ArrayMedium
LeetCodeArrayGreedyBit Manipulation
1559. Detect Cycles in 2D GridMedium
LeetCodeArrayDepth-First SearchBreadth-First SearchUnion-Find
156. Binary Tree Upside DownMedium
LeetCodeTreeDepth-First SearchBinary Tree
1561. Maximum Number of Coins You Can GetMedium
LeetCodeArrayMathGreedySorting
1562. Find Latest Group of Size MMedium
LeetCodeArrayHash TableBinary SearchSimulation
1564. Put Boxes Into the Warehouse IMedium
LeetCodeArrayGreedySorting
1567. Maximum Length of Subarray With Positive ProductMedium
LeetCodeArrayDynamic ProgrammingGreedy
1570. Dot Product of Two Sparse VectorsMedium
LeetCodeArrayHash TableTwo PointersDesign
1573. Number of Ways to Split a StringMedium
LeetCodeMathString

← prevpage 117 / 617next →