CodeSearch
pick a problem · learn it with an AI tutor — hints, not spoilers
37,000 problems · all sources
- 2262. Total Appeal of A StringHardLeetCodeHash TableStringDynamic Programming
- 2263. Make Array Non-decreasing or Non-increasingHardLeetCodeArrayDynamic ProgrammingGreedyHeap (Priority Queue)
- 2267. Check if There Is a Valid Parentheses String PathHardLeetCodeArrayDynamic ProgrammingMatrix
- 2272. Substring With Largest VarianceHardLeetCodeHash TableStringDynamic ProgrammingEnumeration
- 2276. Count Integers in IntervalsHardLeetCodeDesignSegment TreeOrdered Set
- 2277. Closest Node to Path in TreeHardLeetCodeArrayTreeDepth-First SearchBreadth-First Search
- 2281. Sum of Total Strength of WizardsHardLeetCodeArrayStackMonotonic StackPrefix Sum
- 2286. Booking Concert Tickets in GroupsHardLeetCodeBinary SearchDesignBinary Indexed TreeSegment Tree
- 2290. Minimum Obstacle Removal to Reach CornerHardLeetCodeArrayBreadth-First SearchGraph TheoryHeap (Priority Queue)
- 2296. Design a Text EditorHardLeetCodeLinked ListStringStackDesign
- 23 Kingdom2200Codeforcesbinary searchbrute forcedata structuresgreedy
- 23. Merge k Sorted ListsHardLeetCodeLinked ListDivide and ConquerHeap (Priority Queue)Merge Sort
- 2301. Match Substring After ReplacementHardLeetCodeArrayHash TableStringString Matching
- 2302. Count Subarrays With Score Less Than KHardLeetCodeArrayBinary SearchSliding WindowPrefix Sum
- 2306. Naming a CompanyHardLeetCodeArrayHash TableStringBit Manipulation
- 2307. Check for Contradictions in EquationsHardLeetCodeArrayStringDepth-First SearchUnion-Find
- 2312. Selling Pieces of WoodHardLeetCodeArrayDynamic ProgrammingMemoization
- 2313. Minimum Flips in Binary Tree to Get ResultHardLeetCodeDynamic ProgrammingTreeDepth-First SearchBinary Tree
- 2318. Number of Distinct Roll SequencesHardLeetCodeDynamic ProgrammingMemoization
- 2321. Maximum Score Of Spliced ArrayHardLeetCodeArrayDynamic Programming
- 2322. Minimum Score After Removals on a TreeHardLeetCodeArrayBit ManipulationTreeDepth-First Search
- 2328. Number of Increasing Paths in a GridHardLeetCodeArrayDynamic ProgrammingDepth-First SearchBreadth-First Search
- 233. Number of Digit OneHardLeetCodeMathDynamic ProgrammingRecursion
- 2334. Subarray With Elements Greater Than Varying ThresholdHardLeetCodeArrayStackUnion-FindMonotonic Stack
- 2338. Count the Number of Ideal ArraysHardLeetCodeMathDynamic ProgrammingCombinatoricsNumber Theory
- 2344. Minimum Deletions to Make Array DivisibleHardLeetCodeArrayMathSortingHeap (Priority Queue)
- 2350. Shortest Impossible Sequence of RollsHardLeetCodeArrayHash TableGreedy
- 2354. Number of Excellent PairsHardLeetCodeArrayHash TableBinary SearchBit Manipulation
- 2355. Maximum Number of Books You Can TakeHardLeetCodeArrayDynamic ProgrammingStackMonotonic Stack
- 2360. Longest Cycle in a GraphHardLeetCodeDepth-First SearchBreadth-First SearchGraph TheoryTopological Sort
- 2361. Minimum Costs Using the Train LineHardLeetCodeArrayDynamic Programming
- 2362. Generate the InvoiceHardLeetCodeDatabase
- 2366. Minimum Replacements to Sort the ArrayHardLeetCodeArrayMathGreedy
- 2371. Minimize Maximum Value in a GridHardLeetCodeArrayUnion-FindGraph TheoryTopological Sort
- 2376. Count Special IntegersHardLeetCodeMathDynamic Programming
- 2382. Maximum Segment Sum After RemovalsHardLeetCodeArrayUnion-FindPrefix SumOrdered Set
- 2386. Find the K-Sum of an ArrayHardLeetCodeArraySortingHeap (Priority Queue)
- 239. Sliding Window MaximumHardLeetCodeArrayQueueSliding WindowHeap (Priority Queue)
- 2392. Build a Matrix With ConditionsHardLeetCodeArrayGraph TheoryTopological SortMatrix
- 2398. Maximum Number of Robots Within BudgetHardLeetCodeArrayBinary SearchQueueSliding Window
- 2402. Meeting Rooms IIIHardLeetCodeArrayHash TableSortingHeap (Priority Queue)
- 2403. Minimum Time to Kill All MonstersHardLeetCodeArrayDynamic ProgrammingBit ManipulationBitmask
- 2407. Longest Increasing Subsequence IIHardLeetCodeArrayDivide and ConquerDynamic ProgrammingBinary Indexed Tree
- 2412. Minimum Money Required Before TransactionsHardLeetCodeArrayGreedySorting
- 2416. Sum of Prefix Scores of StringsHardLeetCodeArrayStringTrieCounting
- 2421. Number of Good PathsHardLeetCodeArrayHash TableTreeUnion-Find
- 2426. Number of Pairs Satisfying InequalityHardLeetCodeArrayBinary SearchDivide and ConquerBinary Indexed Tree
- 2430. Maximum Deletions on a StringHardLeetCodeStringDynamic ProgrammingRolling HashString Matching
- 2435. Paths in Matrix Whose Sum Is Divisible by KHardLeetCodeArrayDynamic ProgrammingMatrix
- 2440. Create Components With Same ValueHardLeetCodeArrayMathTreeDepth-First Search
- 2444. Count Subarrays With Fixed BoundsHardLeetCodeArrayQueueSliding WindowMonotonic Queue
- 2448. Minimum Cost to Make Array EqualHardLeetCodeArrayBinary SearchGreedySorting
- 2449. Minimum Number of Operations to Make Arrays SimilarHardLeetCodeArrayGreedySorting
- 2454. Next Greater Element IVHardLeetCodeArrayBinary SearchStackSorting
- 2458. Height of Binary Tree After Subtree Removal QueriesHardLeetCodeArrayTreeDepth-First SearchBreadth-First Search
- 2459. Sort Array by Moving Items to Empty SpaceHardLeetCodeArrayHash TableSorting
- 2463. Minimum Total Distance TraveledHardLeetCodeArrayDynamic ProgrammingSorting
- 2468. Split Message Based on LimitHardLeetCodeStringEnumeration
- 2472. Maximum Number of Non-overlapping Palindrome SubstringsHardLeetCodeTwo PointersStringDynamic ProgrammingGreedy
- 2474. Customers With Strictly Increasing PurchasesHardLeetCodeDatabase