Add: Navigation

Author: openset

problems/interleaving-string/README.md

@@ -5,6 +5,10 @@
 <!--|@home      https://github.com/openset/leetcode                        |-->
 <!--+----------------------------------------------------------------------+-->
 
+[< Previous](https://github.com/openset/leetcode/tree/master/problems/unique-binary-search-trees "Unique Binary Search Trees")
+　　　　　　　　　　　　　　　　
+[Next >](https://github.com/openset/leetcode/tree/master/problems/validate-binary-search-tree "Validate Binary Search Tree")
+
 ## 97. Interleaving String (Hard)
 
 <p>Given <em>s1</em>, <em>s2</em>, <em>s3</em>, find whether <em>s3</em> is formed by the interleaving of <em>s1</em> and <em>s2</em>.</p>

problems/largest-number/README.md

@@ -5,6 +5,10 @@
 <!--|@home      https://github.com/openset/leetcode                        |-->
 <!--+----------------------------------------------------------------------+-->
 
+[< Previous](https://github.com/openset/leetcode/tree/master/problems/rank-scores "Rank Scores")
+　　　　　　　　　　　　　　　　
+[Next >](https://github.com/openset/leetcode/tree/master/problems/consecutive-numbers "Consecutive Numbers")
+
 ## 179. Largest Number (Medium)
 
 <p>Given a list of non negative integers, arrange them such that they form the largest number.</p>

problems/longest-consecutive-sequence/README.md

@@ -5,6 +5,10 @@
 <!--|@home      https://github.com/openset/leetcode                        |-->
 <!--+----------------------------------------------------------------------+-->
 
+[< Previous](https://github.com/openset/leetcode/tree/master/problems/word-ladder "Word Ladder")
+　　　　　　　　　　　　　　　　
+[Next >](https://github.com/openset/leetcode/tree/master/problems/sum-root-to-leaf-numbers "Sum Root to Leaf Numbers")
+
 ## 128. Longest Consecutive Sequence (Hard)
 
 <p>Given an unsorted array of integers, find the length of the longest consecutive elements sequence.</p>

problems/longest-increasing-subsequence/README.md

@@ -5,6 +5,10 @@
 <!--|@home      https://github.com/openset/leetcode                        |-->
 <!--+----------------------------------------------------------------------+-->
 
+[< Previous](https://github.com/openset/leetcode/tree/master/problems/bulls-and-cows "Bulls and Cows")
+　　　　　　　　　　　　　　　　
+[Next >](https://github.com/openset/leetcode/tree/master/problems/remove-invalid-parentheses "Remove Invalid Parentheses")
+
 ## 300. Longest Increasing Subsequence (Medium)
 
 <p>Given an unsorted array of integers, find the length of longest increasing subsequence.</p>

problems/lowest-common-ancestor-of-a-binary-tree/README.md

@@ -5,6 +5,10 @@
 <!--|@home      https://github.com/openset/leetcode                        |-->
 <!--+----------------------------------------------------------------------+-->
 
+[< Previous](https://github.com/openset/leetcode/tree/master/problems/lowest-common-ancestor-of-a-binary-search-tree "Lowest Common Ancestor of a Binary Search Tree")
+　　　　　　　　　　　　　　　　
+[Next >](https://github.com/openset/leetcode/tree/master/problems/delete-node-in-a-linked-list "Delete Node in a Linked List")
+
 ## 236. Lowest Common Ancestor of a Binary Tree (Medium)
 
 <p>Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.</p>

problems/maximal-rectangle/README.md

@@ -5,6 +5,10 @@
 <!--|@home      https://github.com/openset/leetcode                        |-->
 <!--+----------------------------------------------------------------------+-->
 
+[< Previous](https://github.com/openset/leetcode/tree/master/problems/largest-rectangle-in-histogram "Largest Rectangle in Histogram")
+　　　　　　　　　　　　　　　　
+[Next >](https://github.com/openset/leetcode/tree/master/problems/partition-list "Partition List")
+
 ## 85. Maximal Rectangle (Hard)
 
 <p>Given a 2D binary matrix filled with 0&#39;s and 1&#39;s, find the largest rectangle containing only 1&#39;s and return its area.</p>

problems/maximum-gap/README.md

@@ -5,6 +5,10 @@
 <!--|@home      https://github.com/openset/leetcode                        |-->
 <!--+----------------------------------------------------------------------+-->
 
+[< Previous](https://github.com/openset/leetcode/tree/master/problems/missing-ranges "Missing Ranges")
+　　　　　　　　　　　　　　　　
+[Next >](https://github.com/openset/leetcode/tree/master/problems/compare-version-numbers "Compare Version Numbers")
+
 ## 164. Maximum Gap (Hard)
 
 <p>Given an unsorted array, find the maximum difference between the successive elements in its sorted form.</p>

problems/meeting-rooms-ii/README.md

@@ -5,6 +5,10 @@
 <!--|@home      https://github.com/openset/leetcode                        |-->
 <!--+----------------------------------------------------------------------+-->
 
+[< Previous](https://github.com/openset/leetcode/tree/master/problems/meeting-rooms "Meeting Rooms")
+　　　　　　　　　　　　　　　　
+[Next >](https://github.com/openset/leetcode/tree/master/problems/factor-combinations "Factor Combinations")
+
 ## 253. Meeting Rooms II (Medium)
 
 

problems/minimum-size-subarray-sum/README.md

@@ -5,6 +5,10 @@
 <!--|@home      https://github.com/openset/leetcode                        |-->
 <!--+----------------------------------------------------------------------+-->
 
+[< Previous](https://github.com/openset/leetcode/tree/master/problems/implement-trie-prefix-tree "Implement Trie (Prefix Tree)")
+　　　　　　　　　　　　　　　　
+[Next >](https://github.com/openset/leetcode/tree/master/problems/course-schedule-ii "Course Schedule II")
+
 ## 209. Minimum Size Subarray Sum (Medium)
 
 <p>Given an array of <strong>n</strong> positive integers and a positive integer <strong>s</strong>, find the minimal length of a <b>contiguous</b> subarray of which the sum &ge; <strong>s</strong>. If there isn&#39;t one, return 0 instead.</p>

problems/missing-ranges/README.md

@@ -5,6 +5,10 @@
 <!--|@home      https://github.com/openset/leetcode                        |-->
 <!--+----------------------------------------------------------------------+-->
 
+[< Previous](https://github.com/openset/leetcode/tree/master/problems/find-peak-element "Find Peak Element")
+　　　　　　　　　　　　　　　　
+[Next >](https://github.com/openset/leetcode/tree/master/problems/maximum-gap "Maximum Gap")
+
 ## 163. Missing Ranges (Medium)