<commit_before>LeetCode
========

LeetCode solutions in C++ 11.

| Title | Solution | Add Date | Difficulty |
| ----- | -------- | -------- | ---------- |
|[Single Number][1]| [C++](./01. Single Number/solution.h)|2014/10/15|Medium|
|[Maximum Depth of Binary Tree][2]| [C++](./02. Maximum Depth of Binary Tree/solution.h)|2014/10/16|Easy|
|[Same Tree][3]| [C++](./03. Same Tree/solution.h)|2014/10/17|Easy|
|[Reverse Integer][4]| [C++](04. Reverse Integer/solution.h)|2014/10/18|Easy|
|[Best Time to Buy and Sell Stock II][5]| [C++](05. Best Time to Buy and Sell Stock II/solution.h)|2014/10/19|Medium|
|[Unique Binary Search Trees][6]| [C++](06. Unique Binary Search Trees/solution.h)|2014/10/20|Medium|
|[Linked List Cycle][7]| [C++](07. Linked List Cycle/solution.h)|2014/10/21|Medium|
|[Binary Tree Inorder Traversal][8]| [C++](08. Binary Tree Inorder Traversal/solution.h)|2014/10/22|Medium|
|[Binary Tree Preorder Traversal][9]| [C++](09. Binary Tree Preorder Traversal/solution.h)|2014/10/23|Medium|
|[Populating Next Right Pointers in Each Node][10]| [C++](10. Populating Next Right Pointers in Each Node/solution.h)|2014/10/24|Medium|
|[Search Insert Position][11]| [C++](11. Search Insert Position/solution.h)|2014/10/25|Medium|
|[Remove Duplicates from Sorted List][12]| [C++](12. Remove Duplicates from Sorted List/solution.h)|2014/10/26|Easy|
|[Climbing Stairs][13]| [C++](13. Climbing Stairs/solution.h)|2014/10/27|Easy|
|[Maximum Subarray][14]| [C++](14. Maximum Subarray/solution.h)|2014/10/28|Medium|
|[N-Queens II][15]|[C++](15. N-Queens II/solution.h)|2014/10/29|Hard
|[Roman to Integer][16]|[C++](16. Roman to Integer/solution.h)|2014/10/30|Easy
|[Integer to Roman][17]|[C++](17. Integer to Roman/solution.h)|2014/10/31|Medium
|[Single Number II][18]|[C++](18. Single Number II/solution.h)|2014/11/1|Medium
|[Merge Two Sorted Lists][19]|[C++](19. Merge Two Sorted Lists/solution.h)|2014/11/2|Easy
|[Remove Element][20]|[C++](20. Remove Element/solution.h)|2014/11/3|Easy
|[Convert Sorted Array to Binary Search Tree][21]|[C++](21. Convert Sorted Array to Binary Search Tree/solution.h)|2014/11/4|Medium
|[Balanced Binary Tree][22]|[C++](22. Balanced Binary Tree/solution.h)|2014/11/5|Easy
|[Swap Nodes in Pairs][23]|[C++](23. Swap Nodes in Pairs/solution.h)|2014/11/6|Medium
|[Remove Duplicates from Sorted Array][24]|[C++](24. Remove Duplicates from Sorted Array/solution.h)|2014/11/7|Easy
|[Sort Colors][25]|[C++](25. Sort Colors/solution.h)|2014/11/8|Medium
|[Merge Sorted Array][26]|[C++](26. Merge Sorted Array/solution.h)|2014/11/9|Easy
|[Symmetric Tree][27]|[C++](27. Symmetric Tree/solution.h)|2014/11/10|Easy
|[Gray Code][28]|[C++](28. Gray Code/solution.h)|2014/11/11|Medium
|[Unique Paths][29]|[C++](29. Unique Paths/solution.h)|2014/11/12|Medium
|[Plus One][30]|[C++](30. Plus One/solution.h)|2014/11/13|Easy
|[Generate Parentheses][31]|[C++](31. Generate Parentheses/solution.h)|2014/11/14|Medium
|[Pascal's Triangle][32]|[C++](32. Pascal's Triangle/solution.h)|2014/11/15|Easy
|[Container With Most Water][33]|[C++](33. Container With Most Water/solution.h)|2014/11/16|Medium
|[Permutations][34]|[C++](34. Permutations/solution.h)|2014/11/17|Medium
|[Rotate Image][35]|[C++](35. Rotate Image/solution.h)|2014/11/18|Medium
|[Search a 2D Matrix][36]|[C++](36. Search a 2D Matrix/solution.h)|2014/11/19|Medium
|[Find Minimum in Rotated Sorted Array][37]|[C++](37. Find Minimum in Rotated Sorted Array/solution.h)|2014/11/20|Medium
|[Minimum Path Sum][38]|[C++](38. Minimum Path Sum/solution.h)|2014/11/21|Medium
|[Best Time to Buy and Sell Stock][39]|[C++](39. Best Time to Buy and Sell Stock/solution.h)|2014/11/22|Medium
|[Binary Tree Level Order Traversal II][40]|[C++](40. Binary Tree Level Order Traversal II/solution.h)|2014/11/23|Easy
|[Search in Rotated Sorted Array II][41]|[C++](41. Search in Rotated Sorted Array II/solution.h)|2014/11/24|Medium
|[Binary Tree Postorder Traversal][42]|[C++](42. Binary Tree Postorder Traversal/solution.h)|2014/11/25|Hard
|[Linked List Cycle II][43]|[C++](43. Linked List Cycle II/solution.h)|2014/11/26|Medium
|[Set Matrix Zeroes][44]|[C++](44. Set Matrix Zeroes/solution.h)|2014/11/27|Medium
|[Spiral Matrix II][45]|[C++](45. Spiral Matrix II/solution.h)|2014/11/28|Medium
|[Remove Duplicates from Sorted Array II][46]|[C++](46. Remove Duplicates from Sorted Array II/solution.h)|2014/11/29|Medium
|[Populating Next Right Pointers in Each Node II][47]|[C++](47. Populating Next Right Pointers in Each Node II/solution.h)|2014/11/30|Hard
|[Binary Tree Level Order Traversal][48]|[C++](48. Binary Tree Level Order Traversal/solution.h)|2014/12/1|Easy
|[Path Sum][49]|[C++](49. Path Sum/solution.h)|2014/12/2|Easy
|[Pascal's Triangle II][50]|[C++](50. Pascal's Triangle II/solution.h)|2014/12/3|Easy
|[Combinations][51]|[C++](51. Combinations/solution.h)|2014/12/4|Medium
|[Sum Root to Leaf Numbers][52]|[C++](52. Sum Root to Leaf Numbers/solution.h)|2014/12/5|Medium
|[Remove Nth Node From End of List][53]|[C++](53. Remove Nth Node From End of List/solution.h)|2014/12/6|Easy
|[Minimum Depth of Binary Tree][54]|[C++](54. Minimum Depth of Binary Tree/solution.h)|2014/12/7|Easy
|[Length of Last Word][55]|[C++](55. Length of Last Word/solution.h)|2014/12/8|Easy
|[Trapping Rain Water][56]|[C++](56. Trapping Rain Water/solution.h)|2014/12/9|Hard
|[Palindrome Number][57]|[C++](57. Palindrome Number/solution.h)|2014/12/10|Easy
|[Search in Rotated Sorted Array][58]|[C++](58. Search in Rotated Sorted Array/solution.h)|2014/12/11|Hard
|[Valid Parentheses][59]|[C++](59. Valid Parentheses/solution.h)|2014/12/12|Easy
|[Flatten Binary Tree to Linked List][60]|[C++](60. Flatten Binary Tree to Linked List/solution.h)|2014/12/13|Medium
|[Longest Consecutive Sequence][61]|[C++](61. Longest Consecutive Sequence/solution.h)|2014/12/14|Hard
|[Unique Paths II][62]|[C++](62. Unique Paths II/solution.h)|2014/12/15|Medium
|[Subsets][63]|[C++](63. Subsets/solution.h)|2014/12/16|Medium
|[Valid Sudoku][64]|[C++](64. Valid Sudoku/solution.h)|2014/12/17|Easy
|[Unique Binary Search Trees II][65]|[C++](65. Unique Binary Search Trees II/solution.h)|2014/12/18|Medium
|[Convert Sorted List to Binary Search Tree][66]|[C++](66. Convert Sorted List to Binary Search Tree/solution.h)|2014/12/19|Medium
|[Search for a Range][67]|[C++](67. Search for a Range/solution.h)|2014/12/20|Medium
|[Jump Game][68]|[C++](68. Jump Game/solution.h)|2014/12/21|Medium
|[Count and Say][69]|[C++](69. Count and Say/solution.h)|2014/12/22|Easy
|[Longest Common Prefix][70]|[C++](70. Longest Common Prefix/solution.h)|2014/12/23|Easy
|[Subsets II][71]|[C++](71. Subsets II/solution.h)|2014/12/24|Medium
|[Partition List][72]|[C++](72. Partition List/solution.h)|2014/12/25|Medium
|[3Sum Closest][73]|[C++](73. 3Sum Closest/solution.h)|2014/12/26|Medium
|[Path Sum II][74]|[C++](74. Path Sum II/solution.h)|2014/12/27|Medium
|[Combination Sum][75]|[C++](75. Combination Sum/solution.h)|2014/12/28|Medium
|[Triangle][76]|[C++](76. Triangle/solution.h)|2014/12/29|Medium
|[Construct Binary Tree from Inorder and Postorder Traversal][77]|[C++](77. Construct Binary Tree from Inorder and Postorder Traversal/solution.h)|2014/12/30|Medium
|[Binary Tree Zigzag Level Order Traversal][78]|[C++](78. Binary Tree Zigzag Level Order Traversal/solution.h)|2014/12/31|Medium
|[Construct Binary Tree from Preorder and Inorder Traversal][79]|[C++](79. Construct Binary Tree from Preorder and Inorder Traversal/solution.h)|2015/1/1|Medium
|[Letter Combinations of a Phone Number][80]|[C++](80. Letter Combinations of a Phone Number/solution.h)|2015/1/2|Medium
|[Reverse Linked List II][81]|[C++](81. Reverse Linked List II/solution.h)|2015/1/3|Medium
|[Pow(x, n)][82]|[C++](82. Pow(x, n)/solution.h)|2015/1/4|Medium
|[N-Queens][83]|[C++](83. N-Queens/solution.h)|2015/1/5|Hard
|[Gas Station][84]|[C++](84. Gas Station/solution.h)|2015/1/6|Medium
|[Palindrome Partitioning][85]|[C++](85. Palindrome Partitioning/solution.h)|2015/1/7|Medium
|[Validate Binary Search Tree][86]|[C++](86. Validate Binary Search Tree/solution.h)|2015/1/8|Medium
|[Add Binary][87]|[C++](87. Add Binary/solution.h)|2015/1/9|Easy
|[Edit Distance][88]|[C++](88. Edit Distance/solution.h)|2015/1/10|Hard
|[Next Permutation][89]|[C++](89. Next Permutation/solution.h)|2015/1/11|Medium
|[Insertion Sort List][90]|[C++](90. Insertion Sort List/solution.h)|2015/1/12|Medium
|[Reverse Nodes in k-Group][91]|[C++](91. Reverse Nodes in k-Group/solution.h)|2015/1/13|Hard
|[Distinct Subsequences][92]|[C++](92. Distinct Subsequences/solution.h)|2015/1/14|Hard
|[Permutations II][93]|[C++](93. Permutations II/solution.h)|2015/1/15|Hard
|[Remove Duplicates from Sorted List II][94]|[C++](94. Remove Duplicates from Sorted List II/solution.h)|2015/1/16|Medium
|[Jump Game II][95]|[C++](95. Jump Game II/solution.h)|2015/1/17|Hard
|[Combination Sum II][96]|[C++](96. Combination Sum II/solution.h)|2015/1/18|Medium
|[Anagrams][97]|[C++](97. Anagrams/solution.h)|2015/1/19|Medium
|[Recover Binary Search Tree][98]|[C++](98. Recover Binary Search Tree/solution.h)|2015/1/20|Hard
|[ZigZag Conversion][99]|[C++](99. ZigZag Conversion/solution.h)|2015/1/21|Easy
|[Copy List with Random Pointer][100]|[C++](100. Copy List with Random Pointer/solution.h)|2015/1/22|Hard
|[Clone Graph][101]|[C++](101. Clone Graph/solution.h)|2015/1/23|Medium
|[Add Two Numbers][102]|[C++](102. Add Two Numbers/solution.h)|2015/1/24|Medium
|[Scramble String][103]|[C++](103. Scramble String/solution.h)|2015/1/25|Hard
|[Valid Palindrome][104]|[C++](104. Valid Palindrome/solution.h)|2015/1/26|Easy
|[First Missing Positive][105]|[C++](105. First Missing Positive/solution.h)|2015/1/27|Hard
|[Best Time to Buy and Sell Stock III][106]|[C++](106. Best Time to Buy and Sell Stock III/solution.h)|2015/1/28|Hard
|[Sqrt(x)][107]|[C++](107. Sqrt(x)/solution.h)|2015/1/29|Medium
|[Permutation Sequence][108]|[C++](108. Permutation Sequence/solution.h)|2015/1/30|Medium
|[Longest Substring Without Repeating Characters][109]|[C++](109. Longest Substring Without Repeating Characters/solution.h)|2015/1/31|Medium
|[Rotate List][110]|[C++](110. Rotate List/solution.h)|2015/2/1|Medium
|[Implement strStr()][111]|[C++](111. Implement strStr()/solution.h)|2015/2/2|Easy
|[4Sum][112]|[C++](112. 4Sum/solution.h)|2015/2/3|Medium
|[Maximal Rectangle][113]|[C++](113. Maximal Rectangle/solution.h)|2015/2/4|Hard
|[Largest Rectangle in Histogram][114]|[C++](114. Largest Rectangle in Histogram/solution.h)|2015/2/5|Hard
|[Merge k Sorted Lists][115]|[C++](115. Merge k Sorted Lists/solution.h)|2015/2/6|Hard
|[Word Break][116]|[C++](116. Word Break/solution.h)|2015/2/7|Medium
|[Merge Intervals][117]|[C++](117. Merge Intervals/solution.h)|2015/2/8|Hard
|[Sudoku Solver][118]|[C++](118. Sudoku Solver/solution.h)|2015/2/9|Hard
|[Longest Palindromic Substring][119]|[C++](119. Longest Palindromic Substring/solution.h)|2015/2/10|Medium
|[Insert Interval][120]|[C++](120. Insert Interval/solution.h)|2015/2/11|Hard
|[Spiral Matrix][121]|[C++](121. Spiral Matrix/solution.h)|2015/2/12|Medium
|[Sort List][122]|[C++](122. Sort List/solution.h)|2015/2/13|Medium
|[Restore IP Addresses][123]|[C++](123. Restore IP Addresses/solution.h)|2015/2/14|Medium
|[Multiply Strings][124]|[C++](124. Multiply Strings/solution.h)|2015/2/15|Medium
|[Reorder List][125]|[C++](125. Reorder List/solution.h)|2015/2/16|Medium
|[Binary Tree Maximum Path Sum][126]|[C++](126. Binary Tree Maximum Path Sum/solution.h)|2015/2/17|Hard
|[Regular Expression Matching][127]|[C++](127. Regular Expression Matching/solution.h)|2015/2/18|Hard
|[Simplify Path][128]|[C++](128. Simplify Path/solution.h)|2015/2/19|Medium
|[Word Search][129]|[C++](129. Word Search/solution.h)|2015/2/20|Medium
|[Evaluate Reverse Polish Notation][130]|[C++](130. Evaluate Reverse Polish Notation/solution.h)|2015/2/21|Medium
|[Longest Valid Parentheses][131]|[C++](131. Longest Valid Parentheses/solution.h)|2015/2/22|Hard
|[Interleaving String][132]|[C++](132. Interleaving String/solution.h)|2015/2/23|Hard
|[Candy][133]|[C++](133. Candy/solution.h)|2015/2/24|Hard
|[Find Minimum in Rotated Sorted Array II][134]|[C++](134. Find Minimum in Rotated Sorted Array II/solution.h)|2015/2/25|Hard
|[Word Ladder][135]|[C++](135. Word Ladder/solution.h)|2015/2/26|Medium
|[Two Sum][136]|[C++](136. Two Sum/solution.h)|2015/2/27|Medium
|[Palindrome Partitioning II][137]|[C++](137. Palindrome Partitioning II/solution.h)|2015/2/28|Hard
|[Minimum Window Substring][138]|[C++](138. Minimum Window Substring/solution.h)|2015/3/1|Hard
|[Substring with Concatenation of All Words][139]|[C++](139. Substring with Concatenation of All Words/solution.h)|2015/3/2|Hard
|[Median of Two Sorted Arrays][140]|[C++](140. Median of Two Sorted Arrays/solution.h)|2015/3/3|Hard
|[3Sum][141]|[C++](141. 3Sum/solution.h)|2015/3/4|Medium
|[Divide Two Integers][142]|[C++](142. Divide Two Integers/solution.h)|2015/3/5|Medium
|[Word Break II][143]|[C++](143. Word Break II/solution.h)|2015/3/6|Hard
|[Decode Ways][144]|[C++](144. Decode Ways/solution.h)|2015/3/7|Medium
|[Maximum Product Subarray][145]|[C++](145. Maximum Product Subarray/solution.h)|2015/3/8|Medium
|[String to Integer (atoi)][146]|[C++](146. String to Integer (atoi)/solution.h)|2015/3/9|Easy
|[Wildcard Matching][147]|[C++](147. Wildcard Matching/solution.h)|2015/3/10|Hard
|[Surrounded Regions][148]|[C++](148. Surrounded Regions/solution.h)|2015/3/11|Medium
|[Reverse Words in a String][149]|[C++](149. Reverse Words in a String/solution.h)|2015/3/12|Medium
|[LRU Cache][150]|[C++](150. LRU Cache/solution.h)|2015/3/13|Hard
|[Text Justification][151]|[C++](151. Text Justification/solution.h)|2015/3/14|Hard
|[Word Ladder II][152]|[C++](152. Word Ladder II/solution.h)|2015/3/15|Hard
|[Valid Number][153]|[C++](153. Valid Number/solution.h)|2015/3/16|Easy
|[Max Points on a Line][154]|[C++](154. Max Points on a Line/solution.h)|2015/3/17|Hard

