CodeSearch

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

37,000 problems · all sources

2720. Popularity PercentageHard
LeetCodeDatabase
273. Integer to English WordsHard
LeetCodeMathStringRecursion
2732. Find a Good Subset of the MatrixHard
LeetCodeArrayHash TableBit ManipulationMatrix
2736. Maximum Sum QueriesHard
LeetCodeArrayBinary SearchStackBinary Indexed Tree
2742. Painting the WallsHard
LeetCodeArrayDynamic Programming
2751. Robot CollisionsHard
LeetCodeArrayStackSortingSimulation
2752. Customers with Maximum Number of Transactions on Consecutive DaysHard
LeetCodeDatabase
2753. Count Houses in a Circular Street IIHard
LeetCode
2756. Query BatchingHard
LeetCode
2759. Convert JSON String to ObjectHard
LeetCode
2763. Sum of Imbalance Numbers of All SubarraysHard
LeetCodeArrayHash TableEnumeration
2781. Length of the Longest Valid SubstringHard
LeetCodeArrayHash TableStringSliding Window
2790. Maximum Number of Groups With Increasing LengthHard
LeetCodeArrayMathBinary SearchGreedy
2791. Count Paths That Can Form a Palindrome in a TreeHard
LeetCodeHash TableBit ManipulationTreeDepth-First Search
2792. Count Nodes That Are Great EnoughHard
LeetCodeDivide and ConquerTreeDepth-First SearchBinary Tree
2793. Status of Flight TicketsHard
LeetCode
2801. Count Stepping Numbers in RangeHard
LeetCodeStringDynamic Programming
2809. Minimum Time to Make Array Sum At Most xHard
LeetCodeArrayDynamic ProgrammingSorting
2813. Maximum Elegance of a K-Length SubsequenceHard
LeetCodeArrayHash TableStackGreedy
2814. Minimum Time Takes to Reach Destination Without DrowningHard
LeetCodeArrayBreadth-First SearchMatrix
2818. Apply Operations to Maximize ScoreHard
LeetCodeArrayMathStackGreedy
2819. Minimum Relative Loss After Buying ChocolatesHard
LeetCodeArrayBinary SearchSortingPrefix Sum
282. Expression Add OperatorsHard
LeetCodeMathStringBacktracking
2827. Number of Beautiful Integers in the RangeHard
LeetCodeMathDynamic Programming
2835. Minimum Operations to Form Subsequence With Target SumHard
LeetCodeArrayGreedyBit Manipulation
2836. Maximize Value of Function in a Ball Passing GameHard
LeetCodeArrayDynamic ProgrammingBit Manipulation
2842. Count K-Subsequences of a String With Maximum BeautyHard
LeetCodeHash TableMathStringGreedy
2846. Minimum Edge Weight Equilibrium Queries in a TreeHard
LeetCodeArrayDynamic ProgrammingBit ManipulationTree
2851. String TransformationHard
LeetCodeMathStringDynamic ProgrammingString Matching
2858. Minimum Edge Reversals So Every Node Is ReachableHard
LeetCodeDynamic ProgrammingDepth-First SearchBreadth-First SearchGraph Theory
2862. Maximum Element-Sum of a Complete Subset of IndicesHard
LeetCodeArrayMathNumber Theory
2867. Count Valid Paths in a TreeHard
LeetCodeMathDynamic ProgrammingTreeDepth-First Search
2868. The Wording GameHard
LeetCodeArrayMathTwo PointersString
2872. Maximum Number of K-Divisible ComponentsHard
LeetCodeTreeDepth-First Search
2876. Count Visited Nodes in a Directed GraphHard
LeetCodeDynamic ProgrammingDepth-First SearchGraph TheoryTopological Sort
2897. Apply Operations on Array to Maximize Sum of SquaresHard
LeetCodeArrayHash TableGreedyBit Manipulation
2902. Count of Sub-Multisets With Bounded SumHard
LeetCodeArrayHash TableDynamic ProgrammingSliding Window
2911. Minimum Changes to Make K Semi-palindromesHard
LeetCodeTwo PointersStringDynamic Programming
2912. Number of Ways to Reach Destination in the GridHard
LeetCodeMathDynamic ProgrammingCombinatorics
2916. Subarrays Distinct Element Sum of Squares IIHard
LeetCodeArrayHash TableBinary Indexed TreeSegment Tree
2920. Maximum Points After Collecting Coins From All NodesHard
LeetCodeArrayDynamic ProgrammingBit ManipulationTree
2921. Maximum Profitable Triplets With Increasing Prices IIHard
LeetCodeArrayBinary Indexed TreeSegment Tree
2926. Maximum Balanced Subsequence SumHard
LeetCodeArrayBinary SearchDynamic ProgrammingBinary Indexed Tree
2927. Distribute Candies Among Children IIIHard
LeetCodeMathCombinatorics
2931. Maximum Spending After Buying ItemsHard
LeetCodeArrayGreedySortingHeap (Priority Queue)
2935. Maximum Strong Pair XOR IIHard
LeetCodeArrayHash TableBit ManipulationTrie
2940. Find Building Where Alice and Bob Can MeetHard
LeetCodeArrayBinary SearchStackBinary Indexed Tree
2941. Maximum GCD-Sum of a SubarrayHard
LeetCodeArrayMathBinary SearchNumber Theory
2945. Find Maximum Non-decreasing Array LengthHard
LeetCodeArrayBinary SearchDynamic ProgrammingStack
2949. Count Beautiful Substrings IIHard
LeetCodeHash TableMathStringNumber Theory
295. Find Median from Data StreamHard
LeetCodeTwo PointersDesignSortingHeap (Priority Queue)
2953. Count Complete SubstringsHard
LeetCodeHash TableStringSliding Window
2954. Count the Number of Infection SequencesHard
LeetCodeArrayMathCombinatorics
2959. Number of Possible Sets of Closing BranchesHard
LeetCodeBit ManipulationGraph TheoryHeap (Priority Queue)Enumeration
296. Best Meeting PointHard
LeetCodeArrayMathSortingMatrix
2963. Count the Number of Good PartitionsHard
LeetCodeArrayHash TableMathCombinatorics
2968. Apply Operations to Maximize Frequency ScoreHard
LeetCodeArrayBinary SearchSliding WindowSorting
2969. Minimum Number of Coins for Fruits IIHard
LeetCodeArrayDynamic ProgrammingQueueHeap (Priority Queue)
297. Serialize and Deserialize Binary TreeHard
LeetCodeStringTreeDepth-First SearchBreadth-First Search
2972. Count the Number of Incremovable Subarrays IIHard
LeetCodeArrayTwo PointersBinary Search

← prevpage 225 / 617next →