diff --git a/problems/graph-valid-tree/README.md b/problems/graph-valid-tree/README.md index 67cfae4f4..4792f8206 100644 --- a/problems/graph-valid-tree/README.md +++ b/problems/graph-valid-tree/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/single-number-iii "Single Number III") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/trips-and-users "Trips and Users") + ## 261. Graph Valid Tree (Medium) diff --git a/problems/group-anagrams/README.md b/problems/group-anagrams/README.md index 65f00794f..a08727c5c 100644 --- a/problems/group-anagrams/README.md +++ b/problems/group-anagrams/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/rotate-image "Rotate Image") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/powx-n "Pow(x, n)") + ## 49. Group Anagrams (Medium)

Given an array of strings, group anagrams together.

diff --git a/problems/group-shifted-strings/README.md b/problems/group-shifted-strings/README.md index 2af8edac1..fc1d82881 100644 --- a/problems/group-shifted-strings/README.md +++ b/problems/group-shifted-strings/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/strobogrammatic-number-iii "Strobogrammatic Number III") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/count-univalue-subtrees "Count Univalue Subtrees") + ## 249. Group Shifted Strings (Medium) diff --git a/problems/guess-number-higher-or-lower-ii/README.md b/problems/guess-number-higher-or-lower-ii/README.md index 25731fad6..45c6d2d25 100644 --- a/problems/guess-number-higher-or-lower-ii/README.md +++ b/problems/guess-number-higher-or-lower-ii/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/guess-number-higher-or-lower "Guess Number Higher or Lower") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/wiggle-subsequence "Wiggle Subsequence") + ## 375. Guess Number Higher or Lower II (Medium)

We are playing the Guess Game. The game is as follows:

diff --git a/problems/guess-number-higher-or-lower/README.md b/problems/guess-number-higher-or-lower/README.md index 4a975f6fe..7f106ca12 100644 --- a/problems/guess-number-higher-or-lower/README.md +++ b/problems/guess-number-higher-or-lower/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/find-k-pairs-with-smallest-sums "Find K Pairs with Smallest Sums") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/guess-number-higher-or-lower-ii "Guess Number Higher or Lower II") + ## 374. Guess Number Higher or Lower (Easy)

We are playing the Guess Game. The game is as follows:

diff --git a/problems/hamming-distance/README.md b/problems/hamming-distance/README.md index 0b99d2112..a9f37525f 100644 --- a/problems/hamming-distance/README.md +++ b/problems/hamming-distance/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/lfu-cache "LFU Cache") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-moves-to-equal-array-elements-ii "Minimum Moves to Equal Array Elements II") + ## 461. Hamming Distance (Easy)

The Hamming distance between two integers is the number of positions at which the corresponding bits are different.

diff --git a/problems/happy-number/README.md b/problems/happy-number/README.md index 97d604a8d..faa04c56a 100644 --- a/problems/happy-number/README.md +++ b/problems/happy-number/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/bitwise-and-of-numbers-range "Bitwise AND of Numbers Range") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/remove-linked-list-elements "Remove Linked List Elements") + ## 202. Happy Number (Easy)

Write an algorithm to determine if a number is "happy".

diff --git a/problems/heaters/README.md b/problems/heaters/README.md index fb5685f27..2f185aebf 100644 --- a/problems/heaters/README.md +++ b/problems/heaters/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/ones-and-zeroes "Ones and Zeroes") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/number-complement "Number Complement") + ## 475. Heaters (Easy)

Winter is coming! Your first job during the contest is to design a standard heater with fixed warm radius to warm all the houses.

diff --git a/problems/house-robber-iii/README.md b/problems/house-robber-iii/README.md index 150ab4efa..42b0480b0 100644 --- a/problems/house-robber-iii/README.md +++ b/problems/house-robber-iii/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/palindrome-pairs "Palindrome Pairs") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/counting-bits "Counting Bits") + ## 337. House Robber III (Medium)

The thief has found himself a new place for his thievery again. There is only one entrance to this area, called the "root." Besides the root, each house has one and only one parent house. After a tour, the smart thief realized that "all houses in this place forms a binary tree". It will automatically contact the police if two directly-linked houses were broken into on the same night.

diff --git a/problems/house-robber/README.md b/problems/house-robber/README.md index c0edd189a..c629372f4 100644 --- a/problems/house-robber/README.md +++ b/problems/house-robber/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/rising-temperature "Rising Temperature") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/binary-tree-right-side-view "Binary Tree Right Side View") + ## 198. House Robber (Easy)

You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent houses have security system connected and it will automatically contact the police if two adjacent houses were broken into on the same night.

diff --git a/problems/human-traffic-of-stadium/README.md b/problems/human-traffic-of-stadium/README.md index 0137f18e5..ea50b53ec 100644 --- a/problems/human-traffic-of-stadium/README.md +++ b/problems/human-traffic-of-stadium/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/non-negative-integers-without-consecutive-ones "Non-negative Integers without Consecutive Ones") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/friend-requests-ii-who-has-the-most-friends "Friend Requests II: Who Has the Most Friends") + ## 601. Human Traffic of Stadium (Hard)

X city built a new stadium, each day many people visit it and the stats are saved as these columns: id, date, people diff --git a/problems/image-smoother/README.md b/problems/image-smoother/README.md index 4771e4e46..0b41e8d19 100644 --- a/problems/image-smoother/README.md +++ b/problems/image-smoother/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/remove-9 "Remove 9") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/maximum-width-of-binary-tree "Maximum Width of Binary Tree") + ## 661. Image Smoother (Easy)

Given a 2D integer matrix M representing the gray scale of an image, you need to design a smoother to make the gray scale of each cell becomes the average gray scale (rounding down) of all the 8 surrounding cells and itself. If a cell has less than 8 surrounding cells, then use as many as you can.

diff --git a/problems/implement-magic-dictionary/README.md b/problems/implement-magic-dictionary/README.md index 455952d25..19cccb18a 100644 --- a/problems/implement-magic-dictionary/README.md +++ b/problems/implement-magic-dictionary/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/cut-off-trees-for-golf-event "Cut Off Trees for Golf Event") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/map-sum-pairs "Map Sum Pairs") + ## 676. Implement Magic Dictionary (Medium)