[1]:https://oj.leetcode.com/problems/single-number/
[2]:https://oj.leetcode.com/problems/maximum-depth-of-binary-tree/
[3]:https://oj.leetcode.com/problems/same-tree/
[4]:https://oj.leetcode.com/problems/reverse-integer/
[5]:https://oj.leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/
[6]:https://oj.leetcode.com/problems/unique-binary-search-trees/
[7]:https://oj.leetcode.com/problems/linked-list-cycle/
[8]:https://oj.leetcode.com/problems/binary-tree-inorder-traversal/
[9]:https://oj.leetcode.com/problems/binary-tree-preorder-traversal/
[10]:https://oj.leetcode.com/problems/populating-next-right-pointers-in-each-node/
[11]:https://oj.leetcode.com/problems/search-insert-position/
[12]:https://oj.leetcode.com/problems/remove-duplicates-from-sorted-list/
[13]:https://oj.leetcode.com/problems/climbing-stairs/
[14]:https://oj.leetcode.com/problems/maximum-subarray/
[15]:https://oj.leetcode.com/problems/n-queens-ii/
[16]:https://oj.leetcode.com/problems/roman-to-integer/
[17]:https://oj.leetcode.com/problems/integer-to-roman/
[18]:https://oj.leetcode.com/problems/single-number-ii/
[19]:https://oj.leetcode.com/problems/merge-two-sorted-lists/
[20]:https://oj.leetcode.com/problems/remove-element/
[21]:https://oj.leetcode.com/problems/convert-sorted-array-to-binary-search-tree/
[22]:https://oj.leetcode.com/problems/balanced-binary-tree/
[23]:https://oj.leetcode.com/problems/swap-nodes-in-pairs/
[24]:https://oj.leetcode.com/problems/remove-duplicates-from-sorted-array/
[25]:https://oj.leetcode.com/problems/sort-colors/
[26]:https://oj.leetcode.com/problems/merge-sorted-array/
[27]:https://oj.leetcode.com/problems/symmetric-tree/
[28]:https://oj.leetcode.com/problems/gray-code/
[29]:https://oj.leetcode.com/problems/unique-paths/
[30]:https://oj.leetcode.com/problems/plus-one/
[31]:https://oj.leetcode.com/problems/generate-parentheses/
[32]:https://oj.leetcode.com/problems/permutations/
[33]:https://oj.leetcode.com/problems/pascals-triangle/
[34]:https://oj.leetcode.com/problems/find-minimum-in-rotated-sorted-array/
[35]:https://oj.leetcode.com/problems/rotate-image/
[36]:https://oj.leetcode.com/problems/container-with-most-water/
[37]:https://oj.leetcode.com/problems/minimum-path-sum/
[38]:https://oj.leetcode.com/problems/search-a-2d-matrix/
[39]:https://oj.leetcode.com/problems/binary-tree-level-order-traversal-ii/
[40]:https://oj.leetcode.com/problems/best-time-to-buy-and-sell-stock/
[41]:https://oj.leetcode.com/problems/binary-tree-postorder-traversal/
[42]:https://oj.leetcode.com/problems/search-in-rotated-sorted-array-ii/
[43]:https://oj.leetcode.com/problems/set-matrix-zeroes/
[44]:https://oj.leetcode.com/problems/spiral-matrix-ii/
[45]:https://oj.leetcode.com/problems/linked-list-cycle-ii/
[46]:https://oj.leetcode.com/problems/path-sum/<commit_msg>correct links.<commit_after>LeetCode
========

