CodeSearch

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

37,000 problems · all sources

1301. Number of Paths with Max ScoreHard
LeetCodeArrayDynamic ProgrammingMatrix
1307. Verbal Arithmetic PuzzleHard
LeetCodeArrayMathStringBacktracking
1312. Minimum Insertion Steps to Make a String PalindromeHard
LeetCodeStringDynamic Programming
1316. Distinct Echo SubstringsHard
LeetCodeStringTrieRolling HashHash Function
132. Palindrome Partitioning IIHard
LeetCodeStringDynamic Programming
1320. Minimum Distance to Type a Word Using Two FingersHard
LeetCodeStringDynamic Programming
1326. Minimum Number of Taps to Open to Water a GardenHard
LeetCodeArrayDynamic ProgrammingGreedy
1330. Reverse Subarray To Maximize Array ValueHard
LeetCodeArrayMathGreedy
1335. Minimum Difficulty of a Job ScheduleHard
LeetCodeArrayDynamic Programming
1336. Number of Transactions per VisitHard
LeetCodeDatabase
1340. Jump Game VHard
LeetCodeArrayDynamic ProgrammingSorting
1345. Jump Game IVHard
LeetCodeArrayHash TableBreadth-First Search
1349. Maximum Students Taking ExamHard
LeetCodeArrayDynamic ProgrammingBit ManipulationMatrix
135. CandyHard
LeetCodeArrayGreedy
1354. Construct Target Array With Multiple SumsHard
LeetCodeArrayHeap (Priority Queue)
1359. Count All Valid Pickup and Delivery OptionsHard
LeetCodeMathDynamic ProgrammingCombinatorics
1363. Largest Multiple of ThreeHard
LeetCodeArrayMathDynamic ProgrammingGreedy
1368. Minimum Cost to Make at Least One Valid Path in a GridHard
LeetCodeArrayBreadth-First SearchGraph TheoryHeap (Priority Queue)
1369. Get the Second Most Recent ActivityHard
LeetCodeDatabase
1373. Maximum Sum BST in Binary TreeHard
LeetCodeDynamic ProgrammingTreeDepth-First SearchBinary Search Tree
1377. Frog Position After T SecondsHard
LeetCodeTreeDepth-First SearchBreadth-First SearchGraph Theory
1383. Maximum Performance of a TeamHard
LeetCodeArrayGreedySortingHeap (Priority Queue)
1384. Total Sales Amount by YearHard
LeetCodeDatabase
1388. Pizza With 3n SlicesHard
LeetCodeArrayDynamic ProgrammingGreedyHeap (Priority Queue)
1392. Longest Happy PrefixHard
LeetCodeStringRolling HashString MatchingHash Function
1397. Find All Good StringsHard
LeetCodeStringDynamic ProgrammingString Matching
140. Word Break IIHard
LeetCodeArrayHash TableStringDynamic Programming
1402. Reducing DishesHard
LeetCodeArrayDynamic ProgrammingGreedySorting
1406. Stone Game IIIHard
LeetCodeArrayMathDynamic ProgrammingGame Theory
1411. Number of Ways to Paint N × 3 GridHard
LeetCodeDynamic Programming
1412. Find the Quiet Students in All ExamsHard
LeetCodeDatabase
1416. Restore The ArrayHard
LeetCodeStringDynamic Programming
1420. Build Array Where You Can Find The Maximum Exactly K ComparisonsHard
LeetCodeDynamic ProgrammingPrefix Sum
1425. Constrained Subsequence SumHard
LeetCodeArrayDynamic ProgrammingQueueSliding Window
1434. Number of Ways to Wear Different Hats to Each OtherHard
LeetCodeArrayDynamic ProgrammingBit ManipulationBitmask
1439. Find the Kth Smallest Sum of a Matrix With Sorted RowsHard
LeetCodeArrayBinary SearchHeap (Priority Queue)Matrix
1444. Number of Ways of Cutting a PizzaHard
LeetCodeArrayDynamic ProgrammingMemoizationMatrix
1449. Form Largest Integer With Digits That Add up to TargetHard
LeetCodeArrayDynamic Programming
1453. Maximum Number of Darts Inside of a Circular DartboardHard
LeetCodeArrayMathGeometry
1458. Max Dot Product of Two SubsequencesHard
LeetCodeArrayDynamic Programming
1463. Cherry Pickup IIHard
LeetCodeArrayDynamic ProgrammingMatrix
1467. Probability of a Two Boxes Having The Same Number of Distinct BallsHard
LeetCodeArrayMathDynamic ProgrammingBacktracking
1473. Paint House IIIHard
LeetCodeArrayDynamic Programming
1478. Allocate MailboxesHard
LeetCodeArrayMathDynamic ProgrammingSorting
1479. Sales by Day of the WeekHard
LeetCodeDatabase
1483. Kth Ancestor of a Tree NodeHard
LeetCodeBinary SearchDynamic ProgrammingBit ManipulationTree
1489. Find Critical and Pseudo-Critical Edges in Minimum Spanning TreeHard
LeetCodeUnion-FindGraph TheorySortingMinimum Spanning Tree
149. Max Points on a LineHard
LeetCodeArrayHash TableMathGeometry
1494. Parallel Courses IIHard
LeetCodeDynamic ProgrammingBit ManipulationGraph TheoryBitmask
1499. Max Value of EquationHard
LeetCodeArrayQueueSliding WindowHeap (Priority Queue)
1505. Minimum Possible Integer After at Most K Adjacent Swaps On DigitsHard
LeetCodeStringGreedyBinary Indexed TreeSegment Tree
1510. Stone Game IVHard
LeetCodeMathDynamic ProgrammingGame Theory
1515. Best Position for a Service CentreHard
LeetCodeArrayMathGeometryRandomized
1516. Move Sub-Tree of N-Ary TreeHard
LeetCodeTreeDepth-First Search
1520. Maximum Number of Non-Overlapping SubstringsHard
LeetCodeHash TableStringGreedySorting
1521. Find a Value of a Mysterious Function Closest to TargetHard
LeetCodeArrayBinary SearchBit ManipulationSegment Tree
1526. Minimum Number of Increments on Subarrays to Form a Target ArrayHard
LeetCodeArrayDynamic ProgrammingStackGreedy
1531. String Compression IIHard
LeetCodeStringDynamic Programming
1537. Get the Maximum ScoreHard
LeetCodeArrayTwo PointersDynamic ProgrammingGreedy
154. Find Minimum in Rotated Sorted Array IIHard
LeetCodeArrayBinary Search

← prevpage 219 / 617next →