|
1 | | -####LeetCode Solutions in JavaScript |
| 1 | +####LeetCode Solutions in JavaScript |
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 | | -* If you find something wrong, or thecode is not good, you are very welcome to contribute your better solutions. |
| 5 | +* If you find something wrong or thecomplexity 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) |
|
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) |
66 | 66 | *[35. Search Insert Position Characters](https://oj.leetcode.com/problems/search-insert-position/) -[Solution](./Medium/35-searchInsert.js) |
67 | | -*[53]() -[Solution](./Medium/53-maximumSubarray.js) |
68 | | -*[94]() -[Solution](./Medium/94-binaryTreeInorder.js) |
69 | | -*[96]() -[Solution](./Medium/96-uniqueBinarySearchTrees.js) |
70 | | -*[108]() -[Solution](./Medium/108-convertSortedArraytoBST.js) |
71 | | -*[116]() -[Solution](./Medium/116-PopulatingNextRightPointersinEachNode.js) |
72 | | -*[121]() -[Solution](./Medium/121-bestTimeToBuySellStock.js) |
73 | | -*[122]() -[Solution](./Medium/122-bestTimeToBuySellStockII.js) |
74 | | -*[136]() -[Solution](./Medium/136-singleNumber.js) |
75 | | -*[141]() -[Solution](./Medium/141-linkedListCycle.js) |
76 | | -*[144]() -[Solution](./Medium/144-binaryTreePreorder.js) |
77 | | -*[153]() -[Solution](./Medium/153-findMinimumInRotatedSortedArray.js) |
78 | | -*[230]() -[Solution](./Medium/230-kthSmallestElementinBST.js) |
79 | | -*[238]() -[Solution](./Medium/238-productExceptSelf.js) |
80 | | -*[260]() -[Solution](./Medium/260-singleNumberIII.js) |
81 | | -*[268]() -[Solution](./Medium/268-missingNumber.js) |
82 | | -*[318]() -[Solution](./Medium/318-maximumProductWordLengths.js) |
83 | | -*[319]() -[Solution](./Medium/319-bulbSwitcher.js) |
| 67 | +*[53. Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) -[Solution](./Medium/53-maximumSubarray.js) |
| 68 | +*[94. Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal/) -[Solution](./Medium/94-binaryTreeInorder.js) |
| 69 | +*[96. Unique Binary Search Trees](https://leetcode.com/problems/unique-binary-search-trees/) -[Solution](./Medium/96-uniqueBinarySearchTrees.js) |
| 70 | +*[108. Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/) -[Solution](./Medium/108-convertSortedArraytoBST.js) |
| 71 | +*[116. Populating Next Right Pointers in Each Node](https://leetcode.com/problems/populating-next-right-pointers-in-each-node/) -[Solution](./Medium/116-PopulatingNextRightPointersinEachNode.js) |
| 72 | +*[121. Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) -[Solution](./Medium/121-bestTimeToBuySellStock.js) |
| 73 | +*[122. Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/) -[Solution](./Medium/122-bestTimeToBuySellStockII.js) |
| 74 | +*[136. Single Number](https://leetcode.com/problems/single-number/) -[Solution](./Medium/136-singleNumber.js) |
| 75 | +*[141. Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/) -[Solution](./Medium/141-linkedListCycle.js) |
| 76 | +*[144. Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal/) -[Solution](./Medium/144-binaryTreePreorder.js) |
| 77 | +*[153.Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/) -[Solution](./Medium/153-findMinimumInRotatedSortedArray.js) |
| 78 | +*[230. Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst/) -[Solution](./Medium/230-kthSmallestElementinBST.js) |
| 79 | +*[238. Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/) -[Solution](./Medium/238-productExceptSelf.js) |
| 80 | +*[260. Single Number III](https://leetcode.com/problems/single-number-iii/) -[Solution](./Medium/260-singleNumberIII.js) |
| 81 | +*[268. Missing Number](https://leetcode.com/problems/missing-number/) -[Solution](./Medium/268-missingNumber.js) |
| 82 | +*[318. Maximum Product of Word Lengths](https://leetcode.com/problems/maximum-product-of-word-lengths/) -[Solution](./Medium/318-maximumProductWordLengths.js) |
| 83 | +*[319. Bulb Switcher](https://leetcode.com/problems/bulb-switcher/) -[Solution](./Medium/319-bulbSwitcher.js) |