CodeSearch
pick a problem · learn it with an AI tutor — hints, not spoilers
37,000 problems · all sources
- 402. Remove K DigitsMediumLeetCodeStringStackGreedyMonotonic Stack
- 406. Queue Reconstruction by HeightMediumLeetCodeArrayBinary Indexed TreeSegment TreeSorting
- 413. Arithmetic SlicesMediumLeetCodeArrayDynamic ProgrammingSliding Window
- 416. Partition Equal Subset SumMediumLeetCodeArrayDynamic Programming
- 417. Pacific Atlantic Water FlowMediumLeetCodeArrayDepth-First SearchBreadth-First SearchMatrix
- 418. Sentence Screen FittingMediumLeetCodeArrayStringDynamic Programming
- 419. Battleships in a BoardMediumLeetCodeArrayDepth-First SearchMatrix
- 421. Maximum XOR of Two Numbers in an ArrayMediumLeetCodeArrayHash TableBit ManipulationTrie
- 423. Reconstruct Original Digits from EnglishMediumLeetCodeHash TableMathString
- 424. Longest Repeating Character ReplacementMediumLeetCodeHash TableStringSliding Window
- 426. Convert Binary Search Tree to Sorted Doubly Linked ListMediumLeetCodeLinked ListStackTreeDepth-First Search
- 427. Construct Quad TreeMediumLeetCodeArrayDivide and ConquerTreeMatrix
- 429. N-ary Tree Level Order TraversalMediumLeetCodeTreeBreadth-First Search
- 43. Multiply StringsMediumLeetCodeMathStringSimulation
- 430. Flatten a Multilevel Doubly Linked ListMediumLeetCodeLinked ListDepth-First SearchDoubly-Linked List
- 433. Minimum Genetic MutationMediumLeetCodeHash TableStringBreadth-First Search
- 435. Non-overlapping IntervalsMediumLeetCodeArrayDynamic ProgrammingGreedySorting
- 436. Find Right IntervalMediumLeetCodeArrayBinary SearchSorting
- 437. Path Sum IIIMediumLeetCodeTreeDepth-First SearchBinary Tree
- 438. Find All Anagrams in a StringMediumLeetCodeHash TableStringSliding Window
- 439. Ternary Expression ParserMediumLeetCodeStringStackRecursion
- 442. Find All Duplicates in an ArrayMediumLeetCodeArrayHash TableSorting
- 443. String CompressionMediumLeetCodeTwo PointersString
- 444. Sequence ReconstructionMediumLeetCodeArrayGraph TheoryTopological Sort
- 445. Add Two Numbers IIMediumLeetCodeLinked ListMathStack
- 447. Number of BoomerangsMediumLeetCodeArrayHash TableMath
- 449. Serialize and Deserialize BSTMediumLeetCodeStringTreeDepth-First SearchBreadth-First Search
- 45. Jump Game IIMediumLeetCodeArrayDynamic ProgrammingGreedy
- 450. Delete Node in a BSTMediumLeetCodeTreeBinary Search TreeBinary Tree
- 451. Sort Characters By FrequencyMediumLeetCodeHash TableStringSortingHeap (Priority Queue)
- 452. Minimum Number of Arrows to Burst BalloonsMediumLeetCodeArrayGreedySorting
- 453. Minimum Moves to Equal Array ElementsMediumLeetCodeArrayMath
- 454. 4Sum IIMediumLeetCodeArrayHash Table
- 456. 132 PatternMediumLeetCodeArrayBinary SearchStackMonotonic Stack
- 457. Circular Array LoopMediumLeetCodeArrayHash TableTwo Pointers
- 46. PermutationsMediumLeetCodeArrayBacktracking
- 462. Minimum Moves to Equal Array Elements IIMediumLeetCodeArrayMathSorting
- 464. Can I WinMediumLeetCodeMathDynamic ProgrammingBit ManipulationMemoization
- 467. Unique Substrings in Wraparound StringMediumLeetCodeStringDynamic Programming
- 468. Validate IP AddressMediumLeetCodeString
- 469. Convex PolygonMediumLeetCodeArrayMathGeometry
- 47. Permutations IIMediumLeetCodeArrayBacktrackingSorting
- 470. Implement Rand10() Using Rand7()MediumLeetCodeMathRejection SamplingRandomizedProbability and Statistics
- 473. Matchsticks to SquareMediumLeetCodeArrayDynamic ProgrammingBacktrackingBit Manipulation
- 474. Ones and ZeroesMediumLeetCodeArrayStringDynamic Programming
- 475. HeatersMediumLeetCodeArrayTwo PointersBinary SearchSorting
- 477. Total Hamming DistanceMediumLeetCodeArrayMathBit Manipulation
- 478. Generate Random Point in a CircleMediumLeetCodeMathGeometryRejection SamplingRandomized
- 48. Rotate ImageMediumLeetCodeArrayMathMatrix
- 481. Magical StringMediumLeetCodeTwo PointersString
- 484. Find PermutationMediumLeetCodeArrayStringStackGreedy
- 486. Predict the WinnerMediumLeetCodeArrayMathDynamic ProgrammingRecursion
- 487. Max Consecutive Ones IIMediumLeetCodeArrayDynamic ProgrammingSliding Window
- 49. Group AnagramsMediumLeetCodeArrayHash TableStringSorting
- 490. The MazeMediumLeetCodeArrayDepth-First SearchBreadth-First SearchMatrix
- 491. Non-decreasing SubsequencesMediumLeetCodeArrayHash TableBacktrackingBit Manipulation
- 494. Target SumMediumLeetCodeArrayDynamic ProgrammingBacktracking
- 497. Random Point in Non-overlapping RectanglesMediumLeetCodeArrayMathBinary SearchReservoir Sampling
- 498. Diagonal TraverseMediumLeetCodeArrayMatrixSimulation
- 5. Longest Palindromic SubstringMediumLeetCodeTwo PointersStringDynamic Programming