LeetCode solutions in C++ 11.

| Title | Solution | Add Date | Difficulty |
| ----- | -------- | -------- | ---------- |
|[Single Number][1]| [C++](./01. Single Number/solution.h)|2014/10/15|Medium|
|[Maximum Depth of Binary Tree][2]| [C++](./02. Maximum Depth of Binary Tree/solution.h)|2014/10/16|Easy|
|[Same Tree][3]| [C++](./03. Same Tree/solution.h)|2014/10/17|Easy|
|[Reverse Integer][4]| [C++](04. Reverse Integer/solution.h)|2014/10/18|Easy|
|[Best Time to Buy and Sell Stock II][5]| [C++](05. Best Time to Buy and Sell Stock II/solution.h)|2014/10/19|Medium|
|[Unique Binary Search Trees][6]| [C++](06. Unique Binary Search Trees/solution.h)|2014/10/20|Medium|
|[Linked List Cycle][7]| [C++](07. Linked List Cycle/solution.h)|2014/10/21|Medium|
|[Binary Tree Inorder Traversal][8]| [C++](08. Binary Tree Inorder Traversal/solution.h)|2014/10/22|Medium|
|[Binary Tree Preorder Traversal][9]| [C++](09. Binary Tree Preorder Traversal/solution.h)|2014/10/23|Medium|
|[Populating Next Right Pointers in Each Node][10]| [C++](10. Populating Next Right Pointers in Each Node/solution.h)|2014/10/24|Medium|
|[Search Insert Position][11]| [C++](11. Search Insert Position/solution.h)|2014/10/25|Medium|
|[Remove Duplicates from Sorted List][12]| [C++](12. Remove Duplicates from Sorted List/solution.h)|2014/10/26|Easy|
|[Climbing Stairs][13]| [C++](13. Climbing Stairs/solution.h)|2014/10/27|Easy|
|[Maximum Subarray][14]| [C++](14. Maximum Subarray/solution.h)|2014/10/28|Medium|
|[N-Queens II][15]|[C++](15. N-Queens II/solution.h)|2014/10/29|Hard
|[Roman to Integer][16]|[C++](16. Roman to Integer/solution.h)|2014/10/30|Easy
|[Integer to Roman][17]|[C++](17. Integer to Roman/solution.h)|2014/10/31|Medium
|[Single Number II][18]|[C++](18. Single Number II/solution.h)|2014/11/1|Medium
|[Merge Two Sorted Lists][19]|[C++](19. Merge Two Sorted Lists/solution.h)|2014/11/2|Easy
|[Remove Element][20]|[C++](20. Remove Element/solution.h)|2014/11/3|Easy
|[Convert Sorted Array to Binary Search Tree][21]|[C++](21. Convert Sorted Array to Binary Search Tree/solution.h)|2014/11/4|Medium
|[Balanced Binary Tree][22]|[C++](22. Balanced Binary Tree/solution.h)|2014/11/5|Easy
|[Swap Nodes in Pairs][23]|[C++](23. Swap Nodes in Pairs/solution.h)|2014/11/6|Medium
|[Remove Duplicates from Sorted Array][24]|[C++](24. Remove Duplicates from Sorted Array/solution.h)|2014/11/7|Easy
|[Sort Colors][25]|[C++](25. Sort Colors/solution.h)|2014/11/8|Medium
|[Merge Sorted Array][26]|[C++](26. Merge Sorted Array/solution.h)|2014/11/9|Easy
|[Symmetric Tree][27]|[C++](27. Symmetric Tree/solution.h)|2014/11/10|Easy
|[Gray Code][28]|[C++](28. Gray Code/solution.h)|2014/11/11|Medium
|[Unique Paths][29]|[C++](29. Unique Paths/solution.h)|2014/11/12|Medium
|[Plus One][30]|[C++](30. Plus One/solution.h)|2014/11/13|Easy
|[Generate Parentheses][31]|[C++](31. Generate Parentheses/solution.h)|2014/11/14|Medium
|[Pascal's Triangle][32]|[C++](32. Pascal's Triangle/solution.h)|2014/11/15|Easy
|[Container With Most Water][33]|[C++](33. Container With Most Water/solution.h)|2014/11/16|Medium
|[Permutations][34]|[C++](34. Permutations/solution.h)|2014/11/17|Medium
|[Rotate Image][35]|[C++](35. Rotate Image/solution.h)|2014/11/18|Medium
|[Search a 2D Matrix][36]|[C++](36. Search a 2D Matrix/solution.h)|2014/11/19|Medium
|[Find Minimum in Rotated Sorted Array][37]|[C++](37. Find Minimum in Rotated Sorted Array/solution.h)|2014/11/20|Medium
|[Minimum Path Sum][38]|[C++](38. Minimum Path Sum/solution.h)|2014/11/21|Medium
|[Best Time to Buy and Sell Stock][39]|[C++](39. Best Time to Buy and Sell Stock/solution.h)|2014/11/22|Medium
|[Binary Tree Level Order Traversal II][40]|[C++](40. Binary Tree Level Order Traversal II/solution.h)|2014/11/23|Easy
|[Search in Rotated Sorted Array II][41]|[C++](41. Search in Rotated Sorted Array II/solution.h)|2014/11/24|Medium
|[Binary Tree Postorder Traversal][42]|[C++](42. Binary Tree Postorder Traversal/solution.h)|2014/11/25|Hard
|[Linked List Cycle II][43]|[C++](43. Linked List Cycle II/solution.h)|2014/11/26|Medium
|[Set Matrix Zeroes][44]|[C++](44. Set Matrix Zeroes/solution.h)|2014/11/27|Medium
|[Spiral Matrix II][45]|[C++](45. Spiral Matrix II/solution.h)|2014/11/28|Medium
|[Remove Duplicates from Sorted Array II][46]|[C++](46. Remove Duplicates from Sorted Array II/solution.h)|2014/11/29|Medium
|[Populating Next Right Pointers in Each Node II][47]|[C++](47. Populating Next Right Pointers in Each Node II/solution.h)|2014/11/30|Hard
|[Binary Tree Level Order Traversal][48]|[C++](48. Binary Tree Level Order Traversal/solution.h)|2014/12/1|Easy
|[Path Sum][49]|[C++](49. Path Sum/solution.h)|2014/12/2|Easy
|[Pascal's Triangle II][50]|[C++](50. Pascal's Triangle II/solution.h)|2014/12/3|Easy
|[Combinations][51]|[C++](51. Combinations/solution.h)|2014/12/4|Medium
|[Sum Root to Leaf Numbers][52]|[C++](52. Sum Root to Leaf Numbers/solution.h)|2014/12/5|Medium
|[Remove Nth Node From End of List][53]|[C++](53. Remove Nth Node From End of List/solution.h)|2014/12/6|Easy
|[Minimum Depth of Binary Tree][54]|[C++](54. Minimum Depth of Binary Tree/solution.h)|2014/12/7|Easy
|[Length of Last Word][55]|[C++](55. Length of Last Word/solution.h)|2014/12/8|Easy
|[Trapping Rain Water][56]|[C++](56. Trapping Rain Water/solution.h)|2014/12/9|Hard
|[Palindrome Number][57]|[C++](57. Palindrome Number/solution.h)|2014/12/10|Easy
|[Search in Rotated Sorted Array][58]|[C++](58. Search in Rotated Sorted Array/solution.h)|2014/12/11|Hard
|[Valid Parentheses][59]|[C++](59. Valid Parentheses/solution.h)|2014/12/12|Easy
|[Flatten Binary Tree to Linked List][60]|[C++](60. Flatten Binary Tree to Linked List/solution.h)|2014/12/13|Medium
|[Longest Consecutive Sequence][61]|[C++](61. Longest Consecutive Sequence/solution.h)|2014/12/14|Hard
|[Unique Paths II][62]|[C++](62. Unique Paths II/solution.h)|2014/12/15|Medium
|[Subsets][63]|[C++](63. Subsets/solution.h)|2014/12/16|Medium
|[Valid Sudoku][64]|[C++](64. Valid Sudoku/solution.h)|2014/12/17|Easy
|[Unique Binary Search Trees II][65]|[C++](65. Unique Binary Search Trees II/solution.h)|2014/12/18|Medium
|[Convert Sorted List to Binary Search Tree][66]|[C++](66. Convert Sorted List to Binary Search Tree/solution.h)|2014/12/19|Medium
|[Search for a Range][67]|[C++](67. Search for a Range/solution.h)|2014/12/20|Medium
|[Jump Game][68]|[C++](68. Jump Game/solution.h)|2014/12/21|Medium
|[Count and Say][69]|[C++](69. Count and Say/solution.h)|2014/12/22|Easy
|[Longest Common Prefix][70]|[C++](70. Longest Common Prefix/solution.h)|2014/12/23|Easy
|[Subsets II][71]|[C++](71. Subsets II/solution.h)|2014/12/24|Medium
|[Partition List][72]|[C++](72. Partition List/solution.h)|2014/12/25|Medium
|[3Sum Closest][73]|[C++](73. 3Sum Closest/solution.h)|2014/12/26|Medium
|[Path Sum II][74]|[C++](74. Path Sum II/solution.h)|2014/12/27|Medium
|[Combination Sum][75]|[C++](75. Combination Sum/solution.h)|2014/12/28|Medium
|[Triangle][76]|[C++](76. Triangle/solution.h)|2014/12/29|Medium
|[Construct Binary Tree from Inorder and Postorder Traversal][77]|[C++](77. Construct Binary Tree from Inorder and Postorder Traversal/solution.h)|2014/12/30|Medium
|[Binary Tree Zigzag Level Order Traversal][78]|[C++](78. Binary Tree Zigzag Level Order Traversal/solution.h)|2014/12/31|Medium
|[Construct Binary Tree from Preorder and Inorder Traversal][79]|[C++](79. Construct Binary Tree from Preorder and Inorder Traversal/solution.h)|2015/1/1|Medium
|[Letter Combinations of a Phone Number][80]|[C++](80. Letter Combinations of a Phone Number/solution.h)|2015/1/2|Medium
|[Reverse Linked List II][81]|[C++](81. Reverse Linked List II/solution.h)|2015/1/3|Medium
|[Pow(x, n)][82]|[C++](82. Pow(x, n)/solution.h)|2015/1/4|Medium
|[N-Queens][83]|[C++](83. N-Queens/solution.h)|2015/1/5|Hard
|[Gas Station][84]|[C++](84. Gas Station/solution.h)|2015/1/6|Medium
|[Palindrome Partitioning][85]|[C++](85. Palindrome Partitioning/solution.h)|2015/1/7|Medium
|[Validate Binary Search Tree][86]|[C++](86. Validate Binary Search Tree/solution.h)|2015/1/8|Medium
|[Add Binary][87]|[C++](87. Add Binary/solution.h)|2015/1/9|Easy
|[Edit Distance][88]|[C++](88. Edit Distance/solution.h)|2015/1/10|Hard
|[Next Permutation][89]|[C++](89. Next Permutation/solution.h)|2015/1/11|Medium
|[Insertion Sort List][90]|[C++](90. Insertion Sort List/solution.h)|2015/1/12|Medium
|[Reverse Nodes in k-Group][91]|[C++](91. Reverse Nodes in k-Group/solution.h)|2015/1/13|Hard
|[Distinct Subsequences][92]|[C++](92. Distinct Subsequences/solution.h)|2015/1/14|Hard
|[Permutations II][93]|[C++](93. Permutations II/solution.h)|2015/1/15|Hard
|[Remove Duplicates from Sorted List II][94]|[C++](94. Remove Duplicates from Sorted List II/solution.h)|2015/1/16|Medium
|[Jump Game II][95]|[C++](95. Jump Game II/solution.h)|2015/1/17|Hard
|[Combination Sum II][96]|[C++](96. Combination Sum II/solution.h)|2015/1/18|Medium
|[Anagrams][97]|[C++](97. Anagrams/solution.h)|2015/1/19|Medium
|[Recover Binary Search Tree][98]|[C++](98. Recover Binary Search Tree/solution.h)|2015/1/20|Hard
|[ZigZag Conversion][99]|[C++](99. ZigZag Conversion/solution.h)|2015/1/21|Easy
|[Copy List with Random Pointer][100]|[C++](100. Copy List with Random Pointer/solution.h)|2015/1/22|Hard
|[Clone Graph][101]|[C++](101. Clone Graph/solution.h)|2015/1/23|Medium
|[Add Two Numbers][102]|[C++](102. Add Two Numbers/solution.h)|2015/1/24|Medium
|[Scramble String][103]|[C++](103. Scramble String/solution.h)|2015/1/25|Hard
|[Valid Palindrome][104]|[C++](104. Valid Palindrome/solution.h)|2015/1/26|Easy
|[First Missing Positive][105]|[C++](105. First Missing Positive/solution.h)|2015/1/27|Hard
|[Best Time to Buy and Sell Stock III][106]|[C++](106. Best Time to Buy and Sell Stock III/solution.h)|2015/1/28|Hard
|[Sqrt(x)][107]|[C++](107. Sqrt(x)/solution.h)|2015/1/29|Medium
|[Permutation Sequence][108]|[C++](108. Permutation Sequence/solution.h)|2015/1/30|Medium
|[Longest Substring Without Repeating Characters][109]|[C++](109. Longest Substring Without Repeating Characters/solution.h)|2015/1/31|Medium
|[Rotate List][110]|[C++](110. Rotate List/solution.h)|2015/2/1|Medium
|[Implement strStr()][111]|[C++](111. Implement strStr()/solution.h)|2015/2/2|Easy
|[4Sum][112]|[C++](112. 4Sum/solution.h)|2015/2/3|Medium
|[Maximal Rectangle][113]|[C++](113. Maximal Rectangle/solution.h)|2015/2/4|Hard
|[Largest Rectangle in Histogram][114]|[C++](114. Largest Rectangle in Histogram/solution.h)|2015/2/5|Hard
|[Merge k Sorted Lists][115]|[C++](115. Merge k Sorted Lists/solution.h)|2015/2/6|Hard
|[Word Break][116]|[C++](116. Word Break/solution.h)|2015/2/7|Medium
|[Merge Intervals][117]|[C++](117. Merge Intervals/solution.h)|2015/2/8|Hard
|[Sudoku Solver][118]|[C++](118. Sudoku Solver/solution.h)|2015/2/9|Hard
|[Longest Palindromic Substring][119]|[C++](119. Longest Palindromic Substring/solution.h)|2015/2/10|Medium
|[Insert Interval][120]|[C++](120. Insert Interval/solution.h)|2015/2/11|Hard
|[Spiral Matrix][121]|[C++](121. Spiral Matrix/solution.h)|2015/2/12|Medium
|[Sort List][122]|[C++](122. Sort List/solution.h)|2015/2/13|Medium
|[Restore IP Addresses][123]|[C++](123. Restore IP Addresses/solution.h)|2015/2/14|Medium
|[Multiply Strings][124]|[C++](124. Multiply Strings/solution.h)|2015/2/15|Medium
|[Reorder List][125]|[C++](125. Reorder List/solution.h)|2015/2/16|Medium
|[Binary Tree Maximum Path Sum][126]|[C++](126. Binary Tree Maximum Path Sum/solution.h)|2015/2/17|Hard
|[Regular Expression Matching][127]|[C++](127. Regular Expression Matching/solution.h)|2015/2/18|Hard
|[Simplify Path][128]|[C++](128. Simplify Path/solution.h)|2015/2/19|Medium
|[Word Search][129]|[C++](129. Word Search/solution.h)|2015/2/20|Medium
|[Evaluate Reverse Polish Notation][130]|[C++](130. Evaluate Reverse Polish Notation/solution.h)|2015/2/21|Medium
|[Longest Valid Parentheses][131]|[C++](131. Longest Valid Parentheses/solution.h)|2015/2/22|Hard
|[Interleaving String][132]|[C++](132. Interleaving String/solution.h)|2015/2/23|Hard
|[Candy][133]|[C++](133. Candy/solution.h)|2015/2/24|Hard
|[Find Minimum in Rotated Sorted Array II][134]|[C++](134. Find Minimum in Rotated Sorted Array II/solution.h)|2015/2/25|Hard
|[Word Ladder][135]|[C++](135. Word Ladder/solution.h)|2015/2/26|Medium
|[Two Sum][136]|[C++](136. Two Sum/solution.h)|2015/2/27|Medium
|[Palindrome Partitioning II][137]|[C++](137. Palindrome Partitioning II/solution.h)|2015/2/28|Hard
|[Minimum Window Substring][138]|[C++](138. Minimum Window Substring/solution.h)|2015/3/1|Hard
|[Substring with Concatenation of All Words][139]|[C++](139. Substring with Concatenation of All Words/solution.h)|2015/3/2|Hard
|[Median of Two Sorted Arrays][140]|[C++](140. Median of Two Sorted Arrays/solution.h)|2015/3/3|Hard
|[3Sum][141]|[C++](141. 3Sum/solution.h)|2015/3/4|Medium
|[Divide Two Integers][142]|[C++](142. Divide Two Integers/solution.h)|2015/3/5|Medium
|[Word Break II][143]|[C++](143. Word Break II/solution.h)|2015/3/6|Hard
|[Decode Ways][144]|[C++](144. Decode Ways/solution.h)|2015/3/7|Medium
|[Maximum Product Subarray][145]|[C++](145. Maximum Product Subarray/solution.h)|2015/3/8|Medium
|[String to Integer (atoi)][146]|[C++](146. String to Integer (atoi)/solution.h)|2015/3/9|Easy
|[Wildcard Matching][147]|[C++](147. Wildcard Matching/solution.h)|2015/3/10|Hard
|[Surrounded Regions][148]|[C++](148. Surrounded Regions/solution.h)|2015/3/11|Medium
|[Reverse Words in a String][149]|[C++](149. Reverse Words in a String/solution.h)|2015/3/12|Medium
|[LRU Cache][150]|[C++](150. LRU Cache/solution.h)|2015/3/13|Hard
|[Text Justification][151]|[C++](151. Text Justification/solution.h)|2015/3/14|Hard
|[Word Ladder II][152]|[C++](152. Word Ladder II/solution.h)|2015/3/15|Hard
|[Valid Number][153]|[C++](153. Valid Number/solution.h)|2015/3/16|Easy
|[Max Points on a Line][154]|[C++](154. Max Points on a Line/solution.h)|2015/3/17|Hard

