|
22 | 22 | *[101. Symmetric Tree](https://leetcode.com/problems/symmetric-tree/) -[Solution](./Easy/101-symmetricTree.js) |
23 | 23 | *[102. Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/) -[Solution](./Easy/102-binaryTreeLevelOrder.js) |
24 | 24 | *[104. Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/) -[Solution](./Easy/104-maxDepth.js) |
| 25 | +*[110. Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree/) -[Solution](./Easy/110-balancedBinaryTree.js) |
| 26 | +*[111. Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree/) -[Solution](./Easy/111-minimumDepthBinaryTree.js) |
| 27 | +*[112. Path Sum](https://leetcode.com/problems/path-sum/) -[Solution](./Easy/112-pathSum.js) |
| 28 | +*[118. Pascal's Triangle](https://leetcode.com/problems/pascals-triangle/) -[Solution](./Easy/118-pascalTriangle.js) |
| 29 | +*[119. Pascal's Triangle II](https://leetcode.com/problems/pascals-triangle-ii/) -[Solution](./Easy/119-pascalTriangleII.js) |
| 30 | +*[125. Valid Palindrome](https://leetcode.com/problems/valid-palindrome/) -[Solution](./Easy/125-validPalindrome.js) |
| 31 | +*[160. Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists/) -[Solution](./Easy/160-IntersectionofTwoLinkedLists.js) |
| 32 | +*[165. Compare Version Numbers](https://leetcode.com/problems/compare-version-numbers/) -[Solution](./Easy/165-compareVersionNumbers.js) |
25 | 33 | *[169. Majority Element](https://leetcode.com/problems/majority-element/) -[Solution](./Easy/169-majorityElement.js) |
| 34 | +*[172. Factorial Trailing Zeroes](https://leetcode.com/problems/factorial-trailing-zeroes/) -[Solution](./Easy/172-factorialTrailingZeroes.js) |
| 35 | +*[190. Reverse Bits](https://leetcode.com/problems/reverse-bits/) -[Solution](./Easy/190-reverseBits.js) |
| 36 | +*[191. Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/) -[Solution](./Easy/191-numerOneBits.js) |
| 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.js) |
| 42 | +*[206.]() -[Solution](./Easy/206-reversedLinkedList.js.js) |
| 43 | +*[217.]() -[Solution](./Easy/217-containsDuplicate.js.js) |
| 44 | +*[219]() -[Solution](./Easy/219-containsDuplicateII.js.js) |
| 45 | +*[223]() -[Solution](./Easy/223-rectangleArea.js.js) |
| 46 | +*[225]() -[Solution](./Easy/225-stackUsingQueues.js.js) |
| 47 | +*[226]() -[Solution](./Easy/226-invertBinaryTree.js.js) |
| 48 | +*[228]() -[Solution](./Easy/228-summaryRanges.js.js) |
| 49 | +*[231]() -[Solution](./Easy/231-powerOfTwo.js.js) |
| 50 | +*[232]() -[Solution](./Easy/232-implementQueueUsingStack.js.js) |
| 51 | +*[234]() -[Solution](./Easy/234-palindromeLinkedList.js.js) |
| 52 | +*[235]() -[Solution](./Easy/235-lcaBST.js.js) |
| 53 | +*[237]() -[Solution](./Easy/237-deleteLinkedListNode.js.js) |
| 54 | +*[242]() -[Solution](./Easy/242-anagram.js.js) |
| 55 | +*[258]() -[Solution](./Easy/258-addDigits.js.js) |
| 56 | +*[263]() -[Solution](./Easy/263-uglyNumber.js.js) |
| 57 | +*[278]() -[Solution](./Easy/278-firstBadVersion.js.js) |
| 58 | +*[283]() -[Solution](./Easy/283-moveZeros.js.js) |
| 59 | +*[290]() -[Solution](./Easy/290-wordPattern.js.js) |
| 60 | +*[299]() -[Solution](./Easy/299-bullsandCows.js.js) |
| 61 | +*[303]() -[Solution](./Easy/303-rangeSumQuery.js.js) |
| 62 | +*[328]() -[Solution](./Easy/328-oddevenLinkedList.js.js) |
26 | 63 |
|
27 | 64 | #####Medium |
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) |
| 65 | +*[3. Longest Substring Without Repeating Characters](https://oj.leetcode.com/problems/longest-substring-without-repeating-characters/) -[Solution](./Medium/3-lengthOfLongestSubstring.js) |
| 66 | +*[35. Search Insert Position Characters](https://oj.leetcode.com/problems/search-insert-position/) -[Solution](./Medium/35-searchInsert.js) |
| 67 | +*[53]() -[Solution](./Easy/53-maximumSubarray.js.js) |
| 68 | +*[94]() -[Solution](./Easy/94-binaryTreeInorder.js.js) |
| 69 | +*[96]() -[Solution](./Easy/96-uniqueBinarySearchTrees.js.js) |
| 70 | +*[108]() -[Solution](./Easy/108-convertSortedArraytoBST.js.js) |
| 71 | +*[116]() -[Solution](./Easy/116-PopulatingNextRightPointersinEachNode.js.js) |
| 72 | +*[121]() -[Solution](./Easy/121-bestTimeToBuySellStock.js.js) |
| 73 | +*[122]() -[Solution](./Easy/122-bestTimeToBuySellStockII.js.js) |
| 74 | +*[136]() -[Solution](./Easy/136-singleNumber.js.js) |
| 75 | +*[141]() -[Solution](./Easy/141-linkedListCycle.js.js) |
| 76 | +*[144]() -[Solution](./Easy/144-binaryTreePreorder.js.js) |
| 77 | +*[153]() -[Solution](./Easy/153-findMinimumInRotatedSortedArray.js.js) |
| 78 | +*[230]() -[Solution](./Easy/230-kthSmallestElementinBST.js.js) |
| 79 | +*[238]() -[Solution](./Easy/238-productExceptSelf.js.js) |
| 80 | +*[260]() -[Solution](./Easy/260-singleNumberIII.js.js) |
| 81 | +*[268]() -[Solution](./Easy/268-missingNumber.js.js) |
| 82 | +*[318]() -[Solution](./Easy/318-maximumProductWordLengths.js.js) |
| 83 | +*[319]() -[Solution](./Easy/319-bulbSwitcher.js.js) |