CodeSearch

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

37,000 problems · all sources

2973. Find Number of Coins to Place in Tree NodesHard
LeetCodeDynamic ProgrammingTreeDepth-First SearchSorting
2977. Minimum Cost to Convert String IIHard
LeetCodeArrayStringDynamic ProgrammingGraph Theory
2983. Palindrome Rearrangement QueriesHard
LeetCodeArrayHash TableStringPrefix Sum
2991. Top Three Wineries Hard
LeetCodeDatabase
2994. Friday Purchases II Hard
LeetCodeDatabase
2995. Viewers Turned StreamersHard
LeetCodeDatabase
2999. Count the Number of Powerful IntegersHard
LeetCodeMathStringDynamic Programming
30. Substring with Concatenation of All WordsHard
LeetCodeHash TableStringSliding Window
3003. Maximize the Number of Partitions After OperationsHard
LeetCodeStringDynamic ProgrammingBit ManipulationBitmask
3008. Find Beautiful Indices in the Given Array IIHard
LeetCodeTwo PointersStringBinary SearchRolling Hash
3009. Maximum Number of Intersections on the ChartHard
LeetCodeArrayHash TableMathBinary Indexed Tree
301. Remove Invalid ParenthesesHard
LeetCodeStringBacktrackingBreadth-First Search
3013. Divide an Array Into Subarrays With Minimum Cost IIHard
LeetCodeArrayHash TableSliding WindowHeap (Priority Queue)
3017. Count the Number of Houses at a Certain Distance IIHard
LeetCodeGraph TheoryPrefix Sum
3018. Maximum Number of Removal Queries That Can Be Processed IHard
LeetCodeArrayDynamic Programming
302. Smallest Rectangle Enclosing Black PixelsHard
LeetCodeArrayBinary SearchDepth-First SearchBreadth-First Search
3022. Minimize OR of Remaining Elements Using OperationsHard
LeetCodeArrayGreedyBit Manipulation
3027. Find the Number of Ways to Place People IIHard
LeetCodeArrayMathGeometrySorting
3031. Minimum Time to Revert Word to Initial State IIHard
LeetCodeStringRolling HashString MatchingHash Function
3036. Number of Subarrays That Match a Pattern IIHard
LeetCodeArrayRolling HashString MatchingHash Function
3037. Find Pattern in Infinite Stream IIHard
LeetCodeArraySliding WindowRolling HashString Matching
3041. Maximize Consecutive Elements in an Array After ModificationHard
LeetCodeArrayDynamic ProgrammingSorting
3045. Count Prefix and Suffix Pairs IIHard
LeetCodeArrayStringTrieRolling Hash
3049. Earliest Second to Mark Indices IIHard
LeetCodeArrayBinary SearchGreedyHeap (Priority Queue)
305. Number of Islands IIHard
LeetCodeArrayHash TableUnion-Find
3052. Maximize ItemsHard
LeetCodeDatabase
3057. Employees Project AllocationHard
LeetCodeDatabase
3060. User Activities within Time BoundsHard
LeetCodeDatabase
3061. Calculate Trapping Rain WaterHard
LeetCodeDatabase
3068. Find the Maximum Sum of Node ValuesHard
LeetCodeArrayDynamic ProgrammingGreedyBit Manipulation
3072. Distribute Elements Into Two Arrays IIHard
LeetCodeArrayBinary Indexed TreeSegment TreeSimulation
3077. Maximum Strength of K Disjoint SubarraysHard
LeetCodeArrayDynamic ProgrammingPrefix Sum
3082. Find the Sum of the Power of All SubsequencesHard
LeetCodeArrayDynamic Programming
3086. Minimum Moves to Pick K OnesHard
LeetCodeArrayGreedySliding WindowPrefix Sum
3088. Make String Anti-palindromeHard
LeetCodeStringGreedySortingCounting Sort
3093. Longest Common Suffix QueriesHard
LeetCodeArrayStringTrie
3098. Find the Sum of Subsequence PowersHard
LeetCodeArrayDynamic ProgrammingSorting
3102. Minimize Manhattan DistancesHard
LeetCodeArrayMathGeometrySorting
3103. Find Trending Hashtags II Hard
LeetCodeDatabase
3104. Find Longest Self-Contained SubstringHard
LeetCodeHash TableStringSorting
3108. Minimum Cost Walk in Weighted GraphHard
LeetCodeArrayBit ManipulationUnion-FindGraph Theory
3113. Find the Number of Subarrays Where Boundary Elements Are MaximumHard
LeetCodeArrayBinary SearchStackMonotonic Stack
3116. Kth Smallest Amount With Single Denomination CombinationHard
LeetCodeArrayMathBinary SearchBit Manipulation
3117. Minimum Sum of Values by Dividing ArrayHard
LeetCodeArrayBinary SearchDynamic ProgrammingBit Manipulation
312. Burst BalloonsHard
LeetCodeArrayDynamic Programming
3123. Find Edges in Shortest PathsHard
LeetCodeDepth-First SearchBreadth-First SearchGraph TheoryHeap (Priority Queue)
3130. Find All Possible Stable Binary Arrays IIHard
LeetCodeDynamic ProgrammingPrefix Sum
3134. Find the Median of the Uniqueness ArrayHard
LeetCodeArrayHash TableBinary SearchSliding Window
3139. Minimum Cost to Equalize ArrayHard
LeetCodeArrayGreedyEnumeration
3141. Maximum Hamming DistancesHard
LeetCodeArrayBit ManipulationBreadth-First Search
3145. Find Products of Elements of Big ArrayHard
LeetCodeArrayBinary SearchBit Manipulation
3149. Find the Minimum Cost Array PermutationHard
LeetCodeArrayDynamic ProgrammingBit ManipulationBitmask
315. Count of Smaller Numbers After SelfHard
LeetCodeArrayBinary SearchDivide and ConquerBinary Indexed Tree
3154. Find Number of Ways to Reach the K-th StairHard
LeetCodeMathDynamic ProgrammingBit ManipulationMemoization
3156. Employee Task Duration and Concurrent TasksHard
LeetCodeDatabase
3161. Block Placement QueriesHard
LeetCodeArrayBinary SearchBinary Indexed TreeSegment Tree
3165. Maximum Sum of Subsequence With Non-adjacent ElementsHard
LeetCodeArrayDivide and ConquerDynamic ProgrammingSegment Tree
317. Shortest Distance from All BuildingsHard
LeetCodeArrayBreadth-First SearchMatrix
3171. Find Subarray With Bitwise OR Closest to KHard
LeetCodeArrayBinary SearchBit ManipulationSegment Tree
3177. Find the Maximum Length of a Good Subsequence IIHard
LeetCodeArrayHash TableDynamic Programming

← prevpage 226 / 617next →