diff --git a/problems/implement-queue-using-stacks/README.md b/problems/implement-queue-using-stacks/README.md index 97b91280c..8ba416cf8 100644 --- a/problems/implement-queue-using-stacks/README.md +++ b/problems/implement-queue-using-stacks/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/power-of-two "Power of Two") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/number-of-digit-one "Number of Digit One") + ## 232. Implement Queue using Stacks (Easy)

Implement the following operations of a queue using stacks.

diff --git a/problems/implement-rand10-using-rand7/README.md b/problems/implement-rand10-using-rand7/README.md index d8d038169..cf2300593 100644 --- a/problems/implement-rand10-using-rand7/README.md +++ b/problems/implement-rand10-using-rand7/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/convex-polygon "Convex Polygon") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/encode-string-with-shortest-length "Encode String with Shortest Length") + ## 470. Implement Rand10() Using Rand7() (Medium)

Given a function rand7 which generates a uniform random integer in the range 1 to 7, write a function rand10 which generates a uniform random integer in the range 1 to 10.

diff --git a/problems/implement-stack-using-queues/README.md b/problems/implement-stack-using-queues/README.md index 63aadfb43..d104ea4b1 100644 --- a/problems/implement-stack-using-queues/README.md +++ b/problems/implement-stack-using-queues/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/basic-calculator "Basic Calculator") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/invert-binary-tree "Invert Binary Tree") + ## 225. Implement Stack using Queues (Easy)

Implement the following operations of a stack using queues.

diff --git a/problems/implement-strstr/README.md b/problems/implement-strstr/README.md index 3163479b8..934774043 100644 --- a/problems/implement-strstr/README.md +++ b/problems/implement-strstr/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/remove-element "Remove Element") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/divide-two-integers "Divide Two Integers") + ## 28. Implement strStr() (Easy)

Implement strStr().

diff --git a/problems/implement-trie-prefix-tree/README.md b/problems/implement-trie-prefix-tree/README.md index fc9161d46..904f697b6 100644 --- a/problems/implement-trie-prefix-tree/README.md +++ b/problems/implement-trie-prefix-tree/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/course-schedule "Course Schedule") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-size-subarray-sum "Minimum Size Subarray Sum") + ## 208. Implement Trie (Prefix Tree) (Medium)

Implement a trie with insert, search, and startsWith methods.

diff --git a/problems/increasing-triplet-subsequence/README.md b/problems/increasing-triplet-subsequence/README.md index 3bcc1c389..851e031ac 100644 --- a/problems/increasing-triplet-subsequence/README.md +++ b/problems/increasing-triplet-subsequence/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/largest-bst-subtree "Largest BST Subtree") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/self-crossing "Self Crossing") + ## 334. Increasing Triplet Subsequence (Medium)

Given an unsorted array return whether an increasing subsequence of length 3 exists or not in the array.

diff --git a/problems/inorder-successor-in-bst-ii/README.md b/problems/inorder-successor-in-bst-ii/README.md index c5742c2d2..6e79f3f10 100644 --- a/problems/inorder-successor-in-bst-ii/README.md +++ b/problems/inorder-successor-in-bst-ii/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/fibonacci-number "Fibonacci Number") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/find-bottom-left-tree-value "Find Bottom Left Tree Value") + ## 510. Inorder Successor in BST II (Medium) diff --git a/problems/inorder-successor-in-bst/README.md b/problems/inorder-successor-in-bst/README.md index f21fe8c87..7b6478856 100644 --- a/problems/inorder-successor-in-bst/README.md +++ b/problems/inorder-successor-in-bst/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/peeking-iterator "Peeking Iterator") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/walls-and-gates "Walls and Gates") + ## 285. Inorder Successor in BST (Medium) diff --git a/problems/insert-delete-getrandom-o1-duplicates-allowed/README.md b/problems/insert-delete-getrandom-o1-duplicates-allowed/README.md index db20989f6..46abeda63 100644 --- a/problems/insert-delete-getrandom-o1-duplicates-allowed/README.md +++ b/problems/insert-delete-getrandom-o1-duplicates-allowed/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/insert-delete-getrandom-o1 "Insert Delete GetRandom O(1)") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/linked-list-random-node "Linked List Random Node") + ## 381. Insert Delete GetRandom O(1) - Duplicates allowed (Hard)

Design a data structure that supports all following operations in average O(1) time.

diff --git a/problems/insert-delete-getrandom-o1/README.md b/problems/insert-delete-getrandom-o1/README.md index 2c92dcc48..3de58cc2f 100644 --- a/problems/insert-delete-getrandom-o1/README.md +++ b/problems/insert-delete-getrandom-o1/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/design-phone-directory "Design Phone Directory") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/insert-delete-getrandom-o1-duplicates-allowed "Insert Delete GetRandom O(1) - Duplicates allowed") + ## 380. Insert Delete GetRandom O(1) (Medium)

Design a data structure that supports all following operations in average O(1) time.

diff --git a/problems/insert-interval/README.md b/problems/insert-interval/README.md index 030a1d0c3..0dc559f18 100644 --- a/problems/insert-interval/README.md +++ b/problems/insert-interval/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/merge-intervals "Merge Intervals") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/length-of-last-word "Length of Last Word") + ## 57. Insert Interval (Hard)

Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary).

diff --git a/problems/insert-into-a-binary-search-tree/README.md b/problems/insert-into-a-binary-search-tree/README.md index 24d7e5eea..b6b0b1fd9 100644 --- a/problems/insert-into-a-binary-search-tree/README.md +++ b/problems/insert-into-a-binary-search-tree/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/search-in-a-binary-search-tree "Search in a Binary Search Tree") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/search-in-a-sorted-array-of-unknown-size "Search in a Sorted Array of Unknown Size") + ## 701. Insert into a Binary Search Tree (Medium)

Given the root node of a binary search tree (BST) and a value to be inserted into the tree, insert the value into the BST. Return the root node of the BST after the insertion. It is guaranteed that the new value does not exist in the original BST.

