crimx/leetcope

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

Leetcope

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

Templates are generated via Leetmark.

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

---

Difficulty

Easy

• 001. Two Sum.md
• 007. Reverse Integer.md
• 009. Palindrome Number.md
• 013. Roman to Integer.md
• 014. Longest Common Prefix.md
• 020. Valid Parentheses.md
• 021. Merge Two Sorted Lists.md
• 026. Remove Duplicates from Sorted Array.md
• 027. Remove Element.md
• 028. Implement strStr().md
• 035. Search Insert Position.md
• 038. Count and Say.md
• 053. Maximum Subarray.md
• 058. Length of Last Word.md
• 066. Plus One.md
• 067. Add Binary.md
• 069. Sqrt(x).md
• 070. Climbing Stairs.md
• 083. Remove Duplicates from Sorted List.md
• 088. Merge Sorted Array.md
• 100. Same Tree.md
• 101. Symmetric Tree.md
• 104. Maximum Depth of Binary Tree.md
• 107. Binary Tree Level Order Traversal II.md
• 108. Convert Sorted Array to Binary Search Tree.md
• 110. Balanced Binary Tree.md
• 111. Minimum Depth of Binary Tree.md
• 112. Path Sum.md
• 118. Pascal's Triangle.md
• 119. Pascal's Triangle II.md
• 121. Best Time to Buy and Sell Stock.md
• 122. Best Time to Buy and Sell Stock II.md
• 125. Valid Palindrome.md

Medium

• 002. Add Two Numbers.md
• 003. Longest Substring Without Repeating Characters.md
• 005. Longest Palindromic Substring.md
• 006. ZigZag Conversion.md
• 008. String to Integer (atoi).md
• 011. Container With Most Water.md
• 012. Integer to Roman.md
• 015. 3Sum.md
• 016. 3Sum Closest.md
• 017. Letter Combinations of a Phone Number.md
• 018. 4Sum.md
• 019. Remove Nth Node From End of List.md
• 022. Generate Parentheses.md
• 024. Swap Nodes in Pairs.md
• 029. Divide Two Integers.md
• 031. Next Permutation.md
• 033. Search in Rotated Sorted Array.md
• 034. Find First and Last Position of Element in Sorted Array.md
• 036. Valid Sudoku.md
• 039. Combination Sum.md
• 040. Combination Sum II.md
• 043. Multiply Strings.md
• 046. Permutations.md
• 047. Permutations II.md
• 048. Rotate Image.md
• 049. Group Anagrams.md
• 050. Pow(x, n).md
• 054. Spiral Matrix.md
• 055. Jump Game.md
• 056. Merge Intervals.md
• 059. Spiral Matrix II.md
• 060. Permutation Sequence.md
• 061. Rotate List.md
• 062. Unique Paths.md
• 063. Unique Paths II.md
• 064. Minimum Path Sum.md
• 071. Simplify Path.md
• 073. Set Matrix Zeroes.md
• 074. Search a 2D Matrix.md
• 075. Sort Colors.md
• 077. Combinations.md
• 078. Subsets.md
• 079. Word Search.md
• 080. Remove Duplicates from Sorted Array II.md
• 081. Search in Rotated Sorted Array II.md
• 082. Remove Duplicates from Sorted List II.md
• 086. Partition List.md
• 089. Gray Code.md
• 090. Subsets II.md
• 091. Decode Ways.md
• 092. Reverse Linked List II.md
• 093. Restore IP Addresses.md
• 094. Binary Tree Inorder Traversal.md
• 095. Unique Binary Search Trees II.md
• 096. Unique Binary Search Trees.md
• 098. Validate Binary Search Tree.md
• 102. Binary Tree Level Order Traversal.md
• 103. Binary Tree Zigzag Level Order Traversal.md
• 105. Construct Binary Tree from Preorder and Inorder Traversal.md
• 106. Construct Binary Tree from Inorder and Postorder Traversal.md
• 109. Convert Sorted List to Binary Search Tree.md
• 113. Path Sum II.md
• 114. Flatten Binary Tree to Linked List.md
• 116. Populating Next Right Pointers in Each Node.md
• 117. Populating Next Right Pointers in Each Node II.md
• 120. Triangle.md
• 127. Word Ladder.md
• 129. Sum Root to Leaf Numbers.md
• 130. Surrounded Regions.md
• 131. Palindrome Partitioning.md
• 133. Clone Graph.md

