awesee · awesee · Feb 19, 2019 · Feb 19, 2019
diff --git a/problems/increasing-subsequences/README.md b/problems/increasing-subsequences/README.md
@@ -5,6 +5,10 @@
 <!--|@home      https://github.com/openset/leetcode                        |-->
 <!--+----------------------------------------------------------------------+-->
 
+[< Previous](https://github.com/openset/leetcode/tree/master/problems/the-maze "The Maze")
+
+[Next >](https://github.com/openset/leetcode/tree/master/problems/construct-the-rectangle "Construct the Rectangle")
+
 ## 491. Increasing Subsequences (Medium)
 
 <p>

diff --git a/problems/is-graph-bipartite/README.md b/problems/is-graph-bipartite/README.md
@@ -5,6 +5,10 @@
 <!--|@home      https://github.com/openset/leetcode                        |-->
 <!--+----------------------------------------------------------------------+-->
 
+[< Previous](https://github.com/openset/leetcode/tree/master/problems/letter-case-permutation "Letter Case Permutation")
+
+[Next >](https://github.com/openset/leetcode/tree/master/problems/k-th-smallest-prime-fraction "K-th Smallest Prime Fraction")
+
 ## 785. Is Graph Bipartite? (Medium)
 
 <p>Given an undirected&nbsp;<code>graph</code>, return <code>true</code> if and only if it is bipartite.</p>

diff --git a/problems/k-th-smallest-in-lexicographical-order/README.md b/problems/k-th-smallest-in-lexicographical-order/README.md
@@ -5,6 +5,10 @@
 <!--|@home      https://github.com/openset/leetcode                        |-->
 <!--+----------------------------------------------------------------------+-->
 
+[< Previous](https://github.com/openset/leetcode/tree/master/problems/ternary-expression-parser "Ternary Expression Parser")
+
+[Next >](https://github.com/openset/leetcode/tree/master/problems/arranging-coins "Arranging Coins")
+
 ## 440. K-th Smallest in Lexicographical Order (Hard)
 
 <p>Given integers <code>n</code> and <code>k</code>, find the lexicographically k-th smallest integer in the range from <code>1</code> to <code>n</code>.</p>

diff --git a/problems/license-key-formatting/README.md b/problems/license-key-formatting/README.md
@@ -5,6 +5,10 @@
 <!--|@home      https://github.com/openset/leetcode                        |-->
 <!--+----------------------------------------------------------------------+-->
 
+[< Previous](https://github.com/openset/leetcode/tree/master/problems/magical-string "Magical String")
+
+[Next >](https://github.com/openset/leetcode/tree/master/problems/smallest-good-base "Smallest Good Base")
+
 ## 482. License Key Formatting (Easy)
 
 <p>You are given a license key represented as a string S which consists only alphanumeric character and dashes. The string is separated into N+1 groups by N dashes.</p>

diff --git a/problems/lonely-pixel-ii/README.md b/problems/lonely-pixel-ii/README.md
@@ -5,6 +5,10 @@
 <!--|@home      https://github.com/openset/leetcode                        |-->
 <!--+----------------------------------------------------------------------+-->
 
+[< Previous](https://github.com/openset/leetcode/tree/master/problems/k-diff-pairs-in-an-array "K-diff Pairs in an Array")
+
+[Next >](https://github.com/openset/leetcode/tree/master/problems/encode-and-decode-tinyurl "Encode and Decode TinyURL")
+
 ## 533. Lonely Pixel II (Medium)
 
 

diff --git a/problems/longest-palindromic-subsequence/README.md b/problems/longest-palindromic-subsequence/README.md
@@ -5,6 +5,10 @@
 <!--|@home      https://github.com/openset/leetcode                        |-->
 <!--+----------------------------------------------------------------------+-->
 
+[< Previous](https://github.com/openset/leetcode/tree/master/problems/find-largest-value-in-each-tree-row "Find Largest Value in Each Tree Row")
+
+[Next >](https://github.com/openset/leetcode/tree/master/problems/super-washing-machines "Super Washing Machines")
+
 ## 516. Longest Palindromic Subsequence (Medium)
 
 <p>

diff --git a/problems/longest-uncommon-subsequence-ii/README.md b/problems/longest-uncommon-subsequence-ii/README.md
@@ -5,6 +5,10 @@
 <!--|@home      https://github.com/openset/leetcode                        |-->
 <!--+----------------------------------------------------------------------+-->
 
+[< Previous](https://github.com/openset/leetcode/tree/master/problems/longest-uncommon-subsequence-i "Longest Uncommon Subsequence I ")
+
+[Next >](https://github.com/openset/leetcode/tree/master/problems/continuous-subarray-sum "Continuous Subarray Sum")
+
 ## 522. Longest Uncommon Subsequence II (Medium)
 
 <p>

diff --git a/problems/maximum-average-subarray-ii/README.md b/problems/maximum-average-subarray-ii/README.md
@@ -5,6 +5,10 @@
 <!--|@home      https://github.com/openset/leetcode                        |-->
 <!--+----------------------------------------------------------------------+-->
 
+[< Previous](https://github.com/openset/leetcode/tree/master/problems/maximum-average-subarray-i "Maximum Average Subarray I")
+
+[Next >](https://github.com/openset/leetcode/tree/master/problems/set-mismatch "Set Mismatch")
+
 ## 644. Maximum Average Subarray II (Hard)
 
 

diff --git a/problems/maximum-depth-of-n-ary-tree/README.md b/problems/maximum-depth-of-n-ary-tree/README.md
@@ -5,6 +5,10 @@
 <!--|@home      https://github.com/openset/leetcode                        |-->
 <!--+----------------------------------------------------------------------+-->
 
+[< Previous](https://github.com/openset/leetcode/tree/master/problems/quad-tree-intersection "Quad Tree Intersection")
+
+[Next >](https://github.com/openset/leetcode/tree/master/problems/subarray-sum-equals-k "Subarray Sum Equals K")
+
 ## 559. Maximum Depth of N-ary Tree (Easy)
 
 <p>Given a n-ary tree, find its maximum depth.</p>

diff --git a/problems/maximum-product-of-three-numbers/README.md b/problems/maximum-product-of-three-numbers/README.md
@@ -5,6 +5,10 @@
 <!--|@home      https://github.com/openset/leetcode                        |-->
 <!--+----------------------------------------------------------------------+-->
 
+[< Previous](https://github.com/openset/leetcode/tree/master/problems/swap-salary "Swap Salary")
+
+[Next >](https://github.com/openset/leetcode/tree/master/problems/k-inverse-pairs-array "K Inverse Pairs Array")
+
 ## 628. Maximum Product of Three Numbers (Easy)
 
 <p>Given an integer array, find three numbers whose product is maximum and output the maximum product.</p>

diff --git a/problems/maximum-size-subarray-sum-equals-k/README.md b/problems/maximum-size-subarray-sum-equals-k/README.md
@@ -5,6 +5,10 @@
 <!--|@home      https://github.com/openset/leetcode                        |-->
 <!--+----------------------------------------------------------------------+-->
 
+[< Previous](https://github.com/openset/leetcode/tree/master/problems/wiggle-sort-ii "Wiggle Sort II")
+
+[Next >](https://github.com/openset/leetcode/tree/master/problems/power-of-three "Power of Three")
+
 ## 325. Maximum Size Subarray Sum Equals k (Medium)
 
 

diff --git a/problems/maximum-xor-of-two-numbers-in-an-array/README.md b/problems/maximum-xor-of-two-numbers-in-an-array/README.md
@@ -5,6 +5,10 @@
 <!--|@home      https://github.com/openset/leetcode                        |-->
 <!--+----------------------------------------------------------------------+-->
 
+[< Previous](https://github.com/openset/leetcode/tree/master/problems/strong-password-checker "Strong Password Checker")
+
+[Next >](https://github.com/openset/leetcode/tree/master/problems/valid-word-square "Valid Word Square")
+
 ## 421. Maximum XOR of Two Numbers in an Array (Medium)
 
 <p>Given a <b>non-empty</b> array of numbers, a<sub>0</sub>, a<sub>1</sub>, a<sub>2</sub>, … , a<sub>n-1</sub>, where 0 &le; a<sub>i</sub> < 2<sup>31</sup>.</p>

diff --git a/problems/minesweeper/README.md b/problems/minesweeper/README.md
@@ -5,6 +5,10 @@
 <!--|@home      https://github.com/openset/leetcode                        |-->
 <!--+----------------------------------------------------------------------+-->
 
+[< Previous](https://github.com/openset/leetcode/tree/master/problems/random-pick-with-weight "Random Pick with Weight")
+
+[Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-absolute-difference-in-bst "Minimum Absolute Difference in BST")
+
 ## 529. Minesweeper (Medium)
 
 <p>Let&#39;s play the minesweeper game (<a href="https://en.wikipedia.org/wiki/Minesweeper_(video_game)">Wikipedia</a>, <a href="http://minesweeperonline.com">online game</a>)!</p>

diff --git a/problems/mini-parser/README.md b/problems/mini-parser/README.md
@@ -5,6 +5,10 @@
 <!--|@home      https://github.com/openset/leetcode                        |-->
 <!--+----------------------------------------------------------------------+-->
 
+[< Previous](https://github.com/openset/leetcode/tree/master/problems/shuffle-an-array "Shuffle an Array")
+
+[Next >](https://github.com/openset/leetcode/tree/master/problems/lexicographical-numbers "Lexicographical Numbers")
+
 ## 385. Mini Parser (Medium)
 
 <p>Given a nested list of integers represented as a string, implement a parser to deserialize it.</p>

diff --git a/problems/minimum-factorization/README.md b/problems/minimum-factorization/README.md
@@ -5,6 +5,10 @@
 <!--|@home      https://github.com/openset/leetcode                        |-->
 <!--+----------------------------------------------------------------------+-->
 
+[< Previous](https://github.com/openset/leetcode/tree/master/problems/maximum-distance-in-arrays "Maximum Distance in Arrays")
+
+[Next >](https://github.com/openset/leetcode/tree/master/problems/exchange-seats "Exchange Seats")
+
 ## 625. Minimum Factorization (Medium)
 
 <p>Given a positive integer <code>a</code>, find the smallest positive integer <code>b</code> whose multiplication of each digit equals to <code>a</code>. </p>

diff --git a/problems/minimum-moves-to-equal-array-elements/README.md b/problems/minimum-moves-to-equal-array-elements/README.md
@@ -5,6 +5,10 @@
 <!--|@home      https://github.com/openset/leetcode                        |-->
 <!--+----------------------------------------------------------------------+-->
 
+[< Previous](https://github.com/openset/leetcode/tree/master/problems/minimum-number-of-arrows-to-burst-balloons "Minimum Number of Arrows to Burst Balloons")
+
+[Next >](https://github.com/openset/leetcode/tree/master/problems/4sum-ii "4Sum II")
+
 ## 453. Minimum Moves to Equal Array Elements (Easy)
 
 <p>Given a <b>non-empty</b> integer array of size <i>n</i>, find the minimum number of moves required to make all array elements equal, where a move is incrementing <i>n</i> - 1 elements by 1.</p>

diff --git a/problems/minimum-unique-word-abbreviation/README.md b/problems/minimum-unique-word-abbreviation/README.md
@@ -5,6 +5,10 @@
 <!--|@home      https://github.com/openset/leetcode                        |-->
 <!--+----------------------------------------------------------------------+-->
 
+[< Previous](https://github.com/openset/leetcode/tree/master/problems/split-array-largest-sum "Split Array Largest Sum")
+
+[Next >](https://github.com/openset/leetcode/tree/master/problems/fizz-buzz "Fizz Buzz")
+
 ## 411. Minimum Unique Word Abbreviation (Hard)
 
 

diff --git a/problems/most-frequent-subtree-sum/README.md b/problems/most-frequent-subtree-sum/README.md
@@ -5,6 +5,10 @@
 <!--|@home      https://github.com/openset/leetcode                        |-->
 <!--+----------------------------------------------------------------------+-->
 
+[< Previous](https://github.com/openset/leetcode/tree/master/problems/perfect-number "Perfect Number")
+
+[Next >](https://github.com/openset/leetcode/tree/master/problems/fibonacci-number "Fibonacci Number")
+
 ## 508. Most Frequent Subtree Sum (Medium)
 
 <p>

diff --git a/problems/move-zeroes/README.md b/problems/move-zeroes/README.md
@@ -5,6 +5,10 @@
 <!--|@home      https://github.com/openset/leetcode                        |-->
 <!--+----------------------------------------------------------------------+-->
 
+[< Previous](https://github.com/openset/leetcode/tree/master/problems/expression-add-operators "Expression Add Operators")
+
+[Next >](https://github.com/openset/leetcode/tree/master/problems/peeking-iterator "Peeking Iterator")
+
 ## 283. Move Zeroes (Easy)
 
 <p>Given an array <code>nums</code>, write a function to move all <code>0</code>&#39;s to the end of it while maintaining the relative order of the non-zero elements.</p>

diff --git a/problems/moving-average-from-data-stream/README.md b/problems/moving-average-from-data-stream/README.md
@@ -5,6 +5,10 @@
 <!--|@home      https://github.com/openset/leetcode                        |-->
 <!--+----------------------------------------------------------------------+-->
 
+[< Previous](https://github.com/openset/leetcode/tree/master/problems/reverse-vowels-of-a-string "Reverse Vowels of a String")
+
+[Next >](https://github.com/openset/leetcode/tree/master/problems/top-k-frequent-elements "Top K Frequent Elements")
+
 ## 346. Moving Average from Data Stream (Easy)
 
 

diff --git a/problems/n-ary-tree-level-order-traversal/README.md b/problems/n-ary-tree-level-order-traversal/README.md
@@ -5,6 +5,10 @@
 <!--|@home      https://github.com/openset/leetcode                        |-->
 <!--+----------------------------------------------------------------------+-->
 
+[< Previous](https://github.com/openset/leetcode/tree/master/problems/serialize-and-deserialize-n-ary-tree "Serialize and Deserialize N-ary Tree")
+
+[Next >](https://github.com/openset/leetcode/tree/master/problems/flatten-a-multilevel-doubly-linked-list "Flatten a Multilevel Doubly Linked List")
+
 ## 429. N-ary Tree Level Order Traversal (Easy)
 
 <p>Given an n-ary tree, return the level order traversal of its nodes&#39; values. (ie, from left to right, level by level).</p>

diff --git a/problems/n-ary-tree-postorder-traversal/README.md b/problems/n-ary-tree-postorder-traversal/README.md
@@ -5,6 +5,10 @@
 <!--|@home      https://github.com/openset/leetcode                        |-->
 <!--+----------------------------------------------------------------------+-->
 
+[< Previous](https://github.com/openset/leetcode/tree/master/problems/n-ary-tree-preorder-traversal "N-ary Tree Preorder Traversal")
+
+[Next >](https://github.com/openset/leetcode/tree/master/problems/tag-validator "Tag Validator")
+
 ## 590. N-ary Tree Postorder Traversal (Easy)
 
 <p>Given an n-ary tree, return the <i>postorder</i> traversal of its nodes&#39; values.</p>

diff --git a/problems/n-ary-tree-preorder-traversal/README.md b/problems/n-ary-tree-preorder-traversal/README.md
@@ -5,6 +5,10 @@
 <!--|@home      https://github.com/openset/leetcode                        |-->
 <!--+----------------------------------------------------------------------+-->
 
+[< Previous](https://github.com/openset/leetcode/tree/master/problems/design-in-memory-file-system "Design In-Memory File System")
+
+[Next >](https://github.com/openset/leetcode/tree/master/problems/n-ary-tree-postorder-traversal "N-ary Tree Postorder Traversal")
+
 ## 589. N-ary Tree Preorder Traversal (Easy)
 
 <p>Given an n-ary tree, return the <i>preorder</i> traversal of its nodes&#39; values.</p>

diff --git a/problems/nested-list-weight-sum-ii/README.md b/problems/nested-list-weight-sum-ii/README.md
@@ -5,6 +5,10 @@
 <!--|@home      https://github.com/openset/leetcode                        |-->
 <!--+----------------------------------------------------------------------+-->
 
+[< Previous](https://github.com/openset/leetcode/tree/master/problems/max-sum-of-rectangle-no-larger-than-k "Max Sum of Rectangle No Larger Than K")
+
+[Next >](https://github.com/openset/leetcode/tree/master/problems/water-and-jug-problem "Water and Jug Problem")
+
 ## 364. Nested List Weight Sum II (Medium)
 
 

diff --git a/problems/next-greater-element-i/README.md b/problems/next-greater-element-i/README.md
@@ -5,6 +5,10 @@
 <!--|@home      https://github.com/openset/leetcode                        |-->
 <!--+----------------------------------------------------------------------+-->
 
+[< Previous](https://github.com/openset/leetcode/tree/master/problems/teemo-attacking "Teemo Attacking")
+
+[Next >](https://github.com/openset/leetcode/tree/master/problems/random-point-in-non-overlapping-rectangles "Random Point in Non-overlapping Rectangles")
+
 ## 496. Next Greater Element I (Easy)
 
 <p>

diff --git a/problems/next-greater-element-ii/README.md b/problems/next-greater-element-ii/README.md
@@ -5,6 +5,10 @@
 <!--|@home      https://github.com/openset/leetcode                        |-->
 <!--+----------------------------------------------------------------------+-->
 
+[< Previous](https://github.com/openset/leetcode/tree/master/problems/ipo "IPO")
+
+[Next >](https://github.com/openset/leetcode/tree/master/problems/base-7 "Base 7")
+
 ## 503. Next Greater Element II (Medium)
 
 <p>

diff --git a/problems/next-greater-element-iii/README.md b/problems/next-greater-element-iii/README.md
@@ -5,6 +5,10 @@
 <!--|@home      https://github.com/openset/leetcode                        |-->
 <!--+----------------------------------------------------------------------+-->
 
+[< Previous](https://github.com/openset/leetcode/tree/master/problems/split-concatenated-strings "Split Concatenated Strings")
+
+[Next >](https://github.com/openset/leetcode/tree/master/problems/reverse-words-in-a-string-iii "Reverse Words in a String III")
+
 ## 556. Next Greater Element III (Medium)
 
 <p>Given a positive <strong>32-bit</strong> integer <strong>n</strong>, you need to find the smallest <strong>32-bit</strong> integer which has exactly the same digits existing in the integer <strong>n</strong> and is greater in value than n. If no such positive <strong>32-bit</strong> integer exists, you need to return -1.</p>

diff --git a/problems/non-overlapping-intervals/README.md b/problems/non-overlapping-intervals/README.md
@@ -5,6 +5,10 @@
 <!--|@home      https://github.com/openset/leetcode                        |-->
 <!--+----------------------------------------------------------------------+-->
 
+[< Previous](https://github.com/openset/leetcode/tree/master/problems/number-of-segments-in-a-string "Number of Segments in a String")
+
+[Next >](https://github.com/openset/leetcode/tree/master/problems/find-right-interval "Find Right Interval")
+
 ## 435. Non-overlapping Intervals (Medium)
 
 <p>

diff --git a/problems/not-boring-movies/README.md b/problems/not-boring-movies/README.md
@@ -5,6 +5,10 @@
 <!--|@home      https://github.com/openset/leetcode                        |-->
 <!--+----------------------------------------------------------------------+-->
 
+[< Previous](https://github.com/openset/leetcode/tree/master/problems/biggest-single-number "Biggest Single Number")
+
+[Next >](https://github.com/openset/leetcode/tree/master/problems/task-scheduler "Task Scheduler")
+
 ## 620. Not Boring Movies (Easy)
 
 X city opened a new cinema, many people would like to go to this cinema.

diff --git a/problems/number-complement/README.md b/problems/number-complement/README.md
@@ -5,6 +5,10 @@
 <!--|@home      https://github.com/openset/leetcode                        |-->
 <!--+----------------------------------------------------------------------+-->
 
+[< Previous](https://github.com/openset/leetcode/tree/master/problems/heaters "Heaters")
+
+[Next >](https://github.com/openset/leetcode/tree/master/problems/total-hamming-distance "Total Hamming Distance")
+
 ## 476. Number Complement (Easy)
 
 <p>Given a positive integer, output its complement number. The complement strategy is to flip the bits of its binary representation.</p>

diff --git a/problems/number-of-boomerangs/README.md b/problems/number-of-boomerangs/README.md
@@ -5,6 +5,10 @@
 <!--|@home      https://github.com/openset/leetcode                        |-->
 <!--+----------------------------------------------------------------------+-->
 
+[< Previous](https://github.com/openset/leetcode/tree/master/problems/arithmetic-slices-ii-subsequence "Arithmetic Slices II - Subsequence")
+
+[Next >](https://github.com/openset/leetcode/tree/master/problems/find-all-numbers-disappeared-in-an-array "Find All Numbers Disappeared in an Array")
+
 ## 447. Number of Boomerangs (Easy)
 
 <p>Given <i>n</i> points in the plane that are all pairwise distinct, a "boomerang" is a tuple of points <code>(i, j, k)</code> such that the distance between <code>i</code> and <code>j</code> equals the distance between <code>i</code> and <code>k</code> (<b>the order of the tuple matters</b>).</p>

diff --git a/problems/number-of-connected-components-in-an-undirected-graph/README.md b/problems/number-of-connected-components-in-an-undirected-graph/README.md
@@ -5,6 +5,10 @@
 <!--|@home      https://github.com/openset/leetcode                        |-->
 <!--+----------------------------------------------------------------------+-->
 
+[< Previous](https://github.com/openset/leetcode/tree/master/problems/coin-change "Coin Change")
+
+[Next >](https://github.com/openset/leetcode/tree/master/problems/wiggle-sort-ii "Wiggle Sort II")
+
 ## 323. Number of Connected Components in an Undirected Graph (Medium)
 
 

diff --git a/problems/number-of-islands-ii/README.md b/problems/number-of-islands-ii/README.md
@@ -5,6 +5,10 @@
 <!--|@home      https://github.com/openset/leetcode                        |-->
 <!--+----------------------------------------------------------------------+-->
 
+[< Previous](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-2d-immutable "Range Sum Query 2D - Immutable")
+
+[Next >](https://github.com/openset/leetcode/tree/master/problems/additive-number "Additive Number")
+
 ## 305. Number of Islands II (Hard)
 
 

diff --git a/problems/number-of-segments-in-a-string/README.md b/problems/number-of-segments-in-a-string/README.md
@@ -5,6 +5,10 @@
 <!--|@home      https://github.com/openset/leetcode                        |-->
 <!--+----------------------------------------------------------------------+-->
 
+[< Previous](https://github.com/openset/leetcode/tree/master/problems/minimum-genetic-mutation "Minimum Genetic Mutation")
+
+[Next >](https://github.com/openset/leetcode/tree/master/problems/non-overlapping-intervals "Non-overlapping Intervals")
+
 ## 434. Number of Segments in a String (Easy)
 
 <p>Count the number of segments in a string, where a segment is defined to be a contiguous sequence of non-space characters.</p>