CodeSearch

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

37,000 problems · all sources

1000. Minimum Cost to Merge StonesHard
LeetCodeArrayDynamic ProgrammingPrefix Sum
1001. Grid IlluminationHard
LeetCodeArrayHash Table
1012. Numbers With Repeated DigitsHard
LeetCodeMathDynamic Programming
1028. Recover a Tree From Preorder TraversalHard
LeetCodeStringTreeDepth-First SearchBinary Tree
1032. Stream of CharactersHard
LeetCodeArrayStringDesignTrie
1036. Escape a Large MazeHard
LeetCodeArrayHash TableDepth-First SearchBreadth-First Search
1044. Longest Duplicate SubstringHard
LeetCodeStringBinary SearchSliding WindowRolling Hash
1063. Number of Valid SubarraysHard
LeetCodeArrayStackMonotonic Stack
1067. Digit Count in RangeHard
LeetCodeMathDynamic Programming
1074. Number of Submatrices That Sum to TargetHard
LeetCodeArrayHash TableMatrixPrefix Sum
1088. Confusing Number IIHard
LeetCodeMathBacktracking
1092. Shortest Common Supersequence Hard
LeetCodeStringDynamic Programming
1095. Find in Mountain ArrayHard
LeetCodeArrayBinary SearchInteractive
1096. Brace Expansion IIHard
LeetCodeHash TableStringBacktrackingStack
1097. Game Play Analysis VHard
LeetCodeDatabase
1106. Parsing A Boolean ExpressionHard
LeetCodeStringStackRecursion
1121. Divide Array Into Increasing SequencesHard
LeetCodeArrayCounting
1125. Smallest Sufficient TeamHard
LeetCodeArrayDynamic ProgrammingBit ManipulationBitmask
1127. User Purchase PlatformHard
LeetCodeDatabase
1147. Longest Chunked Palindrome DecompositionHard
LeetCodeTwo PointersStringDynamic ProgrammingGreedy
115. Distinct SubsequencesHard
LeetCodeStringDynamic Programming
1153. String Transforms Into Another StringHard
LeetCodeHash TableStringGraph Theory
1157. Online Majority Element In SubarrayHard
LeetCodeArrayBinary SearchDesignBinary Indexed Tree
1159. Market Analysis IIHard
LeetCodeDatabase
1163. Last Substring in Lexicographical OrderHard
LeetCodeTwo PointersString
1168. Optimize Water Distribution in a VillageHard
LeetCodeUnion-FindGraph TheoryHeap (Priority Queue)Minimum Spanning Tree
1172. Dinner Plate StacksHard
LeetCodeHash TableStackDesignHeap (Priority Queue)
1178. Number of Valid Words for Each PuzzleHard
LeetCodeArrayHash TableStringBit Manipulation
1183. Maximum Number of OnesHard
LeetCodeMathGreedySortingHeap (Priority Queue)
1187. Make Array Strictly IncreasingHard
LeetCodeArrayBinary SearchDynamic ProgrammingSorting
1192. Critical Connections in a NetworkHard
LeetCodeDepth-First SearchGraph TheoryBiconnected Component
1194. Tournament WinnersHard
LeetCodeDatabase
1199. Minimum Time to Build BlocksHard
LeetCodeArrayMathGreedyHeap (Priority Queue)
1203. Sort Items by Groups Respecting DependenciesHard
LeetCodeDepth-First SearchBreadth-First SearchGraph TheoryTopological Sort
1206. Design SkiplistHard
LeetCodeLinked ListDesign
1210. Minimum Moves to Reach Target with RotationsHard
LeetCodeArrayBreadth-First SearchMatrix
1216. Valid Palindrome IIIHard
LeetCodeStringDynamic Programming
1220. Count Vowels PermutationHard
LeetCodeDynamic Programming
1223. Dice Roll SimulationHard
LeetCodeArrayDynamic Programming
1224. Maximum Equal FrequencyHard
LeetCodeArrayHash Table
1225. Report Contiguous DatesHard
LeetCodeDatabase
123. Best Time to Buy and Sell Stock IIIHard
LeetCodeArrayDynamic Programming
1231. Divide ChocolateHard
LeetCodeArrayBinary Search
1235. Maximum Profit in Job SchedulingHard
LeetCodeArrayBinary SearchDynamic ProgrammingSorting
124. Binary Tree Maximum Path SumHard
LeetCodeDynamic ProgrammingTreeDepth-First SearchBinary Tree
1240. Tiling a Rectangle with the Fewest SquaresHard
LeetCodeBacktracking
1246. Palindrome RemovalHard
LeetCodeArrayDynamic Programming
1250. Check If It Is a Good ArrayHard
LeetCodeArrayMathNumber Theory
1255. Maximum Score Words Formed by LettersHard
LeetCodeArrayHash TableStringDynamic Programming
1259. Handshakes That Don't CrossHard
LeetCodeMathDynamic Programming
126. Word Ladder IIHard
LeetCodeHash TableStringBacktrackingBreadth-First Search
1263. Minimum Moves to Move a Box to Their Target LocationHard
LeetCodeArrayBreadth-First SearchHeap (Priority Queue)Matrix
1269. Number of Ways to Stay in the Same Place After Some StepsHard
LeetCodeDynamic Programming
127. Word LadderHard
LeetCodeHash TableStringBreadth-First Search
1274. Number of Ships in a RectangleHard
LeetCodeArrayDivide and ConquerInteractive
1278. Palindrome Partitioning IIIHard
LeetCodeStringDynamic Programming
1284. Minimum Number of Flips to Convert Binary Matrix to Zero MatrixHard
LeetCodeArrayHash TableBit ManipulationBreadth-First Search
1289. Minimum Falling Path Sum IIHard
LeetCodeArrayDynamic ProgrammingMatrix
1293. Shortest Path in a Grid with Obstacles EliminationHard
LeetCodeArrayBreadth-First SearchMatrix
1298. Maximum Candies You Can Get from BoxesHard
LeetCodeArrayBreadth-First SearchGraph Theory

← prevpage 218 / 617next →