Hard

• 004. Median of Two Sorted Arrays.md
• 010. Regular Expression Matching.md
• 023. Merge k Sorted Lists.md
• 025. Reverse Nodes in k-Group.md
• 030. Substring with Concatenation of All Words.md
• 032. Longest Valid Parentheses.md
• 037. Sudoku Solver.md
• 041. First Missing Positive.md
• 042. Trapping Rain Water.md
• 044. Wildcard Matching.md
• 045. Jump Game II.md
• 051. N-Queens.md
• 052. N-Queens II.md
• 057. Insert Interval.md
• 065. Valid Number.md
• 068. Text Justification.md
• 072. Edit Distance.md
• 076. Minimum Window Substring.md
• 084. Largest Rectangle in Histogram.md
• 085. Maximal Rectangle.md
• 087. Scramble String.md
• 097. Interleaving String.md
• 099. Recover Binary Search Tree.md
• 115. Distinct Subsequences.md
• 123. Best Time to Buy and Sell Stock III.md
• 124. Binary Tree Maximum Path Sum.md
• 126. Word Ladder II.md
• 128. Longest Consecutive Sequence.md
• 132. Palindrome Partitioning II.md

---

Related Topics

Array

• 001. Two Sum.md
• 004. Median of Two Sorted Arrays.md
• 011. Container With Most Water.md
• 015. 3Sum.md
• 016. 3Sum Closest.md
• 018. 4Sum.md
• 026. Remove Duplicates from Sorted Array.md
• 027. Remove Element.md
• 031. Next Permutation.md
• 033. Search in Rotated Sorted Array.md
• 034. Find First and Last Position of Element in Sorted Array.md
• 035. Search Insert Position.md
• 039. Combination Sum.md
• 040. Combination Sum II.md
• 041. First Missing Positive.md
• 042. Trapping Rain Water.md
• 045. Jump Game II.md
• 048. Rotate Image.md
• 053. Maximum Subarray.md
• 054. Spiral Matrix.md
• 055. Jump Game.md
• 056. Merge Intervals.md
• 057. Insert Interval.md
• 059. Spiral Matrix II.md
• 062. Unique Paths.md
• 063. Unique Paths II.md
• 064. Minimum Path Sum.md
• 066. Plus One.md
• 073. Set Matrix Zeroes.md
• 074. Search a 2D Matrix.md
• 075. Sort Colors.md
• 078. Subsets.md
• 079. Word Search.md
• 080. Remove Duplicates from Sorted Array II.md
• 081. Search in Rotated Sorted Array II.md
• 084. Largest Rectangle in Histogram.md
• 085. Maximal Rectangle.md
• 088. Merge Sorted Array.md
• 090. Subsets II.md
• 105. Construct Binary Tree from Preorder and Inorder Traversal.md
• 106. Construct Binary Tree from Inorder and Postorder Traversal.md
• 118. Pascal's Triangle.md
• 119. Pascal's Triangle II.md
• 120. Triangle.md
• 121. Best Time to Buy and Sell Stock.md
• 122. Best Time to Buy and Sell Stock II.md
• 123. Best Time to Buy and Sell Stock III.md
• 126. Word Ladder II.md
• 128. Longest Consecutive Sequence.md

Backtracking

• 010. Regular Expression Matching.md
• 017. Letter Combinations of a Phone Number.md
• 022. Generate Parentheses.md
• 037. Sudoku Solver.md
• 039. Combination Sum.md
• 040. Combination Sum II.md
• 044. Wildcard Matching.md
• 046. Permutations.md
• 047. Permutations II.md
• 051. N-Queens.md
• 052. N-Queens II.md
• 060. Permutation Sequence.md
• 077. Combinations.md
• 078. Subsets.md
• 079. Word Search.md
• 089. Gray Code.md
• 090. Subsets II.md
• 093. Restore IP Addresses.md
• 126. Word Ladder II.md
• 131. Palindrome Partitioning.md