diff --git a/problems/insert-into-a-cyclic-sorted-list/README.md b/problems/insert-into-a-cyclic-sorted-list/README.md index b517f762c..0ab38ea86 100644 --- a/problems/insert-into-a-cyclic-sorted-list/README.md +++ b/problems/insert-into-a-cyclic-sorted-list/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/design-linked-list "Design Linked List") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/to-lower-case "To Lower Case") + ## 708. Insert into a Cyclic Sorted List (Medium) diff --git a/problems/insertion-sort-list/README.md b/problems/insertion-sort-list/README.md index fc27b005d..ccb768d9d 100644 --- a/problems/insertion-sort-list/README.md +++ b/problems/insertion-sort-list/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/lru-cache "LRU Cache") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/sort-list "Sort List") + ## 147. Insertion Sort List (Medium)

Sort a linked list using insertion sort.

diff --git a/problems/integer-replacement/README.md b/problems/integer-replacement/README.md index 8685371b8..acecc8d2b 100644 --- a/problems/integer-replacement/README.md +++ b/problems/integer-replacement/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/rotate-function "Rotate Function") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/random-pick-index "Random Pick Index") + ## 397. Integer Replacement (Medium)

diff --git a/problems/integer-to-roman/README.md b/problems/integer-to-roman/README.md index cda0f7a9e..3294914d9 100644 --- a/problems/integer-to-roman/README.md +++ b/problems/integer-to-roman/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/container-with-most-water "Container With Most Water") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/roman-to-integer "Roman to Integer") + ## 12. Integer to Roman (Medium)

Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M.

diff --git a/problems/intersection-of-two-arrays-ii/README.md b/problems/intersection-of-two-arrays-ii/README.md index 911dedfd0..605b3bbf5 100644 --- a/problems/intersection-of-two-arrays-ii/README.md +++ b/problems/intersection-of-two-arrays-ii/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/intersection-of-two-arrays "Intersection of Two Arrays") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/android-unlock-patterns "Android Unlock Patterns") + ## 350. Intersection of Two Arrays II (Easy)

Given two arrays, write a function to compute their intersection.

diff --git a/problems/intersection-of-two-arrays/README.md b/problems/intersection-of-two-arrays/README.md index 19fd11444..94b37c350 100644 --- a/problems/intersection-of-two-arrays/README.md +++ b/problems/intersection-of-two-arrays/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/design-tic-tac-toe "Design Tic-Tac-Toe") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/intersection-of-two-arrays-ii "Intersection of Two Arrays II") + ## 349. Intersection of Two Arrays (Easy)

Given two arrays, write a function to compute their intersection.

diff --git a/problems/intersection-of-two-linked-lists/README.md b/problems/intersection-of-two-linked-lists/README.md index 026a54200..bc5599870 100644 --- a/problems/intersection-of-two-linked-lists/README.md +++ b/problems/intersection-of-two-linked-lists/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/longest-substring-with-at-most-two-distinct-characters "Longest Substring with At Most Two Distinct Characters") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/one-edit-distance "One Edit Distance") + ## 160. Intersection of Two Linked Lists (Easy)

Write a program to find the node at which the intersection of two singly linked lists begins.

diff --git a/problems/invert-binary-tree/README.md b/problems/invert-binary-tree/README.md index c95987acf..627a34070 100644 --- a/problems/invert-binary-tree/README.md +++ b/problems/invert-binary-tree/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/implement-stack-using-queues "Implement Stack using Queues") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/basic-calculator-ii "Basic Calculator II") + ## 226. Invert Binary Tree (Easy)

Invert a binary tree.

diff --git a/problems/ipo/README.md b/problems/ipo/README.md index ca8fe519a..d5919598b 100644 --- a/problems/ipo/README.md +++ b/problems/ipo/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/find-mode-in-binary-search-tree "Find Mode in Binary Search Tree") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/next-greater-element-ii "Next Greater Element II") + ## 502. IPO (Hard)

diff --git a/problems/is-subsequence/README.md b/problems/is-subsequence/README.md index 63cadedbb..3ba982a5f 100644 --- a/problems/is-subsequence/README.md +++ b/problems/is-subsequence/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/perfect-rectangle "Perfect Rectangle") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/utf-8-validation "UTF-8 Validation") + ## 392. Is Subsequence (Medium)

diff --git a/problems/island-perimeter/README.md b/problems/island-perimeter/README.md index 7c4eeecec..e2fd1551f 100644 --- a/problems/island-perimeter/README.md +++ b/problems/island-perimeter/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/minimum-moves-to-equal-array-elements-ii "Minimum Moves to Equal Array Elements II") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/can-i-win "Can I Win") + ## 463. Island Perimeter (Easy)

You are given a map in form of a two-dimensional integer grid where 1 represents land and 0 represents water.

diff --git a/problems/isomorphic-strings/README.md b/problems/isomorphic-strings/README.md index 06148fd55..fa3815f63 100644 --- a/problems/isomorphic-strings/README.md +++ b/problems/isomorphic-strings/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/count-primes "Count Primes") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/reverse-linked-list "Reverse Linked List") + ## 205. Isomorphic Strings (Easy)

Given two strings s and t, determine if they are isomorphic.

diff --git a/problems/jump-game-ii/README.md b/problems/jump-game-ii/README.md index 817028fa9..b0fa88a27 100644 --- a/problems/jump-game-ii/README.md +++ b/problems/jump-game-ii/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/wildcard-matching "Wildcard Matching") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/permutations "Permutations") + ## 45. Jump Game II (Hard)

Given an array of non-negative integers, you are initially positioned at the first index of the array.

diff --git a/problems/jump-game/README.md b/problems/jump-game/README.md index 5ff99e4d8..d0fc4799b 100644 --- a/problems/jump-game/README.md +++ b/problems/jump-game/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/spiral-matrix "Spiral Matrix") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/merge-intervals "Merge Intervals") + ## 55. Jump Game (Medium)

Given an array of non-negative integers, you are initially positioned at the first index of the array.

