# LeetCode

**Repository Path**: Kair/LeetCode

## Basic Information

- **Project Name**: LeetCode
- **Description**: 更新中
- **Primary Language**: C++
- **License**: Not specified
- **Default Branch**: master
- **Homepage**: None
- **GVP Project**: No

## Statistics

- **Stars**: 0
- **Forks**: 0
- **Created**: 2014-09-04
- **Last Updated**: 2020-12-19

## Categories & Tags

**Categories**: Uncategorized

**Tags**: None

## README


LeetCodeSolution
=================
有些题目没有，要么是进度还没到，要么就是付费题目没钱买，要么就是还没思路，[我的进度](https://leetcode.com/kair/)。

|id|标题|难度|语言|
|:--:|:--:|:--:|:--:|
|230|[Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst)|Medium|[C++](./Algorithms/Medium/Kth Smallest Element in a BST.md)|
|229|[Majority Element II](https://leetcode.com/problems/majority-element-ii)|Medium|[C++](./Algorithms/Medium/Majority Element II.md)|
|228|[Summary Ranges](https://leetcode.com/problems/summary-ranges)|Medium|[C++](./Algorithms/Medium/Summary Ranges.md)|
|227|[Basic Calculator II](https://leetcode.com/problems/basic-calculator-ii)|Medium|[C++](./Algorithms/Medium/Basic Calculator II.md)|
|226|[Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree)|Easy|[C++](./Algorithms/Easy/Invert Binary Tree.md)|
|225|[Implement Stack using Queues](https://leetcode.com/problems/implement-stack-using-queues)|Easy|[C++](./Algorithms/Easy/Implement Stack using Queues.md)|
|224|[Basic Calculator](https://leetcode.com/problems/basic-calculator)|Hard|[C++](./Algorithms/Hard/Basic Calculator.md)|
|223|[Rectangle Area](https://leetcode.com/problems/rectangle-area)|Easy|[C++](./Algorithms/Easy/Rectangle Area.md)|
|222|[Count Complete Tree Nodes](https://leetcode.com/problems/count-complete-tree-nodes)|Medium|[C++](./Algorithms/Medium/Count Complete Tree Nodes.md)|
|219|[Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii)|Easy|[C++](./Algorithms/Easy/Contains Duplicate II.md)|
|217|[Contains Duplicate](https://leetcode.com/problems/contains-duplicate)|Easy|[C++](./Algorithms/Easy/Contains Duplicate.md)|
|216|[Combination Sum III](https://leetcode.com/problems/combination-sum-iii)|Medium|[C++](./Algorithms/Medium/Combination Sum III.md)|
|215|[Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array)|Medium|[C++](./Algorithms/Medium/Kth Largest Element in an Array.md)|
|213|[House Robber II](https://leetcode.com/problems/house-robber-ii)|Medium|[C++](./Algorithms/Medium/House Robber II.md)|
|211|[Add and Search Word - Data structure design](https://leetcode.com/problems/add-and-search-word---data-structure-design)|Medium|[C++](./Algorithms/Medium/Add and Search Word - Data structure design.md)|
|210|[Course Schedule II](https://leetcode.com/problems/course-schedule-ii)|Medium|[C++](./Algorithms/Medium/Course Schedule II.md)|
|209|[Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum)|Medium|[C++](./Algorithms/Medium/Minimum Size Subarray Sum.md)|
|208|[Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-(prefix-tree))|Medium|[C++](./Algorithms/Medium/Implement Trie (Prefix Tree).md)|
|207|[Course Schedule](https://leetcode.com/problems/course-schedule)|Medium|[C++](./Algorithms/Medium/Course Schedule.md)|
|206|[Reverse Linked List](https://leetcode.com/problems/reverse-linked-list)|Easy|[C++](./Algorithms/Easy/Reverse Linked List.md)|
|205|[Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings)|Easy|[C++](./Algorithms/Easy/Isomorphic Strings.md)|
|204|[Count Primes](https://leetcode.com/problems/count-primes)|Easy|[C++](./Algorithms/Easy/Count Primes.md)|
|203|[Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements)|Easy|[C++](./Algorithms/Easy/Remove Linked List Elements.md)|
|202|[Happy Number](https://leetcode.com/problems/happy-number)|Easy|[C++](./Algorithms/Easy/Happy Number.md)|
|201|[Bitwise AND of Numbers Range](https://leetcode.com/problems/bitwise-and-of-numbers-range)|Medium|[C++](./Algorithms/Medium/Bitwise AND of Numbers Range.md)|
|199|[Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view)|Medium|[C++](./Algorithms/Medium/Binary Tree Right Side View.md)|
|198|[House Robber](https://leetcode.com/problems/house-robber)|Easy|[C++](./Algorithms/Easy/House Robber.md)|
|196|[Delete Duplicate Emails](https://leetcode.com/problems/delete-duplicate-emails)|Easy|[Mysql](./Database/Easy/Delete Duplicate Emails.md)|
|195|[Tenth Line](https://leetcode.com/problems/tenth-line)|Easy|[Shell](./Shell/Easy/Tenth Line.md)|
|193|[Valid Phone Numbers](https://leetcode.com/problems/valid-phone-numbers)|Easy|[Shell](./Shell/Easy/Valid Phone Numbers.md)|
|192|[Word Frequency](https://leetcode.com/problems/word-frequency)|Medium|[Shell](./Shell/Medium/Word Frequency.md)|
|191|[Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits)|Easy|[C++](./Algorithms/Easy/Number of 1 Bits.md)|
|190|[Reverse Bits](https://leetcode.com/problems/reverse-bits)|Easy|[C++](./Algorithms/Easy/Reverse Bits.md)|
|189|[Rotate Array](https://leetcode.com/problems/rotate-array)|Easy|[C++](./Algorithms/Easy/Rotate Array.md)|
|187|[Repeated DNA Sequences](https://leetcode.com/problems/repeated-dna-sequences)|Medium|[C++](./Algorithms/Medium/Repeated DNA Sequences.md)|
|186|[Reverse Words in a String II](https://leetcode.com/problems/reverse-words-in-a-string-ii)|Medium|没钱买|
|184|[Department Highest Salary](https://leetcode.com/problems/department-highest-salary)|Medium|[Mysql](./Database/Medium/Department Highest Salary.md)|
|183|[Customers Who Never Order](https://leetcode.com/problems/customers-who-never-order)|Easy|[Mysql](./Database/Easy/Customers Who Never Order.md)|
|182|[Duplicate Emails](https://leetcode.com/problems/duplicate-emails)|Easy|[Mysql](./Database/Easy/Duplicate Emails.md)|
|181|[Employees Earning More Than Their Managers](https://leetcode.com/problems/employees-earning-more-than-their-managers)|Easy|[Mysql](./Database/Easy/Employees Earning More Than Their Managers.md)|
|180|[Consecutive Numbers](https://leetcode.com/problems/consecutive-numbers)|Medium|[Mysql](./Database/Medium/Consecutive Numbers.md)|
|179|[Largest Number](https://leetcode.com/problems/largest-number)|Medium|[C++](./Algorithms/Medium/Largest Number.md)|
|178|[Rank Scores](https://leetcode.com/problems/rank-scores)|Medium|[Mysql](./Database/Medium/Rank Scores.md)|
|177|[Nth Highest Salary](https://leetcode.com/problems/nth-highest-salary)|Medium|[Mysql](./Database/Medium/Nth Highest Salary.md)|
|176|[Second Highest Salary](https://leetcode.com/problems/second-highest-salary)|Easy|[Mysql](./Database/Easy/Second Highest Salary.md)|
|175|[Combine Two Tables](https://leetcode.com/problems/combine-two-tables)|Easy|[Mysql](./Database/Easy/Combine Two Tables.md)|
|173|[Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator)|Medium|[C++](./Algorithms/Medium/Binary Search Tree Iterator.md)|
|172|[Factorial Trailing Zeroes](https://leetcode.com/problems/factorial-trailing-zeroes)|Easy|[C++](./Algorithms/Easy/Factorial Trailing Zeroes.md)|
|171|[Excel Sheet Column Number](https://leetcode.com/problems/excel-sheet-column-number)|Easy|[C++](./Algorithms/Easy/Excel Sheet Column Number.md)|
|170|[Two Sum III - Data structure design](https://leetcode.com/problems/two-sum-iii---data-structure-design)|Easy|没钱买|
|169|[Majority Element](https://leetcode.com/problems/majority-element)|Easy|[C++](./Algorithms/Easy/Majority Element.md)|
|168|[Excel Sheet Column Title](https://leetcode.com/problems/excel-sheet-column-title)|Easy|[C++](./Algorithms/Easy/Excel Sheet Column Title.md)|
|167|[Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii---input-array-is-sorted)|Medium|[C++](./Algorithms/Medium/Two Sum II - Input array is sorted.md)|
|165|[Compare Version Numbers](https://leetcode.com/problems/compare-version-numbers)|Easy|[C++](./Algorithms/Easy/Compare Version Numbers.md)|
|164|[Maximum Gap](https://leetcode.com/problems/maximum-gap)|Hard|[C++](./Algorithms/Hard/Maximum Gap.md)|
|163|[Missing Ranges](https://leetcode.com/problems/missing-ranges)|Medium|没钱买|
|162|[Find Peak Element](https://leetcode.com/problems/find-peak-element)|Medium|[C++](./Algorithms/Medium/Find Peak Element.md)|
|161|[One Edit Distance](https://leetcode.com/problems/one-edit-distance)|Medium|没钱买|
|160|[Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists)|Easy|[C++](./Algorithms/Easy/Intersection of Two Linked Lists.md)|
|159|[Longest Substring with At Most Two Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-two-distinct-characters)|Hard|没钱买|
|158|[Read N Characters Given Read4 II - Call multiple times](https://leetcode.com/problems/read-n-characters-given-read4-ii---call-multiple-times)|Hard|没钱买|
|157|[Read N Characters Given Read4](https://leetcode.com/problems/read-n-characters-given-read4)|Easy|没钱买|
|156|[Binary Tree Upside Down](https://leetcode.com/problems/binary-tree-upside-down)|Medium|没钱买|
|155|[Min Stack](https://leetcode.com/problems/min-stack)|Easy|[C++](./Algorithms/Easy/Min Stack.md)|
|154|[Find Minimum in Rotated Sorted Array II](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii)|Hard|[C++](./Algorithms/Hard/Find Minimum in Rotated Sorted Array II.md)|
|153|[Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array)|Medium|[C++](./Algorithms/Medium/Find Minimum in Rotated Sorted Array.md)|
|152|[Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray)|Medium|[C++](./Algorithms/Medium/Maximum Product Subarray.md)|
|151|[Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string)|Medium|[C++](./Algorithms/Medium/Reverse Words in a String.md)|
|150|[Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation)|Medium|[C++](./Algorithms/Medium/Evaluate Reverse Polish Notation.md)|
|149|[Max Points on a Line](https://leetcode.com/problems/max-points-on-a-line)|Hard|[C++](./Algorithms/Hard/Max Points on a Line.md)|
|148|[Sort List](https://leetcode.com/problems/sort-list)|Medium|[C++](./Algorithms/Medium/Sort List.md)|
|147|[Insertion Sort List](https://leetcode.com/problems/insertion-sort-list)|Medium|[C++](./Algorithms/Medium/Insertion Sort List.md)|
|145|[Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal)|Hard|[C++](./Algorithms/Hard/Binary Tree Postorder Traversal.md)|
|144|[Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal)|Medium|[C++](./Algorithms/Medium/Binary Tree Preorder Traversal.md)|
|143|[Reorder List](https://leetcode.com/problems/reorder-list)|Medium|[C++](./Algorithms/Medium/Reorder List.md)|
|142|[Linked List Cycle II](https://leetcode.com/problems/linked-list-cycle-ii)|Medium|[C++](./Algorithms/Medium/Linked List Cycle II.md)|
|141|[Linked List Cycle](https://leetcode.com/problems/linked-list-cycle)|Easy|[C++](./Algorithms/Easy/Linked List Cycle.md)|
|140|[Word Break II](https://leetcode.com/problems/word-break-ii)|Hard|[C++](./Algorithms/Hard/Word Break II.md)|
|139|[Word Break](https://leetcode.com/problems/word-break)|Medium|[C++](./Algorithms/Medium/Word Break.md)|
|137|[Single Number II](https://leetcode.com/problems/single-number-ii)|Medium|[C++](./Algorithms/Medium/Single Number II.md)|
|136|[Single Number](https://leetcode.com/problems/single-number)|Easy|[C++](./Algorithms/Easy/Single Number.md)|
|135|[Candy](https://leetcode.com/problems/candy)|Hard|[C++](./Algorithms/Hard/Candy.md)|
|134|[Gas Station](https://leetcode.com/problems/gas-station)|Medium|[C++](./Algorithms/Medium/Gas Station.md)|
|131|[Palindrome Partitioning](https://leetcode.com/problems/palindrome-partitioning)|Medium|[C++](./Algorithms/Medium/Palindrome Partitioning.md)|
|129|[Sum Root to Leaf Numbers](https://leetcode.com/problems/sum-root-to-leaf-numbers)|Medium|[C++](./Algorithms/Medium/Sum Root to Leaf Numbers.md)|
|125|[Valid Palindrome](https://leetcode.com/problems/valid-palindrome)|Easy|[C++](./Algorithms/Easy/Valid Palindrome.md)|
|122|[Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii)|Medium|[C++](./Algorithms/Medium/Best Time to Buy and Sell Stock II.md)|
|121|[Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock)|Easy|[C++](./Algorithms/Easy/Best Time to Buy and Sell Stock.md)|
|120|[Triangle](https://leetcode.com/problems/triangle)|Medium|[C++](./Algorithms/Medium/Triangle.md)|
|119|[Pascal's Triangle II](https://leetcode.com/problems/pascal's-triangle-ii)|Easy|[C++](./Algorithms/Easy/Pascal's Triangle II.md)|
|118|[Pascal's Triangle](https://leetcode.com/problems/pascal's-triangle)|Easy|[C++](./Algorithms/Easy/Pascal's Triangle.md)|
|116|[Populating Next Right Pointers in Each Node](https://leetcode.com/problems/populating-next-right-pointers-in-each-node)|Medium|[C++](./Algorithms/Medium/Populating Next Right Pointers in Each Node.md)|
|114|[Flatten Binary Tree to Linked List](https://leetcode.com/problems/flatten-binary-tree-to-linked-list)|Medium|[C++](./Algorithms/Medium/Flatten Binary Tree to Linked List.md)|
|113|[Path Sum II](https://leetcode.com/problems/path-sum-ii)|Medium|[C++](./Algorithms/Medium/Path Sum II.md)|
|112|[Path Sum](https://leetcode.com/problems/path-sum)|Easy|[C++](./Algorithms/Easy/Path Sum.md)|
|110|[Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree)|Easy|[C++](./Algorithms/Easy/Balanced Binary Tree.md)|
|107|[Binary Tree Level Order Traversal II](https://leetcode.com/problems/binary-tree-level-order-traversal-ii)|Easy|[C++](./Algorithms/Easy/Binary Tree Level Order Traversal II.md)|
|104|[Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree)|Easy|[C++](./Algorithms/Easy/Maximum Depth of Binary Tree.md)|
|103|[Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal)|Medium|[C++](./Algorithms/Medium/Binary Tree Zigzag Level Order Traversal.md)|
|102|[Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal)|Easy|[C++](./Algorithms/Easy/Binary Tree Level Order Traversal.md)|
|101|[Symmetric Tree](https://leetcode.com/problems/symmetric-tree)|Easy|[C++](./Algorithms/Easy/Symmetric Tree.md)|
|100|[Same Tree](https://leetcode.com/problems/same-tree)|Easy|[C++](./Algorithms/Easy/Same Tree.md)|
|98|[Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree)|Medium|[C++](./Algorithms/Medium/Validate Binary Search Tree.md)|
|97|[Interleaving String](https://leetcode.com/problems/interleaving-string)|Hard|[C++](./Algorithms/Hard/Interleaving String.md)|
|96|[Unique Binary Search Trees](https://leetcode.com/problems/unique-binary-search-trees)|Medium|[C++](./Algorithms/Medium/Unique Binary Search Trees.md)|
|94|[Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal)|Medium|[C++](./Algorithms/Medium/Binary Tree Inorder Traversal.md)|
|91|[Decode Ways](https://leetcode.com/problems/decode-ways)|Medium|[C++](./Algorithms/Medium/Decode Ways.md)|
|90|[Subsets II](https://leetcode.com/problems/subsets-ii)|Medium|[C++](./Algorithms/Medium/Subsets II.md)|
|88|[Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array)|Easy|[C++](./Algorithms/Easy/Merge Sorted Array.md)|
|86|[Partition List](https://leetcode.com/problems/partition-list)|Medium|[C++](./Algorithms/Medium/Partition List.md)|
|83|[Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list)|Easy|[C++](./Algorithms/Easy/Remove Duplicates from Sorted List.md)|
|82|[Remove Duplicates from Sorted List II](https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii)|Medium|[C++](./Algorithms/Medium/Remove Duplicates from Sorted List II.md)|
|80|[Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii)|Medium|[C++](./Algorithms/Medium/Remove Duplicates from Sorted Array II.md)|
|78|[Subsets](https://leetcode.com/problems/subsets)|Medium|[C++](./Algorithms/Medium/Subsets.md)|
|77|[Combinations](https://leetcode.com/problems/combinations)|Medium|[C++](./Algorithms/Medium/Combinations.md)|
|75|[Sort Colors](https://leetcode.com/problems/sort-colors)|Medium|[C++](./Algorithms/Medium/Sort Colors.md)|
|74|[Search a 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix)|Medium|[C++](./Algorithms/Medium/Search a 2D Matrix.md)|
|73|[Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes)|Medium|[C++](./Algorithms/Medium/Set Matrix Zeroes.md)|
|71|[Simplify Path](https://leetcode.com/problems/simplify-path)|Medium|[C++](./Algorithms/Medium/Simplify Path.md)|
|70|[Climbing Stairs](https://leetcode.com/problems/climbing-stairs)|Easy|[C++](./Algorithms/Easy/Climbing Stairs.md)|
|69|[Sqrt(x)](https://leetcode.com/problems/sqrt(x))|Medium|[C++](./Algorithms/Medium/Sqrt(x).md)|
|67|[Add Binary](https://leetcode.com/problems/add-binary)|Easy|[C++](./Algorithms/Easy/Add Binary.md)|
|66|[Plus One](https://leetcode.com/problems/plus-one)|Easy|[C++](./Algorithms/Easy/Plus One.md)|
|64|[Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum)|Medium|[C++](./Algorithms/Medium/Minimum Path Sum.md)|
|63|[Unique Paths II](https://leetcode.com/problems/unique-paths-ii)|Medium|[C++](./Algorithms/Medium/Unique Paths II.md)|
|62|[Unique Paths](https://leetcode.com/problems/unique-paths)|Medium|[C++](./Algorithms/Medium/Unique Paths.md)|
|61|[Rotate List](https://leetcode.com/problems/rotate-list)|Medium|[C++](./Algorithms/Medium/Rotate List.md)|
|60|[Permutation Sequence](https://leetcode.com/problems/permutation-sequence)|Medium|[C++](./Algorithms/Medium/Permutation Sequence.md)|
|59|[Spiral Matrix II](https://leetcode.com/problems/spiral-matrix-ii)|Medium|[C++](./Algorithms/Medium/Spiral Matrix II.md)|
|58|[Length of Last Word](https://leetcode.com/problems/length-of-last-word)|Easy|[C++](./Algorithms/Easy/Length of Last Word.md)|
|56|[Merge Intervals](https://leetcode.com/problems/merge-intervals)|Hard|[C++](./Algorithms/Hard/Merge Intervals.md)|
|57|[Insert Interval](https://leetcode.com/problems/insert-interval)|Hard|[C++](./Algorithms/Hard/Insert Interval.md)|
|55|[Jump Game](https://leetcode.com/problems/jump-game)|Medium|[C++](./Algorithms/Medium/Jump Game.md)|
|54|[Spiral Matrix](https://leetcode.com/problems/spiral-matrix)|Medium|[C++](./Algorithms/Medium/Spiral Matrix.md)|
|53|[Maximum Subarray](https://leetcode.com/problems/maximum-subarray)|Medium|[C++](./Algorithms/Medium/Maximum Subarray.md)|
|52|[N-Queens II](https://leetcode.com/problems/n-queens-ii)|Hard|[C++](./Algorithms/Hard/N-Queens II.md)|
|51|[N-Queens](https://leetcode.com/problems/n-queens)|Hard|[C++](./Algorithms/Hard/N-Queens.md)|
|50|[Pow(x, n)](https://leetcode.com/problems/pow(x,-n))|Medium|[C++](./Algorithms/Medium/Pow(x, n).md)|
|49|[Group Anagrams](https://leetcode.com/problems/group-anagrams)|Medium|[C++](./Algorithms/Medium/Group Anagrams.md)|
|48|[Rotate Image](https://leetcode.com/problems/rotate-image)|Medium|[C++](./Algorithms/Medium/Rotate Image.md)|
|47|[Permutations II](https://leetcode.com/problems/permutations-ii)|Medium|[C++](./Algorithms/Medium/Permutations II.md)|
|46|[Permutations](https://leetcode.com/problems/permutations)|Medium|[C++](./Algorithms/Medium/Permutations.md)|
|45|[Jump Game II](https://leetcode.com/problems/jump-game-ii)|Hard|[C++](./Algorithms/Hard/Jump Game II.md)|
|42|[Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water)|Hard|[C++](./Algorithms/Hard/Trapping Rain Water.md)|
|41|[First Missing Positive](https://leetcode.com/problems/first-missing-positive)|Hard|[C++](./Algorithms/Hard/First Missing Positive.md)|
|40|[Combination Sum II](https://leetcode.com/problems/combination-sum-ii)|Medium|[C++](./Algorithms/Medium/Combination Sum II.md)|
|39|[Combination Sum](https://leetcode.com/problems/combination-sum)|Medium|[C++](./Algorithms/Medium/Combination Sum.md)|
|36|[Valid Sudoku](https://leetcode.com/problems/valid-sudoku)|Easy|[C++](./Algorithms/Easy/Valid Sudoku.md)|
|35|[Search Insert Position](https://leetcode.com/problems/search-insert-position)|Medium|[C++](./Algorithms/Medium/Search Insert Position.md)|
|34|[Search for a Range](https://leetcode.com/problems/search-for-a-range)|Medium|[C++](./Algorithms/Medium/Search for a Range.md)|
|31|[Next Permutation](https://leetcode.com/problems/next-permutation)|Medium|[C++](./Algorithms/Medium/Next Permutation.md)|
|28|[Implement strStr()](https://leetcode.com/problems/implement-strstr())|Easy|[C++](./Algorithms/Easy/Implement strStr().md)|
|27|[Remove Element](https://leetcode.com/problems/remove-element)|Easy|[C++](./Algorithms/Easy/Remove Element.md)|
|26|[Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array)|Easy|[C++](./Algorithms/Easy/Remove Duplicates from Sorted Array.md)|
|25|[Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group)|Hard|[C++](./Algorithms/Hard/Reverse Nodes in k-Group.md)|
|24|[Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs)|Easy|[C++](./Algorithms/Easy/Swap Nodes in Pairs.md)|
|23|[Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists)|Hard|[C++](./Algorithms/Hard/Merge k Sorted Lists.md)|
|22|[Generate Parentheses](https://leetcode.com/problems/generate-parentheses)|Medium|[C++](./Algorithms/Medium/Generate Parentheses.md)|
|21|[Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists)|Easy|[C++](./Algorithms/Easy/Merge Two Sorted Lists.md)|
|20|[Valid Parentheses](https://leetcode.com/problems/valid-parentheses)|Easy|[C++](./Algorithms/Easy/Valid Parentheses.md)|
|19|[Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list)|Easy|[C++](./Algorithms/Easy/Remove Nth Node From End of List.md)|
|18|[4Sum](https://leetcode.com/problems/4sum)|Medium|[C++](./Algorithms/Medium/4Sum.md)|
|17|[Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number)|Medium|[C++](./Algorithms/Medium/Letter Combinations of a Phone Number.md)|
|16|[3Sum Closest](https://leetcode.com/problems/3sum-closest)|Medium|[C++](./Algorithms/Medium/3Sum Closest.md)|
|15|[3Sum](https://leetcode.com/problems/3sum)|Medium|[C++](./Algorithms/Medium/3Sum.md)|
|14|[Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix)|Easy|[C++](./Algorithms/Easy/Longest Common Prefix.md)|
|13|[Roman to Integer](https://leetcode.com/problems/roman-to-integer)|Easy|[C++](./Algorithms/Easy/Roman to Integer.md)|
|12|[Integer to Roman](https://leetcode.com/problems/integer-to-roman)|Medium|[C++](./Algorithms/Medium/Integer to Roman.md)|
|11|[Container With Most Water](https://leetcode.com/problems/container-with-most-water)|Medium|[C++](./Algorithms/Medium/Container With Most Water.md)|
|10|[Regular Expression Matching](https://leetcode.com/problems/regular-expression-matching)|Hard|[C++](./Algorithms/Hard/Regular Expression Matching.md)|
|9|[Palindrome Number](https://leetcode.com/problems/palindrome-number)|Easy|[C++](./Algorithms/Easy/Palindrome Number.md)|
|8|[String to Integer](https://leetcode.com/problems/string-to-integer)|Easy|[C++](./Algorithms/Easy/String to Integer.md)|
|7|[Reverse Integer](https://leetcode.com/problems/reverse-integer)|Easy|[C++](./Algorithms/Easy/Reverse Integer.md)|
|6|[ZigZag Conversion](https://leetcode.com/problems/zigzag-conversion)|Easy|[C++](./Algorithms/Easy/ZigZag Conversion.md)|
|5|[Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring)|Medium|[C++](./Algorithms/Medium/Longest Palindromic Substring.md)|
|3|[Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters)|Medium|[C++](./Algorithms/Medium/Longest Substring Without Repeating Characters.md)|
|2|[Add Two Numbers](https://leetcode.com/problems/add-two-numbers)|Medium|[C++](./Algorithms/Medium/Add Two Numbers.md)|
|1|[Two Sum](https://leetcode.com/problems/two-sum)|Easy|[C++](./Algorithms/Easy/Two Sum.md)|