[1]:https://oj.leetcode.com/problems/single-number/
[2]:https://oj.leetcode.com/problems/maximum-depth-of-binary-tree/
[3]:https://oj.leetcode.com/problems/same-tree/
[4]:https://oj.leetcode.com/problems/reverse-integer/
[5]:https://oj.leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/
[6]:https://oj.leetcode.com/problems/unique-binary-search-trees/
[7]:https://oj.leetcode.com/problems/linked-list-cycle/
[8]:https://oj.leetcode.com/problems/binary-tree-inorder-traversal/
[9]:https://oj.leetcode.com/problems/binary-tree-preorder-traversal/
[10]:https://oj.leetcode.com/problems/populating-next-right-pointers-in-each-node/
[11]:https://oj.leetcode.com/problems/search-insert-position/
[12]:https://oj.leetcode.com/problems/remove-duplicates-from-sorted-list/
[13]:https://oj.leetcode.com/problems/climbing-stairs/
[14]:https://oj.leetcode.com/problems/maximum-subarray/
[15]:https://oj.leetcode.com/problems/n-queens-ii/
[16]:https://oj.leetcode.com/problems/roman-to-integer/
[17]:https://oj.leetcode.com/problems/integer-to-roman/
[18]:https://oj.leetcode.com/problems/single-number-ii/
[19]:https://oj.leetcode.com/problems/merge-two-sorted-lists/
[20]:https://oj.leetcode.com/problems/remove-element/
[21]:https://oj.leetcode.com/problems/convert-sorted-array-to-binary-search-tree/
[22]:https://oj.leetcode.com/problems/balanced-binary-tree/
[23]:https://oj.leetcode.com/problems/swap-nodes-in-pairs/
[24]:https://oj.leetcode.com/problems/remove-duplicates-from-sorted-array/
[25]:https://oj.leetcode.com/problems/sort-colors/
[26]:https://oj.leetcode.com/problems/merge-sorted-array/
[27]:https://oj.leetcode.com/problems/symmetric-tree/
[28]:https://oj.leetcode.com/problems/gray-code/
[29]:https://oj.leetcode.com/problems/unique-paths/
[30]:https://oj.leetcode.com/problems/plus-one/
[31]:https://oj.leetcode.com/problems/generate-parentheses/
[32]:https://oj.leetcode.com/problems/pascals-triangle/
[33]:https://oj.leetcode.com/problems/container-with-most-water/
[34]:https://oj.leetcode.com/problems/permutations/
[35]:https://oj.leetcode.com/problems/rotate-image/
[36]:https://oj.leetcode.com/problems/search-a-2d-matrix/
[37]:https://oj.leetcode.com/problems/find-minimum-in-rotated-sorted-array/
[38]:https://oj.leetcode.com/problems/minimum-path-sum/
[39]:https://oj.leetcode.com/problems/best-time-to-buy-and-sell-stock/
[40]:https://oj.leetcode.com/problems/binary-tree-level-order-traversal-ii/
[41]:https://oj.leetcode.com/problems/search-in-rotated-sorted-array-ii/
[42]:https://oj.leetcode.com/problems/binary-tree-postorder-traversal/
[43]:https://oj.leetcode.com/problems/linked-list-cycle-ii/
[44]:https://oj.leetcode.com/problems/set-matrix-zeroes/
[45]:https://oj.leetcode.com/problems/spiral-matrix-ii/
[46]:https://oj.leetcode.com/problems/path-sum/
{'fraction_non_alphanumeric': 0.2188689423682081, 'fraction_numerical': 0.11520364431923757, 'mean_word_length': 6.089016358614829, 'pattern_counts': {'":': 0, '<': 3, '<?xml version=': 0, '>': 3, 'https://': 92, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '4749252', 'n_tokens_mistral': 16178, 'n_tokens_neox': 12991, 'n_words': 2166}