CodeSearch

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

37,000 problems · all sources

3348. Smallest Divisible Digit Product IIHard
LeetCodeMathStringBacktrackingGreedy
335. Self CrossingHard
LeetCodeArrayMathGeometry
3351. Sum of Good SubsequencesHard
LeetCodeArrayHash TableDynamic Programming
3352. Count K-Reducible Numbers Less Than NHard
LeetCodeMathStringDynamic ProgrammingCombinatorics
3357. Minimize the Maximum Adjacent Element DifferenceHard
LeetCodeArrayBinary SearchGreedy
3359. Find Sorted Submatrices With Maximum Element at Most KHard
LeetCodeArrayStackMatrixMonotonic Stack
336. Palindrome PairsHard
LeetCodeArrayHash TableStringTrie
3363. Find the Maximum Number of Fruits CollectedHard
LeetCodeArrayDynamic ProgrammingMatrix
3367. Maximize Sum of Weights after Edge RemovalsHard
LeetCodeDynamic ProgrammingTreeDepth-First SearchSorting
3368. First Letter CapitalizationHard
LeetCodeDatabase
3369. Design an Array Statistics Tracker Hard
LeetCodeHash TableBinary SearchDesignQueue
3373. Maximize the Number of Target Nodes After Connecting Trees IIHard
LeetCodeTreeDepth-First SearchBreadth-First Search
3374. First Letter Capitalization IIHard
LeetCodeDatabase
3378. Count Connected Components in LCM GraphHard
LeetCodeArrayHash TableMathUnion-Find
3382. Maximum Area Rectangle With Point Constraints IIHard
LeetCodeArrayMathBinary Indexed TreeSegment Tree
3383. Minimum Runes to Add to Cast SpellHard
LeetCodeArrayDepth-First SearchBreadth-First SearchGraph Theory
3384. Team Dominance by Pass SuccessHard
LeetCodeDatabase
3385. Minimum Time to Break Locks IIHard
LeetCodeArrayBreadth-First SearchGraph Theory
3389. Minimum Operations to Make Character Frequencies EqualHard
LeetCodeHash TableStringDynamic ProgrammingCounting
3390. Longest Team Pass StreakHard
LeetCodeDatabase
3395. Subsequences with a Unique Middle Mode IHard
LeetCodeArrayHash TableMathCombinatorics
3398. Smallest Substring With Identical Characters IHard
LeetCodeArrayBinary SearchEnumeration
3399. Smallest Substring With Identical Characters IIHard
LeetCodeStringBinary Search
3401. Find Circular Gift Exchange ChainsHard
LeetCodeDatabase
3405. Count the Number of Arrays with K Matching Adjacent ElementsHard
LeetCodeMathCombinatorics
3406. Find the Lexicographically Largest String From the Box IIHard
LeetCodeTwo PointersString
3410. Maximize Subarray Sum After Removing All Occurrences of One ElementHard
LeetCodeArrayHash TableDivide and ConquerDynamic Programming
3414. Maximum Score of Non-overlapping IntervalsHard
LeetCodeArrayBinary SearchDynamic ProgrammingSorting
3416. Subsequences with a Unique Middle Mode IIHard
LeetCodeArrayHash TableMathCombinatorics
3420. Count Non-Decreasing Subarrays After K OperationsHard
LeetCodeArrayStackSegment TreeQueue
3425. Longest Special PathHard
LeetCodeArrayHash TableTreeDepth-First Search
3426. Manhattan Distances of All Arrangements of PiecesHard
LeetCodeMathCombinatorics
3430. Maximum and Minimum Sums of at Most Size K SubarraysHard
LeetCodeArrayMathStackMonotonic Stack
3435. Frequencies of Shortest SupersequencesHard
LeetCodeArrayStringBit ManipulationGraph Theory
3441. Minimum Cost Good CaptionHard
LeetCodeStringDynamic Programming
3444. Minimum Increments for Target Multiples in an ArrayHard
LeetCodeArrayMathDynamic ProgrammingBit Manipulation
3445. Maximum Difference Between Even and Odd Frequency IIHard
LeetCodeStringSliding WindowEnumerationPrefix Sum
3448. Count Substrings Divisible By Last DigitHard
LeetCodeStringDynamic Programming
3449. Maximize the Minimum Game ScoreHard
LeetCodeArrayBinary SearchGreedy
3451. Find Invalid IP AddressesHard
LeetCodeDatabase
3454. Separate Squares IIHard
LeetCodeArrayBinary SearchSegment TreeSweep Line
3455. Shortest Matching SubstringHard
LeetCodeTwo PointersStringBinary SearchString Matching
3459. Length of Longest V-Shaped Diagonal SegmentHard
LeetCodeArrayDynamic ProgrammingMemoizationMatrix
3463. Check If Digits Are Equal in String After Operations IIHard
LeetCodeMathStringCombinatoricsNumber Theory
3464. Maximize the Distance Between Points on a SquareHard
LeetCodeArrayMathBinary SearchGeometry
3470. Permutations IVHard
LeetCodeArrayMathCombinatoricsEnumeration
3474. Lexicographically Smallest Generated StringHard
LeetCodeStringGreedyString Matching
3480. Maximize Subarrays After Removing One Conflicting PairHard
LeetCodeArraySegment TreeEnumerationPrefix Sum
3482. Analyze Organization HierarchyHard
LeetCodeDatabase
3485. Longest Common Prefix of K Strings After RemovalHard
LeetCodeArrayStringTrie
3486. Longest Special Path IIHard
LeetCodeArrayHash TableTreeDepth-First Search
3490. Count Beautiful NumbersHard
LeetCodeDynamic Programming
3495. Minimum Operations to Make Array Elements ZeroHard
LeetCodeArrayMathBit Manipulation
3500. Minimum Cost to Divide Array Into SubarraysHard
LeetCodeArrayDynamic ProgrammingPrefix Sum
3501. Maximize Active Section with Trade IIHard
LeetCodeArrayStringBinary SearchSegment Tree
3504. Longest Palindrome After Substring Concatenation IIHard
LeetCodeTwo PointersStringDynamic Programming
3505. Minimum Operations to Make Elements Within K Subarrays EqualHard
LeetCodeArrayHash TableMathDynamic Programming
3506. Find Time Required to Eliminate Bacterial StrainsHard
LeetCodeArrayMathGreedyHeap (Priority Queue)
3509. Maximum Product of Subsequences With an Alternating Sum Equal to KHard
LeetCodeArrayHash TableDynamic Programming
3510. Minimum Pair Removal to Sort Array IIHard
LeetCodeArrayHash TableLinked ListHeap (Priority Queue)

← prevpage 228 / 617next →