Skip to content

Problems

Showing 141 solved problems.

Choose a problem below to open the full walkthrough, complexity breakdown, and six-language solutions.

Want a structured view? Open the grouped problem explorer to browse by concept, bundle, and rating tier.

#1Two SumEasyArrayHash TableTwo Pointers#2Add Two NumbersMediumLinked ListMathRecursion#3Longest Substring Without Repeating CharactersMediumStringSliding WindowHash Map#4Median of Two Sorted ArraysHardArrayBinarySearchDivideAndConquer#5Longest Palindromic SubstringMediumStringDynamic Programming#9Palindrome NumberEasyMathTwo Pointers#11Container With Most WaterMediumArrayTwo PointersGreedy#153SumMediumArrayTwo PointersSorting#17Letter Combinations of a Phone NumberMediumStringBacktrackingHash Table#19Remove Nth Node From End of ListMediumLinked ListTwo Pointers#20Valid ParenthesesEasyStringStack#21Merge Two Sorted ListsEasyLinked ListRecursion#22Generate ParenthesesMediumStringBacktrackingDynamic Programming#23Merge k Sorted ListsHardLinked ListDivide and ConquerHeap#25Reverse Nodes in k-GroupHardLinked ListRecursion#26Remove Duplicates from Sorted ArrayEasyArrayTwo Pointers#27Remove ElementEasyArrayTwo Pointers#30Substring with Concatenation of All WordsHardStringHash MapSliding Window#33Search in Rotated Sorted ArrayMediumArrayBinary Search#34Find First and Last Position of Element in Sorted ArrayMediumArrayBinary Search#35Search Insert PositionEasyArrayBinary Search#36Valid SudokuMediumArrayHash TableMatrix#39Combination SumMediumArrayBacktracking#41First Missing PositiveHardArrayHash Table#42Trapping Rain WaterHardArrayTwoPointersDynamicProgramming#45Jump Game IIMediumArrayGreedyDynamic Programming#46PermutationsMediumArrayBacktracking#49Group AnagramsMediumArrayHash TableString#50Pow(x, n)MediumMathRecursion#52N-Queens IIHardBacktrackingArray#53Maximum SubarrayMediumArrayHeapDynamic Programming#54Spiral MatrixMediumArrayMatrixSimulation#55Jump GameMediumArrayGreedyDynamic Programming#56Merge IntervalsMediumArraySorting#57Insert IntervalMediumArrayIntervals#61Rotate ListMediumLinked ListTwo Pointers#63Unique Paths IIMediumArrayDynamic ProgrammingMatrix#64Minimum Path SumMediumArrayDynamic ProgrammingMatrix#66Plus OneEasyArrayMath#67Add BinaryEasyBit ManipulationStringMath#69Sqrt(x)MediumMathBinarySearch#70Climbing StairsEasyMathDynamic ProgrammingMemoization#71Simplify PathMediumStringStack#72Edit DistanceHardStringDynamic Programming#74Search a 2D MatrixMediumArrayBinarySearchMatrix#76Minimum Window SubstringHardStringSliding WindowHash Map#77CombinationsMediumBacktrackingRecursion#79Word SearchMediumArrayBacktrackingMatrix#80Remove Duplicates from Sorted Array IIMediumArrayTwo Pointers#82Remove Duplicates from Sorted List IIMediumLinked ListTwo Pointers#86Partition ListMediumLinked ListTwo Pointers#92Reverse Linked List IIMediumLinked ListRecursion#97Interleaving StringMediumStringDynamic Programming#98Validate Binary Search TreeMediumTreeDepth-First SearchIn-Order Traversal#100Same TreeEasyTreeDepth-First SearchBreadth-First Search#101Symmetric TreeEasyTreeDepth-First SearchBreadth-First Search#102Binary Tree Level Order TraversalMediumTreeBreadth-First SearchQueue#103Binary Tree Zigzag Level Order TraversalMediumTreeBreadth-First SearchDeque#104Maximum Depth of Binary TreeEasyTreeDepth-First SearchBreadth-First Search#105Construct Binary Tree from Preorder and Inorder TraversalMediumArrayTreeHash Table#106Construct Binary Tree from Inorder and Postorder TraversalMediumArrayTreeHash Table#108Convert Sorted Array to Binary Search TreeEasyTreeDivide and ConquerBinary Search Tree#112Path SumEasyTreeDepth-First SearchBreadth-First Search#114Flatten Binary Tree to Linked ListMediumTreeDepth-First SearchStack#117Populating Next Right Pointers in Each Node IIMediumTreeDepth-First SearchBreadth-First Search#120TriangleMediumArrayDynamic Programming#121Best Time to Buy and Sell StockEasyArrayDynamic Programming#122Best Time to Buy and Sell Stock IIMediumArrayGreedyDynamic Programming#123Best Time to Buy and Sell Stock IIIHardArrayDynamic Programming#124Binary Tree Maximum Path SumHardTreeDepth-First SearchDynamic Programming#125Valid PalindromeEasyTwo PointersString#127Word LadderMediumGraphBFS#128Longest Consecutive SequenceMediumArrayHash TableUnion Find#129Sum Root to Leaf NumbersMediumTreeDepth-First SearchBreadth-First Search#130Surrounded RegionsMediumGraphDFSUnion-Find#133Clone GraphMediumGraphDFSBFS#136Single NumberEasyArrayBitManipulation#137Single Number IIMediumArrayBitManipulation#138Copy List with Random PointerMediumLinked ListHash Table#139Word BreakMediumStringDynamic ProgrammingHash Table#141Linked List CycleEasyLinked ListTwo PointersHash Table#146LRU CacheMediumHash TableLinked ListDesign#148Sort ListMediumLinked ListDivide and ConquerMerge Sort#149Max Points on a LineHardGeometryHashTableMath#150Evaluate Reverse Polish NotationMediumArrayMathStack#153Find Minimum in Rotated Sorted ArrayMediumArrayBinarySearch#155Min StackMediumStackDesign#162Find Peak ElementMediumArrayBinary Search#167Two Sum II – Input Array Is SortedMediumArrayTwo PointersBinary Search#169Majority ElementEasyArrayHash TableCounting#172Factorial Trailing ZeroesMediumMathNumberTheory#173Binary Search Tree IteratorMediumStackTreeDesign#188Best Time to Buy and Sell Stock IVHardArrayDynamic Programming#189Rotate ArrayMediumArrayMathTwo Pointers#190Reverse BitsEasyBitManipulationDivideAndConquer#191Number of 1 BitsEasyBitManipulationDivideAndConquer#198House RobberMediumArrayDynamic Programming#199Binary Tree Right Side ViewMediumTreeBreadth-First SearchDepth-First Search#200Number of IslandsMediumGraphDFSBFS#201Bitwise AND of Numbers RangeMediumBitManipulationBinarySearch#202Happy NumberEasyHash TableMathCycle Detection#205Isomorphic StringsEasyHash TableString#207Course ScheduleMediumGraphDFSBFS#208Implement Trie (Prefix Tree)MediumTrieHash TableDesign#209Minimum Size Subarray SumMediumArrayBinary SearchSliding Window#210Course Schedule IIMediumGraphDFSBFS#211Design Add and Search Words Data StructureMediumTrieDesignString#212Word Search IIHardTrieDepth-First SearchBacktracking#215Kth Largest Element in ArrayMediumArrayHeapDynamic Programming#217Contains DuplicateEasyArrayHash TableSorting#219Contains Duplicate IIEasyArrayHash TableSliding Window#221Maximal SquareMediumArrayDynamic ProgrammingMatrix#222Count Complete Tree NodesMediumBinary SearchTreeDepth-First Search#224Basic CalculatorHardMathStringStack#226Invert Binary TreeEasyTreeDepth-First SearchBreadth-First Search#228Summary RangesEasyArrayTwo PointersString#230Kth Smallest Element in a BSTMediumBinary Search TreeDFSTree#235Lowest Common Ancestor of a Binary Search TreeEasyBinary Search TreeDFSTree#236Lowest Common Ancestor of a Binary TreeMediumTreeDepth-First SearchHash Set#238Product of Array Except SelfMediumArrayPrefix Sum#242Valid AnagramEasyHash TableStringSorting#268Missing NumberEasyArrayHash TableMath#290Word PatternEasyHash TableString#295Find Median from Data StreamHardArrayHeapDynamic Programming#300Longest Increasing SubsequenceMediumArrayDynamic ProgrammingBinary Search#322Coin ChangeMediumArrayDynamic ProgrammingBreadth-First Search#347Top K Frequent ElementsMediumArrayHashTableHeap#349Intersection of Two ArraysEasyArrayHash TableTwo Pointers#373Find K Pairs with Smallest SumsMediumArrayHeapDynamic Programming#383Ransom NoteEasyHash TableStringCounting#399Evaluate DivisionMediumGraphDFSBFS#427Construct Quad TreeMediumTreeDivide and ConquerMatrix#433Minimum Genetic MutationMediumGraphDFSBFS#452Minimum Number of Arrows to Burst BalloonsMediumArrayGreedySorting#502IPOHardArrayHeapDynamic Programming#525Contiguous ArrayMediumArrayHash TablePrefix Sum#530Minimum Absolute Difference in BSTEasyBinary Search TreeDFSBFS#560Subarray Sum Equals KMediumArrayHash TablePrefix Sum#637Average of Levels in Binary TreeEasyTreeBreadth-First SearchDepth-First Search#909Snakes and LaddersMediumGraphDFSBFS#918Maximum Sum Circular SubarrayMediumArrayHeapDynamic Programming