CodeSearch

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

37,000 problems · all sources

3787. Find Diameter Endpoints of a TreeMedium
LeetCodeTreeBreadth-First SearchGraph Theory
3788. Maximum Score of a SplitMedium
LeetCodeArrayPrefix Sum
3789. Minimum Cost to Acquire Required ItemsMedium
LeetCodeMathGreedy
379. Design Phone DirectoryMedium
LeetCodeArrayHash TableLinked ListDesign
3790. Smallest All-Ones MultipleMedium
LeetCodeHash TableMath
3792. Sum of Increasing Product BlocksMedium
LeetCodeMathSimulation
3795. Minimum Subarray Length With Distinct Sum At Least KMedium
LeetCodeArrayHash TableSliding Window
3796. Find Maximum Value in a Constrained SequenceMedium
LeetCodeArrayGreedy
3799. Word Squares IIMedium
LeetCodeArrayStringBacktrackingSorting
38. Count and SayMedium
LeetCodeString
380. Insert Delete GetRandom O(1)Medium
LeetCodeArrayHash TableMathDesign
3800. Minimum Cost to Make Two Binary Strings EqualMedium
LeetCodeStringGreedy
3804. Number of Centered SubarraysMedium
LeetCodeArrayHash TableEnumeration
3805. Count Caesar Cipher PairsMedium
LeetCodeArrayHash TableMathString
3807. Minimum Cost to Repair Edges to Traverse a GraphMedium
LeetCodeBinary SearchBreadth-First SearchGraph Theory
3808. Find Emotionally Consistent UsersMedium
LeetCode
3809. Best Reachable TowerMedium
LeetCodeArray
3810. Minimum Operations to Reach Target ArrayMedium
LeetCodeArrayHash TableGreedy
3811. Number of Alternating XOR PartitionsMedium
LeetCodeArrayHash TableDynamic ProgrammingBit Manipulation
3814. Maximum Capacity Within BudgetMedium
LeetCodeArrayTwo PointersBinary SearchSorting
3815. Design Auction SystemMedium
LeetCodeHash TableDesignHeap (Priority Queue)Ordered Set
3817. Good Indices in a Digit StringMedium
LeetCodeMathString
3818. Minimum Prefix Removal to Make Array Strictly IncreasingMedium
LeetCodeArray
3819. Rotate Non Negative ElementsMedium
LeetCodeArraySimulation
382. Linked List Random NodeMedium
LeetCodeLinked ListMathReservoir SamplingRandomized
3820. Pythagorean Distance Nodes in a TreeMedium
LeetCodeTreeBreadth-First Search
3822. Design Order Management SystemMedium
LeetCodeHash TableDesign
3824. Minimum K to Reduce Array Within LimitMedium
LeetCodeArrayBinary Search
3825. Longest Strictly Increasing Subsequence With Non-Zero Bitwise ANDMedium
LeetCodeArrayBinary SearchBit ManipulationEnumeration
3828. Final Element After Subarray DeletionsMedium
LeetCodeArrayMathBrainteaserGame Theory
3829. Design Ride Sharing SystemMedium
LeetCodeHash TableDesignQueueData Stream
3831. Median of a Binary Search Tree LevelMedium
LeetCodeTreeDepth-First SearchBreadth-First SearchBinary Search Tree
3834. Merge Adjacent Equal ElementsMedium
LeetCodeArrayStackSimulation
3835. Count Subarrays With Cost Less Than or Equal to KMedium
LeetCodeArrayQueueMonotonic Queue
3837. Delayed Count of Equal ElementsMedium
LeetCodeArrayHash TableCounting
3839. Number of Prefix Connected GroupsMedium
LeetCodeArrayHash TableStringCounting
384. Shuffle an ArrayMedium
LeetCodeArrayMathDesignRandomized
3840. House Robber VMedium
LeetCodeArrayDynamic Programming
3843. First Element with Unique FrequencyMedium
LeetCodeArrayHash TableCounting
3844. Longest Almost-Palindromic SubstringMedium
LeetCodeTwo PointersStringDynamic Programming
3846. Total Distance to Type a String Using One FingerMedium
LeetCodeHash TableString
3847. Find the Score Difference in a GameMedium
LeetCodeArraySimulation
3848. Check Digitorial PermutationMedium
LeetCodeMathCounting
3849. Maximum Bitwise XOR After RearrangementMedium
LeetCodeStringGreedyBit Manipulation
385. Mini ParserMedium
LeetCodeStringStackDepth-First Search
3851. Maximum Requests Without Violating the LimitMedium
LeetCodeArrayHash TableGreedySliding Window
3853. Merge Close CharactersMedium
LeetCodeHash TableString
3854. Minimum Operations to Make Array Parity AlternatingMedium
LeetCodeArrayGreedy
3857. Minimum Cost to Split into OnesMedium
LeetCodeMathDynamic Programming
3858. Minimum Bitwise OR From GridMedium
LeetCodeArrayGreedyBit ManipulationMatrix
386. Lexicographical NumbersMedium
LeetCodeDepth-First SearchTrie
3860. Unique Email GroupsMedium
LeetCodeArrayHash TableString
3862. Find the Smallest Balanced IndexMedium
LeetCodeArrayPrefix Sum
3863. Minimum Operations to Sort a StringMedium
LeetCodeString
3865. Reverse K SubarraysMedium
LeetCodeArrayTwo Pointers
3867. Sum of GCD of Formed PairsMedium
LeetCodeArrayMathTwo PointersSorting
3868. Minimum Cost to Equalize Arrays Using SwapsMedium
LeetCodeArrayHash TableGreedyCounting
3871. Count Commas in Range IIMedium
LeetCodeMath
3872. Longest Arithmetic Sequence After Changing At Most One ElementMedium
LeetCodeArrayEnumeration
3874. Valid Subarrays With Exactly One PeakMedium
LeetCodeArrayMath

← prevpage 139 / 617next →