diff --git a/problems/k-diff-pairs-in-an-array/README.md b/problems/k-diff-pairs-in-an-array/README.md index 9a38e2f05..30a77eeab 100644 --- a/problems/k-diff-pairs-in-an-array/README.md +++ b/problems/k-diff-pairs-in-an-array/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/lonely-pixel-i "Lonely Pixel I") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/lonely-pixel-ii "Lonely Pixel II") + ## 532. K-diff Pairs in an Array (Easy)

diff --git a/problems/k-inverse-pairs-array/README.md b/problems/k-inverse-pairs-array/README.md index ea41b1cd1..603f7cb0b 100644 --- a/problems/k-inverse-pairs-array/README.md +++ b/problems/k-inverse-pairs-array/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/maximum-product-of-three-numbers "Maximum Product of Three Numbers") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/course-schedule-iii "Course Schedule III") + ## 629. K Inverse Pairs Array (Hard)

diff --git a/problems/keyboard-row/README.md b/problems/keyboard-row/README.md index 6b16ca90f..4f38d4edd 100644 --- a/problems/keyboard-row/README.md +++ b/problems/keyboard-row/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/the-maze-iii "The Maze III") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/find-mode-in-binary-search-tree "Find Mode in Binary Search Tree") + ## 500. Keyboard Row (Easy)

Given a List of words, return the words that can be typed using letters of alphabet on only one row's of American keyboard like the image below.

diff --git a/problems/kill-process/README.md b/problems/kill-process/README.md index 1039fba9f..eaa72ab29 100644 --- a/problems/kill-process/README.md +++ b/problems/kill-process/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/shortest-unsorted-continuous-subarray "Shortest Unsorted Continuous Subarray") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/delete-operation-for-two-strings "Delete Operation for Two Strings") + ## 582. Kill Process (Medium)

Given n processes, each process has a unique PID (process id) and its PPID (parent process id). diff --git a/problems/kth-largest-element-in-an-array/README.md b/problems/kth-largest-element-in-an-array/README.md index 49d160658..3b44258ef 100644 --- a/problems/kth-largest-element-in-an-array/README.md +++ b/problems/kth-largest-element-in-an-array/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/shortest-palindrome "Shortest Palindrome") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/combination-sum-iii "Combination Sum III") + ## 215. Kth Largest Element in an Array (Medium)

Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.

diff --git a/problems/kth-smallest-element-in-a-sorted-matrix/README.md b/problems/kth-smallest-element-in-a-sorted-matrix/README.md index dc0ee7282..9f527590e 100644 --- a/problems/kth-smallest-element-in-a-sorted-matrix/README.md +++ b/problems/kth-smallest-element-in-a-sorted-matrix/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/combination-sum-iv "Combination Sum IV") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/design-phone-directory "Design Phone Directory") + ## 378. Kth Smallest Element in a Sorted Matrix (Medium)

Given a n x n matrix where each of the rows and columns are sorted in ascending order, find the kth smallest element in the matrix.

diff --git a/problems/largest-divisible-subset/README.md b/problems/largest-divisible-subset/README.md index 430d2fed0..12ad0bd42 100644 --- a/problems/largest-divisible-subset/README.md +++ b/problems/largest-divisible-subset/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/valid-perfect-square "Valid Perfect Square") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/plus-one-linked-list "Plus One Linked List") + ## 368. Largest Divisible Subset (Medium)

Given a set of distinct positive integers, find the largest subset such that every pair (Si, Sj) of elements in this subset satisfies:

diff --git a/problems/largest-palindrome-product/README.md b/problems/largest-palindrome-product/README.md index 4a508912e..018fe2b70 100644 --- a/problems/largest-palindrome-product/README.md +++ b/problems/largest-palindrome-product/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/generate-random-point-in-a-circle "Generate Random Point in a Circle") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/sliding-window-median "Sliding Window Median") + ## 479. Largest Palindrome Product (Hard)

Find the largest palindrome made from the product of two n-digit numbers.

diff --git a/problems/largest-rectangle-in-histogram/README.md b/problems/largest-rectangle-in-histogram/README.md index 7628962cc..738d4f273 100644 --- a/problems/largest-rectangle-in-histogram/README.md +++ b/problems/largest-rectangle-in-histogram/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/remove-duplicates-from-sorted-list "Remove Duplicates from Sorted List") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/maximal-rectangle "Maximal Rectangle") + ## 84. Largest Rectangle in Histogram (Hard)

Given n non-negative integers representing the histogram's bar height where the width of each bar is 1, find the area of largest rectangle in the histogram.

diff --git a/problems/length-of-last-word/README.md b/problems/length-of-last-word/README.md index 45aa418a4..6c2c9726a 100644 --- a/problems/length-of-last-word/README.md +++ b/problems/length-of-last-word/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/insert-interval "Insert Interval") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/spiral-matrix-ii "Spiral Matrix II") + ## 58. Length of Last Word (Easy)

Given a string s consists of upper/lower-case alphabets and empty space characters ' ', return the length of last word in the string.

diff --git a/problems/letter-combinations-of-a-phone-number/README.md b/problems/letter-combinations-of-a-phone-number/README.md index c992c3191..305bd4d45 100644 --- a/problems/letter-combinations-of-a-phone-number/README.md +++ b/problems/letter-combinations-of-a-phone-number/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/3sum-closest "3Sum Closest") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/4sum "4Sum") + ## 17. Letter Combinations of a Phone Number (Medium)

Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent.

diff --git a/problems/lexicographical-numbers/README.md b/problems/lexicographical-numbers/README.md index 71c99b610..fb12330bc 100644 --- a/problems/lexicographical-numbers/README.md +++ b/problems/lexicographical-numbers/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/mini-parser "Mini Parser") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/first-unique-character-in-a-string "First Unique Character in a String") + ## 386. Lexicographical Numbers (Medium)

Given an integer n, return 1 - n in lexicographical order.

