WordPress.txt

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