CodeSearch
pick a problem · learn it with an AI tutor — hints, not spoilers
37,000 problems · all sources
- 2406. Divide Intervals Into Minimum Number of GroupsMediumLeetCodeArrayTwo PointersGreedySorting
- 2408. Design SQLMediumLeetCodeArrayHash TableStringDesign
- 241. Different Ways to Add ParenthesesMediumLeetCodeMathStringDynamic ProgrammingRecursion
- 2410. Maximum Matching of Players With TrainersMediumLeetCodeArrayTwo PointersGreedySorting
- 2411. Smallest Subarrays With Maximum Bitwise ORMediumLeetCodeArrayBinary SearchBit ManipulationSliding Window
- 2414. Length of the Longest Alphabetical Continuous SubstringMediumLeetCodeString
- 2415. Reverse Odd Levels of Binary TreeMediumLeetCodeTreeDepth-First SearchBreadth-First SearchBinary Tree
- 2417. Closest Fair IntegerMediumLeetCodeMathEnumeration
- 2419. Longest Subarray With Maximum Bitwise ANDMediumLeetCodeArrayBit ManipulationBrainteaser
- 2420. Find All Good IndicesMediumLeetCodeArrayDynamic ProgrammingPrefix Sum
- 2422. Merge Operations to Turn Array Into a PalindromeMediumLeetCodeArrayTwo PointersGreedy
- 2424. Longest Uploaded PrefixMediumLeetCodeHash TableBinary SearchUnion-FindDesign
- 2425. Bitwise XOR of All PairingsMediumLeetCodeArrayBit ManipulationBrainteaser
- 2428. Maximum Sum of an HourglassMediumLeetCodeArrayMatrixPrefix Sum
- 2429. Minimize XORMediumLeetCodeGreedyBit Manipulation
- 2431. Maximize Total Tastiness of Purchased FruitsMediumLeetCodeArrayDynamic Programming
- 2433. Find The Original Array of Prefix XorMediumLeetCodeArrayBit Manipulation
- 2434. Using a Robot to Print the Lexicographically Smallest StringMediumLeetCodeHash TableStringStackGreedy
- 2436. Minimum Split Into Subarrays With GCD Greater Than OneMediumLeetCodeArrayMathDynamic ProgrammingGreedy
- 2438. Range Product Queries of PowersMediumLeetCodeArrayBit ManipulationPrefix Sum
- 2439. Minimize Maximum of ArrayMediumLeetCodeArrayBinary SearchDynamic ProgrammingGreedy
- 244. Shortest Word Distance IIMediumLeetCodeArrayHash TableTwo PointersString
- 2442. Count Number of Distinct Integers After Reverse OperationsMediumLeetCodeArrayHash TableMathCounting
- 2443. Sum of Number and Its ReverseMediumLeetCodeMathEnumeration
- 2445. Number of Nodes With Value OneMediumLeetCodeArrayTreeDepth-First SearchBreadth-First Search
- 2447. Number of Subarrays With GCD Equal to KMediumLeetCodeArrayMathNumber Theory
- 245. Shortest Word Distance IIIMediumLeetCodeArrayString
- 2450. Number of Distinct Binary Strings After Applying OperationsMediumLeetCodeMathString
- 2452. Words Within Two Edits of DictionaryMediumLeetCodeArrayStringTrie
- 2453. Destroy Sequential TargetsMediumLeetCodeArrayHash TableCounting
- 2456. Most Popular Video CreatorMediumLeetCodeArrayHash TableStringSorting
- 2457. Minimum Addition to Make Integer BeautifulMediumLeetCodeMathGreedy
- 2461. Maximum Sum of Distinct Subarrays With Length KMediumLeetCodeArrayHash TableSliding Window
- 2462. Total Cost to Hire K WorkersMediumLeetCodeArrayTwo PointersHeap (Priority Queue)Simulation
- 2464. Minimum Subarrays in a Valid SplitMediumLeetCodeArrayMathDynamic ProgrammingNumber Theory
- 2466. Count Ways To Build Good StringsMediumLeetCodeDynamic Programming
- 2467. Most Profitable Path in a TreeMediumLeetCodeArrayTreeDepth-First SearchBreadth-First Search
- 247. Strobogrammatic Number IIMediumLeetCodeArrayStringRecursion
- 2470. Number of Subarrays With LCM Equal to KMediumLeetCodeArrayMathNumber Theory
- 2471. Minimum Number of Operations to Sort a Binary Tree by LevelMediumLeetCodeTreeBreadth-First SearchBinary Tree
- 2473. Minimum Cost to Buy ApplesMediumLeetCodeArrayGraph TheoryHeap (Priority Queue)Shortest Path
- 2476. Closest Nodes Queries in a Binary Search TreeMediumLeetCodeArrayBinary SearchTreeDepth-First Search
- 2477. Minimum Fuel Cost to Report to the CapitalMediumLeetCodeTreeDepth-First SearchBreadth-First SearchGraph Theory
- 2482. Difference Between Ones and Zeros in Row and ColumnMediumLeetCodeArrayMatrixSimulation
- 2483. Minimum Penalty for a ShopMediumLeetCodeStringPrefix Sum
- 2486. Append Characters to String to Make SubsequenceMediumLeetCodeTwo PointersStringGreedy
- 2487. Remove Nodes From Linked ListMediumLeetCodeLinked ListStackRecursionMonotonic Stack
- 2489. Number of Substrings With Fixed RatioMediumLeetCodeHash TableMathStringPrefix Sum
- 249. Group Shifted StringsMediumLeetCodeArrayHash TableString
- 2491. Divide Players Into Teams of Equal SkillMediumLeetCodeArrayHash TableTwo PointersSorting
- 2492. Minimum Score of a Path Between Two CitiesMediumLeetCodeDepth-First SearchBreadth-First SearchUnion-FindGraph Theory
- 2495. Number of Subarrays Having Even ProductMediumLeetCodeArrayMathDynamic Programming
- 2497. Maximum Star Sum of a GraphMediumLeetCodeArrayGreedyGraph TheorySorting
- 2498. Frog Jump IIMediumLeetCodeArrayBinary SearchGreedy
- 250. Count Univalue SubtreesMediumLeetCodeTreeDepth-First SearchBinary Tree
- 2501. Longest Square Streak in an ArrayMediumLeetCodeArrayHash TableBinary SearchDynamic Programming
- 2502. Design Memory AllocatorMediumLeetCodeArrayHash TableDesignSimulation
- 2505. Bitwise OR of All Subsequence SumsMediumLeetCodeArrayMathBit ManipulationBrainteaser
- 2507. Smallest Value After Replacing With Sum of Prime FactorsMediumLeetCodeMathSimulationNumber Theory
- 251. Flatten 2D VectorMediumLeetCodeArrayTwo PointersDesignIterator