diff --git a/problems/lfu-cache/README.md b/problems/lfu-cache/README.md index 6236b08b3..683d1f26e 100644 --- a/problems/lfu-cache/README.md +++ b/problems/lfu-cache/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/repeated-substring-pattern "Repeated Substring Pattern") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/hamming-distance "Hamming Distance") + ## 460. LFU Cache (Hard)

Design and implement a data structure for Least Frequently Used (LFU) cache. It should support the following operations: get and put. diff --git a/problems/linked-list-cycle-ii/README.md b/problems/linked-list-cycle-ii/README.md index 1d03d1d02..6fadb890b 100644 --- a/problems/linked-list-cycle-ii/README.md +++ b/problems/linked-list-cycle-ii/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/linked-list-cycle "Linked List Cycle") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/reorder-list "Reorder List") + ## 142. Linked List Cycle II (Medium)

Given a linked list, return the node where the cycle begins. If there is no cycle, return null.

diff --git a/problems/linked-list-cycle/README.md b/problems/linked-list-cycle/README.md index 2cb6304d5..584cf8ea2 100644 --- a/problems/linked-list-cycle/README.md +++ b/problems/linked-list-cycle/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/word-break-ii "Word Break II") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/linked-list-cycle-ii "Linked List Cycle II") + ## 141. Linked List Cycle (Easy)

Given a linked list, determine if it has a cycle in it.

diff --git a/problems/linked-list-random-node/README.md b/problems/linked-list-random-node/README.md index 7be243f39..475b6ef5c 100644 --- a/problems/linked-list-random-node/README.md +++ b/problems/linked-list-random-node/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/insert-delete-getrandom-o1-duplicates-allowed "Insert Delete GetRandom O(1) - Duplicates allowed") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/ransom-note "Ransom Note") + ## 382. Linked List Random Node (Medium)

Given a singly linked list, return a random node's value from the linked list. Each node must have the same probability of being chosen.

diff --git a/problems/logger-rate-limiter/README.md b/problems/logger-rate-limiter/README.md index 1170c0109..d15257046 100644 --- a/problems/logger-rate-limiter/README.md +++ b/problems/logger-rate-limiter/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/rearrange-string-k-distance-apart "Rearrange String k Distance Apart") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/sort-transformed-array "Sort Transformed Array") + ## 359. Logger Rate Limiter (Easy) diff --git a/problems/lonely-pixel-i/README.md b/problems/lonely-pixel-i/README.md index 860bcd2ac..389c16583 100644 --- a/problems/lonely-pixel-i/README.md +++ b/problems/lonely-pixel-i/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/minimum-absolute-difference-in-bst "Minimum Absolute Difference in BST") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/k-diff-pairs-in-an-array "K-diff Pairs in an Array") + ## 531. Lonely Pixel I (Medium) diff --git a/problems/longest-absolute-file-path/README.md b/problems/longest-absolute-file-path/README.md index 4d2323d07..ab74007fc 100644 --- a/problems/longest-absolute-file-path/README.md +++ b/problems/longest-absolute-file-path/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/first-unique-character-in-a-string "First Unique Character in a String") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/find-the-difference "Find the Difference") + ## 388. Longest Absolute File Path (Medium)

Suppose we abstract our file system by a string in the following manner:

diff --git a/problems/longest-common-prefix/README.md b/problems/longest-common-prefix/README.md index 4b79b2f32..dd5103c1f 100644 --- a/problems/longest-common-prefix/README.md +++ b/problems/longest-common-prefix/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/roman-to-integer "Roman to Integer") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/3sum "3Sum") + ## 14. Longest Common Prefix (Easy)

Write a function to find the longest common prefix string amongst an array of strings.

diff --git a/problems/longest-harmonious-subsequence/README.md b/problems/longest-harmonious-subsequence/README.md index 9e01a0618..48b6cabd7 100644 --- a/problems/longest-harmonious-subsequence/README.md +++ b/problems/longest-harmonious-subsequence/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/valid-square "Valid Square") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/big-countries "Big Countries") + ## 594. Longest Harmonious Subsequence (Easy)

We define a harmonious array is an array where the difference between its maximum value and its minimum value is exactly 1.

diff --git a/problems/longest-increasing-path-in-a-matrix/README.md b/problems/longest-increasing-path-in-a-matrix/README.md index 6cadfd5fb..614c464a5 100644 --- a/problems/longest-increasing-path-in-a-matrix/README.md +++ b/problems/longest-increasing-path-in-a-matrix/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/odd-even-linked-list "Odd Even Linked List") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/patching-array "Patching Array") + ## 329. Longest Increasing Path in a Matrix (Hard)

Given an integer matrix, find the length of the longest increasing path.

diff --git a/problems/longest-palindrome/README.md b/problems/longest-palindrome/README.md index aa9ed7917..6c7f27f4a 100644 --- a/problems/longest-palindrome/README.md +++ b/problems/longest-palindrome/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/valid-word-abbreviation "Valid Word Abbreviation") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/split-array-largest-sum "Split Array Largest Sum") + ## 409. Longest Palindrome (Easy)

Given a string which consists of lowercase or uppercase letters, find the length of the longest palindromes that can be built with those letters.

diff --git a/problems/longest-palindromic-substring/README.md b/problems/longest-palindromic-substring/README.md index 546a28b31..d81a91a24 100644 --- a/problems/longest-palindromic-substring/README.md +++ b/problems/longest-palindromic-substring/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/median-of-two-sorted-arrays "Median of Two Sorted Arrays") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/zigzag-conversion "ZigZag Conversion") + ## 5. Longest Palindromic Substring (Medium)

Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.

diff --git a/problems/longest-repeating-character-replacement/README.md b/problems/longest-repeating-character-replacement/README.md index f94b8e9ce..f86147472 100644 --- a/problems/longest-repeating-character-replacement/README.md +++ b/problems/longest-repeating-character-replacement/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/reconstruct-original-digits-from-english "Reconstruct Original Digits from English") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/word-squares "Word Squares") + ## 424. Longest Repeating Character Replacement (Medium)

Given a string that consists of only uppercase English letters, you can replace any letter in the string with another letter at most k times. Find the length of a longest substring containing all repeating letters you can get after performing the above operations.