Binary Search

• 004. Median of Two Sorted Arrays.md
• 029. Divide Two Integers.md
• 033. Search in Rotated Sorted Array.md
• 034. Find First and Last Position of Element in Sorted Array.md
• 035. Search Insert Position.md
• 050. Pow(x, n).md
• 069. Sqrt(x).md
• 074. Search a 2D Matrix.md
• 081. Search in Rotated Sorted Array II.md

Bit Manipulation

• 078. Subsets.md

Breadth-first Search

• 101. Symmetric Tree.md
• 102. Binary Tree Level Order Traversal.md
• 103. Binary Tree Zigzag Level Order Traversal.md
• 107. Binary Tree Level Order Traversal II.md
• 111. Minimum Depth of Binary Tree.md
• 126. Word Ladder II.md
• 127. Word Ladder.md
• 130. Surrounded Regions.md
• 133. Clone Graph.md

Depth-first Search

• 098. Validate Binary Search Tree.md
• 099. Recover Binary Search Tree.md
• 100. Same Tree.md
• 101. Symmetric Tree.md
• 104. Maximum Depth of Binary Tree.md
• 105. Construct Binary Tree from Preorder and Inorder Traversal.md
• 106. Construct Binary Tree from Inorder and Postorder Traversal.md
• 108. Convert Sorted Array to Binary Search Tree.md
• 109. Convert Sorted List to Binary Search Tree.md
• 110. Balanced Binary Tree.md
• 111. Minimum Depth of Binary Tree.md
• 112. Path Sum.md
• 113. Path Sum II.md
• 114. Flatten Binary Tree to Linked List.md
• 116. Populating Next Right Pointers in Each Node.md
• 117. Populating Next Right Pointers in Each Node II.md
• 124. Binary Tree Maximum Path Sum.md
• 129. Sum Root to Leaf Numbers.md
• 130. Surrounded Regions.md
• 133. Clone Graph.md

Divide and Conquer

• 004. Median of Two Sorted Arrays.md
• 023. Merge k Sorted Lists.md
• 053. Maximum Subarray.md

Dynamic Programming

• 005. Longest Palindromic Substring.md
• 010. Regular Expression Matching.md
• 032. Longest Valid Parentheses.md
• 044. Wildcard Matching.md
• 053. Maximum Subarray.md
• 062. Unique Paths.md
• 063. Unique Paths II.md
• 064. Minimum Path Sum.md
• 070. Climbing Stairs.md
• 072. Edit Distance.md
• 085. Maximal Rectangle.md
• 087. Scramble String.md
• 091. Decode Ways.md
• 095. Unique Binary Search Trees II.md
• 096. Unique Binary Search Trees.md
• 097. Interleaving String.md
• 115. Distinct Subsequences.md
• 120. Triangle.md
• 121. Best Time to Buy and Sell Stock.md
• 123. Best Time to Buy and Sell Stock III.md
• 132. Palindrome Partitioning II.md

Graph

• 133. Clone Graph.md

Greedy

• 044. Wildcard Matching.md
• 045. Jump Game II.md
• 055. Jump Game.md
• 122. Best Time to Buy and Sell Stock II.md

Hash Table

• 001. Two Sum.md
• 003. Longest Substring Without Repeating Characters.md
• 018. 4Sum.md
• 030. Substring with Concatenation of All Words.md
• 036. Valid Sudoku.md
• 037. Sudoku Solver.md
• 049. Group Anagrams.md
• 076. Minimum Window Substring.md
• 085. Maximal Rectangle.md
• 094. Binary Tree Inorder Traversal.md

Heap

• 023. Merge k Sorted Lists.md

Linked List

• 002. Add Two Numbers.md
• 019. Remove Nth Node From End of List.md
• 021. Merge Two Sorted Lists.md
• 023. Merge k Sorted Lists.md
• 024. Swap Nodes in Pairs.md
• 025. Reverse Nodes in k-Group.md
• 061. Rotate List.md
• 082. Remove Duplicates from Sorted List II.md
• 083. Remove Duplicates from Sorted List.md
• 086. Partition List.md
• 092. Reverse Linked List II.md
• 109. Convert Sorted List to Binary Search Tree.md

