To host Java Solutions to problems from LintCode(http://LintCode.com). I Will try to revise the solutions once new problem or new testing case occurs.
| Squence | Problem | Level | Language |
|---|---|---|---|
| 0 | [2 Sum.java](https://github.com/shawnfan/LintCode/blob/master/Java/2 Sum.java) | Java | |
| 1 | [3 Sum Closest.java](https://github.com/shawnfan/LintCode/blob/master/Java/3 Sum Closest.java) | Java | |
| 2 | [3 Sum.java](https://github.com/shawnfan/LintCode/blob/master/Java/3 Sum.java) | Java | |
| 3 | [4 Sum.java](https://github.com/shawnfan/LintCode/blob/master/Java/4 Sum.java) | Java | |
| 4 | A+B.java | Java | |
| 5 | [Add Binary.java](https://github.com/shawnfan/LintCode/blob/master/Java/Add Binary.java) | Java | |
| 6 | Anagrams.java | Java | |
| 7 | [Balanced Binary Tree.java](https://github.com/shawnfan/LintCode/blob/master/Java/Balanced Binary Tree.java) | Java | |
| 8 | [Best Time to Buy and Sell Stock I.java](https://github.com/shawnfan/LintCode/blob/master/Java/Best Time to Buy and Sell Stock I.java) | Java | |
| 9 | [Best Time to Buy and Sell Stock II.java](https://github.com/shawnfan/LintCode/blob/master/Java/Best Time to Buy and Sell Stock II.java) | Java | |
| 10 | [Best Time to Buy and Sell Stock III .java](https://github.com/shawnfan/LintCode/blob/master/Java/Best Time to Buy and Sell Stock III .java) | Java | |
| 11 | [Binary Search.java](https://github.com/shawnfan/LintCode/blob/master/Java/Binary Search.java) | Java | |
| 12 | [Binary Tree Level Order Traversal II.java](https://github.com/shawnfan/LintCode/blob/master/Java/Binary Tree Level Order Traversal II.java) | Java | |
| 13 | [Binary Tree Level Order Traversal.java](https://github.com/shawnfan/LintCode/blob/master/Java/Binary Tree Level Order Traversal.java) | Java | |
| 14 | [Binary Tree Maximum Path Sum.java](https://github.com/shawnfan/LintCode/blob/master/Java/Binary Tree Maximum Path Sum.java) | Java | |
| 15 | [Binary Tree Preorder Traversal.java](https://github.com/shawnfan/LintCode/blob/master/Java/Binary Tree Preorder Traversal.java) | Java | |
| 16 | [Binary Tree Zigzag Level Order Traversal.java](https://github.com/shawnfan/LintCode/blob/master/Java/Binary Tree Zigzag Level Order Traversal.java) | Java | |
| 17 | BinaryTreeInorderTraversal.java | Java | |
| 18 | BinaryTreePostorderTraversal.java | Java | |
| 19 | [Climbing Stairs.java](https://github.com/shawnfan/LintCode/blob/master/Java/Climbing Stairs.java) | Java | |
| 20 | [Clone Graph.java](https://github.com/shawnfan/LintCode/blob/master/Java/Clone Graph.java) | Java | |
| 21 | [Combination Sum II.java](https://github.com/shawnfan/LintCode/blob/master/Java/Combination Sum II.java) | Java | |
| 22 | [Combination Sum.java](https://github.com/shawnfan/LintCode/blob/master/Java/Combination Sum.java) | Java | |
| 23 | Combinations.java | Java | |
| 24 | [Compare Strings.java](https://github.com/shawnfan/LintCode/blob/master/Java/Compare Strings.java) | Java | |
| 25 | [Construct Binary Tree from Inorder and Postorder Traversal.java](https://github.com/shawnfan/LintCode/blob/master/Java/Construct Binary Tree from Inorder and Postorder Traversal.java) | Java | |
| 26 | [Construct Binary Tree from Inorder and Preorder Traversal.java](https://github.com/shawnfan/LintCode/blob/master/Java/Construct Binary Tree from Inorder and Preorder Traversal.java) | Java | |
| 27 | [Convert Integer A to Integer B.java](https://github.com/shawnfan/LintCode/blob/master/Java/Convert Integer A to Integer B.java) | Java | |
| 28 | [Convert Sorted Array to Binary Search Tree With Minimal Height.java](https://github.com/shawnfan/LintCode/blob/master/Java/Convert Sorted Array to Binary Search Tree With Minimal Height.java) | Java | |
| 29 | [Convert Sorted List to Binary Search Tree.java](https://github.com/shawnfan/LintCode/blob/master/Java/Convert Sorted List to Binary Search Tree.java) | Java | |
| 30 | [Copy List with Random Pointer.java](https://github.com/shawnfan/LintCode/blob/master/Java/Copy List with Random Pointer.java) | Java | |
| 31 | [Count 1 in Binary.java](https://github.com/shawnfan/LintCode/blob/master/Java/Count 1 in Binary.java) | Java | |
| 32 | [Count and Say.java](https://github.com/shawnfan/LintCode/blob/master/Java/Count and Say.java) | Java | |
| 33 | [Delete Node in the Middle of Singly Linked List.java](https://github.com/shawnfan/LintCode/blob/master/Java/Delete Node in the Middle of Singly Linked List.java) | Java | |
| 34 | [Easy Reverse Linked List.java](https://github.com/shawnfan/LintCode/blob/master/Java/Easy Reverse Linked List.java) | Java | |
| 35 | Fibonacci.java | Java | |
| 36 | [Find a Peak.java](https://github.com/shawnfan/LintCode/blob/master/Java/Find a Peak.java) | Java | |
| 37 | [Find Minimum in Rotated Sorted Array II.java](https://github.com/shawnfan/LintCode/blob/master/Java/Find Minimum in Rotated Sorted Array II.java) | Java | |
| 38 | [Find Minimum in Rotated Sorted Array.java](https://github.com/shawnfan/LintCode/blob/master/Java/Find Minimum in Rotated Sorted Array.java) | Java | |
| 39 | [Find the Connected Component in the Undirected Graph.java](https://github.com/shawnfan/LintCode/blob/master/Java/Find the Connected Component in the Undirected Graph.java) | Java | |
| 40 | [First Bad Version.java](https://github.com/shawnfan/LintCode/blob/master/Java/First Bad Version.java) | Java | |
| 41 | [First Missing Positive.java](https://github.com/shawnfan/LintCode/blob/master/Java/First Missing Positive.java) | Java | |
| 42 | [Hash Function.java](https://github.com/shawnfan/LintCode/blob/master/Java/Hash Function.java) | Java | |
| 43 | [Insert Interval.java](https://github.com/shawnfan/LintCode/blob/master/Java/Insert Interval.java) | Java | |
| 44 | [Insert Node in a Binary Search Tree .java](https://github.com/shawnfan/LintCode/blob/master/Java/Insert Node in a Binary Search Tree .java) | Java | |
| 45 | [Insertion Sort List.java](https://github.com/shawnfan/LintCode/blob/master/Java/Insertion Sort List.java) | Java | |
| 46 | [Invert Binary Tree.java](https://github.com/shawnfan/LintCode/blob/master/Java/Invert Binary Tree.java) | Java | |
| 47 | [Jump Game II.java](https://github.com/shawnfan/LintCode/blob/master/Java/Jump Game II.java) | Java | |
| 48 | [Jump Game.java](https://github.com/shawnfan/LintCode/blob/master/Java/Jump Game.java) | Java | |
| 49 | [Kth Largest Element.java](https://github.com/shawnfan/LintCode/blob/master/Java/Kth Largest Element.java) | Java | |
| 50 | [Largest Number.java](https://github.com/shawnfan/LintCode/blob/master/Java/Largest Number.java) | Java | |
| 51 | [Largest Rectangle in Histogram.java](https://github.com/shawnfan/LintCode/blob/master/Java/Largest Rectangle in Histogram.java) | Java | |
| 52 | [Length of Last Word.java](https://github.com/shawnfan/LintCode/blob/master/Java/Length of Last Word.java) | Java | |
| 53 | [Linked List Cycle.java](https://github.com/shawnfan/LintCode/blob/master/Java/Linked List Cycle.java) | Java | |
| 54 | [Longest Common Prefix.java](https://github.com/shawnfan/LintCode/blob/master/Java/Longest Common Prefix.java) | Java | |
| 55 | [Longest Common Subsequence.java](https://github.com/shawnfan/LintCode/blob/master/Java/Longest Common Subsequence.java) | Java | |
| 56 | [Longest Common Substring.java](https://github.com/shawnfan/LintCode/blob/master/Java/Longest Common Substring.java) | Java | |
| 57 | [Longest Consecutive Sequence.java](https://github.com/shawnfan/LintCode/blob/master/Java/Longest Consecutive Sequence.java) | Java | |
| 58 | [Longest Increasing Continuous subsequence.java](https://github.com/shawnfan/LintCode/blob/master/Java/Longest Increasing Continuous subsequence.java) | Java | |
| 59 | [Longest Words.java](https://github.com/shawnfan/LintCode/blob/master/Java/Longest Words.java) | Java | |
| 60 | [Lowest Common Ancestor.java](https://github.com/shawnfan/LintCode/blob/master/Java/Lowest Common Ancestor.java) | Java | |
| 61 | [Majority Number II.java](https://github.com/shawnfan/LintCode/blob/master/Java/Majority Number II.java) | Java | |
| 62 | [Majority Number III.java](https://github.com/shawnfan/LintCode/blob/master/Java/Majority Number III.java) | Java | |
| 63 | [Majority Number.java](https://github.com/shawnfan/LintCode/blob/master/Java/Majority Number.java) | Java | |
| 64 | [Maximum Depth of Binary Tree.java](https://github.com/shawnfan/LintCode/blob/master/Java/Maximum Depth of Binary Tree.java) | Java | |
| 65 | MaximumSubarray.java | Java | |
| 66 | MaximumSubarrayII.java | Java | |
| 67 | Median.java | Java | |
| 68 | [Merge Intervals.java](https://github.com/shawnfan/LintCode/blob/master/Java/Merge Intervals.java) | Java | |
| 69 | [Merge k Sorted Lists.java](https://github.com/shawnfan/LintCode/blob/master/Java/Merge k Sorted Lists.java) | Java | |
| 70 | [Merge Sorted Array .java](https://github.com/shawnfan/LintCode/blob/master/Java/Merge Sorted Array .java) | Java | |
| 71 | [Merge Sorted Array II.java](https://github.com/shawnfan/LintCode/blob/master/Java/Merge Sorted Array II.java) | Java | |
| 72 | [Merge Two Sorted List.java](https://github.com/shawnfan/LintCode/blob/master/Java/Merge Two Sorted List.java) | Java | |
| 73 | [Minimum Path Sum.java](https://github.com/shawnfan/LintCode/blob/master/Java/Minimum Path Sum.java) | Java | |
| 74 | [Minimum Subarray.java](https://github.com/shawnfan/LintCode/blob/master/Java/Minimum Subarray.java) | Java | |
| 75 | [Minimum Window Substring.java](https://github.com/shawnfan/LintCode/blob/master/Java/Minimum Window Substring.java) | Java | |
| 76 | MinimumDepthOfBinaryTree.java | Java | |
| 77 | NQueens.java | Java | |
| 78 | NQueensII.java | Java | |
| 79 | [Nth to Last Node in List.java](https://github.com/shawnfan/LintCode/blob/master/Java/Nth to Last Node in List.java) | Java | |
| 80 | [Number of Islands.java](https://github.com/shawnfan/LintCode/blob/master/Java/Number of Islands.java) | Java | |
| 81 | [Number Triangles.java](https://github.com/shawnfan/LintCode/blob/master/Java/Number Triangles.java) | Java | |
| 82 | [O(1) Check Power of 2.java](https://github.com/shawnfan/LintCode/blob/master/Java/O(1) Check Power of 2.java) | Java | |
| 83 | [Palindrome Partitioning II.java](https://github.com/shawnfan/LintCode/blob/master/Java/Palindrome Partitioning II.java) | Java | |
| 84 | [Palindrome Partitioning.java](https://github.com/shawnfan/LintCode/blob/master/Java/Palindrome Partitioning.java) | Java | |
| 85 | [Partition Array by Odd and Even.java](https://github.com/shawnfan/LintCode/blob/master/Java/Partition Array by Odd and Even.java) | Java | |
| 86 | [Partition Array.java](https://github.com/shawnfan/LintCode/blob/master/Java/Partition Array.java) | Java | |
| 87 | [Partition List.java](https://github.com/shawnfan/LintCode/blob/master/Java/Partition List.java) | Java | |
| 88 | Permutations.java | Java | |
| 89 | [Plus One.java](https://github.com/shawnfan/LintCode/blob/master/Java/Plus One.java) | Java | |
| 90 | [Product of Array Exclude Itself.java](https://github.com/shawnfan/LintCode/blob/master/Java/Product of Array Exclude Itself.java) | Java | |
| 91 | [Recover rotated array.java](https://github.com/shawnfan/LintCode/blob/master/Java/Recover rotated array.java) | Java | |
| 92 | Rehashing.java | Java | |
| 93 | [Remove Duplicates from Sorted Array.java](https://github.com/shawnfan/LintCode/blob/master/Java/Remove Duplicates from Sorted Array.java) | Java | |
| 94 | [Remove Duplicates from Sorted List II.java](https://github.com/shawnfan/LintCode/blob/master/Java/Remove Duplicates from Sorted List II.java) | Java | |
| 95 | [Remove Duplicates from Sorted List.java](https://github.com/shawnfan/LintCode/blob/master/Java/Remove Duplicates from Sorted List.java) | Java | |
| 96 | [Remove Nth Node From End of List.java](https://github.com/shawnfan/LintCode/blob/master/Java/Remove Nth Node From End of List.java) | Java | |
| 97 | [Reorder List.java](https://github.com/shawnfan/LintCode/blob/master/Java/Reorder List.java) | Java | |
| 98 | [Reverse Integer.java](https://github.com/shawnfan/LintCode/blob/master/Java/Reverse Integer.java) | Java | |
| 99 | [Reverse Linked List II .java](https://github.com/shawnfan/LintCode/blob/master/Java/Reverse Linked List II .java) | Java | |
| 100 | [Reverse Words in a String.java](https://github.com/shawnfan/LintCode/blob/master/Java/Reverse Words in a String.java) | Java | |
| 101 | [Rotate List.java](https://github.com/shawnfan/LintCode/blob/master/Java/Rotate List.java) | Java | |
| 102 | [Rotate String.java](https://github.com/shawnfan/LintCode/blob/master/Java/Rotate String.java) | Java | |
| 103 | [Search a 2D Matrix II.java](https://github.com/shawnfan/LintCode/blob/master/Java/Search a 2D Matrix II.java) | Java | |
| 104 | [Search a 2D Matrix.java](https://github.com/shawnfan/LintCode/blob/master/Java/Search a 2D Matrix.java) | Java | |
| 105 | [Search for a Range.java](https://github.com/shawnfan/LintCode/blob/master/Java/Search for a Range.java) | Java | |
| 106 | [Search Insert Position.java](https://github.com/shawnfan/LintCode/blob/master/Java/Search Insert Position.java) | Java | |
| 107 | [Search Range in Binary Search Tree .java](https://github.com/shawnfan/LintCode/blob/master/Java/Search Range in Binary Search Tree .java) | Java | |
| 108 | [Search Rotated Sorted Array II.java](https://github.com/shawnfan/LintCode/blob/master/Java/Search Rotated Sorted Array II.java) | Java | |
| 109 | [Search Rotated Sorted Array.java](https://github.com/shawnfan/LintCode/blob/master/Java/Search Rotated Sorted Array.java) | Java | |
| 110 | [Serilization and Deserialization Of Binary Tree.java](https://github.com/shawnfan/LintCode/blob/master/Java/Serilization and Deserialization Of Binary Tree.java) | Java | |
| 111 | [Single Number II.java](https://github.com/shawnfan/LintCode/blob/master/Java/Single Number II.java) | Java | |
| 112 | [Single Number III.java](https://github.com/shawnfan/LintCode/blob/master/Java/Single Number III.java) | Java | |
| 113 | [Single Number.java](https://github.com/shawnfan/LintCode/blob/master/Java/Single Number.java) | Java | |
| 114 | Singleton.java | Java | |
| 115 | [Sort Color.java](https://github.com/shawnfan/LintCode/blob/master/Java/Sort Color.java) | Java | |
| 116 | [Sort Colors II.java](https://github.com/shawnfan/LintCode/blob/master/Java/Sort Colors II.java) | Java | |
| 117 | [Sort Letters by Case.java](https://github.com/shawnfan/LintCode/blob/master/Java/Sort Letters by Case.java) | Java | |
| 118 | [Sort List.java](https://github.com/shawnfan/LintCode/blob/master/Java/Sort List.java) | Java | |
| 119 | [Space Replacement.java](https://github.com/shawnfan/LintCode/blob/master/Java/Space Replacement.java) | Java | |
| 120 | Sqrt(x).java | Java | |
| 121 | [String to Integer(atoi).java](https://github.com/shawnfan/LintCode/blob/master/Java/String to Integer(atoi).java) | Java | |
| 122 | StrStr.java | Java | |
| 123 | [Subarray Sum Closest.java](https://github.com/shawnfan/LintCode/blob/master/Java/Subarray Sum Closest.java) | Java | |
| 124 | [Subarray Sum.java](https://github.com/shawnfan/LintCode/blob/master/Java/Subarray Sum.java) | Java | |
| 125 | Subset.java | Java | |
| 126 | Subtree.java | Java | |
| 127 | [Trailing Zeros.java](https://github.com/shawnfan/LintCode/blob/master/Java/Trailing Zeros.java) | Java | |
| 128 | [Two Lists Sum.java](https://github.com/shawnfan/LintCode/blob/master/Java/Two Lists Sum.java) | Java | |
| 129 | [Two Strings Are Anagrams.java](https://github.com/shawnfan/LintCode/blob/master/Java/Two Strings Are Anagrams.java) | Java | |
| 130 | [Unique Binary Search Tree II.java](https://github.com/shawnfan/LintCode/blob/master/Java/Unique Binary Search Tree II.java) | Java | |
| 131 | [Unique Binary Search Tree.java](https://github.com/shawnfan/LintCode/blob/master/Java/Unique Binary Search Tree.java) | Java | |
| 132 | [Unique Path.java](https://github.com/shawnfan/LintCode/blob/master/Java/Unique Path.java) | Java | |
| 133 | [Unique Paths II.java](https://github.com/shawnfan/LintCode/blob/master/Java/Unique Paths II.java) | Java | |
| 134 | [Unique Permutations.java](https://github.com/shawnfan/LintCode/blob/master/Java/Unique Permutations.java) | Java | |
| 135 | [Unique Subset.java](https://github.com/shawnfan/LintCode/blob/master/Java/Unique Subset.java) | Java | |
| 136 | [Update Bits.java](https://github.com/shawnfan/LintCode/blob/master/Java/Update Bits.java) | Java | |
| 137 | [Validate Binary Search Tree.java](https://github.com/shawnfan/LintCode/blob/master/Java/Validate Binary Search Tree.java) | Java | |
| 138 | [Wood Cut.java](https://github.com/shawnfan/LintCode/blob/master/Java/Wood Cut.java) | Java |