diff --git a/problems/longest-substring-with-at-least-k-repeating-characters/README.md b/problems/longest-substring-with-at-least-k-repeating-characters/README.md index b550641e8..05f5c58c8 100644 --- a/problems/longest-substring-with-at-least-k-repeating-characters/README.md +++ b/problems/longest-substring-with-at-least-k-repeating-characters/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/decode-string "Decode String") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/rotate-function "Rotate Function") + ## 395. Longest Substring with At Least K Repeating Characters (Medium)

diff --git a/problems/longest-substring-with-at-most-k-distinct-characters/README.md b/problems/longest-substring-with-at-most-k-distinct-characters/README.md index 6e309d8fc..a7fa7557a 100644 --- a/problems/longest-substring-with-at-most-k-distinct-characters/README.md +++ b/problems/longest-substring-with-at-most-k-distinct-characters/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/nested-list-weight-sum "Nested List Weight Sum") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/flatten-nested-list-iterator "Flatten Nested List Iterator") + ## 340. Longest Substring with At Most K Distinct Characters (Hard) diff --git a/problems/longest-substring-with-at-most-two-distinct-characters/README.md b/problems/longest-substring-with-at-most-two-distinct-characters/README.md index 7073ea20b..af08116d0 100644 --- a/problems/longest-substring-with-at-most-two-distinct-characters/README.md +++ b/problems/longest-substring-with-at-most-two-distinct-characters/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/read-n-characters-given-read4-ii-call-multiple-times "Read N Characters Given Read4 II - Call multiple times") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/intersection-of-two-linked-lists "Intersection of Two Linked Lists") + ## 159. Longest Substring with At Most Two Distinct Characters (Hard)

Given a string s , find the length of the longest substring t  that contains at most 2 distinct characters.

diff --git a/problems/longest-substring-without-repeating-characters/README.md b/problems/longest-substring-without-repeating-characters/README.md index 155f66285..1b3642802 100644 --- a/problems/longest-substring-without-repeating-characters/README.md +++ b/problems/longest-substring-without-repeating-characters/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/add-two-numbers "Add Two Numbers") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/median-of-two-sorted-arrays "Median of Two Sorted Arrays") + ## 3. Longest Substring Without Repeating Characters (Medium)

Given a string, find the length of the longest substring without repeating characters.

diff --git a/problems/longest-uncommon-subsequence-i/README.md b/problems/longest-uncommon-subsequence-i/README.md index 93ea5cace..d55c11094 100644 --- a/problems/longest-uncommon-subsequence-i/README.md +++ b/problems/longest-uncommon-subsequence-i/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/detect-capital "Detect Capital") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/longest-uncommon-subsequence-ii "Longest Uncommon Subsequence II") + ## 521. Longest Uncommon Subsequence I (Easy)

diff --git a/problems/longest-valid-parentheses/README.md b/problems/longest-valid-parentheses/README.md index 104592c5a..cbef3475b 100644 --- a/problems/longest-valid-parentheses/README.md +++ b/problems/longest-valid-parentheses/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/next-permutation "Next Permutation") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/search-in-rotated-sorted-array "Search in Rotated Sorted Array") + ## 32. Longest Valid Parentheses (Hard)

Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring.

diff --git a/problems/longest-word-in-dictionary-through-deleting/README.md b/problems/longest-word-in-dictionary-through-deleting/README.md index 004551c68..53e49802e 100644 --- a/problems/longest-word-in-dictionary-through-deleting/README.md +++ b/problems/longest-word-in-dictionary-through-deleting/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/continuous-subarray-sum "Continuous Subarray Sum") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/contiguous-array "Contiguous Array") + ## 524. Longest Word in Dictionary through Deleting (Medium)

diff --git a/problems/lowest-common-ancestor-of-a-binary-search-tree/README.md b/problems/lowest-common-ancestor-of-a-binary-search-tree/README.md index ab6c6f78e..720f1d110 100644 --- a/problems/lowest-common-ancestor-of-a-binary-search-tree/README.md +++ b/problems/lowest-common-ancestor-of-a-binary-search-tree/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/palindrome-linked-list "Palindrome Linked List") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/lowest-common-ancestor-of-a-binary-tree "Lowest Common Ancestor of a Binary Tree") + ## 235. Lowest Common Ancestor of a Binary Search Tree (Easy)

Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST.

diff --git a/problems/lru-cache/README.md b/problems/lru-cache/README.md index 67f7479ee..6f10874bf 100644 --- a/problems/lru-cache/README.md +++ b/problems/lru-cache/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/binary-tree-postorder-traversal "Binary Tree Postorder Traversal") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/insertion-sort-list "Insertion Sort List") + ## 146. LRU Cache (Hard)

diff --git a/problems/magical-string/README.md b/problems/magical-string/README.md index 2ede707ea..ca8c05638 100644 --- a/problems/magical-string/README.md +++ b/problems/magical-string/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/sliding-window-median "Sliding Window Median") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/license-key-formatting "License Key Formatting") + ## 481. Magical String (Medium)

diff --git a/problems/majority-element-ii/README.md b/problems/majority-element-ii/README.md index ea6a33cef..c334420a0 100644 --- a/problems/majority-element-ii/README.md +++ b/problems/majority-element-ii/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/summary-ranges "Summary Ranges") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/kth-smallest-element-in-a-bst "Kth Smallest Element in a BST") + ## 229. Majority Element II (Medium)

Given an integer array of size n, find all elements that appear more than ⌊ n/3 ⌋ times.

diff --git a/problems/majority-element/README.md b/problems/majority-element/README.md index 392866df5..7d4fa42c6 100644 --- a/problems/majority-element/README.md +++ b/problems/majority-element/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/excel-sheet-column-title "Excel Sheet Column Title") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/two-sum-iii-data-structure-design "Two Sum III - Data structure design") + ## 169. Majority Element (Easy)

Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.