Math

• 002. Add Two Numbers.md
• 007. Reverse Integer.md
• 008. String to Integer (atoi).md
• 009. Palindrome Number.md
• 012. Integer to Roman.md
• 013. Roman to Integer.md
• 029. Divide Two Integers.md
• 043. Multiply Strings.md
• 050. Pow(x, n).md
• 060. Permutation Sequence.md
• 065. Valid Number.md
• 066. Plus One.md
• 067. Add Binary.md
• 069. Sqrt(x).md

Sort

• 056. Merge Intervals.md
• 057. Insert Interval.md
• 075. Sort Colors.md

Stack

• 020. Valid Parentheses.md
• 042. Trapping Rain Water.md
• 071. Simplify Path.md
• 084. Largest Rectangle in Histogram.md
• 085. Maximal Rectangle.md
• 094. Binary Tree Inorder Traversal.md
• 103. Binary Tree Zigzag Level Order Traversal.md

String

• 003. Longest Substring Without Repeating Characters.md
• 005. Longest Palindromic Substring.md
• 006. ZigZag Conversion.md
• 008. String to Integer (atoi).md
• 010. Regular Expression Matching.md
• 012. Integer to Roman.md
• 013. Roman to Integer.md
• 014. Longest Common Prefix.md
• 017. Letter Combinations of a Phone Number.md
• 020. Valid Parentheses.md
• 022. Generate Parentheses.md
• 028. Implement strStr().md
• 030. Substring with Concatenation of All Words.md
• 032. Longest Valid Parentheses.md
• 038. Count and Say.md
• 043. Multiply Strings.md
• 044. Wildcard Matching.md
• 049. Group Anagrams.md
• 058. Length of Last Word.md
• 065. Valid Number.md
• 067. Add Binary.md
• 068. Text Justification.md
• 071. Simplify Path.md
• 072. Edit Distance.md
• 076. Minimum Window Substring.md
• 087. Scramble String.md
• 091. Decode Ways.md
• 093. Restore IP Addresses.md
• 097. Interleaving String.md
• 115. Distinct Subsequences.md
• 125. Valid Palindrome.md
• 126. Word Ladder II.md

Tree

• 094. Binary Tree Inorder Traversal.md
• 095. Unique Binary Search Trees II.md
• 096. Unique Binary Search Trees.md
• 098. Validate Binary Search Tree.md
• 099. Recover Binary Search Tree.md
• 100. Same Tree.md
• 101. Symmetric Tree.md
• 102. Binary Tree Level Order Traversal.md
• 103. Binary Tree Zigzag Level Order Traversal.md
• 104. Maximum Depth of Binary Tree.md
• 105. Construct Binary Tree from Preorder and Inorder Traversal.md
• 106. Construct Binary Tree from Inorder and Postorder Traversal.md
• 107. Binary Tree Level Order Traversal II.md
• 108. Convert Sorted Array to Binary Search Tree.md
• 110. Balanced Binary Tree.md
• 111. Minimum Depth of Binary Tree.md
• 112. Path Sum.md
• 113. Path Sum II.md
• 114. Flatten Binary Tree to Linked List.md
• 116. Populating Next Right Pointers in Each Node.md
• 117. Populating Next Right Pointers in Each Node II.md
• 124. Binary Tree Maximum Path Sum.md
• 129. Sum Root to Leaf Numbers.md

Two Pointers

• 003. Longest Substring Without Repeating Characters.md
• 011. Container With Most Water.md
• 015. 3Sum.md
• 016. 3Sum Closest.md
• 018. 4Sum.md
• 019. Remove Nth Node From End of List.md
• 026. Remove Duplicates from Sorted Array.md
• 027. Remove Element.md
• 028. Implement strStr().md
• 030. Substring with Concatenation of All Words.md
• 042. Trapping Rain Water.md
• 061. Rotate List.md
• 075. Sort Colors.md
• 076. Minimum Window Substring.md
• 080. Remove Duplicates from Sorted Array II.md
• 086. Partition List.md
• 088. Merge Sorted Array.md
• 125. Valid Palindrome.md

