CodeSearch

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

37,000 problems · all sources

2045. Second Minimum Time to Reach DestinationHard
LeetCodeBreadth-First SearchGraph TheoryShortest Path
2050. Parallel Courses IIIHard
LeetCodeArrayDynamic ProgrammingGraph TheoryTopological Sort
2056. Number of Valid Move Combinations On ChessboardHard
LeetCodeArrayStringBacktrackingSimulation
2060. Check if an Original String Exists Given Two Encoded StringsHard
LeetCodeStringDynamic Programming
2065. Maximum Path Quality of a GraphHard
LeetCodeArrayBacktrackingGraph Theory
2071. Maximum Number of Tasks You Can AssignHard
LeetCodeArrayTwo PointersBinary SearchGreedy
2076. Process Restricted Friend RequestsHard
LeetCodeUnion-FindGraph Theory
2081. Sum of k-Mirror NumbersHard
LeetCodeMathEnumeration
2088. Count Fertile Pyramids in a LandHard
LeetCodeArrayDynamic ProgrammingMatrix
2092. Find All People With SecretHard
LeetCodeDepth-First SearchBreadth-First SearchUnion-FindGraph Theory
2097. Valid Arrangement of PairsHard
LeetCodeArrayDepth-First SearchGraph TheoryEulerian Circuit
2102. Sequentially Ordinal Rank TrackerHard
LeetCodeDesignHeap (Priority Queue)Data StreamOrdered Set
2106. Maximum Fruits Harvested After at Most K StepsHard
LeetCodeArrayBinary SearchSliding WindowPrefix Sum
2111. Minimum Operations to Make the Array K-IncreasingHard
LeetCodeArrayBinary Search
2117. Abbreviating the Product of a RangeHard
LeetCodeMathNumber Theory
2118. Build the EquationHard
LeetCodeDatabase
212. Word Search IIHard
LeetCodeArrayStringBacktrackingTrie
2122. Recover the Original ArrayHard
LeetCodeArrayHash TableTwo PointersSorting
2123. Minimum Operations to Remove Adjacent Ones in MatrixHard
LeetCodeArrayDepth-First SearchGraph TheoryMatrix
2127. Maximum Employees to Be Invited to a MeetingHard
LeetCodeArrayDynamic ProgrammingDepth-First SearchGraph Theory
2132. Stamping the GridHard
LeetCodeArrayGreedyMatrixPrefix Sum
2136. Earliest Possible Day of Full BloomHard
LeetCodeArrayGreedySorting
214. Shortest PalindromeHard
LeetCodeStringRolling HashString MatchingHash Function
2141. Maximum Running Time of N ComputersHard
LeetCodeArrayBinary SearchGreedySorting
2143. Choose Numbers From Two Arrays in RangeHard
LeetCodeArrayDynamic Programming
2147. Number of Ways to Divide a Long CorridorHard
LeetCodeMathStringDynamic Programming
2151. Maximum Good People Based on StatementsHard
LeetCodeArrayBacktrackingBit ManipulationEnumeration
2153. The Number of Passengers in Each Bus IIHard
LeetCodeDatabase
2156. Find Substring With Given Hash ValueHard
LeetCodeStringSliding WindowRolling HashHash Function
2157. Groups of StringsHard
LeetCodeArrayHash TableStringBit Manipulation
2158. Amount of New Area Painted Each DayHard
LeetCodeArraySegment TreeOrdered Set
2163. Minimum Difference in Sums After Removal of ElementsHard
LeetCodeArrayDynamic ProgrammingHeap (Priority Queue)
2167. Minimum Time to Remove All Cars Containing Illegal GoodsHard
LeetCodeStringDynamic Programming
2172. Maximum AND Sum of ArrayHard
LeetCodeArrayDynamic ProgrammingBit ManipulationBitmask
2173. Longest Winning StreakHard
LeetCodeDatabase
2179. Count Good Triplets in an ArrayHard
LeetCodeArrayBinary SearchDivide and ConquerBinary Indexed Tree
218. The Skyline ProblemHard
LeetCodeArrayDivide and ConquerBinary Indexed TreeSegment Tree
2183. Count Array Pairs Divisible by KHard
LeetCodeArrayHash TableMathCounting
2188. Minimum Time to Finish the RaceHard
LeetCodeArrayDynamic Programming
2193. Minimum Number of Moves to Make PalindromeHard
LeetCodeTwo PointersStringGreedyBinary Indexed Tree
2197. Replace Non-Coprime Numbers in ArrayHard
LeetCodeArrayMathStackNumber Theory
2199. Finding the Topic of Each PostHard
LeetCodeDatabase
220. Contains Duplicate IIIHard
LeetCodeArraySliding WindowSortingBucket Sort
2203. Minimum Weighted Subgraph With the Required PathsHard
LeetCodeGraph TheoryHeap (Priority Queue)Shortest Path
2204. Distance to a Cycle in Undirected GraphHard
LeetCodeDepth-First SearchBreadth-First SearchGraph TheoryTopological Sort
2209. Minimum White Tiles After Covering With CarpetsHard
LeetCodeStringDynamic ProgrammingPrefix Sum
2213. Longest Substring of One Repeating CharacterHard
LeetCodeArrayStringSegment TreeOrdered Set
2218. Maximum Value of K Coins From PilesHard
LeetCodeArrayDynamic ProgrammingPrefix Sum
2223. Sum of Scores of Built StringsHard
LeetCodeStringBinary SearchRolling HashSuffix Array
2227. Encrypt and Decrypt StringsHard
LeetCodeArrayHash TableStringDesign
2234. Maximum Total Beauty of the GardensHard
LeetCodeArrayTwo PointersBinary SearchGreedy
224. Basic CalculatorHard
LeetCodeMathStringStackRecursion
2242. Maximum Score of a Node SequenceHard
LeetCodeArrayGraph TheorySortingEnumeration
2246. Longest Path With Different Adjacent CharactersHard
LeetCodeArrayStringTreeDepth-First Search
2247. Maximum Cost of Trip With K HighwaysHard
LeetCodeDynamic ProgrammingBit ManipulationGraph TheoryBitmask
2251. Number of Flowers in Full BloomHard
LeetCodeArrayHash TableBinary SearchSorting
2252. Dynamic Pivoting of a TableHard
LeetCodeDatabase
2253. Dynamic Unpivoting of a TableHard
LeetCodeDatabase
2254. Design Video Sharing PlatformHard
LeetCodeHash TableDesignHeap (Priority Queue)
2258. Escape the Spreading FireHard
LeetCodeArrayBinary SearchBreadth-First SearchMatrix

← prevpage 222 / 617next →