diff --git a/problems/max-consecutive-ones-ii/README.md b/problems/max-consecutive-ones-ii/README.md index 8df25ea58..e1a7dd01d 100644 --- a/problems/max-consecutive-ones-ii/README.md +++ b/problems/max-consecutive-ones-ii/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/predict-the-winner "Predict the Winner") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/zuma-game "Zuma Game") + ## 487. Max Consecutive Ones II (Medium) diff --git a/problems/max-consecutive-ones/README.md b/problems/max-consecutive-ones/README.md index 3fabf8292..11e6382f5 100644 --- a/problems/max-consecutive-ones/README.md +++ b/problems/max-consecutive-ones/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/find-permutation "Find Permutation") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/predict-the-winner "Predict the Winner") + ## 485. Max Consecutive Ones (Easy)

Given a binary array, find the maximum number of consecutive 1s in this array.

diff --git a/problems/max-points-on-a-line/README.md b/problems/max-points-on-a-line/README.md index 9b639ec56..24669e44f 100644 --- a/problems/max-points-on-a-line/README.md +++ b/problems/max-points-on-a-line/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/sort-list "Sort List") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/evaluate-reverse-polish-notation "Evaluate Reverse Polish Notation") + ## 149. Max Points on a Line (Hard)

Given n points on a 2D plane, find the maximum number of points that lie on the same straight line.

diff --git a/problems/max-sum-of-rectangle-no-larger-than-k/README.md b/problems/max-sum-of-rectangle-no-larger-than-k/README.md index 0d05eced3..ab456a660 100644 --- a/problems/max-sum-of-rectangle-no-larger-than-k/README.md +++ b/problems/max-sum-of-rectangle-no-larger-than-k/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/design-hit-counter "Design Hit Counter") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/nested-list-weight-sum-ii "Nested List Weight Sum II") + ## 363. Max Sum of Rectangle No Larger Than K (Hard)

Given a non-empty 2D matrix matrix and an integer k, find the max sum of a rectangle in the matrix such that its sum is no larger than k.

diff --git a/problems/maximal-square/README.md b/problems/maximal-square/README.md index c4b30e0e3..fb4cb7244 100644 --- a/problems/maximal-square/README.md +++ b/problems/maximal-square/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/contains-duplicate-iii "Contains Duplicate III") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/count-complete-tree-nodes "Count Complete Tree Nodes") + ## 221. Maximal Square (Medium)

Given a 2D binary matrix filled with 0's and 1's, find the largest square containing only 1's and return its area.

diff --git a/problems/maximum-average-subarray-i/README.md b/problems/maximum-average-subarray-i/README.md index 0f5c67b74..7d6fb2398 100644 --- a/problems/maximum-average-subarray-i/README.md +++ b/problems/maximum-average-subarray-i/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/design-search-autocomplete-system "Design Search Autocomplete System") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/maximum-average-subarray-ii "Maximum Average Subarray II") + ## 643. Maximum Average Subarray I (Easy)

diff --git a/problems/maximum-depth-of-binary-tree/README.md b/problems/maximum-depth-of-binary-tree/README.md index 0db164572..dc6a6f4dd 100644 --- a/problems/maximum-depth-of-binary-tree/README.md +++ b/problems/maximum-depth-of-binary-tree/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/binary-tree-zigzag-level-order-traversal "Binary Tree Zigzag Level Order Traversal") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/construct-binary-tree-from-preorder-and-inorder-traversal "Construct Binary Tree from Preorder and Inorder Traversal") + ## 104. Maximum Depth of Binary Tree (Easy)

Given a binary tree, find its maximum depth.

diff --git a/problems/maximum-distance-in-arrays/README.md b/problems/maximum-distance-in-arrays/README.md index 3ec162c8e..c90a80aa1 100644 --- a/problems/maximum-distance-in-arrays/README.md +++ b/problems/maximum-distance-in-arrays/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/add-one-row-to-tree "Add One Row to Tree") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-factorization "Minimum Factorization") + ## 624. Maximum Distance in Arrays (Easy)

diff --git a/problems/maximum-length-of-pair-chain/README.md b/problems/maximum-length-of-pair-chain/README.md index 86828940f..4605397bf 100644 --- a/problems/maximum-length-of-pair-chain/README.md +++ b/problems/maximum-length-of-pair-chain/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/set-mismatch "Set Mismatch") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/palindromic-substrings "Palindromic Substrings") + ## 646. Maximum Length of Pair Chain (Medium)

diff --git a/problems/maximum-product-of-word-lengths/README.md b/problems/maximum-product-of-word-lengths/README.md index d22d9994c..6177050d6 100644 --- a/problems/maximum-product-of-word-lengths/README.md +++ b/problems/maximum-product-of-word-lengths/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/shortest-distance-from-all-buildings "Shortest Distance from All Buildings") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/bulb-switcher "Bulb Switcher") + ## 318. Maximum Product of Word Lengths (Medium)

Given a string array words, find the maximum value of length(word[i]) * length(word[j]) where the two words do not share common letters. You may assume that each word will contain only lower case letters. If no such two words exist, return 0.

diff --git a/problems/maximum-vacation-days/README.md b/problems/maximum-vacation-days/README.md index aadacf7e5..ff0f18bc5 100644 --- a/problems/maximum-vacation-days/README.md +++ b/problems/maximum-vacation-days/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/permutation-in-string "Permutation in String") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/median-employee-salary "Median Employee Salary") + ## 568. Maximum Vacation Days (Hard) diff --git a/problems/meeting-rooms/README.md b/problems/meeting-rooms/README.md index a24115172..09286b5a5 100644 --- a/problems/meeting-rooms/README.md +++ b/problems/meeting-rooms/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/flatten-2d-vector "Flatten 2D Vector") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/meeting-rooms-ii "Meeting Rooms II") + ## 252. Meeting Rooms (Easy) diff --git a/problems/merge-two-binary-trees/README.md b/problems/merge-two-binary-trees/README.md index 8541b957f..eb63849e1 100644 --- a/problems/merge-two-binary-trees/README.md +++ b/problems/merge-two-binary-trees/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/add-bold-tag-in-string "Add Bold Tag in String") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/students-report-by-geography "Students Report By Geography") + ## 617. Merge Two Binary Trees (Easy)