Union Find

• 128. Longest Consecutive Sequence.md
• 130. Surrounded Regions.md

---

Similar Questions

1-bit and 2-bit Characters

• 089. Gray Code.md

3Sum

• 001. Two Sum.md
• 016. 3Sum Closest.md
• 018. 4Sum.md

3Sum Closest

• 015. 3Sum.md

3Sum Smaller

• 015. 3Sum.md
• 016. 3Sum Closest.md

4Sum

• 001. Two Sum.md
• 015. 3Sum.md

4Sum II

• 018. 4Sum.md

Add Binary

• 002. Add Two Numbers.md
• 043. Multiply Strings.md
• 066. Plus One.md

Add Bold Tag in String

• 056. Merge Intervals.md

Add Strings

• 002. Add Two Numbers.md
• 043. Multiply Strings.md

Add Two Numbers

• 043. Multiply Strings.md
• 067. Add Binary.md

Add Two Numbers II

• 002. Add Two Numbers.md

Average of Levels in Binary Tree

• 102. Binary Tree Level Order Traversal.md
• 107. Binary Tree Level Order Traversal II.md

Balanced Binary Tree

• 104. Maximum Depth of Binary Tree.md

Best Time to Buy and Sell Stock

• 053. Maximum Subarray.md
• 122. Best Time to Buy and Sell Stock II.md
• 123. Best Time to Buy and Sell Stock III.md

Best Time to Buy and Sell Stock II

• 121. Best Time to Buy and Sell Stock.md
• 123. Best Time to Buy and Sell Stock III.md

Best Time to Buy and Sell Stock III

• 121. Best Time to Buy and Sell Stock.md
• 122. Best Time to Buy and Sell Stock II.md

Best Time to Buy and Sell Stock IV

• 121. Best Time to Buy and Sell Stock.md
• 122. Best Time to Buy and Sell Stock II.md
• 123. Best Time to Buy and Sell Stock III.md

Best Time to Buy and Sell Stock with Cooldown

• 121. Best Time to Buy and Sell Stock.md
• 122. Best Time to Buy and Sell Stock II.md

Best Time to Buy and Sell Stock with Transaction Fee

• 122. Best Time to Buy and Sell Stock II.md

Binary Search Tree Iterator

• 094. Binary Tree Inorder Traversal.md

Binary Tree Inorder Traversal

• 098. Validate Binary Search Tree.md

Binary Tree Level Order Traversal

• 103. Binary Tree Zigzag Level Order Traversal.md
• 107. Binary Tree Level Order Traversal II.md
• 111. Minimum Depth of Binary Tree.md

Binary Tree Level Order Traversal II

• 102. Binary Tree Level Order Traversal.md

Binary Tree Longest Consecutive Sequence

• 128. Longest Consecutive Sequence.md

Binary Tree Maximum Path Sum

• 112. Path Sum.md
• 129. Sum Root to Leaf Numbers.md

Binary Tree Paths

• 113. Path Sum II.md

Binary Tree Postorder Traversal

• 094. Binary Tree Inorder Traversal.md

Binary Tree Preorder Traversal

• 094. Binary Tree Inorder Traversal.md

Binary Tree Right Side View

• 116. Populating Next Right Pointers in Each Node.md

Binary Tree Vertical Order Traversal

• 102. Binary Tree Level Order Traversal.md

Binary Tree Zigzag Level Order Traversal

• 102. Binary Tree Level Order Traversal.md

Binary Watch

• 017. Letter Combinations of a Phone Number.md

Cherry Pickup

• 064. Minimum Path Sum.md

Closest Binary Search Tree Value II

• 094. Binary Tree Inorder Traversal.md

Combination Sum

• 017. Letter Combinations of a Phone Number.md
• 040. Combination Sum II.md
• 077. Combinations.md

Combination Sum II

• 039. Combination Sum.md

Combination Sum III

