|
6 | 6 |
|
7 | 7 | #####Easy |
8 | 8 | *[7. Reverse Integer](https://oj.leetcode.com/problems/reverse-integer/) -[Solution](./Easy/7-reverseInteger.js) |
9 | | -*[8. String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi/) -[Solution](./Easy/8-stringToInteger.js) |
10 | | -*[9. Palindrome Number](https://leetcode.com/problems/palindrome-number/) -[Solution](./Easy/9-palindromeNumber.js) |
11 | | -*[14. Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/) -[Solution](./Easy/14-longestCommonPrefix.js) |
12 | | -*[19. Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/) -[Solution](./Easy/19-removeNthNodeFromEndofList.js) |
13 | | -*[21. Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/) -[Solution](./Easy/21-mergeSortedLists.js) |
14 | | -*[28. Implement strStr()](https://leetcode.com/problems/implement-strstr/) -[Solution](./Easy/28-implementstrStr.js) |
15 | | -*[38. Count and Say](https://leetcode.com/problems/count-and-say/) -[Solution](./Easy/38-countandSay.js) |
| 9 | +*[8. String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi/) -[Solution](./Easy/8-stringToInteger.js) |
| 10 | +*[9. Palindrome Number](https://leetcode.com/problems/palindrome-number/) -[Solution](./Easy/9-palindromeNumber.js) |
| 11 | +*[14. Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/) -[Solution](./Easy/14-longestCommonPrefix.js) |
| 12 | +*[19. Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/) -[Solution](./Easy/19-removeNthNodeFromEndofList.js) |
| 13 | +*[21. Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/) -[Solution](./Easy/21-mergeSortedLists.js) |
| 14 | +*[28. Implement strStr()](https://leetcode.com/problems/implement-strstr/) -[Solution](./Easy/28-implementstrStr.js) |
| 15 | +*[38. Count and Say](https://leetcode.com/problems/count-and-say/) -[Solution](./Easy/38-countandSay.js) |
| 16 | +*[66. Plus One](https://leetcode.com/problems/plus-one/) -[Solution](./Easy/66-plusOne.js) |
| 17 | +*[66. Add Binary](https://leetcode.com/problems/add-binary/) -[Solution](./Easy/67-addBinary.js) |
| 18 | +*[70. Climbing Stairs](https://leetcode.com/problems/climbing-stairs/) -[Solution](./Easy/70-climbChairs.js) |
| 19 | +*[83. Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list/) -[Solution](./Easy/83-removeDuplicatesFromSortedList.js) |
| 20 | +*[88. Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/) -[Solution](./Easy/88-mergeSortedArray.js) |
| 21 | +*[100. Same Tree](https://leetcode.com/problems/same-tree/) -[Solution](./Easy/100-sameTree.js) |
| 22 | +*[101. Symmetric Tree](https://leetcode.com/problems/symmetric-tree/) -[Solution](./Easy/101-symmetricTree.js) |
| 23 | +*[102. Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/) -[Solution](./Easy/102-binaryTreeLevelOrder.js) |
| 24 | +*[104. Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/) -[Solution](./Easy/104-maxDepth.js) |
| 25 | +*[169. Majority Element](https://leetcode.com/problems/majority-element/) -[Solution](./Easy/169-majorityElement.js) |
16 | 26 |
|
17 | 27 | #####Medium |
18 | | -*[3. Longest Substring Without Repeating Characters](https://oj.leetcode.com/problems/longest-substring-without-repeating-characters/) -[Solution](./Easy/3-lengthOfLongestSubstring.js) |
19 | | -*[35. Search Insert Position Characters](https://oj.leetcode.com/problems/search-insert-position/) -[Solution](./Easy/35-searchInsert.js) |
| 28 | +*[3. Longest Substring Without Repeating Characters](https://oj.leetcode.com/problems/longest-substring-without-repeating-characters/) -[Solution](./Easy/3-lengthOfLongestSubstring.js) |
| 29 | +*[35. Search Insert Position Characters](https://oj.leetcode.com/problems/search-insert-position/) -[Solution](./Easy/35-searchInsert.js) |