Given two binary trees and imagine that when you put one of them to cover the other, some nodes of the two trees are overlapped while the others are not.

diff --git a/problems/minimum-absolute-difference-in-bst/README.md b/problems/minimum-absolute-difference-in-bst/README.md index 87d0df830..675621cd4 100644 --- a/problems/minimum-absolute-difference-in-bst/README.md +++ b/problems/minimum-absolute-difference-in-bst/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/minesweeper "Minesweeper") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/lonely-pixel-i "Lonely Pixel I") + ## 530. Minimum Absolute Difference in BST (Easy)

Given a binary search tree with non-negative values, find the minimum absolute difference between values of any two nodes.

diff --git a/problems/minimum-depth-of-binary-tree/README.md b/problems/minimum-depth-of-binary-tree/README.md index 327c233b9..063d0aadc 100644 --- a/problems/minimum-depth-of-binary-tree/README.md +++ b/problems/minimum-depth-of-binary-tree/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/balanced-binary-tree "Balanced Binary Tree") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/path-sum "Path Sum") + ## 111. Minimum Depth of Binary Tree (Easy)

Given a binary tree, find its minimum depth.

diff --git a/problems/minimum-genetic-mutation/README.md b/problems/minimum-genetic-mutation/README.md index 46e9d8075..b2431f9f9 100644 --- a/problems/minimum-genetic-mutation/README.md +++ b/problems/minimum-genetic-mutation/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/all-oone-data-structure "All O`one Data Structure") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/number-of-segments-in-a-string "Number of Segments in a String") + ## 433. Minimum Genetic Mutation (Medium)

A gene string can be represented by an 8-character long string, with choices from "A", "C", "G", "T".

diff --git a/problems/minimum-index-sum-of-two-lists/README.md b/problems/minimum-index-sum-of-two-lists/README.md index febffb332..fbdb211fe 100644 --- a/problems/minimum-index-sum-of-two-lists/README.md +++ b/problems/minimum-index-sum-of-two-lists/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/range-addition-ii "Range Addition II") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/non-negative-integers-without-consecutive-ones "Non-negative Integers without Consecutive Ones") + ## 599. Minimum Index Sum of Two Lists (Easy)

diff --git a/problems/minimum-moves-to-equal-array-elements-ii/README.md b/problems/minimum-moves-to-equal-array-elements-ii/README.md index 1410d5e68..b6227036e 100644 --- a/problems/minimum-moves-to-equal-array-elements-ii/README.md +++ b/problems/minimum-moves-to-equal-array-elements-ii/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/hamming-distance "Hamming Distance") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/island-perimeter "Island Perimeter") + ## 462. Minimum Moves to Equal Array Elements II (Medium)

Given a non-empty integer array, find the minimum number of moves required to make all array elements equal, where a move is incrementing a selected element by 1 or decrementing a selected element by 1.

diff --git a/problems/minimum-number-of-arrows-to-burst-balloons/README.md b/problems/minimum-number-of-arrows-to-burst-balloons/README.md index c4cb8d898..cc41fc75b 100644 --- a/problems/minimum-number-of-arrows-to-burst-balloons/README.md +++ b/problems/minimum-number-of-arrows-to-burst-balloons/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/sort-characters-by-frequency "Sort Characters By Frequency") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-moves-to-equal-array-elements "Minimum Moves to Equal Array Elements") + ## 452. Minimum Number of Arrows to Burst Balloons (Medium)

There are a number of spherical balloons spread in two-dimensional space. For each balloon, provided input is the start and end coordinates of the horizontal diameter. Since it's horizontal, y-coordinates don't matter and hence the x-coordinates of start and end of the diameter suffice. Start is always smaller than end. There will be at most 104 balloons.

diff --git a/problems/minimum-time-difference/README.md b/problems/minimum-time-difference/README.md index 23cdefeb3..5891221a9 100644 --- a/problems/minimum-time-difference/README.md +++ b/problems/minimum-time-difference/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/convert-bst-to-greater-tree "Convert BST to Greater Tree") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/single-element-in-a-sorted-array "Single Element in a Sorted Array") + ## 539. Minimum Time Difference (Medium) Given a list of 24-hour clock time points in "Hour:Minutes" format, find the minimum minutes difference between any two time points in the list. diff --git a/problems/missing-number/README.md b/problems/missing-number/README.md index 67d835139..3802e1cc7 100644 --- a/problems/missing-number/README.md +++ b/problems/missing-number/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/palindrome-permutation-ii "Palindrome Permutation II") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/alien-dictionary "Alien Dictionary") + ## 268. Missing Number (Easy)

Given an array containing n distinct numbers taken from 0, 1, 2, ..., n, find the one that is missing from the array.

diff --git a/problems/paint-house-ii/README.md b/problems/paint-house-ii/README.md index 34e249249..32b517000 100644 --- a/problems/paint-house-ii/README.md +++ b/problems/paint-house-ii/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/ugly-number-ii "Ugly Number II") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/palindrome-permutation "Palindrome Permutation") + ## 265. Paint House II (Hard) diff --git a/problems/paint-house/README.md b/problems/paint-house/README.md index 5c972b8a8..b4bfe8509 100644 --- a/problems/paint-house/README.md +++ b/problems/paint-house/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/verify-preorder-sequence-in-binary-search-tree "Verify Preorder Sequence in Binary Search Tree") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/binary-tree-paths "Binary Tree Paths") + ## 256. Paint House (Easy) diff --git a/problems/perfect-squares/README.md b/problems/perfect-squares/README.md index a2d5ed41a..2f6281e33 100644 --- a/problems/perfect-squares/README.md +++ b/problems/perfect-squares/README.md @@ -5,6 +5,10 @@ +[< Previous](https://github.com/openset/leetcode/tree/master/problems/first-bad-version "First Bad Version") +　　　　　　　　　　　　　　　　 +[Next >](https://github.com/openset/leetcode/tree/master/problems/wiggle-sort "Wiggle Sort") + ## 279. Perfect Squares (Medium)

Given a positive integer n, find the least number of perfect square numbers (for example, 1, 4, 9, 16, ...) which sum to n.