• 039. Combination Sum.md

Combination Sum IV

• 039. Combination Sum.md

Combinations

• 039. Combination Sum.md
• 046. Permutations.md

Construct Binary Tree from Inorder and Postorder Traversal

• 105. Construct Binary Tree from Preorder and Inorder Traversal.md

Construct Binary Tree from Preorder and Inorder Traversal

• 106. Construct Binary Tree from Inorder and Postorder Traversal.md

Container With Most Water

• 042. Trapping Rain Water.md

Convert Binary Search Tree to Sorted Doubly Linked List

• 094. Binary Tree Inorder Traversal.md

Convert Sorted Array to Binary Search Tree

• 109. Convert Sorted List to Binary Search Tree.md

Convert Sorted List to Binary Search Tree

• 108. Convert Sorted Array to Binary Search Tree.md

Copy List with Random Pointer

• 133. Clone Graph.md

Couples Holding Hands

• 041. First Missing Positive.md

Decode Ways II

• 091. Decode Ways.md

Degree of an Array

• 053. Maximum Subarray.md

Delete Operation for Two Strings

• 072. Edit Distance.md

Different Ways to Add Parentheses

• 095. Unique Binary Search Trees II.md

Dungeon Game

• 062. Unique Paths.md
• 064. Minimum Path Sum.md

Employee Free Time

• 056. Merge Intervals.md

Encode and Decode Strings

• 038. Count and Say.md

Factor Combinations

• 039. Combination Sum.md

Find All Numbers Disappeared in an Array

• 041. First Missing Positive.md

Find Minimum in Rotated Sorted Array

• 033. Search in Rotated Sorted Array.md

Find Mode in Binary Search Tree

• 098. Validate Binary Search Tree.md

Find the Duplicate Number

• 041. First Missing Positive.md

First Bad Version

• 034. Find First and Last Position of Element in Sorted Array.md
• 035. Search Insert Position.md

Flatten a Multilevel Doubly Linked List

• 114. Flatten Binary Tree to Linked List.md

Game of Life

• 073. Set Matrix Zeroes.md

Generalized Abbreviation

• 078. Subsets.md

Generate Parentheses

• 017. Letter Combinations of a Phone Number.md
• 020. Valid Parentheses.md

Group Shifted Strings

• 049. Group Anagrams.md

IP to CIDR

• 093. Restore IP Addresses.md

Inorder Successor in BST

• 094. Binary Tree Inorder Traversal.md

Insert Interval

• 056. Merge Intervals.md

Integer to English Words

• 012. Integer to Roman.md

Integer to Roman

• 013. Roman to Integer.md

Jump Game

• 045. Jump Game II.md

Jump Game II

• 055. Jump Game.md

Kth Smallest Element in a BST

• 094. Binary Tree Inorder Traversal.md

Largest Rectangle in Histogram

• 085. Maximal Rectangle.md

Letter Case Permutation

• 078. Subsets.md

Letter Combinations of a Phone Number

• 022. Generate Parentheses.md
• 039. Combination Sum.md

Longest Palindromic Subsequence

• 005. Longest Palindromic Substring.md

Longest Substring with At Most Two Distinct Characters

• 003. Longest Substring Without Repeating Characters.md

Longest Univalue Path

• 124. Binary Tree Maximum Path Sum.md

Longest Valid Parentheses

• 020. Valid Parentheses.md

Maximal Rectangle

• 084. Largest Rectangle in Histogram.md

Maximal Square

• 085. Maximal Rectangle.md

Maximum Depth of Binary Tree

• 110. Balanced Binary Tree.md
• 111. Minimum Depth of Binary Tree.md

Maximum Depth of N-ary Tree

• 104. Maximum Depth of Binary Tree.md

Maximum Product Subarray

• 053. Maximum Subarray.md

Maximum Subarray

• 121. Best Time to Buy and Sell Stock.md

Maximum Sum of 3 Non-Overlapping Subarrays

• 123. Best Time to Buy and Sell Stock III.md

Meeting Rooms

• 056. Merge Intervals.md

Meeting Rooms II

• 056. Merge Intervals.md

