|
2 | 2 | * Tried to use optimal solutions as much as I can. Most solutions are from the LeetCode community. |
3 | 3 | * Written in[Airbnb JavaScript] (https://github.com/airbnb/javascript) style. |
4 | 4 | * A work in progress. |
5 | | -*You are very welcome to contribute your better solutions. |
| 5 | +*If you find something wrong, or the code is not good, you are very welcome to contribute your better solutions. |
6 | 6 |
|
7 | 7 | #####Easy |
8 | 8 | *[7. Reverse Integer](https://oj.leetcode.com/problems/reverse-integer/) -[Solution](./Easy/7-reverseInteger.js) |
|
35 | 35 | *[190. Reverse Bits](https://leetcode.com/problems/reverse-bits/) -[Solution](./Easy/190-reverseBits.js) |
36 | 36 | *[191. Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/) -[Solution](./Easy/191-numerOneBits.js) |
37 | 37 | *[198. House Robber](https://leetcode.com/problems/house-robber/) -[Solution](./Easy/198-houseRobber.js) |
38 | | -*[202.]() -[Solution](./Easy/202-happyNumber.js) |
39 | | -*[203.]() -[Solution](./Easy/203-removeLinkedListElements.js) |
40 | | -*[204.]() -[Solution](./Easy/204-countPrimes.js) |
41 | | -*[205.]() -[Solution](./Easy/205-isomorphicStrings.js) |
42 | | -*[206.]() -[Solution](./Easy/206-reversedLinkedList.js) |
43 | | -*[217.]() -[Solution](./Easy/217-containsDuplicate.js) |
44 | | -*[219]() -[Solution](./Easy/219-containsDuplicateII.js) |
45 | | -*[223]() -[Solution](./Easy/223-rectangleArea.js) |
46 | | -*[225]() -[Solution](./Easy/225-stackUsingQueues.js) |
47 | | -*[226]() -[Solution](./Easy/226-invertBinaryTree.js) |
48 | | -*[228]() -[Solution](./Easy/228-summaryRanges.js) |
49 | | -*[231]() -[Solution](./Easy/231-powerOfTwo.js) |
50 | | -*[232]() -[Solution](./Easy/232-implementQueueUsingStack.js) |
51 | | -*[234]() -[Solution](./Easy/234-palindromeLinkedList.js) |
52 | | -*[235]() -[Solution](./Easy/235-lcaBST.js) |
53 | | -*[237]() -[Solution](./Easy/237-deleteLinkedListNode.js) |
54 | | -*[242]() -[Solution](./Easy/242-anagram.js) |
55 | | -*[258]() -[Solution](./Easy/258-addDigits.js) |
56 | | -*[263]() -[Solution](./Easy/263-uglyNumber.js) |
57 | | -*[278]() -[Solution](./Easy/278-firstBadVersion.js) |
58 | | -*[283]() -[Solution](./Easy/283-moveZeros.js) |
59 | | -*[290]() -[Solution](./Easy/290-wordPattern.js) |
60 | | -*[299]() -[Solution](./Easy/299-bullsandCows.js) |
61 | | -*[303]() -[Solution](./Easy/303-rangeSumQuery.js) |
62 | | -*[328]() -[Solution](./Easy/328-oddevenLinkedList.js) |
| 38 | +*[202.Happy Number](https://leetcode.com/problems/happy-number/) -[Solution](./Easy/202-happyNumber.js) |
| 39 | +*[203.Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements/) -[Solution](./Easy/203-removeLinkedListElements.js) |
| 40 | +*[204.Count Primes](https://leetcode.com/problems/count-primes/) -[Solution](./Easy/204-countPrimes.js) |
| 41 | +*[205.Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings/) -[Solution](./Easy/205-isomorphicStrings.js) |
| 42 | +*[206.Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/) -[Solution](./Easy/206-reversedLinkedList.js) |
| 43 | +*[217.Contains Duplicate](https://leetcode.com/problems/contains-duplicate/) -[Solution](./Easy/217-containsDuplicate.js) |
| 44 | +*[219. Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii/) -[Solution](./Easy/219-containsDuplicateII.js) |
| 45 | +*[223. Rectangle Area](https://leetcode.com/problems/rectangle-area/) -[Solution](./Easy/223-rectangleArea.js) |
| 46 | +*[225. Implement Stack using Queues](https://leetcode.com/problems/implement-stack-using-queues/) -[Solution](./Easy/225-stackUsingQueues.js) |
| 47 | +*[226. Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/) -[Solution](./Easy/226-invertBinaryTree.js) |
| 48 | +*[228. Summary Ranges](https://leetcode.com/problems/summary-ranges/) -[Solution](./Easy/228-summaryRanges.js) |
| 49 | +*[231. Power of Two](https://leetcode.com/problems/power-of-two/) -[Solution](./Easy/231-powerOfTwo.js) |
| 50 | +*[232. Implement Queue using Stacks](https://leetcode.com/problems/implement-queue-using-stacks/) -[Solution](./Easy/232-implementQueueUsingStack.js) |
| 51 | +*[234. Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list/) -[Solution](./Easy/234-palindromeLinkedList.js) |
| 52 | +*[235. Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/) -[Solution](./Easy/235-lcaBST.js) |
| 53 | +*[237. Delete Node in a Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list/) -[Solution](./Easy/237-deleteLinkedListNode.js) |
| 54 | +*[242. Valid Anagram](https://leetcode.com/problems/valid-anagram/) -[Solution](./Easy/242-anagram.js) |
| 55 | +*[258. Add Digits](https://leetcode.com/problems/add-digits/) -[Solution](./Easy/258-addDigits.js) |
| 56 | +*[263. Ugly Number](https://leetcode.com/problems/ugly-number/) -[Solution](./Easy/263-uglyNumber.js) |
| 57 | +*[278. First Bad Version](https://leetcode.com/problems/first-bad-version/) -[Solution](./Easy/278-firstBadVersion.js) |
| 58 | +*[283. Move Zeroes](https://leetcode.com/problems/move-zeroes/) -[Solution](./Easy/283-moveZeros.js) |
| 59 | +*[290. Word Pattern](https://leetcode.com/problems/word-pattern/) -[Solution](./Easy/290-wordPattern.js) |
| 60 | +*[299. Bulls and Cows](https://leetcode.com/problems/bulls-and-cows/) -[Solution](./Easy/299-bullsandCows.js) |
| 61 | +*[303. Range Sum Query - Immutable](https://leetcode.com/problems/range-sum-query-immutable/) -[Solution](./Easy/303-rangeSumQuery.js) |
| 62 | +*[328. Odd Even Linked List](https://leetcode.com/problems/odd-even-linked-list/) -[Solution](./Easy/328-oddevenLinkedList.js) |
63 | 63 |
|
64 | 64 | #####Medium |
65 | 65 | *[3. Longest Substring Without Repeating Characters](https://oj.leetcode.com/problems/longest-substring-without-repeating-characters/) -[Solution](./Medium/3-lengthOfLongestSubstring.js) |
|