CodeSearch

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

37,000 problems · all sources

1788. Maximize the Beauty of the GardenHard
LeetCodeArrayHash TableGreedyPrefix Sum
1793. Maximum Score of a Good SubarrayHard
LeetCodeArrayTwo PointersBinary SearchStack
1799. Maximize Score After N OperationsHard
LeetCodeArrayMathDynamic ProgrammingBacktracking
1803. Count Pairs With XOR in a RangeHard
LeetCodeArrayBit ManipulationTrie
1808. Maximize Number of Nice DivisorsHard
LeetCodeMathRecursionNumber Theory
1815. Maximum Number of Groups Getting Fresh DonutsHard
LeetCodeArrayDynamic ProgrammingBit ManipulationMemoization
1819. Number of Different Subsequences GCDsHard
LeetCodeArrayMathCountingNumber Theory
1825. Finding MK AverageHard
LeetCodeDesignQueueHeap (Priority Queue)Data Stream
1830. Minimum Number of Operations to Make String SortedHard
LeetCodeHash TableMathStringCombinatorics
1835. Find XOR Sum of All Pairs Bitwise ANDHard
LeetCodeArrayMathBit Manipulation
1840. Maximum Building HeightHard
LeetCodeArrayMathSorting
1842. Next Palindrome Using Same DigitsHard
LeetCodeTwo PointersString
1847. Closest RoomHard
LeetCodeArrayBinary SearchSortingOrdered Set
185. Department Top Three SalariesHard
LeetCodeDatabase
1851. Minimum Interval to Include Each QueryHard
LeetCodeArrayBinary SearchSweep LineSorting
1857. Largest Color Value in a Directed GraphHard
LeetCodeHash TableStringDynamic ProgrammingGraph Theory
1862. Sum of Floored PairsHard
LeetCodeArrayMathBinary SearchCounting
1866. Number of Ways to Rearrange Sticks With K Sticks VisibleHard
LeetCodeMathDynamic ProgrammingCombinatorics
1872. Stone Game VIIIHard
LeetCodeArrayMathDynamic ProgrammingPrefix Sum
1879. Minimum XOR Sum of Two ArraysHard
LeetCodeArrayDynamic ProgrammingBit ManipulationBitmask
188. Best Time to Buy and Sell Stock IVHard
LeetCodeArrayDynamic Programming
1883. Minimum Skips to Arrive at Meeting On TimeHard
LeetCodeArrayDynamic Programming
1889. Minimum Space Wasted From PackagingHard
LeetCodeArrayBinary SearchSortingPrefix Sum
1892. Page Recommendations IIHard
LeetCodeDatabase
1896. Minimum Cost to Change the Final Value of ExpressionHard
LeetCodeMathStringDynamic ProgrammingStack
1900. The Earliest and Latest Rounds Where Players CompeteHard
LeetCodeDynamic ProgrammingMemoization
1912. Design Movie Rental SystemHard
LeetCodeArrayHash TableDesignHeap (Priority Queue)
1916. Count Ways to Build Rooms in an Ant ColonyHard
LeetCodeArrayMathDynamic ProgrammingTree
1917. Leetcodify Friends RecommendationsHard
LeetCodeDatabase
1919. Leetcodify Similar FriendsHard
LeetCodeDatabase
1923. Longest Common SubpathHard
LeetCodeArrayBinary SearchRolling HashSuffix Array
1924. Erect the Fence IIHard
LeetCodeArrayMathGeometry
1928. Minimum Cost to Reach Destination in TimeHard
LeetCodeArrayDynamic ProgrammingGraph Theory
1931. Painting a Grid With Three Different ColorsHard
LeetCodeDynamic Programming
1932. Merge BSTs to Create Single BSTHard
LeetCodeArrayHash TableTreeDepth-First Search
1938. Maximum Genetic Difference QueryHard
LeetCodeArrayHash TableBit ManipulationDepth-First Search
1944. Number of Visible People in a QueueHard
LeetCodeArrayStackMonotonic Stack
1948. Delete Duplicate Folders in SystemHard
LeetCodeArrayHash TableStringDepth-First Search
1955. Count Number of Special SubsequencesHard
LeetCodeArrayDynamic Programming
1956. Minimum Time For K Virus Variants to SpreadHard
LeetCodeArrayMathBinary SearchGeometry
1960. Maximum Product of the Length of Two Palindromic SubstringsHard
LeetCodeTwo PointersStringRolling HashHash Function
1964. Find the Longest Valid Obstacle Course at Each PositionHard
LeetCodeArrayBinary SearchBinary Indexed Tree
1970. Last Day Where You Can Still CrossHard
LeetCodeArrayBinary SearchDepth-First SearchBreadth-First Search
1972. First and Last Call On the Same DayHard
LeetCodeDatabase
1977. Number of Ways to Separate NumbersHard
LeetCodeStringDynamic ProgrammingPrefix Sum
1982. Find Array Given Subset SumsHard
LeetCodeArrayHash TableSortingCounting
1987. Number of Unique Good SubsequencesHard
LeetCodeStringDynamic Programming
1994. The Number of Good SubsetsHard
LeetCodeArrayHash TableMathDynamic Programming
1998. GCD Sort of an ArrayHard
LeetCodeArrayMathUnion-FindSorting
2003. Smallest Missing Genetic Value in Each SubtreeHard
LeetCodeArrayDynamic ProgrammingTreeDepth-First Search
2004. The Number of Seniors and Juniors to Join the CompanyHard
LeetCodeDatabase
2005. Subtree Removal Game with Fibonacci TreeHard
LeetCodeMathDynamic ProgrammingTreeBinary Tree
2009. Minimum Number of Operations to Make Array ContinuousHard
LeetCodeArrayHash TableBinary SearchSliding Window
2010. The Number of Seniors and Juniors to Join the Company IIHard
LeetCodeDatabase
2014. Longest Subsequence Repeated k TimesHard
LeetCodeHash TableTwo PointersStringBacktracking
2019. The Score of Students Solving Math ExpressionHard
LeetCodeArrayHash TableMathString
2025. Maximum Number of Ways to Partition an ArrayHard
LeetCodeArrayHash TableCountingEnumeration
2030. Smallest K-Length Subsequence With Occurrences of a LetterHard
LeetCodeStringStackGreedyMonotonic Stack
2035. Partition Array Into Two Arrays to Minimize Sum DifferenceHard
LeetCodeArrayTwo PointersBinary SearchDynamic Programming
2040. Kth Smallest Product of Two Sorted ArraysHard
LeetCodeArrayBinary Search

← prevpage 221 / 617next →