Merge Intervals

• 057. Insert Interval.md

Merge Sorted Array

• 021. Merge Two Sorted Lists.md

Merge Two Sorted Lists

• 023. Merge k Sorted Lists.md
• 088. Merge Sorted Array.md

Merge k Sorted Lists

• 021. Merge Two Sorted Lists.md

Min Cost Climbing Stairs

• 070. Climbing Stairs.md

Minimum ASCII Delete Sum for Two Strings

• 072. Edit Distance.md

Minimum Depth of Binary Tree

• 102. Binary Tree Level Order Traversal.md
• 104. Maximum Depth of Binary Tree.md

Minimum Distance Between BST Nodes

• 094. Binary Tree Inorder Traversal.md

Minimum Genetic Mutation

• 127. Word Ladder.md

Minimum Path Sum

• 062. Unique Paths.md

Minimum Size Subarray Sum

• 076. Minimum Window Substring.md

Minimum Window Subsequence

• 076. Minimum Window Substring.md

Minimum Window Substring

• 030. Substring with Concatenation of All Words.md

Missing Number

• 041. First Missing Positive.md

Move Zeroes

• 027. Remove Element.md

Multiply Strings

• 002. Add Two Numbers.md
• 066. Plus One.md
• 067. Add Binary.md

N-Queens

• 052. N-Queens II.md

N-Queens II

• 051. N-Queens.md

N-ary Tree Level Order Traversal

• 102. Binary Tree Level Order Traversal.md

Next Permutation

• 046. Permutations.md
• 047. Permutations II.md
• 060. Permutation Sequence.md

Number of Islands

• 130. Surrounded Regions.md

One Edit Distance

• 072. Edit Distance.md

Palindrome Linked List

• 009. Palindrome Number.md
• 125. Valid Palindrome.md

Palindrome Pairs

• 005. Longest Palindromic Substring.md

Palindrome Partitioning

• 132. Palindrome Partitioning II.md

Palindrome Partitioning II

• 131. Palindrome Partitioning.md

Palindrome Permutation

• 005. Longest Palindromic Substring.md

Palindrome Permutation II

• 031. Next Permutation.md
• 047. Permutations II.md

Palindromic Substrings

• 005. Longest Palindromic Substring.md

Partition Labels

• 056. Merge Intervals.md

Pascal's Triangle

• 119. Pascal's Triangle II.md

Pascal's Triangle II

• 118. Pascal's Triangle.md

Path Sum

• 113. Path Sum II.md
• 124. Binary Tree Maximum Path Sum.md
• 129. Sum Root to Leaf Numbers.md

Path Sum II

• 112. Path Sum.md

Path Sum III

• 112. Path Sum.md
• 113. Path Sum II.md

Path Sum IV

• 112. Path Sum.md
• 113. Path Sum II.md
• 124. Binary Tree Maximum Path Sum.md

Permutation Sequence

• 031. Next Permutation.md
• 046. Permutations.md

Permutation in String

• 076. Minimum Window Substring.md

Permutations

• 031. Next Permutation.md
• 047. Permutations II.md
• 060. Permutation Sequence.md
• 077. Combinations.md

Permutations II

• 031. Next Permutation.md
• 046. Permutations.md

Plus One

• 043. Multiply Strings.md
• 067. Add Binary.md

Plus One Linked List

• 066. Plus One.md

Populating Next Right Pointers in Each Node

• 117. Populating Next Right Pointers in Each Node II.md

Populating Next Right Pointers in Each Node II

• 116. Populating Next Right Pointers in Each Node.md

Pour Water

• 042. Trapping Rain Water.md

Pow(x, n)

• 069. Sqrt(x).md

Product of Array Except Self

• 042. Trapping Rain Water.md

Range Module

• 056. Merge Intervals.md
• 057. Insert Interval.md

Regular Expression Matching

• 044. Wildcard Matching.md

Remove Duplicates from Sorted Array

• 027. Remove Element.md
• 080. Remove Duplicates from Sorted Array II.md

Remove Duplicates from Sorted Array II

• 026. Remove Duplicates from Sorted Array.md

