https://github.com/crimx/leetcope

Leetcode solutions in JavaScript. Most of them are within the top 90% of JavaScript runtime distribution.
https://github.com/crimx/leetcope

javascript leetcode-solutions

Last synced: 2 months ago
JSON representation

Leetcode solutions in JavaScript. Most of them are within the top 90% of JavaScript runtime distribution.

• Host: GitHub
• URL: https://github.com/crimx/leetcope
• Owner: crimx
• Created: 2018-07-03T12:06:30.000Z (almost 7 years ago)
• Default Branch: master
• Last Pushed: 2019-05-09T11:20:33.000Z (about 6 years ago)
• Last Synced: 2025-04-15T14:56:32.925Z (2 months ago)
• Topics: javascript, leetcode-solutions
• Language: Shell
• Homepage:
• Size: 369 KB
• Stars: 128
• Watchers: 9
• Forks: 51
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# Leetcope [![Build Status](https://travis-ci.org/crimx/leetcope.svg?branch=master)](https://travis-ci.org/crimx/leetcope)

Leetcode solutions in JavaScript. Most of them are within the top 90% of JavaScript runtime distribution (2018).

Templates are generated via [Leetmark](https://github.com/crimx/crx-leetmark).

[![Creative Commons License](https://i.creativecommons.org/l/by-nc-sa/4.0/88x31.png)][license]

This work is licensed under a [Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License][license].

[license]: http://creativecommons.org/licenses/by-nc-sa/4.0/



Difficulty

Easy

- [001. Two Sum.md](./problems/001.%20Two%20Sum.md)

- [007. Reverse Integer.md](./problems/007.%20Reverse%20Integer.md)

- [009. Palindrome Number.md](./problems/009.%20Palindrome%20Number.md)

- [013. Roman to Integer.md](./problems/013.%20Roman%20to%20Integer.md)

- [014. Longest Common Prefix.md](./problems/014.%20Longest%20Common%20Prefix.md)

- [020. Valid Parentheses.md](./problems/020.%20Valid%20Parentheses.md)

- [021. Merge Two Sorted Lists.md](./problems/021.%20Merge%20Two%20Sorted%20Lists.md)

- [026. Remove Duplicates from Sorted Array.md](./problems/026.%20Remove%20Duplicates%20from%20Sorted%20Array.md)

- [027. Remove Element.md](./problems/027.%20Remove%20Element.md)

- [028. Implement strStr().md](./problems/028.%20Implement%20strStr().md)

- [035. Search Insert Position.md](./problems/035.%20Search%20Insert%20Position.md)

- [038. Count and Say.md](./problems/038.%20Count%20and%20Say.md)

- [053. Maximum Subarray.md](./problems/053.%20Maximum%20Subarray.md)

- [058. Length of Last Word.md](./problems/058.%20Length%20of%20Last%20Word.md)

- [066. Plus One.md](./problems/066.%20Plus%20One.md)

- [067. Add Binary.md](./problems/067.%20Add%20Binary.md)

- [069. Sqrt(x).md](./problems/069.%20Sqrt(x).md)

- [070. Climbing Stairs.md](./problems/070.%20Climbing%20Stairs.md)

- [083. Remove Duplicates from Sorted List.md](./problems/083.%20Remove%20Duplicates%20from%20Sorted%20List.md)

- [088. Merge Sorted Array.md](./problems/088.%20Merge%20Sorted%20Array.md)

- [100. Same Tree.md](./problems/100.%20Same%20Tree.md)

- [101. Symmetric Tree.md](./problems/101.%20Symmetric%20Tree.md)

- [104. Maximum Depth of Binary Tree.md](./problems/104.%20Maximum%20Depth%20of%20Binary%20Tree.md)

- [107. Binary Tree Level Order Traversal II.md](./problems/107.%20Binary%20Tree%20Level%20Order%20Traversal%20II.md)

- [108. Convert Sorted Array to Binary Search Tree.md](./problems/108.%20Convert%20Sorted%20Array%20to%20Binary%20Search%20Tree.md)

- [110. Balanced Binary Tree.md](./problems/110.%20Balanced%20Binary%20Tree.md)

- [111. Minimum Depth of Binary Tree.md](./problems/111.%20Minimum%20Depth%20of%20Binary%20Tree.md)

- [112. Path Sum.md](./problems/112.%20Path%20Sum.md)

- [118. Pascal's Triangle.md](./problems/118.%20Pascal's%20Triangle.md)

- [119. Pascal's Triangle II.md](./problems/119.%20Pascal's%20Triangle%20II.md)

- [121. Best Time to Buy and Sell Stock.md](./problems/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.md)

- [122. Best Time to Buy and Sell Stock II.md](./problems/122.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock%20II.md)

- [125. Valid Palindrome.md](./problems/125.%20Valid%20Palindrome.md)

Medium

- [002. Add Two Numbers.md](./problems/002.%20Add%20Two%20Numbers.md)

- [003. Longest Substring Without Repeating Characters.md](./problems/003.%20Longest%20Substring%20Without%20Repeating%20Characters.md)

- [005. Longest Palindromic Substring.md](./problems/005.%20Longest%20Palindromic%20Substring.md)

- [006. ZigZag Conversion.md](./problems/006.%20ZigZag%20Conversion.md)

- [008. String to Integer (atoi).md](./problems/008.%20String%20to%20Integer%20(atoi).md)

- [011. Container With Most Water.md](./problems/011.%20Container%20With%20Most%20Water.md)

- [012. Integer to Roman.md](./problems/012.%20Integer%20to%20Roman.md)

- [015. 3Sum.md](./problems/015.%203Sum.md)

- [016. 3Sum Closest.md](./problems/016.%203Sum%20Closest.md)

- [017. Letter Combinations of a Phone Number.md](./problems/017.%20Letter%20Combinations%20of%20a%20Phone%20Number.md)

- [018. 4Sum.md](./problems/018.%204Sum.md)

- [019. Remove Nth Node From End of List.md](./problems/019.%20Remove%20Nth%20Node%20From%20End%20of%20List.md)

- [022. Generate Parentheses.md](./problems/022.%20Generate%20Parentheses.md)

- [024. Swap Nodes in Pairs.md](./problems/024.%20Swap%20Nodes%20in%20Pairs.md)

- [029. Divide Two Integers.md](./problems/029.%20Divide%20Two%20Integers.md)

- [031. Next Permutation.md](./problems/031.%20Next%20Permutation.md)

- [033. Search in Rotated Sorted Array.md](./problems/033.%20Search%20in%20Rotated%20Sorted%20Array.md)

- [034. Find First and Last Position of Element in Sorted Array.md](./problems/034.%20Find%20First%20and%20Last%20Position%20of%20Element%20in%20Sorted%20Array.md)

- [036. Valid Sudoku.md](./problems/036.%20Valid%20Sudoku.md)

- [039. Combination Sum.md](./problems/039.%20Combination%20Sum.md)

- [040. Combination Sum II.md](./problems/040.%20Combination%20Sum%20II.md)

- [043. Multiply Strings.md](./problems/043.%20Multiply%20Strings.md)

- [046. Permutations.md](./problems/046.%20Permutations.md)

- [047. Permutations II.md](./problems/047.%20Permutations%20II.md)

- [048. Rotate Image.md](./problems/048.%20Rotate%20Image.md)

- [049. Group Anagrams.md](./problems/049.%20Group%20Anagrams.md)

- [050. Pow(x, n).md](./problems/050.%20Pow(x%2C%20n).md)

- [054. Spiral Matrix.md](./problems/054.%20Spiral%20Matrix.md)

- [055. Jump Game.md](./problems/055.%20Jump%20Game.md)

- [056. Merge Intervals.md](./problems/056.%20Merge%20Intervals.md)

- [059. Spiral Matrix II.md](./problems/059.%20Spiral%20Matrix%20II.md)

- [060. Permutation Sequence.md](./problems/060.%20Permutation%20Sequence.md)

- [061. Rotate List.md](./problems/061.%20Rotate%20List.md)

- [062. Unique Paths.md](./problems/062.%20Unique%20Paths.md)

- [063. Unique Paths II.md](./problems/063.%20Unique%20Paths%20II.md)

- [064. Minimum Path Sum.md](./problems/064.%20Minimum%20Path%20Sum.md)

- [071. Simplify Path.md](./problems/071.%20Simplify%20Path.md)

- [073. Set Matrix Zeroes.md](./problems/073.%20Set%20Matrix%20Zeroes.md)

- [074. Search a 2D Matrix.md](./problems/074.%20Search%20a%202D%20Matrix.md)

- [075. Sort Colors.md](./problems/075.%20Sort%20Colors.md)

- [077. Combinations.md](./problems/077.%20Combinations.md)

- [078. Subsets.md](./problems/078.%20Subsets.md)

- [079. Word Search.md](./problems/079.%20Word%20Search.md)

- [080. Remove Duplicates from Sorted Array II.md](./problems/080.%20Remove%20Duplicates%20from%20Sorted%20Array%20II.md)

- [081. Search in Rotated Sorted Array II.md](./problems/081.%20Search%20in%20Rotated%20Sorted%20Array%20II.md)

- [082. Remove Duplicates from Sorted List II.md](./problems/082.%20Remove%20Duplicates%20from%20Sorted%20List%20II.md)

- [086. Partition List.md](./problems/086.%20Partition%20List.md)

- [089. Gray Code.md](./problems/089.%20Gray%20Code.md)

- [090. Subsets II.md](./problems/090.%20Subsets%20II.md)

- [091. Decode Ways.md](./problems/091.%20Decode%20Ways.md)

- [092. Reverse Linked List II.md](./problems/092.%20Reverse%20Linked%20List%20II.md)

- [093. Restore IP Addresses.md](./problems/093.%20Restore%20IP%20Addresses.md)

- [094. Binary Tree Inorder Traversal.md](./problems/094.%20Binary%20Tree%20Inorder%20Traversal.md)

- [095. Unique Binary Search Trees II.md](./problems/095.%20Unique%20Binary%20Search%20Trees%20II.md)

- [096. Unique Binary Search Trees.md](./problems/096.%20Unique%20Binary%20Search%20Trees.md)

- [098. Validate Binary Search Tree.md](./problems/098.%20Validate%20Binary%20Search%20Tree.md)

- [102. Binary Tree Level Order Traversal.md](./problems/102.%20Binary%20Tree%20Level%20Order%20Traversal.md)

- [103. Binary Tree Zigzag Level Order Traversal.md](./problems/103.%20Binary%20Tree%20Zigzag%20Level%20Order%20Traversal.md)

- [105. Construct Binary Tree from Preorder and Inorder Traversal.md](./problems/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.md)

- [106. Construct Binary Tree from Inorder and Postorder Traversal.md](./problems/106.%20Construct%20Binary%20Tree%20from%20Inorder%20and%20Postorder%20Traversal.md)

- [109. Convert Sorted List to Binary Search Tree.md](./problems/109.%20Convert%20Sorted%20List%20to%20Binary%20Search%20Tree.md)

- [113. Path Sum II.md](./problems/113.%20Path%20Sum%20II.md)

- [114. Flatten Binary Tree to Linked List.md](./problems/114.%20Flatten%20Binary%20Tree%20to%20Linked%20List.md)

- [116. Populating Next Right Pointers in Each Node.md](./problems/116.%20Populating%20Next%20Right%20Pointers%20in%20Each%20Node.md)

- [117. Populating Next Right Pointers in Each Node II.md](./problems/117.%20Populating%20Next%20Right%20Pointers%20in%20Each%20Node%20II.md)

- [120. Triangle.md](./problems/120.%20Triangle.md)

- [127. Word Ladder.md](./problems/127.%20Word%20Ladder.md)

- [129. Sum Root to Leaf Numbers.md](./problems/129.%20Sum%20Root%20to%20Leaf%20Numbers.md)

- [130. Surrounded Regions.md](./problems/130.%20Surrounded%20Regions.md)

- [131. Palindrome Partitioning.md](./problems/131.%20Palindrome%20Partitioning.md)

- [133. Clone Graph.md](./problems/133.%20Clone%20Graph.md)

Hard

- [004. Median of Two Sorted Arrays.md](./problems/004.%20Median%20of%20Two%20Sorted%20Arrays.md)

- [010. Regular Expression Matching.md](./problems/010.%20Regular%20Expression%20Matching.md)

- [023. Merge k Sorted Lists.md](./problems/023.%20Merge%20k%20Sorted%20Lists.md)

- [025. Reverse Nodes in k-Group.md](./problems/025.%20Reverse%20Nodes%20in%20k-Group.md)

- [030. Substring with Concatenation of All Words.md](./problems/030.%20Substring%20with%20Concatenation%20of%20All%20Words.md)

- [032. Longest Valid Parentheses.md](./problems/032.%20Longest%20Valid%20Parentheses.md)

- [037. Sudoku Solver.md](./problems/037.%20Sudoku%20Solver.md)

- [041. First Missing Positive.md](./problems/041.%20First%20Missing%20Positive.md)

- [042. Trapping Rain Water.md](./problems/042.%20Trapping%20Rain%20Water.md)

- [044. Wildcard Matching.md](./problems/044.%20Wildcard%20Matching.md)

- [045. Jump Game II.md](./problems/045.%20Jump%20Game%20II.md)

- [051. N-Queens.md](./problems/051.%20N-Queens.md)

- [052. N-Queens II.md](./problems/052.%20N-Queens%20II.md)

- [057. Insert Interval.md](./problems/057.%20Insert%20Interval.md)

- [065. Valid Number.md](./problems/065.%20Valid%20Number.md)

- [068. Text Justification.md](./problems/068.%20Text%20Justification.md)

- [072. Edit Distance.md](./problems/072.%20Edit%20Distance.md)

- [076. Minimum Window Substring.md](./problems/076.%20Minimum%20Window%20Substring.md)

- [084. Largest Rectangle in Histogram.md](./problems/084.%20Largest%20Rectangle%20in%20Histogram.md)

- [085. Maximal Rectangle.md](./problems/085.%20Maximal%20Rectangle.md)

- [087. Scramble String.md](./problems/087.%20Scramble%20String.md)

- [097. Interleaving String.md](./problems/097.%20Interleaving%20String.md)

- [099. Recover Binary Search Tree.md](./problems/099.%20Recover%20Binary%20Search%20Tree.md)

- [115. Distinct Subsequences.md](./problems/115.%20Distinct%20Subsequences.md)

- [123. Best Time to Buy and Sell Stock III.md](./problems/123.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock%20III.md)

- [124. Binary Tree Maximum Path Sum.md](./problems/124.%20Binary%20Tree%20Maximum%20Path%20Sum.md)

- [126. Word Ladder II.md](./problems/126.%20Word%20Ladder%20II.md)

- [128. Longest Consecutive Sequence.md](./problems/128.%20Longest%20Consecutive%20Sequence.md)

- [132. Palindrome Partitioning II.md](./problems/132.%20Palindrome%20Partitioning%20II.md)



Related Topics

Array

- [001. Two Sum.md](./problems/001.%20Two%20Sum.md)

- [004. Median of Two Sorted Arrays.md](./problems/004.%20Median%20of%20Two%20Sorted%20Arrays.md)

- [011. Container With Most Water.md](./problems/011.%20Container%20With%20Most%20Water.md)

- [015. 3Sum.md](./problems/015.%203Sum.md)

- [016. 3Sum Closest.md](./problems/016.%203Sum%20Closest.md)

- [018. 4Sum.md](./problems/018.%204Sum.md)

- [026. Remove Duplicates from Sorted Array.md](./problems/026.%20Remove%20Duplicates%20from%20Sorted%20Array.md)

- [027. Remove Element.md](./problems/027.%20Remove%20Element.md)

- [031. Next Permutation.md](./problems/031.%20Next%20Permutation.md)

- [033. Search in Rotated Sorted Array.md](./problems/033.%20Search%20in%20Rotated%20Sorted%20Array.md)

- [034. Find First and Last Position of Element in Sorted Array.md](./problems/034.%20Find%20First%20and%20Last%20Position%20of%20Element%20in%20Sorted%20Array.md)

- [035. Search Insert Position.md](./problems/035.%20Search%20Insert%20Position.md)

- [039. Combination Sum.md](./problems/039.%20Combination%20Sum.md)

- [040. Combination Sum II.md](./problems/040.%20Combination%20Sum%20II.md)

- [041. First Missing Positive.md](./problems/041.%20First%20Missing%20Positive.md)

- [042. Trapping Rain Water.md](./problems/042.%20Trapping%20Rain%20Water.md)

- [045. Jump Game II.md](./problems/045.%20Jump%20Game%20II.md)

- [048. Rotate Image.md](./problems/048.%20Rotate%20Image.md)

- [053. Maximum Subarray.md](./problems/053.%20Maximum%20Subarray.md)

- [054. Spiral Matrix.md](./problems/054.%20Spiral%20Matrix.md)

- [055. Jump Game.md](./problems/055.%20Jump%20Game.md)

- [056. Merge Intervals.md](./problems/056.%20Merge%20Intervals.md)

- [057. Insert Interval.md](./problems/057.%20Insert%20Interval.md)

- [059. Spiral Matrix II.md](./problems/059.%20Spiral%20Matrix%20II.md)

- [062. Unique Paths.md](./problems/062.%20Unique%20Paths.md)

- [063. Unique Paths II.md](./problems/063.%20Unique%20Paths%20II.md)

- [064. Minimum Path Sum.md](./problems/064.%20Minimum%20Path%20Sum.md)

- [066. Plus One.md](./problems/066.%20Plus%20One.md)

- [073. Set Matrix Zeroes.md](./problems/073.%20Set%20Matrix%20Zeroes.md)

- [074. Search a 2D Matrix.md](./problems/074.%20Search%20a%202D%20Matrix.md)

- [075. Sort Colors.md](./problems/075.%20Sort%20Colors.md)

- [078. Subsets.md](./problems/078.%20Subsets.md)

- [079. Word Search.md](./problems/079.%20Word%20Search.md)

- [080. Remove Duplicates from Sorted Array II.md](./problems/080.%20Remove%20Duplicates%20from%20Sorted%20Array%20II.md)

- [081. Search in Rotated Sorted Array II.md](./problems/081.%20Search%20in%20Rotated%20Sorted%20Array%20II.md)

- [084. Largest Rectangle in Histogram.md](./problems/084.%20Largest%20Rectangle%20in%20Histogram.md)

- [085. Maximal Rectangle.md](./problems/085.%20Maximal%20Rectangle.md)

- [088. Merge Sorted Array.md](./problems/088.%20Merge%20Sorted%20Array.md)

- [090. Subsets II.md](./problems/090.%20Subsets%20II.md)

- [105. Construct Binary Tree from Preorder and Inorder Traversal.md](./problems/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.md)

- [106. Construct Binary Tree from Inorder and Postorder Traversal.md](./problems/106.%20Construct%20Binary%20Tree%20from%20Inorder%20and%20Postorder%20Traversal.md)

- [118. Pascal's Triangle.md](./problems/118.%20Pascal's%20Triangle.md)

- [119. Pascal's Triangle II.md](./problems/119.%20Pascal's%20Triangle%20II.md)

- [120. Triangle.md](./problems/120.%20Triangle.md)

- [121. Best Time to Buy and Sell Stock.md](./problems/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.md)

- [122. Best Time to Buy and Sell Stock II.md](./problems/122.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock%20II.md)

- [123. Best Time to Buy and Sell Stock III.md](./problems/123.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock%20III.md)

- [126. Word Ladder II.md](./problems/126.%20Word%20Ladder%20II.md)

- [128. Longest Consecutive Sequence.md](./problems/128.%20Longest%20Consecutive%20Sequence.md)

Backtracking

- [010. Regular Expression Matching.md](./problems/010.%20Regular%20Expression%20Matching.md)

- [017. Letter Combinations of a Phone Number.md](./problems/017.%20Letter%20Combinations%20of%20a%20Phone%20Number.md)

- [022. Generate Parentheses.md](./problems/022.%20Generate%20Parentheses.md)

- [037. Sudoku Solver.md](./problems/037.%20Sudoku%20Solver.md)

- [039. Combination Sum.md](./problems/039.%20Combination%20Sum.md)

- [040. Combination Sum II.md](./problems/040.%20Combination%20Sum%20II.md)

- [044. Wildcard Matching.md](./problems/044.%20Wildcard%20Matching.md)

- [046. Permutations.md](./problems/046.%20Permutations.md)

- [047. Permutations II.md](./problems/047.%20Permutations%20II.md)

- [051. N-Queens.md](./problems/051.%20N-Queens.md)

- [052. N-Queens II.md](./problems/052.%20N-Queens%20II.md)

- [060. Permutation Sequence.md](./problems/060.%20Permutation%20Sequence.md)

- [077. Combinations.md](./problems/077.%20Combinations.md)

- [078. Subsets.md](./problems/078.%20Subsets.md)

- [079. Word Search.md](./problems/079.%20Word%20Search.md)

- [089. Gray Code.md](./problems/089.%20Gray%20Code.md)

- [090. Subsets II.md](./problems/090.%20Subsets%20II.md)

- [093. Restore IP Addresses.md](./problems/093.%20Restore%20IP%20Addresses.md)

- [126. Word Ladder II.md](./problems/126.%20Word%20Ladder%20II.md)

- [131. Palindrome Partitioning.md](./problems/131.%20Palindrome%20Partitioning.md)

Binary Search

- [004. Median of Two Sorted Arrays.md](./problems/004.%20Median%20of%20Two%20Sorted%20Arrays.md)

- [029. Divide Two Integers.md](./problems/029.%20Divide%20Two%20Integers.md)

- [033. Search in Rotated Sorted Array.md](./problems/033.%20Search%20in%20Rotated%20Sorted%20Array.md)

- [034. Find First and Last Position of Element in Sorted Array.md](./problems/034.%20Find%20First%20and%20Last%20Position%20of%20Element%20in%20Sorted%20Array.md)

- [035. Search Insert Position.md](./problems/035.%20Search%20Insert%20Position.md)

- [050. Pow(x, n).md](./problems/050.%20Pow(x%2C%20n).md)

- [069. Sqrt(x).md](./problems/069.%20Sqrt(x).md)

- [074. Search a 2D Matrix.md](./problems/074.%20Search%20a%202D%20Matrix.md)

- [081. Search in Rotated Sorted Array II.md](./problems/081.%20Search%20in%20Rotated%20Sorted%20Array%20II.md)

Bit Manipulation

- [078. Subsets.md](./problems/078.%20Subsets.md)

Breadth-first Search

- [101. Symmetric Tree.md](./problems/101.%20Symmetric%20Tree.md)

- [102. Binary Tree Level Order Traversal.md](./problems/102.%20Binary%20Tree%20Level%20Order%20Traversal.md)

- [103. Binary Tree Zigzag Level Order Traversal.md](./problems/103.%20Binary%20Tree%20Zigzag%20Level%20Order%20Traversal.md)

- [107. Binary Tree Level Order Traversal II.md](./problems/107.%20Binary%20Tree%20Level%20Order%20Traversal%20II.md)

- [111. Minimum Depth of Binary Tree.md](./problems/111.%20Minimum%20Depth%20of%20Binary%20Tree.md)

- [126. Word Ladder II.md](./problems/126.%20Word%20Ladder%20II.md)

- [127. Word Ladder.md](./problems/127.%20Word%20Ladder.md)

- [130. Surrounded Regions.md](./problems/130.%20Surrounded%20Regions.md)

- [133. Clone Graph.md](./problems/133.%20Clone%20Graph.md)

Depth-first Search

- [098. Validate Binary Search Tree.md](./problems/098.%20Validate%20Binary%20Search%20Tree.md)

- [099. Recover Binary Search Tree.md](./problems/099.%20Recover%20Binary%20Search%20Tree.md)

- [100. Same Tree.md](./problems/100.%20Same%20Tree.md)

- [101. Symmetric Tree.md](./problems/101.%20Symmetric%20Tree.md)

- [104. Maximum Depth of Binary Tree.md](./problems/104.%20Maximum%20Depth%20of%20Binary%20Tree.md)

- [105. Construct Binary Tree from Preorder and Inorder Traversal.md](./problems/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.md)

- [106. Construct Binary Tree from Inorder and Postorder Traversal.md](./problems/106.%20Construct%20Binary%20Tree%20from%20Inorder%20and%20Postorder%20Traversal.md)

- [108. Convert Sorted Array to Binary Search Tree.md](./problems/108.%20Convert%20Sorted%20Array%20to%20Binary%20Search%20Tree.md)

- [109. Convert Sorted List to Binary Search Tree.md](./problems/109.%20Convert%20Sorted%20List%20to%20Binary%20Search%20Tree.md)

- [110. Balanced Binary Tree.md](./problems/110.%20Balanced%20Binary%20Tree.md)

- [111. Minimum Depth of Binary Tree.md](./problems/111.%20Minimum%20Depth%20of%20Binary%20Tree.md)

- [112. Path Sum.md](./problems/112.%20Path%20Sum.md)

- [113. Path Sum II.md](./problems/113.%20Path%20Sum%20II.md)

- [114. Flatten Binary Tree to Linked List.md](./problems/114.%20Flatten%20Binary%20Tree%20to%20Linked%20List.md)

- [116. Populating Next Right Pointers in Each Node.md](./problems/116.%20Populating%20Next%20Right%20Pointers%20in%20Each%20Node.md)

- [117. Populating Next Right Pointers in Each Node II.md](./problems/117.%20Populating%20Next%20Right%20Pointers%20in%20Each%20Node%20II.md)

- [124. Binary Tree Maximum Path Sum.md](./problems/124.%20Binary%20Tree%20Maximum%20Path%20Sum.md)

- [129. Sum Root to Leaf Numbers.md](./problems/129.%20Sum%20Root%20to%20Leaf%20Numbers.md)

- [130. Surrounded Regions.md](./problems/130.%20Surrounded%20Regions.md)

- [133. Clone Graph.md](./problems/133.%20Clone%20Graph.md)

Divide and Conquer

- [004. Median of Two Sorted Arrays.md](./problems/004.%20Median%20of%20Two%20Sorted%20Arrays.md)

- [023. Merge k Sorted Lists.md](./problems/023.%20Merge%20k%20Sorted%20Lists.md)

- [053. Maximum Subarray.md](./problems/053.%20Maximum%20Subarray.md)

Dynamic Programming

- [005. Longest Palindromic Substring.md](./problems/005.%20Longest%20Palindromic%20Substring.md)

- [010. Regular Expression Matching.md](./problems/010.%20Regular%20Expression%20Matching.md)

- [032. Longest Valid Parentheses.md](./problems/032.%20Longest%20Valid%20Parentheses.md)

- [044. Wildcard Matching.md](./problems/044.%20Wildcard%20Matching.md)

- [053. Maximum Subarray.md](./problems/053.%20Maximum%20Subarray.md)

- [062. Unique Paths.md](./problems/062.%20Unique%20Paths.md)

- [063. Unique Paths II.md](./problems/063.%20Unique%20Paths%20II.md)

- [064. Minimum Path Sum.md](./problems/064.%20Minimum%20Path%20Sum.md)

- [070. Climbing Stairs.md](./problems/070.%20Climbing%20Stairs.md)

- [072. Edit Distance.md](./problems/072.%20Edit%20Distance.md)

- [085. Maximal Rectangle.md](./problems/085.%20Maximal%20Rectangle.md)

- [087. Scramble String.md](./problems/087.%20Scramble%20String.md)

- [091. Decode Ways.md](./problems/091.%20Decode%20Ways.md)

- [095. Unique Binary Search Trees II.md](./problems/095.%20Unique%20Binary%20Search%20Trees%20II.md)

- [096. Unique Binary Search Trees.md](./problems/096.%20Unique%20Binary%20Search%20Trees.md)

- [097. Interleaving String.md](./problems/097.%20Interleaving%20String.md)

- [115. Distinct Subsequences.md](./problems/115.%20Distinct%20Subsequences.md)

- [120. Triangle.md](./problems/120.%20Triangle.md)

- [121. Best Time to Buy and Sell Stock.md](./problems/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.md)

- [123. Best Time to Buy and Sell Stock III.md](./problems/123.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock%20III.md)

- [132. Palindrome Partitioning II.md](./problems/132.%20Palindrome%20Partitioning%20II.md)

Graph

- [133. Clone Graph.md](./problems/133.%20Clone%20Graph.md)

Greedy

- [044. Wildcard Matching.md](./problems/044.%20Wildcard%20Matching.md)

- [045. Jump Game II.md](./problems/045.%20Jump%20Game%20II.md)

- [055. Jump Game.md](./problems/055.%20Jump%20Game.md)

- [122. Best Time to Buy and Sell Stock II.md](./problems/122.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock%20II.md)

Hash Table

- [001. Two Sum.md](./problems/001.%20Two%20Sum.md)

- [003. Longest Substring Without Repeating Characters.md](./problems/003.%20Longest%20Substring%20Without%20Repeating%20Characters.md)

- [018. 4Sum.md](./problems/018.%204Sum.md)

- [030. Substring with Concatenation of All Words.md](./problems/030.%20Substring%20with%20Concatenation%20of%20All%20Words.md)

- [036. Valid Sudoku.md](./problems/036.%20Valid%20Sudoku.md)

- [037. Sudoku Solver.md](./problems/037.%20Sudoku%20Solver.md)

- [049. Group Anagrams.md](./problems/049.%20Group%20Anagrams.md)

- [076. Minimum Window Substring.md](./problems/076.%20Minimum%20Window%20Substring.md)

- [085. Maximal Rectangle.md](./problems/085.%20Maximal%20Rectangle.md)

- [094. Binary Tree Inorder Traversal.md](./problems/094.%20Binary%20Tree%20Inorder%20Traversal.md)

Heap

- [023. Merge k Sorted Lists.md](./problems/023.%20Merge%20k%20Sorted%20Lists.md)

Linked List

- [002. Add Two Numbers.md](./problems/002.%20Add%20Two%20Numbers.md)

- [019. Remove Nth Node From End of List.md](./problems/019.%20Remove%20Nth%20Node%20From%20End%20of%20List.md)

- [021. Merge Two Sorted Lists.md](./problems/021.%20Merge%20Two%20Sorted%20Lists.md)

- [023. Merge k Sorted Lists.md](./problems/023.%20Merge%20k%20Sorted%20Lists.md)

- [024. Swap Nodes in Pairs.md](./problems/024.%20Swap%20Nodes%20in%20Pairs.md)

- [025. Reverse Nodes in k-Group.md](./problems/025.%20Reverse%20Nodes%20in%20k-Group.md)

- [061. Rotate List.md](./problems/061.%20Rotate%20List.md)

- [082. Remove Duplicates from Sorted List II.md](./problems/082.%20Remove%20Duplicates%20from%20Sorted%20List%20II.md)

- [083. Remove Duplicates from Sorted List.md](./problems/083.%20Remove%20Duplicates%20from%20Sorted%20List.md)

- [086. Partition List.md](./problems/086.%20Partition%20List.md)

- [092. Reverse Linked List II.md](./problems/092.%20Reverse%20Linked%20List%20II.md)

- [109. Convert Sorted List to Binary Search Tree.md](./problems/109.%20Convert%20Sorted%20List%20to%20Binary%20Search%20Tree.md)

Math

- [002. Add Two Numbers.md](./problems/002.%20Add%20Two%20Numbers.md)

- [007. Reverse Integer.md](./problems/007.%20Reverse%20Integer.md)

- [008. String to Integer (atoi).md](./problems/008.%20String%20to%20Integer%20(atoi).md)

- [009. Palindrome Number.md](./problems/009.%20Palindrome%20Number.md)

- [012. Integer to Roman.md](./problems/012.%20Integer%20to%20Roman.md)

- [013. Roman to Integer.md](./problems/013.%20Roman%20to%20Integer.md)

- [029. Divide Two Integers.md](./problems/029.%20Divide%20Two%20Integers.md)

- [043. Multiply Strings.md](./problems/043.%20Multiply%20Strings.md)

- [050. Pow(x, n).md](./problems/050.%20Pow(x%2C%20n).md)

- [060. Permutation Sequence.md](./problems/060.%20Permutation%20Sequence.md)

- [065. Valid Number.md](./problems/065.%20Valid%20Number.md)

- [066. Plus One.md](./problems/066.%20Plus%20One.md)

- [067. Add Binary.md](./problems/067.%20Add%20Binary.md)

- [069. Sqrt(x).md](./problems/069.%20Sqrt(x).md)

Sort

- [056. Merge Intervals.md](./problems/056.%20Merge%20Intervals.md)

- [057. Insert Interval.md](./problems/057.%20Insert%20Interval.md)

- [075. Sort Colors.md](./problems/075.%20Sort%20Colors.md)

Stack

- [020. Valid Parentheses.md](./problems/020.%20Valid%20Parentheses.md)

- [042. Trapping Rain Water.md](./problems/042.%20Trapping%20Rain%20Water.md)

- [071. Simplify Path.md](./problems/071.%20Simplify%20Path.md)

- [084. Largest Rectangle in Histogram.md](./problems/084.%20Largest%20Rectangle%20in%20Histogram.md)

- [085. Maximal Rectangle.md](./problems/085.%20Maximal%20Rectangle.md)

- [094. Binary Tree Inorder Traversal.md](./problems/094.%20Binary%20Tree%20Inorder%20Traversal.md)

- [103. Binary Tree Zigzag Level Order Traversal.md](./problems/103.%20Binary%20Tree%20Zigzag%20Level%20Order%20Traversal.md)

String

- [003. Longest Substring Without Repeating Characters.md](./problems/003.%20Longest%20Substring%20Without%20Repeating%20Characters.md)

- [005. Longest Palindromic Substring.md](./problems/005.%20Longest%20Palindromic%20Substring.md)

- [006. ZigZag Conversion.md](./problems/006.%20ZigZag%20Conversion.md)

- [008. String to Integer (atoi).md](./problems/008.%20String%20to%20Integer%20(atoi).md)

- [010. Regular Expression Matching.md](./problems/010.%20Regular%20Expression%20Matching.md)

- [012. Integer to Roman.md](./problems/012.%20Integer%20to%20Roman.md)

- [013. Roman to Integer.md](./problems/013.%20Roman%20to%20Integer.md)

- [014. Longest Common Prefix.md](./problems/014.%20Longest%20Common%20Prefix.md)

- [017. Letter Combinations of a Phone Number.md](./problems/017.%20Letter%20Combinations%20of%20a%20Phone%20Number.md)

- [020. Valid Parentheses.md](./problems/020.%20Valid%20Parentheses.md)

- [022. Generate Parentheses.md](./problems/022.%20Generate%20Parentheses.md)

- [028. Implement strStr().md](./problems/028.%20Implement%20strStr().md)

- [030. Substring with Concatenation of All Words.md](./problems/030.%20Substring%20with%20Concatenation%20of%20All%20Words.md)

- [032. Longest Valid Parentheses.md](./problems/032.%20Longest%20Valid%20Parentheses.md)

- [038. Count and Say.md](./problems/038.%20Count%20and%20Say.md)

- [043. Multiply Strings.md](./problems/043.%20Multiply%20Strings.md)

- [044. Wildcard Matching.md](./problems/044.%20Wildcard%20Matching.md)

- [049. Group Anagrams.md](./problems/049.%20Group%20Anagrams.md)

- [058. Length of Last Word.md](./problems/058.%20Length%20of%20Last%20Word.md)

- [065. Valid Number.md](./problems/065.%20Valid%20Number.md)

- [067. Add Binary.md](./problems/067.%20Add%20Binary.md)

- [068. Text Justification.md](./problems/068.%20Text%20Justification.md)

- [071. Simplify Path.md](./problems/071.%20Simplify%20Path.md)

- [072. Edit Distance.md](./problems/072.%20Edit%20Distance.md)

- [076. Minimum Window Substring.md](./problems/076.%20Minimum%20Window%20Substring.md)

- [087. Scramble String.md](./problems/087.%20Scramble%20String.md)

- [091. Decode Ways.md](./problems/091.%20Decode%20Ways.md)

- [093. Restore IP Addresses.md](./problems/093.%20Restore%20IP%20Addresses.md)

- [097. Interleaving String.md](./problems/097.%20Interleaving%20String.md)

- [115. Distinct Subsequences.md](./problems/115.%20Distinct%20Subsequences.md)

- [125. Valid Palindrome.md](./problems/125.%20Valid%20Palindrome.md)

- [126. Word Ladder II.md](./problems/126.%20Word%20Ladder%20II.md)

Tree

- [094. Binary Tree Inorder Traversal.md](./problems/094.%20Binary%20Tree%20Inorder%20Traversal.md)

- [095. Unique Binary Search Trees II.md](./problems/095.%20Unique%20Binary%20Search%20Trees%20II.md)

- [096. Unique Binary Search Trees.md](./problems/096.%20Unique%20Binary%20Search%20Trees.md)

- [098. Validate Binary Search Tree.md](./problems/098.%20Validate%20Binary%20Search%20Tree.md)

- [099. Recover Binary Search Tree.md](./problems/099.%20Recover%20Binary%20Search%20Tree.md)

- [100. Same Tree.md](./problems/100.%20Same%20Tree.md)

- [101. Symmetric Tree.md](./problems/101.%20Symmetric%20Tree.md)

- [102. Binary Tree Level Order Traversal.md](./problems/102.%20Binary%20Tree%20Level%20Order%20Traversal.md)

- [103. Binary Tree Zigzag Level Order Traversal.md](./problems/103.%20Binary%20Tree%20Zigzag%20Level%20Order%20Traversal.md)

- [104. Maximum Depth of Binary Tree.md](./problems/104.%20Maximum%20Depth%20of%20Binary%20Tree.md)

- [105. Construct Binary Tree from Preorder and Inorder Traversal.md](./problems/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.md)

- [106. Construct Binary Tree from Inorder and Postorder Traversal.md](./problems/106.%20Construct%20Binary%20Tree%20from%20Inorder%20and%20Postorder%20Traversal.md)

- [107. Binary Tree Level Order Traversal II.md](./problems/107.%20Binary%20Tree%20Level%20Order%20Traversal%20II.md)

- [108. Convert Sorted Array to Binary Search Tree.md](./problems/108.%20Convert%20Sorted%20Array%20to%20Binary%20Search%20Tree.md)

- [110. Balanced Binary Tree.md](./problems/110.%20Balanced%20Binary%20Tree.md)

- [111. Minimum Depth of Binary Tree.md](./problems/111.%20Minimum%20Depth%20of%20Binary%20Tree.md)

- [112. Path Sum.md](./problems/112.%20Path%20Sum.md)

- [113. Path Sum II.md](./problems/113.%20Path%20Sum%20II.md)

- [114. Flatten Binary Tree to Linked List.md](./problems/114.%20Flatten%20Binary%20Tree%20to%20Linked%20List.md)

- [116. Populating Next Right Pointers in Each Node.md](./problems/116.%20Populating%20Next%20Right%20Pointers%20in%20Each%20Node.md)

- [117. Populating Next Right Pointers in Each Node II.md](./problems/117.%20Populating%20Next%20Right%20Pointers%20in%20Each%20Node%20II.md)

- [124. Binary Tree Maximum Path Sum.md](./problems/124.%20Binary%20Tree%20Maximum%20Path%20Sum.md)

- [129. Sum Root to Leaf Numbers.md](./problems/129.%20Sum%20Root%20to%20Leaf%20Numbers.md)

Two Pointers

- [003. Longest Substring Without Repeating Characters.md](./problems/003.%20Longest%20Substring%20Without%20Repeating%20Characters.md)

- [011. Container With Most Water.md](./problems/011.%20Container%20With%20Most%20Water.md)

- [015. 3Sum.md](./problems/015.%203Sum.md)

- [016. 3Sum Closest.md](./problems/016.%203Sum%20Closest.md)

- [018. 4Sum.md](./problems/018.%204Sum.md)

- [019. Remove Nth Node From End of List.md](./problems/019.%20Remove%20Nth%20Node%20From%20End%20of%20List.md)

- [026. Remove Duplicates from Sorted Array.md](./problems/026.%20Remove%20Duplicates%20from%20Sorted%20Array.md)

- [027. Remove Element.md](./problems/027.%20Remove%20Element.md)

- [028. Implement strStr().md](./problems/028.%20Implement%20strStr().md)

- [030. Substring with Concatenation of All Words.md](./problems/030.%20Substring%20with%20Concatenation%20of%20All%20Words.md)

- [042. Trapping Rain Water.md](./problems/042.%20Trapping%20Rain%20Water.md)

- [061. Rotate List.md](./problems/061.%20Rotate%20List.md)

- [075. Sort Colors.md](./problems/075.%20Sort%20Colors.md)

- [076. Minimum Window Substring.md](./problems/076.%20Minimum%20Window%20Substring.md)

- [080. Remove Duplicates from Sorted Array II.md](./problems/080.%20Remove%20Duplicates%20from%20Sorted%20Array%20II.md)

- [086. Partition List.md](./problems/086.%20Partition%20List.md)

- [088. Merge Sorted Array.md](./problems/088.%20Merge%20Sorted%20Array.md)

- [125. Valid Palindrome.md](./problems/125.%20Valid%20Palindrome.md)

Union Find

- [128. Longest Consecutive Sequence.md](./problems/128.%20Longest%20Consecutive%20Sequence.md)

- [130. Surrounded Regions.md](./problems/130.%20Surrounded%20Regions.md)



Similar Questions

1-bit and 2-bit Characters

- [089. Gray Code.md](./problems/089.%20Gray%20Code.md)

3Sum

- [001. Two Sum.md](./problems/001.%20Two%20Sum.md)

- [016. 3Sum Closest.md](./problems/016.%203Sum%20Closest.md)

- [018. 4Sum.md](./problems/018.%204Sum.md)

3Sum Closest

- [015. 3Sum.md](./problems/015.%203Sum.md)

3Sum Smaller

- [015. 3Sum.md](./problems/015.%203Sum.md)

- [016. 3Sum Closest.md](./problems/016.%203Sum%20Closest.md)

4Sum

- [001. Two Sum.md](./problems/001.%20Two%20Sum.md)

- [015. 3Sum.md](./problems/015.%203Sum.md)

4Sum II

- [018. 4Sum.md](./problems/018.%204Sum.md)

Add Binary

- [002. Add Two Numbers.md](./problems/002.%20Add%20Two%20Numbers.md)

- [043. Multiply Strings.md](./problems/043.%20Multiply%20Strings.md)

- [066. Plus One.md](./problems/066.%20Plus%20One.md)

Add Bold Tag in String

- [056. Merge Intervals.md](./problems/056.%20Merge%20Intervals.md)

Add Strings

- [002. Add Two Numbers.md](./problems/002.%20Add%20Two%20Numbers.md)

- [043. Multiply Strings.md](./problems/043.%20Multiply%20Strings.md)

Add Two Numbers

- [043. Multiply Strings.md](./problems/043.%20Multiply%20Strings.md)

- [067. Add Binary.md](./problems/067.%20Add%20Binary.md)

Add Two Numbers II

- [002. Add Two Numbers.md](./problems/002.%20Add%20Two%20Numbers.md)

Average of Levels in Binary Tree

- [102. Binary Tree Level Order Traversal.md](./problems/102.%20Binary%20Tree%20Level%20Order%20Traversal.md)

- [107. Binary Tree Level Order Traversal II.md](./problems/107.%20Binary%20Tree%20Level%20Order%20Traversal%20II.md)

Balanced Binary Tree

- [104. Maximum Depth of Binary Tree.md](./problems/104.%20Maximum%20Depth%20of%20Binary%20Tree.md)

Best Time to Buy and Sell Stock

- [053. Maximum Subarray.md](./problems/053.%20Maximum%20Subarray.md)

- [122. Best Time to Buy and Sell Stock II.md](./problems/122.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock%20II.md)

- [123. Best Time to Buy and Sell Stock III.md](./problems/123.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock%20III.md)

Best Time to Buy and Sell Stock II

- [121. Best Time to Buy and Sell Stock.md](./problems/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.md)

- [123. Best Time to Buy and Sell Stock III.md](./problems/123.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock%20III.md)

Best Time to Buy and Sell Stock III

- [121. Best Time to Buy and Sell Stock.md](./problems/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.md)

- [122. Best Time to Buy and Sell Stock II.md](./problems/122.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock%20II.md)

Best Time to Buy and Sell Stock IV

- [121. Best Time to Buy and Sell Stock.md](./problems/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.md)

- [122. Best Time to Buy and Sell Stock II.md](./problems/122.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock%20II.md)

- [123. Best Time to Buy and Sell Stock III.md](./problems/123.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock%20III.md)

Best Time to Buy and Sell Stock with Cooldown

- [121. Best Time to Buy and Sell Stock.md](./problems/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.md)

- [122. Best Time to Buy and Sell Stock II.md](./problems/122.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock%20II.md)

Best Time to Buy and Sell Stock with Transaction Fee

- [122. Best Time to Buy and Sell Stock II.md](./problems/122.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock%20II.md)

Binary Search Tree Iterator

- [094. Binary Tree Inorder Traversal.md](./problems/094.%20Binary%20Tree%20Inorder%20Traversal.md)

Binary Tree Inorder Traversal

- [098. Validate Binary Search Tree.md](./problems/098.%20Validate%20Binary%20Search%20Tree.md)

Binary Tree Level Order Traversal

- [103. Binary Tree Zigzag Level Order Traversal.md](./problems/103.%20Binary%20Tree%20Zigzag%20Level%20Order%20Traversal.md)

- [107. Binary Tree Level Order Traversal II.md](./problems/107.%20Binary%20Tree%20Level%20Order%20Traversal%20II.md)

- [111. Minimum Depth of Binary Tree.md](./problems/111.%20Minimum%20Depth%20of%20Binary%20Tree.md)

Binary Tree Level Order Traversal II

- [102. Binary Tree Level Order Traversal.md](./problems/102.%20Binary%20Tree%20Level%20Order%20Traversal.md)

Binary Tree Longest Consecutive Sequence

- [128. Longest Consecutive Sequence.md](./problems/128.%20Longest%20Consecutive%20Sequence.md)

Binary Tree Maximum Path Sum

- [112. Path Sum.md](./problems/112.%20Path%20Sum.md)

- [129. Sum Root to Leaf Numbers.md](./problems/129.%20Sum%20Root%20to%20Leaf%20Numbers.md)

Binary Tree Paths

- [113. Path Sum II.md](./problems/113.%20Path%20Sum%20II.md)

Binary Tree Postorder Traversal

- [094. Binary Tree Inorder Traversal.md](./problems/094.%20Binary%20Tree%20Inorder%20Traversal.md)

Binary Tree Preorder Traversal

- [094. Binary Tree Inorder Traversal.md](./problems/094.%20Binary%20Tree%20Inorder%20Traversal.md)

Binary Tree Right Side View

- [116. Populating Next Right Pointers in Each Node.md](./problems/116.%20Populating%20Next%20Right%20Pointers%20in%20Each%20Node.md)

Binary Tree Vertical Order Traversal

- [102. Binary Tree Level Order Traversal.md](./problems/102.%20Binary%20Tree%20Level%20Order%20Traversal.md)

Binary Tree Zigzag Level Order Traversal

- [102. Binary Tree Level Order Traversal.md](./problems/102.%20Binary%20Tree%20Level%20Order%20Traversal.md)

Binary Watch

- [017. Letter Combinations of a Phone Number.md](./problems/017.%20Letter%20Combinations%20of%20a%20Phone%20Number.md)

Cherry Pickup

- [064. Minimum Path Sum.md](./problems/064.%20Minimum%20Path%20Sum.md)

Closest Binary Search Tree Value II

- [094. Binary Tree Inorder Traversal.md](./problems/094.%20Binary%20Tree%20Inorder%20Traversal.md)

Combination Sum

- [017. Letter Combinations of a Phone Number.md](./problems/017.%20Letter%20Combinations%20of%20a%20Phone%20Number.md)

- [040. Combination Sum II.md](./problems/040.%20Combination%20Sum%20II.md)

- [077. Combinations.md](./problems/077.%20Combinations.md)

Combination Sum II

- [039. Combination Sum.md](./problems/039.%20Combination%20Sum.md)

Combination Sum III

- [039. Combination Sum.md](./problems/039.%20Combination%20Sum.md)

Combination Sum IV

- [039. Combination Sum.md](./problems/039.%20Combination%20Sum.md)

Combinations

- [039. Combination Sum.md](./problems/039.%20Combination%20Sum.md)

- [046. Permutations.md](./problems/046.%20Permutations.md)

Construct Binary Tree from Inorder and Postorder Traversal

- [105. Construct Binary Tree from Preorder and Inorder Traversal.md](./problems/105.%20Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.md)

Construct Binary Tree from Preorder and Inorder Traversal

- [106. Construct Binary Tree from Inorder and Postorder Traversal.md](./problems/106.%20Construct%20Binary%20Tree%20from%20Inorder%20and%20Postorder%20Traversal.md)

Container With Most Water

- [042. Trapping Rain Water.md](./problems/042.%20Trapping%20Rain%20Water.md)

Convert Binary Search Tree to Sorted Doubly Linked List

- [094. Binary Tree Inorder Traversal.md](./problems/094.%20Binary%20Tree%20Inorder%20Traversal.md)

Convert Sorted Array to Binary Search Tree

- [109. Convert Sorted List to Binary Search Tree.md](./problems/109.%20Convert%20Sorted%20List%20to%20Binary%20Search%20Tree.md)

Convert Sorted List to Binary Search Tree

- [108. Convert Sorted Array to Binary Search Tree.md](./problems/108.%20Convert%20Sorted%20Array%20to%20Binary%20Search%20Tree.md)

Copy List with Random Pointer

- [133. Clone Graph.md](./problems/133.%20Clone%20Graph.md)

Couples Holding Hands

- [041. First Missing Positive.md](./problems/041.%20First%20Missing%20Positive.md)

Decode Ways II

- [091. Decode Ways.md](./problems/091.%20Decode%20Ways.md)

Degree of an Array

- [053. Maximum Subarray.md](./problems/053.%20Maximum%20Subarray.md)

Delete Operation for Two Strings

- [072. Edit Distance.md](./problems/072.%20Edit%20Distance.md)

Different Ways to Add Parentheses

- [095. Unique Binary Search Trees II.md](./problems/095.%20Unique%20Binary%20Search%20Trees%20II.md)

Dungeon Game

- [062. Unique Paths.md](./problems/062.%20Unique%20Paths.md)

- [064. Minimum Path Sum.md](./problems/064.%20Minimum%20Path%20Sum.md)

Employee Free Time

- [056. Merge Intervals.md](./problems/056.%20Merge%20Intervals.md)

Encode and Decode Strings

- [038. Count and Say.md](./problems/038.%20Count%20and%20Say.md)

Factor Combinations

- [039. Combination Sum.md](./problems/039.%20Combination%20Sum.md)

Find All Numbers Disappeared in an Array

- [041. First Missing Positive.md](./problems/041.%20First%20Missing%20Positive.md)

Find Minimum in Rotated Sorted Array

- [033. Search in Rotated Sorted Array.md](./problems/033.%20Search%20in%20Rotated%20Sorted%20Array.md)

Find Mode in Binary Search Tree

- [098. Validate Binary Search Tree.md](./problems/098.%20Validate%20Binary%20Search%20Tree.md)

Find the Duplicate Number

- [041. First Missing Positive.md](./problems/041.%20First%20Missing%20Positive.md)

First Bad Version

- [034. Find First and Last Position of Element in Sorted Array.md](./problems/034.%20Find%20First%20and%20Last%20Position%20of%20Element%20in%20Sorted%20Array.md)

- [035. Search Insert Position.md](./problems/035.%20Search%20Insert%20Position.md)

Flatten a Multilevel Doubly Linked List

- [114. Flatten Binary Tree to Linked List.md](./problems/114.%20Flatten%20Binary%20Tree%20to%20Linked%20List.md)

Game of Life

- [073. Set Matrix Zeroes.md](./problems/073.%20Set%20Matrix%20Zeroes.md)

Generalized Abbreviation

- [078. Subsets.md](./problems/078.%20Subsets.md)

Generate Parentheses

- [017. Letter Combinations of a Phone Number.md](./problems/017.%20Letter%20Combinations%20of%20a%20Phone%20Number.md)

- [020. Valid Parentheses.md](./problems/020.%20Valid%20Parentheses.md)

Group Shifted Strings

- [049. Group Anagrams.md](./problems/049.%20Group%20Anagrams.md)

IP to CIDR

- [093. Restore IP Addresses.md](./problems/093.%20Restore%20IP%20Addresses.md)

Inorder Successor in BST

- [094. Binary Tree Inorder Traversal.md](./problems/094.%20Binary%20Tree%20Inorder%20Traversal.md)

Insert Interval

- [056. Merge Intervals.md](./problems/056.%20Merge%20Intervals.md)

Integer to English Words

- [012. Integer to Roman.md](./problems/012.%20Integer%20to%20Roman.md)

Integer to Roman

- [013. Roman to Integer.md](./problems/013.%20Roman%20to%20Integer.md)

Jump Game

- [045. Jump Game II.md](./problems/045.%20Jump%20Game%20II.md)

Jump Game II

- [055. Jump Game.md](./problems/055.%20Jump%20Game.md)

Kth Smallest Element in a BST

- [094. Binary Tree Inorder Traversal.md](./problems/094.%20Binary%20Tree%20Inorder%20Traversal.md)

Largest Rectangle in Histogram

- [085. Maximal Rectangle.md](./problems/085.%20Maximal%20Rectangle.md)

Letter Case Permutation

- [078. Subsets.md](./problems/078.%20Subsets.md)

Letter Combinations of a Phone Number

- [022. Generate Parentheses.md](./problems/022.%20Generate%20Parentheses.md)

- [039. Combination Sum.md](./problems/039.%20Combination%20Sum.md)

Longest Palindromic Subsequence

- [005. Longest Palindromic Substring.md](./problems/005.%20Longest%20Palindromic%20Substring.md)

Longest Substring with At Most Two Distinct Characters

- [003. Longest Substring Without Repeating Characters.md](./problems/003.%20Longest%20Substring%20Without%20Repeating%20Characters.md)

Longest Univalue Path

- [124. Binary Tree Maximum Path Sum.md](./problems/124.%20Binary%20Tree%20Maximum%20Path%20Sum.md)

Longest Valid Parentheses

- [020. Valid Parentheses.md](./problems/020.%20Valid%20Parentheses.md)

Maximal Rectangle

- [084. Largest Rectangle in Histogram.md](./problems/084.%20Largest%20Rectangle%20in%20Histogram.md)

Maximal Square

- [085. Maximal Rectangle.md](./problems/085.%20Maximal%20Rectangle.md)

Maximum Depth of Binary Tree

- [110. Balanced Binary Tree.md](./problems/110.%20Balanced%20Binary%20Tree.md)

- [111. Minimum Depth of Binary Tree.md](./problems/111.%20Minimum%20Depth%20of%20Binary%20Tree.md)

Maximum Depth of N-ary Tree

- [104. Maximum Depth of Binary Tree.md](./problems/104.%20Maximum%20Depth%20of%20Binary%20Tree.md)

Maximum Product Subarray

- [053. Maximum Subarray.md](./problems/053.%20Maximum%20Subarray.md)

Maximum Subarray

- [121. Best Time to Buy and Sell Stock.md](./problems/121.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock.md)

Maximum Sum of 3 Non-Overlapping Subarrays

- [123. Best Time to Buy and Sell Stock III.md](./problems/123.%20Best%20Time%20to%20Buy%20and%20Sell%20Stock%20III.md)

Meeting Rooms

- [056. Merge Intervals.md](./problems/056.%20Merge%20Intervals.md)

Meeting Rooms II

- [056. Merge Intervals.md](./problems/056.%20Merge%20Intervals.md)

Merge Intervals

- [057. Insert Interval.md](./problems/057.%20Insert%20Interval.md)

Merge Sorted Array

- [021. Merge Two Sorted Lists.md](./problems/021.%20Merge%20Two%20Sorted%20Lists.md)

Merge Two Sorted Lists

- [023. Merge k Sorted Lists.md](./problems/023.%20Merge%20k%20Sorted%20Lists.md)

- [088. Merge Sorted Array.md](./problems/088.%20Merge%20Sorted%20Array.md)

Merge k Sorted Lists

- [021. Merge Two Sorted Lists.md](./problems/021.%20Merge%20Two%20Sorted%20Lists.md)

Min Cost Climbing Stairs

- [070. Climbing Stairs.md](./problems/070.%20Climbing%20Stairs.md)

Minimum ASCII Delete Sum for Two Strings

- [072. Edit Distance.md](./problems/072.%20Edit%20Distance.md)

Minimum Depth of Binary Tree

- [102. Binary Tree Level Order Traversal.md](./problems/102.%20Binary%20Tree%20Level%20Order%20Traversal.md)

- [104. Maximum Depth of Binary Tree.md](./problems/104.%20Maximum%20Depth%20of%20Binary%20Tree.md)

Minimum Distance Between BST Nodes

- [094. Binary Tree Inorder Traversal.md](./problems/094.%20Binary%20Tree%20Inorder%20Traversal.md)

Minimum Genetic Mutation

- [127. Word Ladder.md](./problems/127.%20Word%20Ladder.md)

Minimum Path Sum

- [062. Unique Paths.md](./problems/062.%20Unique%20Paths.md)

Minimum Size Subarray Sum

- [076. Minimum Window Substring.md](./problems/076.%20Minimum%20Window%20Substring.md)

Minimum Window Subsequence

- [076. Minimum Window Substring.md](./problems/076.%20Minimum%20Window%20Substring.md)

Minimum Window Substring

- [030. Substring with Concatenation of All Words.md](./problems/030.%20Substring%20with%20Concatenation%20of%20All%20Words.md)

Missing Number

- [041. First Missing Positive.md](./problems/041.%20First%20Missing%20Positive.md)

Move Zeroes

- [027. Remove Element.md](./problems/027.%20Remove%20Element.md)

Multiply Strings

- [002. Add Two Numbers.md](./problems/002.%20Add%20Two%20Numbers.md)

- [066. Plus One.md](./problems/066.%20Plus%20One.md)

- [067. Add Binary.md](./problems/067.%20Add%20Binary.md)

N-Queens

- [052. N-Queens II.md](./problems/052.%20N-Queens%20II.md)

N-Queens II

- [051. N-Queens.md](./problems/051.%20N-Queens.md)

N-ary Tree Level Order Traversal

- [102. Binary Tree Level Order Traversal.md](./problems/102.%20Binary%20Tree%20Level%20Order%20Traversal.md)

Next Permutation

- [046. Permutations.md](./problems/046.%20Permutations.md)

- [047. Permutations II.md](./problems/047.%20Permutations%20II.md)

- [060. Permutation Sequence.md](./problems/060.%20Permutation%20Sequence.md)

Number of Islands

- [130. Surrounded Regions.md](./problems/130.%20Surrounded%20Regions.md)

One Edit Distance

- [072. Edit Distance.md](./problems/072.%20Edit%20Distance.md)

Palindrome Linked List

- [009. Palindrome Number.md](./problems/009.%20Palindrome%20Number.md)

- [125. Valid Palindrome.md](./problems/125.%20Valid%20Palindrome.md)

Palindrome Pairs

- [005. Longest Palindromic Substring.md](./problems/005.%20Longest%20Palindromic%20Substring.md)

Palindrome Partitioning

- [132. Palindrome Partitioning II.md](./problems/132.%20Palindrome%20Partitioning%20II.md)

Palindrome Partitioning II

- [131. Palindrome Partitioning.md](./problems/131.%20Palindrome%20Partitioning.md)

Palindrome Permutation

- [005. Longest Palindromic Substring.md](./problems/005.%20Longest%20Palindromic%20Substring.md)

Palindrome Permutation II

- [031. Next Permutation.md](./problems/031.%20Next%20Permutation.md)

- [047. Permutations II.md](./problems/047.%20Permutations%20II.md)

Palindromic Substrings

- [005. Longest Palindromic Substring.md](./problems/005.%20Longest%20Palindromic%20Substring.md)

Partition Labels

- [056. Merge Intervals.md](./problems/056.%20Merge%20Intervals.md)

Pascal's Triangle

- [119. Pascal's Triangle II.md](./problems/119.%20Pascal's%20Triangle%20II.md)

Pascal's Triangle II

- [118. Pascal's Triangle.md](./problems/118.%20Pascal's%20Triangle.md)

Path Sum

- [113. Path Sum II.md](./problems/113.%20Path%20Sum%20II.md)

- [124. Binary Tree Maximum Path Sum.md](./problems/124.%20Binary%20Tree%20Maximum%20Path%20Sum.md)

- [129. Sum Root to Leaf Numbers.md](./problems/129.%20Sum%20Root%20to%20Leaf%20Numbers.md)

Path Sum II

- [112. Path Sum.md](./problems/112.%20Path%20Sum.md)

Path Sum III

- [112. Path Sum.md](./problems/112.%20Path%20Sum.md)

- [113. Path Sum II.md](./problems/113.%20Path%20Sum%20II.md)

Path Sum IV

- [112. Path Sum.md](./problems/112.%20Path%20Sum.md)

- [113. Path Sum II.md](./problems/113.%20Path%20Sum%20II.md)

- [124. Binary Tree Maximum Path Sum.md](./problems/124.%20Binary%20Tree%20Maximum%20Path%20Sum.md)

Permutation Sequence

- [031. Next Permutation.md](./problems/031.%20Next%20Permutation.md)

- [046. Permutations.md](./problems/046.%20Permutations.md)

Permutation in String

- [076. Minimum Window Substring.md](./problems/076.%20Minimum%20Window%20Substring.md)

Permutations

- [031. Next Permutation.md](./problems/031.%20Next%20Permutation.md)

- [047. Permutations II.md](./problems/047.%20Permutations%20II.md)

- [060. Permutation Sequence.md](./problems/060.%20Permutation%20Sequence.md)

- [077. Combinations.md](./problems/077.%20Combinations.md)

Permutations II

- [031. Next Permutation.md](./problems/031.%20Next%20Permutation.md)

- [046. Permutations.md](./problems/046.%20Permutations.md)

Plus One

- [043. Multiply Strings.md](./problems/043.%20Multiply%20Strings.md)

- [067. Add Binary.md](./problems/067.%20Add%20Binary.md)

Plus One Linked List

- [066. Plus One.md](./problems/066.%20Plus%20One.md)

Populating Next Right Pointers in Each Node

- [117. Populating Next Right Pointers in Each Node II.md](./problems/117.%20Populating%20Next%20Right%20Pointers%20in%20Each%20Node%20II.md)

Populating Next Right Pointers in Each Node II

- [116. Populating Next Right Pointers in Each Node.md](./problems/116.%20Populating%20Next%20Right%20Pointers%20in%20Each%20Node.md)

Pour Water

- [042. Trapping Rain Water.md](./problems/042.%20Trapping%20Rain%20Water.md)

Pow(x, n)

- [069. Sqrt(x).md](./problems/069.%20Sqrt(x).md)

Product of Array Except Self

- [042. Trapping Rain Water.md](./problems/042.%20Trapping%20Rain%20Water.md)

Range Module

- [056. Merge Intervals.md](./problems/056.%20Merge%20Intervals.md)

- [057. Insert Interval.md](./problems/057.%20Insert%20Interval.md)

Regular Expression Matching

- [044. Wildcard Matching.md](./problems/044.%20Wildcard%20Matching.md)

Remove Duplicates from Sorted Array

- [027. Remove Element.md](./problems/027.%20Remove%20Element.md)

- [080. Remove Duplicates from Sorted Array II.md](./problems/080.%20Remove%20Duplicates%20from%20Sorted%20Array%20II.md)

Remove Duplicates from Sorted Array II

- [026. Remove Duplicates from Sorted Array.md](./problems/026.%20Remove%20Duplicates%20from%20Sorted%20Array.md)

Remove Duplicates from Sorted List

- [082. Remove Duplicates from Sorted List II.md](./problems/082.%20Remove%20Duplicates%20from%20Sorted%20List%20II.md)

Remove Duplicates from Sorted List II

- [083. Remove Duplicates from Sorted List.md](./problems/083.%20Remove%20Duplicates%20from%20Sorted%20List.md)

Remove Element

- [026. Remove Duplicates from Sorted Array.md](./problems/026.%20Remove%20Duplicates%20from%20Sorted%20Array.md)

Remove Invalid Parentheses

- [020. Valid Parentheses.md](./problems/020.%20Valid%20Parentheses.md)

Remove Linked List Elements

- [027. Remove Element.md](./problems/027.%20Remove%20Element.md)

Repeated Substring Pattern

- [028. Implement strStr().md](./problems/028.%20Implement%20strStr().md)

Reverse Integer

- [008. String to Integer (atoi).md](./problems/008.%20String%20to%20Integer%20(atoi).md)

Reverse Linked List

- [092. Reverse Linked List II.md](./problems/092.%20Reverse%20Linked%20List%20II.md)

Reverse Nodes in k-Group

- [024. Swap Nodes in Pairs.md](./problems/024.%20Swap%20Nodes%20in%20Pairs.md)

Roman to Integer

- [012. Integer to Roman.md](./problems/012.%20Integer%20to%20Roman.md)

Rotate Array

- [061. Rotate List.md](./problems/061.%20Rotate%20List.md)

Search a 2D Matrix II

- [074. Search a 2D Matrix.md](./problems/074.%20Search%20a%202D%20Matrix.md)

Search in Rotated Sorted Array

- [081. Search in Rotated Sorted Array II.md](./problems/081.%20Search%20in%20Rotated%20Sorted%20Array%20II.md)

Search in Rotated Sorted Array II

- [033. Search in Rotated Sorted Array.md](./problems/033.%20Search%20in%20Rotated%20Sorted%20Array.md)

Shortest Palindrome

- [005. Longest Palindromic Substring.md](./problems/005.%20Longest%20Palindromic%20Substring.md)

- [028. Implement strStr().md](./problems/028.%20Implement%20strStr().md)

Shortest Word Distance II

- [021. Merge Two Sorted Lists.md](./problems/021.%20Merge%20Two%20Sorted%20Lists.md)

Sliding Window Maximum

- [076. Minimum Window Substring.md](./problems/076.%20Minimum%20Window%20Substring.md)

Smallest Range

- [076. Minimum Window Substring.md](./problems/076.%20Minimum%20Window%20Substring.md)

Sort List

- [021. Merge Two Sorted Lists.md](./problems/021.%20Merge%20Two%20Sorted%20Lists.md)

- [075. Sort Colors.md](./problems/075.%20Sort%20Colors.md)

Spiral Matrix

- [059. Spiral Matrix II.md](./problems/059.%20Spiral%20Matrix%20II.md)

Spiral Matrix II

- [054. Spiral Matrix.md](./problems/054.%20Spiral%20Matrix.md)

Split Linked List in Parts

- [061. Rotate List.md](./problems/061.%20Rotate%20List.md)

Sqrt(x)

- [050. Pow(x, n).md](./problems/050.%20Pow(x%2C%20n).md)

String Compression

- [038. Count and Say.md](./problems/038.%20Count%20and%20Say.md)

String to Integer (atoi)

- [007. Reverse Integer.md](./problems/007.%20Reverse%20Integer.md)

- [065. Valid Number.md](./problems/065.%20Valid%20Number.md)

Subarray Sum Equals K

- [001. Two Sum.md](./problems/001.%20Two%20Sum.md)

Subsets

- [090. Subsets II.md](./problems/090.%20Subsets%20II.md)

Subsets II

- [078. Subsets.md](./problems/078.%20Subsets.md)

Substring with Concatenation of All Words

- [076. Minimum Window Substring.md](./problems/076.%20Minimum%20Window%20Substring.md)

Sudoku Solver

- [036. Valid Sudoku.md](./problems/036.%20Valid%20Sudoku.md)

Sum Root to Leaf Numbers

- [112. Path Sum.md](./problems/112.%20Path%20Sum.md)

- [124. Binary Tree Maximum Path Sum.md](./problems/124.%20Binary%20Tree%20Maximum%20Path%20Sum.md)

Sum of Two Integers

- [002. Add Two Numbers.md](./problems/002.%20Add%20Two%20Numbers.md)

Super Pow

- [050. Pow(x, n).md](./problems/050.%20Pow(x%2C%20n).md)

Swap Nodes in Pairs

- [025. Reverse Nodes in k-Group.md](./problems/025.%20Reverse%20Nodes%20in%20k-Group.md)

Teemo Attacking

- [056. Merge Intervals.md](./problems/056.%20Merge%20Intervals.md)

Trapping Rain Water

- [011. Container With Most Water.md](./problems/011.%20Container%20With%20Most%20Water.md)

Trapping Rain Water II

- [042. Trapping Rain Water.md](./problems/042.%20Trapping%20Rain%20Water.md)

Two Sum

- [015. 3Sum.md](./problems/015.%203Sum.md)

- [018. 4Sum.md](./problems/018.%204Sum.md)

Two Sum II - Input array is sorted

- [001. Two Sum.md](./problems/001.%20Two%20Sum.md)

Two Sum III - Data structure design

- [001. Two Sum.md](./problems/001.%20Two%20Sum.md)

Two Sum IV - Input is a BST

- [001. Two Sum.md](./problems/001.%20Two%20Sum.md)

Ugly Number II

- [023. Merge k Sorted Lists.md](./problems/023.%20Merge%20k%20Sorted%20Lists.md)

Unique Binary Search Trees

- [095. Unique Binary Search Trees II.md](./problems/095.%20Unique%20Binary%20Search%20Trees%20II.md)

Unique Binary Search Trees II

- [096. Unique Binary Search Trees.md](./problems/096.%20Unique%20Binary%20Search%20Trees.md)

Unique Paths

- [063. Unique Paths II.md](./problems/063.%20Unique%20Paths%20II.md)

- [064. Minimum Path Sum.md](./problems/064.%20Minimum%20Path%20Sum.md)

Unique Paths II

- [062. Unique Paths.md](./problems/062.%20Unique%20Paths.md)

Valid Anagram

- [049. Group Anagrams.md](./problems/049.%20Group%20Anagrams.md)

Valid Number

- [008. String to Integer (atoi).md](./problems/008.%20String%20to%20Integer%20(atoi).md)

Valid Palindrome II

- [125. Valid Palindrome.md](./problems/125.%20Valid%20Palindrome.md)

Valid Parentheses

- [022. Generate Parentheses.md](./problems/022.%20Generate%20Parentheses.md)

- [032. Longest Valid Parentheses.md](./problems/032.%20Longest%20Valid%20Parentheses.md)

Valid Perfect Square

- [069. Sqrt(x).md](./problems/069.%20Sqrt(x).md)

Valid Sudoku

- [037. Sudoku Solver.md](./problems/037.%20Sudoku%20Solver.md)

Validate Binary Search Tree

- [094. Binary Tree Inorder Traversal.md](./problems/094.%20Binary%20Tree%20Inorder%20Traversal.md)

Walls and Gates

- [130. Surrounded Regions.md](./problems/130.%20Surrounded%20Regions.md)

Wiggle Sort

- [075. Sort Colors.md](./problems/075.%20Sort%20Colors.md)

Wiggle Sort II

- [075. Sort Colors.md](./problems/075.%20Sort%20Colors.md)

Wildcard Matching

- [010. Regular Expression Matching.md](./problems/010.%20Regular%20Expression%20Matching.md)

Word Ladder

- [126. Word Ladder II.md](./problems/126.%20Word%20Ladder%20II.md)

Word Ladder II

- [127. Word Ladder.md](./problems/127.%20Word%20Ladder.md)

Word Search II

- [079. Word Search.md](./problems/079.%20Word%20Search.md)