Remove Duplicates from Sorted List

• 082. Remove Duplicates from Sorted List II.md

Remove Duplicates from Sorted List II

• 083. Remove Duplicates from Sorted List.md

Remove Element

• 026. Remove Duplicates from Sorted Array.md

Remove Invalid Parentheses

• 020. Valid Parentheses.md

Remove Linked List Elements

• 027. Remove Element.md

Repeated Substring Pattern

• 028. Implement strStr().md

Reverse Integer

• 008. String to Integer (atoi).md

Reverse Linked List

• 092. Reverse Linked List II.md

Reverse Nodes in k-Group

• 024. Swap Nodes in Pairs.md

Roman to Integer

• 012. Integer to Roman.md

Rotate Array

• 061. Rotate List.md

Search a 2D Matrix II

• 074. Search a 2D Matrix.md

Search in Rotated Sorted Array

• 081. Search in Rotated Sorted Array II.md

Search in Rotated Sorted Array II

• 033. Search in Rotated Sorted Array.md

Shortest Palindrome

• 005. Longest Palindromic Substring.md
• 028. Implement strStr().md

Shortest Word Distance II

• 021. Merge Two Sorted Lists.md

Sliding Window Maximum

• 076. Minimum Window Substring.md

Smallest Range

• 076. Minimum Window Substring.md

Sort List

• 021. Merge Two Sorted Lists.md
• 075. Sort Colors.md

Spiral Matrix

• 059. Spiral Matrix II.md

Spiral Matrix II

• 054. Spiral Matrix.md

Split Linked List in Parts

• 061. Rotate List.md

Sqrt(x)

• 050. Pow(x, n).md

String Compression

• 038. Count and Say.md

String to Integer (atoi)

• 007. Reverse Integer.md
• 065. Valid Number.md

Subarray Sum Equals K

• 001. Two Sum.md

Subsets

• 090. Subsets II.md

Subsets II

• 078. Subsets.md

Substring with Concatenation of All Words

• 076. Minimum Window Substring.md

Sudoku Solver

• 036. Valid Sudoku.md

Sum Root to Leaf Numbers

• 112. Path Sum.md
• 124. Binary Tree Maximum Path Sum.md

Sum of Two Integers

• 002. Add Two Numbers.md

Super Pow

• 050. Pow(x, n).md

Swap Nodes in Pairs

• 025. Reverse Nodes in k-Group.md

Teemo Attacking

• 056. Merge Intervals.md

Trapping Rain Water

• 011. Container With Most Water.md

Trapping Rain Water II

• 042. Trapping Rain Water.md

Two Sum

• 015. 3Sum.md
• 018. 4Sum.md

Two Sum II - Input array is sorted

• 001. Two Sum.md

Two Sum III - Data structure design

• 001. Two Sum.md

Two Sum IV - Input is a BST

• 001. Two Sum.md

Ugly Number II

• 023. Merge k Sorted Lists.md

Unique Binary Search Trees

• 095. Unique Binary Search Trees II.md

Unique Binary Search Trees II

• 096. Unique Binary Search Trees.md

Unique Paths

• 063. Unique Paths II.md
• 064. Minimum Path Sum.md

Unique Paths II

• 062. Unique Paths.md

Valid Anagram

• 049. Group Anagrams.md

Valid Number

• 008. String to Integer (atoi).md

Valid Palindrome II

• 125. Valid Palindrome.md

Valid Parentheses

• 022. Generate Parentheses.md
• 032. Longest Valid Parentheses.md

Valid Perfect Square

• 069. Sqrt(x).md

Valid Sudoku

• 037. Sudoku Solver.md

Validate Binary Search Tree

• 094. Binary Tree Inorder Traversal.md

Walls and Gates

• 130. Surrounded Regions.md

Wiggle Sort

• 075. Sort Colors.md

Wiggle Sort II

• 075. Sort Colors.md

Wildcard Matching

• 010. Regular Expression Matching.md

Word Ladder

• 126. Word Ladder II.md

Word Ladder II

• 127. Word Ladder.md

Word Search II

• 079. Word Search.md

---