Given a matrix consists of 0 and 1, find the distance of the nearest 0 for each cell.
diff --git a/problems/1-bit-and-2-bit-characters/README.md b/problems/1-bit-and-2-bit-characters/README.md index 260540343..4dd3a52e0 100644 --- a/problems/1-bit-and-2-bit-characters/README.md +++ b/problems/1-bit-and-2-bit-characters/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/maximum-length-of-repeated-subarray "Maximum Length of Repeated Subarray") -## 717. 1-bit and 2-bit Characters (Easy) +## [717. 1-bit and 2-bit Characters (Easy)](https://leetcode.com/problems/1-bit-and-2-bit-characters "1ๆฏ็นไธ2ๆฏ็นๅญ็ฌฆ")We have two special characters. The first character can be represented by one bit 0. The second character can be represented by two bits (10 or 11).
Given a sequence of n integers a1, a2, ..., an, a 132 pattern is a subsequence ai, aj, ak such diff --git a/problems/2-keys-keyboard/README.md b/problems/2-keys-keyboard/README.md index 8ac93de38..7e0aba8ec 100644 --- a/problems/2-keys-keyboard/README.md +++ b/problems/2-keys-keyboard/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/4-keys-keyboard "4 Keys Keyboard") -## 650. 2 Keys Keyboard (Medium) +## [650. 2 Keys Keyboard (Medium)](https://leetcode.com/problems/2-keys-keyboard "ๅชๆไธคไธช้ฎ็้ฎ็")
Initially on a notepad only one character 'A' is present. You can perform two operations on this notepad for each step:
diff --git a/problems/24-game/README.md b/problems/24-game/README.md index d69491f86..8a3d10396 100644 --- a/problems/24-game/README.md +++ b/problems/24-game/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/valid-palindrome-ii "Valid Palindrome II") -## 679. 24 Game (Hard) +## [679. 24 Game (Hard)](https://leetcode.com/problems/24-game "24 ็นๆธธๆ")
You have 4 cards each containing a number from 1 to 9. You need to judge whether they could operated through *, /, +, -, (, ) to get the value of 24.
diff --git a/problems/3sum-closest/README.md b/problems/3sum-closest/README.md
index 49080edca..68daac163 100644
--- a/problems/3sum-closest/README.md
+++ b/problems/3sum-closest/README.md
@@ -9,7 +9,7 @@
ใใใใใใใใใใใใใใใใ
[Next >](https://github.com/openset/leetcode/tree/master/problems/letter-combinations-of-a-phone-number "Letter Combinations of a Phone Number")
-## 16. 3Sum Closest (Medium)
+## [16. 3Sum Closest (Medium)](https://leetcode.com/problems/3sum-closest "ๆๆฅ่ฟ็ไธๆฐไนๅ")
Given an array nums of n integers and an integer target, find three integers in nums such that the sum is closest to target. Return the sum of the three integers. You may assume that each input would have exactly one solution.
Given an integer array A, and an integer target, return the number of tuples i, j, k such that i < j < k and A[i] + A[j] + A[k] == target.
Given an array nums of n integers, are there elements a, b, c in nums such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.
Imagine you have a special keyboard with the following keys:
Key 1: (A): Print one 'A' on screen.
Given four lists A, B, C, D of integer values, compute how many tuples (i, j, k, l) there are such that A[i] + B[j] + C[k] + D[l] is zero.
Given an array nums of n integers and an integer target, are there elements a, b, c, and d in nums such that a + b + c + d = target? Find all unique quadruplets in the array which gives the sum of target.
Given a list accounts, each element accounts[i] is a list of strings, where the first element accounts[i][0] is a name, and the rest of the elements are emails representing emails of the account.
Design a data structure that supports the following two operations:
diff --git a/problems/add-binary/README.md b/problems/add-binary/README.md index 049abe0b6..5e28afa29 100644 --- a/problems/add-binary/README.md +++ b/problems/add-binary/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/text-justification "Text Justification") -## 67. Add Binary (Easy) +## [67. Add Binary (Easy)](https://leetcode.com/problems/add-binary "ไบ่ฟๅถๆฑๅ")Given two binary strings, return their sum (also a binary string).
diff --git a/problems/add-bold-tag-in-string/README.md b/problems/add-bold-tag-in-string/README.md index a65a9fac3..ba2674109 100644 --- a/problems/add-bold-tag-in-string/README.md +++ b/problems/add-bold-tag-in-string/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/merge-two-binary-trees "Merge Two Binary Trees") -## 616. Add Bold Tag in String (Medium) +## [616. Add Bold Tag in String (Medium)](https://leetcode.com/problems/add-bold-tag-in-string "็ปๅญ็ฌฆไธฒๆทปๅ ๅ ็ฒๆ ็ญพ") diff --git a/problems/add-digits/README.md b/problems/add-digits/README.md index 6dfe06bb7..c9fffa4c5 100644 --- a/problems/add-digits/README.md +++ b/problems/add-digits/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/3sum-smaller "3Sum Smaller") -## 258. Add Digits (Easy) +## [258. Add Digits (Easy)](https://leetcode.com/problems/add-digits "ๅไฝ็ธๅ ")Given a non-negative integer num, repeatedly add all its digits until the result has only one digit.
Given the root of a binary tree, then value v and depth d, you need to add a row of nodes with value v at the given depth d. The root node is at depth 1.
Given two non-negative integers num1 and num2 represented as string, return the sum of num1 and num2.
For a non-negative integer X, the array-form of X is an array of its digits in left to right order. For example, if X = 1231, then the array form is [1,2,3,1].
You are given two non-empty linked lists representing two non-negative integers. The most significant digit comes first and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.
diff --git a/problems/add-two-numbers/README.md b/problems/add-two-numbers/README.md index 539f95fb0..1113d8ea6 100644 --- a/problems/add-two-numbers/README.md +++ b/problems/add-two-numbers/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/longest-substring-without-repeating-characters "Longest Substring Without Repeating Characters") -## 2. Add Two Numbers (Medium) +## [2. Add Two Numbers (Medium)](https://leetcode.com/problems/add-two-numbers "ไธคๆฐ็ธๅ ")You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.
diff --git a/problems/adding-two-negabinary-numbers/README.md b/problems/adding-two-negabinary-numbers/README.md index 19735fb1e..41323503a 100644 --- a/problems/adding-two-negabinary-numbers/README.md +++ b/problems/adding-two-negabinary-numbers/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/number-of-submatrices-that-sum-to-target "Number of Submatrices That Sum to Target") -## 1073. Adding Two Negabinary Numbers (Medium) +## [1073. Adding Two Negabinary Numbers (Medium)](https://leetcode.com/problems/adding-two-negabinary-numbers "่ดไบ่ฟๅถๆฐ็ธๅ ")Given two numbers arr1 and arr2 in base -2, return the result of adding them together.
Additive number is a string whose digits can form additive sequence.
diff --git a/problems/advantage-shuffle/README.md b/problems/advantage-shuffle/README.md index 3e1489f39..a3ca3e455 100644 --- a/problems/advantage-shuffle/README.md +++ b/problems/advantage-shuffle/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-number-of-refueling-stops "Minimum Number of Refueling Stops") -## 870. Advantage Shuffle (Medium) +## [870. Advantage Shuffle (Medium)](https://leetcode.com/problems/advantage-shuffle "ไผๅฟๆด็")Given two arrays A and B of equal size, the advantage of A with respect to B is the number of indices i for which A[i] > B[i].
We are given a binary tree (with root node root), a target node, and an integer value K.
Implement a data structure supporting the following operations:
diff --git a/problems/all-paths-from-source-lead-to-destination/README.md b/problems/all-paths-from-source-lead-to-destination/README.md index d53611146..aa6b72a74 100644 --- a/problems/all-paths-from-source-lead-to-destination/README.md +++ b/problems/all-paths-from-source-lead-to-destination/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/missing-element-in-sorted-array "Missing Element in Sorted Array") -## 1059. All Paths from Source Lead to Destination (Medium) +## [1059. All Paths from Source Lead to Destination (Medium)](https://leetcode.com/problems/all-paths-from-source-lead-to-destination "ไปๅง็นๅฐ็ป็น็ๆๆ่ทฏๅพ")Given the edges of a directed graph, and two nodes source and destination of this graph, determine whether or not all paths starting from source eventually end at destination, that is:
Given a directed, acyclic graph of N nodes. Find all possible paths from node 0 to node N-1, and return them in any order.
A full binary tree is a binary tree where each node has exactly 0 or 2 children.
diff --git a/problems/alphabet-board-path/README.md b/problems/alphabet-board-path/README.md index 5fb6a987b..9169fcb53 100644 --- a/problems/alphabet-board-path/README.md +++ b/problems/alphabet-board-path/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/largest-1-bordered-square "Largest 1-Bordered Square") -## 1138. Alphabet Board Path (Medium) +## [1138. Alphabet Board Path (Medium)](https://leetcode.com/problems/alphabet-board-path "ๅญๆฏๆฟไธ็่ทฏๅพ")On an alphabet board, we start at position (0, 0), corresponding to character board[0][0].
We had some 2-dimensional coordinates, like "(1, 3)" or "(2, 0.5)". Then, we removed all commas, decimal points, and spaces, and ended up with the string S. Return a list of strings representing all possibilities for what our original coordinates could have been.
A sequence of numbers is called arithmetic if it consists of at least three elements and if the difference between any two consecutive elements is the same.
diff --git a/problems/arithmetic-slices/README.md b/problems/arithmetic-slices/README.md index b492e772e..558f11dcb 100644 --- a/problems/arithmetic-slices/README.md +++ b/problems/arithmetic-slices/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/third-maximum-number "Third Maximum Number") -## 413. Arithmetic Slices (Medium) +## [413. Arithmetic Slices (Medium)](https://leetcode.com/problems/arithmetic-slices "็ญๅทฎๆฐๅๅๅ")A sequence of number is called arithmetic if it consists of at least three elements and if the difference between any two consecutive elements is the same.
diff --git a/problems/armstrong-number/README.md b/problems/armstrong-number/README.md index f005fcda9..1c759dd13 100644 --- a/problems/armstrong-number/README.md +++ b/problems/armstrong-number/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/connecting-cities-with-minimum-cost "Connecting Cities With Minimum Cost") -## 1134. Armstrong Number (Easy) +## [1134. Armstrong Number (Easy)](https://leetcode.com/problems/armstrong-number "้ฟๅงๆฏ็นๆๆฐ") diff --git a/problems/arranging-coins/README.md b/problems/arranging-coins/README.md index 50e0d6f23..b36f01797 100644 --- a/problems/arranging-coins/README.md +++ b/problems/arranging-coins/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/find-all-duplicates-in-an-array "Find All Duplicates in an Array") -## 441. Arranging Coins (Easy) +## [441. Arranging Coins (Easy)](https://leetcode.com/problems/arranging-coins "ๆๅ็กฌๅธ")You have a total of n coins that you want to form in a staircase shape, where every k-th row must have exactly k coins.
diff --git a/problems/array-nesting/README.md b/problems/array-nesting/README.md index 07b1b708e..bacb1b266 100644 --- a/problems/array-nesting/README.md +++ b/problems/array-nesting/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/reshape-the-matrix "Reshape the Matrix") -## 565. Array Nesting (Medium) +## [565. Array Nesting (Medium)](https://leetcode.com/problems/array-nesting "ๆฐ็ปๅตๅฅ")A zero-indexed array A of length N contains all integers from 0 to N-1. Find and return the longest length of set S, where S[i] = {A[i], A[A[i]], A[A[A[i]]], ... } subjected to the rule below.
diff --git a/problems/array-of-doubled-pairs/README.md b/problems/array-of-doubled-pairs/README.md index 34b1f844a..57aa8de4f 100644 --- a/problems/array-of-doubled-pairs/README.md +++ b/problems/array-of-doubled-pairs/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/delete-columns-to-make-sorted-ii "Delete Columns to Make Sorted II") -## 954. Array of Doubled Pairs (Medium) +## [954. Array of Doubled Pairs (Medium)](https://leetcode.com/problems/array-of-doubled-pairs "ไบๅๆฐๅฏนๆฐ็ป")Given an array of integers A with even length, return true if and only if it is possible to reorder it such that A[2 * i + 1] = 2 * A[2 * i] for every 0 <= i < len(A) / 2.
Given an array of 2n integers, your task is to group these integers into n pairs of integer, say (a1, b1), (a2, b2), ..., (an, bn) which makes sum of min(ai, bi) for all i from 1 to n as large as possible. diff --git a/problems/article-views-i/README.md b/problems/article-views-i/README.md index 668d9f60b..1991afa6b 100644 --- a/problems/article-views-i/README.md +++ b/problems/article-views-i/README.md @@ -9,6 +9,6 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/article-views-ii "Article Views II") -## 1148. Article Views I (Easy) +## [1148. Article Views I (Easy)](https://leetcode.com/problems/article-views-i "") diff --git a/problems/article-views-ii/README.md b/problems/article-views-ii/README.md index cf2bc319f..89ac1d235 100644 --- a/problems/article-views-ii/README.md +++ b/problems/article-views-ii/README.md @@ -9,6 +9,6 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/check-if-a-number-is-majority-element-in-a-sorted-array "Check If a Number Is Majority Element in a Sorted Array") -## 1149. Article Views II (Medium) +## [1149. Article Views II (Medium)](https://leetcode.com/problems/article-views-ii "") diff --git a/problems/as-far-from-land-as-possible/README.md b/problems/as-far-from-land-as-possible/README.md index 27457ed7b..108a4ee86 100644 --- a/problems/as-far-from-land-as-possible/README.md +++ b/problems/as-far-from-land-as-possible/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/last-substring-in-lexicographical-order "Last Substring in Lexicographical Order") -## 1162. As Far from Land as Possible (Medium) +## [1162. As Far from Land as Possible (Medium)](https://leetcode.com/problems/as-far-from-land-as-possible "ๅฐๅพๅๆ")
Given an N x N grid containing only values 0 and 1, where 0 represents water and 1 represents land, find a water cell such that its distance to the nearest land cell is maximized and return the distance.
Assume you are an awesome parent and want to give your children some cookies. But, you should give each child at most one cookie. Each child i has a greed factor gi, which is the minimum size of a cookie that the child will be content with; and each cookie j has a size sj. If sj >= gi, we can assign the cookie j to the child i, and the child i will be content. Your goal is to maximize the number of your content children and output the maximum number. diff --git a/problems/asteroid-collision/README.md b/problems/asteroid-collision/README.md index 157504772..b8a2887d6 100644 --- a/problems/asteroid-collision/README.md +++ b/problems/asteroid-collision/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/parse-lisp-expression "Parse Lisp Expression") -## 735. Asteroid Collision (Medium) +## [735. Asteroid Collision (Medium)](https://leetcode.com/problems/asteroid-collision "่กๆ็ขฐๆ")
We are given an array asteroids of integers representing asteroids in a row.
diff --git a/problems/available-captures-for-rook/README.md b/problems/available-captures-for-rook/README.md
index f0d7b2298..4efa68d81 100644
--- a/problems/available-captures-for-rook/README.md
+++ b/problems/available-captures-for-rook/README.md
@@ -9,7 +9,7 @@
ใใใใใใใใใใใใใใใใ
[Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-cost-to-merge-stones "Minimum Cost to Merge Stones")
-## 999. Available Captures for Rook (Easy)
+## [999. Available Captures for Rook (Easy)](https://leetcode.com/problems/available-captures-for-rook "่ฝฆ็ๅฏ็จๆ่ท้")
On an 8 x 8 chessboard, there is one white rook. There also may be empty squares, white bishops, and black pawns. These are given as characters 'R', '.', 'B', and 'p' respectively. Uppercase characters represent white pieces, and lowercase characters represent black pieces.
diff --git a/problems/average-of-levels-in-binary-tree/README.md b/problems/average-of-levels-in-binary-tree/README.md index 9162f32df..9d7ddcafb 100644 --- a/problems/average-of-levels-in-binary-tree/README.md +++ b/problems/average-of-levels-in-binary-tree/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/shopping-offers "Shopping Offers") -## 637. Average of Levels in Binary Tree (Easy) +## [637. Average of Levels in Binary Tree (Easy)](https://leetcode.com/problems/average-of-levels-in-binary-tree "ไบๅๆ ็ๅฑๅนณๅๅผ") Given a non-empty binary tree, return the average value of the nodes on each level in the form of an array. diff --git a/problems/average-salary-departments-vs-company/README.md b/problems/average-salary-departments-vs-company/README.md index 13186c5e2..3ca09ca73 100644 --- a/problems/average-salary-departments-vs-company/README.md +++ b/problems/average-salary-departments-vs-company/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/add-bold-tag-in-string "Add Bold Tag in String") -## 615. Average Salary: Departments VS Company (Hard) +## [615. Average Salary: Departments VS Company (Hard)](https://leetcode.com/problems/average-salary-departments-vs-company "ๅนณๅๅทฅ่ต๏ผ้จ้จไธๅ ฌๅธๆฏ่พ") Given two tables as below, write a query to display the comparison result (higher/lower/same) of the average salary of employees in a department to the company's average salary.diff --git a/problems/backspace-string-compare/README.md b/problems/backspace-string-compare/README.md index 08d61e33e..74c1bec95 100644 --- a/problems/backspace-string-compare/README.md +++ b/problems/backspace-string-compare/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/longest-mountain-in-array "Longest Mountain in Array") -## 844. Backspace String Compare (Easy) +## [844. Backspace String Compare (Easy)](https://leetcode.com/problems/backspace-string-compare "ๆฏ่พๅซ้ๆ ผ็ๅญ็ฌฆไธฒ")
Given two strings S and T, return if they are equal when both are typed into empty text editors. # means a backspace character.
You have an initial power P, an initial score of 0 points, and a bag of tokens.
Given a binary tree, determine if it is height-balanced.
diff --git a/problems/base-7/README.md b/problems/base-7/README.md index 6e17c21f2..7d207887d 100644 --- a/problems/base-7/README.md +++ b/problems/base-7/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/the-maze-ii "The Maze II") -## 504. Base 7 (Easy) +## [504. Base 7 (Easy)](https://leetcode.com/problems/base-7 "ไธ่ฟๅถๆฐ")Given an integer, return its base 7 string representation.
diff --git a/problems/baseball-game/README.md b/problems/baseball-game/README.md index bd2afbad3..72c31eabf 100644 --- a/problems/baseball-game/README.md +++ b/problems/baseball-game/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/k-empty-slots "K Empty Slots") -## 682. Baseball Game (Easy) +## [682. Baseball Game (Easy)](https://leetcode.com/problems/baseball-game "ๆฃ็ๆฏ่ต")You're now a baseball game point recorder. diff --git a/problems/basic-calculator-ii/README.md b/problems/basic-calculator-ii/README.md index 65318a7ee..4c9974439 100644 --- a/problems/basic-calculator-ii/README.md +++ b/problems/basic-calculator-ii/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/summary-ranges "Summary Ranges") -## 227. Basic Calculator II (Medium) +## [227. Basic Calculator II (Medium)](https://leetcode.com/problems/basic-calculator-ii "ๅบๆฌ่ฎก็ฎๅจ II")
Implement a basic calculator to evaluate a simple expression string.
diff --git a/problems/basic-calculator-iii/README.md b/problems/basic-calculator-iii/README.md index 191307387..7fff33b94 100644 --- a/problems/basic-calculator-iii/README.md +++ b/problems/basic-calculator-iii/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/sliding-puzzle "Sliding Puzzle") -## 772. Basic Calculator III (Hard) +## [772. Basic Calculator III (Hard)](https://leetcode.com/problems/basic-calculator-iii "ๅบๆฌ่ฎก็ฎๅจ III") diff --git a/problems/basic-calculator-iv/README.md b/problems/basic-calculator-iv/README.md index 6489701f1..16b146ec8 100644 --- a/problems/basic-calculator-iv/README.md +++ b/problems/basic-calculator-iv/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/jewels-and-stones "Jewels and Stones") -## 770. Basic Calculator IV (Hard) +## [770. Basic Calculator IV (Hard)](https://leetcode.com/problems/basic-calculator-iv "ๅบๆฌ่ฎก็ฎๅจ IV")Given an expression such as expression = "e + 8 - a + 5" and an evaluation map such as {"e": 1} (given in terms of evalvars = ["e"] and evalints = [1]), return a list of tokens representing the simplified expression, such as ["-1*a","14"]
Implement a basic calculator to evaluate a simple expression string.
diff --git a/problems/battleships-in-a-board/README.md b/problems/battleships-in-a-board/README.md index 87f4db8d6..7b49edcc7 100644 --- a/problems/battleships-in-a-board/README.md +++ b/problems/battleships-in-a-board/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/strong-password-checker "Strong Password Checker") -## 419. Battleships in a Board (Medium) +## [419. Battleships in a Board (Medium)](https://leetcode.com/problems/battleships-in-a-board "็ฒๆฟไธ็ๆ่ฐ") Given an 2D board, count how many battleships are in it. The battleships are represented with'X's, empty slots are represented with '.'s. You may assume the following rules:
diff --git a/problems/beautiful-arrangement-ii/README.md b/problems/beautiful-arrangement-ii/README.md
index 0c81ddf9a..4050dc888 100644
--- a/problems/beautiful-arrangement-ii/README.md
+++ b/problems/beautiful-arrangement-ii/README.md
@@ -9,7 +9,7 @@
ใใใใใใใใใใใใใใใใ
[Next >](https://github.com/openset/leetcode/tree/master/problems/kth-smallest-number-in-multiplication-table "Kth Smallest Number in Multiplication Table")
-## 667. Beautiful Arrangement II (Medium)
+## [667. Beautiful Arrangement II (Medium)](https://leetcode.com/problems/beautiful-arrangement-ii "ไผ็พ็ๆๅ II")
Given two integers n and k, you need to construct a list which contains n different positive integers ranging from 1 to n and obeys the following requirement:
diff --git a/problems/beautiful-arrangement/README.md b/problems/beautiful-arrangement/README.md
index 2ac2cb3c2..7a772f6ae 100644
--- a/problems/beautiful-arrangement/README.md
+++ b/problems/beautiful-arrangement/README.md
@@ -9,7 +9,7 @@
ใใใใใใใใใใใใใใใใ
[Next >](https://github.com/openset/leetcode/tree/master/problems/word-abbreviation "Word Abbreviation")
-## 526. Beautiful Arrangement (Medium)
+## [526. Beautiful Arrangement (Medium)](https://leetcode.com/problems/beautiful-arrangement "ไผ็พ็ๆๅ")
Suppose you have N integers from 1 to N. We define a beautiful arrangement as an array that is constructed by these N numbers successfully if one of the following is true for the ith position (1 <= i <= N) in this array:
diff --git a/problems/beautiful-array/README.md b/problems/beautiful-array/README.md index 0e6e32576..e04ac68e7 100644 --- a/problems/beautiful-array/README.md +++ b/problems/beautiful-array/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/number-of-recent-calls "Number of Recent Calls") -## 932. Beautiful Array (Medium) +## [932. Beautiful Array (Medium)](https://leetcode.com/problems/beautiful-array "ๆผไบฎๆฐ็ป")For some fixed N, an array A is beautiful if it is a permutation of the integers 1, 2, ..., N, such that:
Given an array A of positive integers, A[i] represents the value of the i-th sightseeing spot, and two sightseeing spots i and j have distance j - i between them.
Say you have an array for which the ith element is the price of a given stock on day i.
diff --git a/problems/best-time-to-buy-and-sell-stock-iii/README.md b/problems/best-time-to-buy-and-sell-stock-iii/README.md index 2b07bddec..765dde73b 100644 --- a/problems/best-time-to-buy-and-sell-stock-iii/README.md +++ b/problems/best-time-to-buy-and-sell-stock-iii/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/binary-tree-maximum-path-sum "Binary Tree Maximum Path Sum") -## 123. Best Time to Buy and Sell Stock III (Hard) +## [123. Best Time to Buy and Sell Stock III (Hard)](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii "ไนฐๅ่ก็ฅจ็ๆไฝณๆถๆบ III")Say you have an array for which the ith element is the price of a given stock on day i.
diff --git a/problems/best-time-to-buy-and-sell-stock-iv/README.md b/problems/best-time-to-buy-and-sell-stock-iv/README.md index 9de8b7f5d..337decbbc 100644 --- a/problems/best-time-to-buy-and-sell-stock-iv/README.md +++ b/problems/best-time-to-buy-and-sell-stock-iv/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/rotate-array "Rotate Array") -## 188. Best Time to Buy and Sell Stock IV (Hard) +## [188. Best Time to Buy and Sell Stock IV (Hard)](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv "ไนฐๅ่ก็ฅจ็ๆไฝณๆถๆบ IV")Say you have an array for which the i-th element is the price of a given stock on day i.
diff --git a/problems/best-time-to-buy-and-sell-stock-with-cooldown/README.md b/problems/best-time-to-buy-and-sell-stock-with-cooldown/README.md index db4bb8fd9..a677395f9 100644 --- a/problems/best-time-to-buy-and-sell-stock-with-cooldown/README.md +++ b/problems/best-time-to-buy-and-sell-stock-with-cooldown/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-height-trees "Minimum Height Trees") -## 309. Best Time to Buy and Sell Stock with Cooldown (Medium) +## [309. Best Time to Buy and Sell Stock with Cooldown (Medium)](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown "ๆไฝณไนฐๅ่ก็ฅจๆถๆบๅซๅทๅปๆ")Say you have an array for which the ith element is the price of a given stock on day i.
diff --git a/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/README.md b/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/README.md index 90137c03f..5ec74f3eb 100644 --- a/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/README.md +++ b/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/range-module "Range Module") -## 714. Best Time to Buy and Sell Stock with Transaction Fee (Medium) +## [714. Best Time to Buy and Sell Stock with Transaction Fee (Medium)](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee "ไนฐๅ่ก็ฅจ็ๆไฝณๆถๆบๅซๆ็ปญ่ดน")Your are given an array of integers prices, for which the i-th element is the price of a given stock on day i; and a non-negative integer fee representing a transaction fee.
You may complete as many transactions as you like, but you need to pay the transaction fee for each transaction. You may not buy more than 1 share of a stock at a time (ie. you must sell the stock share before you buy again.)
diff --git a/problems/best-time-to-buy-and-sell-stock/README.md b/problems/best-time-to-buy-and-sell-stock/README.md index 433df30d1..1705d22ca 100644 --- a/problems/best-time-to-buy-and-sell-stock/README.md +++ b/problems/best-time-to-buy-and-sell-stock/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-ii "Best Time to Buy and Sell Stock II") -## 121. Best Time to Buy and Sell Stock (Easy) +## [121. Best Time to Buy and Sell Stock (Easy)](https://leetcode.com/problems/best-time-to-buy-and-sell-stock "ไนฐๅ่ก็ฅจ็ๆไฝณๆถๆบ")Say you have an array for which the ith element is the price of a given stock on day i.
diff --git a/problems/big-countries/README.md b/problems/big-countries/README.md index 4af836a6f..789041a13 100644 --- a/problems/big-countries/README.md +++ b/problems/big-countries/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/classes-more-than-5-students "Classes More Than 5 Students") -## 595. Big Countries (Easy) +## [595. Big Countries (Easy)](https://leetcode.com/problems/big-countries "ๅคง็ๅฝๅฎถ")There is a table World
Table my_numbers contains many numbers in column num including duplicated ones.
Can you write a SQL query to find the biggest number, which only appears once.
Given a positive integer N, find and return the longest distance between two consecutive 1's in the binary representation of N.
Given a positive integer, check whether it has alternating bits: namely, if two adjacent bits will always have different values.
diff --git a/problems/binary-prefix-divisible-by-5/README.md b/problems/binary-prefix-divisible-by-5/README.md index 99a11f34e..f1030d7fd 100644 --- a/problems/binary-prefix-divisible-by-5/README.md +++ b/problems/binary-prefix-divisible-by-5/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/next-greater-node-in-linked-list "Next Greater Node In Linked List") -## 1018. Binary Prefix Divisible By 5 (Easy) +## [1018. Binary Prefix Divisible By 5 (Easy)](https://leetcode.com/problems/binary-prefix-divisible-by-5 "ๅฏ่ขซ 5 ๆด้ค็ไบ่ฟๅถๅ็ผ")Given an array A of 0s and 1s, consider N_i: the i-th subarray from A[0] to A[i] interpreted as a binary number (from most-significant-bit to least-significant-bit.)
Implement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST.
diff --git a/problems/binary-search-tree-to-greater-sum-tree/README.md b/problems/binary-search-tree-to-greater-sum-tree/README.md index 858312f62..bf74c778e 100644 --- a/problems/binary-search-tree-to-greater-sum-tree/README.md +++ b/problems/binary-search-tree-to-greater-sum-tree/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-score-triangulation-of-polygon "Minimum Score Triangulation of Polygon") -## 1038. Binary Search Tree to Greater Sum Tree (Medium) +## [1038. Binary Search Tree to Greater Sum Tree (Medium)](https://leetcode.com/problems/binary-search-tree-to-greater-sum-tree "ไปไบๅๆ็ดขๆ ๅฐๆดๅคงๅๆ ")Given the root of a binary search tree with distinct values, modify it so that every node has a new value equal to the sum of the values of the original tree that are greater than or equal to node.val.
Given a sorted (in ascending order) integer array nums of n elements and a target value, write a function to search target in nums. If target exists, then return its index, otherwise return -1.
Given a binary string S (a string consisting only of '0' and '1's) and a positive integer N, return true if and only if for every integer X from 1 to N, the binary representation of X is a substring of S.
In an array A of 0s and 1s, how many non-empty subarrays have sum S?
Given a binary tree, we install cameras on the nodes of the tree.
diff --git a/problems/binary-tree-coloring-game/README.md b/problems/binary-tree-coloring-game/README.md index f22263916..67f8b1efa 100644 --- a/problems/binary-tree-coloring-game/README.md +++ b/problems/binary-tree-coloring-game/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/snapshot-array "Snapshot Array") -## 1145. Binary Tree Coloring Game (Medium) +## [1145. Binary Tree Coloring Game (Medium)](https://leetcode.com/problems/binary-tree-coloring-game "ไบๅๆ ็่ฒๆธธๆ")Two players play a turn based game on a binary tree. We are given the root of this binary tree, and the number of nodes n in the tree. n is odd, and each node has a distinct value from 1 to n.
Given a binary tree, return the inorder traversal of its nodes' values.
diff --git a/problems/binary-tree-level-order-traversal-ii/README.md b/problems/binary-tree-level-order-traversal-ii/README.md index 6e7098913..eb3aa1978 100644 --- a/problems/binary-tree-level-order-traversal-ii/README.md +++ b/problems/binary-tree-level-order-traversal-ii/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/convert-sorted-array-to-binary-search-tree "Convert Sorted Array to Binary Search Tree") -## 107. Binary Tree Level Order Traversal II (Easy) +## [107. Binary Tree Level Order Traversal II (Easy)](https://leetcode.com/problems/binary-tree-level-order-traversal-ii "ไบๅๆ ็ๅฑๆฌก้ๅ II")Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root).
diff --git a/problems/binary-tree-level-order-traversal/README.md b/problems/binary-tree-level-order-traversal/README.md index b96d86ac1..ee83f0976 100644 --- a/problems/binary-tree-level-order-traversal/README.md +++ b/problems/binary-tree-level-order-traversal/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/binary-tree-zigzag-level-order-traversal "Binary Tree Zigzag Level Order Traversal") -## 102. Binary Tree Level Order Traversal (Medium) +## [102. Binary Tree Level Order Traversal (Medium)](https://leetcode.com/problems/binary-tree-level-order-traversal "ไบๅๆ ็ๅฑๆฌก้ๅ")Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).
diff --git a/problems/binary-tree-longest-consecutive-sequence-ii/README.md b/problems/binary-tree-longest-consecutive-sequence-ii/README.md index 4dc6c7382..ecc6a11ed 100644 --- a/problems/binary-tree-longest-consecutive-sequence-ii/README.md +++ b/problems/binary-tree-longest-consecutive-sequence-ii/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/game-play-analysis-iv "Game Play Analysis IV") -## 549. Binary Tree Longest Consecutive Sequence II (Medium) +## [549. Binary Tree Longest Consecutive Sequence II (Medium)](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence-ii "ไบๅๆ ไธญๆ้ฟ็่ฟ็ปญๅบๅ") diff --git a/problems/binary-tree-longest-consecutive-sequence/README.md b/problems/binary-tree-longest-consecutive-sequence/README.md index 967f96328..11bac2bda 100644 --- a/problems/binary-tree-longest-consecutive-sequence/README.md +++ b/problems/binary-tree-longest-consecutive-sequence/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/bulls-and-cows "Bulls and Cows") -## 298. Binary Tree Longest Consecutive Sequence (Medium) +## [298. Binary Tree Longest Consecutive Sequence (Medium)](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence "ไบๅๆ ๆ้ฟ่ฟ็ปญๅบๅ") diff --git a/problems/binary-tree-maximum-path-sum/README.md b/problems/binary-tree-maximum-path-sum/README.md index 026dae992..8bf8689e5 100644 --- a/problems/binary-tree-maximum-path-sum/README.md +++ b/problems/binary-tree-maximum-path-sum/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/valid-palindrome "Valid Palindrome") -## 124. Binary Tree Maximum Path Sum (Hard) +## [124. Binary Tree Maximum Path Sum (Hard)](https://leetcode.com/problems/binary-tree-maximum-path-sum "ไบๅๆ ไธญ็ๆๅคง่ทฏๅพๅ")Given a non-empty binary tree, find the maximum path sum.
diff --git a/problems/binary-tree-paths/README.md b/problems/binary-tree-paths/README.md index cbdda781b..6df4189b2 100644 --- a/problems/binary-tree-paths/README.md +++ b/problems/binary-tree-paths/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/add-digits "Add Digits") -## 257. Binary Tree Paths (Easy) +## [257. Binary Tree Paths (Easy)](https://leetcode.com/problems/binary-tree-paths "ไบๅๆ ็ๆๆ่ทฏๅพ")Given a binary tree, return all root-to-leaf paths.
diff --git a/problems/binary-tree-postorder-traversal/README.md b/problems/binary-tree-postorder-traversal/README.md index 74d818970..926a0321e 100644 --- a/problems/binary-tree-postorder-traversal/README.md +++ b/problems/binary-tree-postorder-traversal/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/lru-cache "LRU Cache") -## 145. Binary Tree Postorder Traversal (Hard) +## [145. Binary Tree Postorder Traversal (Hard)](https://leetcode.com/problems/binary-tree-postorder-traversal "ไบๅๆ ็ๅๅบ้ๅ")Given a binary tree, return the postorder traversal of its nodes' values.
diff --git a/problems/binary-tree-preorder-traversal/README.md b/problems/binary-tree-preorder-traversal/README.md index 52c6da4c3..be1447b53 100644 --- a/problems/binary-tree-preorder-traversal/README.md +++ b/problems/binary-tree-preorder-traversal/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/binary-tree-postorder-traversal "Binary Tree Postorder Traversal") -## 144. Binary Tree Preorder Traversal (Medium) +## [144. Binary Tree Preorder Traversal (Medium)](https://leetcode.com/problems/binary-tree-preorder-traversal "ไบๅๆ ็ๅๅบ้ๅ")Given a binary tree, return the preorder traversal of its nodes' values.
diff --git a/problems/binary-tree-pruning/README.md b/problems/binary-tree-pruning/README.md index b9d7c20c3..703a73320 100644 --- a/problems/binary-tree-pruning/README.md +++ b/problems/binary-tree-pruning/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/bus-routes "Bus Routes") -## 814. Binary Tree Pruning (Medium) +## [814. Binary Tree Pruning (Medium)](https://leetcode.com/problems/binary-tree-pruning "ไบๅๆ ๅชๆ")We are given the head node root of a binary tree, where additionally every node's value is either a 0 or a 1.
Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom.
diff --git a/problems/binary-tree-tilt/README.md b/problems/binary-tree-tilt/README.md index fbc71d875..88b2a8815 100644 --- a/problems/binary-tree-tilt/README.md +++ b/problems/binary-tree-tilt/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/find-the-closest-palindrome "Find the Closest Palindrome") -## 563. Binary Tree Tilt (Easy) +## [563. Binary Tree Tilt (Easy)](https://leetcode.com/problems/binary-tree-tilt "ไบๅๆ ็ๅกๅบฆ")Given a binary tree, return the tilt of the whole tree.
diff --git a/problems/binary-tree-upside-down/README.md b/problems/binary-tree-upside-down/README.md index ae4d2598d..7ea8ca45e 100644 --- a/problems/binary-tree-upside-down/README.md +++ b/problems/binary-tree-upside-down/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/read-n-characters-given-read4 "Read N Characters Given Read4") -## 156. Binary Tree Upside Down (Medium) +## [156. Binary Tree Upside Down (Medium)](https://leetcode.com/problems/binary-tree-upside-down "ไธไธ็ฟป่ฝฌไบๅๆ ") diff --git a/problems/binary-tree-vertical-order-traversal/README.md b/problems/binary-tree-vertical-order-traversal/README.md index 7fb9bce61..9d323bd66 100644 --- a/problems/binary-tree-vertical-order-traversal/README.md +++ b/problems/binary-tree-vertical-order-traversal/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/count-of-smaller-numbers-after-self "Count of Smaller Numbers After Self") -## 314. Binary Tree Vertical Order Traversal (Medium) +## [314. Binary Tree Vertical Order Traversal (Medium)](https://leetcode.com/problems/binary-tree-vertical-order-traversal "ไบๅๆ ็ๅ็ด้ๅ") diff --git a/problems/binary-tree-zigzag-level-order-traversal/README.md b/problems/binary-tree-zigzag-level-order-traversal/README.md index 6ba856d29..72bf179c9 100644 --- a/problems/binary-tree-zigzag-level-order-traversal/README.md +++ b/problems/binary-tree-zigzag-level-order-traversal/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/maximum-depth-of-binary-tree "Maximum Depth of Binary Tree") -## 103. Binary Tree Zigzag Level Order Traversal (Medium) +## [103. Binary Tree Zigzag Level Order Traversal (Medium)](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal "ไบๅๆ ็้ฏ้ฝฟๅฝขๅฑๆฌก้ๅ")Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next level and alternate between).
diff --git a/problems/binary-trees-with-factors/README.md b/problems/binary-trees-with-factors/README.md index 334499d93..393b0705d 100644 --- a/problems/binary-trees-with-factors/README.md +++ b/problems/binary-trees-with-factors/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/goat-latin "Goat Latin") -## 823. Binary Trees With Factors (Medium) +## [823. Binary Trees With Factors (Medium)](https://leetcode.com/problems/binary-trees-with-factors "ๅธฆๅ ๅญ็ไบๅๆ ")Given an array of unique integers, each integer is strictly greater than 1.
diff --git a/problems/binary-watch/README.md b/problems/binary-watch/README.md index 828d19bd1..8a6b895f3 100644 --- a/problems/binary-watch/README.md +++ b/problems/binary-watch/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/remove-k-digits "Remove K Digits") -## 401. Binary Watch (Easy) +## [401. Binary Watch (Easy)](https://leetcode.com/problems/binary-watch "ไบ่ฟๅถๆ่กจ")A binary watch has 4 LEDs on the top which represent the hours (0-11), and the 6 LEDs on the bottom represent the minutes (0-59).
Each LED represents a zero or one, with the least significant bit on the right.
diff --git a/problems/bitwise-and-of-numbers-range/README.md b/problems/bitwise-and-of-numbers-range/README.md index f8137de1e..b0738a994 100644 --- a/problems/bitwise-and-of-numbers-range/README.md +++ b/problems/bitwise-and-of-numbers-range/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/happy-number "Happy Number") -## 201. Bitwise AND of Numbers Range (Medium) +## [201. Bitwise AND of Numbers Range (Medium)](https://leetcode.com/problems/bitwise-and-of-numbers-range "ๆฐๅญ่ๅดๆไฝไธ")Given a range [m, n] where 0 <= m <= n <= 2147483647, return the bitwise AND of all numbers in this range, inclusive.
diff --git a/problems/bitwise-ors-of-subarrays/README.md b/problems/bitwise-ors-of-subarrays/README.md index b2e4cb502..1b9e160c2 100644 --- a/problems/bitwise-ors-of-subarrays/README.md +++ b/problems/bitwise-ors-of-subarrays/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/orderly-queue "Orderly Queue") -## 898. Bitwise ORs of Subarrays (Medium) +## [898. Bitwise ORs of Subarrays (Medium)](https://leetcode.com/problems/bitwise-ors-of-subarrays "ๅญๆฐ็ปๆไฝๆๆไฝ")We have an array A of non-negative integers.
The i-th person has weight people[i], and each boat can carry a maximum weight of limit.
Under a grammar given below, strings can represent a set of lowercase words. Let's use R(expr) to denote the set of words the expression represents.
There is a brick wall in front of you. The wall is rectangular and has several rows of bricks. The bricks have the same height but different width. You want to draw a vertical line from the top to the bottom and cross the least bricks.
diff --git a/problems/bricks-falling-when-hit/README.md b/problems/bricks-falling-when-hit/README.md index 4910dd9a8..a5df4460a 100644 --- a/problems/bricks-falling-when-hit/README.md +++ b/problems/bricks-falling-when-hit/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/unique-morse-code-words "Unique Morse Code Words") -## 803. Bricks Falling When Hit (Hard) +## [803. Bricks Falling When Hit (Hard)](https://leetcode.com/problems/bricks-falling-when-hit "ๆ็ ๅ")We have a grid of 1s and 0s; the 1s in a cell represent bricks. A brick will not drop if and only if it is directly connected to the top of the grid, or at least one of its (4-way) adjacent bricks will not drop.
diff --git a/problems/broken-calculator/README.md b/problems/broken-calculator/README.md index 9197c85ca..3344b03cf 100644 --- a/problems/broken-calculator/README.md +++ b/problems/broken-calculator/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/subarrays-with-k-different-integers "Subarrays with K Different Integers") -## 991. Broken Calculator (Medium) +## [991. Broken Calculator (Medium)](https://leetcode.com/problems/broken-calculator "ๅไบ็่ฎก็ฎๅจ")On a broken calculator that has a number showing on its display, we can perform two operations:
diff --git a/problems/buddy-strings/README.md b/problems/buddy-strings/README.md index 18cf2587a..81a19007a 100644 --- a/problems/buddy-strings/README.md +++ b/problems/buddy-strings/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/lemonade-change "Lemonade Change") -## 859. Buddy Strings (Easy) +## [859. Buddy Strings (Easy)](https://leetcode.com/problems/buddy-strings "ไบฒๅฏๅญ็ฌฆไธฒ")Given two strings A and B of lowercase letters, return true if and only if we can swap two letters in A so that the result equals B.
There are two kinds of threads, oxygen and hydrogen. Your goal is to group these threads to form water molecules. There is a barrier where each thread has to wait until a complete molecule can be formed. Hydrogen and oxygen threads will be given a releaseHydrogen and releaseOxygen method respectfully, which will allow them to pass the barrier. These threads should pass the barrier in groups of three, and they must be able to immediately bond with each other to form a water molecule. You must guarantee that all the threads from one molecule bond before any other threads from the next molecule do.
There is a room with n lights which are turned on initially and 4 buttons on the wall. After performing exactly m unknown operations towards buttons, you need to return how many different kinds of status of the n lights could be.
There are n bulbs that are initially off. You first turn on all the bulbs. Then, you turn off every second bulb. On the third round, you toggle every third bulb (turning on if it's off or turning off if it's on). For the i-th round, you toggle every i bulb. For the n-th round, you only toggle the last bulb. Find how many bulbs are on after n rounds.
diff --git a/problems/bulls-and-cows/README.md b/problems/bulls-and-cows/README.md index ded06569c..146da6f8c 100644 --- a/problems/bulls-and-cows/README.md +++ b/problems/bulls-and-cows/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/longest-increasing-subsequence "Longest Increasing Subsequence") -## 299. Bulls and Cows (Medium) +## [299. Bulls and Cows (Medium)](https://leetcode.com/problems/bulls-and-cows "็ๆฐๅญๆธธๆ")You are playing the following Bulls and Cows game with your friend: You write down a number and ask your friend to guess what the number is. Each time your friend makes a guess, you provide a hint that indicates how many digits in said guess match your secret number exactly in both digit and position (called "bulls") and how many digits match the secret number but locate in the wrong position (called "cows"). Your friend will use successive guesses and hints to eventually derive the secret number.
diff --git a/problems/burst-balloons/README.md b/problems/burst-balloons/README.md index cc793d4da..61e267b4e 100644 --- a/problems/burst-balloons/README.md +++ b/problems/burst-balloons/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/super-ugly-number "Super Ugly Number") -## 312. Burst Balloons (Hard) +## [312. Burst Balloons (Hard)](https://leetcode.com/problems/burst-balloons "ๆณๆฐ็")Given n balloons, indexed from 0 to n-1. Each balloon is painted with a number on it represented by array nums. You are asked to burst all the balloons. If the you burst balloon i you will get nums[left] * nums[i] * nums[right] coins. Here left and right are adjacent indices of i. After the burst, the left and right then becomes adjacent.
We have a list of bus routes. Each routes[i] is a bus route that the i-th bus repeats forever. For example if routes[0] = [1, 5, 7], this means that the first bus (0-th indexed) travels in the sequence 1->5->7->1->5->7->1->... forever.
A query word matches a given pattern if we can insert lowercase letters to the pattern word so that it equals the query. (We may insert each character at any position, and may insert 0 characters.)
On a campus represented as a 2D grid, there are N workers and M bikes, with N <= M. Each worker and bike is a 2D coordinate on this grid.
On a campus represented as a 2D grid, there are N workers and M bikes, with N <= M. Each worker and bike is a 2D coordinate on this grid.
In the "100 game," two players take turns adding, to a running total, any integer from 1..10. The player who first causes the running total to reach or exceed 100 wins.
diff --git a/problems/can-make-palindrome-from-substring/README.md b/problems/can-make-palindrome-from-substring/README.md index 5e5fb291a..9103b7be1 100644 --- a/problems/can-make-palindrome-from-substring/README.md +++ b/problems/can-make-palindrome-from-substring/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/number-of-valid-words-for-each-puzzle "Number of Valid Words for Each Puzzle") -## 1177. Can Make Palindrome from Substring (Medium) +## [1177. Can Make Palindrome from Substring (Medium)](https://leetcode.com/problems/can-make-palindrome-from-substring "ๆๅปบๅๆไธฒๆฃๆต")Given a string s, we make queries on substrings of s.
Suppose you have a long flowerbed in which some of the plots are planted and some are not. However, flowers cannot be planted in adjacent plots - they would compete for water and both would die.
diff --git a/problems/candy-crush/README.md b/problems/candy-crush/README.md index 6e6f1abaf..17b54d074 100644 --- a/problems/candy-crush/README.md +++ b/problems/candy-crush/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/find-pivot-index "Find Pivot Index") -## 723. Candy Crush (Medium) +## [723. Candy Crush (Medium)](https://leetcode.com/problems/candy-crush "็ฒ็ข็ณๆ") diff --git a/problems/candy/README.md b/problems/candy/README.md index 46fb7d3ae..03119f865 100644 --- a/problems/candy/README.md +++ b/problems/candy/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/single-number "Single Number") -## 135. Candy (Hard) +## [135. Candy (Hard)](https://leetcode.com/problems/candy "ๅๅ็ณๆ")There are N children standing in a line. Each child is assigned a rating value.
diff --git a/problems/capacity-to-ship-packages-within-d-days/README.md b/problems/capacity-to-ship-packages-within-d-days/README.md index 1c2f4aaaf..725416682 100644 --- a/problems/capacity-to-ship-packages-within-d-days/README.md +++ b/problems/capacity-to-ship-packages-within-d-days/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/numbers-with-repeated-digits "Numbers With Repeated Digits") -## 1011. Capacity To Ship Packages Within D Days (Medium) +## [1011. Capacity To Ship Packages Within D Days (Medium)](https://leetcode.com/problems/capacity-to-ship-packages-within-d-days "ๅจ D ๅคฉๅ ้่พพๅ ่ฃน็่ฝๅ")A conveyor belt has packages that must be shipped from one port to another within D days.
N cars are going to the same destination along a one lane road. The destination is target miles away.
You are driving a vehicle that has capacity empty seats initially available for passengers. The vehicle only drives east (ie. it cannot turn around and drive west.)
On a table are N cards, with a positive integer printed on the front and back of each card (possibly different).
A game on an undirected graph is played by two players, Mouse and Cat, who alternate turns.
diff --git a/problems/chalkboard-xor-game/README.md b/problems/chalkboard-xor-game/README.md index b7a2b4f97..446f0f6db 100644 --- a/problems/chalkboard-xor-game/README.md +++ b/problems/chalkboard-xor-game/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/subdomain-visit-count "Subdomain Visit Count") -## 810. Chalkboard XOR Game (Hard) +## [810. Chalkboard XOR Game (Hard)](https://leetcode.com/problems/chalkboard-xor-game "้ปๆฟๅผๆๆธธๆ")We are given non-negative integers nums[i] which are written on a chalkboard. Alice and Bob take turns erasing exactly one number from the chalkboard, with Alice starting first. If erasing a number causes the bitwise XOR of all the elements of the chalkboard to become 0, then that player loses. (Also, we'll say the bitwise XOR of one element is that element itself, and the bitwise XOR of no elements is 0.)
diff --git a/problems/champagne-tower/README.md b/problems/champagne-tower/README.md index 863feb4fc..33a68170e 100644 --- a/problems/champagne-tower/README.md +++ b/problems/champagne-tower/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/similar-rgb-color "Similar RGB Color") -## 799. Champagne Tower (Medium) +## [799. Champagne Tower (Medium)](https://leetcode.com/problems/champagne-tower "้ฆๆงๅก")We stack glasses in a pyramid, where the first row has 1 glass, the second row has 2 glasses, and so on until the 100th row. Each glass holds one cup (250ml) of champagne.
diff --git a/problems/cheapest-flights-within-k-stops/README.md b/problems/cheapest-flights-within-k-stops/README.md index e35734f6c..557ccb4bc 100644 --- a/problems/cheapest-flights-within-k-stops/README.md +++ b/problems/cheapest-flights-within-k-stops/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/rotated-digits "Rotated Digits") -## 787. Cheapest Flights Within K Stops (Medium) +## [787. Cheapest Flights Within K Stops (Medium)](https://leetcode.com/problems/cheapest-flights-within-k-stops "K ็ซไธญ่ฝฌๅ ๆไพฟๅฎ็่ช็ญ")There are n cities connected by m flights. Each fight starts from city u and arrives at v with a price w.
Given a binary tree, determine if it is a complete binary tree.
diff --git a/problems/check-if-a-number-is-majority-element-in-a-sorted-array/README.md b/problems/check-if-a-number-is-majority-element-in-a-sorted-array/README.md index 29b5f1a18..c2e142227 100644 --- a/problems/check-if-a-number-is-majority-element-in-a-sorted-array/README.md +++ b/problems/check-if-a-number-is-majority-element-in-a-sorted-array/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-swaps-to-group-all-1s-together "Minimum Swaps to Group All 1's Together") -## 1150. Check If a Number Is Majority Element in a Sorted Array (Easy) +## [1150. Check If a Number Is Majority Element in a Sorted Array (Easy)](https://leetcode.com/problems/check-if-a-number-is-majority-element-in-a-sorted-array "ๆฃๆฅไธไธชๆฐๆฏๅฆๅจๆฐ็ปไธญๅ ็ปๅคงๅคๆฐ") diff --git a/problems/check-if-word-is-valid-after-substitutions/README.md b/problems/check-if-word-is-valid-after-substitutions/README.md index 0d6cb111b..a15f0994a 100644 --- a/problems/check-if-word-is-valid-after-substitutions/README.md +++ b/problems/check-if-word-is-valid-after-substitutions/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/max-consecutive-ones-iii "Max Consecutive Ones III") -## 1003. Check If Word Is Valid After Substitutions (Medium) +## [1003. Check If Word Is Valid After Substitutions (Medium)](https://leetcode.com/problems/check-if-word-is-valid-after-substitutions "ๆฃๆฅๆฟๆขๅ็่ฏๆฏๅฆๆๆ")We are given that the string "abc" is valid.
In a N x N grid representing a field of cherries, each cell is one of three possible integers.
You are given a circular array nums of positive and negative integers. If a number k at an index is positive, then move forward k steps. Conversely, if it's negative (-k), move backward k steps. Since the array is circular, you may assume that the last element's next element is the first element, and the first element's previous element is the last element.
There is a table courses with columns: student and class
You are climbing a stair case. It takes n steps to reach to the top.
diff --git a/problems/clone-graph/README.md b/problems/clone-graph/README.md index e4c3633d6..d6d480a2c 100644 --- a/problems/clone-graph/README.md +++ b/problems/clone-graph/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/gas-station "Gas Station") -## 133. Clone Graph (Medium) +## [133. Clone Graph (Medium)](https://leetcode.com/problems/clone-graph "ๅ ้ๅพ")Given a reference of a node in a connected undirected graph, return a deep copy (clone) of the graph. Each node in the graph contains a val (int) and a list (List[Node]) of its neighbors.
Normally, the factorial of a positive integer n is the product of all positive integers less than or equal to n. For example, factorial(10) = 10 * 9 * 8 * 7 * 6 * 5 * 4 * 3 * 2 * 1.
You are given coins of different denominations and a total amount of money. Write a function to compute the number of combinations that make up that amount. You may assume that you have infinite number of each kind of coin.
diff --git a/problems/coin-change/README.md b/problems/coin-change/README.md index c2ed2b33a..080a65096 100644 --- a/problems/coin-change/README.md +++ b/problems/coin-change/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/number-of-connected-components-in-an-undirected-graph "Number of Connected Components in an Undirected Graph") -## 322. Coin Change (Medium) +## [322. Coin Change (Medium)](https://leetcode.com/problems/coin-change "้ถ้ฑๅ ๆข")You are given coins of different denominations and a total amount of money amount. Write a function to compute the fewest number of coins that you need to make up that amount. If that amount of money cannot be made up by any combination of the coins, return -1.
Given a 2-dimensional grid of integers, each value in the grid represents the color of the grid square at that location.
Given a collection of candidate numbers (candidates) and a target number (target), find all unique combinations in candidates where the candidate numbers sums to target.
Find all possible combinations of k numbers that add up to a number n, given that only numbers from 1 to 9 can be used and each combination should be a unique set of numbers.
diff --git a/problems/combination-sum-iv/README.md b/problems/combination-sum-iv/README.md index 22eefd59f..d0b6efb6f 100644 --- a/problems/combination-sum-iv/README.md +++ b/problems/combination-sum-iv/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/kth-smallest-element-in-a-sorted-matrix "Kth Smallest Element in a Sorted Matrix") -## 377. Combination Sum IV (Medium) +## [377. Combination Sum IV (Medium)](https://leetcode.com/problems/combination-sum-iv "็ปๅๆปๅ โ ฃ")Given an integer array with all positive numbers and no duplicates, find the number of possible combinations that add up to a positive integer target.
diff --git a/problems/combination-sum/README.md b/problems/combination-sum/README.md index c51612111..18cff6162 100644 --- a/problems/combination-sum/README.md +++ b/problems/combination-sum/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/combination-sum-ii "Combination Sum II") -## 39. Combination Sum (Medium) +## [39. Combination Sum (Medium)](https://leetcode.com/problems/combination-sum "็ปๅๆปๅ")Given a set of candidate numbers (candidates) (without duplicates) and a target number (target), find all unique combinations in candidates where the candidate numbers sums to target.
Given two integers n and k, return all possible combinations of k numbers out of 1 ... n.
diff --git a/problems/combine-two-tables/README.md b/problems/combine-two-tables/README.md index 383a05893..45ff44fa0 100644 --- a/problems/combine-two-tables/README.md +++ b/problems/combine-two-tables/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/second-highest-salary "Second Highest Salary") -## 175. Combine Two Tables (Easy) +## [175. Combine Two Tables (Easy)](https://leetcode.com/problems/combine-two-tables "็ปๅไธคไธช่กจ")Table: Person
Let's define a function f(s) over a non-empty string s, which calculates the frequency of the smallest character in s. For example, if s = "dcce" then f(s) = 2 because the smallest character is "c" and its frequency is 2.
Compare two version numbers version1 and version2.
If version1 > version2 return 1; if version1 < version2 return -1;otherwise return 0.
Every non-negative integer N has a binary representation. For example, 5 can be represented as "101" in binary, 11 as "1011" in binary, and so on. Note that except for N = 0, there are no leading zeroes in any binary representation.
A complete binary tree is a binary tree in which every level, except possibly the last, is completely filled, and all nodes are as far left as possible.
diff --git a/problems/complex-number-multiplication/README.md b/problems/complex-number-multiplication/README.md index 921536517..02543cc9f 100644 --- a/problems/complex-number-multiplication/README.md +++ b/problems/complex-number-multiplication/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/convert-bst-to-greater-tree "Convert BST to Greater Tree") -## 537. Complex Number Multiplication (Medium) +## [537. Complex Number Multiplication (Medium)](https://leetcode.com/problems/complex-number-multiplication "ๅคๆฐไนๆณ")Given two strings representing two complex numbers.
diff --git a/problems/concatenated-words/README.md b/problems/concatenated-words/README.md index a71758dda..c00ec694d 100644 --- a/problems/concatenated-words/README.md +++ b/problems/concatenated-words/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/matchsticks-to-square "Matchsticks to Square") -## 472. Concatenated Words (Hard) +## [472. Concatenated Words (Hard)](https://leetcode.com/problems/concatenated-words "่ฟๆฅ่ฏ") Given a list of words (without duplicates), please write a program that returns all concatenated words in the given list of words.A concatenated word is defined as a string that is comprised entirely of at least two shorter words in the given array.
diff --git a/problems/confusing-number-ii/README.md b/problems/confusing-number-ii/README.md index 2e781542d..d2a3b2093 100644 --- a/problems/confusing-number-ii/README.md +++ b/problems/confusing-number-ii/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/duplicate-zeros "Duplicate Zeros") -## 1088. Confusing Number II (Hard) +## [1088. Confusing Number II (Hard)](https://leetcode.com/problems/confusing-number-ii "ๆๆททๆทๆฐ II")We can rotate digits by 180 degrees to form new digits. When 0, 1, 6, 8, 9 are rotated 180 degrees, they become 0, 1, 9, 8, 6 respectively. When 2, 3, 4, 5 and 7 are rotated 180 degrees, they become invalid.
diff --git a/problems/confusing-number/README.md b/problems/confusing-number/README.md index da4cb33d9..3619109cd 100644 --- a/problems/confusing-number/README.md +++ b/problems/confusing-number/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/campus-bikes "Campus Bikes") -## 1056. Confusing Number (Easy) +## [1056. Confusing Number (Easy)](https://leetcode.com/problems/confusing-number "ๆๆททๆทๆฐ")Given a number N, return true if and only if it is a confusing number, which satisfies the following condition:
There are N cities numbered from 1 to N.
Can you help to query all the consecutive available seats order by the seat_id using the following
cinema table?
diff --git a/problems/consecutive-numbers-sum/README.md b/problems/consecutive-numbers-sum/README.md
index fc2b83e91..eafadca7d 100644
--- a/problems/consecutive-numbers-sum/README.md
+++ b/problems/consecutive-numbers-sum/README.md
@@ -9,7 +9,7 @@
ใใใใใใใใใใใใใใใใ
[Next >](https://github.com/openset/leetcode/tree/master/problems/positions-of-large-groups "Positions of Large Groups")
-## 829. Consecutive Numbers Sum (Hard)
+## [829. Consecutive Numbers Sum (Hard)](https://leetcode.com/problems/consecutive-numbers-sum "่ฟ็ปญๆดๆฐๆฑๅ")
Given a positive integer N, how many ways can we write it as a sum of consecutive positive integers?
Write a SQL query to find all numbers that appear at least three times consecutively.
diff --git a/problems/construct-binary-search-tree-from-preorder-traversal/README.md b/problems/construct-binary-search-tree-from-preorder-traversal/README.md index 199d8830c..fc00d9b00 100644 --- a/problems/construct-binary-search-tree-from-preorder-traversal/README.md +++ b/problems/construct-binary-search-tree-from-preorder-traversal/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/complement-of-base-10-integer "Complement of Base 10 Integer") -## 1008. Construct Binary Search Tree from Preorder Traversal (Medium) +## [1008. Construct Binary Search Tree from Preorder Traversal (Medium)](https://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal "ๅ ๅบ้ๅๆ้ ไบๅๆ ")Return the root node of a binary search tree that matches the given preorder traversal.
Given inorder and postorder traversal of a tree, construct the binary tree.
diff --git a/problems/construct-binary-tree-from-preorder-and-inorder-traversal/README.md b/problems/construct-binary-tree-from-preorder-and-inorder-traversal/README.md index aeb43ac0b..45529a3aa 100644 --- a/problems/construct-binary-tree-from-preorder-and-inorder-traversal/README.md +++ b/problems/construct-binary-tree-from-preorder-and-inorder-traversal/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/construct-binary-tree-from-inorder-and-postorder-traversal "Construct Binary Tree from Inorder and Postorder Traversal") -## 105. Construct Binary Tree from Preorder and Inorder Traversal (Medium) +## [105. Construct Binary Tree from Preorder and Inorder Traversal (Medium)](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal "ไปๅๅบไธไธญๅบ้ๅๅบๅๆ้ ไบๅๆ ")Given preorder and inorder traversal of a tree, construct the binary tree.
diff --git a/problems/construct-binary-tree-from-preorder-and-postorder-traversal/README.md b/problems/construct-binary-tree-from-preorder-and-postorder-traversal/README.md index cd9a3b35c..07326909e 100644 --- a/problems/construct-binary-tree-from-preorder-and-postorder-traversal/README.md +++ b/problems/construct-binary-tree-from-preorder-and-postorder-traversal/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/find-and-replace-pattern "Find and Replace Pattern") -## 889. Construct Binary Tree from Preorder and Postorder Traversal (Medium) +## [889. Construct Binary Tree from Preorder and Postorder Traversal (Medium)](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-postorder-traversal "ๆ นๆฎๅๅบๅๅๅบ้ๅๆ้ ไบๅๆ ")Return any binary tree that matches the given preorder and postorder traversals.
diff --git a/problems/construct-binary-tree-from-string/README.md b/problems/construct-binary-tree-from-string/README.md index e321aaae1..8ccc361ec 100644 --- a/problems/construct-binary-tree-from-string/README.md +++ b/problems/construct-binary-tree-from-string/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/complex-number-multiplication "Complex Number Multiplication") -## 536. Construct Binary Tree from String (Medium) +## [536. Construct Binary Tree from String (Medium)](https://leetcode.com/problems/construct-binary-tree-from-string "ไปๅญ็ฌฆไธฒ็ๆไบๅๆ ") diff --git a/problems/construct-quad-tree/README.md b/problems/construct-quad-tree/README.md index 4a110023b..5f71237f2 100644 --- a/problems/construct-quad-tree/README.md +++ b/problems/construct-quad-tree/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/serialize-and-deserialize-n-ary-tree "Serialize and Deserialize N-ary Tree") -## 427. Construct Quad Tree (Medium) +## [427. Construct Quad Tree (Medium)](https://leetcode.com/problems/construct-quad-tree "ๅปบ็ซๅๅๆ ")We want to use quad trees to store an N x N boolean grid. Each cell in the grid can only be true or false. The root node represents the whole grid. For each node, it will be subdivided into four children nodes until the values in the region it represents are all the same.
You need to construct a string consists of parenthesis and integers from a binary tree with the preorder traversing way.
diff --git a/problems/construct-the-rectangle/README.md b/problems/construct-the-rectangle/README.md index 6b4b58365..10f3be612 100644 --- a/problems/construct-the-rectangle/README.md +++ b/problems/construct-the-rectangle/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/reverse-pairs "Reverse Pairs") -## 492. Construct the Rectangle (Easy) +## [492. Construct the Rectangle (Easy)](https://leetcode.com/problems/construct-the-rectangle "ๆ้ ็ฉๅฝข")For a web developer, it is very important to know how to design a web page's size. So, given a specific rectangular web pageโs area, your job by now is to design a rectangular web page, whose length L and width W satisfy the following requirements:
diff --git a/problems/contain-virus/README.md b/problems/contain-virus/README.md index 70bced311..fd591e702 100644 --- a/problems/contain-virus/README.md +++ b/problems/contain-virus/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/number-of-corner-rectangles "Number Of Corner Rectangles") -## 749. Contain Virus (Hard) +## [749. Contain Virus (Hard)](https://leetcode.com/problems/contain-virus "้็ฆป็ ๆฏ")A virus is spreading rapidly, and your task is to quarantine the infected area by installing walls. diff --git a/problems/container-with-most-water/README.md b/problems/container-with-most-water/README.md index e109d84a5..1572d657b 100644 --- a/problems/container-with-most-water/README.md +++ b/problems/container-with-most-water/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/integer-to-roman "Integer to Roman") -## 11. Container With Most Water (Medium) +## [11. Container With Most Water (Medium)](https://leetcode.com/problems/container-with-most-water "็ๆๅคๆฐด็ๅฎนๅจ")
Given n non-negative integers a1, a2, ..., an , where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find two lines, which together with x-axis forms a container, such that the container contains the most water.
diff --git a/problems/contains-duplicate-ii/README.md b/problems/contains-duplicate-ii/README.md index 97fe98c02..ac23889f5 100644 --- a/problems/contains-duplicate-ii/README.md +++ b/problems/contains-duplicate-ii/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/contains-duplicate-iii "Contains Duplicate III") -## 219. Contains Duplicate II (Easy) +## [219. Contains Duplicate II (Easy)](https://leetcode.com/problems/contains-duplicate-ii "ๅญๅจ้ๅคๅ ็ด II")Given an array of integers and an integer k, find out whether there are two distinct indices i and j in the array such that nums[i] = nums[j] and the absolute difference between i and j is at most k.
diff --git a/problems/contains-duplicate-iii/README.md b/problems/contains-duplicate-iii/README.md index 072a9993b..297a1946f 100644 --- a/problems/contains-duplicate-iii/README.md +++ b/problems/contains-duplicate-iii/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/maximal-square "Maximal Square") -## 220. Contains Duplicate III (Medium) +## [220. Contains Duplicate III (Medium)](https://leetcode.com/problems/contains-duplicate-iii "ๅญๅจ้ๅคๅ ็ด III")Given an array of integers, find out whether there are two distinct indices i and j in the array such that the absolute difference between nums[i] and nums[j] is at most t and the absolute difference between i and j is at most k.
diff --git a/problems/contains-duplicate/README.md b/problems/contains-duplicate/README.md index 703c49d62..7f16f88db 100644 --- a/problems/contains-duplicate/README.md +++ b/problems/contains-duplicate/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/the-skyline-problem "The Skyline Problem") -## 217. Contains Duplicate (Easy) +## [217. Contains Duplicate (Easy)](https://leetcode.com/problems/contains-duplicate "ๅญๅจ้ๅคๅ ็ด ")Given an array of integers, find if the array contains any duplicates.
diff --git a/problems/contiguous-array/README.md b/problems/contiguous-array/README.md index 929ae9690..632d9344a 100644 --- a/problems/contiguous-array/README.md +++ b/problems/contiguous-array/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/beautiful-arrangement "Beautiful Arrangement") -## 525. Contiguous Array (Medium) +## [525. Contiguous Array (Medium)](https://leetcode.com/problems/contiguous-array "่ฟ็ปญๆฐ็ป")Given a binary array, find the maximum length of a contiguous subarray with equal number of 0 and 1.
diff --git a/problems/continuous-subarray-sum/README.md b/problems/continuous-subarray-sum/README.md index fd6390bd0..72e50a225 100644 --- a/problems/continuous-subarray-sum/README.md +++ b/problems/continuous-subarray-sum/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/longest-word-in-dictionary-through-deleting "Longest Word in Dictionary through Deleting") -## 523. Continuous Subarray Sum (Medium) +## [523. Continuous Subarray Sum (Medium)](https://leetcode.com/problems/continuous-subarray-sum "่ฟ็ปญ็ๅญๆฐ็ปๅ")Given a list of non-negative numbers and a target integer k, write a function to check if the array has a continuous subarray of size at least 2 that sums up to a multiple of k, that is, sums up to n*k where n is also an integer.
diff --git a/problems/convert-a-number-to-hexadecimal/README.md b/problems/convert-a-number-to-hexadecimal/README.md index b18c17da1..16363d0d0 100644 --- a/problems/convert-a-number-to-hexadecimal/README.md +++ b/problems/convert-a-number-to-hexadecimal/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/queue-reconstruction-by-height "Queue Reconstruction by Height") -## 405. Convert a Number to Hexadecimal (Easy) +## [405. Convert a Number to Hexadecimal (Easy)](https://leetcode.com/problems/convert-a-number-to-hexadecimal "ๆฐๅญ่ฝฌๆขไธบๅๅ ญ่ฟๅถๆฐ")Given an integer, write an algorithm to convert it to hexadecimal. For negative integer, twoโs complement method is used. diff --git a/problems/convert-binary-search-tree-to-sorted-doubly-linked-list/README.md b/problems/convert-binary-search-tree-to-sorted-doubly-linked-list/README.md index 557b1f82e..3de9ecbfe 100644 --- a/problems/convert-binary-search-tree-to-sorted-doubly-linked-list/README.md +++ b/problems/convert-binary-search-tree-to-sorted-doubly-linked-list/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/construct-quad-tree "Construct Quad Tree") -## 426. Convert Binary Search Tree to Sorted Doubly Linked List (Medium) +## [426. Convert Binary Search Tree to Sorted Doubly Linked List (Medium)](https://leetcode.com/problems/convert-binary-search-tree-to-sorted-doubly-linked-list "ๅฐไบๅๆ็ดขๆ ่ฝฌๅไธบๆๅบ็ๅๅ้พ่กจ") diff --git a/problems/convert-bst-to-greater-tree/README.md b/problems/convert-bst-to-greater-tree/README.md index 90ee1aeb9..d1a6769aa 100644 --- a/problems/convert-bst-to-greater-tree/README.md +++ b/problems/convert-bst-to-greater-tree/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-time-difference "Minimum Time Difference") -## 538. Convert BST to Greater Tree (Easy) +## [538. Convert BST to Greater Tree (Easy)](https://leetcode.com/problems/convert-bst-to-greater-tree "ๆไบๅๆ็ดขๆ ่ฝฌๆขไธบ็ดฏๅ ๆ ")
Given a Binary Search Tree (BST), convert it to a Greater Tree such that every key of the original BST is changed to the original key plus sum of all keys greater than the original key in BST.
diff --git a/problems/convert-sorted-array-to-binary-search-tree/README.md b/problems/convert-sorted-array-to-binary-search-tree/README.md index 8222b2eaf..24ec68cfc 100644 --- a/problems/convert-sorted-array-to-binary-search-tree/README.md +++ b/problems/convert-sorted-array-to-binary-search-tree/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/convert-sorted-list-to-binary-search-tree "Convert Sorted List to Binary Search Tree") -## 108. Convert Sorted Array to Binary Search Tree (Easy) +## [108. Convert Sorted Array to Binary Search Tree (Easy)](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree "ๅฐๆๅบๆฐ็ป่ฝฌๆขไธบไบๅๆ็ดขๆ ")Given an array where elements are sorted in ascending order, convert it to a height balanced BST.
diff --git a/problems/convert-sorted-list-to-binary-search-tree/README.md b/problems/convert-sorted-list-to-binary-search-tree/README.md index 7f7f4c0a4..14d09f85c 100644 --- a/problems/convert-sorted-list-to-binary-search-tree/README.md +++ b/problems/convert-sorted-list-to-binary-search-tree/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/balanced-binary-tree "Balanced Binary Tree") -## 109. Convert Sorted List to Binary Search Tree (Medium) +## [109. Convert Sorted List to Binary Search Tree (Medium)](https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree "ๆๅบ้พ่กจ่ฝฌๆขไบๅๆ็ดขๆ ")Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.
diff --git a/problems/convert-to-base-2/README.md b/problems/convert-to-base-2/README.md index 2b9656433..45e6a809e 100644 --- a/problems/convert-to-base-2/README.md +++ b/problems/convert-to-base-2/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/binary-prefix-divisible-by-5 "Binary Prefix Divisible By 5") -## 1017. Convert to Base -2 (Medium) +## [1017. Convert to Base -2 (Medium)](https://leetcode.com/problems/convert-to-base-2 "่ดไบ่ฟๅถ่ฝฌๆข")Given a number
diff --git a/problems/convex-polygon/README.md b/problems/convex-polygon/README.md index 729d40ddd..f41917d29 100644 --- a/problems/convex-polygon/README.md +++ b/problems/convex-polygon/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/implement-rand10-using-rand7 "Implement Rand10() Using Rand7()") -## 469. Convex Polygon (Medium) +## [469. Convex Polygon (Medium)](https://leetcode.com/problems/convex-polygon "ๅธๅค่พนๅฝข") diff --git a/problems/copy-list-with-random-pointer/README.md b/problems/copy-list-with-random-pointer/README.md index 6afcc938b..2b4a53bf9 100644 --- a/problems/copy-list-with-random-pointer/README.md +++ b/problems/copy-list-with-random-pointer/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/word-break "Word Break") -## 138. Copy List with Random Pointer (Medium) +## [138. Copy List with Random Pointer (Medium)](https://leetcode.com/problems/copy-list-with-random-pointer "ๅคๅถๅธฆ้ๆบๆ้็้พ่กจ")N, return a string consisting of"0"s and"1"s that represents its value in base-2(negative two).A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null.
diff --git a/problems/corporate-flight-bookings/README.md b/problems/corporate-flight-bookings/README.md index 43cf2f66f..ec52c9ad7 100644 --- a/problems/corporate-flight-bookings/README.md +++ b/problems/corporate-flight-bookings/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/delete-nodes-and-return-forest "Delete Nodes And Return Forest") -## 1109. Corporate Flight Bookings (Medium) +## [1109. Corporate Flight Bookings (Medium)](https://leetcode.com/problems/corporate-flight-bookings "่ช็ญ้ข่ฎข็ป่ฎก")There are
diff --git a/problems/count-and-say/README.md b/problems/count-and-say/README.md index 8c4de6341..9cbe06b18 100644 --- a/problems/count-and-say/README.md +++ b/problems/count-and-say/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/combination-sum "Combination Sum") -## 38. Count and Say (Easy) +## [38. Count and Say (Easy)](https://leetcode.com/problems/count-and-say "ๆฅๆฐ")nflights, and they are labeled from1ton.The count-and-say sequence is the sequence of integers with the first five terms as following:
diff --git a/problems/count-binary-substrings/README.md b/problems/count-binary-substrings/README.md index f593a927f..deddaa011 100644 --- a/problems/count-binary-substrings/README.md +++ b/problems/count-binary-substrings/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/degree-of-an-array "Degree of an Array") -## 696. Count Binary Substrings (Easy) +## [696. Count Binary Substrings (Easy)](https://leetcode.com/problems/count-binary-substrings "่ฎกๆฐไบ่ฟๅถๅญไธฒ")Give a string
diff --git a/problems/count-complete-tree-nodes/README.md b/problems/count-complete-tree-nodes/README.md index 5b04503a6..2b1afcb4c 100644 --- a/problems/count-complete-tree-nodes/README.md +++ b/problems/count-complete-tree-nodes/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/rectangle-area "Rectangle Area") -## 222. Count Complete Tree Nodes (Medium) +## [222. Count Complete Tree Nodes (Medium)](https://leetcode.com/problems/count-complete-tree-nodes "ๅฎๅ จไบๅๆ ็่็นไธชๆฐ")s, count the number of non-empty (contiguous) substrings that have the same number of 0's and 1's, and all the 0's and all the 1's in these substrings are grouped consecutively.Given a complete binary tree, count the number of nodes.
diff --git a/problems/count-different-palindromic-subsequences/README.md b/problems/count-different-palindromic-subsequences/README.md index 74361eeae..8da473279 100644 --- a/problems/count-different-palindromic-subsequences/README.md +++ b/problems/count-different-palindromic-subsequences/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/my-calendar-ii "My Calendar II") -## 730. Count Different Palindromic Subsequences (Hard) +## [730. Count Different Palindromic Subsequences (Hard)](https://leetcode.com/problems/count-different-palindromic-subsequences "็ป่ฎกไธๅๅๆๅญๅญ็ฌฆไธฒ")Given a string S, find the number of different non-empty palindromic subsequences in S, and return that number modulo
10^9 + 7. diff --git a/problems/count-numbers-with-unique-digits/README.md b/problems/count-numbers-with-unique-digits/README.md index cb9db2147..c6fd5053b 100644 --- a/problems/count-numbers-with-unique-digits/README.md +++ b/problems/count-numbers-with-unique-digits/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/rearrange-string-k-distance-apart "Rearrange String k Distance Apart") -## 357. Count Numbers with Unique Digits (Medium) +## [357. Count Numbers with Unique Digits (Medium)](https://leetcode.com/problems/count-numbers-with-unique-digits "่ฎก็ฎๅไธชไฝๆฐไธๅ็ๆฐๅญไธชๆฐ")Given a non-negative integer n, count all numbers with unique digits, x, where 0 ≤ x < 10n.
diff --git a/problems/count-of-range-sum/README.md b/problems/count-of-range-sum/README.md index b4733952c..5daaa7bfc 100644 --- a/problems/count-of-range-sum/README.md +++ b/problems/count-of-range-sum/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/odd-even-linked-list "Odd Even Linked List") -## 327. Count of Range Sum (Hard) +## [327. Count of Range Sum (Hard)](https://leetcode.com/problems/count-of-range-sum "ๅบ้ดๅ็ไธชๆฐ")Given an integer array
diff --git a/problems/count-of-smaller-numbers-after-self/README.md b/problems/count-of-smaller-numbers-after-self/README.md index 8dbec95e9..e66a2d1f9 100644 --- a/problems/count-of-smaller-numbers-after-self/README.md +++ b/problems/count-of-smaller-numbers-after-self/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/remove-duplicate-letters "Remove Duplicate Letters") -## 315. Count of Smaller Numbers After Self (Hard) +## [315. Count of Smaller Numbers After Self (Hard)](https://leetcode.com/problems/count-of-smaller-numbers-after-self "่ฎก็ฎๅณไพงๅฐไบๅฝๅๅ ็ด ็ไธชๆฐ")nums, return the number of range sums that lie in[lower, upper]inclusive.
Range sumS(i, j)is defined as the sum of the elements innumsbetween indicesiandj(i≤j), inclusive.You are given an integer array nums and you have to return a new counts array. The counts array has the property where
diff --git a/problems/count-primes/README.md b/problems/count-primes/README.md index d51bc85eb..6f297d81d 100644 --- a/problems/count-primes/README.md +++ b/problems/count-primes/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/isomorphic-strings "Isomorphic Strings") -## 204. Count Primes (Easy) +## [204. Count Primes (Easy)](https://leetcode.com/problems/count-primes "่ฎกๆฐ่ดจๆฐ")counts[i]is the number of smaller elements to the right ofnums[i].Count the number of prime numbers less than a non-negative number, n.
diff --git a/problems/count-student-number-in-departments/README.md b/problems/count-student-number-in-departments/README.md index 7b961bd8e..c39b281dd 100644 --- a/problems/count-student-number-in-departments/README.md +++ b/problems/count-student-number-in-departments/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/shortest-unsorted-continuous-subarray "Shortest Unsorted Continuous Subarray") -## 580. Count Student Number in Departments (Medium) +## [580. Count Student Number in Departments (Medium)](https://leetcode.com/problems/count-student-number-in-departments "็ป่ฎกๅไธไธๅญฆ็ไบบๆฐ")A university uses 2 data tables, student and department, to store data about its students and the departments associated with each major.
diff --git a/problems/count-substrings-with-only-one-distinct-letter/README.md b/problems/count-substrings-with-only-one-distinct-letter/README.md index 00ecd7769..8e6df1b11 100644 --- a/problems/count-substrings-with-only-one-distinct-letter/README.md +++ b/problems/count-substrings-with-only-one-distinct-letter/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/before-and-after-puzzle "Before and After Puzzle") -## 1180. Count Substrings with Only One Distinct Letter (Easy) +## [1180. Count Substrings with Only One Distinct Letter (Easy)](https://leetcode.com/problems/count-substrings-with-only-one-distinct-letter "็ป่ฎกๅชๅซๅไธๅญๆฏ็ๅญไธฒ") diff --git a/problems/count-the-repetitions/README.md b/problems/count-the-repetitions/README.md index de6a7df0c..a41a96c6d 100644 --- a/problems/count-the-repetitions/README.md +++ b/problems/count-the-repetitions/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/unique-substrings-in-wraparound-string "Unique Substrings in Wraparound String") -## 466. Count The Repetitions (Hard) +## [466. Count The Repetitions (Hard)](https://leetcode.com/problems/count-the-repetitions "็ป่ฎก้ๅคไธชๆฐ")Define
S = [s,n]as the string S which consists of n connected strings s. For example,["abc", 3]="abcabcabc".On the other hand, we define that string s1 can be obtained from string s2 if we can remove some characters from s2 such that it becomes s1. For example, โabcโ can be obtained from โabdbecโ based on our definition, but it can not be obtained from โacbbeโ.
diff --git a/problems/count-univalue-subtrees/README.md b/problems/count-univalue-subtrees/README.md index 88ab1303d..3ff6de1b6 100644 --- a/problems/count-univalue-subtrees/README.md +++ b/problems/count-univalue-subtrees/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/flatten-2d-vector "Flatten 2D Vector") -## 250. Count Univalue Subtrees (Medium) +## [250. Count Univalue Subtrees (Medium)](https://leetcode.com/problems/count-univalue-subtrees "็ป่ฎกๅๅผๅญๆ ")Given a binary tree, count the number of uni-value subtrees.
diff --git a/problems/counting-bits/README.md b/problems/counting-bits/README.md index 30195d2fd..9f17689de 100644 --- a/problems/counting-bits/README.md +++ b/problems/counting-bits/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/nested-list-weight-sum "Nested List Weight Sum") -## 338. Counting Bits (Medium) +## [338. Counting Bits (Medium)](https://leetcode.com/problems/counting-bits "ๆฏ็นไฝ่ฎกๆฐ")Given a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ num calculate the number of 1's in their binary representation and return them as an array.
diff --git a/problems/couples-holding-hands/README.md b/problems/couples-holding-hands/README.md index b3e80761e..e9ffd922a 100644 --- a/problems/couples-holding-hands/README.md +++ b/problems/couples-holding-hands/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/toeplitz-matrix "Toeplitz Matrix") -## 765. Couples Holding Hands (Hard) +## [765. Couples Holding Hands (Hard)](https://leetcode.com/problems/couples-holding-hands "ๆ ไพฃ็ตๆ")N couples sit in 2N seats arranged in a row and want to hold hands. We want to know the minimum number of swaps so that every couple is sitting side by side. A swap consists of choosing any two people, then they stand up and switch seats. diff --git a/problems/course-schedule-ii/README.md b/problems/course-schedule-ii/README.md index ca3342538..a6c13e0ab 100644 --- a/problems/course-schedule-ii/README.md +++ b/problems/course-schedule-ii/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/add-and-search-word-data-structure-design "Add and Search Word - Data structure design") -## 210. Course Schedule II (Medium) +## [210. Course Schedule II (Medium)](https://leetcode.com/problems/course-schedule-ii "่ฏพ็จ่กจ II")
There are a total of n courses you have to take, labeled from
diff --git a/problems/course-schedule-iii/README.md b/problems/course-schedule-iii/README.md index f46aac4d3..c01f7c980 100644 --- a/problems/course-schedule-iii/README.md +++ b/problems/course-schedule-iii/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/design-excel-sum-formula "Design Excel Sum Formula") -## 630. Course Schedule III (Hard) +## [630. Course Schedule III (Hard)](https://leetcode.com/problems/course-schedule-iii "่ฏพ็จ่กจ III")0ton-1.There are
diff --git a/problems/course-schedule/README.md b/problems/course-schedule/README.md index 4f6347124..e3854bc7b 100644 --- a/problems/course-schedule/README.md +++ b/problems/course-schedule/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/implement-trie-prefix-tree "Implement Trie (Prefix Tree)") -## 207. Course Schedule (Medium) +## [207. Course Schedule (Medium)](https://leetcode.com/problems/course-schedule "่ฏพ็จ่กจ")ndifferent online courses numbered from1ton. Each course has some duration(course length)tand closed ondthday. A course should be taken continuously fortdays and must be finished before or on thedthday. You will start at the1stday.There are a total of n courses you have to take, labeled from
diff --git a/problems/cousins-in-binary-tree/README.md b/problems/cousins-in-binary-tree/README.md index 573e62b93..7415ee085 100644 --- a/problems/cousins-in-binary-tree/README.md +++ b/problems/cousins-in-binary-tree/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/rotting-oranges "Rotting Oranges") -## 993. Cousins in Binary Tree (Easy) +## [993. Cousins in Binary Tree (Easy)](https://leetcode.com/problems/cousins-in-binary-tree "ไบๅๆ ็ๅ ๅ ๅผ่็น")0ton-1.In a binary tree, the root node is at depth
diff --git a/problems/cracking-the-safe/README.md b/problems/cracking-the-safe/README.md index 801b7fb4a..319f2e435 100644 --- a/problems/cracking-the-safe/README.md +++ b/problems/cracking-the-safe/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/reach-a-number "Reach a Number") -## 753. Cracking the Safe (Hard) +## [753. Cracking the Safe (Hard)](https://leetcode.com/problems/cracking-the-safe "็ ด่งฃไฟ้ฉ็ฎฑ")0, and children of each depthknode are at depthk+1.There is a box protected by a password. The password is a sequence of
diff --git a/problems/create-maximum-number/README.md b/problems/create-maximum-number/README.md index 795e1cf11..d57941c34 100644 --- a/problems/create-maximum-number/README.md +++ b/problems/create-maximum-number/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/coin-change "Coin Change") -## 321. Create Maximum Number (Hard) +## [321. Create Maximum Number (Hard)](https://leetcode.com/problems/create-maximum-number "ๆผๆฅๆๅคงๆฐ")ndigits where each digit can be one of the firstkdigits0, 1, ..., k-1.Given two arrays of length
diff --git a/problems/critical-connections-in-a-network/README.md b/problems/critical-connections-in-a-network/README.md index d941838bc..bcb36859c 100644 --- a/problems/critical-connections-in-a-network/README.md +++ b/problems/critical-connections-in-a-network/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/monthly-transactions-i "Monthly Transactions I") -## 1192. Critical Connections in a Network (Hard) +## [1192. Critical Connections in a Network (Hard)](https://leetcode.com/problems/critical-connections-in-a-network "ๆฅๆพ้็พคๅ ็ใๅ ณ้ฎ่ฟๆฅใ")mandnwith digits0-9representing two numbers. Create the maximum number of lengthk <= m + nfrom digits of the two. The relative order of the digits from the same array must be preserved. Return an array of thekdigits.There are
@@ -38,9 +38,6 @@nservers numbered from0ton-1connected by undirected server-to-serverconnectionsforming a network whereconnections[i] = [a, b]represents a connection between serversaandb. Any server can reach any other server directly or indirectly through the network.
Hint 1
diff --git a/problems/custom-sort-string/README.md b/problems/custom-sort-string/README.md index 0adff7da0..c6c50ca70 100644 --- a/problems/custom-sort-string/README.md +++ b/problems/custom-sort-string/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/number-of-matching-subsequences "Number of Matching Subsequences") -## 791. Custom Sort String (Medium) +## [791. Custom Sort String (Medium)](https://leetcode.com/problems/custom-sort-string "่ชๅฎไนๅญ็ฌฆไธฒๆๅบ")S and T are strings composed of lowercase letters. In S, no letter occurs more than once.
Query the customer_number from the orders table for the customer who has placed the largest number of orders.
diff --git a/problems/customers-who-bought-all-products/README.md b/problems/customers-who-bought-all-products/README.md index 5eeccdcbf..b362abbef 100644 --- a/problems/customers-who-bought-all-products/README.md +++ b/problems/customers-who-bought-all-products/README.md @@ -9,6 +9,6 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/last-stone-weight "Last Stone Weight") -## 1045. Customers Who Bought All Products (Medium) +## [1045. Customers Who Bought All Products (Medium)](https://leetcode.com/problems/customers-who-bought-all-products "ไนฐไธๆๆไบงๅ็ๅฎขๆท") diff --git a/problems/customers-who-never-order/README.md b/problems/customers-who-never-order/README.md index 3e8135fe5..3bb83537f 100644 --- a/problems/customers-who-never-order/README.md +++ b/problems/customers-who-never-order/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/department-highest-salary "Department Highest Salary") -## 183. Customers Who Never Order (Easy) +## [183. Customers Who Never Order (Easy)](https://leetcode.com/problems/customers-who-never-order "ไปไธ่ฎข่ดญ็ๅฎขๆท")Suppose that a website contains two tables, the Customers table and the Orders table. Write a SQL query to find all customers who never order anything.
You are asked to cut off trees in a forest for a golf event. The forest is represented as a non-negative 2D map, in this map:
diff --git a/problems/daily-temperatures/README.md b/problems/daily-temperatures/README.md index 414173ba3..9c0e7c3b7 100644 --- a/problems/daily-temperatures/README.md +++ b/problems/daily-temperatures/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/delete-and-earn "Delete and Earn") -## 739. Daily Temperatures (Medium) +## [739. Daily Temperatures (Medium)](https://leetcode.com/problems/daily-temperatures "ๆฏๆฅๆธฉๅบฆ")
Given a list of daily temperatures T, return a list such that, for each day in the input, tells you how many days you would have to wait until a warmer temperature. If there is no future day for which this is possible, put 0 instead.
diff --git a/problems/data-stream-as-disjoint-intervals/README.md b/problems/data-stream-as-disjoint-intervals/README.md
index 82bdfdd66..00b7ba5f1 100644
--- a/problems/data-stream-as-disjoint-intervals/README.md
+++ b/problems/data-stream-as-disjoint-intervals/README.md
@@ -9,7 +9,7 @@
ใใใใใใใใใใใใใใใใ
[Next >](https://github.com/openset/leetcode/tree/master/problems/design-snake-game "Design Snake Game")
-## 352. Data Stream as Disjoint Intervals (Hard)
+## [352. Data Stream as Disjoint Intervals (Hard)](https://leetcode.com/problems/data-stream-as-disjoint-intervals "ๅฐๆฐๆฎๆตๅไธบๅคไธชไธ็ธไบคๅบ้ด")
Given a data stream input of non-negative integers a1, a2, ..., an, ..., summarize the numbers seen so far as a list of disjoint intervals.
diff --git a/problems/day-of-the-week/README.md b/problems/day-of-the-week/README.md index 4556fb615..2dc9e3411 100644 --- a/problems/day-of-the-week/README.md +++ b/problems/day-of-the-week/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/maximum-subarray-sum-with-one-deletion "Maximum Subarray Sum with One Deletion") -## 1185. Day of the Week (Easy) +## [1185. Day of the Week (Easy)](https://leetcode.com/problems/day-of-the-week "ไธๅจไธญ็็ฌฌๅ ๅคฉ")Given a date, return the corresponding day of the week for that date.
diff --git a/problems/day-of-the-year/README.md b/problems/day-of-the-year/README.md index f397007d9..34f9b79b4 100644 --- a/problems/day-of-the-year/README.md +++ b/problems/day-of-the-year/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/number-of-dice-rolls-with-target-sum "Number of Dice Rolls With Target Sum") -## 1154. Day of the Year (Easy) +## [1154. Day of the Year (Easy)](https://leetcode.com/problems/day-of-the-year "")Given a string date representing a Gregorian calendar date formatted as YYYY-MM-DD, return the day number of the year.
Given an encoded string, return its decoded string.
diff --git a/problems/decode-ways-ii/README.md b/problems/decode-ways-ii/README.md index 2211a3562..53a80f86e 100644 --- a/problems/decode-ways-ii/README.md +++ b/problems/decode-ways-ii/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/solve-the-equation "Solve the Equation") -## 639. Decode Ways II (Hard) +## [639. Decode Ways II (Hard)](https://leetcode.com/problems/decode-ways-ii "่งฃ็ ๆนๆณ 2")
A message containing letters from A-Z is being encoded to numbers using the following mapping way:
diff --git a/problems/decode-ways/README.md b/problems/decode-ways/README.md
index 1d8ce1b81..3a2569d2f 100644
--- a/problems/decode-ways/README.md
+++ b/problems/decode-ways/README.md
@@ -9,7 +9,7 @@
ใใใใใใใใใใใใใใใใ
[Next >](https://github.com/openset/leetcode/tree/master/problems/reverse-linked-list-ii "Reverse Linked List II")
-## 91. Decode Ways (Medium)
+## [91. Decode Ways (Medium)](https://leetcode.com/problems/decode-ways "่งฃ็ ๆนๆณ")
A message containing letters from A-Z is being encoded to numbers using the following mapping:
An encoded string S is given. To find and write the decoded string to a tape, the encoded string is read one character at a time and the following steps are taken:
Given an array nums of integers, a move consists of choosing any element and decreasing it by 1.
Given a valid (IPv4) IP address, return a defanged version of that IP address.
Given a non-empty array of non-negative integers nums, the degree of this array is defined as the maximum frequency of any one of its elements.
Your task is to find the smallest possible length of a (contiguous) subarray of nums, that has the same degree as nums.
Given an array nums of integers, you can perform operations on the array.
We are given an array A of N lowercase letter strings, all of the same length.
We are given an array A of N lowercase letter strings, all of the same length.
We are given an array A of N lowercase letter strings, all of the same length.
Write a SQL query to delete all duplicate email entries in a table named Person, keeping only unique emails based on its smallest Id.
Given a root node reference of a BST and a key, delete the node with the given key in the BST. Return the root node reference (possibly updated) of the BST.
diff --git a/problems/delete-node-in-a-linked-list/README.md b/problems/delete-node-in-a-linked-list/README.md index 049cff9db..5df329c78 100644 --- a/problems/delete-node-in-a-linked-list/README.md +++ b/problems/delete-node-in-a-linked-list/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/product-of-array-except-self "Product of Array Except Self") -## 237. Delete Node in a Linked List (Easy) +## [237. Delete Node in a Linked List (Easy)](https://leetcode.com/problems/delete-node-in-a-linked-list "ๅ ้ค้พ่กจไธญ็่็น")Write a function to delete a node (except the tail) in a singly linked list, given only access to that node.
diff --git a/problems/delete-nodes-and-return-forest/README.md b/problems/delete-nodes-and-return-forest/README.md index 9deedf4a1..ed19b1c24 100644 --- a/problems/delete-nodes-and-return-forest/README.md +++ b/problems/delete-nodes-and-return-forest/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/maximum-nesting-depth-of-two-valid-parentheses-strings "Maximum Nesting Depth of Two Valid Parentheses Strings") -## 1110. Delete Nodes And Return Forest (Medium) +## [1110. Delete Nodes And Return Forest (Medium)](https://leetcode.com/problems/delete-nodes-and-return-forest "ๅ ็นๆๆ")Given the root of a binary tree, each node in the tree has a distinct value.
Given two words word1 and word2, find the minimum number of steps required to make word1 and word2 the same, where in each step you can delete one character in either string. diff --git a/problems/department-highest-salary/README.md b/problems/department-highest-salary/README.md index 29de509a6..4e64bd78b 100644 --- a/problems/department-highest-salary/README.md +++ b/problems/department-highest-salary/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/department-top-three-salaries "Department Top Three Salaries") -## 184. Department Highest Salary (Medium) +## [184. Department Highest Salary (Medium)](https://leetcode.com/problems/department-highest-salary "้จ้จๅทฅ่ตๆ้ซ็ๅๅทฅ")
The Employee table holds all employees. Every employee has an Id, a salary, and there is also a column for the department Id.
The Employee table holds all employees. Every employee has an Id, and there is also a column for the department Id.
Design your implementation of the circular double-ended queue (deque).
diff --git a/problems/design-circular-queue/README.md b/problems/design-circular-queue/README.md index 517436f91..d87c12783 100644 --- a/problems/design-circular-queue/README.md +++ b/problems/design-circular-queue/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/add-one-row-to-tree "Add One Row to Tree") -## 622. Design Circular Queue (Medium) +## [622. Design Circular Queue (Medium)](https://leetcode.com/problems/design-circular-queue "่ฎพ่ฎกๅพช็ฏ้ๅ")Design your implementation of the circular queue. The circular queue is a linear data structure in which the operations are performed based on FIFO (First In First Out) principle and the last position is connected back to the first position to make a circle. It is also called "Ring Buffer".
diff --git a/problems/design-compressed-string-iterator/README.md b/problems/design-compressed-string-iterator/README.md index f20c5d5a2..03cb95090 100644 --- a/problems/design-compressed-string-iterator/README.md +++ b/problems/design-compressed-string-iterator/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/can-place-flowers "Can Place Flowers") -## 604. Design Compressed String Iterator (Easy) +## [604. Design Compressed String Iterator (Easy)](https://leetcode.com/problems/design-compressed-string-iterator "่ฟญไปฃๅ็ผฉๅญ็ฌฆไธฒ")
Design and implement a data structure for a compressed string iterator. It should support the following operations: next and hasNext.
diff --git a/problems/design-excel-sum-formula/README.md b/problems/design-excel-sum-formula/README.md
index d44af66d9..6fec113cb 100644
--- a/problems/design-excel-sum-formula/README.md
+++ b/problems/design-excel-sum-formula/README.md
@@ -9,7 +9,7 @@
ใใใใใใใใใใใใใใใใ
[Next >](https://github.com/openset/leetcode/tree/master/problems/smallest-range-covering-elements-from-k-lists "Smallest Range Covering Elements from K Lists")
-## 631. Design Excel Sum Formula (Hard)
+## [631. Design Excel Sum Formula (Hard)](https://leetcode.com/problems/design-excel-sum-formula "่ฎพ่ฎก Excel ๆฑๅๅ
ฌๅผ")
diff --git a/problems/design-file-system/README.md b/problems/design-file-system/README.md
index cd509f74d..a82c1464f 100644
--- a/problems/design-file-system/README.md
+++ b/problems/design-file-system/README.md
@@ -9,7 +9,7 @@
ใใใใใใใใใใใใใใใใ
[Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-cost-to-connect-sticks "Minimum Cost to Connect Sticks")
-## 1166. Design File System (Medium)
+## [1166. Design File System (Medium)](https://leetcode.com/problems/design-file-system "่ฎพ่ฎกๆไปถ็ณป็ป")
diff --git a/problems/design-hashmap/README.md b/problems/design-hashmap/README.md
index 11365762f..6a547f5e4 100644
--- a/problems/design-hashmap/README.md
+++ b/problems/design-hashmap/README.md
@@ -9,7 +9,7 @@
ใใใใใใใใใใใใใใใใ
[Next >](https://github.com/openset/leetcode/tree/master/problems/design-linked-list "Design Linked List")
-## 706. Design HashMap (Easy)
+## [706. Design HashMap (Easy)](https://leetcode.com/problems/design-hashmap "่ฎพ่ฎกๅๅธๆ ๅฐ")
Design a HashMap without using any built-in hash table libraries.
diff --git a/problems/design-hashset/README.md b/problems/design-hashset/README.md index 27869ab7c..f2167ee1a 100644 --- a/problems/design-hashset/README.md +++ b/problems/design-hashset/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/design-hashmap "Design HashMap") -## 705. Design HashSet (Easy) +## [705. Design HashSet (Easy)](https://leetcode.com/problems/design-hashset "่ฎพ่ฎกๅๅธ้ๅ")Design a HashSet without using any built-in hash table libraries.
diff --git a/problems/design-hit-counter/README.md b/problems/design-hit-counter/README.md index c47460503..994783774 100644 --- a/problems/design-hit-counter/README.md +++ b/problems/design-hit-counter/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/max-sum-of-rectangle-no-larger-than-k "Max Sum of Rectangle No Larger Than K") -## 362. Design Hit Counter (Medium) +## [362. Design Hit Counter (Medium)](https://leetcode.com/problems/design-hit-counter "ๆฒๅป่ฎกๆฐๅจ") diff --git a/problems/design-in-memory-file-system/README.md b/problems/design-in-memory-file-system/README.md index ef68f1cb5..c4650d754 100644 --- a/problems/design-in-memory-file-system/README.md +++ b/problems/design-in-memory-file-system/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/n-ary-tree-preorder-traversal "N-ary Tree Preorder Traversal") -## 588. Design In-Memory File System (Hard) +## [588. Design In-Memory File System (Hard)](https://leetcode.com/problems/design-in-memory-file-system "่ฎพ่ฎกๅ ๅญๆไปถ็ณป็ป")Design an in-memory file system to simulate the following functions:
diff --git a/problems/design-linked-list/README.md b/problems/design-linked-list/README.md index c6e5b7263..3c9009b67 100644 --- a/problems/design-linked-list/README.md +++ b/problems/design-linked-list/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/insert-into-a-cyclic-sorted-list "Insert into a Cyclic Sorted List") -## 707. Design Linked List (Easy) +## [707. Design Linked List (Easy)](https://leetcode.com/problems/design-linked-list "่ฎพ่ฎก้พ่กจ")Design your implementation of the linked list. You can choose to use the singly linked list or the doubly linked list. A node in a singly linked list should have two attributes: val and next. val is the value of the current node, and next is a pointer/reference to the next node. If you want to use the doubly linked list, you will need one more attribute prev to indicate the previous node in the linked list. Assume all nodes in the linked list are 0-indexed.
Design a simplified version of Twitter where users can post tweets, follow/unfollow another user and is able to see the 10 most recent tweets in the user's news feed. Your design should support the following methods:
diff --git a/problems/detect-capital/README.md b/problems/detect-capital/README.md index a092ebfdd..dcfa152ea 100644 --- a/problems/detect-capital/README.md +++ b/problems/detect-capital/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/longest-uncommon-subsequence-i "Longest Uncommon Subsequence I ") -## 520. Detect Capital (Easy) +## [520. Detect Capital (Easy)](https://leetcode.com/problems/detect-capital "ๆฃๆตๅคงๅๅญๆฏ")Given a word, you need to judge whether the usage of capitals in it is right or not.
diff --git a/problems/di-string-match/README.md b/problems/di-string-match/README.md index 6b90f69a4..904142157 100644 --- a/problems/di-string-match/README.md +++ b/problems/di-string-match/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/find-the-shortest-superstring "Find the Shortest Superstring") -## 942. DI String Match (Easy) +## [942. DI String Match (Easy)](https://leetcode.com/problems/di-string-match "ๅขๅๅญ็ฌฆไธฒๅน้ ")Given a string S that only contains "I" (increase) or "D" (decrease), let N = S.length.
Given a matrix of M x N elements (M rows, N columns), return all elements of the matrix in diagonal order as shown in the below image.
diff --git a/problems/diameter-of-binary-tree/README.md b/problems/diameter-of-binary-tree/README.md index 591fa303d..43408cbaf 100644 --- a/problems/diameter-of-binary-tree/README.md +++ b/problems/diameter-of-binary-tree/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/output-contest-matches "Output Contest Matches") -## 543. Diameter of Binary Tree (Easy) +## [543. Diameter of Binary Tree (Easy)](https://leetcode.com/problems/diameter-of-binary-tree "ไบๅๆ ็็ดๅพ")Given a binary tree, you need to compute the length of the diameter of the tree. The diameter of a binary tree is the length of the longest path between any two nodes in a tree. This path may or may not pass through the root. diff --git a/problems/diet-plan-performance/README.md b/problems/diet-plan-performance/README.md index b956703fe..c6d6531de 100644 --- a/problems/diet-plan-performance/README.md +++ b/problems/diet-plan-performance/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/can-make-palindrome-from-substring "Can Make Palindrome from Substring") -## 1176. Diet Plan Performance (Easy) +## [1176. Diet Plan Performance (Easy)](https://leetcode.com/problems/diet-plan-performance "ๅฅ่บซ่ฎกๅ่ฏไผฐ")
A dieter consumes calories[i] calories on the i-th day. For every consecutive sequence of k days, they look at T, the total calories consumed during that sequence of k days:
Given a string of numbers and operators, return all possible results from computing all the different possible ways to group numbers and operators. The valid operators are +, - and *.
d between 0 and 9, and two positive integers low and high as lower and upper bounds, respectively. Return the number of times that d occurs as a digit in all integers between low and high, including the bounds low and high.
diff --git a/problems/dinner-plate-stacks/README.md b/problems/dinner-plate-stacks/README.md index 1fa219109..60f18c04f 100644 --- a/problems/dinner-plate-stacks/README.md +++ b/problems/dinner-plate-stacks/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/immediate-food-delivery-i "Immediate Food Delivery I") -## 1172. Dinner Plate Stacks (Hard) +## [1172. Dinner Plate Stacks (Hard)](https://leetcode.com/problems/dinner-plate-stacks "้ค็ๆ ")
You have an infinite number of stacks arranged in a row and numbered (left to right) from 0, each of the stacks has the same maximum capacity.
A bus has n stops numbered from 0 to n - 1 that form a circle. We know the distance between all pairs of neighboring stops where distance[i] is the distance between the stops number i and (i + 1) % n.
In a warehouse, there is a row of barcodes, where the i-th barcode is barcodes[i].
Given a string S, count the number of distinct, non-empty subsequences of S .
Given a string S and a string T, count the number of distinct subsequences of S which equals T.
diff --git a/problems/distribute-candies-to-people/README.md b/problems/distribute-candies-to-people/README.md index cc2f331e3..a40be9024 100644 --- a/problems/distribute-candies-to-people/README.md +++ b/problems/distribute-candies-to-people/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/path-in-zigzag-labelled-binary-tree "Path In Zigzag Labelled Binary Tree") -## 1103. Distribute Candies to People (Easy) +## [1103. Distribute Candies to People (Easy)](https://leetcode.com/problems/distribute-candies-to-people "ๅ็ณๆ II")We distribute some number of candies, to a row of n = num_people people in the following way:
Given the root of a binary tree with N nodes, each node in the tree has node.val coins, and there are N coins total.
Given two integers dividend and divisor, divide two integers without using multiplication, division and mod operator.
Alice and Bob take turns playing a game, with Alice starting first.
diff --git a/problems/domino-and-tromino-tiling/README.md b/problems/domino-and-tromino-tiling/README.md index 2493757fb..67d8e276b 100644 --- a/problems/domino-and-tromino-tiling/README.md +++ b/problems/domino-and-tromino-tiling/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/custom-sort-string "Custom Sort String") -## 790. Domino and Tromino Tiling (Medium) +## [790. Domino and Tromino Tiling (Medium)](https://leetcode.com/problems/domino-and-tromino-tiling "ๅค็ฑณ่ฏบๅๆ็ฑณ่ฏบๅนณ้บ")We have two types of tiles: a 2x1 domino shape, and an "L" tromino shape. These shapes may be rotated.
diff --git a/problems/dota2-senate/README.md b/problems/dota2-senate/README.md index 423a94f11..e0a6664fa 100644 --- a/problems/dota2-senate/README.md +++ b/problems/dota2-senate/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/2-keys-keyboard "2 Keys Keyboard") -## 649. Dota2 Senate (Medium) +## [649. Dota2 Senate (Medium)](https://leetcode.com/problems/dota2-senate "Dota2 ๅ่ฎฎ้ข")In the world of Dota2, there are two parties: the Radiant and the Dire.
The demons had captured the princess (P) and imprisoned her in the bottom-right corner of a dungeon. The dungeon consists of M x N rooms laid out in a 2D grid. Our valiant knight (K) was initially positioned in the top-left room and must fight his way through the dungeon to rescue the princess.
diff --git a/problems/duplicate-emails/README.md b/problems/duplicate-emails/README.md index 86b65529a..6c3c10853 100644 --- a/problems/duplicate-emails/README.md +++ b/problems/duplicate-emails/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/customers-who-never-order "Customers Who Never Order") -## 182. Duplicate Emails (Easy) +## [182. Duplicate Emails (Easy)](https://leetcode.com/problems/duplicate-emails "ๆฅๆพ้ๅค็็ตๅญ้ฎ็ฎฑ")Write a SQL query to find all duplicate emails in a table named Person.
Given a fixed length array arr of integers, duplicate each occurrence of zero, shifting the remaining elements to the right.
Given two words word1 and word2, find the minimum number of operations required to convert word1 to word2.
diff --git a/problems/elimination-game/README.md b/problems/elimination-game/README.md index 9813f4f0d..ea1bc19a1 100644 --- a/problems/elimination-game/README.md +++ b/problems/elimination-game/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/perfect-rectangle "Perfect Rectangle") -## 390. Elimination Game (Medium) +## [390. Elimination Game (Medium)](https://leetcode.com/problems/elimination-game "ๆถ้คๆธธๆ")There is a list of sorted integers from 1 to n. Starting from left to right, remove the first number and every other number afterward until you reach the end of the list.
diff --git a/problems/employee-bonus/README.md b/problems/employee-bonus/README.md index 5a49394f2..5f390e4f5 100644 --- a/problems/employee-bonus/README.md +++ b/problems/employee-bonus/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/get-highest-answer-rate-question "Get Highest Answer Rate Question") -## 577. Employee Bonus (Easy) +## [577. Employee Bonus (Easy)](https://leetcode.com/problems/employee-bonus "ๅๅทฅๅฅ้")Select all employee's name and bonus whose bonus is < 1000.
diff --git a/problems/employee-free-time/README.md b/problems/employee-free-time/README.md index 3335e7e76..e221df32c 100644 --- a/problems/employee-free-time/README.md +++ b/problems/employee-free-time/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/find-anagram-mappings "Find Anagram Mappings") -## 759. Employee Free Time (Hard) +## [759. Employee Free Time (Hard)](https://leetcode.com/problems/employee-free-time "ๅๅทฅ็ฉบ้ฒๆถ้ด") diff --git a/problems/employee-importance/README.md b/problems/employee-importance/README.md index 73763fd05..17f9c8afa 100644 --- a/problems/employee-importance/README.md +++ b/problems/employee-importance/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/stickers-to-spell-word "Stickers to Spell Word") -## 690. Employee Importance (Easy) +## [690. Employee Importance (Easy)](https://leetcode.com/problems/employee-importance "ๅๅทฅ็้่ฆๆง")You are given a data structure of employee information, which includes the employee's unique id, his importance value and his direct subordinates' id.
diff --git a/problems/employees-earning-more-than-their-managers/README.md b/problems/employees-earning-more-than-their-managers/README.md index 602ae9051..4f6b0b684 100644 --- a/problems/employees-earning-more-than-their-managers/README.md +++ b/problems/employees-earning-more-than-their-managers/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/duplicate-emails "Duplicate Emails") -## 181. Employees Earning More Than Their Managers (Easy) +## [181. Employees Earning More Than Their Managers (Easy)](https://leetcode.com/problems/employees-earning-more-than-their-managers "่ถ ่ฟ็ป็ๆถๅ ฅ็ๅๅทฅ")The Employee table holds all employees including their managers. Every employee has an Id, and there is also a column for the manager Id.
Design an algorithm to encode a list of strings to a string. The encoded string is then sent over the network and is decoded back to the original list of strings.
diff --git a/problems/encode-and-decode-tinyurl/README.md b/problems/encode-and-decode-tinyurl/README.md index b6db29900..d4ac836c6 100644 --- a/problems/encode-and-decode-tinyurl/README.md +++ b/problems/encode-and-decode-tinyurl/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/construct-binary-tree-from-string "Construct Binary Tree from String") -## 535. Encode and Decode TinyURL (Medium) +## [535. Encode and Decode TinyURL (Medium)](https://leetcode.com/problems/encode-and-decode-tinyurl "TinyURL ็ๅ ๅฏไธ่งฃๅฏ")Note: This is a companion problem to the System Design problem: Design TinyURL.diff --git a/problems/encode-n-ary-tree-to-binary-tree/README.md b/problems/encode-n-ary-tree-to-binary-tree/README.md index a0644ebe2..14f2da0b8 100644 --- a/problems/encode-n-ary-tree-to-binary-tree/README.md +++ b/problems/encode-n-ary-tree-to-binary-tree/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/all-oone-data-structure "All O`one Data Structure") -## 431. Encode N-ary Tree to Binary Tree (Hard) +## [431. Encode N-ary Tree to Binary Tree (Hard)](https://leetcode.com/problems/encode-n-ary-tree-to-binary-tree "ๅฐ N ๅๆ ็ผ็ ไธบไบๅๆ ") diff --git a/problems/encode-string-with-shortest-length/README.md b/problems/encode-string-with-shortest-length/README.md index 3cb78bad4..c69e47085 100644 --- a/problems/encode-string-with-shortest-length/README.md +++ b/problems/encode-string-with-shortest-length/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/concatenated-words "Concatenated Words") -## 471. Encode String with Shortest Length (Hard) +## [471. Encode String with Shortest Length (Hard)](https://leetcode.com/problems/encode-string-with-shortest-length "็ผ็ ๆ็ญ้ฟๅบฆ็ๅญ็ฌฆไธฒ") diff --git a/problems/equal-rational-numbers/README.md b/problems/equal-rational-numbers/README.md index dfbecae61..7b30d8133 100644 --- a/problems/equal-rational-numbers/README.md +++ b/problems/equal-rational-numbers/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/k-closest-points-to-origin "K Closest Points to Origin") -## 972. Equal Rational Numbers (Hard) +## [972. Equal Rational Numbers (Hard)](https://leetcode.com/problems/equal-rational-numbers "็ธ็ญ็ๆ็ๆฐ")
Given two strings S and T, each of which represents a non-negative rational number, return True if and only if they represent the same number. The strings may use parentheses to denote the repeating part of the rational number.
Given a binary tree with n nodes, your task is to check if it's possible to partition the tree to two trees which have the equal sum of values after removing exactly one edge on the original tree.
diff --git a/problems/erect-the-fence/README.md b/problems/erect-the-fence/README.md
index b10d63036..200ec6428 100644
--- a/problems/erect-the-fence/README.md
+++ b/problems/erect-the-fence/README.md
@@ -9,7 +9,7 @@
ใใใใใใใใใใใใใใใใ
[Next >](https://github.com/openset/leetcode/tree/master/problems/design-in-memory-file-system "Design In-Memory File System")
-## 587. Erect the Fence (Hard)
+## [587. Erect the Fence (Hard)](https://leetcode.com/problems/erect-the-fence "ๅฎ่ฃ
ๆ
ๆ ")
There are some trees, where each tree is represented by (x,y) coordinate in a two-dimensional garden. Your job is to fence the entire garden using the minimum length of rope as it is expensive. The garden is well fenced only if all the trees are enclosed. Your task is to help find the coordinates of trees which are exactly located on the fence perimeter.
diff --git a/problems/escape-a-large-maze/README.md b/problems/escape-a-large-maze/README.md index 38bf0e5bb..b36b78f3b 100644 --- a/problems/escape-a-large-maze/README.md +++ b/problems/escape-a-large-maze/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/valid-boomerang "Valid Boomerang") -## 1036. Escape a Large Maze (Hard) +## [1036. Escape a Large Maze (Hard)](https://leetcode.com/problems/escape-a-large-maze "้็ฆปๅคง่ฟทๅฎซ")In a 1 million by 1 million grid, the coordinates of each grid square are (x, y) with 0 <= x, y < 10^6.
You are playing a simplified Pacman game. You start at the point (0, 0), and your destination is (target[0], target[1]). There are several ghosts on the map, the i-th ghost starts at (ghosts[i][0], ghosts[i][1]).
Equations are given in the format A / B = k, where A and B are variables represented as strings, and k is a real number (floating point number). Given some queries, return the answers. If the answer does not exist, return -1.0.
Evaluate the value of an arithmetic expression in Reverse Polish Notation.
diff --git a/problems/exam-room/README.md b/problems/exam-room/README.md index 51a03c3ec..3e40ccb17 100644 --- a/problems/exam-room/README.md +++ b/problems/exam-room/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/score-of-parentheses "Score of Parentheses") -## 855. Exam Room (Medium) +## [855. Exam Room (Medium)](https://leetcode.com/problems/exam-room "่ๅบๅฐฑๅบง")In an exam room, there are N seats in a single row, numbered 0, 1, 2, ..., N-1.
Given a column title as appear in an Excel sheet, return its corresponding column number.
diff --git a/problems/excel-sheet-column-title/README.md b/problems/excel-sheet-column-title/README.md index b5dcb87cb..ad0ca9fde 100644 --- a/problems/excel-sheet-column-title/README.md +++ b/problems/excel-sheet-column-title/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/majority-element "Majority Element") -## 168. Excel Sheet Column Title (Easy) +## [168. Excel Sheet Column Title (Easy)](https://leetcode.com/problems/excel-sheet-column-title "Excel่กจๅๅ็งฐ")Given a positive integer, return its corresponding column title as appear in an Excel sheet.
diff --git a/problems/exchange-seats/README.md b/problems/exchange-seats/README.md index 2bb05c096..f433e5da1 100644 --- a/problems/exchange-seats/README.md +++ b/problems/exchange-seats/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/swap-salary "Swap Salary") -## 626. Exchange Seats (Medium) +## [626. Exchange Seats (Medium)](https://leetcode.com/problems/exchange-seats "ๆขๅบงไฝ")Mary is a teacher in a middle school and she has a table seat storing students' names and their corresponding seat ids.
On a single threaded CPU, we execute some functions. Each function has a unique id between 0 and N-1.
Given a string that contains only digits 0-9 and a target value, return all possibilities to add binary operators (not unary) +, -, or * between the digits so they evaluate to the target value.
Sometimes people repeat letters to represent extra feeling, such as "hello" -> "heeellooo", "hi" -> "hiiii". In these strings like "heeellooo", we have groups of adjacent letters that are all the same: "h", "eee", "ll", "ooo".
diff --git a/problems/factor-combinations/README.md b/problems/factor-combinations/README.md index 70800c7c1..9e07e7737 100644 --- a/problems/factor-combinations/README.md +++ b/problems/factor-combinations/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/verify-preorder-sequence-in-binary-search-tree "Verify Preorder Sequence in Binary Search Tree") -## 254. Factor Combinations (Medium) +## [254. Factor Combinations (Medium)](https://leetcode.com/problems/factor-combinations "ๅ ๅญ็็ปๅ") diff --git a/problems/factorial-trailing-zeroes/README.md b/problems/factorial-trailing-zeroes/README.md index ce62e8eef..699e5d0a6 100644 --- a/problems/factorial-trailing-zeroes/README.md +++ b/problems/factorial-trailing-zeroes/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/binary-search-tree-iterator "Binary Search Tree Iterator") -## 172. Factorial Trailing Zeroes (Easy) +## [172. Factorial Trailing Zeroes (Easy)](https://leetcode.com/problems/factorial-trailing-zeroes "้ถไนๅ็้ถ")Given an integer n, return the number of trailing zeroes in n!.
diff --git a/problems/fair-candy-swap/README.md b/problems/fair-candy-swap/README.md index 7760b31d8..77ec6bc00 100644 --- a/problems/fair-candy-swap/README.md +++ b/problems/fair-candy-swap/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/construct-binary-tree-from-preorder-and-postorder-traversal "Construct Binary Tree from Preorder and Postorder Traversal") -## 888. Fair Candy Swap (Easy) +## [888. Fair Candy Swap (Easy)](https://leetcode.com/problems/fair-candy-swap "ๅ ฌๅนณ็็ณๆไบคๆข")Alice and Bob have candy bars of different sizes: A[i] is the size of the i-th bar of candy that Alice has, and B[j] is the size of the j-th bar of candy that Bob has.
On an infinite number line (x-axis), we drop given squares in the order they are given.
diff --git a/problems/fibonacci-number/README.md b/problems/fibonacci-number/README.md index ca8f9e949..fcb1407d4 100644 --- a/problems/fibonacci-number/README.md +++ b/problems/fibonacci-number/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/inorder-successor-in-bst-ii "Inorder Successor in BST II") -## 509. Fibonacci Number (Easy) +## [509. Fibonacci Number (Easy)](https://leetcode.com/problems/fibonacci-number "ๆๆณข้ฃๅฅๆฐ")The Fibonacci numbers, commonly denoted F(n) form a sequence, called the Fibonacci sequence, such that each number is the sum of the two preceding ones, starting from 0 and 1. That is,
We have a sequence of books: the i-th book has thickness books[i][0] and height books[i][1].
Given a string s and a non-empty string p, find all the start indices of p's anagrams in s.
diff --git a/problems/find-all-duplicates-in-an-array/README.md b/problems/find-all-duplicates-in-an-array/README.md index a51e11ff0..b1068827c 100644 --- a/problems/find-all-duplicates-in-an-array/README.md +++ b/problems/find-all-duplicates-in-an-array/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/string-compression "String Compression") -## 442. Find All Duplicates in an Array (Medium) +## [442. Find All Duplicates in an Array (Medium)](https://leetcode.com/problems/find-all-duplicates-in-an-array "ๆฐ็ปไธญ้ๅค็ๆฐๆฎ")Given an array of integers, 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once.
diff --git a/problems/find-all-numbers-disappeared-in-an-array/README.md b/problems/find-all-numbers-disappeared-in-an-array/README.md index 4d034d887..5e2363f9f 100644 --- a/problems/find-all-numbers-disappeared-in-an-array/README.md +++ b/problems/find-all-numbers-disappeared-in-an-array/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/serialize-and-deserialize-bst "Serialize and Deserialize BST") -## 448. Find All Numbers Disappeared in an Array (Easy) +## [448. Find All Numbers Disappeared in an Array (Easy)](https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array "ๆพๅฐๆๆๆฐ็ปไธญๆถๅคฑ็ๆฐๅญ")Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once.
diff --git a/problems/find-anagram-mappings/README.md b/problems/find-anagram-mappings/README.md index a31d770a5..6fe0b3d78 100644 --- a/problems/find-anagram-mappings/README.md +++ b/problems/find-anagram-mappings/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/special-binary-string "Special Binary String") -## 760. Find Anagram Mappings (Easy) +## [760. Find Anagram Mappings (Easy)](https://leetcode.com/problems/find-anagram-mappings "ๆพๅบๅไฝๆ ๅฐ") diff --git a/problems/find-and-replace-in-string/README.md b/problems/find-and-replace-in-string/README.md index a07dade5d..989beeab2 100644 --- a/problems/find-and-replace-in-string/README.md +++ b/problems/find-and-replace-in-string/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/sum-of-distances-in-tree "Sum of Distances in Tree") -## 833. Find And Replace in String (Medium) +## [833. Find And Replace in String (Medium)](https://leetcode.com/problems/find-and-replace-in-string "ๅญ็ฌฆไธฒไธญ็ๆฅๆพไธๆฟๆข")To some string S, we will perform some replacement operations that replace groups of letters with new ones (not necessarily the same size).
You have a list of words and a pattern, and you want to know which words in words matches the pattern.
Given a binary tree, find the leftmost value in the last row of the tree. diff --git a/problems/find-common-characters/README.md b/problems/find-common-characters/README.md index da6e1937b..4da233435 100644 --- a/problems/find-common-characters/README.md +++ b/problems/find-common-characters/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/check-if-word-is-valid-after-substitutions "Check If Word Is Valid After Substitutions") -## 1002. Find Common Characters (Easy) +## [1002. Find Common Characters (Easy)](https://leetcode.com/problems/find-common-characters "ๆฅๆพๅธธ็จๅญ็ฌฆ")
Given an array A of strings made only from lowercase letters, return a list of all characters that show up in all strings within the list (including duplicates). For example, if a character occurs 3 times in all strings but not 4 times, you need to include that character three times in the final answer.
The Employee table holds the salary information in a year.
diff --git a/problems/find-customer-referee/README.md b/problems/find-customer-referee/README.md index f6323a4d5..3c97763f6 100644 --- a/problems/find-customer-referee/README.md +++ b/problems/find-customer-referee/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/investments-in-2016 "Investments in 2016") -## 584. Find Customer Referee (Easy) +## [584. Find Customer Referee (Easy)](https://leetcode.com/problems/find-customer-referee "ๅฏปๆพ็จๆทๆจ่ไบบ")Given a table customer holding customers information and the referee.
Given a list of directory info including directory path, and all the files with contents in this directory, you need to find out all the groups of duplicate files in the file system in terms of their paths.
diff --git a/problems/find-duplicate-subtrees/README.md b/problems/find-duplicate-subtrees/README.md index f4f5a87b3..f5fa2de52 100644 --- a/problems/find-duplicate-subtrees/README.md +++ b/problems/find-duplicate-subtrees/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/two-sum-iv-input-is-a-bst "Two Sum IV - Input is a BST") -## 652. Find Duplicate Subtrees (Medium) +## [652. Find Duplicate Subtrees (Medium)](https://leetcode.com/problems/find-duplicate-subtrees "ๅฏปๆพ้ๅค็ๅญๆ ")Given a binary tree, return all duplicate subtrees. For each kind of duplicate subtrees, you only need to return the root node of any one of them.
diff --git a/problems/find-eventual-safe-states/README.md b/problems/find-eventual-safe-states/README.md index c31220dea..6a01cb5dc 100644 --- a/problems/find-eventual-safe-states/README.md +++ b/problems/find-eventual-safe-states/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/bricks-falling-when-hit "Bricks Falling When Hit") -## 802. Find Eventual Safe States (Medium) +## [802. Find Eventual Safe States (Medium)](https://leetcode.com/problems/find-eventual-safe-states "ๆพๅฐๆ็ป็ๅฎๅ จ็ถๆ")In a directed graph, we start at some node and every turn, walk along a directed edge of the graph. If we reach a node that is terminal (that is, it has no outgoing directed edges), we stop.
diff --git a/problems/find-first-and-last-position-of-element-in-sorted-array/README.md b/problems/find-first-and-last-position-of-element-in-sorted-array/README.md index 9b0cbf914..cd6946bc6 100644 --- a/problems/find-first-and-last-position-of-element-in-sorted-array/README.md +++ b/problems/find-first-and-last-position-of-element-in-sorted-array/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/search-insert-position "Search Insert Position") -## 34. Find First and Last Position of Element in Sorted Array (Medium) +## [34. Find First and Last Position of Element in Sorted Array (Medium)](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array "ๅจๆๅบๆฐ็ปไธญๆฅๆพๅ ็ด ็็ฌฌไธไธชๅๆๅไธไธชไฝ็ฝฎ")Given an array of integers nums sorted in ascending order, find the starting and ending position of a given target value.
(This problem is an interactive problem.)
diff --git a/problems/find-k-closest-elements/README.md b/problems/find-k-closest-elements/README.md index 7914985bf..994312f97 100644 --- a/problems/find-k-closest-elements/README.md +++ b/problems/find-k-closest-elements/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/split-array-into-consecutive-subsequences "Split Array into Consecutive Subsequences") -## 658. Find K Closest Elements (Medium) +## [658. Find K Closest Elements (Medium)](https://leetcode.com/problems/find-k-closest-elements "ๆพๅฐ K ไธชๆๆฅ่ฟ็ๅ ็ด ")
Given a sorted array, two integers k and x, find the k closest elements to x in the array. The result should also be sorted in ascending order.
diff --git a/problems/find-k-length-substrings-with-no-repeated-characters/README.md b/problems/find-k-length-substrings-with-no-repeated-characters/README.md
index ba394ec31..e9bb44c68 100644
--- a/problems/find-k-length-substrings-with-no-repeated-characters/README.md
+++ b/problems/find-k-length-substrings-with-no-repeated-characters/README.md
@@ -9,7 +9,7 @@
ใใใใใใใใใใใใใใใใ
[Next >](https://github.com/openset/leetcode/tree/master/problems/the-earliest-moment-when-everyone-become-friends "The Earliest Moment When Everyone Become Friends")
-## 1100. Find K-Length Substrings With No Repeated Characters (Medium)
+## [1100. Find K-Length Substrings With No Repeated Characters (Medium)](https://leetcode.com/problems/find-k-length-substrings-with-no-repeated-characters "้ฟๅบฆไธบ K ็ๆ ้ๅคๅญ็ฌฆๅญไธฒ")
Given a string S, return the number of substrings of length K with no repeated characters.
You are given two integer arrays nums1 and nums2 sorted in ascending order and an integer k.
diff --git a/problems/find-k-th-smallest-pair-distance/README.md b/problems/find-k-th-smallest-pair-distance/README.md index 40afaff2e..7a8e6bd1d 100644 --- a/problems/find-k-th-smallest-pair-distance/README.md +++ b/problems/find-k-th-smallest-pair-distance/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/longest-word-in-dictionary "Longest Word in Dictionary") -## 719. Find K-th Smallest Pair Distance (Hard) +## [719. Find K-th Smallest Pair Distance (Hard)](https://leetcode.com/problems/find-k-th-smallest-pair-distance "ๆพๅบ็ฌฌ k ๅฐ็่ท็ฆปๅฏน")Given an integer array, return the k-th smallest distance among all the pairs. The distance of a pair (A, B) is defined as the absolute difference between A and B.
diff --git a/problems/find-largest-value-in-each-tree-row/README.md b/problems/find-largest-value-in-each-tree-row/README.md index 838931a7e..de0ee2a27 100644 --- a/problems/find-largest-value-in-each-tree-row/README.md +++ b/problems/find-largest-value-in-each-tree-row/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/longest-palindromic-subsequence "Longest Palindromic Subsequence") -## 515. Find Largest Value in Each Tree Row (Medium) +## [515. Find Largest Value in Each Tree Row (Medium)](https://leetcode.com/problems/find-largest-value-in-each-tree-row "ๅจๆฏไธชๆ ่กไธญๆพๆๅคงๅผ")You need to find the largest value in each row of a binary tree.
diff --git a/problems/find-leaves-of-binary-tree/README.md b/problems/find-leaves-of-binary-tree/README.md index 2b2bb7b2e..1f8243b2b 100644 --- a/problems/find-leaves-of-binary-tree/README.md +++ b/problems/find-leaves-of-binary-tree/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/valid-perfect-square "Valid Perfect Square") -## 366. Find Leaves of Binary Tree (Medium) +## [366. Find Leaves of Binary Tree (Medium)](https://leetcode.com/problems/find-leaves-of-binary-tree "ๅฏปๆพๅฎๅ จไบๅๆ ็ๅถๅญ่็น") diff --git a/problems/find-median-from-data-stream/README.md b/problems/find-median-from-data-stream/README.md index 32994a14c..dc926a24e 100644 --- a/problems/find-median-from-data-stream/README.md +++ b/problems/find-median-from-data-stream/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/best-meeting-point "Best Meeting Point") -## 295. Find Median from Data Stream (Hard) +## [295. Find Median from Data Stream (Hard)](https://leetcode.com/problems/find-median-from-data-stream "ๆฐๆฎๆต็ไธญไฝๆฐ")Median is the middle value in an ordered integer list. If the size of the list is even, there is no middle value. So the median is the mean of the two middle value.
For example, diff --git a/problems/find-median-given-frequency-of-numbers/README.md b/problems/find-median-given-frequency-of-numbers/README.md index fb8c14473..d91722fef 100644 --- a/problems/find-median-given-frequency-of-numbers/README.md +++ b/problems/find-median-given-frequency-of-numbers/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/subtree-of-another-tree "Subtree of Another Tree") -## 571. Find Median Given Frequency of Numbers (Hard) +## [571. Find Median Given Frequency of Numbers (Hard)](https://leetcode.com/problems/find-median-given-frequency-of-numbers "็ปๅฎๆฐๅญ็้ข็ๆฅ่ฏขไธญไฝๆฐ") diff --git a/problems/find-minimum-in-rotated-sorted-array-ii/README.md b/problems/find-minimum-in-rotated-sorted-array-ii/README.md index 214889767..c1b778710 100644 --- a/problems/find-minimum-in-rotated-sorted-array-ii/README.md +++ b/problems/find-minimum-in-rotated-sorted-array-ii/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/min-stack "Min Stack") -## 154. Find Minimum in Rotated Sorted Array II (Hard) +## [154. Find Minimum in Rotated Sorted Array II (Hard)](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii "ๅฏปๆพๆ่ฝฌๆๅบๆฐ็ปไธญ็ๆๅฐๅผ II")Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.
diff --git a/problems/find-minimum-in-rotated-sorted-array/README.md b/problems/find-minimum-in-rotated-sorted-array/README.md index 6fbed009f..462253a0d 100644 --- a/problems/find-minimum-in-rotated-sorted-array/README.md +++ b/problems/find-minimum-in-rotated-sorted-array/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/find-minimum-in-rotated-sorted-array-ii "Find Minimum in Rotated Sorted Array II") -## 153. Find Minimum in Rotated Sorted Array (Medium) +## [153. Find Minimum in Rotated Sorted Array (Medium)](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array "ๅฏปๆพๆ่ฝฌๆๅบๆฐ็ปไธญ็ๆๅฐๅผ")Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.
diff --git a/problems/find-mode-in-binary-search-tree/README.md b/problems/find-mode-in-binary-search-tree/README.md index 4222da7e2..a93834723 100644 --- a/problems/find-mode-in-binary-search-tree/README.md +++ b/problems/find-mode-in-binary-search-tree/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/ipo "IPO") -## 501. Find Mode in Binary Search Tree (Easy) +## [501. Find Mode in Binary Search Tree (Easy)](https://leetcode.com/problems/find-mode-in-binary-search-tree "ไบๅๆ็ดขๆ ไธญ็ไผๆฐ")Given a binary search tree (BST) with duplicates, find all the mode(s) (the most frequently occurred element) in the given BST.
diff --git a/problems/find-peak-element/README.md b/problems/find-peak-element/README.md index 8d23e1ac7..3f853163e 100644 --- a/problems/find-peak-element/README.md +++ b/problems/find-peak-element/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/missing-ranges "Missing Ranges") -## 162. Find Peak Element (Medium) +## [162. Find Peak Element (Medium)](https://leetcode.com/problems/find-peak-element "ๅฏปๆพๅณฐๅผ")A peak element is an element that is greater than its neighbors.
diff --git a/problems/find-permutation/README.md b/problems/find-permutation/README.md index 235dd091b..6b22df79e 100644 --- a/problems/find-permutation/README.md +++ b/problems/find-permutation/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/max-consecutive-ones "Max Consecutive Ones") -## 484. Find Permutation (Medium) +## [484. Find Permutation (Medium)](https://leetcode.com/problems/find-permutation "ๅฏปๆพๆๅ")By now, you are given a secret signature consisting of character 'D' and 'I'. 'D' represents a decreasing relationship between two numbers, 'I' represents an increasing relationship between two numbers. And our secret signature was constructed by a special integer array, which contains uniquely all the different number from 1 to n (n is the length of the secret signature plus 1). For example, the secret signature "DI" can be constructed by array [2,1,3] or [3,1,2], but won't be constructed by array [3,2,4] or [2,1,3,4], which are both illegal constructing special string that can't represent the "DI" secret signature. diff --git a/problems/find-pivot-index/README.md b/problems/find-pivot-index/README.md index 377bb0f70..29ffd6664 100644 --- a/problems/find-pivot-index/README.md +++ b/problems/find-pivot-index/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/split-linked-list-in-parts "Split Linked List in Parts") -## 724. Find Pivot Index (Easy) +## [724. Find Pivot Index (Easy)](https://leetcode.com/problems/find-pivot-index "ๅฏปๆพๆฐ็ป็ไธญๅฟ็ดขๅผ")
Given an array of integers nums, write a method that returns the "pivot" index of this array.
Given a set of intervals, for each of the interval i, check if there exists an interval j whose start point is bigger than or equal to the end point of the interval i, which can be called that j is on the "right" of i.
diff --git a/problems/find-smallest-letter-greater-than-target/README.md b/problems/find-smallest-letter-greater-than-target/README.md index 87757f359..0de26a3ff 100644 --- a/problems/find-smallest-letter-greater-than-target/README.md +++ b/problems/find-smallest-letter-greater-than-target/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/prefix-and-suffix-search "Prefix and Suffix Search") -## 744. Find Smallest Letter Greater Than Target (Easy) +## [744. Find Smallest Letter Greater Than Target (Easy)](https://leetcode.com/problems/find-smallest-letter-greater-than-target "ๅฏปๆพๆฏ็ฎๆ ๅญๆฏๅคง็ๆๅฐๅญๆฏ")
Given a list of sorted characters letters containing only lowercase letters, and given a target letter target, find the smallest element in the list that is larger than the given target.
diff --git a/problems/find-the-celebrity/README.md b/problems/find-the-celebrity/README.md
index a84449961..a6d9f9e8d 100644
--- a/problems/find-the-celebrity/README.md
+++ b/problems/find-the-celebrity/README.md
@@ -9,7 +9,7 @@
ใใใใใใใใใใใใใใใใ
[Next >](https://github.com/openset/leetcode/tree/master/problems/first-bad-version "First Bad Version")
-## 277. Find the Celebrity (Medium)
+## [277. Find the Celebrity (Medium)](https://leetcode.com/problems/find-the-celebrity "ๆๅฏปๅไบบ")
diff --git a/problems/find-the-closest-palindrome/README.md b/problems/find-the-closest-palindrome/README.md
index acf598f53..7e935cd5f 100644
--- a/problems/find-the-closest-palindrome/README.md
+++ b/problems/find-the-closest-palindrome/README.md
@@ -9,7 +9,7 @@
ใใใใใใใใใใใใใใใใ
[Next >](https://github.com/openset/leetcode/tree/master/problems/array-nesting "Array Nesting")
-## 564. Find the Closest Palindrome (Hard)
+## [564. Find the Closest Palindrome (Hard)](https://leetcode.com/problems/find-the-closest-palindrome "ๅฏปๆพๆ่ฟ็ๅๆๆฐ")
Given an integer n, find the closest integer (not including itself), which is a palindrome.
diff --git a/problems/find-the-derangement-of-an-array/README.md b/problems/find-the-derangement-of-an-array/README.md index 1e6417b74..c1e5abef8 100644 --- a/problems/find-the-derangement-of-an-array/README.md +++ b/problems/find-the-derangement-of-an-array/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/design-log-storage-system "Design Log Storage System") -## 634. Find the Derangement of An Array (Medium) +## [634. Find the Derangement of An Array (Medium)](https://leetcode.com/problems/find-the-derangement-of-an-array "ๅฏปๆพๆฐ็ป็้ไฝๆๅ") diff --git a/problems/find-the-difference/README.md b/problems/find-the-difference/README.md index 87e71db13..4acc0919f 100644 --- a/problems/find-the-difference/README.md +++ b/problems/find-the-difference/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/elimination-game "Elimination Game") -## 389. Find the Difference (Easy) +## [389. Find the Difference (Easy)](https://leetcode.com/problems/find-the-difference "ๆพไธๅ")Given two strings s and t which consist of only lowercase letters.
diff --git a/problems/find-the-duplicate-number/README.md b/problems/find-the-duplicate-number/README.md index c91c61826..df3d0d69e 100644 --- a/problems/find-the-duplicate-number/README.md +++ b/problems/find-the-duplicate-number/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/unique-word-abbreviation "Unique Word Abbreviation") -## 287. Find the Duplicate Number (Medium) +## [287. Find the Duplicate Number (Medium)](https://leetcode.com/problems/find-the-duplicate-number "ๅฏปๆพ้ๅคๆฐ")Given an array nums containing n + 1 integers where each integer is between 1 and n (inclusive), prove that at least one duplicate number must exist. Assume that there is only one duplicate number, find the duplicate one.
diff --git a/problems/find-the-shortest-superstring/README.md b/problems/find-the-shortest-superstring/README.md index 5d5013a9f..aa5436013 100644 --- a/problems/find-the-shortest-superstring/README.md +++ b/problems/find-the-shortest-superstring/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/delete-columns-to-make-sorted "Delete Columns to Make Sorted") -## 943. Find the Shortest Superstring (Hard) +## [943. Find the Shortest Superstring (Hard)](https://leetcode.com/problems/find-the-shortest-superstring "ๆ็ญ่ถ ็บงไธฒ")Given an array A of strings, find any smallest string that contains each string in A as a substring.
In a town, there are N people labelled from 1 to N. There is a rumor that one of these people is secretly the town judge.
You are given an array of strings words and a string chars.
You are a product manager and currently leading a team to develop a new product. Unfortunately, the latest version of your product fails the quality check. Since each version is developed based on the previous version, all the versions after a bad version are also bad.
diff --git a/problems/first-missing-positive/README.md b/problems/first-missing-positive/README.md index 8edd30755..6a2455ba1 100644 --- a/problems/first-missing-positive/README.md +++ b/problems/first-missing-positive/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/trapping-rain-water "Trapping Rain Water") -## 41. First Missing Positive (Hard) +## [41. First Missing Positive (Hard)](https://leetcode.com/problems/first-missing-positive "็ผบๅคฑ็็ฌฌไธไธชๆญฃๆฐ")Given an unsorted integer array, find the smallest missing positive integer.
diff --git a/problems/first-unique-character-in-a-string/README.md b/problems/first-unique-character-in-a-string/README.md index b75aa9d82..8653cc639 100644 --- a/problems/first-unique-character-in-a-string/README.md +++ b/problems/first-unique-character-in-a-string/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/longest-absolute-file-path "Longest Absolute File Path") -## 387. First Unique Character in a String (Easy) +## [387. First Unique Character in a String (Easy)](https://leetcode.com/problems/first-unique-character-in-a-string "ๅญ็ฌฆไธฒไธญ็็ฌฌไธไธชๅฏไธๅญ็ฌฆ")Given a string, find the first non-repeating character in it and return it's index. If it doesn't exist, return -1. diff --git a/problems/fixed-point/README.md b/problems/fixed-point/README.md index 9bba63a3a..41d948be5 100644 --- a/problems/fixed-point/README.md +++ b/problems/fixed-point/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/index-pairs-of-a-string "Index Pairs of a String") -## 1064. Fixed Point (Easy) +## [1064. Fixed Point (Easy)](https://leetcode.com/problems/fixed-point "ไธๅจ็น")
Given an array A of distinct integers sorted in ascending order, return the smallest index i that satisfies A[i] == i. Return -1 if no such i exists.
Write a program that outputs the string representation of numbers from 1 to n, however:
+ +-
+
- If the number is divisible by 3, output "fizz". +
- If the number is divisible by 5, output "buzz". +
- If the number is divisible by both 3 and 5, output "fizzbuzz". +
For example, for n = 15, we output: 1, 2, fizz, 4, buzz, fizz, 7, 8, fizz, buzz, 11, fizz, 13, 14, fizzbuzz.
Suppose you are given the following code:
+ +
+class FizzBuzz {
+ public FizzBuzz(int n) { ... } // constructor
+ public void fizz(printFizz) { ... } // only output "fizz"
+ public void buzz(printBuzz) { ... } // only output "buzz"
+ public void fizzbuzz(printFizzBuzz) { ... } // only output "fizzbuzz"
+ public void number(printNumber) { ... } // only output the numbers
+}
+
+Implement a multithreaded version of FizzBuzz with four threads. The same instance of FizzBuzz will be passed to four different threads:
-
+
- Thread A will call
fizz()to check for divisibility of 3 and outputsfizz.
+ - Thread B will call
buzz()to check for divisibility of 5 and outputsbuzz.
+ - Thread C will call
fizzbuzz()to check for divisibility of 3 and 5 and outputsfizzbuzz.
+ - Thread D will call
number()which should only output the numbers.
+
Write a program that outputs the string representation of numbers from 1 to n.
diff --git a/problems/flatten-2d-vector/README.md b/problems/flatten-2d-vector/README.md index 694f604af..6807d9727 100644 --- a/problems/flatten-2d-vector/README.md +++ b/problems/flatten-2d-vector/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/meeting-rooms "Meeting Rooms") -## 251. Flatten 2D Vector (Medium) +## [251. Flatten 2D Vector (Medium)](https://leetcode.com/problems/flatten-2d-vector "ๅฑๅผไบ็ปดๅ้") diff --git a/problems/flatten-a-multilevel-doubly-linked-list/README.md b/problems/flatten-a-multilevel-doubly-linked-list/README.md index e59d207e0..8049638b1 100644 --- a/problems/flatten-a-multilevel-doubly-linked-list/README.md +++ b/problems/flatten-a-multilevel-doubly-linked-list/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/encode-n-ary-tree-to-binary-tree "Encode N-ary Tree to Binary Tree") -## 430. Flatten a Multilevel Doubly Linked List (Medium) +## [430. Flatten a Multilevel Doubly Linked List (Medium)](https://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list "ๆๅนณๅๅค็บงๅๅ้พ่กจ")You are given a doubly linked list which in addition to the next and previous pointers, it could have a child pointer, which may or may not point to a separate doubly linked list. These child lists may have one or more children of their own, and so on, to produce a multilevel data structure, as shown in the example below.
diff --git a/problems/flatten-binary-tree-to-linked-list/README.md b/problems/flatten-binary-tree-to-linked-list/README.md index a1e2f8f62..19ce00839 100644 --- a/problems/flatten-binary-tree-to-linked-list/README.md +++ b/problems/flatten-binary-tree-to-linked-list/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/distinct-subsequences "Distinct Subsequences") -## 114. Flatten Binary Tree to Linked List (Medium) +## [114. Flatten Binary Tree to Linked List (Medium)](https://leetcode.com/problems/flatten-binary-tree-to-linked-list "ไบๅๆ ๅฑๅผไธบ้พ่กจ")Given a binary tree, flatten it to a linked list in-place.
diff --git a/problems/flatten-nested-list-iterator/README.md b/problems/flatten-nested-list-iterator/README.md index eac691a10..ba6e79897 100644 --- a/problems/flatten-nested-list-iterator/README.md +++ b/problems/flatten-nested-list-iterator/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/power-of-four "Power of Four") -## 341. Flatten Nested List Iterator (Medium) +## [341. Flatten Nested List Iterator (Medium)](https://leetcode.com/problems/flatten-nested-list-iterator "ๆๅนณๅๅตๅฅๅ่กจ่ฟญไปฃๅจ")Given a nested list of integers, implement an iterator to flatten it.
diff --git a/problems/flip-binary-tree-to-match-preorder-traversal/README.md b/problems/flip-binary-tree-to-match-preorder-traversal/README.md index 338df4558..ee0574964 100644 --- a/problems/flip-binary-tree-to-match-preorder-traversal/README.md +++ b/problems/flip-binary-tree-to-match-preorder-traversal/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/equal-rational-numbers "Equal Rational Numbers") -## 971. Flip Binary Tree To Match Preorder Traversal (Medium) +## [971. Flip Binary Tree To Match Preorder Traversal (Medium)](https://leetcode.com/problems/flip-binary-tree-to-match-preorder-traversal "็ฟป่ฝฌไบๅๆ ไปฅๅน้ ๅ ๅบ้ๅ")Given a binary tree with N nodes, each node has a different value from {1, ..., N}.
Given a matrix consisting of 0s and 1s, we may choose any number of columns in the matrix and flip every cell in that column. Flipping a cell changes the value of that cell from 0 to 1 or from 1 to 0.
For a binary tree T, we can define a flip operation as follows: choose any node, and swap the left and right child subtrees.
diff --git a/problems/flip-game-ii/README.md b/problems/flip-game-ii/README.md index b43e75b14..6ef06b359 100644 --- a/problems/flip-game-ii/README.md +++ b/problems/flip-game-ii/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/find-median-from-data-stream "Find Median from Data Stream") -## 294. Flip Game II (Medium) +## [294. Flip Game II (Medium)](https://leetcode.com/problems/flip-game-ii "็ฟป่ฝฌๆธธๆ II") diff --git a/problems/flip-game/README.md b/problems/flip-game/README.md index 509f9f032..6f2e94b20 100644 --- a/problems/flip-game/README.md +++ b/problems/flip-game/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/flip-game-ii "Flip Game II") -## 293. Flip Game (Easy) +## [293. Flip Game (Easy)](https://leetcode.com/problems/flip-game "็ฟป่ฝฌๆธธๆ") diff --git a/problems/flip-string-to-monotone-increasing/README.md b/problems/flip-string-to-monotone-increasing/README.md index 437dcd85c..84c4939a8 100644 --- a/problems/flip-string-to-monotone-increasing/README.md +++ b/problems/flip-string-to-monotone-increasing/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/three-equal-parts "Three Equal Parts") -## 926. Flip String to Monotone Increasing (Medium) +## [926. Flip String to Monotone Increasing (Medium)](https://leetcode.com/problems/flip-string-to-monotone-increasing "ๅฐๅญ็ฌฆไธฒ็ฟป่ฝฌๅฐๅ่ฐ้ๅข")A string of '0's and '1's is monotone increasing if it consists of some number of '0's (possibly 0), followed by some number of '1's (also possibly 0.)
Given a binary matrix A, we want to flip the image horizontally, then invert it, and return the resulting image.
An image is represented by a 2-D array of integers, each integer representing the pixel value of the image (from 0 to 65535).
diff --git a/problems/flower-planting-with-no-adjacent/README.md b/problems/flower-planting-with-no-adjacent/README.md
index 27a71bf7b..f2af46149 100644
--- a/problems/flower-planting-with-no-adjacent/README.md
+++ b/problems/flower-planting-with-no-adjacent/README.md
@@ -9,7 +9,7 @@
ใใใใใใใใใใใใใใใใ
[Next >](https://github.com/openset/leetcode/tree/master/problems/partition-array-for-maximum-sum "Partition Array for Maximum Sum")
-## 1042. Flower Planting With No Adjacent (Easy)
+## [1042. Flower Planting With No Adjacent (Easy)](https://leetcode.com/problems/flower-planting-with-no-adjacent "ไธ้ปๆฅๆค่ฑ")
You have N gardens, labelled 1 to N. In each garden, you want to plant one of 4 types of flowers.
Given a string representing an expression of fraction addition and subtraction, you need to return the calculation result in string format. The final result should be irreducible fraction. If your final result is an integer, say 2, you need to change it to the format of fraction that has denominator 1. So in this case, 2 should be converted to 2/1.
Given two integers representing the numerator and denominator of a fraction, return the fraction in string format.
diff --git a/problems/freedom-trail/README.md b/problems/freedom-trail/README.md index 6cfef0155..a3fec895b 100644 --- a/problems/freedom-trail/README.md +++ b/problems/freedom-trail/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/find-largest-value-in-each-tree-row "Find Largest Value in Each Tree Row") -## 514. Freedom Trail (Hard) +## [514. Freedom Trail (Hard)](https://leetcode.com/problems/freedom-trail "่ช็ฑไน่ทฏ")In the video game Fallout 4, the quest "Road to Freedom" requires players to reach a metal dial called the "Freedom Trail Ring", and use the dial to spell a specific keyword in order to open the door.
diff --git a/problems/friend-circles/README.md b/problems/friend-circles/README.md index 931fed448..6e05570a9 100644 --- a/problems/friend-circles/README.md +++ b/problems/friend-circles/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/split-array-with-equal-sum "Split Array with Equal Sum") -## 547. Friend Circles (Medium) +## [547. Friend Circles (Medium)](https://leetcode.com/problems/friend-circles "ๆๅๅ")There are N students in a class. Some of them are friends, while some are not. Their friendship is transitive in nature. For example, if A is a direct friend of B, and B is a direct friend of C, then A is an indirect friend of C. And we defined a friend circle is a group of students who are direct or indirect friends. diff --git a/problems/friend-requests-i-overall-acceptance-rate/README.md b/problems/friend-requests-i-overall-acceptance-rate/README.md index 0a498599e..f9b2bc667 100644 --- a/problems/friend-requests-i-overall-acceptance-rate/README.md +++ b/problems/friend-requests-i-overall-acceptance-rate/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/range-addition-ii "Range Addition II") -## 597. Friend Requests I: Overall Acceptance Rate (Easy) +## [597. Friend Requests I: Overall Acceptance Rate (Easy)](https://leetcode.com/problems/friend-requests-i-overall-acceptance-rate "ๅฅฝๅ็ณ่ฏท I ๏ผๆปไฝ้่ฟ็") In social network like Facebook or Twitter, people send friend requests and accept others’ requests as well. Now given two tables as below:
diff --git a/problems/friend-requests-ii-who-has-the-most-friends/README.md b/problems/friend-requests-ii-who-has-the-most-friends/README.md index f17eefce5..9ffdb5e8f 100644 --- a/problems/friend-requests-ii-who-has-the-most-friends/README.md +++ b/problems/friend-requests-ii-who-has-the-most-friends/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/consecutive-available-seats "Consecutive Available Seats") -## 602. Friend Requests II: Who Has the Most Friends (Medium) +## [602. Friend Requests II: Who Has the Most Friends (Medium)](https://leetcode.com/problems/friend-requests-ii-who-has-the-most-friends "ๅฅฝๅ็ณ่ฏท II ๏ผ่ฐๆๆๅค็ๅฅฝๅ") In social network like Facebook or Twitter, people send friend requests and accept others' requests as well.
diff --git a/problems/friends-of-appropriate-ages/README.md b/problems/friends-of-appropriate-ages/README.md index 96136aecc..ff3ee28c5 100644 --- a/problems/friends-of-appropriate-ages/README.md +++ b/problems/friends-of-appropriate-ages/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/most-profit-assigning-work "Most Profit Assigning Work") -## 825. Friends Of Appropriate Ages (Medium) +## [825. Friends Of Appropriate Ages (Medium)](https://leetcode.com/problems/friends-of-appropriate-ages "้้พ็ๆๅ")
Some people will make friend requests. The list of their ages is given and ages[i] is the age of the ith person.
A frog is crossing a river. The river is divided into x units and at each unit there may or may not exist a stone. The frog can jump on a stone, but it must not jump into the water.
diff --git a/problems/fruit-into-baskets/README.md b/problems/fruit-into-baskets/README.md index 995a63a23..4277daa0b 100644 --- a/problems/fruit-into-baskets/README.md +++ b/problems/fruit-into-baskets/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/sort-array-by-parity "Sort Array By Parity") -## 904. Fruit Into Baskets (Medium) +## [904. Fruit Into Baskets (Medium)](https://leetcode.com/problems/fruit-into-baskets "ๆฐดๆๆ็ฏฎ")In a row of trees, the i-th tree produces fruit with type tree[i].
According to the Wikipedia's article: "The Game of Life, also known simply as Life, is a cellular automaton devised by the British mathematician John Horton Conway in 1970."
diff --git a/problems/game-play-analysis-i/README.md b/problems/game-play-analysis-i/README.md index d14abac28..55c809a3b 100644 --- a/problems/game-play-analysis-i/README.md +++ b/problems/game-play-analysis-i/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/game-play-analysis-ii "Game Play Analysis II") -## 511. Game Play Analysis I (Easy) +## [511. Game Play Analysis I (Easy)](https://leetcode.com/problems/game-play-analysis-i "ๆธธๆ็ฉๆณๅๆ I") diff --git a/problems/game-play-analysis-ii/README.md b/problems/game-play-analysis-ii/README.md index 8d056d6e5..25acc875a 100644 --- a/problems/game-play-analysis-ii/README.md +++ b/problems/game-play-analysis-ii/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/find-bottom-left-tree-value "Find Bottom Left Tree Value") -## 512. Game Play Analysis II (Easy) +## [512. Game Play Analysis II (Easy)](https://leetcode.com/problems/game-play-analysis-ii "ๆธธๆ็ฉๆณๅๆ II") diff --git a/problems/game-play-analysis-iii/README.md b/problems/game-play-analysis-iii/README.md index 5a37e7347..ea930de8f 100644 --- a/problems/game-play-analysis-iii/README.md +++ b/problems/game-play-analysis-iii/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/encode-and-decode-tinyurl "Encode and Decode TinyURL") -## 534. Game Play Analysis III (Medium) +## [534. Game Play Analysis III (Medium)](https://leetcode.com/problems/game-play-analysis-iii "") diff --git a/problems/game-play-analysis-iv/README.md b/problems/game-play-analysis-iv/README.md index 5576d29d7..76dea3e3e 100644 --- a/problems/game-play-analysis-iv/README.md +++ b/problems/game-play-analysis-iv/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/student-attendance-record-i "Student Attendance Record I") -## 550. Game Play Analysis IV (Medium) +## [550. Game Play Analysis IV (Medium)](https://leetcode.com/problems/game-play-analysis-iv "") diff --git a/problems/game-play-analysis-v/README.md b/problems/game-play-analysis-v/README.md index a8c5009f0..68bc6787c 100644 --- a/problems/game-play-analysis-v/README.md +++ b/problems/game-play-analysis-v/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/unpopular-books "Unpopular Books") -## 1097. Game Play Analysis V (Hard) +## [1097. Game Play Analysis V (Hard)](https://leetcode.com/problems/game-play-analysis-v "") diff --git a/problems/gas-station/README.md b/problems/gas-station/README.md index d78cee906..f7d8de52d 100644 --- a/problems/gas-station/README.md +++ b/problems/gas-station/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/candy "Candy") -## 134. Gas Station (Medium) +## [134. Gas Station (Medium)](https://leetcode.com/problems/gas-station "ๅ ๆฒน็ซ")There are N gas stations along a circular route, where the amount of gas at station i is gas[i].
Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. diff --git a/problems/generate-random-point-in-a-circle/README.md b/problems/generate-random-point-in-a-circle/README.md index 4cedffed0..12f720905 100644 --- a/problems/generate-random-point-in-a-circle/README.md +++ b/problems/generate-random-point-in-a-circle/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/largest-palindrome-product "Largest Palindrome Product") -## 478. Generate Random Point in a Circle (Medium) +## [478. Generate Random Point in a Circle (Medium)](https://leetcode.com/problems/generate-random-point-in-a-circle "ๅจๅๅ ้ๆบ็ๆ็น")
Given the radius and x-y positions of the center of a circle, write a function randPoint which generates a uniform random point in the circle.
Get the highest answer rate question from a table survey_log with these columns: uid, action, question_id, answer_id, q_num, timestamp.
We have some permutation A of [0, 1, ..., N - 1], where N is the length of A.
A sentence S is given, composed of words separated by spaces. Each word consists of lowercase and uppercase letters only.
The gray code is a binary numeral system where two successive values differ in only one bit.
diff --git a/problems/greatest-common-divisor-of-strings/README.md b/problems/greatest-common-divisor-of-strings/README.md index 19b4abc58..fe1cafc8e 100644 --- a/problems/greatest-common-divisor-of-strings/README.md +++ b/problems/greatest-common-divisor-of-strings/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/flip-columns-for-maximum-number-of-equal-rows "Flip Columns For Maximum Number of Equal Rows") -## 1071. Greatest Common Divisor of Strings (Easy) +## [1071. Greatest Common Divisor of Strings (Easy)](https://leetcode.com/problems/greatest-common-divisor-of-strings "ๅญ็ฌฆไธฒ็ๆๅคงๅ ฌๅ ๅญ")For strings S and T, we say "T divides S" if and only if S = T + ... + T (T concatenated with itself 1 or more times)
On a N x N grid of cells, each cell (x, y) with 0 <= x < N and 0 <= y < N has a lamp.
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 d2ec747ca..52120a0f2 100644 --- a/problems/group-shifted-strings/README.md +++ b/problems/group-shifted-strings/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/count-univalue-subtrees "Count Univalue Subtrees") -## 249. Group Shifted Strings (Medium) +## [249. Group Shifted Strings (Medium)](https://leetcode.com/problems/group-shifted-strings "็งปไฝๅญ็ฌฆไธฒๅ็ป") diff --git a/problems/groups-of-special-equivalent-strings/README.md b/problems/groups-of-special-equivalent-strings/README.md index 263dd2b3c..08a9998b2 100644 --- a/problems/groups-of-special-equivalent-strings/README.md +++ b/problems/groups-of-special-equivalent-strings/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/all-possible-full-binary-trees "All Possible Full Binary Trees") -## 893. Groups of Special-Equivalent Strings (Easy) +## [893. Groups of Special-Equivalent Strings (Easy)](https://leetcode.com/problems/groups-of-special-equivalent-strings "็นๆฎ็ญไปทๅญ็ฌฆไธฒ็ป")You are given an array A of strings.
Today, the bookstore owner has a store open for customers.length minutes. Every minute, some number of customers (customers[i]) enter the store, and all those customers leave after the end of that minute.
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 d66c1efa0..598ab18b4 100644 --- a/problems/guess-number-higher-or-lower/README.md +++ b/problems/guess-number-higher-or-lower/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [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) +## [374. Guess Number Higher or Lower (Easy)](https://leetcode.com/problems/guess-number-higher-or-lower "็ๆฐๅญๅคงๅฐ")We are playing the Guess Game. The game is as follows:
diff --git a/problems/guess-the-word/README.md b/problems/guess-the-word/README.md index 11d8493f7..a5cb5b43f 100644 --- a/problems/guess-the-word/README.md +++ b/problems/guess-the-word/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/backspace-string-compare "Backspace String Compare") -## 843. Guess the Word (Hard) +## [843. Guess the Word (Hard)](https://leetcode.com/problems/guess-the-word "็็่ฟไธชๅ่ฏ")This problem is an interactive problem new to the LeetCode platform.
diff --git a/problems/h-index-ii/README.md b/problems/h-index-ii/README.md index 8d457c535..8d88f86ae 100644 --- a/problems/h-index-ii/README.md +++ b/problems/h-index-ii/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/paint-fence "Paint Fence") -## 275. H-Index II (Medium) +## [275. H-Index II (Medium)](https://leetcode.com/problems/h-index-ii "Hๆๆฐ II")Given an array of citations sorted in ascending order (each citation is a non-negative integer) of a researcher, write a function to compute the researcher's h-index.
diff --git a/problems/h-index/README.md b/problems/h-index/README.md index 1ffdd3127..39476a408 100644 --- a/problems/h-index/README.md +++ b/problems/h-index/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/h-index-ii "H-Index II") -## 274. H-Index (Medium) +## [274. H-Index (Medium)](https://leetcode.com/problems/h-index "Hๆๆฐ")Given an array of citations (each citation is a non-negative integer) of a researcher, write a function to compute the researcher's h-index.
diff --git a/problems/hamming-distance/README.md b/problems/hamming-distance/README.md index 7536c9df0..11d24a912 100644 --- a/problems/hamming-distance/README.md +++ b/problems/hamming-distance/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [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) +## [461. Hamming Distance (Easy)](https://leetcode.com/problems/hamming-distance "ๆฑๆ่ท็ฆป")The Hamming distance between two integers is the number of positions at which the corresponding bits are different.
diff --git a/problems/hand-of-straights/README.md b/problems/hand-of-straights/README.md index d2bccf691..c2ad4a023 100644 --- a/problems/hand-of-straights/README.md +++ b/problems/hand-of-straights/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/shortest-path-visiting-all-nodes "Shortest Path Visiting All Nodes") -## 846. Hand of Straights (Medium) +## [846. Hand of Straights (Medium)](https://leetcode.com/problems/hand-of-straights "ไธๆ้กบๅญ")Alice has a hand of cards, given as an array of integers.
Write an algorithm to determine if a number is "happy".
diff --git a/problems/heaters/README.md b/problems/heaters/README.md index 1d1e63e28..e1d252034 100644 --- a/problems/heaters/README.md +++ b/problems/heaters/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/number-complement "Number Complement") -## 475. Heaters (Easy) +## [475. Heaters (Easy)](https://leetcode.com/problems/heaters "ไพๆๅจ")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/height-checker/README.md b/problems/height-checker/README.md index 3156a9495..c540c1287 100644 --- a/problems/height-checker/README.md +++ b/problems/height-checker/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/grumpy-bookstore-owner "Grumpy Bookstore Owner") -## 1051. Height Checker (Easy) +## [1051. Height Checker (Easy)](https://leetcode.com/problems/height-checker "้ซๅบฆๆฃๆฅๅจ")Students are asked to stand in non-decreasing order of heights for an annual photo.
diff --git a/problems/high-five/README.md b/problems/high-five/README.md index 47ea3a916..be848bcad 100644 --- a/problems/high-five/README.md +++ b/problems/high-five/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/brace-expansion "Brace Expansion") -## 1086. High Five (Easy) +## [1086. High Five (Easy)](https://leetcode.com/problems/high-five "ๅไบ็ง็ๅๅ")Given a list of scores of different students, return the average score of each student's top five scores in the order of each student's id.
diff --git a/problems/highest-grade-for-each-student/README.md b/problems/highest-grade-for-each-student/README.md index 8ad65fe38..b4333dfed 100644 --- a/problems/highest-grade-for-each-student/README.md +++ b/problems/highest-grade-for-each-student/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/reported-posts "Reported Posts") -## 1112. Highest Grade For Each Student (Medium) +## [1112. Highest Grade For Each Student (Medium)](https://leetcode.com/problems/highest-grade-for-each-student "") diff --git a/problems/house-robber-ii/README.md b/problems/house-robber-ii/README.md index eb64d1019..f6edda3dd 100644 --- a/problems/house-robber-ii/README.md +++ b/problems/house-robber-ii/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/shortest-palindrome "Shortest Palindrome") -## 213. House Robber II (Medium) +## [213. House Robber II (Medium)](https://leetcode.com/problems/house-robber-ii "ๆๅฎถๅซ่ II")You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. All houses at this place are arranged in a circle. That means the first house is the neighbor of the last one. Meanwhile, 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/house-robber-iii/README.md b/problems/house-robber-iii/README.md index acf202cad..8b0537266 100644 --- a/problems/house-robber-iii/README.md +++ b/problems/house-robber-iii/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/counting-bits "Counting Bits") -## 337. House Robber III (Medium) +## [337. House Robber III (Medium)](https://leetcode.com/problems/house-robber-iii "ๆๅฎถๅซ่ III")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 ad20fcc60..0ef57af06 100644 --- a/problems/house-robber/README.md +++ b/problems/house-robber/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/binary-tree-right-side-view "Binary Tree Right Side View") -## 198. House Robber (Easy) +## [198. House Robber (Easy)](https://leetcode.com/problems/house-robber "ๆๅฎถๅซ่")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 d5385a63d..7736d01d7 100644 --- a/problems/human-traffic-of-stadium/README.md +++ b/problems/human-traffic-of-stadium/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [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) +## [601. Human Traffic of Stadium (Hard)](https://leetcode.com/problems/human-traffic-of-stadium "ไฝ่ฒ้ฆ็ไบบๆต้")X city built a new stadium, each day many people visit it and the stats are saved as these columns: id, visit_date, people
diff --git a/problems/image-overlap/README.md b/problems/image-overlap/README.md index 2789f45b1..e31ff5267 100644 --- a/problems/image-overlap/README.md +++ b/problems/image-overlap/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/rectangle-overlap "Rectangle Overlap") -## 835. Image Overlap (Medium) +## [835. Image Overlap (Medium)](https://leetcode.com/problems/image-overlap "ๅพๅ้ๅ ")Two images A and B are given, represented as binary, square matrices of the same size. (A binary matrix has only 0s and 1s as values.)
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/immediate-food-delivery-i/README.md b/problems/immediate-food-delivery-i/README.md index 41b3b5f9f..ef4ce8a74 100644 --- a/problems/immediate-food-delivery-i/README.md +++ b/problems/immediate-food-delivery-i/README.md @@ -9,6 +9,6 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/immediate-food-delivery-ii "Immediate Food Delivery II") -## 1173. Immediate Food Delivery I (Easy) +## [1173. Immediate Food Delivery I (Easy)](https://leetcode.com/problems/immediate-food-delivery-i "") diff --git a/problems/immediate-food-delivery-ii/README.md b/problems/immediate-food-delivery-ii/README.md index d08d9b25b..d386d4778 100644 --- a/problems/immediate-food-delivery-ii/README.md +++ b/problems/immediate-food-delivery-ii/README.md @@ -9,6 +9,6 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/prime-arrangements "Prime Arrangements") -## 1174. Immediate Food Delivery II (Medium) +## [1174. Immediate Food Delivery II (Medium)](https://leetcode.com/problems/immediate-food-delivery-ii "") diff --git a/problems/implement-magic-dictionary/README.md b/problems/implement-magic-dictionary/README.md index b5418d108..971cd6a4b 100644 --- a/problems/implement-magic-dictionary/README.md +++ b/problems/implement-magic-dictionary/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/map-sum-pairs "Map Sum Pairs") -## 676. Implement Magic Dictionary (Medium) +## [676. Implement Magic Dictionary (Medium)](https://leetcode.com/problems/implement-magic-dictionary "ๅฎ็ฐไธไธช้ญๆณๅญๅ ธ")
Implement a magic directory with buildDict, and search methods.
diff --git a/problems/implement-queue-using-stacks/README.md b/problems/implement-queue-using-stacks/README.md
index 1c7be94b3..8d0069b46 100644
--- a/problems/implement-queue-using-stacks/README.md
+++ b/problems/implement-queue-using-stacks/README.md
@@ -9,7 +9,7 @@
ใใใใใใใใใใใใใใใใ
[Next >](https://github.com/openset/leetcode/tree/master/problems/number-of-digit-one "Number of Digit One")
-## 232. Implement Queue using Stacks (Easy)
+## [232. Implement Queue using Stacks (Easy)](https://leetcode.com/problems/implement-queue-using-stacks "็จๆ ๅฎ็ฐ้ๅ")
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 cff8d50ae..d0cb8c918 100644 --- a/problems/implement-rand10-using-rand7/README.md +++ b/problems/implement-rand10-using-rand7/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [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) +## [470. Implement Rand10() Using Rand7() (Medium)](https://leetcode.com/problems/implement-rand10-using-rand7 "็จ Rand7() ๅฎ็ฐ Rand10()")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.
Implement the following operations of a stack using queues.
diff --git a/problems/implement-strstr/README.md b/problems/implement-strstr/README.md index 725acb872..496f433f8 100644 --- a/problems/implement-strstr/README.md +++ b/problems/implement-strstr/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/divide-two-integers "Divide Two Integers") -## 28. Implement strStr() (Easy) +## [28. Implement strStr() (Easy)](https://leetcode.com/problems/implement-strstr "ๅฎ็ฐ strStr()")Implement strStr().
diff --git a/problems/implement-trie-prefix-tree/README.md b/problems/implement-trie-prefix-tree/README.md index 4e10a6840..2a4891a32 100644 --- a/problems/implement-trie-prefix-tree/README.md +++ b/problems/implement-trie-prefix-tree/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-size-subarray-sum "Minimum Size Subarray Sum") -## 208. Implement Trie (Prefix Tree) (Medium) +## [208. Implement Trie (Prefix Tree) (Medium)](https://leetcode.com/problems/implement-trie-prefix-tree "ๅฎ็ฐ Trie (ๅ็ผๆ )")Implement a trie with insert, search, and startsWith methods.
Given a binary search tree, rearrange the tree in in-order so that the leftmost node in the tree is now the root of the tree, and every node has no left child and only 1 right child.
diff --git a/problems/increasing-subsequences/README.md b/problems/increasing-subsequences/README.md index b3e4be3ef..853458ab5 100644 --- a/problems/increasing-subsequences/README.md +++ b/problems/increasing-subsequences/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/construct-the-rectangle "Construct the Rectangle") -## 491. Increasing Subsequences (Medium) +## [491. Increasing Subsequences (Medium)](https://leetcode.com/problems/increasing-subsequences "้ๅขๅญๅบๅ")Given an integer array, your task is to find all the different possible increasing subsequences of the given array, and the length of an increasing subsequence should be at least 2 . diff --git a/problems/increasing-triplet-subsequence/README.md b/problems/increasing-triplet-subsequence/README.md index 25e987f2d..9dd4ff799 100644 --- a/problems/increasing-triplet-subsequence/README.md +++ b/problems/increasing-triplet-subsequence/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/self-crossing "Self Crossing") -## 334. Increasing Triplet Subsequence (Medium) +## [334. Increasing Triplet Subsequence (Medium)](https://leetcode.com/problems/increasing-triplet-subsequence "้ๅข็ไธๅ ๅญๅบๅ")
Given an unsorted array return whether an increasing subsequence of length 3 exists or not in the array.
diff --git a/problems/index-pairs-of-a-string/README.md b/problems/index-pairs-of-a-string/README.md index 416b128bb..5de15d158 100644 --- a/problems/index-pairs-of-a-string/README.md +++ b/problems/index-pairs-of-a-string/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/campus-bikes-ii "Campus Bikes II") -## 1065. Index Pairs of a String (Easy) +## [1065. Index Pairs of a String (Easy)](https://leetcode.com/problems/index-pairs-of-a-string "ๅญ็ฌฆไธฒ็็ดขๅผๅฏน")Given a text string and words (a list of strings), return all index pairs [i, j] so that the substring text[i]...text[j] is in the list of words.
Given a binary search tree and a node in it, find the in-order successor of that node in the BST.
diff --git a/problems/insert-delete-getrandom-o1-duplicates-allowed/README.md b/problems/insert-delete-getrandom-o1-duplicates-allowed/README.md index 9c87927b6..9fbae1c04 100644 --- a/problems/insert-delete-getrandom-o1-duplicates-allowed/README.md +++ b/problems/insert-delete-getrandom-o1-duplicates-allowed/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [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) +## [381. Insert Delete GetRandom O(1) - Duplicates allowed (Hard)](https://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed "O(1) ๆถ้ดๆๅ ฅใๅ ้คๅ่ทๅ้ๆบๅ ็ด - ๅ ่ฎธ้ๅค")Design a data structure that supports all following operations in average O(1) time.
Note: Duplicate elements are allowed. diff --git a/problems/insert-delete-getrandom-o1/README.md b/problems/insert-delete-getrandom-o1/README.md index ab42c32e1..48c55f95a 100644 --- a/problems/insert-delete-getrandom-o1/README.md +++ b/problems/insert-delete-getrandom-o1/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [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) +## [380. Insert Delete GetRandom O(1) (Medium)](https://leetcode.com/problems/insert-delete-getrandom-o1 "ๅธธๆฐๆถ้ดๆๅ ฅใๅ ้คๅ่ทๅ้ๆบๅ ็ด ")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 a34c1a051..a2c0cfd5e 100644 --- a/problems/insert-interval/README.md +++ b/problems/insert-interval/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/length-of-last-word "Length of Last Word") -## 57. Insert Interval (Hard) +## [57. Insert Interval (Hard)](https://leetcode.com/problems/insert-interval "ๆๅ ฅๅบ้ด")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 2bf97e6da..d4b358b18 100644 --- a/problems/insert-into-a-binary-search-tree/README.md +++ b/problems/insert-into-a-binary-search-tree/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [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) +## [701. Insert into a Binary Search Tree (Medium)](https://leetcode.com/problems/insert-into-a-binary-search-tree "ไบๅๆ็ดขๆ ไธญ็ๆๅ ฅๆไฝ")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 5858fe573..75b5b45e7 100644 --- a/problems/insert-into-a-cyclic-sorted-list/README.md +++ b/problems/insert-into-a-cyclic-sorted-list/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/to-lower-case "To Lower Case") -## 708. Insert into a Cyclic Sorted List (Medium) +## [708. Insert into a Cyclic Sorted List (Medium)](https://leetcode.com/problems/insert-into-a-cyclic-sorted-list "ๅพช็ฏๆๅบๅ่กจ็ๆๅ ฅ") diff --git a/problems/insertion-sort-list/README.md b/problems/insertion-sort-list/README.md index 9c657ad6a..4d57bc765 100644 --- a/problems/insertion-sort-list/README.md +++ b/problems/insertion-sort-list/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/sort-list "Sort List") -## 147. Insertion Sort List (Medium) +## [147. Insertion Sort List (Medium)](https://leetcode.com/problems/insertion-sort-list "ๅฏน้พ่กจ่ฟ่กๆๅ ฅๆๅบ")Sort a linked list using insertion sort.
diff --git a/problems/insufficient-nodes-in-root-to-leaf-paths/README.md b/problems/insufficient-nodes-in-root-to-leaf-paths/README.md index bad3cf1bb..8c31b30a4 100644 --- a/problems/insufficient-nodes-in-root-to-leaf-paths/README.md +++ b/problems/insufficient-nodes-in-root-to-leaf-paths/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/smallest-subsequence-of-distinct-characters "Smallest Subsequence of Distinct Characters") -## 1080. Insufficient Nodes in Root to Leaf Paths (Medium) +## [1080. Insufficient Nodes in Root to Leaf Paths (Medium)](https://leetcode.com/problems/insufficient-nodes-in-root-to-leaf-paths "ๆ นๅฐๅถ่ทฏๅพไธ็ไธ่ถณ่็น")Given the root of a binary tree, consider all root to leaf paths: paths from the root to any leaf. (A leaf is a node with no children.)
Given a positive integer n, break it into the sum of at least two positive integers and maximize the product of those integers. Return the maximum product you can get.
diff --git a/problems/integer-replacement/README.md b/problems/integer-replacement/README.md index 21e3786dc..919ebe4c9 100644 --- a/problems/integer-replacement/README.md +++ b/problems/integer-replacement/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/random-pick-index "Random Pick Index") -## 397. Integer Replacement (Medium) +## [397. Integer Replacement (Medium)](https://leetcode.com/problems/integer-replacement "ๆดๆฐๆฟๆข")Given a positive integer n and you can do operations as follow: diff --git a/problems/integer-to-english-words/README.md b/problems/integer-to-english-words/README.md index cd451ee55..4d9d65718 100644 --- a/problems/integer-to-english-words/README.md +++ b/problems/integer-to-english-words/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/h-index "H-Index") -## 273. Integer to English Words (Hard) +## [273. Integer to English Words (Hard)](https://leetcode.com/problems/integer-to-english-words "ๆดๆฐ่ฝฌๆข่ฑๆ่กจ็คบ")
Convert a non-negative integer to its english words representation. Given input is guaranteed to be less than 231 - 1.
diff --git a/problems/integer-to-roman/README.md b/problems/integer-to-roman/README.md index ddbdc53a6..517255a16 100644 --- a/problems/integer-to-roman/README.md +++ b/problems/integer-to-roman/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/roman-to-integer "Roman to Integer") -## 12. Integer to Roman (Medium) +## [12. Integer to Roman (Medium)](https://leetcode.com/problems/integer-to-roman "ๆดๆฐ่ฝฌ็ฝ้ฉฌๆฐๅญ")Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M.
Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2.
diff --git a/problems/intersection-of-two-arrays-ii/README.md b/problems/intersection-of-two-arrays-ii/README.md index 291566725..de9020c26 100644 --- a/problems/intersection-of-two-arrays-ii/README.md +++ b/problems/intersection-of-two-arrays-ii/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/android-unlock-patterns "Android Unlock Patterns") -## 350. Intersection of Two Arrays II (Easy) +## [350. Intersection of Two Arrays II (Easy)](https://leetcode.com/problems/intersection-of-two-arrays-ii "ไธคไธชๆฐ็ป็ไบค้ II")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 ea3ccd6ea..c12adb21c 100644 --- a/problems/intersection-of-two-arrays/README.md +++ b/problems/intersection-of-two-arrays/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [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) +## [349. Intersection of Two Arrays (Easy)](https://leetcode.com/problems/intersection-of-two-arrays "ไธคไธชๆฐ็ป็ไบค้")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 72e1c7a7b..5cf0c6857 100644 --- a/problems/intersection-of-two-linked-lists/README.md +++ b/problems/intersection-of-two-linked-lists/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/one-edit-distance "One Edit Distance") -## 160. Intersection of Two Linked Lists (Easy) +## [160. Intersection of Two Linked Lists (Easy)](https://leetcode.com/problems/intersection-of-two-linked-lists "็ธไบค้พ่กจ")Write a program to find the node at which the intersection of two singly linked lists begins.
diff --git a/problems/interval-list-intersections/README.md b/problems/interval-list-intersections/README.md index 4d7a642ef..f9effce18 100644 --- a/problems/interval-list-intersections/README.md +++ b/problems/interval-list-intersections/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/vertical-order-traversal-of-a-binary-tree "Vertical Order Traversal of a Binary Tree") -## 986. Interval List Intersections (Medium) +## [986. Interval List Intersections (Medium)](https://leetcode.com/problems/interval-list-intersections "ๅบ้ดๅ่กจ็ไบค้")Given two lists of closed intervals, each list of intervals is pairwise disjoint and in sorted order.
diff --git a/problems/invalid-transactions/README.md b/problems/invalid-transactions/README.md index 73c8d3039..e30804e9a 100644 --- a/problems/invalid-transactions/README.md +++ b/problems/invalid-transactions/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/compare-strings-by-frequency-of-the-smallest-character "Compare Strings by Frequency of the Smallest Character") -## 1169. Invalid Transactions (Easy) +## [1169. Invalid Transactions (Easy)](https://leetcode.com/problems/invalid-transactions "ๆฅ่ฏขๆ ๆไบคๆ")A transaction is possibly invalid if:
diff --git a/problems/invert-binary-tree/README.md b/problems/invert-binary-tree/README.md index f94e22f43..3396784cb 100644 --- a/problems/invert-binary-tree/README.md +++ b/problems/invert-binary-tree/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/basic-calculator-ii "Basic Calculator II") -## 226. Invert Binary Tree (Easy) +## [226. Invert Binary Tree (Easy)](https://leetcode.com/problems/invert-binary-tree "็ฟป่ฝฌไบๅๆ ")Invert a binary tree.
diff --git a/problems/investments-in-2016/README.md b/problems/investments-in-2016/README.md index aba668b4c..c9ebdb56d 100644 --- a/problems/investments-in-2016/README.md +++ b/problems/investments-in-2016/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/customer-placing-the-largest-number-of-orders "Customer Placing the Largest Number of Orders") -## 585. Investments in 2016 (Medium) +## [585. Investments in 2016 (Medium)](https://leetcode.com/problems/investments-in-2016 "2016ๅนด็ๆ่ต")Write a query to print the sum of all total investment values in 2016 (TIV_2016), to a scale of 2 decimal places, for all policy holders who meet the following criteria:
diff --git a/problems/ip-to-cidr/README.md b/problems/ip-to-cidr/README.md index 281607d02..ea6141d82 100644 --- a/problems/ip-to-cidr/README.md +++ b/problems/ip-to-cidr/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/open-the-lock "Open the Lock") -## 751. IP to CIDR (Easy) +## [751. IP to CIDR (Easy)](https://leetcode.com/problems/ip-to-cidr "IP ๅฐ CIDR") diff --git a/problems/ipo/README.md b/problems/ipo/README.md index f1059f951..e8b474d5b 100644 --- a/problems/ipo/README.md +++ b/problems/ipo/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/next-greater-element-ii "Next Greater Element II") -## 502. IPO (Hard) +## [502. IPO (Hard)](https://leetcode.com/problems/ipo "IPO")Suppose LeetCode will start its IPO soon. In order to sell a good price of its shares to Venture Capital, LeetCode would like to work on some projects to increase its capital before the IPO. Since it has limited resources, it can only finish at most k distinct projects before the IPO. Help LeetCode design the best way to maximize its total capital after finishing at most k distinct projects. diff --git a/problems/is-graph-bipartite/README.md b/problems/is-graph-bipartite/README.md index d532928e4..207186c72 100644 --- a/problems/is-graph-bipartite/README.md +++ b/problems/is-graph-bipartite/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/k-th-smallest-prime-fraction "K-th Smallest Prime Fraction") -## 785. Is Graph Bipartite? (Medium) +## [785. Is Graph Bipartite? (Medium)](https://leetcode.com/problems/is-graph-bipartite "ๅคๆญไบๅๅพ")
Given an undirected graph, return true if and only if it is bipartite.
Given a string s and a string t, check if s is subsequence of t. diff --git a/problems/island-perimeter/README.md b/problems/island-perimeter/README.md index 0617fd033..3554e4726 100644 --- a/problems/island-perimeter/README.md +++ b/problems/island-perimeter/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/can-i-win "Can I Win") -## 463. Island Perimeter (Easy) +## [463. Island Perimeter (Easy)](https://leetcode.com/problems/island-perimeter "ๅฒๅฑฟ็ๅจ้ฟ")
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 cbce94cfb..592ffa1f0 100644 --- a/problems/isomorphic-strings/README.md +++ b/problems/isomorphic-strings/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/reverse-linked-list "Reverse Linked List") -## 205. Isomorphic Strings (Easy) +## [205. Isomorphic Strings (Easy)](https://leetcode.com/problems/isomorphic-strings "ๅๆๅญ็ฌฆไธฒ")Given two strings s and t, determine if they are isomorphic.
diff --git a/problems/jewels-and-stones/README.md b/problems/jewels-and-stones/README.md index 1e599a751..5a026378d 100644 --- a/problems/jewels-and-stones/README.md +++ b/problems/jewels-and-stones/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/basic-calculator-iii "Basic Calculator III") -## 771. Jewels and Stones (Easy) +## [771. Jewels and Stones (Easy)](https://leetcode.com/problems/jewels-and-stones "ๅฎ็ณไธ็ณๅคด")You're given strings J representing the types of stones that are jewels, and S representing the stones you have. Each character in S is a type of stone you have. You want to know how many of the stones you have are also jewels.
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 ac2ef46ff..953be26d3 100644 --- a/problems/jump-game/README.md +++ b/problems/jump-game/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/merge-intervals "Merge Intervals") -## 55. Jump Game (Medium) +## [55. Jump Game (Medium)](https://leetcode.com/problems/jump-game "่ทณ่ทๆธธๆ")Given an array of non-negative integers, you are initially positioned at the first index of the array.
diff --git a/problems/k-closest-points-to-origin/README.md b/problems/k-closest-points-to-origin/README.md index 3904f74be..f406cbe11 100644 --- a/problems/k-closest-points-to-origin/README.md +++ b/problems/k-closest-points-to-origin/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/subarray-sums-divisible-by-k "Subarray Sums Divisible by K") -## 973. K Closest Points to Origin (Medium) +## [973. K Closest Points to Origin (Medium)](https://leetcode.com/problems/k-closest-points-to-origin "ๆๆฅ่ฟๅ็น็ K ไธช็น")We have a list of points on the plane. Find the K closest points to the origin (0, 0).
Given an integer array arr and an integer k, modify the array by repeating it k times.
-10^4 <= arr[i] <= 10^4Hint 1
diff --git a/problems/k-diff-pairs-in-an-array/README.md b/problems/k-diff-pairs-in-an-array/README.md index 9dd6b2a10..79fe9d09a 100644 --- a/problems/k-diff-pairs-in-an-array/README.md +++ b/problems/k-diff-pairs-in-an-array/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/lonely-pixel-ii "Lonely Pixel II") -## 532. K-diff Pairs in an Array (Easy) +## [532. K-diff Pairs in an Array (Easy)](https://leetcode.com/problems/k-diff-pairs-in-an-array "ๆฐ็ปไธญ็K-diffๆฐๅฏน")Given an array of integers and an integer k, you need to find the number of unique k-diff pairs in the array. Here a k-diff pair is defined as an integer pair (i, j), where i and j are both numbers in the array and their absolute difference is k. diff --git a/problems/k-empty-slots/README.md b/problems/k-empty-slots/README.md index cc2d3bb13..6c4c43d80 100644 --- a/problems/k-empty-slots/README.md +++ b/problems/k-empty-slots/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/redundant-connection "Redundant Connection") -## 683. K Empty Slots (Hard) +## [683. K Empty Slots (Hard)](https://leetcode.com/problems/k-empty-slots "K ไธช็ฉบ่ฑ็") diff --git a/problems/k-inverse-pairs-array/README.md b/problems/k-inverse-pairs-array/README.md index 574d2c34c..992df9c84 100644 --- a/problems/k-inverse-pairs-array/README.md +++ b/problems/k-inverse-pairs-array/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/course-schedule-iii "Course Schedule III") -## 629. K Inverse Pairs Array (Hard) +## [629. K Inverse Pairs Array (Hard)](https://leetcode.com/problems/k-inverse-pairs-array "Kไธช้ๅบๅฏนๆฐ็ป")
Given two integers n and k, find how many different arrays consist of numbers from 1 to n such that there are exactly k inverse pairs.
Strings A and B are K-similar (for some non-negative integer K) if we can swap the positions of two letters in A exactly K times so that the resulting string equals B.
Given integers n and k, find the lexicographically k-th smallest integer in the range from 1 to n.
A sorted list A contains 1, plus some number of primes. Then, for every p < q in the list, we consider the fraction p/q.
On the first row, we write a 0. Now in every subsequent row, we look at the previous row and replace each occurrence of 0 with 01, and each occurrence of 1 with 10.
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/keys-and-rooms/README.md b/problems/keys-and-rooms/README.md index a831bad3b..122a65ab9 100644 --- a/problems/keys-and-rooms/README.md +++ b/problems/keys-and-rooms/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/split-array-into-fibonacci-sequence "Split Array into Fibonacci Sequence") -## 841. Keys and Rooms (Medium) +## [841. Keys and Rooms (Medium)](https://leetcode.com/problems/keys-and-rooms "้ฅๅๅๆฟ้ด")There are N rooms and you start in room 0. Each room has a distinct number in 0, 1, 2, ..., N-1, and each room may have some keys to access the next room.
Given n processes, each process has a unique PID (process id) and its PPID (parent process id). diff --git a/problems/knight-dialer/README.md b/problems/knight-dialer/README.md index 6e6848b47..f6deb9d5b 100644 --- a/problems/knight-dialer/README.md +++ b/problems/knight-dialer/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/stamping-the-sequence "Stamping The Sequence") -## 935. Knight Dialer (Medium) +## [935. Knight Dialer (Medium)](https://leetcode.com/problems/knight-dialer "้ชๅฃซๆจๅทๅจ")
A chess knight can move as indicated in the chess diagram below:
diff --git a/problems/knight-probability-in-chessboard/README.md b/problems/knight-probability-in-chessboard/README.md index 64aec122d..107cb01d1 100644 --- a/problems/knight-probability-in-chessboard/README.md +++ b/problems/knight-probability-in-chessboard/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/maximum-sum-of-3-non-overlapping-subarrays "Maximum Sum of 3 Non-Overlapping Subarrays") -## 688. Knight Probability in Chessboard (Medium) +## [688. Knight Probability in Chessboard (Medium)](https://leetcode.com/problems/knight-probability-in-chessboard "โ้ฉฌโๅจๆฃ็ไธ็ๆฆ็")On an NxN chessboard, a knight starts at the r-th row and c-th column and attempts to make exactly K moves. The rows and columns are 0 indexed, so the top-left square is (0, 0), and the bottom-right square is (N-1, N-1).
Koko loves to eat bananas. There are N piles of bananas, the i-th pile has piles[i] bananas. The guards have gone and will come back in H hours.
Design a class to find the kth largest element in a stream. Note that it is the kth largest element in the sorted order, not the kth distinct element.
diff --git a/problems/kth-largest-element-in-an-array/README.md b/problems/kth-largest-element-in-an-array/README.md index 1086c5da9..301b0c4d3 100644 --- a/problems/kth-largest-element-in-an-array/README.md +++ b/problems/kth-largest-element-in-an-array/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/combination-sum-iii "Combination Sum III") -## 215. Kth Largest Element in an Array (Medium) +## [215. Kth Largest Element in an Array (Medium)](https://leetcode.com/problems/kth-largest-element-in-an-array "ๆฐ็ปไธญ็็ฌฌKไธชๆๅคงๅ ็ด ")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-bst/README.md b/problems/kth-smallest-element-in-a-bst/README.md index bc7c1b933..9800e1247 100644 --- a/problems/kth-smallest-element-in-a-bst/README.md +++ b/problems/kth-smallest-element-in-a-bst/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/power-of-two "Power of Two") -## 230. Kth Smallest Element in a BST (Medium) +## [230. Kth Smallest Element in a BST (Medium)](https://leetcode.com/problems/kth-smallest-element-in-a-bst "ไบๅๆ็ดขๆ ไธญ็ฌฌKๅฐ็ๅ ็ด ")Given a binary search tree, write a function kthSmallest to find the kth smallest element in it.
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/kth-smallest-number-in-multiplication-table/README.md b/problems/kth-smallest-number-in-multiplication-table/README.md index 631eb2857..6711926e3 100644 --- a/problems/kth-smallest-number-in-multiplication-table/README.md +++ b/problems/kth-smallest-number-in-multiplication-table/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/trim-a-binary-search-tree "Trim a Binary Search Tree") -## 668. Kth Smallest Number in Multiplication Table (Hard) +## [668. Kth Smallest Number in Multiplication Table (Hard)](https://leetcode.com/problems/kth-smallest-number-in-multiplication-table "ไนๆณ่กจไธญ็ฌฌkๅฐ็ๆฐ")
Nearly every one have used the Multiplication Table. But could you find out the k-th smallest number quickly from the multiplication table?
diff --git a/problems/largest-1-bordered-square/README.md b/problems/largest-1-bordered-square/README.md
index c59d8c8cb..9bce2275a 100644
--- a/problems/largest-1-bordered-square/README.md
+++ b/problems/largest-1-bordered-square/README.md
@@ -9,7 +9,7 @@
ใใใใใใใใใใใใใใใใ
[Next >](https://github.com/openset/leetcode/tree/master/problems/stone-game-ii "Stone Game II")
-## 1139. Largest 1-Bordered Square (Medium)
+## [1139. Largest 1-Bordered Square (Medium)](https://leetcode.com/problems/largest-1-bordered-square "ๆๅคง็ไปฅ 1 ไธบ่พน็็ๆญฃๆนๅฝข")
Given a 2D grid of 0s and 1s, return the number of elements in the largest square subgrid that has all 1s on its border, or 0 if such a subgrid doesn't exist in the grid.
Given a non-empty array of unique positive integers A, consider the following graph:
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-number-at-least-twice-of-others/README.md b/problems/largest-number-at-least-twice-of-others/README.md index 2be1375ab..661744bae 100644 --- a/problems/largest-number-at-least-twice-of-others/README.md +++ b/problems/largest-number-at-least-twice-of-others/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/shortest-completing-word "Shortest Completing Word") -## 747. Largest Number At Least Twice of Others (Easy) +## [747. Largest Number At Least Twice of Others (Easy)](https://leetcode.com/problems/largest-number-at-least-twice-of-others "่ณๅฐๆฏๅ ถไปๆฐๅญไธคๅ็ๆๅคงๆฐ")In a given integer array nums, there is always exactly one largest element.
Given a list of non negative integers, arrange them such that they form the largest number.
diff --git a/problems/largest-palindrome-product/README.md b/problems/largest-palindrome-product/README.md index f3ce6aea2..55aa3844c 100644 --- a/problems/largest-palindrome-product/README.md +++ b/problems/largest-palindrome-product/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/sliding-window-median "Sliding Window Median") -## 479. Largest Palindrome Product (Hard) +## [479. Largest Palindrome Product (Hard)](https://leetcode.com/problems/largest-palindrome-product "ๆๅคงๅๆๆฐไน็งฏ")Find the largest palindrome made from the product of two n-digit numbers.
diff --git a/problems/largest-perimeter-triangle/README.md b/problems/largest-perimeter-triangle/README.md index f3ac5fcf3..f36682e64 100644 --- a/problems/largest-perimeter-triangle/README.md +++ b/problems/largest-perimeter-triangle/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/squares-of-a-sorted-array "Squares of a Sorted Array") -## 976. Largest Perimeter Triangle (Easy) +## [976. Largest Perimeter Triangle (Easy)](https://leetcode.com/problems/largest-perimeter-triangle "ไธ่งๅฝข็ๆๅคงๅจ้ฟ")Given an array A of positive lengths, return the largest perimeter of a triangle with non-zero area, formed from 3 of these lengths.
In a 2D grid from (0, 0) to (N-1, N-1), every cell contains a 1, except those cells in the given list mines which are 0. What is the largest axis-aligned plus sign of 1s contained in the grid? Return the order of the plus sign. If there is none, return 0.
diff --git a/problems/largest-rectangle-in-histogram/README.md b/problems/largest-rectangle-in-histogram/README.md
index fa437f533..f9f7a7bf8 100644
--- a/problems/largest-rectangle-in-histogram/README.md
+++ b/problems/largest-rectangle-in-histogram/README.md
@@ -9,7 +9,7 @@
ใใใใใใใใใใใใใใใใ
[Next >](https://github.com/openset/leetcode/tree/master/problems/maximal-rectangle "Maximal Rectangle")
-## 84. Largest Rectangle in Histogram (Hard)
+## [84. Largest Rectangle in Histogram (Hard)](https://leetcode.com/problems/largest-rectangle-in-histogram "ๆฑ็ถๅพไธญๆๅคง็็ฉๅฝข")
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/largest-sum-of-averages/README.md b/problems/largest-sum-of-averages/README.md index 49b204694..f2ca7d91f 100644 --- a/problems/largest-sum-of-averages/README.md +++ b/problems/largest-sum-of-averages/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/binary-tree-pruning "Binary Tree Pruning") -## 813. Largest Sum of Averages (Medium) +## [813. Largest Sum of Averages (Medium)](https://leetcode.com/problems/largest-sum-of-averages "ๆๅคงๅนณๅๅผๅ็ๅ็ป")We partition a row of numbers A into at most K adjacent (non-empty) groups, then our score is the sum of the average of each group. What is the largest score we can achieve?
Given an array of 4 digits, return the largest 24 hour time that can be made.
diff --git a/problems/largest-triangle-area/README.md b/problems/largest-triangle-area/README.md index 3939afb55..b8158ebab 100644 --- a/problems/largest-triangle-area/README.md +++ b/problems/largest-triangle-area/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/largest-sum-of-averages "Largest Sum of Averages") -## 812. Largest Triangle Area (Easy) +## [812. Largest Triangle Area (Easy)](https://leetcode.com/problems/largest-triangle-area "ๆๅคงไธ่งๅฝข้ข็งฏ")You have a list of points in the plane. Return the area of the largest triangle that can be formed by any 3 of the points.
diff --git a/problems/largest-unique-number/README.md b/problems/largest-unique-number/README.md index ea26f3b3e..3e089e9b5 100644 --- a/problems/largest-unique-number/README.md +++ b/problems/largest-unique-number/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/armstrong-number "Armstrong Number") -## 1133. Largest Unique Number (Easy) +## [1133. Largest Unique Number (Easy)](https://leetcode.com/problems/largest-unique-number "ๆๅคงๅฏไธๆฐ") diff --git a/problems/largest-values-from-labels/README.md b/problems/largest-values-from-labels/README.md index 625c5cdb3..756d02405 100644 --- a/problems/largest-values-from-labels/README.md +++ b/problems/largest-values-from-labels/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/shortest-path-in-binary-matrix "Shortest Path in Binary Matrix") -## 1090. Largest Values From Labels (Medium) +## [1090. Largest Values From Labels (Medium)](https://leetcode.com/problems/largest-values-from-labels "ๅๆ ็ญพๅฝฑๅ็ๆๅคงๅผ")We have a set of items: the i-th item has value values[i] and label labels[i].
We have a collection of rocks, each rock has a positive integer weight.
diff --git a/problems/last-stone-weight/README.md b/problems/last-stone-weight/README.md index e9a08f64a..0964d5b57 100644 --- a/problems/last-stone-weight/README.md +++ b/problems/last-stone-weight/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/remove-all-adjacent-duplicates-in-string "Remove All Adjacent Duplicates In String") -## 1046. Last Stone Weight (Easy) +## [1046. Last Stone Weight (Easy)](https://leetcode.com/problems/last-stone-weight "ๆๅไธๅ็ณๅคด็้้")We have a collection of rocks, each rock has a positive integer weight.
diff --git a/problems/last-substring-in-lexicographical-order/README.md b/problems/last-substring-in-lexicographical-order/README.md index 182bb6ecc..cff2004a5 100644 --- a/problems/last-substring-in-lexicographical-order/README.md +++ b/problems/last-substring-in-lexicographical-order/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/product-price-at-a-given-date "Product Price at a Given Date") -## 1163. Last Substring in Lexicographical Order (Hard) +## [1163. Last Substring in Lexicographical Order (Hard)](https://leetcode.com/problems/last-substring-in-lexicographical-order "ๆๅญๅ ธๅบๆๅจๆๅ็ๅญไธฒ")Given a string s, return the last substring of s in lexicographical order.
Consider all the leaves of a binary tree. From left to right order, the values of those leaves form a leaf value sequence.
diff --git a/problems/least-operators-to-express-number/README.md b/problems/least-operators-to-express-number/README.md index 246d3703a..29ca8ddc9 100644 --- a/problems/least-operators-to-express-number/README.md +++ b/problems/least-operators-to-express-number/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/univalued-binary-tree "Univalued Binary Tree") -## 964. Least Operators to Express Number (Hard) +## [964. Least Operators to Express Number (Hard)](https://leetcode.com/problems/least-operators-to-express-number "่กจ็คบๆฐๅญ็ๆๅฐ่ฟ็ฎ็ฌฆ")Given a single positive integer x, we will write an expression of the form x (op1) x (op2) x (op3) x ... where each operator op1, op2, etc. is either addition, subtraction, multiplication, or division (+, -, *, or /). For example, with x = 3, we might write 3 * 3 / 3 + 3 - 3 which is a value of 3.
At a lemonade stand, each lemonade costs $5.
Given a string s consists of upper/lower-case alphabets and empty space characters ' ', return the length of last word in the string.
A sequence X_1, X_2, ..., X_n is fibonacci-like if:
Given a string S, we can transform every letter individually to be lowercase or uppercase to create another string. Return a list of all possible strings we could create.
diff --git a/problems/letter-combinations-of-a-phone-number/README.md b/problems/letter-combinations-of-a-phone-number/README.md index d04ad14df..2263594d0 100644 --- a/problems/letter-combinations-of-a-phone-number/README.md +++ b/problems/letter-combinations-of-a-phone-number/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/4sum "4Sum") -## 17. Letter Combinations of a Phone Number (Medium) +## [17. Letter Combinations of a Phone Number (Medium)](https://leetcode.com/problems/letter-combinations-of-a-phone-number "็ต่ฏๅท็ ็ๅญๆฏ็ปๅ")Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent.
You have a set of tiles, where each tile has one letter tiles[i] printed on it. Return the number of possible non-empty sequences of letters you can make.
Given an integer n, return 1 - n in lexicographical order.
diff --git a/problems/lexicographically-smallest-equivalent-string/README.md b/problems/lexicographically-smallest-equivalent-string/README.md index f594fba0b..dd6a66f52 100644 --- a/problems/lexicographically-smallest-equivalent-string/README.md +++ b/problems/lexicographically-smallest-equivalent-string/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/longest-repeating-substring "Longest Repeating Substring") -## 1061. Lexicographically Smallest Equivalent String (Medium) +## [1061. Lexicographically Smallest Equivalent String (Medium)](https://leetcode.com/problems/lexicographically-smallest-equivalent-string "ๆๅญๅ ธๅบๆๅๆๅฐ็็ญๆๅญ็ฌฆไธฒ")Given strings A and B of the same length, we say A[i] and B[i] are equivalent characters. For example, if A = "abc" and B = "cde", then we have 'a' == 'c', 'b' == 'd', 'c' == 'e'.
Design and implement a data structure for Least Frequently Used (LFU) cache. It should support the following operations: get and put.
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.
diff --git a/problems/line-reflection/README.md b/problems/line-reflection/README.md index d2bb80c2f..2e0b104bc 100644 --- a/problems/line-reflection/README.md +++ b/problems/line-reflection/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/count-numbers-with-unique-digits "Count Numbers with Unique Digits") -## 356. Line Reflection (Medium) +## [356. Line Reflection (Medium)](https://leetcode.com/problems/line-reflection "็ด็บฟ้ๅ") diff --git a/problems/linked-list-components/README.md b/problems/linked-list-components/README.md index 358a94756..84a14dde1 100644 --- a/problems/linked-list-components/README.md +++ b/problems/linked-list-components/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/race-car "Race Car") -## 817. Linked List Components (Medium) +## [817. Linked List Components (Medium)](https://leetcode.com/problems/linked-list-components "้พ่กจ็ปไปถ")We are given head, the head node of a linked list containing unique integer values.
Given a linked list, return the node where the cycle begins. If there is no cycle, return null.
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 4a1af5b53..d07b720db 100644 --- a/problems/linked-list-random-node/README.md +++ b/problems/linked-list-random-node/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/ransom-note "Ransom Note") -## 382. Linked List Random Node (Medium) +## [382. Linked List Random Node (Medium)](https://leetcode.com/problems/linked-list-random-node "้พ่กจ้ๆบ่็น")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 8817c48d6..59e313e1f 100644 --- a/problems/logger-rate-limiter/README.md +++ b/problems/logger-rate-limiter/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/sort-transformed-array "Sort Transformed Array") -## 359. Logger Rate Limiter (Easy) +## [359. Logger Rate Limiter (Easy)](https://leetcode.com/problems/logger-rate-limiter "ๆฅๅฟ้็้ๅถๅจ") diff --git a/problems/lonely-pixel-i/README.md b/problems/lonely-pixel-i/README.md index 0e5e64809..061a70013 100644 --- a/problems/lonely-pixel-i/README.md +++ b/problems/lonely-pixel-i/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [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) +## [531. Lonely Pixel I (Medium)](https://leetcode.com/problems/lonely-pixel-i "ๅญค็ฌๅ็ด I") diff --git a/problems/lonely-pixel-ii/README.md b/problems/lonely-pixel-ii/README.md index b8649988f..d5a5e49ac 100644 --- a/problems/lonely-pixel-ii/README.md +++ b/problems/lonely-pixel-ii/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/game-play-analysis-iii "Game Play Analysis III") -## 533. Lonely Pixel II (Medium) +## [533. Lonely Pixel II (Medium)](https://leetcode.com/problems/lonely-pixel-ii "ๅญค็ฌๅ็ด II") diff --git a/problems/long-pressed-name/README.md b/problems/long-pressed-name/README.md index abc127cdd..0838ab7b2 100644 --- a/problems/long-pressed-name/README.md +++ b/problems/long-pressed-name/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/flip-string-to-monotone-increasing "Flip String to Monotone Increasing") -## 925. Long Pressed Name (Easy) +## [925. Long Pressed Name (Easy)](https://leetcode.com/problems/long-pressed-name "้ฟๆ้ฎๅ ฅ")Your friend is typing his name into a keyboard. Sometimes, when typing a character c, the key might get long pressed, and the character will be typed 1 or more times.
Suppose we abstract our file system by a string in the following manner:
diff --git a/problems/longest-arithmetic-sequence/README.md b/problems/longest-arithmetic-sequence/README.md index 03f94f2ab..c3f2000bf 100644 --- a/problems/longest-arithmetic-sequence/README.md +++ b/problems/longest-arithmetic-sequence/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/recover-a-tree-from-preorder-traversal "Recover a Tree From Preorder Traversal") -## 1027. Longest Arithmetic Sequence (Medium) +## [1027. Longest Arithmetic Sequence (Medium)](https://leetcode.com/problems/longest-arithmetic-sequence "ๆ้ฟ็ญๅทฎๆฐๅ")Given an array A of integers, return the length of the longest arithmetic subsequence in A.
Return the largest possible k such that there exists a_1, a_2, ..., a_k such that:
Write a function to find the longest common prefix string amongst an array of strings.
diff --git a/problems/longest-common-subsequence/README.md b/problems/longest-common-subsequence/README.md index 965a19174..a3ae68e7d 100644 --- a/problems/longest-common-subsequence/README.md +++ b/problems/longest-common-subsequence/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/decrease-elements-to-make-array-zigzag "Decrease Elements To Make Array Zigzag") -## 1143. Longest Common Subsequence (Medium) +## [1143. Longest Common Subsequence (Medium)](https://leetcode.com/problems/longest-common-subsequence "")Given two strings text1 and text2, return the length of their longest common subsequence.
Given an unsorted array of integers, find the length of the longest consecutive elements sequence.
diff --git a/problems/longest-continuous-increasing-subsequence/README.md b/problems/longest-continuous-increasing-subsequence/README.md index 15d71426f..959fa975d 100644 --- a/problems/longest-continuous-increasing-subsequence/README.md +++ b/problems/longest-continuous-increasing-subsequence/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/cut-off-trees-for-golf-event "Cut Off Trees for Golf Event") -## 674. Longest Continuous Increasing Subsequence (Easy) +## [674. Longest Continuous Increasing Subsequence (Easy)](https://leetcode.com/problems/longest-continuous-increasing-subsequence "ๆ้ฟ่ฟ็ปญ้ๅขๅบๅ")
Given an unsorted array of integers, find the length of longest continuous increasing subsequence (subarray).
diff --git a/problems/longest-duplicate-substring/README.md b/problems/longest-duplicate-substring/README.md
index 43143c2a8..c457f590a 100644
--- a/problems/longest-duplicate-substring/README.md
+++ b/problems/longest-duplicate-substring/README.md
@@ -9,7 +9,7 @@
ใใใใใใใใใใใใใใใใ
[Next >](https://github.com/openset/leetcode/tree/master/problems/customers-who-bought-all-products "Customers Who Bought All Products")
-## 1044. Longest Duplicate Substring (Hard)
+## [1044. Longest Duplicate Substring (Hard)](https://leetcode.com/problems/longest-duplicate-substring "ๆ้ฟ้ๅคๅญไธฒ")
Given a string S, consider all duplicated substrings: (contiguous) substrings of S that occur 2 or more times. (The occurrences may overlap.)
We define a harmounious array as 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 756ea30f3..578a4eaed 100644 --- a/problems/longest-increasing-path-in-a-matrix/README.md +++ b/problems/longest-increasing-path-in-a-matrix/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/patching-array "Patching Array") -## 329. Longest Increasing Path in a Matrix (Hard) +## [329. Longest Increasing Path in a Matrix (Hard)](https://leetcode.com/problems/longest-increasing-path-in-a-matrix "็ฉ้ตไธญ็ๆ้ฟ้ๅข่ทฏๅพ")Given an integer matrix, find the length of the longest increasing path.
diff --git a/problems/longest-increasing-subsequence/README.md b/problems/longest-increasing-subsequence/README.md index b9b12ef4f..8b05a5d47 100644 --- a/problems/longest-increasing-subsequence/README.md +++ b/problems/longest-increasing-subsequence/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/remove-invalid-parentheses "Remove Invalid Parentheses") -## 300. Longest Increasing Subsequence (Medium) +## [300. Longest Increasing Subsequence (Medium)](https://leetcode.com/problems/longest-increasing-subsequence "ๆ้ฟไธๅๅญๅบๅ")Given an unsorted array of integers, find the length of longest increasing subsequence.
diff --git a/problems/longest-line-of-consecutive-one-in-matrix/README.md b/problems/longest-line-of-consecutive-one-in-matrix/README.md index 6413506aa..a81a80c81 100644 --- a/problems/longest-line-of-consecutive-one-in-matrix/README.md +++ b/problems/longest-line-of-consecutive-one-in-matrix/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/binary-tree-tilt "Binary Tree Tilt") -## 562. Longest Line of Consecutive One in Matrix (Medium) +## [562. Longest Line of Consecutive One in Matrix (Medium)](https://leetcode.com/problems/longest-line-of-consecutive-one-in-matrix "็ฉ้ตไธญๆ้ฟ็่ฟ็ปญ1็บฟๆฎต") diff --git a/problems/longest-mountain-in-array/README.md b/problems/longest-mountain-in-array/README.md index 9a799051a..b7492086f 100644 --- a/problems/longest-mountain-in-array/README.md +++ b/problems/longest-mountain-in-array/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/hand-of-straights "Hand of Straights") -## 845. Longest Mountain in Array (Medium) +## [845. Longest Mountain in Array (Medium)](https://leetcode.com/problems/longest-mountain-in-array "ๆฐ็ปไธญ็ๆ้ฟๅฑฑ่")Let's call any (contiguous) subarray B (of A) a mountain if the following properties hold:
diff --git a/problems/longest-palindrome/README.md b/problems/longest-palindrome/README.md index 7c6e5a0ef..8056e0379 100644 --- a/problems/longest-palindrome/README.md +++ b/problems/longest-palindrome/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/split-array-largest-sum "Split Array Largest Sum") -## 409. Longest Palindrome (Easy) +## [409. Longest Palindrome (Easy)](https://leetcode.com/problems/longest-palindrome "ๆ้ฟๅๆไธฒ")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-subsequence/README.md b/problems/longest-palindromic-subsequence/README.md index 8daaad62b..5f6f7f90c 100644 --- a/problems/longest-palindromic-subsequence/README.md +++ b/problems/longest-palindromic-subsequence/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/super-washing-machines "Super Washing Machines") -## 516. Longest Palindromic Subsequence (Medium) +## [516. Longest Palindromic Subsequence (Medium)](https://leetcode.com/problems/longest-palindromic-subsequence "ๆ้ฟๅๆๅญๅบๅ")Given a string s, find the longest palindromic subsequence's length in s. You may assume that the maximum length of s is 1000. diff --git a/problems/longest-palindromic-substring/README.md b/problems/longest-palindromic-substring/README.md index 823b0ebb1..d149237c7 100644 --- a/problems/longest-palindromic-substring/README.md +++ b/problems/longest-palindromic-substring/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/zigzag-conversion "ZigZag Conversion") -## 5. Longest Palindromic Substring (Medium) +## [5. Longest Palindromic Substring (Medium)](https://leetcode.com/problems/longest-palindromic-substring "ๆ้ฟๅๆๅญไธฒ")
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 440ce5057..49dfbdf5a 100644 --- a/problems/longest-repeating-character-replacement/README.md +++ b/problems/longest-repeating-character-replacement/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/word-squares "Word Squares") -## 424. Longest Repeating Character Replacement (Medium) +## [424. Longest Repeating Character Replacement (Medium)](https://leetcode.com/problems/longest-repeating-character-replacement "ๆฟๆขๅ็ๆ้ฟ้ๅคๅญ็ฌฆ")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-repeating-substring/README.md b/problems/longest-repeating-substring/README.md index 749ad30fe..177fab4f7 100644 --- a/problems/longest-repeating-substring/README.md +++ b/problems/longest-repeating-substring/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/number-of-valid-subarrays "Number of Valid Subarrays") -## 1062. Longest Repeating Substring (Medium) +## [1062. Longest Repeating Substring (Medium)](https://leetcode.com/problems/longest-repeating-substring "ๆ้ฟ้ๅคๅญไธฒ")Given a string S, find out the length of the longest repeating substring(s). Return 0 if no repeating substring exists.
Given a list of words, each word consists of English lowercase letters.
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 00ac4f646..cd701ca46 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 @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/rotate-function "Rotate Function") -## 395. Longest Substring with At Least K Repeating Characters (Medium) +## [395. Longest Substring with At Least K Repeating Characters (Medium)](https://leetcode.com/problems/longest-substring-with-at-least-k-repeating-characters "่ณๅฐๆKไธช้ๅคๅญ็ฌฆ็ๆ้ฟๅญไธฒ")Find the length of the longest substring T of a given string (consists of lowercase letters only) such that every character in T appears no less than k times. 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 190b676e6..40382dc98 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 @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [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) +## [340. Longest Substring with At Most K Distinct Characters (Hard)](https://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters "่ณๅคๅ ๅซ K ไธชไธๅๅญ็ฌฆ็ๆ้ฟๅญไธฒ") 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 63bd78f70..92dcd96cd 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 @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [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) +## [159. Longest Substring with At Most Two Distinct Characters (Hard)](https://leetcode.com/problems/longest-substring-with-at-most-two-distinct-characters "่ณๅคๅ ๅซไธคไธชไธๅๅญ็ฌฆ็ๆ้ฟๅญไธฒ")
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 135410965..f4832fa86 100644 --- a/problems/longest-substring-without-repeating-characters/README.md +++ b/problems/longest-substring-without-repeating-characters/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [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) +## [3. Longest Substring Without Repeating Characters (Medium)](https://leetcode.com/problems/longest-substring-without-repeating-characters "ๆ ้ๅคๅญ็ฌฆ็ๆ้ฟๅญไธฒ")Given a string, find the length of the longest substring without repeating characters.
diff --git a/problems/longest-turbulent-subarray/README.md b/problems/longest-turbulent-subarray/README.md index 7aad86ab2..6999719c7 100644 --- a/problems/longest-turbulent-subarray/README.md +++ b/problems/longest-turbulent-subarray/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/distribute-coins-in-binary-tree "Distribute Coins in Binary Tree") -## 978. Longest Turbulent Subarray (Medium) +## [978. Longest Turbulent Subarray (Medium)](https://leetcode.com/problems/longest-turbulent-subarray "ๆ้ฟๆนๆตๅญๆฐ็ป")A subarray A[i], A[i+1], ..., A[j] of A is said to be turbulent if and only if:
Given a group of two strings, you need to find the longest uncommon subsequence of this group of two strings. diff --git a/problems/longest-uncommon-subsequence-ii/README.md b/problems/longest-uncommon-subsequence-ii/README.md index d85ac2f07..bf2f523dc 100644 --- a/problems/longest-uncommon-subsequence-ii/README.md +++ b/problems/longest-uncommon-subsequence-ii/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/continuous-subarray-sum "Continuous Subarray Sum") -## 522. Longest Uncommon Subsequence II (Medium) +## [522. Longest Uncommon Subsequence II (Medium)](https://leetcode.com/problems/longest-uncommon-subsequence-ii "ๆ้ฟ็นๆฎๅบๅ II")
Given a list of strings, you need to find the longest uncommon subsequence among them. The longest uncommon subsequence is defined as the longest subsequence of one of these strings and this subsequence should not be any subsequence of the other strings. diff --git a/problems/longest-univalue-path/README.md b/problems/longest-univalue-path/README.md index 09aa2c4be..c9e3b9d73 100644 --- a/problems/longest-univalue-path/README.md +++ b/problems/longest-univalue-path/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/knight-probability-in-chessboard "Knight Probability in Chessboard") -## 687. Longest Univalue Path (Easy) +## [687. Longest Univalue Path (Easy)](https://leetcode.com/problems/longest-univalue-path "ๆ้ฟๅๅผ่ทฏๅพ")
Given a binary tree, find the length of the longest path where each node in the path has the same value. This path may or may not pass through the root.
diff --git a/problems/longest-valid-parentheses/README.md b/problems/longest-valid-parentheses/README.md index b2cfdbdd3..ace14c050 100644 --- a/problems/longest-valid-parentheses/README.md +++ b/problems/longest-valid-parentheses/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/search-in-rotated-sorted-array "Search in Rotated Sorted Array") -## 32. Longest Valid Parentheses (Hard) +## [32. Longest Valid Parentheses (Hard)](https://leetcode.com/problems/longest-valid-parentheses "ๆ้ฟๆๆๆฌๅท")Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring.
We are given hours, a list of the number of hours worked per day for a given employee.
Given a string and a string dictionary, find the longest string in the dictionary that can be formed by deleting some characters of the given string. If there are more than one possible results, return the longest word with the smallest lexicographical order. If there is no possible result, return the empty string. diff --git a/problems/longest-word-in-dictionary/README.md b/problems/longest-word-in-dictionary/README.md index 33b79b0d5..de362edb5 100644 --- a/problems/longest-word-in-dictionary/README.md +++ b/problems/longest-word-in-dictionary/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/accounts-merge "Accounts Merge") -## 720. Longest Word in Dictionary (Easy) +## [720. Longest Word in Dictionary (Easy)](https://leetcode.com/problems/longest-word-in-dictionary "่ฏๅ ธไธญๆ้ฟ็ๅ่ฏ")
Given a list of strings words representing an English Dictionary, find the longest word in words that can be built one character at a time by other words in words. If there is more than one possible answer, return the longest word with the smallest lexicographical order.
In a group of N people (labelled 0, 1, 2, ..., N-1), each person has different amounts of money, and different levels of quietness.
Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST.
diff --git a/problems/lowest-common-ancestor-of-a-binary-tree/README.md b/problems/lowest-common-ancestor-of-a-binary-tree/README.md index 6ff7bb6e7..0c238527d 100644 --- a/problems/lowest-common-ancestor-of-a-binary-tree/README.md +++ b/problems/lowest-common-ancestor-of-a-binary-tree/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [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) +## [236. Lowest Common Ancestor of a Binary Tree (Medium)](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree "ไบๅๆ ็ๆ่ฟๅ ฌๅ ฑ็ฅๅ ")Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.
diff --git a/problems/lowest-common-ancestor-of-deepest-leaves/README.md b/problems/lowest-common-ancestor-of-deepest-leaves/README.md index 326c0ab2f..4b321a2a6 100644 --- a/problems/lowest-common-ancestor-of-deepest-leaves/README.md +++ b/problems/lowest-common-ancestor-of-deepest-leaves/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/longest-well-performing-interval "Longest Well-Performing Interval") -## 1123. Lowest Common Ancestor of Deepest Leaves (Medium) +## [1123. Lowest Common Ancestor of Deepest Leaves (Medium)](https://leetcode.com/problems/lowest-common-ancestor-of-deepest-leaves "ๆๆทฑๅถ่็น็ๆ่ฟๅ ฌๅ ฑ็ฅๅ ")Given a rooted binary tree, return the lowest common ancestor of its deepest leaves.
diff --git a/problems/lru-cache/README.md b/problems/lru-cache/README.md index d8a65f255..d07901901 100644 --- a/problems/lru-cache/README.md +++ b/problems/lru-cache/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/insertion-sort-list "Insertion Sort List") -## 146. LRU Cache (Medium) +## [146. LRU Cache (Medium)](https://leetcode.com/problems/lru-cache "LRU็ผๅญๆบๅถ")Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and put.
A 3 x 3 magic square is a 3 x 3 grid filled with distinct numbers from 1 to 9 such that each row, column, and both diagonals all have the same sum.
diff --git a/problems/magical-string/README.md b/problems/magical-string/README.md index 23cd68571..1cbf12567 100644 --- a/problems/magical-string/README.md +++ b/problems/magical-string/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/license-key-formatting "License Key Formatting") -## 481. Magical String (Medium) +## [481. Magical String (Medium)](https://leetcode.com/problems/magical-string "็ฅๅฅๅญ็ฌฆไธฒ")A magical string S consists of only '1' and '2' and obeys the following rules: diff --git a/problems/majority-element-ii/README.md b/problems/majority-element-ii/README.md index 0ce1f07fc..9a8c4e349 100644 --- a/problems/majority-element-ii/README.md +++ b/problems/majority-element-ii/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [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) +## [229. Majority Element II (Medium)](https://leetcode.com/problems/majority-element-ii "ๆฑไผๆฐ II")
Given an integer array of size n, find all elements that appear more than ⌊ n/3 ⌋ times.
Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.
Given two integer arrays arr1 and arr2, return the minimum number of operations (possibly zero) needed to make arr1 strictly increasing.
In a 2D grid of 0s and 1s, we change at most one 0 to a 1.
The Employee table holds all employees including their managers. Every employee has an Id, and there is also a column for the manager Id.
Implement a MapSum class with insert, and sum methods.
diff --git a/problems/market-analysis-i/README.md b/problems/market-analysis-i/README.md
index dac596f58..164782fa9 100644
--- a/problems/market-analysis-i/README.md
+++ b/problems/market-analysis-i/README.md
@@ -9,6 +9,6 @@
ใใใใใใใใใใใใใใใใ
[Next >](https://github.com/openset/leetcode/tree/master/problems/market-analysis-ii "Market Analysis II")
-## 1158. Market Analysis I (Medium)
+## [1158. Market Analysis I (Medium)](https://leetcode.com/problems/market-analysis-i "")
diff --git a/problems/market-analysis-ii/README.md b/problems/market-analysis-ii/README.md
index cc2a74113..4fede0242 100644
--- a/problems/market-analysis-ii/README.md
+++ b/problems/market-analysis-ii/README.md
@@ -9,6 +9,6 @@
ใใใใใใใใใใใใใใใใ
[Next >](https://github.com/openset/leetcode/tree/master/problems/find-words-that-can-be-formed-by-characters "Find Words That Can Be Formed by Characters")
-## 1159. Market Analysis II (Hard)
+## [1159. Market Analysis II (Hard)](https://leetcode.com/problems/market-analysis-ii "")
diff --git a/problems/masking-personal-information/README.md b/problems/masking-personal-information/README.md
index 3dea2124a..f65e421de 100644
--- a/problems/masking-personal-information/README.md
+++ b/problems/masking-personal-information/README.md
@@ -9,7 +9,7 @@
ใใใใใใใใใใใใใใใใ
[Next >](https://github.com/openset/leetcode/tree/master/problems/flipping-an-image "Flipping an Image")
-## 831. Masking Personal Information (Medium)
+## [831. Masking Personal Information (Medium)](https://leetcode.com/problems/masking-personal-information "้่ไธชไบบไฟกๆฏ")
We are given a personal information string S, which may represent either an email address or a phone number.
Remember the story of Little Match Girl? By now, you know exactly what matchsticks the little match girl has, please find out a way you can make one square by using up all those matchsticks. You should not break any stick, but you can link them up, and each matchstick must be used exactly one time.
diff --git a/problems/matrix-cells-in-distance-order/README.md b/problems/matrix-cells-in-distance-order/README.md index f8b238029..183665526 100644 --- a/problems/matrix-cells-in-distance-order/README.md +++ b/problems/matrix-cells-in-distance-order/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/maximum-sum-of-two-non-overlapping-subarrays "Maximum Sum of Two Non-Overlapping Subarrays") -## 1030. Matrix Cells in Distance Order (Easy) +## [1030. Matrix Cells in Distance Order (Easy)](https://leetcode.com/problems/matrix-cells-in-distance-order "่ท็ฆป้กบๅบๆๅ็ฉ้ตๅๅ ๆ ผ")We are given a matrix with R rows and C columns has cells with integer coordinates (r, c), where 0 <= r < R and 0 <= c < C.
Given a non-empty 2D array grid of 0's and 1's, an island is a group of 1's (representing land) connected 4-directionally (horizontal or vertical.) You may assume all four edges of the grid are surrounded by water.
This question is the same as "Max Chunks to Make Sorted" except the integers of the given array are not necessarily distinct, the input array could be up to length 2000, and the elements could be up to 10**8.
Given an array arr that is a permutation of [0, 1, ..., arr.length - 1], we split the array into some number of "chunks" (partitions), and individually sort each chunk. After concatenating them, the result equals the sorted array.
Given an array A of 0s and 1s, we may change up to K values from 0 to 1.
Given a binary array, find the maximum number of consecutive 1s in this array.
diff --git a/problems/max-increase-to-keep-city-skyline/README.md b/problems/max-increase-to-keep-city-skyline/README.md index 391fa8219..db38fa6f5 100644 --- a/problems/max-increase-to-keep-city-skyline/README.md +++ b/problems/max-increase-to-keep-city-skyline/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/soup-servings "Soup Servings") -## 807. Max Increase to Keep City Skyline (Medium) +## [807. Max Increase to Keep City Skyline (Medium)](https://leetcode.com/problems/max-increase-to-keep-city-skyline "ไฟๆๅๅธๅคฉ้ ็บฟ")In a 2 dimensional array grid, each value grid[i][j] represents the height of a building located there. We are allowed to increase the height of any number of buildings, by any amount (the amounts can be different for different buildings). Height 0 is considered to be a building as well.
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-stack/README.md b/problems/max-stack/README.md index 065966f87..4f0e34aee 100644 --- a/problems/max-stack/README.md +++ b/problems/max-stack/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/1-bit-and-2-bit-characters "1-bit and 2-bit Characters") -## 716. Max Stack (Easy) +## [716. Max Stack (Easy)](https://leetcode.com/problems/max-stack "ๆๅคงๆ ")Design a max stack that supports push, pop, top, peekMax and popMax.
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 45639d88b..fbbe76882 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 @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [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) +## [363. Max Sum of Rectangle No Larger Than K (Hard)](https://leetcode.com/problems/max-sum-of-rectangle-no-larger-than-k "็ฉๅฝขๅบๅไธ่ถ ่ฟ K ็ๆๅคงๆฐๅผๅ")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-rectangle/README.md b/problems/maximal-rectangle/README.md index 5098f990e..c727578e5 100644 --- a/problems/maximal-rectangle/README.md +++ b/problems/maximal-rectangle/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/partition-list "Partition List") -## 85. Maximal Rectangle (Hard) +## [85. Maximal Rectangle (Hard)](https://leetcode.com/problems/maximal-rectangle "ๆๅคง็ฉๅฝข")Given a 2D binary matrix filled with 0's and 1's, find the largest rectangle containing only 1's and return its area.
diff --git a/problems/maximal-square/README.md b/problems/maximal-square/README.md index 77693c6f4..9266e0698 100644 --- a/problems/maximal-square/README.md +++ b/problems/maximal-square/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/count-complete-tree-nodes "Count Complete Tree Nodes") -## 221. Maximal Square (Medium) +## [221. Maximal Square (Medium)](https://leetcode.com/problems/maximal-square "ๆๅคงๆญฃๆนๅฝข")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/maximize-distance-to-closest-person/README.md b/problems/maximize-distance-to-closest-person/README.md index a69f74920..74cf86044 100644 --- a/problems/maximize-distance-to-closest-person/README.md +++ b/problems/maximize-distance-to-closest-person/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/rectangle-area-ii "Rectangle Area II") -## 849. Maximize Distance to Closest Person (Easy) +## [849. Maximize Distance to Closest Person (Easy)](https://leetcode.com/problems/maximize-distance-to-closest-person "ๅฐๆ่ฟ็ไบบ็ๆๅคง่ท็ฆป")In a row of seats, 1 represents a person sitting in that seat, and 0 represents that the seat is empty.
Given an array A of integers, we must modify the array in the following way: we choose an i and replace A[i] with -A[i], and we repeat this process K times in total. (We may choose the same index i multiple times.)
Given an array consisting of n integers, find the contiguous subarray of given length k that has the maximum average value. And you need to output the maximum average value.
We are given the root node of a maximum tree: a tree where every node has a value greater than any other value in its subtree.
Given an integer array with no duplicates. A maximum tree building on this array is defined as follow: diff --git a/problems/maximum-depth-of-binary-tree/README.md b/problems/maximum-depth-of-binary-tree/README.md index 00b83901b..e16f6eb81 100644 --- a/problems/maximum-depth-of-binary-tree/README.md +++ b/problems/maximum-depth-of-binary-tree/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [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) +## [104. Maximum Depth of Binary Tree (Easy)](https://leetcode.com/problems/maximum-depth-of-binary-tree "ไบๅๆ ็ๆๅคงๆทฑๅบฆ")
Given a binary tree, find its maximum depth.
diff --git a/problems/maximum-depth-of-n-ary-tree/README.md b/problems/maximum-depth-of-n-ary-tree/README.md index 5db98ba7e..b445f5dc2 100644 --- a/problems/maximum-depth-of-n-ary-tree/README.md +++ b/problems/maximum-depth-of-n-ary-tree/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [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) +## [559. Maximum Depth of N-ary Tree (Easy)](https://leetcode.com/problems/maximum-depth-of-n-ary-tree "Nๅๆ ็ๆๅคงๆทฑๅบฆ")Given a n-ary tree, find its maximum depth.
diff --git a/problems/maximum-difference-between-node-and-ancestor/README.md b/problems/maximum-difference-between-node-and-ancestor/README.md index fefd203f1..ee8151c39 100644 --- a/problems/maximum-difference-between-node-and-ancestor/README.md +++ b/problems/maximum-difference-between-node-and-ancestor/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/longest-arithmetic-sequence "Longest Arithmetic Sequence") -## 1026. Maximum Difference Between Node and Ancestor (Medium) +## [1026. Maximum Difference Between Node and Ancestor (Medium)](https://leetcode.com/problems/maximum-difference-between-node-and-ancestor "่็นไธๅ ถ็ฅๅ ไน้ด็ๆๅคงๅทฎๅผ")Given the root of a binary tree, find the maximum value V for which there exists different nodes A and B where V = |A.val - B.val| and A is an ancestor of B.
Given m arrays, and each array is sorted in ascending order. Now you can pick up two integers from two different arrays (each array picks one) and calculate the distance. We define the distance between two integers a and b to be their absolute difference |a-b|. Your task is to find the maximum distance.
diff --git a/problems/maximum-frequency-stack/README.md b/problems/maximum-frequency-stack/README.md
index f0926a855..26d80ee53 100644
--- a/problems/maximum-frequency-stack/README.md
+++ b/problems/maximum-frequency-stack/README.md
@@ -9,7 +9,7 @@
ใใใใใใใใใใใใใใใใ
[Next >](https://github.com/openset/leetcode/tree/master/problems/monotonic-array "Monotonic Array")
-## 895. Maximum Frequency Stack (Hard)
+## [895. Maximum Frequency Stack (Hard)](https://leetcode.com/problems/maximum-frequency-stack "ๆๅคง้ข็ๆ ")
Implement FreqStack, a class which simulates the operation of a stack-like data structure.
Given an unsorted array, find the maximum difference between the successive elements in its sorted form.
diff --git a/problems/maximum-length-of-pair-chain/README.md b/problems/maximum-length-of-pair-chain/README.md index 7e4ff198c..3666514ca 100644 --- a/problems/maximum-length-of-pair-chain/README.md +++ b/problems/maximum-length-of-pair-chain/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/palindromic-substrings "Palindromic Substrings") -## 646. Maximum Length of Pair Chain (Medium) +## [646. Maximum Length of Pair Chain (Medium)](https://leetcode.com/problems/maximum-length-of-pair-chain "ๆ้ฟๆฐๅฏน้พ")
You are given n pairs of numbers. In every pair, the first number is always smaller than the second number.
diff --git a/problems/maximum-length-of-repeated-subarray/README.md b/problems/maximum-length-of-repeated-subarray/README.md
index 8a2c08164..accfa83a0 100644
--- a/problems/maximum-length-of-repeated-subarray/README.md
+++ b/problems/maximum-length-of-repeated-subarray/README.md
@@ -9,7 +9,7 @@
ใใใใใใใใใใใใใใใใ
[Next >](https://github.com/openset/leetcode/tree/master/problems/find-k-th-smallest-pair-distance "Find K-th Smallest Pair Distance")
-## 718. Maximum Length of Repeated Subarray (Medium)
+## [718. Maximum Length of Repeated Subarray (Medium)](https://leetcode.com/problems/maximum-length-of-repeated-subarray "ๆ้ฟ้ๅคๅญๆฐ็ป")
Given two integer arrays A and B, return the maximum length of an subarray that appears in both arrays.
Given the root of a binary tree, the level of its root is 1, the level of its children is 2, and so on.
A string is a valid parentheses string (denoted VPS) if and only if it consists of "(" and ")" characters only, and:
Given a string text, you want to use the characters of text to form as many instances of the word "balloon" as possible.
text consists of lower case English letters only.Hint 1
diff --git a/problems/maximum-number-of-ones/README.md b/problems/maximum-number-of-ones/README.md index 60f345717..2bbfc68ae 100644 --- a/problems/maximum-number-of-ones/README.md +++ b/problems/maximum-number-of-ones/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/distance-between-bus-stops "Distance Between Bus Stops") -## 1183. Maximum Number of Ones (Hard) +## [1183. Maximum Number of Ones (Hard)](https://leetcode.com/problems/maximum-number-of-ones "็ฉ้ตไธญ 1 ็ๆๅคงๆฐ้") diff --git a/problems/maximum-of-absolute-value-expression/README.md b/problems/maximum-of-absolute-value-expression/README.md index 175c11692..43165aa08 100644 --- a/problems/maximum-of-absolute-value-expression/README.md +++ b/problems/maximum-of-absolute-value-expression/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/reported-posts-ii "Reported Posts II") -## 1131. Maximum of Absolute Value Expression (Medium) +## [1131. Maximum of Absolute Value Expression (Medium)](https://leetcode.com/problems/maximum-of-absolute-value-expression "็ปๅฏนๅผ่กจ่พพๅผ็ๆๅคงๅผ")Given two arrays of integers with equal lengths, return the maximum value of:
diff --git a/problems/maximum-product-of-three-numbers/README.md b/problems/maximum-product-of-three-numbers/README.md index 8d7f69dbd..e82527a72 100644 --- a/problems/maximum-product-of-three-numbers/README.md +++ b/problems/maximum-product-of-three-numbers/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/k-inverse-pairs-array "K Inverse Pairs Array") -## 628. Maximum Product of Three Numbers (Easy) +## [628. Maximum Product of Three Numbers (Easy)](https://leetcode.com/problems/maximum-product-of-three-numbers "ไธไธชๆฐ็ๆๅคงไน็งฏ")Given an integer array, find three numbers whose product is maximum and output the maximum product.
diff --git a/problems/maximum-product-of-word-lengths/README.md b/problems/maximum-product-of-word-lengths/README.md index c69856c01..470a1c12e 100644 --- a/problems/maximum-product-of-word-lengths/README.md +++ b/problems/maximum-product-of-word-lengths/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/bulb-switcher "Bulb Switcher") -## 318. Maximum Product of Word Lengths (Medium) +## [318. Maximum Product of Word Lengths (Medium)](https://leetcode.com/problems/maximum-product-of-word-lengths "ๆๅคงๅ่ฏ้ฟๅบฆไน็งฏ")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.
Given an integer array nums, find the contiguous subarray within an array (containing at least one number) which has the largest product.
Given an array of integers, return the maximum sum for a non-empty subarray (contiguous elements) with at most one element deletion. In other words, you want to choose a subarray and optionally delete one element from it so that there is still at least one element left and the sum of the remaining elements is maximum possible.
diff --git a/problems/maximum-subarray/README.md b/problems/maximum-subarray/README.md index 5c6a8249b..0a5589864 100644 --- a/problems/maximum-subarray/README.md +++ b/problems/maximum-subarray/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/spiral-matrix "Spiral Matrix") -## 53. Maximum Subarray (Easy) +## [53. Maximum Subarray (Easy)](https://leetcode.com/problems/maximum-subarray "ๆๅคงๅญๅบๅ")Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.
Given a circular array C of integers represented by A, find the maximum possible sum of a non-empty subarray of C.
In a given array nums of positive integers, find three non-overlapping subarrays with maximum sum.
Given an array A of non-negative integers, return the maximum sum of elements in two non-overlapping (contiguous) subarrays, which have lengths L and M. (For clarification, the L-length subarray could occur before or after the M-length subarray.)
Given a non-negative integer, you could swap two digits at most once to get the maximum valued number. Return the maximum valued number you could get. diff --git a/problems/maximum-vacation-days/README.md b/problems/maximum-vacation-days/README.md index faddc99cc..dc8fa0c65 100644 --- a/problems/maximum-vacation-days/README.md +++ b/problems/maximum-vacation-days/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/median-employee-salary "Median Employee Salary") -## 568. Maximum Vacation Days (Hard) +## [568. Maximum Vacation Days (Hard)](https://leetcode.com/problems/maximum-vacation-days "ๆๅคงไผๅๅคฉๆฐ") diff --git a/problems/maximum-width-of-binary-tree/README.md b/problems/maximum-width-of-binary-tree/README.md index 1cbfd51dd..ebcfadf24 100644 --- a/problems/maximum-width-of-binary-tree/README.md +++ b/problems/maximum-width-of-binary-tree/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/equal-tree-partition "Equal Tree Partition") -## 662. Maximum Width of Binary Tree (Medium) +## [662. Maximum Width of Binary Tree (Medium)](https://leetcode.com/problems/maximum-width-of-binary-tree "ไบๅๆ ๆๅคงๅฎฝๅบฆ")
Given a binary tree, write a function to get the maximum width of the given tree. The width of a tree is the maximum width among all levels. The binary tree has the same structure as a full binary tree, but some nodes are null.
diff --git a/problems/maximum-width-ramp/README.md b/problems/maximum-width-ramp/README.md index 2f151d77e..5f81645fe 100644 --- a/problems/maximum-width-ramp/README.md +++ b/problems/maximum-width-ramp/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-area-rectangle-ii "Minimum Area Rectangle II") -## 962. Maximum Width Ramp (Medium) +## [962. Maximum Width Ramp (Medium)](https://leetcode.com/problems/maximum-width-ramp "ๆๅคงๅฎฝๅบฆๅก")Given an array A of integers, a ramp is a tuple (i, j) for which i < j and A[i] <= A[j]. The width of such a ramp is j - i.
Given a non-empty array of numbers, a0, a1, a2, … , an-1, where 0 ≤ ai < 231.
diff --git a/problems/median-employee-salary/README.md b/problems/median-employee-salary/README.md index 73154f64e..fedb6e968 100644 --- a/problems/median-employee-salary/README.md +++ b/problems/median-employee-salary/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/managers-with-at-least-5-direct-reports "Managers with at Least 5 Direct Reports") -## 569. Median Employee Salary (Hard) +## [569. Median Employee Salary (Hard)](https://leetcode.com/problems/median-employee-salary "ๅๅทฅ่ชๆฐดไธญไฝๆฐ")The Employee table holds all employees. The employee table has three columns: Employee Id, Company Name, and Salary.
There are two sorted arrays nums1 and nums2 of size m and n respectively.
diff --git a/problems/meeting-rooms-ii/README.md b/problems/meeting-rooms-ii/README.md index 4f8dad0d7..8e68e9f11 100644 --- a/problems/meeting-rooms-ii/README.md +++ b/problems/meeting-rooms-ii/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/factor-combinations "Factor Combinations") -## 253. Meeting Rooms II (Medium) +## [253. Meeting Rooms II (Medium)](https://leetcode.com/problems/meeting-rooms-ii "ไผ่ฎฎๅฎค II") diff --git a/problems/meeting-rooms/README.md b/problems/meeting-rooms/README.md index 0e094a4f6..08c69b683 100644 --- a/problems/meeting-rooms/README.md +++ b/problems/meeting-rooms/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/meeting-rooms-ii "Meeting Rooms II") -## 252. Meeting Rooms (Easy) +## [252. Meeting Rooms (Easy)](https://leetcode.com/problems/meeting-rooms "ไผ่ฎฎๅฎค") diff --git a/problems/merge-intervals/README.md b/problems/merge-intervals/README.md index e3c7e8315..9d2bbc4a7 100644 --- a/problems/merge-intervals/README.md +++ b/problems/merge-intervals/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/insert-interval "Insert Interval") -## 56. Merge Intervals (Medium) +## [56. Merge Intervals (Medium)](https://leetcode.com/problems/merge-intervals "ๅๅนถๅบ้ด")Given a collection of intervals, merge all overlapping intervals.
diff --git a/problems/merge-k-sorted-lists/README.md b/problems/merge-k-sorted-lists/README.md index 25ff5d89d..849d58d26 100644 --- a/problems/merge-k-sorted-lists/README.md +++ b/problems/merge-k-sorted-lists/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/swap-nodes-in-pairs "Swap Nodes in Pairs") -## 23. Merge k Sorted Lists (Hard) +## [23. Merge k Sorted Lists (Hard)](https://leetcode.com/problems/merge-k-sorted-lists "ๅๅนถKไธชๆๅบ้พ่กจ")Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.
diff --git a/problems/merge-sorted-array/README.md b/problems/merge-sorted-array/README.md index 2616421cd..e817c123c 100644 --- a/problems/merge-sorted-array/README.md +++ b/problems/merge-sorted-array/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/gray-code "Gray Code") -## 88. Merge Sorted Array (Easy) +## [88. Merge Sorted Array (Easy)](https://leetcode.com/problems/merge-sorted-array "ๅๅนถไธคไธชๆๅบๆฐ็ป")Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.
diff --git a/problems/merge-two-binary-trees/README.md b/problems/merge-two-binary-trees/README.md index ecee7c8f2..ec7caa749 100644 --- a/problems/merge-two-binary-trees/README.md +++ b/problems/merge-two-binary-trees/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/students-report-by-geography "Students Report By Geography") -## 617. Merge Two Binary Trees (Easy) +## [617. Merge Two Binary Trees (Easy)](https://leetcode.com/problems/merge-two-binary-trees "ๅๅนถไบๅๆ ")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/merge-two-sorted-lists/README.md b/problems/merge-two-sorted-lists/README.md index b03c927cb..54d3145d0 100644 --- a/problems/merge-two-sorted-lists/README.md +++ b/problems/merge-two-sorted-lists/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/generate-parentheses "Generate Parentheses") -## 21. Merge Two Sorted Lists (Easy) +## [21. Merge Two Sorted Lists (Easy)](https://leetcode.com/problems/merge-two-sorted-lists "ๅๅนถไธคไธชๆๅบ้พ่กจ")Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.
diff --git a/problems/middle-of-the-linked-list/README.md b/problems/middle-of-the-linked-list/README.md index 3b24c36d2..42914c432 100644 --- a/problems/middle-of-the-linked-list/README.md +++ b/problems/middle-of-the-linked-list/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/stone-game "Stone Game") -## 876. Middle of the Linked List (Easy) +## [876. Middle of the Linked List (Easy)](https://leetcode.com/problems/middle-of-the-linked-list "้พ่กจ็ไธญ้ด็ป็น")Given a non-empty, singly linked list with head node head, return a middle node of linked list.
On a staircase, the i-th step has some non-negative cost cost[i] assigned (0 indexed).
diff --git a/problems/min-stack/README.md b/problems/min-stack/README.md
index 2e564579c..46c6f646c 100644
--- a/problems/min-stack/README.md
+++ b/problems/min-stack/README.md
@@ -9,7 +9,7 @@
ใใใใใใใใใใใใใใใใ
[Next >](https://github.com/openset/leetcode/tree/master/problems/binary-tree-upside-down "Binary Tree Upside Down")
-## 155. Min Stack (Easy)
+## [155. Min Stack (Easy)](https://leetcode.com/problems/min-stack "ๆๅฐๆ ")
Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.
diff --git a/problems/minesweeper/README.md b/problems/minesweeper/README.md index ad49696bc..99123aaad 100644 --- a/problems/minesweeper/README.md +++ b/problems/minesweeper/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-absolute-difference-in-bst "Minimum Absolute Difference in BST") -## 529. Minesweeper (Medium) +## [529. Minesweeper (Medium)](https://leetcode.com/problems/minesweeper "ๆซ้ทๆธธๆ")Let's play the minesweeper game (Wikipedia, online game)!
diff --git a/problems/mini-parser/README.md b/problems/mini-parser/README.md index 75ad2fa76..031d480e6 100644 --- a/problems/mini-parser/README.md +++ b/problems/mini-parser/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/lexicographical-numbers "Lexicographical Numbers") -## 385. Mini Parser (Medium) +## [385. Mini Parser (Medium)](https://leetcode.com/problems/mini-parser "่ฟทไฝ ่ฏญๆณๅๆๅจ")Given a nested list of integers represented as a string, implement a parser to deserialize it.
diff --git a/problems/minimize-malware-spread-ii/README.md b/problems/minimize-malware-spread-ii/README.md index 81e0ec828..eed9861f8 100644 --- a/problems/minimize-malware-spread-ii/README.md +++ b/problems/minimize-malware-spread-ii/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/unique-email-addresses "Unique Email Addresses") -## 928. Minimize Malware Spread II (Hard) +## [928. Minimize Malware Spread II (Hard)](https://leetcode.com/problems/minimize-malware-spread-ii "ๅฐฝ้ๅๅฐๆถๆ่ฝฏไปถ็ไผ ๆญ II")(This problem is the same as Minimize Malware Spread, with the differences bolded.)
diff --git a/problems/minimize-malware-spread/README.md b/problems/minimize-malware-spread/README.md index 8854a3047..e3d39401e 100644 --- a/problems/minimize-malware-spread/README.md +++ b/problems/minimize-malware-spread/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/long-pressed-name "Long Pressed Name") -## 924. Minimize Malware Spread (Hard) +## [924. Minimize Malware Spread (Hard)](https://leetcode.com/problems/minimize-malware-spread "ๅฐฝ้ๅๅฐๆถๆ่ฝฏไปถ็ไผ ๆญ")In a network of nodes, each node i is directly connected to another node j if and only if graph[i][j] = 1.
Given an array of prices [p1,p2...,pn] and a target, round each price pi to Roundi(pi) so that the rounded array [Round1(p1),Round2(p2)...,Roundn(pn)] sums to the given target. Each operation Roundi(pi) could be either Floor(pi) or Ceil(pi).
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-add-to-make-parentheses-valid/README.md b/problems/minimum-add-to-make-parentheses-valid/README.md index d6423d2cd..77d338a41 100644 --- a/problems/minimum-add-to-make-parentheses-valid/README.md +++ b/problems/minimum-add-to-make-parentheses-valid/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/sort-array-by-parity-ii "Sort Array By Parity II") -## 921. Minimum Add to Make Parentheses Valid (Medium) +## [921. Minimum Add to Make Parentheses Valid (Medium)](https://leetcode.com/problems/minimum-add-to-make-parentheses-valid "ไฝฟๆฌๅทๆๆ็ๆๅฐๆทปๅ ")Given a string S of '(' and ')' parentheses, we add the minimum number of parentheses ( '(' or ')', and in any positions ) so that the resulting parentheses string is valid.
Given a set of points in the xy-plane, determine the minimum area of any rectangle formed from these points, with sides not necessarily parallel to the x and y axes.
diff --git a/problems/minimum-area-rectangle/README.md b/problems/minimum-area-rectangle/README.md index 65f3f362d..2f26e23a0 100644 --- a/problems/minimum-area-rectangle/README.md +++ b/problems/minimum-area-rectangle/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/distinct-subsequences-ii "Distinct Subsequences II") -## 939. Minimum Area Rectangle (Medium) +## [939. Minimum Area Rectangle (Medium)](https://leetcode.com/problems/minimum-area-rectangle "ๆๅฐ้ข็งฏ็ฉๅฝข")Given a set of points in the xy-plane, determine the minimum area of a rectangle formed from these points, with sides parallel to the x and y axes.
diff --git a/problems/minimum-ascii-delete-sum-for-two-strings/README.md b/problems/minimum-ascii-delete-sum-for-two-strings/README.md index fd8ef35cc..3bf34105c 100644 --- a/problems/minimum-ascii-delete-sum-for-two-strings/README.md +++ b/problems/minimum-ascii-delete-sum-for-two-strings/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/subarray-product-less-than-k "Subarray Product Less Than K") -## 712. Minimum ASCII Delete Sum for Two Strings (Medium) +## [712. Minimum ASCII Delete Sum for Two Strings (Medium)](https://leetcode.com/problems/minimum-ascii-delete-sum-for-two-strings "ไธคไธชๅญ็ฌฆไธฒ็ๆๅฐASCIIๅ ้คๅ")Given two strings s1, s2, find the lowest ASCII sum of deleted characters to make two strings equal.
In a country popular for train travel, you have planned some train travelling one year in advance. The days of the year that you will travel is given as an array days. Each day is an integer from 1 to 365.
There are N workers. The i-th worker has a quality[i] and a minimum wage expectation wage[i].
There are N piles of stones arranged in a row. The i-th pile has stones[i] stones.
Given an array arr of positive integers, consider all binary trees such that:
Given a binary tree, find its minimum depth.
diff --git a/problems/minimum-distance-between-bst-nodes/README.md b/problems/minimum-distance-between-bst-nodes/README.md index dc5e37b4c..21bd2bd95 100644 --- a/problems/minimum-distance-between-bst-nodes/README.md +++ b/problems/minimum-distance-between-bst-nodes/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/letter-case-permutation "Letter Case Permutation") -## 783. Minimum Distance Between BST Nodes (Easy) +## [783. Minimum Distance Between BST Nodes (Easy)](https://leetcode.com/problems/minimum-distance-between-bst-nodes "ไบๅๆ็ดขๆ ็ป็นๆๅฐ่ท็ฆป")Given a Binary Search Tree (BST) with the root node root, return the minimum difference between the values of any two different nodes in the tree.
In a row of dominoes, A[i] and B[i] represent the top and bottom halves of the i-th domino. (A domino is a tile with two numbers from 1 to 6 - one on each half of the tile.)
Given a positive integer a, find the smallest positive integer b whose multiplication of each digit equals to a.
Given a square array of integers A, we want the minimum sum of a falling path through A.
A gene string can be represented by an 8-character long string, with choices from "A", "C", "G", "T".
For an undirected graph with tree characteristics, we can choose any node as the root. The result graph is then a rooted tree. Among all possible rooted trees, those with minimum height are called minimum height trees (MHTs). Given such a graph, write a function to find all the MHTs and return a list of their root labels.
diff --git a/problems/minimum-increment-to-make-array-unique/README.md b/problems/minimum-increment-to-make-array-unique/README.md index a8e86a760..2fc7fc30c 100644 --- a/problems/minimum-increment-to-make-array-unique/README.md +++ b/problems/minimum-increment-to-make-array-unique/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/validate-stack-sequences "Validate Stack Sequences") -## 945. Minimum Increment to Make Array Unique (Medium) +## [945. Minimum Increment to Make Array Unique (Medium)](https://leetcode.com/problems/minimum-increment-to-make-array-unique "ไฝฟๆฐ็ปๅฏไธ็ๆๅฐๅข้")Given an array of integers A, a move consists of choosing any A[i], and incrementing it by 1.
Suppose Andy and Doris want to choose a restaurant for dinner, and they both have a list of favorite restaurants represented by strings. 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 c4a5f6383..6572a4bcf 100644 --- a/problems/minimum-moves-to-equal-array-elements-ii/README.md +++ b/problems/minimum-moves-to-equal-array-elements-ii/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/island-perimeter "Island Perimeter") -## 462. Minimum Moves to Equal Array Elements II (Medium) +## [462. Minimum Moves to Equal Array Elements II (Medium)](https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii "ๆๅฐ็งปๅจๆฌกๆฐไฝฟๆฐ็ปๅ ็ด ็ธ็ญ II")
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-moves-to-equal-array-elements/README.md b/problems/minimum-moves-to-equal-array-elements/README.md index 944b2c86b..a26167733 100644 --- a/problems/minimum-moves-to-equal-array-elements/README.md +++ b/problems/minimum-moves-to-equal-array-elements/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/4sum-ii "4Sum II") -## 453. Minimum Moves to Equal Array Elements (Easy) +## [453. Minimum Moves to Equal Array Elements (Easy)](https://leetcode.com/problems/minimum-moves-to-equal-array-elements "ๆๅฐ็งปๅจๆฌกๆฐไฝฟๆฐ็ปๅ ็ด ็ธ็ญ")Given a non-empty integer array of size n, find the minimum number of moves required to make all array elements equal, where a move is incrementing n - 1 elements 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 addd2808d..492f9f2fa 100644 --- a/problems/minimum-number-of-arrows-to-burst-balloons/README.md +++ b/problems/minimum-number-of-arrows-to-burst-balloons/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [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) +## [452. Minimum Number of Arrows to Burst Balloons (Medium)](https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons "็จๆๅฐๆฐ้็็ฎญๅผ็ๆฐ็")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-number-of-k-consecutive-bit-flips/README.md b/problems/minimum-number-of-k-consecutive-bit-flips/README.md index 084feb84a..ca7d138f4 100644 --- a/problems/minimum-number-of-k-consecutive-bit-flips/README.md +++ b/problems/minimum-number-of-k-consecutive-bit-flips/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/number-of-squareful-arrays "Number of Squareful Arrays") -## 995. Minimum Number of K Consecutive Bit Flips (Hard) +## [995. Minimum Number of K Consecutive Bit Flips (Hard)](https://leetcode.com/problems/minimum-number-of-k-consecutive-bit-flips "K ่ฟ็ปญไฝ็ๆๅฐ็ฟป่ฝฌๆฌกๆฐ")In an array A containing only 0s and 1s, a K-bit flip consists of choosing a (contiguous) subarray of length K and simultaneously changing every 0 in the subarray to 1, and every 1 in the subarray to 0.
A car travels from a starting position to a destination which is target miles east of the starting position.
Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.
diff --git a/problems/minimum-score-triangulation-of-polygon/README.md b/problems/minimum-score-triangulation-of-polygon/README.md index 49a72059c..df0e59edb 100644 --- a/problems/minimum-score-triangulation-of-polygon/README.md +++ b/problems/minimum-score-triangulation-of-polygon/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/moving-stones-until-consecutive-ii "Moving Stones Until Consecutive II") -## 1039. Minimum Score Triangulation of Polygon (Medium) +## [1039. Minimum Score Triangulation of Polygon (Medium)](https://leetcode.com/problems/minimum-score-triangulation-of-polygon "ๅค่พนๅฝขไธ่งๅๅ็ๆไฝๅพๅ")Given N, consider a convex N-sided polygon with vertices labelled A[0], A[i], ..., A[N-1] in clockwise order.
Given an array of n positive integers and a positive integer s, find the minimal length of a contiguous subarray of which the sum ≥ s. If there isn't one, return 0 instead.
diff --git a/problems/minimum-swaps-to-group-all-1s-together/README.md b/problems/minimum-swaps-to-group-all-1s-together/README.md index 5a5eaab37..32c8b1001 100644 --- a/problems/minimum-swaps-to-group-all-1s-together/README.md +++ b/problems/minimum-swaps-to-group-all-1s-together/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/analyze-user-website-visit-pattern "Analyze User Website Visit Pattern") -## 1151. Minimum Swaps to Group All 1's Together (Medium) +## [1151. Minimum Swaps to Group All 1's Together (Medium)](https://leetcode.com/problems/minimum-swaps-to-group-all-1s-together "ๆๅฐไบคๆขๆฌกๆฐๆฅ็ปๅๆๆ็ 1") diff --git a/problems/minimum-swaps-to-make-sequences-increasing/README.md b/problems/minimum-swaps-to-make-sequences-increasing/README.md index 90f7f1ad4..a325cdd42 100644 --- a/problems/minimum-swaps-to-make-sequences-increasing/README.md +++ b/problems/minimum-swaps-to-make-sequences-increasing/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/find-eventual-safe-states "Find Eventual Safe States") -## 801. Minimum Swaps To Make Sequences Increasing (Medium) +## [801. Minimum Swaps To Make Sequences Increasing (Medium)](https://leetcode.com/problems/minimum-swaps-to-make-sequences-increasing "ไฝฟๅบๅ้ๅข็ๆๅฐไบคๆขๆฌกๆฐ")We have two integer sequences A and B of the same non-zero length.
Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n).
diff --git a/problems/mirror-reflection/README.md b/problems/mirror-reflection/README.md index f72e20975..e8770f848 100644 --- a/problems/mirror-reflection/README.md +++ b/problems/mirror-reflection/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/buddy-strings "Buddy Strings") -## 858. Mirror Reflection (Medium) +## [858. Mirror Reflection (Medium)](https://leetcode.com/problems/mirror-reflection "้้ขๅๅฐ")There is a special square room with mirrors on each of the four walls. Except for the southwest corner, there are receptors on each of the remaining corners, numbered 0, 1, and 2.
Given a sorted array A of unique numbers, find the K-th missing number starting from the leftmost number of the array.
Given an array containing n distinct numbers taken from 0, 1, 2, ..., n, find the one that is missing from the array.
Given a non-negative integer N, find the largest number that is less than or equal to N with monotone increasing digits.
diff --git a/problems/monotonic-array/README.md b/problems/monotonic-array/README.md
index 45ef39294..d3dd108be 100644
--- a/problems/monotonic-array/README.md
+++ b/problems/monotonic-array/README.md
@@ -9,7 +9,7 @@
ใใใใใใใใใใใใใใใใ
[Next >](https://github.com/openset/leetcode/tree/master/problems/increasing-order-search-tree "Increasing Order Search Tree")
-## 896. Monotonic Array (Easy)
+## [896. Monotonic Array (Easy)](https://leetcode.com/problems/monotonic-array "ๅ่ฐๆฐๅ")
An array is monotonic if it is either monotone increasing or monotone decreasing.
diff --git a/problems/monthly-transactions-i/README.md b/problems/monthly-transactions-i/README.md index aed767bb1..e8fe65b36 100644 --- a/problems/monthly-transactions-i/README.md +++ b/problems/monthly-transactions-i/README.md @@ -9,6 +9,6 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/tournament-winners "Tournament Winners") -## 1193. Monthly Transactions I (Medium) +## [1193. Monthly Transactions I (Medium)](https://leetcode.com/problems/monthly-transactions-i "") diff --git a/problems/most-common-word/README.md b/problems/most-common-word/README.md index c94ad742c..ff2d8d755 100644 --- a/problems/most-common-word/README.md +++ b/problems/most-common-word/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/short-encoding-of-words "Short Encoding of Words") -## 819. Most Common Word (Easy) +## [819. Most Common Word (Easy)](https://leetcode.com/problems/most-common-word "ๆๅธธ่ง็ๅ่ฏ")Given a paragraph and a list of banned words, return the most frequent word that is not in the list of banned words. It is guaranteed there is at least one word that isn't banned, and that the answer is unique.
diff --git a/problems/most-frequent-subtree-sum/README.md b/problems/most-frequent-subtree-sum/README.md index 0d80f7e02..41294c4a6 100644 --- a/problems/most-frequent-subtree-sum/README.md +++ b/problems/most-frequent-subtree-sum/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/fibonacci-number "Fibonacci Number") -## 508. Most Frequent Subtree Sum (Medium) +## [508. Most Frequent Subtree Sum (Medium)](https://leetcode.com/problems/most-frequent-subtree-sum "ๅบ็ฐๆฌกๆฐๆๅค็ๅญๆ ๅ ็ด ๅ")Given the root of a tree, you are asked to find the most frequent subtree sum. The subtree sum of a node is defined as the sum of all the node values formed by the subtree rooted at that node (including the node itself). So what is the most frequent subtree sum value? If there is a tie, return all the values with the highest frequency in any order. diff --git a/problems/most-profit-assigning-work/README.md b/problems/most-profit-assigning-work/README.md index b40939af0..f40a5dbad 100644 --- a/problems/most-profit-assigning-work/README.md +++ b/problems/most-profit-assigning-work/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/making-a-large-island "Making A Large Island") -## 826. Most Profit Assigning Work (Medium) +## [826. Most Profit Assigning Work (Medium)](https://leetcode.com/problems/most-profit-assigning-work "ๅฎๆๅทฅไฝไปฅ่พพๅฐๆๅคงๆถ็")
We have jobs: difficulty[i] is the difficulty of the ith job, and profit[i] is the profit of the ith job.
On a 2D plane, we place stones at some integer coordinate points. Each coordinate point may have at most one stone.
diff --git a/problems/move-zeroes/README.md b/problems/move-zeroes/README.md index a6542d43f..d69fb3a9e 100644 --- a/problems/move-zeroes/README.md +++ b/problems/move-zeroes/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/peeking-iterator "Peeking Iterator") -## 283. Move Zeroes (Easy) +## [283. Move Zeroes (Easy)](https://leetcode.com/problems/move-zeroes "็งปๅจ้ถ")Given an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements.
On an infinite number line, the position of the i-th stone is given by stones[i]. Call a stone an endpoint stone if it has the smallest or largest position.
Three stones are on a number line at positions a, b, and c.
Given two non-negative integers num1 and num2 represented as strings, return the product of num1 and num2, also represented as a string.
Implement a MyCalendar class to store your events. A new event can be added if adding the event will not cause a double booking.
Implement a MyCalendarTwo class to store your events. A new event can be added if adding the event will not cause a triple booking.
Implement a MyCalendarThree class to store your events. A new event can always be added.
Given an n-ary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).
diff --git a/problems/n-ary-tree-postorder-traversal/README.md b/problems/n-ary-tree-postorder-traversal/README.md index ca9356256..6a0db72eb 100644 --- a/problems/n-ary-tree-postorder-traversal/README.md +++ b/problems/n-ary-tree-postorder-traversal/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/tag-validator "Tag Validator") -## 590. N-ary Tree Postorder Traversal (Easy) +## [590. N-ary Tree Postorder Traversal (Easy)](https://leetcode.com/problems/n-ary-tree-postorder-traversal "Nๅๆ ็ๅๅบ้ๅ")Given an n-ary tree, return the postorder traversal of its nodes' values.
diff --git a/problems/n-ary-tree-preorder-traversal/README.md b/problems/n-ary-tree-preorder-traversal/README.md index b434e170d..995bc3fb7 100644 --- a/problems/n-ary-tree-preorder-traversal/README.md +++ b/problems/n-ary-tree-preorder-traversal/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [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) +## [589. N-ary Tree Preorder Traversal (Easy)](https://leetcode.com/problems/n-ary-tree-preorder-traversal "Nๅๆ ็ๅๅบ้ๅ")Given an n-ary tree, return the preorder traversal of its nodes' values.
diff --git a/problems/n-queens-ii/README.md b/problems/n-queens-ii/README.md index b2d2a7e3c..8e3dcd20c 100644 --- a/problems/n-queens-ii/README.md +++ b/problems/n-queens-ii/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/maximum-subarray "Maximum Subarray") -## 52. N-Queens II (Hard) +## [52. N-Queens II (Hard)](https://leetcode.com/problems/n-queens-ii "N็ๅ II")The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other.
diff --git a/problems/n-queens/README.md b/problems/n-queens/README.md index 8b05090dc..34e14423c 100644 --- a/problems/n-queens/README.md +++ b/problems/n-queens/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/n-queens-ii "N-Queens II") -## 51. N-Queens (Hard) +## [51. N-Queens (Hard)](https://leetcode.com/problems/n-queens "N็ๅ")The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other.
diff --git a/problems/n-repeated-element-in-size-2n-array/README.md b/problems/n-repeated-element-in-size-2n-array/README.md index 41e0e8ec6..abc9a2414 100644 --- a/problems/n-repeated-element-in-size-2n-array/README.md +++ b/problems/n-repeated-element-in-size-2n-array/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/maximum-width-ramp "Maximum Width Ramp") -## 961. N-Repeated Element in Size 2N Array (Easy) +## [961. N-Repeated Element in Size 2N Array (Easy)](https://leetcode.com/problems/n-repeated-element-in-size-2n-array "้ๅค N ๆฌก็ๅ ็ด ")In a array A of size 2N, there are N+1 unique elements, and exactly one of these elements is repeated N times.
The Tribonacci sequence Tn is defined as follows:
diff --git a/problems/nested-list-weight-sum-ii/README.md b/problems/nested-list-weight-sum-ii/README.md index 0ff19363e..c138e0610 100644 --- a/problems/nested-list-weight-sum-ii/README.md +++ b/problems/nested-list-weight-sum-ii/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/water-and-jug-problem "Water and Jug Problem") -## 364. Nested List Weight Sum II (Medium) +## [364. Nested List Weight Sum II (Medium)](https://leetcode.com/problems/nested-list-weight-sum-ii "ๅ ๆๅตๅฅๅบๅๅ II") diff --git a/problems/nested-list-weight-sum/README.md b/problems/nested-list-weight-sum/README.md index df9d83853..6dc0e4116 100644 --- a/problems/nested-list-weight-sum/README.md +++ b/problems/nested-list-weight-sum/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/longest-substring-with-at-most-k-distinct-characters "Longest Substring with At Most K Distinct Characters") -## 339. Nested List Weight Sum (Easy) +## [339. Nested List Weight Sum (Easy)](https://leetcode.com/problems/nested-list-weight-sum "ๅตๅฅๅ่กจๆ้ๅ") diff --git a/problems/network-delay-time/README.md b/problems/network-delay-time/README.md index ea5e13257..97e5070fe 100644 --- a/problems/network-delay-time/README.md +++ b/problems/network-delay-time/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/find-smallest-letter-greater-than-target "Find Smallest Letter Greater Than Target") -## 743. Network Delay Time (Medium) +## [743. Network Delay Time (Medium)](https://leetcode.com/problems/network-delay-time "็ฝ็ปๅปถ่ฟๆถ้ด")There are N network nodes, labelled 1 to N.
Alice plays the following game, loosely based on the card game "21".
diff --git a/problems/new-users-daily-count/README.md b/problems/new-users-daily-count/README.md index 6dc6c82c8..5e541c651 100644 --- a/problems/new-users-daily-count/README.md +++ b/problems/new-users-daily-count/README.md @@ -9,6 +9,6 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/defanging-an-ip-address "Defanging an IP Address") -## 1107. New Users Daily Count (Medium) +## [1107. New Users Daily Count (Medium)](https://leetcode.com/problems/new-users-daily-count "") diff --git a/problems/next-closest-time/README.md b/problems/next-closest-time/README.md index e625c6916..483f5f326 100644 --- a/problems/next-closest-time/README.md +++ b/problems/next-closest-time/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/baseball-game "Baseball Game") -## 681. Next Closest Time (Medium) +## [681. Next Closest Time (Medium)](https://leetcode.com/problems/next-closest-time "ๆ่ฟๆถๅป") diff --git a/problems/next-greater-element-i/README.md b/problems/next-greater-element-i/README.md index d6478463c..7872c7bc6 100644 --- a/problems/next-greater-element-i/README.md +++ b/problems/next-greater-element-i/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [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) +## [496. Next Greater Element I (Easy)](https://leetcode.com/problems/next-greater-element-i "ไธไธไธชๆดๅคงๅ ็ด I")
You are given two arrays (without duplicates) nums1 and nums2 where nums1โs elements are subset of nums2. Find all the next greater numbers for nums1's elements in the corresponding places of nums2.
diff --git a/problems/next-greater-element-ii/README.md b/problems/next-greater-element-ii/README.md
index ba4a8e4e3..9319385f9 100644
--- a/problems/next-greater-element-ii/README.md
+++ b/problems/next-greater-element-ii/README.md
@@ -9,7 +9,7 @@
ใใใใใใใใใใใใใใใใ
[Next >](https://github.com/openset/leetcode/tree/master/problems/base-7 "Base 7")
-## 503. Next Greater Element II (Medium)
+## [503. Next Greater Element II (Medium)](https://leetcode.com/problems/next-greater-element-ii "ไธไธไธชๆดๅคงๅ
็ด II")
Given a circular array (the next element of the last element is the first element of the array), print the Next Greater Number for every element. The Next Greater Number of a number x is the first greater number to its traversing-order next in the array, which means you could search circularly to find its next greater number. If it doesn't exist, output -1 for this number. diff --git a/problems/next-greater-element-iii/README.md b/problems/next-greater-element-iii/README.md index 3ffe9c06d..e4142ef55 100644 --- a/problems/next-greater-element-iii/README.md +++ b/problems/next-greater-element-iii/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [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) +## [556. Next Greater Element III (Medium)](https://leetcode.com/problems/next-greater-element-iii "ไธไธไธชๆดๅคงๅ ็ด III")
Given a positive 32-bit integer n, you need to find the smallest 32-bit integer which has exactly the same digits existing in the integer n and is greater in value than n. If no such positive 32-bit integer exists, you need to return -1.
diff --git a/problems/next-greater-node-in-linked-list/README.md b/problems/next-greater-node-in-linked-list/README.md index 4d9d5a429..f6d719a3e 100644 --- a/problems/next-greater-node-in-linked-list/README.md +++ b/problems/next-greater-node-in-linked-list/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/number-of-enclaves "Number of Enclaves") -## 1019. Next Greater Node In Linked List (Medium) +## [1019. Next Greater Node In Linked List (Medium)](https://leetcode.com/problems/next-greater-node-in-linked-list "้พ่กจไธญ็ไธไธไธชๆดๅคง่็น")We are given a linked list with head as the first node. Let's number the nodes in the list: node_1, node_2, node_3, ... etc.
Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.
diff --git a/problems/nim-game/README.md b/problems/nim-game/README.md index 52e5a95a1..97383164b 100644 --- a/problems/nim-game/README.md +++ b/problems/nim-game/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/flip-game "Flip Game") -## 292. Nim Game (Easy) +## [292. Nim Game (Easy)](https://leetcode.com/problems/nim-game "Nim ๆธธๆ")You are playing the following Nim Game with your friend: There is a heap of stones on the table, each time one of you take turns to remove 1 to 3 stones. The one who removes the last stone will be the winner. You will take the first turn to remove the stones.
diff --git a/problems/non-decreasing-array/README.md b/problems/non-decreasing-array/README.md index 504912c38..749fe28f8 100644 --- a/problems/non-decreasing-array/README.md +++ b/problems/non-decreasing-array/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/path-sum-iv "Path Sum IV") -## 665. Non-decreasing Array (Easy) +## [665. Non-decreasing Array (Easy)](https://leetcode.com/problems/non-decreasing-array "้้ๅๆฐๅ")
Given an array with n integers, your task is to check if it could become non-decreasing by modifying at most 1 element.
diff --git a/problems/non-negative-integers-without-consecutive-ones/README.md b/problems/non-negative-integers-without-consecutive-ones/README.md
index 8aaccc683..63ca0feba 100644
--- a/problems/non-negative-integers-without-consecutive-ones/README.md
+++ b/problems/non-negative-integers-without-consecutive-ones/README.md
@@ -9,7 +9,7 @@
ใใใใใใใใใใใใใใใใ
[Next >](https://github.com/openset/leetcode/tree/master/problems/human-traffic-of-stadium "Human Traffic of Stadium")
-## 600. Non-negative Integers without Consecutive Ones (Hard)
+## [600. Non-negative Integers without Consecutive Ones (Hard)](https://leetcode.com/problems/non-negative-integers-without-consecutive-ones "ไธๅซ่ฟ็ปญ1็้่ดๆดๆฐ")
Given a positive integer n, find the number of non-negative integers less than or equal to n, whose binary representations do NOT contain consecutive ones.
diff --git a/problems/non-overlapping-intervals/README.md b/problems/non-overlapping-intervals/README.md index 788115877..e7eef44f5 100644 --- a/problems/non-overlapping-intervals/README.md +++ b/problems/non-overlapping-intervals/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/find-right-interval "Find Right Interval") -## 435. Non-overlapping Intervals (Medium) +## [435. Non-overlapping Intervals (Medium)](https://leetcode.com/problems/non-overlapping-intervals "ๆ ้ๅ ๅบ้ด")Given a collection of intervals, find the minimum number of intervals you need to remove to make the rest of the intervals non-overlapping.
diff --git a/problems/not-boring-movies/README.md b/problems/not-boring-movies/README.md index f1cf692f4..31351aa46 100644 --- a/problems/not-boring-movies/README.md +++ b/problems/not-boring-movies/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/task-scheduler "Task Scheduler") -## 620. Not Boring Movies (Easy) +## [620. Not Boring Movies (Easy)](https://leetcode.com/problems/not-boring-movies "ๆ่ถฃ็็ตๅฝฑ") X city opened a new cinema, many people would like to go to this cinema. The cinema also gives out a poster indicating the movies’ ratings and descriptions.Please write a SQL query to output movies with an odd numbered ID and a description that is not 'boring'. Order the result by rating.
diff --git a/problems/nth-digit/README.md b/problems/nth-digit/README.md index 1ff335084..541afe836 100644 --- a/problems/nth-digit/README.md +++ b/problems/nth-digit/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/binary-watch "Binary Watch") -## 400. Nth Digit (Easy) +## [400. Nth Digit (Easy)](https://leetcode.com/problems/nth-digit "็ฌฌNไธชๆฐๅญ")Find the nth digit of the infinite integer sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, ...
diff --git a/problems/nth-highest-salary/README.md b/problems/nth-highest-salary/README.md index 686c48419..1e339e539 100644 --- a/problems/nth-highest-salary/README.md +++ b/problems/nth-highest-salary/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/rank-scores "Rank Scores") -## 177. Nth Highest Salary (Medium) +## [177. Nth Highest Salary (Medium)](https://leetcode.com/problems/nth-highest-salary "็ฌฌN้ซ็่ชๆฐด")Write a SQL query to get the nth highest salary from the Employee table.
A positive integer is magical if it is divisible by either A or B.
diff --git a/problems/number-complement/README.md b/problems/number-complement/README.md index ceb921fde..2c097e868 100644 --- a/problems/number-complement/README.md +++ b/problems/number-complement/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/total-hamming-distance "Total Hamming Distance") -## 476. Number Complement (Easy) +## [476. Number Complement (Easy)](https://leetcode.com/problems/number-complement "ๆฐๅญ็่กฅๆฐ")Given a positive integer, output its complement number. The complement strategy is to flip the bits of its binary representation.
diff --git a/problems/number-of-1-bits/README.md b/problems/number-of-1-bits/README.md index 112b70cf6..22b05d93e 100644 --- a/problems/number-of-1-bits/README.md +++ b/problems/number-of-1-bits/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/word-frequency "Word Frequency") -## 191. Number of 1 Bits (Easy) +## [191. Number of 1 Bits (Easy)](https://leetcode.com/problems/number-of-1-bits "ไฝ1็ไธชๆฐ")Write a function that takes an unsigned integer and return the number of '1' bits it has (also known as the Hamming weight).
diff --git a/problems/number-of-atoms/README.md b/problems/number-of-atoms/README.md index 71d31c08c..5ff5aea5d 100644 --- a/problems/number-of-atoms/README.md +++ b/problems/number-of-atoms/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-window-subsequence "Minimum Window Subsequence") -## 726. Number of Atoms (Hard) +## [726. Number of Atoms (Hard)](https://leetcode.com/problems/number-of-atoms "ๅๅญ็ๆฐ้")Given a chemical formula (given as a string), return the count of each atom.
diff --git a/problems/number-of-boomerangs/README.md b/problems/number-of-boomerangs/README.md index e7a0911da..d34651dbb 100644 --- a/problems/number-of-boomerangs/README.md +++ b/problems/number-of-boomerangs/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [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) +## [447. Number of Boomerangs (Easy)](https://leetcode.com/problems/number-of-boomerangs "ๅๆ้็ๆฐ้")
Given n points in the plane that are all pairwise distinct, a "boomerang" is a tuple of points (i, j, k) such that the distance between i and j equals the distance between i and k (the order of the tuple matters).
You have d dice, and each die has f faces numbered 1, 2, ..., f.
Given an integer n, count the total number of digit 1 appearing in all non-negative integers less than or equal to n.
diff --git a/problems/number-of-distinct-islands-ii/README.md b/problems/number-of-distinct-islands-ii/README.md index e4a6c89fa..7ac5111bc 100644 --- a/problems/number-of-distinct-islands-ii/README.md +++ b/problems/number-of-distinct-islands-ii/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-ascii-delete-sum-for-two-strings "Minimum ASCII Delete Sum for Two Strings") -## 711. Number of Distinct Islands II (Hard) +## [711. Number of Distinct Islands II (Hard)](https://leetcode.com/problems/number-of-distinct-islands-ii "ไธๅๅฒๅฑฟ็ๆฐ้ II") diff --git a/problems/number-of-distinct-islands/README.md b/problems/number-of-distinct-islands/README.md index 0d0f0a2a9..8e3a0523e 100644 --- a/problems/number-of-distinct-islands/README.md +++ b/problems/number-of-distinct-islands/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/max-area-of-island "Max Area of Island") -## 694. Number of Distinct Islands (Medium) +## [694. Number of Distinct Islands (Medium)](https://leetcode.com/problems/number-of-distinct-islands "ไธๅๅฒๅฑฟ็ๆฐ้") diff --git a/problems/number-of-enclaves/README.md b/problems/number-of-enclaves/README.md index 156a2c33d..6f3695bc7 100644 --- a/problems/number-of-enclaves/README.md +++ b/problems/number-of-enclaves/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/remove-outermost-parentheses "Remove Outermost Parentheses") -## 1020. Number of Enclaves (Medium) +## [1020. Number of Enclaves (Medium)](https://leetcode.com/problems/number-of-enclaves "้ฃๅฐ็ๆฐ้")Given a 2D array A, each cell is 0 (representing sea) or 1 (representing land)
Given a list of dominoes, dominoes[i] = [a, b] is equivalent to dominoes[j] = [c, d] if and only if either (a==c and b==d), or (a==d and b==c) - that is, one domino can be rotated to be equal to another domino.
Given a 2d grid map of '1's (land) and '0's (water), count the number of islands. An island is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. You may assume all four edges of the grid are all surrounded by water.
We are to write the letters of a given string S, from left to right into lines. Each line has maximum width 100 units, and if writing a letter would cause the width of the line to exceed 100 units, it is written on the next line. We are given an array widths, an array where widths[0] is the width of 'a', widths[1] is the width of 'b', ..., and widths[25] is the width of 'z'.
Given an unsorted array of integers, find the number of longest increasing subsequence. diff --git a/problems/number-of-matching-subsequences/README.md b/problems/number-of-matching-subsequences/README.md index 6c7670340..1318a7084 100644 --- a/problems/number-of-matching-subsequences/README.md +++ b/problems/number-of-matching-subsequences/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/preimage-size-of-factorial-zeroes-function "Preimage Size of Factorial Zeroes Function") -## 792. Number of Matching Subsequences (Medium) +## [792. Number of Matching Subsequences (Medium)](https://leetcode.com/problems/number-of-matching-subsequences "ๅน้ ๅญๅบๅ็ๅ่ฏๆฐ")
Given string S and a dictionary of words words, find the number of words[i] that is a subsequence of S.
Your music player contains N different songs and she wants to listen to L (not necessarily different) songs during your trip. You create a playlist so that:
Write a class RecentCounter to count recent requests.
Count the number of segments in a string, where a segment is defined to be a contiguous sequence of non-space characters.
diff --git a/problems/number-of-squareful-arrays/README.md b/problems/number-of-squareful-arrays/README.md index 84fb1465b..2bbd316fe 100644 --- a/problems/number-of-squareful-arrays/README.md +++ b/problems/number-of-squareful-arrays/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/find-the-town-judge "Find the Town Judge") -## 996. Number of Squareful Arrays (Hard) +## [996. Number of Squareful Arrays (Hard)](https://leetcode.com/problems/number-of-squareful-arrays "ๆญฃๆนๅฝขๆฐ็ป็ๆฐ็ฎ")Given an array A of non-negative integers, the array is squareful if for every pair of adjacent elements, their sum is a perfect square.
We are given an array A of positive integers, and two positive integers L and R (L <= R).
Given a matrix, and a target, return the number of non-empty submatrices that sum to target.
Given an array A of integers, return the number of non-empty continuous subarrays that satisfy the following condition:
puzzle string, a word is valid if both the following conditions are satisfied:
-
diff --git a/problems/numbers-at-most-n-given-digit-set/README.md b/problems/numbers-at-most-n-given-digit-set/README.md
index b7d360742..da7c4b88d 100644
--- a/problems/numbers-at-most-n-given-digit-set/README.md
+++ b/problems/numbers-at-most-n-given-digit-set/README.md
@@ -9,7 +9,7 @@
ใใใใใใใใใใใใใใใใ
[Next >](https://github.com/openset/leetcode/tree/master/problems/valid-permutations-for-di-sequence "Valid Permutations for DI Sequence")
-## 902. Numbers At Most N Given Digit Set (Hard)
+## [902. Numbers At Most N Given Digit Set (Hard)](https://leetcode.com/problems/numbers-at-most-n-given-digit-set "ๆๅคงไธบ N ็ๆฐๅญ็ปๅ")
- It's guaranteed that all parentheses are balanced.
We have a sorted set of digits D, a non-empty subset of {'1','2','3','4','5','6','7','8','9'}. (Note that '0' is not included.)
Given a positive integer N, return the number of positive integers less than or equal to N that have at least 1 repeated digit.
Return all non-negative integers of length N such that the absolute difference between every two consecutive digits is K.
Given words first and second, consider occurrences in some text of the form "first second third", where second comes immediately after first, and third comes immediately after second.
You are given an integer array A. From some starting index, you can make a series of jumps. The (1st, 3rd, 5th, ...) jumps in the series are called odd numbered jumps, and the (2nd, 4th, 6th, ...) jumps in the series are called even numbered jumps.
Given a singly linked list, group all odd nodes together followed by the even nodes. Please note here we are talking about the node number and not the value in the nodes.
diff --git a/problems/one-edit-distance/README.md b/problems/one-edit-distance/README.md index 0a36f6da4..80b022090 100644 --- a/problems/one-edit-distance/README.md +++ b/problems/one-edit-distance/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/find-peak-element "Find Peak Element") -## 161. One Edit Distance (Medium) +## [161. One Edit Distance (Medium)](https://leetcode.com/problems/one-edit-distance "็ธ้ไธบ 1 ็็ผ่พ่ท็ฆป")Given two strings s and t, determine if they are both one edit distance apart.
diff --git a/problems/ones-and-zeroes/README.md b/problems/ones-and-zeroes/README.md index beff6f14f..1f1dab26f 100644 --- a/problems/ones-and-zeroes/README.md +++ b/problems/ones-and-zeroes/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/heaters "Heaters") -## 474. Ones and Zeroes (Medium) +## [474. Ones and Zeroes (Medium)](https://leetcode.com/problems/ones-and-zeroes "ไธๅ้ถ")In the computer world, use restricted resource you have to generate maximum benefit is what we always want to pursue.
diff --git a/problems/online-election/README.md b/problems/online-election/README.md index 0be5bd621..095e48566 100644 --- a/problems/online-election/README.md +++ b/problems/online-election/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/sort-an-array "Sort an Array") -## 911. Online Election (Medium) +## [911. Online Election (Medium)](https://leetcode.com/problems/online-election "ๅจ็บฟ้ไธพ")In an election, the i-th vote was cast for persons[i] at time times[i].
Implementing the class MajorityChecker, which has the following API:
Write a class StockSpanner which collects daily price quotes for some stock, and returns the span of that stock's price for the current day.
You have a lock in front of you with 4 circular wheels. Each wheel has 10 slots: '0', '1', '2', '3', '4', '5', '6', '7', '8', '9'. The wheels can rotate freely and wrap around: for example we can turn '9' to be '0', or '0' to be '9'. Each move consists of turning one wheel one slot.
diff --git a/problems/optimal-account-balancing/README.md b/problems/optimal-account-balancing/README.md
index 87a0f0ff9..607cdaa8e 100644
--- a/problems/optimal-account-balancing/README.md
+++ b/problems/optimal-account-balancing/README.md
@@ -9,6 +9,6 @@
ใใใใใใใใใใใใใใใใ
[Next >](https://github.com/openset/leetcode/tree/master/problems/count-the-repetitions "Count The Repetitions")
-## 465. Optimal Account Balancing (Hard)
+## [465. Optimal Account Balancing (Hard)](https://leetcode.com/problems/optimal-account-balancing "ๆไผ่ดฆๅๅนณ่กก")
diff --git a/problems/optimal-division/README.md b/problems/optimal-division/README.md
index e424f2802..d72f3a290 100644
--- a/problems/optimal-division/README.md
+++ b/problems/optimal-division/README.md
@@ -9,7 +9,7 @@
ใใใใใใใใใใใใใใใใ
[Next >](https://github.com/openset/leetcode/tree/master/problems/brick-wall "Brick Wall")
-## 553. Optimal Division (Medium)
+## [553. Optimal Division (Medium)](https://leetcode.com/problems/optimal-division "ๆไผ้คๆณ")
Given a list of positive integers, the adjacent integers will perform the float division. For example, [2,3,4] -> 2 / 3 / 4.
diff --git a/problems/optimize-water-distribution-in-a-village/README.md b/problems/optimize-water-distribution-in-a-village/README.md index 5185fc0db..24c37ad2d 100644 --- a/problems/optimize-water-distribution-in-a-village/README.md +++ b/problems/optimize-water-distribution-in-a-village/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/invalid-transactions "Invalid Transactions") -## 1168. Optimize Water Distribution in a Village (Hard) +## [1168. Optimize Water Distribution in a Village (Hard)](https://leetcode.com/problems/optimize-water-distribution-in-a-village "ๆฐด่ตๆบๅ้ ไผๅ") diff --git a/problems/orderly-queue/README.md b/problems/orderly-queue/README.md index 1c126fcef..c26709ec0 100644 --- a/problems/orderly-queue/README.md +++ b/problems/orderly-queue/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/rle-iterator "RLE Iterator") -## 899. Orderly Queue (Hard) +## [899. Orderly Queue (Hard)](https://leetcode.com/problems/orderly-queue "ๆๅบ้ๅ")A string S of lowercase letters is given. Then, we may make any number of moves.
There is an m by n grid with a ball. Given the start coordinate (i,j) of the ball, you can move the ball to adjacent cell or cross the grid boundary in four directions (up, down, left, right). However, you can at most move N times. Find out the number of paths to move the ball out of grid boundary. The answer may be very large, return it after mod 109 + 7.
diff --git a/problems/output-contest-matches/README.md b/problems/output-contest-matches/README.md index 16305a3e9..5dd263202 100644 --- a/problems/output-contest-matches/README.md +++ b/problems/output-contest-matches/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/boundary-of-binary-tree "Boundary of Binary Tree") -## 544. Output Contest Matches (Medium) +## [544. Output Contest Matches (Medium)](https://leetcode.com/problems/output-contest-matches "่พๅบๆฏ่ตๅน้ ๅฏน")During the NBA playoffs, we always arrange the rather strong team to play with the rather weak team, like make the rank 1 team play with the rank nth team, which is a good strategy to make the contest more interesting. Now, you're given n teams, you need to output their final contest matches in the form of a string. diff --git a/problems/pacific-atlantic-water-flow/README.md b/problems/pacific-atlantic-water-flow/README.md index 9d8186d8f..ade44570b 100644 --- a/problems/pacific-atlantic-water-flow/README.md +++ b/problems/pacific-atlantic-water-flow/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/sentence-screen-fitting "Sentence Screen Fitting") -## 417. Pacific Atlantic Water Flow (Medium) +## [417. Pacific Atlantic Water Flow (Medium)](https://leetcode.com/problems/pacific-atlantic-water-flow "ๅคชๅนณๆดๅคง่ฅฟๆดๆฐดๆต้ฎ้ข")
Given an m x n matrix of non-negative integers representing the height of each unit cell in a continent, the "Pacific ocean" touches the left and top edges of the matrix and the "Atlantic ocean" touches the right and bottom edges.
In a list of songs, the i-th song has a duration of time[i] seconds.
Given a singly linked list, determine if it is a palindrome.
diff --git a/problems/palindrome-number/README.md b/problems/palindrome-number/README.md index 49c22490b..bf22a0386 100644 --- a/problems/palindrome-number/README.md +++ b/problems/palindrome-number/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/regular-expression-matching "Regular Expression Matching") -## 9. Palindrome Number (Easy) +## [9. Palindrome Number (Easy)](https://leetcode.com/problems/palindrome-number "ๅๆๆฐ")Determine whether an integer is a palindrome. An integer is a palindrome when it reads the same backward as forward.
diff --git a/problems/palindrome-pairs/README.md b/problems/palindrome-pairs/README.md index 51bcfc9b9..797712f1f 100644 --- a/problems/palindrome-pairs/README.md +++ b/problems/palindrome-pairs/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/house-robber-iii "House Robber III") -## 336. Palindrome Pairs (Hard) +## [336. Palindrome Pairs (Hard)](https://leetcode.com/problems/palindrome-pairs "ๅๆๅฏน")Given a list of unique words, find all pairs of distinct indices (i, j) in the given list, so that the concatenation of the two words, i.e. words[i] + words[j] is a palindrome.
Given a string s, partition s such that every substring of the partition is a palindrome.
diff --git a/problems/palindrome-partitioning/README.md b/problems/palindrome-partitioning/README.md index 1d3896a2a..edfc550cf 100644 --- a/problems/palindrome-partitioning/README.md +++ b/problems/palindrome-partitioning/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/palindrome-partitioning-ii "Palindrome Partitioning II") -## 131. Palindrome Partitioning (Medium) +## [131. Palindrome Partitioning (Medium)](https://leetcode.com/problems/palindrome-partitioning "ๅๅฒๅๆไธฒ")Given a string s, partition s such that every substring of the partition is a palindrome.
diff --git a/problems/palindrome-permutation-ii/README.md b/problems/palindrome-permutation-ii/README.md index ca50839d5..ac5d96264 100644 --- a/problems/palindrome-permutation-ii/README.md +++ b/problems/palindrome-permutation-ii/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/missing-number "Missing Number") -## 267. Palindrome Permutation II (Medium) +## [267. Palindrome Permutation II (Medium)](https://leetcode.com/problems/palindrome-permutation-ii "ๅๆๆๅ II")Given a string s, return all the palindromic permutations (without duplicates) of it. Return an empty list if no palindromic permutation could be form.
Given a string, determine if a permutation of the string could form a palindrome.
diff --git a/problems/palindromic-substrings/README.md b/problems/palindromic-substrings/README.md index 9d70fdbd7..e197ee619 100644 --- a/problems/palindromic-substrings/README.md +++ b/problems/palindromic-substrings/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/replace-words "Replace Words") -## 647. Palindromic Substrings (Medium) +## [647. Palindromic Substrings (Medium)](https://leetcode.com/problems/palindromic-substrings "ๅๆๅญไธฒ")Given a string, your task is to count how many palindromic substrings in this string.
diff --git a/problems/pancake-sorting/README.md b/problems/pancake-sorting/README.md index ac9085d72..7befdf534 100644 --- a/problems/pancake-sorting/README.md +++ b/problems/pancake-sorting/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/powerful-integers "Powerful Integers") -## 969. Pancake Sorting (Medium) +## [969. Pancake Sorting (Medium)](https://leetcode.com/problems/pancake-sorting "็ ้ฅผๆๅบ")Given an array A, we can perform a pancake flip: We choose some positive integer k <= A.length, then reverse the order of the first k elements of A. We want to perform zero or more pancake flips (doing them one after another in succession) to sort the array A.
You are given a string expression representing a Lisp-like expression to return the integer value of.
diff --git a/problems/parsing-a-boolean-expression/README.md b/problems/parsing-a-boolean-expression/README.md
index b8140e85f..30029252d 100644
--- a/problems/parsing-a-boolean-expression/README.md
+++ b/problems/parsing-a-boolean-expression/README.md
@@ -9,7 +9,7 @@
ใใใใใใใใใใใใใใใใ
[Next >](https://github.com/openset/leetcode/tree/master/problems/new-users-daily-count "New Users Daily Count")
-## 1106. Parsing A Boolean Expression (Hard)
+## [1106. Parsing A Boolean Expression (Hard)](https://leetcode.com/problems/parsing-a-boolean-expression "่งฃๆๅธๅฐ่กจ่พพๅผ")
Return the result of evaluating a given boolean expression, represented as a string.
Given an integer array A, you partition the array into (contiguous) subarrays of length at most K. After partitioning, each subarray has their values changed to become the maximum value of that subarray.
Given an array A, partition it into two (contiguous) subarrays left and right so that:
Given an array A of integers, return true if and only if we can partition the array into three non-empty parts with equal sums.
Given a non-empty array containing only positive integers, find if the array can be partitioned into two subsets such that the sum of elements in both subsets is equal.
diff --git a/problems/partition-labels/README.md b/problems/partition-labels/README.md index ca3d87e03..a712e88e2 100644 --- a/problems/partition-labels/README.md +++ b/problems/partition-labels/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/largest-plus-sign "Largest Plus Sign") -## 763. Partition Labels (Medium) +## [763. Partition Labels (Medium)](https://leetcode.com/problems/partition-labels "ๅๅๅญๆฏๅบ้ด")
A string S of lowercase letters is given. We want to partition this string into as many parts as possible so that each letter appears in at most one part, and return a list of integers representing the size of these parts.
diff --git a/problems/partition-list/README.md b/problems/partition-list/README.md
index 48245992e..50f89c4d6 100644
--- a/problems/partition-list/README.md
+++ b/problems/partition-list/README.md
@@ -9,7 +9,7 @@
ใใใใใใใใใใใใใใใใ
[Next >](https://github.com/openset/leetcode/tree/master/problems/scramble-string "Scramble String")
-## 86. Partition List (Medium)
+## [86. Partition List (Medium)](https://leetcode.com/problems/partition-list "ๅ้้พ่กจ")
Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x.
diff --git a/problems/partition-to-k-equal-sum-subsets/README.md b/problems/partition-to-k-equal-sum-subsets/README.md index 04abbe17c..8e6965555 100644 --- a/problems/partition-to-k-equal-sum-subsets/README.md +++ b/problems/partition-to-k-equal-sum-subsets/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/falling-squares "Falling Squares") -## 698. Partition to K Equal Sum Subsets (Medium) +## [698. Partition to K Equal Sum Subsets (Medium)](https://leetcode.com/problems/partition-to-k-equal-sum-subsets "ๅๅไธบkไธช็ธ็ญ็ๅญ้")Given an array of integers nums and a positive integer k, find whether it's possible to divide this array into k non-empty subsets whose sums are all equal.
Given a non-negative index k where k ≤ 33, return the kth index row of the Pascal's triangle.
diff --git a/problems/pascals-triangle/README.md b/problems/pascals-triangle/README.md index 294300050..84634d9b5 100644 --- a/problems/pascals-triangle/README.md +++ b/problems/pascals-triangle/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/pascals-triangle-ii "Pascal's Triangle II") -## 118. Pascal's Triangle (Easy) +## [118. Pascal's Triangle (Easy)](https://leetcode.com/problems/pascals-triangle "ๆจ่พไธ่ง")Given a non-negative integer numRows, generate the first numRows of Pascal's triangle.
diff --git a/problems/patching-array/README.md b/problems/patching-array/README.md index 655583541..30f0a78d8 100644 --- a/problems/patching-array/README.md +++ b/problems/patching-array/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/verify-preorder-serialization-of-a-binary-tree "Verify Preorder Serialization of a Binary Tree") -## 330. Patching Array (Hard) +## [330. Patching Array (Hard)](https://leetcode.com/problems/patching-array "ๆ่ฆๆฑ่กฅ้ฝๆฐ็ป")Given a sorted positive integer array nums and an integer n, add/patch elements to the array such that any number in range [1, n] inclusive can be formed by the sum of some elements in the array. Return the minimum number of patches required.
In an infinite binary tree where every node has two children, the nodes are labelled in row order.
diff --git a/problems/path-sum-ii/README.md b/problems/path-sum-ii/README.md index efeab12ef..c866b5769 100644 --- a/problems/path-sum-ii/README.md +++ b/problems/path-sum-ii/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/flatten-binary-tree-to-linked-list "Flatten Binary Tree to Linked List") -## 113. Path Sum II (Medium) +## [113. Path Sum II (Medium)](https://leetcode.com/problems/path-sum-ii "่ทฏๅพๆปๅ II")Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.
diff --git a/problems/path-sum-iii/README.md b/problems/path-sum-iii/README.md index a53ac47e7..6eb2edb78 100644 --- a/problems/path-sum-iii/README.md +++ b/problems/path-sum-iii/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/find-all-anagrams-in-a-string "Find All Anagrams in a String") -## 437. Path Sum III (Easy) +## [437. Path Sum III (Easy)](https://leetcode.com/problems/path-sum-iii "่ทฏๅพๆปๅ III")You are given a binary tree in which each node contains an integer value.
diff --git a/problems/path-sum-iv/README.md b/problems/path-sum-iv/README.md index eb05e3ba5..b34a4feb6 100644 --- a/problems/path-sum-iv/README.md +++ b/problems/path-sum-iv/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/beautiful-arrangement-ii "Beautiful Arrangement II") -## 666. Path Sum IV (Medium) +## [666. Path Sum IV (Medium)](https://leetcode.com/problems/path-sum-iv "่ทฏๅพๅ IV")If the depth of a tree is smaller than 5, then this tree can be represented by a list of three-digits integers.
Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.
diff --git a/problems/path-with-maximum-minimum-value/README.md b/problems/path-with-maximum-minimum-value/README.md index a0711bca2..2855bc72f 100644 --- a/problems/path-with-maximum-minimum-value/README.md +++ b/problems/path-with-maximum-minimum-value/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/distribute-candies-to-people "Distribute Candies to People") -## 1102. Path With Maximum Minimum Value (Medium) +## [1102. Path With Maximum Minimum Value (Medium)](https://leetcode.com/problems/path-with-maximum-minimum-value "ๅพๅๆ้ซ็่ทฏๅพ")Given a matrix of integers A with R rows and C columns, find the maximum score of a path starting at [0,0] and ending at [R-1,C-1].
Let's call an array A a mountain if the following properties hold:
Given an Iterator class interface with methods: next() and hasNext(), design and implement a PeekingIterator that support the peek() operation -- it essentially peek() at the element that will be returned by the next call to next().
We define the Perfect Number is a positive integer that is equal to the sum of all its positive divisors except itself.
diff --git a/problems/perfect-rectangle/README.md b/problems/perfect-rectangle/README.md index bceac2ea6..c3dac2ecc 100644 --- a/problems/perfect-rectangle/README.md +++ b/problems/perfect-rectangle/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/is-subsequence "Is Subsequence") -## 391. Perfect Rectangle (Hard) +## [391. Perfect Rectangle (Hard)](https://leetcode.com/problems/perfect-rectangle "ๅฎ็พ็ฉๅฝข")Given N axis-aligned rectangles where N > 0, determine if they all together form an exact cover of a rectangular region.
diff --git a/problems/perfect-squares/README.md b/problems/perfect-squares/README.md index 1f10e9196..4d091cd7d 100644 --- a/problems/perfect-squares/README.md +++ b/problems/perfect-squares/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/wiggle-sort "Wiggle Sort") -## 279. Perfect Squares (Medium) +## [279. Perfect Squares (Medium)](https://leetcode.com/problems/perfect-squares "ๅฎๅ จๅนณๆนๆฐ")Given a positive integer n, find the least number of perfect square numbers (for example, 1, 4, 9, 16, ...) which sum to n.
Given two strings s1 and s2, write a function to return true if s2 contains the permutation of s1. In other words, one of the first string's permutations is the substring of the second string.
diff --git a/problems/permutation-sequence/README.md b/problems/permutation-sequence/README.md index 0b0104b92..3b7a4b88e 100644 --- a/problems/permutation-sequence/README.md +++ b/problems/permutation-sequence/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/rotate-list "Rotate List") -## 60. Permutation Sequence (Medium) +## [60. Permutation Sequence (Medium)](https://leetcode.com/problems/permutation-sequence "็ฌฌkไธชๆๅ")The set [1,2,3,...,n] contains a total of n! unique permutations.
Given a collection of numbers that might contain duplicates, return all possible unique permutations.
diff --git a/problems/permutations/README.md b/problems/permutations/README.md index fa00b55e0..1dcb5d5fc 100644 --- a/problems/permutations/README.md +++ b/problems/permutations/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/permutations-ii "Permutations II") -## 46. Permutations (Medium) +## [46. Permutations (Medium)](https://leetcode.com/problems/permutations "ๅ จๆๅ")Given a collection of distinct integers, return all possible permutations.
diff --git a/problems/plus-one-linked-list/README.md b/problems/plus-one-linked-list/README.md index c387c0c2c..15ae1a822 100644 --- a/problems/plus-one-linked-list/README.md +++ b/problems/plus-one-linked-list/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/range-addition "Range Addition") -## 369. Plus One Linked List (Medium) +## [369. Plus One Linked List (Medium)](https://leetcode.com/problems/plus-one-linked-list "็ปๅ้พ่กจๅ ไธ") diff --git a/problems/plus-one/README.md b/problems/plus-one/README.md index 008619c4a..173a1578e 100644 --- a/problems/plus-one/README.md +++ b/problems/plus-one/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/add-binary "Add Binary") -## 66. Plus One (Easy) +## [66. Plus One (Easy)](https://leetcode.com/problems/plus-one "ๅ ไธ")Given a non-empty array of digits representing a non-negative integer, plus one to the integer.
diff --git a/problems/poor-pigs/README.md b/problems/poor-pigs/README.md index cad82a719..a72ee4e6e 100644 --- a/problems/poor-pigs/README.md +++ b/problems/poor-pigs/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/repeated-substring-pattern "Repeated Substring Pattern") -## 458. Poor Pigs (Hard) +## [458. Poor Pigs (Hard)](https://leetcode.com/problems/poor-pigs "ๅฏๆ็ๅฐ็ช")There are 1000 buckets, one and only one of them is poisonous, while the rest are filled with water. They all look identical. If a pig drinks the poison it will die within 15 minutes. What is the minimum amount of pigs you need to figure out which bucket is poisonous within one hour?
diff --git a/problems/populating-next-right-pointers-in-each-node-ii/README.md b/problems/populating-next-right-pointers-in-each-node-ii/README.md index 44d88ea5d..0bf62d507 100644 --- a/problems/populating-next-right-pointers-in-each-node-ii/README.md +++ b/problems/populating-next-right-pointers-in-each-node-ii/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/pascals-triangle "Pascal's Triangle") -## 117. Populating Next Right Pointers in Each Node II (Medium) +## [117. Populating Next Right Pointers in Each Node II (Medium)](https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii "ๅกซๅ ๆฏไธช่็น็ไธไธไธชๅณไพง่็นๆ้ II")Given a binary tree
diff --git a/problems/populating-next-right-pointers-in-each-node/README.md b/problems/populating-next-right-pointers-in-each-node/README.md index 080bf4fbc..78591ccd9 100644 --- a/problems/populating-next-right-pointers-in-each-node/README.md +++ b/problems/populating-next-right-pointers-in-each-node/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/populating-next-right-pointers-in-each-node-ii "Populating Next Right Pointers in Each Node II") -## 116. Populating Next Right Pointers in Each Node (Medium) +## [116. Populating Next Right Pointers in Each Node (Medium)](https://leetcode.com/problems/populating-next-right-pointers-in-each-node "ๅกซๅ ๆฏไธช่็น็ไธไธไธชๅณไพง่็นๆ้")You are given a perfect binary tree where all leaves are on the same level, and every parent has two children. The binary tree has the following definition:
diff --git a/problems/positions-of-large-groups/README.md b/problems/positions-of-large-groups/README.md index c3fcf7be7..b36d002f7 100644 --- a/problems/positions-of-large-groups/README.md +++ b/problems/positions-of-large-groups/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/masking-personal-information "Masking Personal Information") -## 830. Positions of Large Groups (Easy) +## [830. Positions of Large Groups (Easy)](https://leetcode.com/problems/positions-of-large-groups "่พๅคงๅ็ป็ไฝ็ฝฎ")In a string S of lowercase letters, these letters form consecutive groups of the same character.
Given a set of N people (numbered 1, 2, ..., N), we would like to split everyone into two groups of any size.
Given an integer (signed 32 bits), write a function to check whether it is a power of 4.
diff --git a/problems/power-of-three/README.md b/problems/power-of-three/README.md index 1ed8e25ca..1d12a691c 100644 --- a/problems/power-of-three/README.md +++ b/problems/power-of-three/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/count-of-range-sum "Count of Range Sum") -## 326. Power of Three (Easy) +## [326. Power of Three (Easy)](https://leetcode.com/problems/power-of-three "3็ๅน")Given an integer, write a function to determine if it is a power of three.
diff --git a/problems/power-of-two/README.md b/problems/power-of-two/README.md index f66ead4cf..b25cb49c4 100644 --- a/problems/power-of-two/README.md +++ b/problems/power-of-two/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/implement-queue-using-stacks "Implement Queue using Stacks") -## 231. Power of Two (Easy) +## [231. Power of Two (Easy)](https://leetcode.com/problems/power-of-two "2็ๅน")Given an integer, write a function to determine if it is a power of two.
diff --git a/problems/powerful-integers/README.md b/problems/powerful-integers/README.md index 554550695..73a76c2a0 100644 --- a/problems/powerful-integers/README.md +++ b/problems/powerful-integers/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/flip-binary-tree-to-match-preorder-traversal "Flip Binary Tree To Match Preorder Traversal") -## 970. Powerful Integers (Easy) +## [970. Powerful Integers (Easy)](https://leetcode.com/problems/powerful-integers "ๅผบๆดๆฐ")Given two positive integers x and y, an integer is powerful if it is equal to x^i + y^j for some integers i >= 0 and j >= 0.
Implement pow(x, n), which calculates x raised to the power n (xn).
diff --git a/problems/predict-the-winner/README.md b/problems/predict-the-winner/README.md index 1b086b84d..db3326063 100644 --- a/problems/predict-the-winner/README.md +++ b/problems/predict-the-winner/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/max-consecutive-ones-ii "Max Consecutive Ones II") -## 486. Predict the Winner (Medium) +## [486. Predict the Winner (Medium)](https://leetcode.com/problems/predict-the-winner "้ขๆต่ตขๅฎถ")Given an array of scores that are non-negative integers. Player 1 picks one of the numbers from either end of the array followed by the player 2 and then player 1 and so on. Each time a player picks a number, that number will not be available for the next player. This continues until all the scores have been chosen. The player with the maximum score wins.
diff --git a/problems/prefix-and-suffix-search/README.md b/problems/prefix-and-suffix-search/README.md index 97a480bab..7d38cfaae 100644 --- a/problems/prefix-and-suffix-search/README.md +++ b/problems/prefix-and-suffix-search/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/min-cost-climbing-stairs "Min Cost Climbing Stairs") -## 745. Prefix and Suffix Search (Hard) +## [745. Prefix and Suffix Search (Hard)](https://leetcode.com/problems/prefix-and-suffix-search "ๅ็ผๅๅ็ผๆ็ดข")Given many words, words[i] has weight i.
Let f(x) be the number of zeroes at the end of x!. (Recall that x! = 1 * 2 * 3 * ... * x, and by convention, 0! = 1.)
Given an array A of positive integers (not necessarily distinct), return the lexicographically largest permutation that is smaller than A, that can be made with one swap (A swap exchanges the positions of two numbers A[i] and A[j]). If it cannot be done, then return the same array.
Return the number of permutations of 1 to n so that prime numbers are at prime indices (1-indexed.)
Given two integers L and R, find the count of numbers in the range [L, R] (inclusive) having a prime number of set bits in their binary representation.
diff --git a/problems/prime-palindrome/README.md b/problems/prime-palindrome/README.md
index 393df3aed..8a0c4f7d2 100644
--- a/problems/prime-palindrome/README.md
+++ b/problems/prime-palindrome/README.md
@@ -9,7 +9,7 @@
ใใใใใใใใใใใใใใใใ
[Next >](https://github.com/openset/leetcode/tree/master/problems/transpose-matrix "Transpose Matrix")
-## 866. Prime Palindrome (Medium)
+## [866. Prime Palindrome (Medium)](https://leetcode.com/problems/prime-palindrome "ๅๆ็ด ๆฐ")
Find the smallest prime palindrome greater than or equal to N.
Print a binary tree in an m*n 2D string array following these rules:
diff --git a/problems/print-foobar-alternately/README.md b/problems/print-foobar-alternately/README.md index fa9fff603..b447009b1 100644 --- a/problems/print-foobar-alternately/README.md +++ b/problems/print-foobar-alternately/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/print-zero-even-odd "Print Zero Even Odd") -## 1115. Print FooBar Alternately (Medium) +## [1115. Print FooBar Alternately (Medium)](https://leetcode.com/problems/print-foobar-alternately "ไบคๆฟๆๅฐFooBar")Suppose you are given the following code:
diff --git a/problems/print-in-order/README.md b/problems/print-in-order/README.md index 601bf97a0..fa6fc8612 100644 --- a/problems/print-in-order/README.md +++ b/problems/print-in-order/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/print-foobar-alternately "Print FooBar Alternately") -## 1114. Print in Order (Easy) +## [1114. Print in Order (Easy)](https://leetcode.com/problems/print-in-order "ๆๅบๆๅฐ")Suppose we have a class:
diff --git a/problems/print-zero-even-odd/README.md b/problems/print-zero-even-odd/README.md index baab710f0..6ba8391e3 100644 --- a/problems/print-zero-even-odd/README.md +++ b/problems/print-zero-even-odd/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/building-h2o "Building H2O") -## 1116. Print Zero Even Odd (Medium) +## [1116. Print Zero Even Odd (Medium)](https://leetcode.com/problems/print-zero-even-odd "ๆๅฐ้ถไธๅฅๅถๆฐ")Suppose you are given the following code:
diff --git a/problems/prison-cells-after-n-days/README.md b/problems/prison-cells-after-n-days/README.md index 19af13d98..9202cde3a 100644 --- a/problems/prison-cells-after-n-days/README.md +++ b/problems/prison-cells-after-n-days/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/check-completeness-of-a-binary-tree "Check Completeness of a Binary Tree") -## 957. Prison Cells After N Days (Medium) +## [957. Prison Cells After N Days (Medium)](https://leetcode.com/problems/prison-cells-after-n-days "N ๅคฉๅ็็ขๆฟ")There are 8 prison cells in a row, and each cell is either occupied or vacant.
diff --git a/problems/product-of-array-except-self/README.md b/problems/product-of-array-except-self/README.md index 4b6c47d8b..b4a11bf7a 100644 --- a/problems/product-of-array-except-self/README.md +++ b/problems/product-of-array-except-self/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/sliding-window-maximum "Sliding Window Maximum") -## 238. Product of Array Except Self (Medium) +## [238. Product of Array Except Self (Medium)](https://leetcode.com/problems/product-of-array-except-self "้ค่ช่บซไปฅๅคๆฐ็ป็ไน็งฏ")Given an array nums of n integers where n > 1, return an array output such that output[i] is equal to the product of all the elements of nums except nums[i].
There are G people in a gang, and a list of various crimes they could commit.
diff --git a/problems/project-employees-i/README.md b/problems/project-employees-i/README.md index 0600dfb23..51b7f3e7f 100644 --- a/problems/project-employees-i/README.md +++ b/problems/project-employees-i/README.md @@ -9,6 +9,6 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/project-employees-ii "Project Employees II") -## 1075. Project Employees I (Easy) +## [1075. Project Employees I (Easy)](https://leetcode.com/problems/project-employees-i "้กน็ฎๅๅทฅ I") diff --git a/problems/project-employees-ii/README.md b/problems/project-employees-ii/README.md index 4330b865b..8784501b5 100644 --- a/problems/project-employees-ii/README.md +++ b/problems/project-employees-ii/README.md @@ -9,6 +9,6 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/project-employees-iii "Project Employees III") -## 1076. Project Employees II (Easy) +## [1076. Project Employees II (Easy)](https://leetcode.com/problems/project-employees-ii "") diff --git a/problems/project-employees-iii/README.md b/problems/project-employees-iii/README.md index f3d2fd81a..208531bc8 100644 --- a/problems/project-employees-iii/README.md +++ b/problems/project-employees-iii/README.md @@ -9,6 +9,6 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/occurrences-after-bigram "Occurrences After Bigram") -## 1077. Project Employees III (Medium) +## [1077. Project Employees III (Medium)](https://leetcode.com/problems/project-employees-iii "้กน็ฎๅๅทฅ III") diff --git a/problems/projection-area-of-3d-shapes/README.md b/problems/projection-area-of-3d-shapes/README.md index 032210a39..491b51041 100644 --- a/problems/projection-area-of-3d-shapes/README.md +++ b/problems/projection-area-of-3d-shapes/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/uncommon-words-from-two-sentences "Uncommon Words from Two Sentences") -## 883. Projection Area of 3D Shapes (Easy) +## [883. Projection Area of 3D Shapes (Easy)](https://leetcode.com/problems/projection-area-of-3d-shapes "ไธ็ปดๅฝขไฝๆๅฝฑ้ข็งฏ")On a N * N grid, we place some 1 * 1 * 1 cubes that are axis-aligned with the x, y, and z axes.
There are N dominoes in a line, and we place each domino vertically upright.
We are stacking blocks to form a pyramid. Each block has a color which is a one letter string.
diff --git a/problems/quad-tree-intersection/README.md b/problems/quad-tree-intersection/README.md index 393e2147d..66d41f9e3 100644 --- a/problems/quad-tree-intersection/README.md +++ b/problems/quad-tree-intersection/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/maximum-depth-of-n-ary-tree "Maximum Depth of N-ary Tree") -## 558. Quad Tree Intersection (Easy) +## [558. Quad Tree Intersection (Easy)](https://leetcode.com/problems/quad-tree-intersection "ๅๅๆ ไบค้")A quadtree is a tree data in which each internal node has exactly four children: topLeft, topRight, bottomLeft and bottomRight. Quad trees are often used to partition a two-dimensional space by recursively subdividing it into four quadrants or regions.
Suppose you have a random list of people standing in a queue. Each person is described by a pair of integers (h, k), where h is the height of the person and k is the number of people in front of this person who have a height greater than or equal to h. Write an algorithm to reconstruct the queue.
In a forest, each rabbit has some color. Some subset of rabbits (possibly all of them) tell you how many other rabbits have the same color as them. Those answers are placed in an array.
Your car starts at position 0 and speed +1 on an infinite number line. (Your car can go into negative positions.)
diff --git a/problems/random-flip-matrix/README.md b/problems/random-flip-matrix/README.md index ec963489e..a72b17742 100644 --- a/problems/random-flip-matrix/README.md +++ b/problems/random-flip-matrix/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/detect-capital "Detect Capital") -## 519. Random Flip Matrix (Medium) +## [519. Random Flip Matrix (Medium)](https://leetcode.com/problems/random-flip-matrix "้ๆบ็ฟป่ฝฌ็ฉ้ต")You are given the number of rows n_rows and number of columns n_cols of a 2D binary matrix where all values are initially 0. Write a function flip which chooses a 0 value uniformly at random, changes it to 1, and then returns the position [row.id, col.id] of that value. Also, write a function reset which sets all values back to 0. Try to minimize the number of calls to system's Math.random() and optimize the time and space complexity.
Given an array of integers with possible duplicates, randomly output the index of a given target number. You can assume that the given target number must exist in the array.
diff --git a/problems/random-pick-with-blacklist/README.md b/problems/random-pick-with-blacklist/README.md index f7e2cea42..3e58fc9f6 100644 --- a/problems/random-pick-with-blacklist/README.md +++ b/problems/random-pick-with-blacklist/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/number-of-distinct-islands-ii "Number of Distinct Islands II") -## 710. Random Pick with Blacklist (Hard) +## [710. Random Pick with Blacklist (Hard)](https://leetcode.com/problems/random-pick-with-blacklist "้ปๅๅไธญ็้ๆบๆฐ")Given a blacklist B containing unique integers from [0, N), write a function to return a uniform random integer from [0, N) which is NOT in B.
Given an array w of positive integers, where w[i] describes the weight of index i, write a function pickIndex which randomly picks an index in proportion to its weight.
Given a list of non-overlapping axis-aligned rectangles rects, write a function pick which randomly and uniformily picks an integer point in the space covered by the rectangles.
Given an m * n matrix M initialized with all 0's and several update operations.
Operations are represented by a 2D array, and each operation is represented by an array with two positive integers a and b, which means M[i][j] should be added by one for all 0 <= i < a and 0 <= j < b.
diff --git a/problems/range-addition/README.md b/problems/range-addition/README.md index f510bc7c1..b9d1d7251 100644 --- a/problems/range-addition/README.md +++ b/problems/range-addition/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/sum-of-two-integers "Sum of Two Integers") -## 370. Range Addition (Medium) +## [370. Range Addition (Medium)](https://leetcode.com/problems/range-addition "ๅบ้ดๅ ๆณ") diff --git a/problems/range-module/README.md b/problems/range-module/README.md index 2a75f01db..e84f60fb3 100644 --- a/problems/range-module/README.md +++ b/problems/range-module/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/max-stack "Max Stack") -## 715. Range Module (Hard) +## [715. Range Module (Hard)](https://leetcode.com/problems/range-module "Range ๆจกๅ")A Range Module is a module that tracks ranges of numbers. Your task is to design and implement the following interfaces in an efficient manner.
diff --git a/problems/range-sum-of-bst/README.md b/problems/range-sum-of-bst/README.md index d891d406a..356f00373 100644 --- a/problems/range-sum-of-bst/README.md +++ b/problems/range-sum-of-bst/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-area-rectangle "Minimum Area Rectangle") -## 938. Range Sum of BST (Easy) +## [938. Range Sum of BST (Easy)](https://leetcode.com/problems/range-sum-of-bst "ไบๅๆ็ดขๆ ็่ๅดๅ")Given the root node of a binary search tree, return the sum of values of all nodes with value between L and R (inclusive).
Given a 2D matrix matrix, find the sum of the elements inside the rectangle defined by its upper left corner (row1, col1) and lower right corner (row2, col2).
diff --git a/problems/range-sum-query-2d-mutable/README.md b/problems/range-sum-query-2d-mutable/README.md index e1f500423..23cd7a7f5 100644 --- a/problems/range-sum-query-2d-mutable/README.md +++ b/problems/range-sum-query-2d-mutable/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-with-cooldown "Best Time to Buy and Sell Stock with Cooldown") -## 308. Range Sum Query 2D - Mutable (Hard) +## [308. Range Sum Query 2D - Mutable (Hard)](https://leetcode.com/problems/range-sum-query-2d-mutable "ไบ็ปดๅบๅๅๆฃ็ดข - ๅฏๅ") diff --git a/problems/range-sum-query-immutable/README.md b/problems/range-sum-query-immutable/README.md index a5f0e72c3..fc3a0444e 100644 --- a/problems/range-sum-query-immutable/README.md +++ b/problems/range-sum-query-immutable/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-2d-immutable "Range Sum Query 2D - Immutable") -## 303. Range Sum Query - Immutable (Easy) +## [303. Range Sum Query - Immutable (Easy)](https://leetcode.com/problems/range-sum-query-immutable "ๅบๅๅๆฃ็ดข - ๆฐ็ปไธๅฏๅ")Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive.
diff --git a/problems/range-sum-query-mutable/README.md b/problems/range-sum-query-mutable/README.md index abd4dcb0d..0922ceb77 100644 --- a/problems/range-sum-query-mutable/README.md +++ b/problems/range-sum-query-mutable/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-2d-mutable "Range Sum Query 2D - Mutable") -## 307. Range Sum Query - Mutable (Medium) +## [307. Range Sum Query - Mutable (Medium)](https://leetcode.com/problems/range-sum-query-mutable "ๅบๅๅๆฃ็ดข - ๆฐ็ปๅฏไฟฎๆน")Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive.
diff --git a/problems/rank-scores/README.md b/problems/rank-scores/README.md index 408f21e0f..98a80e882 100644 --- a/problems/rank-scores/README.md +++ b/problems/rank-scores/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/largest-number "Largest Number") -## 178. Rank Scores (Medium) +## [178. Rank Scores (Medium)](https://leetcode.com/problems/rank-scores "ๅๆฐๆๅ")Write a SQL query to rank scores. If there is a tie between two scores, both should have the same ranking. Note that after a tie, the next ranking number should be the next consecutive integer value. In other words, there should be no "holes" between ranks.
diff --git a/problems/ransom-note/README.md b/problems/ransom-note/README.md index c799b566f..f3bc42a43 100644 --- a/problems/ransom-note/README.md +++ b/problems/ransom-note/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/shuffle-an-array "Shuffle an Array") -## 383. Ransom Note (Easy) +## [383. Ransom Note (Easy)](https://leetcode.com/problems/ransom-note "่ต้ไฟก")Given an arbitrary ransom note string and another string containing letters from all the magazines, write a function that will return true if the ransom diff --git a/problems/reach-a-number/README.md b/problems/reach-a-number/README.md index b40a358a5..b13e05bc4 100644 --- a/problems/reach-a-number/README.md +++ b/problems/reach-a-number/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/pour-water "Pour Water") -## 754. Reach a Number (Easy) +## [754. Reach a Number (Easy)](https://leetcode.com/problems/reach-a-number "ๅฐ่พพ็ป็นๆฐๅญ")
You are standing at position 0 on an infinite number line. There is a goal at position target.
diff --git a/problems/reachable-nodes-in-subdivided-graph/README.md b/problems/reachable-nodes-in-subdivided-graph/README.md
index 340bf3d55..8cd936a5b 100644
--- a/problems/reachable-nodes-in-subdivided-graph/README.md
+++ b/problems/reachable-nodes-in-subdivided-graph/README.md
@@ -9,7 +9,7 @@
ใใใใใใใใใใใใใใใใ
[Next >](https://github.com/openset/leetcode/tree/master/problems/projection-area-of-3d-shapes "Projection Area of 3D Shapes")
-## 882. Reachable Nodes In Subdivided Graph (Hard)
+## [882. Reachable Nodes In Subdivided Graph (Hard)](https://leetcode.com/problems/reachable-nodes-in-subdivided-graph "็ปๅๅพไธญ็ๅฏๅฐ่พพ็ป็น")
Starting with an undirected graph (the "original graph") with nodes from 0 to N-1, subdivisions are made to some of the edges.
A move consists of taking a point (x, y) and transforming it to either (x, x+y) or (x+y, y).
Given a list of airline tickets represented by pairs of departure and arrival airports [from, to], reconstruct the itinerary in order. All of the tickets belong to a man who departs from JFK. Thus, the itinerary must begin with JFK.
Given a non-empty string containing an out-of-order English representation of digits 0-9, output the digits in ascending order.
We run a preorder depth first search on the root of a binary tree.
Two elements of a binary search tree (BST) are swapped by mistake.
diff --git a/problems/rectangle-area-ii/README.md b/problems/rectangle-area-ii/README.md index ffe3adb6d..1fdb74c03 100644 --- a/problems/rectangle-area-ii/README.md +++ b/problems/rectangle-area-ii/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/loud-and-rich "Loud and Rich") -## 850. Rectangle Area II (Hard) +## [850. Rectangle Area II (Hard)](https://leetcode.com/problems/rectangle-area-ii "็ฉๅฝข้ข็งฏ II")We are given a list of (axis-aligned) rectangles. Each rectangle[i] = [x1, y1, x2, y2] , where (x1, y1) are the coordinates of the bottom-left corner, and (x2, y2) are the coordinates of the top-right corner of the ith rectangle.
Find the total area covered by two rectilinear rectangles in a 2D plane.
diff --git a/problems/rectangle-overlap/README.md b/problems/rectangle-overlap/README.md index c7218b9e1..ee40280ab 100644 --- a/problems/rectangle-overlap/README.md +++ b/problems/rectangle-overlap/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/new-21-game "New 21 Game") -## 836. Rectangle Overlap (Easy) +## [836. Rectangle Overlap (Easy)](https://leetcode.com/problems/rectangle-overlap "็ฉๅฝข้ๅ ")A rectangle is represented as a list [x1, y1, x2, y2], where (x1, y1) are the coordinates of its bottom-left corner, and (x2, y2) are the coordinates of its top-right corner.
In this problem, a rooted tree is a directed graph such that, there is exactly one node (the root) for which all other nodes are descendants of this node, plus every node has exactly one parent, except for the root node which has no parents. diff --git a/problems/redundant-connection/README.md b/problems/redundant-connection/README.md index 24ffdcc64..27cf22c9c 100644 --- a/problems/redundant-connection/README.md +++ b/problems/redundant-connection/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/redundant-connection-ii "Redundant Connection II") -## 684. Redundant Connection (Medium) +## [684. Redundant Connection (Medium)](https://leetcode.com/problems/redundant-connection "ๅไฝ่ฟๆฅ")
In this problem, a tree is an undirected graph that is connected and has no cycles. diff --git a/problems/reformat-department-table/README.md b/problems/reformat-department-table/README.md index f52b8ea89..f5e5b98f7 100644 --- a/problems/reformat-department-table/README.md +++ b/problems/reformat-department-table/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/count-substrings-with-only-one-distinct-letter "Count Substrings with Only One Distinct Letter") -## 1179. Reformat Department Table (Easy) +## [1179. Reformat Department Table (Easy)](https://leetcode.com/problems/reformat-department-table "")
Table: Department
In a N x N grid composed of 1 x 1 squares, each 1 x 1 square consists of a /, \, or blank space. These characters divide the square into contiguous regions.
Given an input string (s) and a pattern (p), implement regular expression matching with support for '.' and '*'.
Given scores of N athletes, find their relative ranks and the people with the top three highest scores, who will be awarded medals: "Gold Medal", "Silver Medal" and "Bronze Medal".
diff --git a/problems/relative-sort-array/README.md b/problems/relative-sort-array/README.md index 7a5a372a5..95a21fd99 100644 --- a/problems/relative-sort-array/README.md +++ b/problems/relative-sort-array/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/lowest-common-ancestor-of-deepest-leaves "Lowest Common Ancestor of Deepest Leaves") -## 1122. Relative Sort Array (Easy) +## [1122. Relative Sort Array (Easy)](https://leetcode.com/problems/relative-sort-array "ๆฐ็ป็็ธๅฏนๆๅบ")Given two arrays arr1 and arr2, the elements of arr2 are distinct, and all elements in arr2 are also in arr1.
Hint 1
+Using a hashmap, we can map the values of arr2 to their position in arr2. +Hint 2
+After, we can use a custom sorting function. +Start from integer 1, remove any integer that contains 9 such as 9, 19, 29...
diff --git a/problems/remove-all-adjacent-duplicates-in-string/README.md b/problems/remove-all-adjacent-duplicates-in-string/README.md index 5c51b362f..12f0aa56c 100644 --- a/problems/remove-all-adjacent-duplicates-in-string/README.md +++ b/problems/remove-all-adjacent-duplicates-in-string/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/longest-string-chain "Longest String Chain") -## 1047. Remove All Adjacent Duplicates In String (Easy) +## [1047. Remove All Adjacent Duplicates In String (Easy)](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string "ๅ ้คๅญ็ฌฆไธฒไธญ็ๆๆ็ธ้ป้ๅค้กน")Given a string S of lowercase letters, a duplicate removal consists of choosing two adjacent and equal letters, and removing them.
Given several boxes with different colors represented by different positive numbers.
You may experience several rounds to remove boxes until there is no box left. Each time you can choose some continuous boxes with the same color (composed of k boxes, k >= 1), remove them and get k*k points.
diff --git a/problems/remove-comments/README.md b/problems/remove-comments/README.md
index 4369309e0..3a981fc79 100644
--- a/problems/remove-comments/README.md
+++ b/problems/remove-comments/README.md
@@ -9,7 +9,7 @@
ใใใใใใใใใใใใใใใใ
[Next >](https://github.com/openset/leetcode/tree/master/problems/candy-crush "Candy Crush")
-## 722. Remove Comments (Medium)
+## [722. Remove Comments (Medium)](https://leetcode.com/problems/remove-comments "ๅ ้คๆณจ้")
Given a C++ program, remove comments from it. The program source is an array where source[i] is the i-th line of the source code. This represents the result of splitting the original source code string by the newline character \n.
Given a string which contains only lowercase letters, remove duplicate letters so that every letter appears once and only once. You must make sure your result is the smallest in lexicographical order among all possible results.
diff --git a/problems/remove-duplicates-from-sorted-array-ii/README.md b/problems/remove-duplicates-from-sorted-array-ii/README.md index 3a39423aa..91362b9d8 100644 --- a/problems/remove-duplicates-from-sorted-array-ii/README.md +++ b/problems/remove-duplicates-from-sorted-array-ii/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/search-in-rotated-sorted-array-ii "Search in Rotated Sorted Array II") -## 80. Remove Duplicates from Sorted Array II (Medium) +## [80. Remove Duplicates from Sorted Array II (Medium)](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii "ๅ ้คๆๅบๆฐ็ปไธญ็้ๅค้กน II")Given a sorted array nums, remove the duplicates in-place such that duplicates appeared at most twice and return the new length.
diff --git a/problems/remove-duplicates-from-sorted-array/README.md b/problems/remove-duplicates-from-sorted-array/README.md index aead845ca..ea2a906a3 100644 --- a/problems/remove-duplicates-from-sorted-array/README.md +++ b/problems/remove-duplicates-from-sorted-array/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/remove-element "Remove Element") -## 26. Remove Duplicates from Sorted Array (Easy) +## [26. Remove Duplicates from Sorted Array (Easy)](https://leetcode.com/problems/remove-duplicates-from-sorted-array "ๅ ้คๆๅบๆฐ็ปไธญ็้ๅค้กน")Given a sorted array nums, remove the duplicates in-place such that each element appear only once and return the new length.
diff --git a/problems/remove-duplicates-from-sorted-list-ii/README.md b/problems/remove-duplicates-from-sorted-list-ii/README.md index 1c307d620..53a8da13c 100644 --- a/problems/remove-duplicates-from-sorted-list-ii/README.md +++ b/problems/remove-duplicates-from-sorted-list-ii/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/remove-duplicates-from-sorted-list "Remove Duplicates from Sorted List") -## 82. Remove Duplicates from Sorted List II (Medium) +## [82. Remove Duplicates from Sorted List II (Medium)](https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii "ๅ ้คๆๅบ้พ่กจไธญ็้ๅคๅ ็ด II")Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.
diff --git a/problems/remove-duplicates-from-sorted-list/README.md b/problems/remove-duplicates-from-sorted-list/README.md index de69c4e5b..044ffdc16 100644 --- a/problems/remove-duplicates-from-sorted-list/README.md +++ b/problems/remove-duplicates-from-sorted-list/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/largest-rectangle-in-histogram "Largest Rectangle in Histogram") -## 83. Remove Duplicates from Sorted List (Easy) +## [83. Remove Duplicates from Sorted List (Easy)](https://leetcode.com/problems/remove-duplicates-from-sorted-list "ๅ ้คๆๅบ้พ่กจไธญ็้ๅคๅ ็ด ")Given a sorted linked list, delete all duplicates such that each element appear only once.
diff --git a/problems/remove-element/README.md b/problems/remove-element/README.md index 614901bbc..974109275 100644 --- a/problems/remove-element/README.md +++ b/problems/remove-element/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/implement-strstr "Implement strStr()") -## 27. Remove Element (Easy) +## [27. Remove Element (Easy)](https://leetcode.com/problems/remove-element "็งป้คๅ ็ด ")Given an array nums and a value val, remove all instances of that value in-place and return the new length.
diff --git a/problems/remove-invalid-parentheses/README.md b/problems/remove-invalid-parentheses/README.md index 43f902630..5230d2179 100644 --- a/problems/remove-invalid-parentheses/README.md +++ b/problems/remove-invalid-parentheses/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/smallest-rectangle-enclosing-black-pixels "Smallest Rectangle Enclosing Black Pixels") -## 301. Remove Invalid Parentheses (Hard) +## [301. Remove Invalid Parentheses (Hard)](https://leetcode.com/problems/remove-invalid-parentheses "ๅ ้คๆ ๆ็ๆฌๅท")Remove the minimum number of invalid parentheses in order to make the input string valid. Return all possible results.
diff --git a/problems/remove-k-digits/README.md b/problems/remove-k-digits/README.md index 2e5bf4a93..c52c1a493 100644 --- a/problems/remove-k-digits/README.md +++ b/problems/remove-k-digits/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/frog-jump "Frog Jump") -## 402. Remove K Digits (Medium) +## [402. Remove K Digits (Medium)](https://leetcode.com/problems/remove-k-digits "็งปๆKไฝๆฐๅญ")Given a non-negative integer num represented as a string, remove k digits from the number so that the new number is the smallest possible.
diff --git a/problems/remove-linked-list-elements/README.md b/problems/remove-linked-list-elements/README.md index 0851ea527..685fd493c 100644 --- a/problems/remove-linked-list-elements/README.md +++ b/problems/remove-linked-list-elements/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/count-primes "Count Primes") -## 203. Remove Linked List Elements (Easy) +## [203. Remove Linked List Elements (Easy)](https://leetcode.com/problems/remove-linked-list-elements "็งป้ค้พ่กจๅ ็ด ")Remove all elements from a linked list of integers that have value val.
diff --git a/problems/remove-nth-node-from-end-of-list/README.md b/problems/remove-nth-node-from-end-of-list/README.md index 1487b6d3e..51ff61a63 100644 --- a/problems/remove-nth-node-from-end-of-list/README.md +++ b/problems/remove-nth-node-from-end-of-list/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/valid-parentheses "Valid Parentheses") -## 19. Remove Nth Node From End of List (Medium) +## [19. Remove Nth Node From End of List (Medium)](https://leetcode.com/problems/remove-nth-node-from-end-of-list "ๅ ้ค้พ่กจ็ๅๆฐ็ฌฌNไธช่็น")Given a linked list, remove the n-th node from the end of list and return its head.
diff --git a/problems/remove-outermost-parentheses/README.md b/problems/remove-outermost-parentheses/README.md index c0b3f3f05..88c154ddb 100644 --- a/problems/remove-outermost-parentheses/README.md +++ b/problems/remove-outermost-parentheses/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/sum-of-root-to-leaf-binary-numbers "Sum of Root To Leaf Binary Numbers") -## 1021. Remove Outermost Parentheses (Easy) +## [1021. Remove Outermost Parentheses (Easy)](https://leetcode.com/problems/remove-outermost-parentheses "ๅ ้คๆๅคๅฑ็ๆฌๅท")A valid parentheses string is either empty (""), "(" + A + ")", or A + B, where A and B are valid parentheses strings, and + represents string concatenation. For example, "", "()", "(())()", and "(()(()))" are all valid parentheses strings.
Given the head of a linked list, we repeatedly delete consecutive sequences of nodes that sum to 0 until there are no such sequences.
You have an array of logs. Each log is a space delimited string of words.
Given a singly linked list L: L0→L1→…→Ln-1→Ln,
reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→…
Starting with a positive integer N, we reorder the digits in any order (including the original order) such that the leading digit is not zero.
Given a string S, check if the letters can be rearranged so that two characters that are adjacent to each other are not the same.
All DNA is composed of a series of nucleotides abbreviated as A, C, G, and T, for example: "ACGAATTCCG". When studying DNA, it is sometimes useful to identify repeated sequences within the DNA.
diff --git a/problems/repeated-string-match/README.md b/problems/repeated-string-match/README.md index e8cd3611c..5713cd4a0 100644 --- a/problems/repeated-string-match/README.md +++ b/problems/repeated-string-match/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/longest-univalue-path "Longest Univalue Path") -## 686. Repeated String Match (Easy) +## [686. Repeated String Match (Easy)](https://leetcode.com/problems/repeated-string-match "้ๅคๅ ๅ ๅญ็ฌฆไธฒๅน้ ")Given two strings A and B, find the minimum number of times A has to be repeated such that B is a substring of it. If no such solution, return -1.
diff --git a/problems/repeated-substring-pattern/README.md b/problems/repeated-substring-pattern/README.md index d627a66be..78acee6c6 100644 --- a/problems/repeated-substring-pattern/README.md +++ b/problems/repeated-substring-pattern/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/lfu-cache "LFU Cache") -## 459. Repeated Substring Pattern (Easy) +## [459. Repeated Substring Pattern (Easy)](https://leetcode.com/problems/repeated-substring-pattern "้ๅค็ๅญๅญ็ฌฆไธฒ")Given a non-empty string check if it can be constructed by taking a substring of it and appending multiple copies of the substring together. You may assume the given string consists of lowercase English letters only and its length will not exceed 10000.
diff --git a/problems/replace-words/README.md b/problems/replace-words/README.md index d16fce052..437a54593 100644 --- a/problems/replace-words/README.md +++ b/problems/replace-words/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/dota2-senate "Dota2 Senate") -## 648. Replace Words (Medium) +## [648. Replace Words (Medium)](https://leetcode.com/problems/replace-words "ๅ่ฏๆฟๆข")In English, we have a concept called root, which can be followed by some other words to form another longer word - let's call this word successor. For example, the root an, followed by other, which can form another word another.
In MATLAB, there is a very useful function called 'reshape', which can reshape a matrix into a new one with different size but keep its original data.
diff --git a/problems/restore-ip-addresses/README.md b/problems/restore-ip-addresses/README.md index a9e4912fa..d19d86b24 100644 --- a/problems/restore-ip-addresses/README.md +++ b/problems/restore-ip-addresses/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/binary-tree-inorder-traversal "Binary Tree Inorder Traversal") -## 93. Restore IP Addresses (Medium) +## [93. Restore IP Addresses (Medium)](https://leetcode.com/problems/restore-ip-addresses "ๅคๅIPๅฐๅ")Given a string containing only digits, restore it by returning all possible valid IP address combinations.
diff --git a/problems/reveal-cards-in-increasing-order/README.md b/problems/reveal-cards-in-increasing-order/README.md index fe849e51e..7d4c21d36 100644 --- a/problems/reveal-cards-in-increasing-order/README.md +++ b/problems/reveal-cards-in-increasing-order/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/flip-equivalent-binary-trees "Flip Equivalent Binary Trees") -## 950. Reveal Cards In Increasing Order (Medium) +## [950. Reveal Cards In Increasing Order (Medium)](https://leetcode.com/problems/reveal-cards-in-increasing-order "ๆ้ๅข้กบๅบๆพ็คบๅก็")In a deck of cards, every card has a unique integer. You can order the deck in any order you want.
diff --git a/problems/reverse-bits/README.md b/problems/reverse-bits/README.md index 6db615aa8..9197d30aa 100644 --- a/problems/reverse-bits/README.md +++ b/problems/reverse-bits/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/number-of-1-bits "Number of 1 Bits") -## 190. Reverse Bits (Easy) +## [190. Reverse Bits (Easy)](https://leetcode.com/problems/reverse-bits "้ข ๅไบ่ฟๅถไฝ")Reverse bits of a given 32 bits unsigned integer.
diff --git a/problems/reverse-integer/README.md b/problems/reverse-integer/README.md index 26aaab012..354062cd9 100644 --- a/problems/reverse-integer/README.md +++ b/problems/reverse-integer/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/string-to-integer-atoi "String to Integer (atoi)") -## 7. Reverse Integer (Easy) +## [7. Reverse Integer (Easy)](https://leetcode.com/problems/reverse-integer "ๆดๆฐๅ่ฝฌ")Given a 32-bit signed integer, reverse digits of an integer.
diff --git a/problems/reverse-linked-list-ii/README.md b/problems/reverse-linked-list-ii/README.md index 3e1fc79b8..1fb6872ce 100644 --- a/problems/reverse-linked-list-ii/README.md +++ b/problems/reverse-linked-list-ii/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/restore-ip-addresses "Restore IP Addresses") -## 92. Reverse Linked List II (Medium) +## [92. Reverse Linked List II (Medium)](https://leetcode.com/problems/reverse-linked-list-ii "ๅ่ฝฌ้พ่กจ II")Reverse a linked list from position m to n. Do it in one-pass.
diff --git a/problems/reverse-linked-list/README.md b/problems/reverse-linked-list/README.md index f5f93a1b6..0ae9d3e1e 100644 --- a/problems/reverse-linked-list/README.md +++ b/problems/reverse-linked-list/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/course-schedule "Course Schedule") -## 206. Reverse Linked List (Easy) +## [206. Reverse Linked List (Easy)](https://leetcode.com/problems/reverse-linked-list "ๅ่ฝฌ้พ่กจ")Reverse a singly linked list.
diff --git a/problems/reverse-nodes-in-k-group/README.md b/problems/reverse-nodes-in-k-group/README.md index 2af932045..604789930 100644 --- a/problems/reverse-nodes-in-k-group/README.md +++ b/problems/reverse-nodes-in-k-group/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/remove-duplicates-from-sorted-array "Remove Duplicates from Sorted Array") -## 25. Reverse Nodes in k-Group (Hard) +## [25. Reverse Nodes in k-Group (Hard)](https://leetcode.com/problems/reverse-nodes-in-k-group "K ไธชไธ็ป็ฟป่ฝฌ้พ่กจ")Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.
diff --git a/problems/reverse-only-letters/README.md b/problems/reverse-only-letters/README.md index ddf0cedff..a44bee935 100644 --- a/problems/reverse-only-letters/README.md +++ b/problems/reverse-only-letters/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/maximum-sum-circular-subarray "Maximum Sum Circular Subarray") -## 917. Reverse Only Letters (Easy) +## [917. Reverse Only Letters (Easy)](https://leetcode.com/problems/reverse-only-letters "ไป ไป ๅ่ฝฌๅญๆฏ")Given a string S, return the "reversed" string where all characters that are not a letter stay in the same place, and all letters reverse their positions.
Given an array nums, we call (i, j) an important reverse pair if i < j and nums[i] > 2*nums[j].
Write a function that reverses a string. The input string is given as an array of characters char[].
Given a string s that consists of lower case English letters and brackets.
Hint 1
diff --git a/problems/reverse-vowels-of-a-string/README.md b/problems/reverse-vowels-of-a-string/README.md index 1dd2cf605..3b1c05b08 100644 --- a/problems/reverse-vowels-of-a-string/README.md +++ b/problems/reverse-vowels-of-a-string/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/moving-average-from-data-stream "Moving Average from Data Stream") -## 345. Reverse Vowels of a String (Easy) +## [345. Reverse Vowels of a String (Easy)](https://leetcode.com/problems/reverse-vowels-of-a-string "ๅ่ฝฌๅญ็ฌฆไธฒไธญ็ๅ ้ณๅญๆฏ")Write a function that takes a string as input and reverse only the vowels of a string.
diff --git a/problems/reverse-words-in-a-string-ii/README.md b/problems/reverse-words-in-a-string-ii/README.md index afee3c968..c56b97182 100644 --- a/problems/reverse-words-in-a-string-ii/README.md +++ b/problems/reverse-words-in-a-string-ii/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/repeated-dna-sequences "Repeated DNA Sequences") -## 186. Reverse Words in a String II (Medium) +## [186. Reverse Words in a String II (Medium)](https://leetcode.com/problems/reverse-words-in-a-string-ii "็ฟป่ฝฌๅญ็ฌฆไธฒ้็ๅ่ฏ II") diff --git a/problems/reverse-words-in-a-string-iii/README.md b/problems/reverse-words-in-a-string-iii/README.md index cc190c6e9..1186419ab 100644 --- a/problems/reverse-words-in-a-string-iii/README.md +++ b/problems/reverse-words-in-a-string-iii/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/quad-tree-intersection "Quad Tree Intersection") -## 557. Reverse Words in a String III (Easy) +## [557. Reverse Words in a String III (Easy)](https://leetcode.com/problems/reverse-words-in-a-string-iii "ๅ่ฝฌๅญ็ฌฆไธฒไธญ็ๅ่ฏ III")Given a string, you need to reverse the order of characters in each word within a sentence while still preserving whitespace and initial word order.
diff --git a/problems/reverse-words-in-a-string/README.md b/problems/reverse-words-in-a-string/README.md index 616d8b4cf..167067f44 100644 --- a/problems/reverse-words-in-a-string/README.md +++ b/problems/reverse-words-in-a-string/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/maximum-product-subarray "Maximum Product Subarray") -## 151. Reverse Words in a String (Medium) +## [151. Reverse Words in a String (Medium)](https://leetcode.com/problems/reverse-words-in-a-string "็ฟป่ฝฌๅญ็ฌฆไธฒ้็ๅ่ฏ")Given an input string, reverse the string word by word.
diff --git a/problems/rising-temperature/README.md b/problems/rising-temperature/README.md index 6b396a40a..cc63c72db 100644 --- a/problems/rising-temperature/README.md +++ b/problems/rising-temperature/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/house-robber "House Robber") -## 197. Rising Temperature (Easy) +## [197. Rising Temperature (Easy)](https://leetcode.com/problems/rising-temperature "ไธๅ็ๆธฉๅบฆ")Given a Weather table, write a SQL query to find all dates' Ids with higher temperature compared to its previous (yesterday's) dates.
Write an iterator that iterates through a run-length encoded sequence.
diff --git a/problems/robot-bounded-in-circle/README.md b/problems/robot-bounded-in-circle/README.md index e5215de95..29c9233ab 100644 --- a/problems/robot-bounded-in-circle/README.md +++ b/problems/robot-bounded-in-circle/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/flower-planting-with-no-adjacent "Flower Planting With No Adjacent") -## 1041. Robot Bounded In Circle (Easy) +## [1041. Robot Bounded In Circle (Easy)](https://leetcode.com/problems/robot-bounded-in-circle "ๅฐไบ็ฏไธญ็ๆบๅจไบบ")On an infinite plane, a robot initially stands at (0, 0) and faces north. The robot can receive one of three instructions:
There is a robot starting at position (0, 0), the origin, on a 2D plane. Given a sequence of its moves, judge if this robot ends up at (0, 0) after it completes its moves.
diff --git a/problems/robot-room-cleaner/README.md b/problems/robot-room-cleaner/README.md index ff1accea5..e08f5efd5 100644 --- a/problems/robot-room-cleaner/README.md +++ b/problems/robot-room-cleaner/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/the-maze "The Maze") -## 489. Robot Room Cleaner (Hard) +## [489. Robot Room Cleaner (Hard)](https://leetcode.com/problems/robot-room-cleaner "ๆซๅฐๆบๅจไบบ")Given a robot cleaner in a room modeled as a grid.
diff --git a/problems/roman-to-integer/README.md b/problems/roman-to-integer/README.md index 7d0dbe087..b9219902f 100644 --- a/problems/roman-to-integer/README.md +++ b/problems/roman-to-integer/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/longest-common-prefix "Longest Common Prefix") -## 13. Roman to Integer (Easy) +## [13. Roman to Integer (Easy)](https://leetcode.com/problems/roman-to-integer "็ฝ้ฉฌๆฐๅญ่ฝฌๆดๆฐ")Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M.
Given an array, rotate the array to the right by k steps, where k is non-negative.
diff --git a/problems/rotate-function/README.md b/problems/rotate-function/README.md index 07fa16f4e..849f8be48 100644 --- a/problems/rotate-function/README.md +++ b/problems/rotate-function/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/integer-replacement "Integer Replacement") -## 396. Rotate Function (Medium) +## [396. Rotate Function (Medium)](https://leetcode.com/problems/rotate-function "ๆ่ฝฌๅฝๆฐ")
Given an array of integers A and let n to be its length.
diff --git a/problems/rotate-image/README.md b/problems/rotate-image/README.md
index eeffd9159..ce9dd0479 100644
--- a/problems/rotate-image/README.md
+++ b/problems/rotate-image/README.md
@@ -9,7 +9,7 @@
ใใใใใใใใใใใใใใใใ
[Next >](https://github.com/openset/leetcode/tree/master/problems/group-anagrams "Group Anagrams")
-## 48. Rotate Image (Medium)
+## [48. Rotate Image (Medium)](https://leetcode.com/problems/rotate-image "ๆ่ฝฌๅพๅ")
You are given an n x n 2D matrix representing an image.
diff --git a/problems/rotate-list/README.md b/problems/rotate-list/README.md index 4537a73ef..0bd2abc1c 100644 --- a/problems/rotate-list/README.md +++ b/problems/rotate-list/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/unique-paths "Unique Paths") -## 61. Rotate List (Medium) +## [61. Rotate List (Medium)](https://leetcode.com/problems/rotate-list "ๆ่ฝฌ้พ่กจ")Given a linked list, rotate the list to the right by k places, where k is non-negative.
diff --git a/problems/rotate-string/README.md b/problems/rotate-string/README.md index 5fea16f2c..65bdefc83 100644 --- a/problems/rotate-string/README.md +++ b/problems/rotate-string/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/all-paths-from-source-to-target "All Paths From Source to Target") -## 796. Rotate String (Easy) +## [796. Rotate String (Easy)](https://leetcode.com/problems/rotate-string "ๆ่ฝฌๅญ็ฌฆไธฒ")We are given two strings, A and B.
X is a good number if after rotating each digit individually by 180 degrees, we get a valid number that is different from X. Each digit must be rotated - we cannot choose to leave it alone.
diff --git a/problems/rotting-oranges/README.md b/problems/rotting-oranges/README.md index ed415de14..80037e6f9 100644 --- a/problems/rotting-oranges/README.md +++ b/problems/rotting-oranges/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-number-of-k-consecutive-bit-flips "Minimum Number of K Consecutive Bit Flips") -## 994. Rotting Oranges (Easy) +## [994. Rotting Oranges (Easy)](https://leetcode.com/problems/rotting-oranges "่ ็็ๆฉๅญ")In a given grid, each cell can have one of three values:
diff --git a/problems/russian-doll-envelopes/README.md b/problems/russian-doll-envelopes/README.md index 1c89999e4..3c94eabcd 100644 --- a/problems/russian-doll-envelopes/README.md +++ b/problems/russian-doll-envelopes/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/design-twitter "Design Twitter") -## 354. Russian Doll Envelopes (Hard) +## [354. Russian Doll Envelopes (Hard)](https://leetcode.com/problems/russian-doll-envelopes "ไฟ็ฝๆฏๅฅๅจไฟกๅฐ้ฎ้ข")You have a number of envelopes with widths and heights given as a pair of integers (w, h). One envelope can fit into another if and only if both the width and height of one envelope is greater than the width and height of the other envelope.
Description
diff --git a/problems/same-tree/README.md b/problems/same-tree/README.md index 6a8401e6d..d9a6e5cd2 100644 --- a/problems/same-tree/README.md +++ b/problems/same-tree/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/symmetric-tree "Symmetric Tree") -## 100. Same Tree (Easy) +## [100. Same Tree (Easy)](https://leetcode.com/problems/same-tree "็ธๅ็ๆ ")Given two binary trees, write a function to check if they are the same or not.
diff --git a/problems/satisfiability-of-equality-equations/README.md b/problems/satisfiability-of-equality-equations/README.md index 2b9dace2e..703b43d29 100644 --- a/problems/satisfiability-of-equality-equations/README.md +++ b/problems/satisfiability-of-equality-equations/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/broken-calculator "Broken Calculator") -## 990. Satisfiability of Equality Equations (Medium) +## [990. Satisfiability of Equality Equations (Medium)](https://leetcode.com/problems/satisfiability-of-equality-equations "็ญๅผๆน็จ็ๅฏๆปก่ถณๆง")Given an array equations of strings that represent relationships between variables, each string equations[i] has length 4 and takes one of two different forms: "a==b" or "a!=b". Here, a and b are lowercase letters (not necessarily different) that represent one-letter variable names.
We have a two dimensional matrix A where each value is 0 or 1.
Given a balanced parentheses string S, compute the score of the string based on the following rule:
Given a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively.
diff --git a/problems/search-a-2d-matrix-ii/README.md b/problems/search-a-2d-matrix-ii/README.md index 9f6b18fc6..64030105e 100644 --- a/problems/search-a-2d-matrix-ii/README.md +++ b/problems/search-a-2d-matrix-ii/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/different-ways-to-add-parentheses "Different Ways to Add Parentheses") -## 240. Search a 2D Matrix II (Medium) +## [240. Search a 2D Matrix II (Medium)](https://leetcode.com/problems/search-a-2d-matrix-ii "ๆ็ดขไบ็ปด็ฉ้ต II")Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:
diff --git a/problems/search-a-2d-matrix/README.md b/problems/search-a-2d-matrix/README.md index 73c86dfaa..2d46926c8 100644 --- a/problems/search-a-2d-matrix/README.md +++ b/problems/search-a-2d-matrix/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/sort-colors "Sort Colors") -## 74. Search a 2D Matrix (Medium) +## [74. Search a 2D Matrix (Medium)](https://leetcode.com/problems/search-a-2d-matrix "ๆ็ดขไบ็ปด็ฉ้ต")Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:
diff --git a/problems/search-in-a-binary-search-tree/README.md b/problems/search-in-a-binary-search-tree/README.md index 2a4508688..e20122d20 100644 --- a/problems/search-in-a-binary-search-tree/README.md +++ b/problems/search-in-a-binary-search-tree/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/insert-into-a-binary-search-tree "Insert into a Binary Search Tree") -## 700. Search in a Binary Search Tree (Easy) +## [700. Search in a Binary Search Tree (Easy)](https://leetcode.com/problems/search-in-a-binary-search-tree "ไบๅๆ็ดขๆ ไธญ็ๆ็ดข")Given the root node of a binary search tree (BST) and a value. You need to find the node in the BST that the node's value equals the given value. Return the subtree rooted with that node. If such node doesn't exist, you should return NULL.
diff --git a/problems/search-in-a-sorted-array-of-unknown-size/README.md b/problems/search-in-a-sorted-array-of-unknown-size/README.md index 007fd221b..72b6b6836 100644 --- a/problems/search-in-a-sorted-array-of-unknown-size/README.md +++ b/problems/search-in-a-sorted-array-of-unknown-size/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/kth-largest-element-in-a-stream "Kth Largest Element in a Stream") -## 702. Search in a Sorted Array of Unknown Size (Medium) +## [702. Search in a Sorted Array of Unknown Size (Medium)](https://leetcode.com/problems/search-in-a-sorted-array-of-unknown-size "ๆ็ดข้ฟๅบฆๆช็ฅ็ๆๅบๆฐ็ป") diff --git a/problems/search-in-rotated-sorted-array-ii/README.md b/problems/search-in-rotated-sorted-array-ii/README.md index b2b83118b..8cf3d2d0d 100644 --- a/problems/search-in-rotated-sorted-array-ii/README.md +++ b/problems/search-in-rotated-sorted-array-ii/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/remove-duplicates-from-sorted-list-ii "Remove Duplicates from Sorted List II") -## 81. Search in Rotated Sorted Array II (Medium) +## [81. Search in Rotated Sorted Array II (Medium)](https://leetcode.com/problems/search-in-rotated-sorted-array-ii "ๆ็ดขๆ่ฝฌๆๅบๆฐ็ป II")Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.
diff --git a/problems/search-in-rotated-sorted-array/README.md b/problems/search-in-rotated-sorted-array/README.md index ca476cbb8..4068e77b2 100644 --- a/problems/search-in-rotated-sorted-array/README.md +++ b/problems/search-in-rotated-sorted-array/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/find-first-and-last-position-of-element-in-sorted-array "Find First and Last Position of Element in Sorted Array") -## 33. Search in Rotated Sorted Array (Medium) +## [33. Search in Rotated Sorted Array (Medium)](https://leetcode.com/problems/search-in-rotated-sorted-array "ๆ็ดขๆ่ฝฌๆๅบๆฐ็ป")Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.
diff --git a/problems/search-insert-position/README.md b/problems/search-insert-position/README.md index 82869288f..999e416f2 100644 --- a/problems/search-insert-position/README.md +++ b/problems/search-insert-position/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/valid-sudoku "Valid Sudoku") -## 35. Search Insert Position (Easy) +## [35. Search Insert Position (Easy)](https://leetcode.com/problems/search-insert-position "ๆ็ดขๆๅ ฅไฝ็ฝฎ")Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.
diff --git a/problems/second-degree-follower/README.md b/problems/second-degree-follower/README.md index bfddbf4f0..3c7805b72 100644 --- a/problems/second-degree-follower/README.md +++ b/problems/second-degree-follower/README.md @@ -9,6 +9,6 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/average-salary-departments-vs-company "Average Salary: Departments VS Company") -## 614. Second Degree Follower (Medium) +## [614. Second Degree Follower (Medium)](https://leetcode.com/problems/second-degree-follower "ไบ็บงๅ ณๆณจ่ ") diff --git a/problems/second-highest-salary/README.md b/problems/second-highest-salary/README.md index c0cc34814..392232b96 100644 --- a/problems/second-highest-salary/README.md +++ b/problems/second-highest-salary/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/nth-highest-salary "Nth Highest Salary") -## 176. Second Highest Salary (Easy) +## [176. Second Highest Salary (Easy)](https://leetcode.com/problems/second-highest-salary "็ฌฌไบ้ซ็่ชๆฐด")Write a SQL query to get the second highest salary from the Employee table.
Given a non-empty special binary tree consisting of nodes with the non-negative value, where each node in this tree has exactly two or zero sub-node. If the node has two sub-nodes, then this node's value is the smaller value among its two sub-nodes. More formally, the property root.val = min(root.left.val, root.right.val) always holds.
You are given an array x of n positive numbers. You start at point (0,0) and moves x[0] metres to the north, then x[1] metres to the west, x[2] metres to the south, x[3] metres to the east and so on. In other words, after each move your direction changes counter-clockwise.
A self-dividing number is a number that is divisible by every digit it contains. diff --git a/problems/sentence-screen-fitting/README.md b/problems/sentence-screen-fitting/README.md index cc6361d1d..0887c09a7 100644 --- a/problems/sentence-screen-fitting/README.md +++ b/problems/sentence-screen-fitting/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/battleships-in-a-board "Battleships in a Board") -## 418. Sentence Screen Fitting (Medium) +## [418. Sentence Screen Fitting (Medium)](https://leetcode.com/problems/sentence-screen-fitting "ๅฑๅนๅฏๆพ็คบๅฅๅญ็ๆฐ้") diff --git a/problems/sentence-similarity-ii/README.md b/problems/sentence-similarity-ii/README.md index 8d280b680..718056141 100644 --- a/problems/sentence-similarity-ii/README.md +++ b/problems/sentence-similarity-ii/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/monotone-increasing-digits "Monotone Increasing Digits") -## 737. Sentence Similarity II (Medium) +## [737. Sentence Similarity II (Medium)](https://leetcode.com/problems/sentence-similarity-ii "ๅฅๅญ็ธไผผๆง II") diff --git a/problems/sentence-similarity/README.md b/problems/sentence-similarity/README.md index 7f7132911..c37210a1f 100644 --- a/problems/sentence-similarity/README.md +++ b/problems/sentence-similarity/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/asteroid-collision "Asteroid Collision") -## 734. Sentence Similarity (Easy) +## [734. Sentence Similarity (Easy)](https://leetcode.com/problems/sentence-similarity "ๅฅๅญ็ธไผผๆง") diff --git a/problems/sequence-reconstruction/README.md b/problems/sequence-reconstruction/README.md index a8b4638b7..b81abb5ce 100644 --- a/problems/sequence-reconstruction/README.md +++ b/problems/sequence-reconstruction/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/add-two-numbers-ii "Add Two Numbers II") -## 444. Sequence Reconstruction (Medium) +## [444. Sequence Reconstruction (Medium)](https://leetcode.com/problems/sequence-reconstruction "ๅบๅ้ๅปบ") diff --git a/problems/serialize-and-deserialize-binary-tree/README.md b/problems/serialize-and-deserialize-binary-tree/README.md index 5cb05e80f..839b482f4 100644 --- a/problems/serialize-and-deserialize-binary-tree/README.md +++ b/problems/serialize-and-deserialize-binary-tree/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/binary-tree-longest-consecutive-sequence "Binary Tree Longest Consecutive Sequence") -## 297. Serialize and Deserialize Binary Tree (Hard) +## [297. Serialize and Deserialize Binary Tree (Hard)](https://leetcode.com/problems/serialize-and-deserialize-binary-tree "ไบๅๆ ็ๅบๅๅไธๅๅบๅๅ")
Serialization is the process of converting a data structure or object into a sequence of bits so that it can be stored in a file or memory buffer, or transmitted across a network connection link to be reconstructed later in the same or another computer environment.
diff --git a/problems/serialize-and-deserialize-bst/README.md b/problems/serialize-and-deserialize-bst/README.md index dae187bad..774273e13 100644 --- a/problems/serialize-and-deserialize-bst/README.md +++ b/problems/serialize-and-deserialize-bst/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/delete-node-in-a-bst "Delete Node in a BST") -## 449. Serialize and Deserialize BST (Medium) +## [449. Serialize and Deserialize BST (Medium)](https://leetcode.com/problems/serialize-and-deserialize-bst "ๅบๅๅๅๅๅบๅๅไบๅๆ็ดขๆ ")Serialization is the process of converting a data structure or object into a sequence of bits so that it can be stored in a file or memory buffer, or transmitted across a network connection link to be reconstructed later in the same or another computer environment.
diff --git a/problems/serialize-and-deserialize-n-ary-tree/README.md b/problems/serialize-and-deserialize-n-ary-tree/README.md index 0a5e7f732..3f53be3f6 100644 --- a/problems/serialize-and-deserialize-n-ary-tree/README.md +++ b/problems/serialize-and-deserialize-n-ary-tree/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/n-ary-tree-level-order-traversal "N-ary Tree Level Order Traversal") -## 428. Serialize and Deserialize N-ary Tree (Hard) +## [428. Serialize and Deserialize N-ary Tree (Hard)](https://leetcode.com/problems/serialize-and-deserialize-n-ary-tree "ๅบๅๅๅๅๅบๅๅ N ๅๆ ") diff --git a/problems/set-intersection-size-at-least-two/README.md b/problems/set-intersection-size-at-least-two/README.md index bd8255f7b..5e31e5660 100644 --- a/problems/set-intersection-size-at-least-two/README.md +++ b/problems/set-intersection-size-at-least-two/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/bold-words-in-string "Bold Words in String") -## 757. Set Intersection Size At Least Two (Hard) +## [757. Set Intersection Size At Least Two (Hard)](https://leetcode.com/problems/set-intersection-size-at-least-two " ่ฎพ็ฝฎไบค้ๅคงๅฐ่ณๅฐไธบ2")
An integer interval [a, b] (for integers a < b) is a set of all consecutive integers from a to b, including a and b.
diff --git a/problems/set-matrix-zeroes/README.md b/problems/set-matrix-zeroes/README.md
index d2e0c1935..1b09a82e9 100644
--- a/problems/set-matrix-zeroes/README.md
+++ b/problems/set-matrix-zeroes/README.md
@@ -9,7 +9,7 @@
ใใใใใใใใใใใใใใใใ
[Next >](https://github.com/openset/leetcode/tree/master/problems/search-a-2d-matrix "Search a 2D Matrix")
-## 73. Set Matrix Zeroes (Medium)
+## [73. Set Matrix Zeroes (Medium)](https://leetcode.com/problems/set-matrix-zeroes "็ฉ้ต็ฝฎ้ถ")
Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in-place.
diff --git a/problems/set-mismatch/README.md b/problems/set-mismatch/README.md index c2da7a4bb..6b7304a8f 100644 --- a/problems/set-mismatch/README.md +++ b/problems/set-mismatch/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/maximum-length-of-pair-chain "Maximum Length of Pair Chain") -## 645. Set Mismatch (Easy) +## [645. Set Mismatch (Easy)](https://leetcode.com/problems/set-mismatch "้่ฏฏ็้ๅ")
The set S originally contains numbers from 1 to n. But unfortunately, due to the data error, one of the numbers in the set got duplicated to another number in the set, which results in repetition of one number and loss of another number.
diff --git a/problems/shifting-letters/README.md b/problems/shifting-letters/README.md
index f905935b9..ad1ce0a73 100644
--- a/problems/shifting-letters/README.md
+++ b/problems/shifting-letters/README.md
@@ -9,7 +9,7 @@
ใใใใใใใใใใใใใใใใ
[Next >](https://github.com/openset/leetcode/tree/master/problems/maximize-distance-to-closest-person "Maximize Distance to Closest Person")
-## 848. Shifting Letters (Medium)
+## [848. Shifting Letters (Medium)](https://leetcode.com/problems/shifting-letters "ๅญๆฏ็งปไฝ")
We have a string S of lowercase letters, and an integer array shifts.
In LeetCode Store, there are some kinds of items to sell. Each item has a price. diff --git a/problems/short-encoding-of-words/README.md b/problems/short-encoding-of-words/README.md index e9041cd24..ee2d7e0a5 100644 --- a/problems/short-encoding-of-words/README.md +++ b/problems/short-encoding-of-words/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/shortest-distance-to-a-character "Shortest Distance to a Character") -## 820. Short Encoding of Words (Medium) +## [820. Short Encoding of Words (Medium)](https://leetcode.com/problems/short-encoding-of-words "ๅ่ฏ็ๅ็ผฉ็ผ็ ")
Given a list of words, we may encode it by writing a reference string S and a list of indexes A.
In a given 2D binary array A, there are two islands. (An island is a 4-directionally connected group of 1s not connected to any other 1s.)
Given two strings str1 and str2, return the shortest string that has both str1 and str2 as subsequences. If multiple answers exist, you may return any of them.
Find the minimum length word from a given dictionary words, which has all the letters from the string licensePlate. Such a word is said to complete the given string licensePlate
diff --git a/problems/shortest-distance-from-all-buildings/README.md b/problems/shortest-distance-from-all-buildings/README.md
index d075a9d7f..4f3fa79c6 100644
--- a/problems/shortest-distance-from-all-buildings/README.md
+++ b/problems/shortest-distance-from-all-buildings/README.md
@@ -9,7 +9,7 @@
ใใใใใใใใใใใใใใใใ
[Next >](https://github.com/openset/leetcode/tree/master/problems/maximum-product-of-word-lengths "Maximum Product of Word Lengths")
-## 317. Shortest Distance from All Buildings (Hard)
+## [317. Shortest Distance from All Buildings (Hard)](https://leetcode.com/problems/shortest-distance-from-all-buildings "็ฆปๅปบ็ญ็ฉๆ่ฟ็่ท็ฆป")
diff --git a/problems/shortest-distance-in-a-line/README.md b/problems/shortest-distance-in-a-line/README.md
index 238426540..ce7c1d9d7 100644
--- a/problems/shortest-distance-in-a-line/README.md
+++ b/problems/shortest-distance-in-a-line/README.md
@@ -9,7 +9,7 @@
ใใใใใใใใใใใใใใใใ
[Next >](https://github.com/openset/leetcode/tree/master/problems/second-degree-follower "Second Degree Follower")
-## 613. Shortest Distance in a Line (Easy)
+## [613. Shortest Distance in a Line (Easy)](https://leetcode.com/problems/shortest-distance-in-a-line "็ด็บฟไธ็ๆ่ฟ่ท็ฆป")
Table point holds the x coordinate of some points on x-axis in a plane, which are all integers.
diff --git a/problems/shortest-distance-in-a-plane/README.md b/problems/shortest-distance-in-a-plane/README.md index f2acc5a17..46d62568c 100644 --- a/problems/shortest-distance-in-a-plane/README.md +++ b/problems/shortest-distance-in-a-plane/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/shortest-distance-in-a-line "Shortest Distance in a Line") -## 612. Shortest Distance in a Plane (Medium) +## [612. Shortest Distance in a Plane (Medium)](https://leetcode.com/problems/shortest-distance-in-a-plane "ๅนณ้ขไธ็ๆ่ฟ่ท็ฆป") Table
point_2d holds the coordinates (x,y) of some unique points (more than two) in a plane.
diff --git a/problems/shortest-distance-to-a-character/README.md b/problems/shortest-distance-to-a-character/README.md index fbb41c88f..1c714fc50 100644 --- a/problems/shortest-distance-to-a-character/README.md +++ b/problems/shortest-distance-to-a-character/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/card-flipping-game "Card Flipping Game") -## 821. Shortest Distance to a Character (Easy) +## [821. Shortest Distance to a Character (Easy)](https://leetcode.com/problems/shortest-distance-to-a-character "ๅญ็ฌฆ็ๆ็ญ่ท็ฆป")
Given a string S and a character C, return an array of integers representing the shortest distance from the character C in the string.
Given a string s, you are allowed to convert it to a palindrome by adding characters in front of it. Find and return the shortest palindrome you can find by performing this transformation.
diff --git a/problems/shortest-path-in-binary-matrix/README.md b/problems/shortest-path-in-binary-matrix/README.md index f527c5ad9..f088a2f79 100644 --- a/problems/shortest-path-in-binary-matrix/README.md +++ b/problems/shortest-path-in-binary-matrix/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/shortest-common-supersequence "Shortest Common Supersequence ") -## 1091. Shortest Path in Binary Matrix (Medium) +## [1091. Shortest Path in Binary Matrix (Medium)](https://leetcode.com/problems/shortest-path-in-binary-matrix "ไบ่ฟๅถ็ฉ้ตไธญ็ๆ็ญ่ทฏๅพ")In an N by N square grid, each cell is either empty (0) or blocked (1).
diff --git a/problems/shortest-path-to-get-all-keys/README.md b/problems/shortest-path-to-get-all-keys/README.md index b6db88f4f..5c3934946 100644 --- a/problems/shortest-path-to-get-all-keys/README.md +++ b/problems/shortest-path-to-get-all-keys/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/smallest-subtree-with-all-the-deepest-nodes "Smallest Subtree with all the Deepest Nodes") -## 864. Shortest Path to Get All Keys (Hard) +## [864. Shortest Path to Get All Keys (Hard)](https://leetcode.com/problems/shortest-path-to-get-all-keys "่ทๅๆๆ้ฅๅ็ๆ็ญ่ทฏๅพ")We are given a 2-dimensional grid. "." is an empty cell, "#" is a wall, "@" is the starting point, ("a", "b", ...) are keys, and ("A", "B", ...) are locks.
An undirected, connected graph of N nodes (labeled 0, 1, 2, ..., N-1) is given as graph.
Consider a directed graph, with nodes labelled 0, 1, ..., n-1. In this graph, each edge is either red or blue, and there could be self-edges or parallel edges.
Return the length of the shortest, non-empty, contiguous subarray of A with sum at least K.
Given an integer array, you need to find one continuous subarray that if you only sort this subarray in ascending order, then the whole array will be sorted in ascending order, too.
diff --git a/problems/shortest-way-to-form-string/README.md b/problems/shortest-way-to-form-string/README.md index c125a97ca..def04c26d 100644 --- a/problems/shortest-way-to-form-string/README.md +++ b/problems/shortest-way-to-form-string/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/confusing-number "Confusing Number") -## 1055. Shortest Way to Form String (Medium) +## [1055. Shortest Way to Form String (Medium)](https://leetcode.com/problems/shortest-way-to-form-string "ๅฝขๆๅญ็ฌฆไธฒ็ๆ็ญ่ทฏๅพ")From any string, we can form a subsequence of that string by deleting some number of characters (possibly no deletions).
diff --git a/problems/shortest-word-distance-ii/README.md b/problems/shortest-word-distance-ii/README.md index 4ae33f15e..5394c03f5 100644 --- a/problems/shortest-word-distance-ii/README.md +++ b/problems/shortest-word-distance-ii/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/shortest-word-distance-iii "Shortest Word Distance III") -## 244. Shortest Word Distance II (Medium) +## [244. Shortest Word Distance II (Medium)](https://leetcode.com/problems/shortest-word-distance-ii "ๆ็ญๅ่ฏ่ท็ฆป II")Design a class which receives a list of words in the constructor, and implements a method that takes two words word1 and word2 and return the shortest distance between these two words in the list. Your method will be called repeatedly many times with different parameters.
diff --git a/problems/shortest-word-distance-iii/README.md b/problems/shortest-word-distance-iii/README.md index 26234c702..72cc49a5c 100644 --- a/problems/shortest-word-distance-iii/README.md +++ b/problems/shortest-word-distance-iii/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/strobogrammatic-number "Strobogrammatic Number") -## 245. Shortest Word Distance III (Medium) +## [245. Shortest Word Distance III (Medium)](https://leetcode.com/problems/shortest-word-distance-iii "ๆ็ญๅ่ฏ่ท็ฆป III") diff --git a/problems/shortest-word-distance/README.md b/problems/shortest-word-distance/README.md index ce59824e2..f41e86b44 100644 --- a/problems/shortest-word-distance/README.md +++ b/problems/shortest-word-distance/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/shortest-word-distance-ii "Shortest Word Distance II") -## 243. Shortest Word Distance (Easy) +## [243. Shortest Word Distance (Easy)](https://leetcode.com/problems/shortest-word-distance "ๆ็ญๅ่ฏ่ท็ฆป") diff --git a/problems/shuffle-an-array/README.md b/problems/shuffle-an-array/README.md index 4dc25e116..4967f053e 100644 --- a/problems/shuffle-an-array/README.md +++ b/problems/shuffle-an-array/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/mini-parser "Mini Parser") -## 384. Shuffle an Array (Medium) +## [384. Shuffle an Array (Medium)](https://leetcode.com/problems/shuffle-an-array "ๆไนฑๆฐ็ป")Shuffle a set of numbers without duplicates.
diff --git a/problems/similar-rgb-color/README.md b/problems/similar-rgb-color/README.md index a3c680331..a858c7cac 100644 --- a/problems/similar-rgb-color/README.md +++ b/problems/similar-rgb-color/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-swaps-to-make-sequences-increasing "Minimum Swaps To Make Sequences Increasing") -## 800. Similar RGB Color (Easy) +## [800. Similar RGB Color (Easy)](https://leetcode.com/problems/similar-rgb-color "็ธไผผ RGB ้ข่ฒ") diff --git a/problems/similar-string-groups/README.md b/problems/similar-string-groups/README.md index dff83aae5..26d131081 100644 --- a/problems/similar-string-groups/README.md +++ b/problems/similar-string-groups/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/magic-squares-in-grid "Magic Squares In Grid") -## 839. Similar String Groups (Hard) +## [839. Similar String Groups (Hard)](https://leetcode.com/problems/similar-string-groups "็ธไผผๅญ็ฌฆไธฒ็ป")Two strings X and Y are similar if we can swap two letters (in different positions) of X, so that it equals Y.
Given an absolute path for a file (Unix-style), simplify it. Or in other words, convert it to the canonical path.
diff --git a/problems/single-element-in-a-sorted-array/README.md b/problems/single-element-in-a-sorted-array/README.md index 038a7ecaf..87855cd0e 100644 --- a/problems/single-element-in-a-sorted-array/README.md +++ b/problems/single-element-in-a-sorted-array/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/reverse-string-ii "Reverse String II") -## 540. Single Element in a Sorted Array (Medium) +## [540. Single Element in a Sorted Array (Medium)](https://leetcode.com/problems/single-element-in-a-sorted-array "ๆๅบๆฐ็ปไธญ็ๅไธๅ ็ด ")Given a sorted array consisting of only integers where every element appears exactly twice except for one element which appears exactly once. Find this single element that appears only once.
diff --git a/problems/single-number-ii/README.md b/problems/single-number-ii/README.md index 2d267629d..02aad374a 100644 --- a/problems/single-number-ii/README.md +++ b/problems/single-number-ii/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/copy-list-with-random-pointer "Copy List with Random Pointer") -## 137. Single Number II (Medium) +## [137. Single Number II (Medium)](https://leetcode.com/problems/single-number-ii "ๅชๅบ็ฐไธๆฌก็ๆฐๅญ II")Given a non-empty array of integers, every element appears three times except for one, which appears exactly once. Find that single one.
diff --git a/problems/single-number-iii/README.md b/problems/single-number-iii/README.md index dc2d6b68d..e2e795866 100644 --- a/problems/single-number-iii/README.md +++ b/problems/single-number-iii/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/graph-valid-tree "Graph Valid Tree") -## 260. Single Number III (Medium) +## [260. Single Number III (Medium)](https://leetcode.com/problems/single-number-iii "ๅชๅบ็ฐไธๆฌก็ๆฐๅญ III")Given an array of numbers nums, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only once.
Given a non-empty array of integers, every element appears twice except for one. Find that single one.
diff --git a/problems/single-row-keyboard/README.md b/problems/single-row-keyboard/README.md index 876c7fb02..8134bd51f 100644 --- a/problems/single-row-keyboard/README.md +++ b/problems/single-row-keyboard/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/design-file-system "Design File System") -## 1165. Single-Row Keyboard (Easy) +## [1165. Single-Row Keyboard (Easy)](https://leetcode.com/problems/single-row-keyboard "ๅ่ก้ฎ็") diff --git a/problems/sliding-puzzle/README.md b/problems/sliding-puzzle/README.md index 425ce7a6e..b90bf71d6 100644 --- a/problems/sliding-puzzle/README.md +++ b/problems/sliding-puzzle/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/minimize-max-distance-to-gas-station "Minimize Max Distance to Gas Station") -## 773. Sliding Puzzle (Hard) +## [773. Sliding Puzzle (Hard)](https://leetcode.com/problems/sliding-puzzle "ๆปๅจ่ฐ้ข")On a 2x3 board, there are 5 tiles represented by the integers 1 through 5, and an empty square represented by 0.
Given an array nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k numbers in the window. Each time the sliding window moves right by one position. Return the max sliding window.
diff --git a/problems/sliding-window-median/README.md b/problems/sliding-window-median/README.md index 9cf715ae2..45164b7fc 100644 --- a/problems/sliding-window-median/README.md +++ b/problems/sliding-window-median/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/magical-string "Magical String") -## 480. Sliding Window Median (Hard) +## [480. Sliding Window Median (Hard)](https://leetcode.com/problems/sliding-window-median "ๆปๅจ็ชๅฃไธญไฝๆฐ")Median is the middle value in an ordered integer list. If the size of the list is even, there is no middle value. So the median is the mean of the two middle value.
Examples:diff --git a/problems/smallest-good-base/README.md b/problems/smallest-good-base/README.md index 3f3d2da94..8cb829d8d 100644 --- a/problems/smallest-good-base/README.md +++ b/problems/smallest-good-base/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/find-permutation "Find Permutation") -## 483. Smallest Good Base (Hard) +## [483. Smallest Good Base (Hard)](https://leetcode.com/problems/smallest-good-base "ๆๅฐๅฅฝ่ฟๅถ")
For an integer n, we call k>=2 a good base of n, if all digits of n base k are 1.
diff --git a/problems/smallest-integer-divisible-by-k/README.md b/problems/smallest-integer-divisible-by-k/README.md index 4c1cdbfd2..4b56149a4 100644 --- a/problems/smallest-integer-divisible-by-k/README.md +++ b/problems/smallest-integer-divisible-by-k/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/binary-string-with-substrings-representing-1-to-n "Binary String With Substrings Representing 1 To N") -## 1015. Smallest Integer Divisible by K (Medium) +## [1015. Smallest Integer Divisible by K (Medium)](https://leetcode.com/problems/smallest-integer-divisible-by-k "ๅฏ่ขซ K ๆด้ค็ๆๅฐๆดๆฐ")Given a positive integer K, you need find the smallest positive integer N such that N is divisible by K, and N only contains the digit 1.
You have k lists of sorted integers in ascending order. Find the smallest range that includes at least one number from each of the k lists.
Given an array A of integers, for each integer A[i] we may choose any x with -K <= x <= K, and add x to A[i].
Given an array A of integers, for each integer A[i] we need to choose either x = -K or x = K, and add x to A[i] (only once).
Given an array A, we may rotate it by a non-negative integer K so that the array becomes A[K], A[K+1], A{K+2], ... A[A.length - 1], A[0], A[1], ..., A[K-1]. Afterward, any entries that are less than or equal to their index are worth 1 point.
Given the root of a binary tree, each node has a value from 0 to 25 representing the letters 'a' to 'z': a value of 0 represents 'a', a value of 1 represents 'b', and so on.
Return the lexicographically smallest subsequence of text that contains all the distinct characters of text exactly once.
Given a binary tree rooted at root, the depth of each node is the shortest distance to the root.
In a project, you have a list of required skills req_skills, and a list of people. The i-th person people[i] contains a list of skills that person has.
On an N x N board, the numbers from 1 to N*N are written boustrophedonically starting from the bottom left of the board, and alternating direction each row. For example, for a 6 x 6 board, the numbers are written as follows:
Implement a SnapshotArray that supports the following interface:
@@ -47,3 +47,9 @@ snapshotArr.get(0,0); // Get the value of array[0] with snap_id = 0, return 5 +Hint 1
+Use a list of lists, adding both the element and the snap_id to each index. +
Solve a given equation and return the value of x in the form of string "x=#value". The equation contains only '+', '-' operation, the variable x and its coefficient.
diff --git a/problems/sort-an-array/README.md b/problems/sort-an-array/README.md
index 8a2fd5a5e..86a14b810 100644
--- a/problems/sort-an-array/README.md
+++ b/problems/sort-an-array/README.md
@@ -9,7 +9,7 @@
ใใใใใใใใใใใใใใใใ
[Next >](https://github.com/openset/leetcode/tree/master/problems/cat-and-mouse "Cat and Mouse")
-## 912. Sort an Array (Medium)
+## [912. Sort an Array (Medium)](https://leetcode.com/problems/sort-an-array "ๆๅบๆฐ็ป")
Given an array of integers nums, sort the array in ascending order.
Given an array A of non-negative integers, half of the integers in A are odd, and half of the integers are even.
Given an array A of non-negative integers, return an array consisting of all the even elements of A, followed by all the odd elements of A.
Given a string, sort it in decreasing order based on the frequency of characters.
diff --git a/problems/sort-colors/README.md b/problems/sort-colors/README.md index 1dea170db..19bdefc03 100644 --- a/problems/sort-colors/README.md +++ b/problems/sort-colors/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-window-substring "Minimum Window Substring") -## 75. Sort Colors (Medium) +## [75. Sort Colors (Medium)](https://leetcode.com/problems/sort-colors "้ข่ฒๅ็ฑป")Given an array with n objects colored red, white or blue, sort them in-place so that objects of the same color are adjacent, with the colors in the order red, white and blue.
diff --git a/problems/sort-list/README.md b/problems/sort-list/README.md index 6c9317167..1d555210d 100644 --- a/problems/sort-list/README.md +++ b/problems/sort-list/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/max-points-on-a-line "Max Points on a Line") -## 148. Sort List (Medium) +## [148. Sort List (Medium)](https://leetcode.com/problems/sort-list "ๆๅบ้พ่กจ")Sort a linked list in O(n log n) time using constant space complexity.
diff --git a/problems/sort-transformed-array/README.md b/problems/sort-transformed-array/README.md index 1ca066033..87c29e422 100644 --- a/problems/sort-transformed-array/README.md +++ b/problems/sort-transformed-array/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/bomb-enemy "Bomb Enemy") -## 360. Sort Transformed Array (Medium) +## [360. Sort Transformed Array (Medium)](https://leetcode.com/problems/sort-transformed-array "ๆๅบ่ฝฌๅๆฐ็ป") diff --git a/problems/soup-servings/README.md b/problems/soup-servings/README.md index 5366aa3f9..9dfdf605e 100644 --- a/problems/soup-servings/README.md +++ b/problems/soup-servings/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/expressive-words "Expressive Words") -## 808. Soup Servings (Medium) +## [808. Soup Servings (Medium)](https://leetcode.com/problems/soup-servings "ๅๆฑค")There are two types of soup: type A and type B. Initially we have N ml of each type of soup. There are four kinds of operations:
Special binary strings are binary strings with the following two properties: diff --git a/problems/spiral-matrix-ii/README.md b/problems/spiral-matrix-ii/README.md index 468b13e29..29527da56 100644 --- a/problems/spiral-matrix-ii/README.md +++ b/problems/spiral-matrix-ii/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/permutation-sequence "Permutation Sequence") -## 59. Spiral Matrix II (Medium) +## [59. Spiral Matrix II (Medium)](https://leetcode.com/problems/spiral-matrix-ii "่บๆ็ฉ้ต II")
Given a positive integer n, generate a square matrix filled with elements from 1 to n2 in spiral order.
diff --git a/problems/spiral-matrix-iii/README.md b/problems/spiral-matrix-iii/README.md index 5da874885..d3abbd192 100644 --- a/problems/spiral-matrix-iii/README.md +++ b/problems/spiral-matrix-iii/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/possible-bipartition "Possible Bipartition") -## 885. Spiral Matrix III (Medium) +## [885. Spiral Matrix III (Medium)](https://leetcode.com/problems/spiral-matrix-iii "่บๆ็ฉ้ต III")On a 2 dimensional grid with R rows and C columns, we start at (r0, c0) facing east.
Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order.
diff --git a/problems/split-array-into-consecutive-subsequences/README.md b/problems/split-array-into-consecutive-subsequences/README.md index 858c92ecc..287faba86 100644 --- a/problems/split-array-into-consecutive-subsequences/README.md +++ b/problems/split-array-into-consecutive-subsequences/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/remove-9 "Remove 9") -## 659. Split Array into Consecutive Subsequences (Medium) +## [659. Split Array into Consecutive Subsequences (Medium)](https://leetcode.com/problems/split-array-into-consecutive-subsequences "ๅๅฒๆฐ็ปไธบ่ฟ็ปญๅญๅบๅ")You are given an integer array sorted in ascending order (may contain duplicates), you need to split them into several subsequences, where each subsequences consist of at least 3 consecutive integers. Return whether you can make such a split.
diff --git a/problems/split-array-into-fibonacci-sequence/README.md b/problems/split-array-into-fibonacci-sequence/README.md index bfb07e6e9..f8894b2a4 100644 --- a/problems/split-array-into-fibonacci-sequence/README.md +++ b/problems/split-array-into-fibonacci-sequence/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/guess-the-word "Guess the Word") -## 842. Split Array into Fibonacci Sequence (Medium) +## [842. Split Array into Fibonacci Sequence (Medium)](https://leetcode.com/problems/split-array-into-fibonacci-sequence "ๅฐๆฐ็ปๆๅๆๆๆณข้ฃๅฅๅบๅ")Given a string S of digits, such as S = "123456579", we can split it into a Fibonacci-like sequence [123, 456, 579].
Given an array which consists of non-negative integers and an integer m, you can split the array into m non-empty continuous subarrays. Write an algorithm to minimize the largest sum among these m subarrays.
diff --git a/problems/split-array-with-equal-sum/README.md b/problems/split-array-with-equal-sum/README.md index 7cacc4eb7..ab71d2a75 100644 --- a/problems/split-array-with-equal-sum/README.md +++ b/problems/split-array-with-equal-sum/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/binary-tree-longest-consecutive-sequence-ii "Binary Tree Longest Consecutive Sequence II") -## 548. Split Array with Equal Sum (Medium) +## [548. Split Array with Equal Sum (Medium)](https://leetcode.com/problems/split-array-with-equal-sum "ๅฐๆฐ็ปๅๅฒๆๅ็ธ็ญ็ๅญๆฐ็ป") diff --git a/problems/split-array-with-same-average/README.md b/problems/split-array-with-same-average/README.md index 92ee42f3f..14aa922d2 100644 --- a/problems/split-array-with-same-average/README.md +++ b/problems/split-array-with-same-average/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/number-of-lines-to-write-string "Number of Lines To Write String") -## 805. Split Array With Same Average (Hard) +## [805. Split Array With Same Average (Hard)](https://leetcode.com/problems/split-array-with-same-average "ๆฐ็ป็ๅๅผๅๅฒ")In a given integer array A, we must move every element of A to either list B or list C. (B and C initially start empty.)
diff --git a/problems/split-bst/README.md b/problems/split-bst/README.md index 903c37c95..ce2787206 100644 --- a/problems/split-bst/README.md +++ b/problems/split-bst/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/swap-adjacent-in-lr-string "Swap Adjacent in LR String") -## 776. Split BST (Medium) +## [776. Split BST (Medium)](https://leetcode.com/problems/split-bst "ๆๅไบๅๆ็ดขๆ ") diff --git a/problems/split-concatenated-strings/README.md b/problems/split-concatenated-strings/README.md index c4ce46658..3f74d82cd 100644 --- a/problems/split-concatenated-strings/README.md +++ b/problems/split-concatenated-strings/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/next-greater-element-iii "Next Greater Element III") -## 555. Split Concatenated Strings (Medium) +## [555. Split Concatenated Strings (Medium)](https://leetcode.com/problems/split-concatenated-strings "ๅๅฒ่ฟๆฅๅญ็ฌฆไธฒ") diff --git a/problems/split-linked-list-in-parts/README.md b/problems/split-linked-list-in-parts/README.md index 4ca05923e..f068af239 100644 --- a/problems/split-linked-list-in-parts/README.md +++ b/problems/split-linked-list-in-parts/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/number-of-atoms "Number of Atoms") -## 725. Split Linked List in Parts (Medium) +## [725. Split Linked List in Parts (Medium)](https://leetcode.com/problems/split-linked-list-in-parts "ๅ้้พ่กจ")Given a (singly) linked list with head node root, write a function to split the linked list into k consecutive linked list "parts".
diff --git a/problems/sqrtx/README.md b/problems/sqrtx/README.md index 2c330164c..678ff80fb 100644 --- a/problems/sqrtx/README.md +++ b/problems/sqrtx/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/climbing-stairs "Climbing Stairs") -## 69. Sqrt(x) (Easy) +## [69. Sqrt(x) (Easy)](https://leetcode.com/problems/sqrtx "x ็ๅนณๆนๆ น")
Implement int sqrt(int x).
Given an array of integers A sorted in non-decreasing order, return an array of the squares of each number, also in sorted non-decreasing order.
Example 1:
diff --git a/problems/stamping-the-sequence/README.md b/problems/stamping-the-sequence/README.md index 24b2ead28..028e2a4ba 100644 --- a/problems/stamping-the-sequence/README.md +++ b/problems/stamping-the-sequence/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/reorder-data-in-log-files "Reorder Data in Log Files") -## 936. Stamping The Sequence (Hard) +## [936. Stamping The Sequence (Hard)](https://leetcode.com/problems/stamping-the-sequence "ๆณๅฐๅบๅ")You want to form a target string of lowercase letters.
We sampled integers between 0 and 255, and stored the results in an array count: count[k] is the number of integers we sampled equal to k.
We are given N different types of stickers. Each sticker has a lowercase English word on it. diff --git a/problems/stone-game-ii/README.md b/problems/stone-game-ii/README.md index 6e1738db5..e4852a44c 100644 --- a/problems/stone-game-ii/README.md +++ b/problems/stone-game-ii/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/user-activity-for-the-past-30-days-i "User Activity for the Past 30 Days I") -## 1140. Stone Game II (Medium) +## [1140. Stone Game II (Medium)](https://leetcode.com/problems/stone-game-ii "็ณๅญๆธธๆ II")
Alex and Lee continue their games with piles of stones. There are a number of piles arranged in a row, and each pile has a positive integer number of stones piles[i]. The objective of the game is to end with the most stones.
Alex and Lee play a game with piles of stones. There are an even number of piles arranged in a row, and each pile has a positive integer number of stones piles[i].
There is a strange printer with the following two special requirements: diff --git a/problems/stream-of-characters/README.md b/problems/stream-of-characters/README.md index 4ffbe24e4..6660187fc 100644 --- a/problems/stream-of-characters/README.md +++ b/problems/stream-of-characters/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/moving-stones-until-consecutive "Moving Stones Until Consecutive") -## 1032. Stream of Characters (Hard) +## [1032. Stream of Characters (Hard)](https://leetcode.com/problems/stream-of-characters "ๅญ็ฌฆๆต")
Implement the StreamChecker class as follows:
Given an array of characters, compress it in-place.
diff --git a/problems/string-to-integer-atoi/README.md b/problems/string-to-integer-atoi/README.md index 3f652290d..1da386664 100644 --- a/problems/string-to-integer-atoi/README.md +++ b/problems/string-to-integer-atoi/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/palindrome-number "Palindrome Number") -## 8. String to Integer (atoi) (Medium) +## [8. String to Integer (atoi) (Medium)](https://leetcode.com/problems/string-to-integer-atoi "ๅญ็ฌฆไธฒ่ฝฌๆขๆดๆฐ (atoi)")Implement atoi which converts a string to an integer.
Given two integers A and B, return any string S such that:
A password is considered strong if below conditions are all met:
diff --git a/problems/student-attendance-record-i/README.md b/problems/student-attendance-record-i/README.md index 1dcf96082..2f73371f1 100644 --- a/problems/student-attendance-record-i/README.md +++ b/problems/student-attendance-record-i/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/student-attendance-record-ii "Student Attendance Record II") -## 551. Student Attendance Record I (Easy) +## [551. Student Attendance Record I (Easy)](https://leetcode.com/problems/student-attendance-record-i "ๅญฆ็ๅบๅค่ฎฐๅฝ I") You are given a string representing an attendance record for a student. The record only contains the following three characters: diff --git a/problems/student-attendance-record-ii/README.md b/problems/student-attendance-record-ii/README.md index c7aa58c6b..648fcf229 100644 --- a/problems/student-attendance-record-ii/README.md +++ b/problems/student-attendance-record-ii/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/optimal-division "Optimal Division") -## 552. Student Attendance Record II (Hard) +## [552. Student Attendance Record II (Hard)](https://leetcode.com/problems/student-attendance-record-ii "ๅญฆ็ๅบๅค่ฎฐๅฝ II")Given a positive integer n, return the number of all possible attendance records with length n, which will be regarded as rewardable. The answer may be very large, return it after mod 109 + 7.
diff --git a/problems/students-report-by-geography/README.md b/problems/students-report-by-geography/README.md index df672555b..43ca274d5 100644 --- a/problems/students-report-by-geography/README.md +++ b/problems/students-report-by-geography/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/biggest-single-number "Biggest Single Number") -## 618. Students Report By Geography (Hard) +## [618. Students Report By Geography (Hard)](https://leetcode.com/problems/students-report-by-geography "ๅญฆ็ๅฐ็ไฟกๆฏๆฅๅ") A U.S graduate school has students from Asia, Europe and America. The students' location information are stored in tablestudent as below.
diff --git a/problems/subarray-product-less-than-k/README.md b/problems/subarray-product-less-than-k/README.md index d775ed25d..08f96ac07 100644 --- a/problems/subarray-product-less-than-k/README.md +++ b/problems/subarray-product-less-than-k/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-with-transaction-fee "Best Time to Buy and Sell Stock with Transaction Fee") -## 713. Subarray Product Less Than K (Medium) +## [713. Subarray Product Less Than K (Medium)](https://leetcode.com/problems/subarray-product-less-than-k "ไน็งฏๅฐไบK็ๅญๆฐ็ป")
Your are given an array of positive integers nums.
Count and print the number of (contiguous) subarrays where the product of all the elements in the subarray is less than k.
Given an array of integers and an integer k, you need to find the total number of continuous subarrays whose sum equals to k.
diff --git a/problems/subarray-sums-divisible-by-k/README.md b/problems/subarray-sums-divisible-by-k/README.md index bad025638..52b1a9ca5 100644 --- a/problems/subarray-sums-divisible-by-k/README.md +++ b/problems/subarray-sums-divisible-by-k/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/odd-even-jump "Odd Even Jump") -## 974. Subarray Sums Divisible by K (Medium) +## [974. Subarray Sums Divisible by K (Medium)](https://leetcode.com/problems/subarray-sums-divisible-by-k "ๅๅฏ่ขซ K ๆด้ค็ๅญๆฐ็ป")Given an array A of integers, return the number of (contiguous, non-empty) subarrays that have a sum divisible by K.
Given an array A of positive integers, call a (contiguous, not necessarily distinct) subarray of A good if the number of different integers in that subarray is exactly K.
A website domain like "discuss.leetcode.com" consists of various subdomains. At the top level, we have "com", at the next level, we have "leetcode.com", and at the lowest level, "discuss.leetcode.com". When we visit a domain like "discuss.leetcode.com", we will also visit the parent domains "leetcode.com" and "com" implicitly.
diff --git a/problems/subsets-ii/README.md b/problems/subsets-ii/README.md index 6538307b4..c3618f956 100644 --- a/problems/subsets-ii/README.md +++ b/problems/subsets-ii/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/decode-ways "Decode Ways") -## 90. Subsets II (Medium) +## [90. Subsets II (Medium)](https://leetcode.com/problems/subsets-ii "ๅญ้ II")Given a collection of integers that might contain duplicates, nums, return all possible subsets (the power set).
diff --git a/problems/subsets/README.md b/problems/subsets/README.md index 64f15f1b2..ca45e5c79 100644 --- a/problems/subsets/README.md +++ b/problems/subsets/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/word-search "Word Search") -## 78. Subsets (Medium) +## [78. Subsets (Medium)](https://leetcode.com/problems/subsets "ๅญ้")Given a set of distinct integers, nums, return all possible subsets (the power set).
diff --git a/problems/substring-with-concatenation-of-all-words/README.md b/problems/substring-with-concatenation-of-all-words/README.md index af68d0dbc..ecbe77f62 100644 --- a/problems/substring-with-concatenation-of-all-words/README.md +++ b/problems/substring-with-concatenation-of-all-words/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/next-permutation "Next Permutation") -## 30. Substring with Concatenation of All Words (Hard) +## [30. Substring with Concatenation of All Words (Hard)](https://leetcode.com/problems/substring-with-concatenation-of-all-words "ไธฒ่ๆๆๅ่ฏ็ๅญไธฒ")You are given a string, s, and a list of words, words, that are all of the same length. Find all starting indices of substring(s) in s that is a concatenation of each word in words exactly once and without any intervening characters.
diff --git a/problems/subtree-of-another-tree/README.md b/problems/subtree-of-another-tree/README.md index 12854894e..7132dfd0e 100644 --- a/problems/subtree-of-another-tree/README.md +++ b/problems/subtree-of-another-tree/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/squirrel-simulation "Squirrel Simulation") -## 572. Subtree of Another Tree (Easy) +## [572. Subtree of Another Tree (Easy)](https://leetcode.com/problems/subtree-of-another-tree "ๅฆไธไธชๆ ็ๅญๆ ")Given two non-empty binary trees s and t, check whether tree t has exactly the same structure and node values with a subtree of s. A subtree of s is a tree consists of a node in s and all of this node's descendants. The tree s could also be considered as a subtree of itself. diff --git a/problems/sudoku-solver/README.md b/problems/sudoku-solver/README.md index 9e80cf790..1f9f36c27 100644 --- a/problems/sudoku-solver/README.md +++ b/problems/sudoku-solver/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/count-and-say "Count and Say") -## 37. Sudoku Solver (Hard) +## [37. Sudoku Solver (Hard)](https://leetcode.com/problems/sudoku-solver "่งฃๆฐ็ฌ")
Write a program to solve a Sudoku puzzle by filling the empty cells.
diff --git a/problems/sum-of-digits-in-the-minimum-number/README.md b/problems/sum-of-digits-in-the-minimum-number/README.md index 3830cf999..ea5acf8e3 100644 --- a/problems/sum-of-digits-in-the-minimum-number/README.md +++ b/problems/sum-of-digits-in-the-minimum-number/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/high-five "High Five") -## 1085. Sum of Digits in the Minimum Number (Easy) +## [1085. Sum of Digits in the Minimum Number (Easy)](https://leetcode.com/problems/sum-of-digits-in-the-minimum-number "ๆๅฐๅ ็ด ๅๆฐไฝไนๅ")Given an array A of positive integers, let S be the sum of the digits of the minimal element of A.
An undirected, connected tree with N nodes labelled 0...N-1 and N-1 edges are given.
We have an array A of integers, and an array queries of queries.
Find the sum of all left leaves in a given binary tree.
diff --git a/problems/sum-of-root-to-leaf-binary-numbers/README.md b/problems/sum-of-root-to-leaf-binary-numbers/README.md index a0739e511..5973095af 100644 --- a/problems/sum-of-root-to-leaf-binary-numbers/README.md +++ b/problems/sum-of-root-to-leaf-binary-numbers/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/camelcase-matching "Camelcase Matching") -## 1022. Sum of Root To Leaf Binary Numbers (Easy) +## [1022. Sum of Root To Leaf Binary Numbers (Easy)](https://leetcode.com/problems/sum-of-root-to-leaf-binary-numbers "ไปๆ นๅฐๅถ็ไบ่ฟๅถๆฐไนๅ")Given a binary tree, each node has value 0 or 1. Each root-to-leaf path represents a binary number starting with the most significant bit. For example, if the path is 0 -> 1 -> 1 -> 0 -> 1, then this could represent 01101 in binary, which is 13.
Given a non-negative integer c, your task is to decide whether there're two integers a and b such that a2 + b2 = c.
Given an array of integers A, find the sum of min(B), where B ranges over every (contiguous) subarray of A.
Given an array of integers A, consider all non-empty subsequences of A.
Calculate the sum of two integers a and b, but you are not allowed to use the operator + and -.
Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number.
Given a sorted integer array without duplicates, return the summary of its ranges.
diff --git a/problems/super-egg-drop/README.md b/problems/super-egg-drop/README.md index 2a71ee009..ba940f3ab 100644 --- a/problems/super-egg-drop/README.md +++ b/problems/super-egg-drop/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/fair-candy-swap "Fair Candy Swap") -## 887. Super Egg Drop (Hard) +## [887. Super Egg Drop (Hard)](https://leetcode.com/problems/super-egg-drop "้ธก่ๆ่ฝ")You are given K eggs, and you have access to a building with N floors from 1 to N.
Let's say a positive integer is a superpalindrome if it is a palindrome, and it is also the square of a palindrome.
diff --git a/problems/super-pow/README.md b/problems/super-pow/README.md index 837df2a3d..dc1f69a72 100644 --- a/problems/super-pow/README.md +++ b/problems/super-pow/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/find-k-pairs-with-smallest-sums "Find K Pairs with Smallest Sums") -## 372. Super Pow (Medium) +## [372. Super Pow (Medium)](https://leetcode.com/problems/super-pow "่ถ ็บงๆฌกๆน")Your task is to calculate ab mod 1337 where a is a positive integer and b is an extremely large positive integer given in the form of an array.
diff --git a/problems/super-ugly-number/README.md b/problems/super-ugly-number/README.md index ca5fa8577..2c926a6ea 100644 --- a/problems/super-ugly-number/README.md +++ b/problems/super-ugly-number/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/binary-tree-vertical-order-traversal "Binary Tree Vertical Order Traversal") -## 313. Super Ugly Number (Medium) +## [313. Super Ugly Number (Medium)](https://leetcode.com/problems/super-ugly-number "่ถ ็บงไธๆฐ")Write a program to find the nth super ugly number.
You have n super washing machines on a line. Initially, each washing machine has some dresses or is empty.
diff --git a/problems/surface-area-of-3d-shapes/README.md b/problems/surface-area-of-3d-shapes/README.md index 634d7fa33..333b38b12 100644 --- a/problems/surface-area-of-3d-shapes/README.md +++ b/problems/surface-area-of-3d-shapes/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/groups-of-special-equivalent-strings "Groups of Special-Equivalent Strings") -## 892. Surface Area of 3D Shapes (Easy) +## [892. Surface Area of 3D Shapes (Easy)](https://leetcode.com/problems/surface-area-of-3d-shapes "ไธ็ปดๅฝขไฝ็่กจ้ข็งฏ")On a N * N grid, we place some 1 * 1 * 1 cubes.
Given a 2D board containing 'X' and 'O' (the letter O), capture all regions surrounded by 'X'.
In a string composed of 'L', 'R', and 'X' characters, like "RXXLRXRXL", a move consists of either replacing one occurrence of "XL" with "LX", or replacing one occurrence of "RX" with "XR". Given the starting string start and the ending string end, return True if and only if there exists a sequence of moves to transform one string to the other.
Given a string text, we are allowed to swap two of the characters in the string. Find the length of the longest substring with repeated characters.
Given a linked list, swap every two adjacent nodes and return its head.
diff --git a/problems/swap-salary/README.md b/problems/swap-salary/README.md index a841ac4c4..9d3220c92 100644 --- a/problems/swap-salary/README.md +++ b/problems/swap-salary/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/maximum-product-of-three-numbers "Maximum Product of Three Numbers") -## 627. Swap Salary (Easy) +## [627. Swap Salary (Easy)](https://leetcode.com/problems/swap-salary "ไบคๆขๅทฅ่ต")Given a table salary, such as the one below, that has m=male and f=female values. Swap all f and m values (i.e., change all f values to m and vice versa) with a single update statement and no intermediate temp table.
On an N x N grid, each square grid[i][j] represents the elevation at that point (i,j).
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).
diff --git a/problems/tag-validator/README.md b/problems/tag-validator/README.md index 2a3637006..da97f1dd4 100644 --- a/problems/tag-validator/README.md +++ b/problems/tag-validator/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/fraction-addition-and-subtraction "Fraction Addition and Subtraction") -## 591. Tag Validator (Hard) +## [591. Tag Validator (Hard)](https://leetcode.com/problems/tag-validator "ๆ ็ญพ้ช่ฏๅจ")Given a string representing a code snippet, you need to implement a tag validator to parse the code and return whether it is valid. A code snippet is valid if all the following rules hold:
-
diff --git a/problems/tallest-billboard/README.md b/problems/tallest-billboard/README.md
index 479edc3f1..e2fe5b01b 100644
--- a/problems/tallest-billboard/README.md
+++ b/problems/tallest-billboard/README.md
@@ -9,7 +9,7 @@
ใใใใใใใใใใใใใใใใ
[Next >](https://github.com/openset/leetcode/tree/master/problems/prison-cells-after-n-days "Prison Cells After N Days")
-## 956. Tallest Billboard (Hard)
+## [956. Tallest Billboard (Hard)](https://leetcode.com/problems/tallest-billboard "ๆ้ซ็ๅนฟๅ็")
You are installing a billboard and want it to have the largest height. The billboard will have two steel supports, one on each side. Each steel support must be an equal height.
diff --git a/problems/target-sum/README.md b/problems/target-sum/README.md index 5247473f3..79e033662 100644 --- a/problems/target-sum/README.md +++ b/problems/target-sum/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/teemo-attacking "Teemo Attacking") -## 494. Target Sum (Medium) +## [494. Target Sum (Medium)](https://leetcode.com/problems/target-sum "็ฎๆ ๅ")
You are given a list of non-negative integers, a1, a2, ..., an, and a target, S. Now you have 2 symbols + and -. For each integer, you should choose one from + and - as its new symbol.
diff --git a/problems/task-scheduler/README.md b/problems/task-scheduler/README.md
index cb5181726..52f985e36 100644
--- a/problems/task-scheduler/README.md
+++ b/problems/task-scheduler/README.md
@@ -9,7 +9,7 @@
ใใใใใใใใใใใใใใใใ
[Next >](https://github.com/openset/leetcode/tree/master/problems/design-circular-queue "Design Circular Queue")
-## 621. Task Scheduler (Medium)
+## [621. Task Scheduler (Medium)](https://leetcode.com/problems/task-scheduler "ไปปๅก่ฐๅบฆๅจ")
Given a char array representing tasks CPU need to do. It contains capital letters A to Z where different letters represent different tasks. Tasks could be done without original order. Each task could be done in one interval. For each interval, CPU could finish one task or just be idle.
diff --git a/problems/teemo-attacking/README.md b/problems/teemo-attacking/README.md index 6ac5d385a..2d69fc305 100644 --- a/problems/teemo-attacking/README.md +++ b/problems/teemo-attacking/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/next-greater-element-i "Next Greater Element I") -## 495. Teemo Attacking (Medium) +## [495. Teemo Attacking (Medium)](https://leetcode.com/problems/teemo-attacking "ๆ่ซๆปๅป")In LOL world, there is a hero called Teemo and his attacking can make his enemy Ashe be in poisoned condition. Now, given the Teemo's attacking ascending time series towards Ashe and the poisoning time duration per Teemo's attacking, you need to output the total time that Ashe is in poisoned condition.
diff --git a/problems/tenth-line/README.md b/problems/tenth-line/README.md index 8cec5d328..8ead6d1f4 100644 --- a/problems/tenth-line/README.md +++ b/problems/tenth-line/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/delete-duplicate-emails "Delete Duplicate Emails") -## 195. Tenth Line (Easy) +## [195. Tenth Line (Easy)](https://leetcode.com/problems/tenth-line "็ฌฌๅ่ก")Given a text file file.txt, print just the 10th line of the file.
Given an array of words and a width maxWidth, format the text such that each line has exactly maxWidth characters and is fully (left and right) justified.
diff --git a/problems/the-earliest-moment-when-everyone-become-friends/README.md b/problems/the-earliest-moment-when-everyone-become-friends/README.md index 145096583..ad6fc9f2f 100644 --- a/problems/the-earliest-moment-when-everyone-become-friends/README.md +++ b/problems/the-earliest-moment-when-everyone-become-friends/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/path-with-maximum-minimum-value "Path With Maximum Minimum Value") -## 1101. The Earliest Moment When Everyone Become Friends (Medium) +## [1101. The Earliest Moment When Everyone Become Friends (Medium)](https://leetcode.com/problems/the-earliest-moment-when-everyone-become-friends "ๅฝผๆญค็่ฏ็ๆๆฉๆถ้ด")In a social group, there are N people, with unique integer ids from 0 to N-1.
There is a ball in a maze with empty spaces and walls. The ball can go through empty spaces by rolling up, down, left or right, but it won't stop rolling until hitting a wall. When the ball stops, it could choose the next direction.
diff --git a/problems/the-maze-iii/README.md b/problems/the-maze-iii/README.md index 3f1db2a6c..a338eb2ae 100644 --- a/problems/the-maze-iii/README.md +++ b/problems/the-maze-iii/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/keyboard-row "Keyboard Row") -## 499. The Maze III (Hard) +## [499. The Maze III (Hard)](https://leetcode.com/problems/the-maze-iii "่ฟทๅฎซ III") diff --git a/problems/the-maze/README.md b/problems/the-maze/README.md index a310aabdb..354fea1be 100644 --- a/problems/the-maze/README.md +++ b/problems/the-maze/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/increasing-subsequences "Increasing Subsequences") -## 490. The Maze (Medium) +## [490. The Maze (Medium)](https://leetcode.com/problems/the-maze "่ฟทๅฎซ")There is a ball in a maze with empty spaces and walls. The ball can go through empty spaces by rolling up, down, left or right, but it won't stop rolling until hitting a wall. When the ball stops, it could choose the next direction.
diff --git a/problems/the-skyline-problem/README.md b/problems/the-skyline-problem/README.md index 4a1cc329d..04395608d 100644 --- a/problems/the-skyline-problem/README.md +++ b/problems/the-skyline-problem/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/contains-duplicate-ii "Contains Duplicate II") -## 218. The Skyline Problem (Hard) +## [218. The Skyline Problem (Hard)](https://leetcode.com/problems/the-skyline-problem "ๅคฉ้ ็บฟ้ฎ้ข")A city's skyline is the outer contour of the silhouette formed by all the buildings in that city when viewed from a distance. Now suppose you are given the locations and height of all the buildings as shown on a cityscape photo (Figure A), write a program to output the skyline formed by these buildings collectively (Figure B).
diff --git a/problems/third-maximum-number/README.md b/problems/third-maximum-number/README.md
index f98eeca57..356f94be2 100644
--- a/problems/third-maximum-number/README.md
+++ b/problems/third-maximum-number/README.md
@@ -9,7 +9,7 @@
ใใใใใใใใใใใใใใใใ
[Next >](https://github.com/openset/leetcode/tree/master/problems/add-strings "Add Strings")
-## 414. Third Maximum Number (Easy)
+## [414. Third Maximum Number (Easy)](https://leetcode.com/problems/third-maximum-number "็ฌฌไธๅคง็ๆฐ")
Given a non-empty array of integers, return the third maximum number in this array. If it does not exist, return the maximum number. The time complexity must be in O(n).
diff --git a/problems/three-equal-parts/README.md b/problems/three-equal-parts/README.md index 8bb1c2f38..318af4cb7 100644 --- a/problems/three-equal-parts/README.md +++ b/problems/three-equal-parts/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/minimize-malware-spread-ii "Minimize Malware Spread II") -## 927. Three Equal Parts (Hard) +## [927. Three Equal Parts (Hard)](https://leetcode.com/problems/three-equal-parts "ไธ็ญๅ")Given an array A of 0s and 1s, divide the array into 3 non-empty parts such that all of these parts represent the same binary value.
Create a timebased key-value store class TimeMap, that supports two operations.
Implement function ToLowerCase() that has a string parameter str, and returns the same string in lowercase.
diff --git a/problems/toeplitz-matrix/README.md b/problems/toeplitz-matrix/README.md index d229841c6..1d3efbdc2 100644 --- a/problems/toeplitz-matrix/README.md +++ b/problems/toeplitz-matrix/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/reorganize-string "Reorganize String") -## 766. Toeplitz Matrix (Easy) +## [766. Toeplitz Matrix (Easy)](https://leetcode.com/problems/toeplitz-matrix "ๆๆฎๅฉ่จ็ฉ้ต")A matrix is Toeplitz if every diagonal from top-left to bottom-right has the same element.
diff --git a/problems/top-k-frequent-elements/README.md b/problems/top-k-frequent-elements/README.md index 3e09d512a..c764fd708 100644 --- a/problems/top-k-frequent-elements/README.md +++ b/problems/top-k-frequent-elements/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/design-tic-tac-toe "Design Tic-Tac-Toe") -## 347. Top K Frequent Elements (Medium) +## [347. Top K Frequent Elements (Medium)](https://leetcode.com/problems/top-k-frequent-elements "ๅ K ไธช้ซ้ขๅ ็ด ")Given a non-empty array of integers, return the k most frequent elements.
diff --git a/problems/top-k-frequent-words/README.md b/problems/top-k-frequent-words/README.md index f4e1cc86d..80d9e4b73 100644 --- a/problems/top-k-frequent-words/README.md +++ b/problems/top-k-frequent-words/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/binary-number-with-alternating-bits "Binary Number with Alternating Bits") -## 692. Top K Frequent Words (Medium) +## [692. Top K Frequent Words (Medium)](https://leetcode.com/problems/top-k-frequent-words "ๅKไธช้ซ้ขๅ่ฏ")Given a non-empty list of words, return the k most frequent elements.
Your answer should be sorted by frequency from highest to lowest. If two words have the same frequency, then the word with the lower alphabetical order comes first.
diff --git a/problems/total-hamming-distance/README.md b/problems/total-hamming-distance/README.md index d77846626..e7185bd0b 100644 --- a/problems/total-hamming-distance/README.md +++ b/problems/total-hamming-distance/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/generate-random-point-in-a-circle "Generate Random Point in a Circle") -## 477. Total Hamming Distance (Medium) +## [477. Total Hamming Distance (Medium)](https://leetcode.com/problems/total-hamming-distance "ๆฑๆ่ท็ฆปๆปๅ")The Hamming distance between two integers is the number of positions at which the corresponding bits are different.
diff --git a/problems/tournament-winners/README.md b/problems/tournament-winners/README.md index 56a3565bc..d93068427 100644 --- a/problems/tournament-winners/README.md +++ b/problems/tournament-winners/README.md @@ -7,8 +7,8 @@ [< Previous](https://github.com/openset/leetcode/tree/master/problems/monthly-transactions-i "Monthly Transactions I") ใใใใใใใใใใใใใใใใ -Next > +[Next >](https://github.com/openset/leetcode/tree/master/problems/fizz-buzz-multithreaded "Fizz Buzz Multithreaded") -## 1194. Tournament Winners (Hard) +## [1194. Tournament Winners (Hard)](https://leetcode.com/problems/tournament-winners "") diff --git a/problems/transform-to-chessboard/README.md b/problems/transform-to-chessboard/README.md index 31156bfde..933b175da 100644 --- a/problems/transform-to-chessboard/README.md +++ b/problems/transform-to-chessboard/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-distance-between-bst-nodes "Minimum Distance Between BST Nodes") -## 782. Transform to Chessboard (Hard) +## [782. Transform to Chessboard (Hard)](https://leetcode.com/problems/transform-to-chessboard "ๅไธบๆฃ็")An N x N board contains only 0s and 1s. In each move, you can swap any 2 rows with each other, or any 2 columns with each other.
Given a text file file.txt, transpose its content.
Given a matrix A, return the transpose of A.
Given an m x n matrix of positive integers representing the height of each unit cell in a 2D elevation map, compute the volume of water it is able to trap after raining.
Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.
diff --git a/problems/tree-node/README.md b/problems/tree-node/README.md index 80b112f36..2558720cc 100644 --- a/problems/tree-node/README.md +++ b/problems/tree-node/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/find-duplicate-file-in-system "Find Duplicate File in System") -## 608. Tree Node (Medium) +## [608. Tree Node (Medium)](https://leetcode.com/problems/tree-node "ๆ ่็น")Given a table tree, id is identifier of the tree node and p_id is its parent node's id.
diff --git a/problems/triangle/README.md b/problems/triangle/README.md index 2c512fb58..d006de92d 100644 --- a/problems/triangle/README.md +++ b/problems/triangle/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock "Best Time to Buy and Sell Stock") -## 120. Triangle (Medium) +## [120. Triangle (Medium)](https://leetcode.com/problems/triangle "ไธ่งๅฝขๆๅฐ่ทฏๅพๅ")
Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.
diff --git a/problems/trim-a-binary-search-tree/README.md b/problems/trim-a-binary-search-tree/README.md index 90241ca16..e460820ca 100644 --- a/problems/trim-a-binary-search-tree/README.md +++ b/problems/trim-a-binary-search-tree/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/maximum-swap "Maximum Swap") -## 669. Trim a Binary Search Tree (Easy) +## [669. Trim a Binary Search Tree (Easy)](https://leetcode.com/problems/trim-a-binary-search-tree "ไฟฎๅชไบๅๆ็ดขๆ ")
Given a binary search tree and the lowest and highest boundaries as L and R, trim the tree so that all its elements lies in [L, R] (R >= L). You might need to change the root of the tree, so the result should return the new root of the trimmed binary search tree.
diff --git a/problems/triples-with-bitwise-and-equal-to-zero/README.md b/problems/triples-with-bitwise-and-equal-to-zero/README.md
index 4e3876770..baa0b75a8 100644
--- a/problems/triples-with-bitwise-and-equal-to-zero/README.md
+++ b/problems/triples-with-bitwise-and-equal-to-zero/README.md
@@ -9,7 +9,7 @@
ใใใใใใใใใใใใใใใใ
[Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-cost-for-tickets "Minimum Cost For Tickets")
-## 982. Triples with Bitwise AND Equal To Zero (Hard)
+## [982. Triples with Bitwise AND Equal To Zero (Hard)](https://leetcode.com/problems/triples-with-bitwise-and-equal-to-zero "ๆไฝไธไธบ้ถ็ไธๅ
็ป")
Given an array of integers A, find the number of triples of indices (i, j, k) such that:
The Trips table holds all taxi trips. Each trip has a unique Id, while Client_Id and Driver_Id are both foreign keys to the Users_Id at the Users table. Status is an ENUM type of (‘completed’, ‘cancelled_by_driver’, ‘cancelled_by_client’).
There are 2N people a company is planning to interview. The cost of flying the i-th person to city A is costs[i][0], and the cost of flying the i-th person to city B is costs[i][1].
Given an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target number.
diff --git a/problems/two-sum-iii-data-structure-design/README.md b/problems/two-sum-iii-data-structure-design/README.md index 2db7edc60..d51cd833a 100644 --- a/problems/two-sum-iii-data-structure-design/README.md +++ b/problems/two-sum-iii-data-structure-design/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/excel-sheet-column-number "Excel Sheet Column Number") -## 170. Two Sum III - Data structure design (Easy) +## [170. Two Sum III - Data structure design (Easy)](https://leetcode.com/problems/two-sum-iii-data-structure-design "ไธคๆฐไนๅ III - ๆฐๆฎ็ปๆ่ฎพ่ฎก") diff --git a/problems/two-sum-iv-input-is-a-bst/README.md b/problems/two-sum-iv-input-is-a-bst/README.md index ae80218fc..8ba39a3e1 100644 --- a/problems/two-sum-iv-input-is-a-bst/README.md +++ b/problems/two-sum-iv-input-is-a-bst/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/maximum-binary-tree "Maximum Binary Tree") -## 653. Two Sum IV - Input is a BST (Easy) +## [653. Two Sum IV - Input is a BST (Easy)](https://leetcode.com/problems/two-sum-iv-input-is-a-bst "ไธคๆฐไนๅ IV - ่พๅ ฅ BST")Given a Binary Search Tree and a target number, return true if there exist two elements in the BST such that their sum is equal to the given target.
diff --git a/problems/two-sum-less-than-k/README.md b/problems/two-sum-less-than-k/README.md index f52c39c6e..2dd7562ab 100644 --- a/problems/two-sum-less-than-k/README.md +++ b/problems/two-sum-less-than-k/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/find-k-length-substrings-with-no-repeated-characters "Find K-Length Substrings With No Repeated Characters") -## 1099. Two Sum Less Than K (Easy) +## [1099. Two Sum Less Than K (Easy)](https://leetcode.com/problems/two-sum-less-than-k "ๅฐไบ K ็ไธคๆฐไนๅ")Given an array A of integers and integer K, return the maximum S such that there exists i < j with A[i] + A[j] = S and S < K. If no i, j exist satisfying this equation, return -1.
Given an array of integers, return indices of the two numbers such that they add up to a specific target.
diff --git a/problems/ugly-number-ii/README.md b/problems/ugly-number-ii/README.md index 68a1e5412..537291cb6 100644 --- a/problems/ugly-number-ii/README.md +++ b/problems/ugly-number-ii/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/paint-house-ii "Paint House II") -## 264. Ugly Number II (Medium) +## [264. Ugly Number II (Medium)](https://leetcode.com/problems/ugly-number-ii "ไธๆฐ II")Write a program to find the n-th ugly number.
Write a program to check whether a given number is an ugly number.
diff --git a/problems/uncommon-words-from-two-sentences/README.md b/problems/uncommon-words-from-two-sentences/README.md index 284709ce3..edbf4e6c2 100644 --- a/problems/uncommon-words-from-two-sentences/README.md +++ b/problems/uncommon-words-from-two-sentences/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/spiral-matrix-iii "Spiral Matrix III") -## 884. Uncommon Words from Two Sentences (Easy) +## [884. Uncommon Words from Two Sentences (Easy)](https://leetcode.com/problems/uncommon-words-from-two-sentences "ไธคๅฅ่ฏไธญ็ไธๅธธ่งๅ่ฏ")We are given two sentences A and B. (A sentence is a string of space separated words. Each word consists only of lowercase letters.)
We write the integers of A and B (in the order they are given) on two separate horizontal lines.
Given an integer n, generate all structurally unique BST's (binary search trees) that store values 1 ... n.
diff --git a/problems/unique-binary-search-trees/README.md b/problems/unique-binary-search-trees/README.md index 5442f5256..421d50c20 100644 --- a/problems/unique-binary-search-trees/README.md +++ b/problems/unique-binary-search-trees/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/interleaving-string "Interleaving String") -## 96. Unique Binary Search Trees (Medium) +## [96. Unique Binary Search Trees (Medium)](https://leetcode.com/problems/unique-binary-search-trees "ไธๅ็ไบๅๆ็ดขๆ ")Given n, how many structurally unique BST's (binary search trees) that store values 1 ... n?
diff --git a/problems/unique-email-addresses/README.md b/problems/unique-email-addresses/README.md index 2c3b2e356..e4a5776ca 100644 --- a/problems/unique-email-addresses/README.md +++ b/problems/unique-email-addresses/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/binary-subarrays-with-sum "Binary Subarrays With Sum") -## 929. Unique Email Addresses (Easy) +## [929. Unique Email Addresses (Easy)](https://leetcode.com/problems/unique-email-addresses "็ฌ็น็็ตๅญ้ฎไปถๅฐๅ")Every email consists of a local name and a domain name, separated by the @ sign.
diff --git a/problems/unique-letter-string/README.md b/problems/unique-letter-string/README.md index f38af3495..e58fefe9c 100644 --- a/problems/unique-letter-string/README.md +++ b/problems/unique-letter-string/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/consecutive-numbers-sum "Consecutive Numbers Sum") -## 828. Unique Letter String (Hard) +## [828. Unique Letter String (Hard)](https://leetcode.com/problems/unique-letter-string "็ฌ็นๅญ็ฌฆไธฒ")A character is unique in string S if it occurs exactly once in it.
International Morse Code defines a standard encoding where each letter is mapped to a series of dots and dashes, as follows: "a" maps to ".-", "b" maps to "-...", "c" maps to "-.-.", and so on.
A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).
diff --git a/problems/unique-paths-iii/README.md b/problems/unique-paths-iii/README.md index b720a4212..7528df3a4 100644 --- a/problems/unique-paths-iii/README.md +++ b/problems/unique-paths-iii/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/time-based-key-value-store "Time Based Key-Value Store") -## 980. Unique Paths III (Hard) +## [980. Unique Paths III (Hard)](https://leetcode.com/problems/unique-paths-iii "ไธๅ่ทฏๅพ III")On a 2-dimensional grid, there are 4 types of squares:
A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).
diff --git a/problems/unique-substrings-in-wraparound-string/README.md b/problems/unique-substrings-in-wraparound-string/README.md index a8b996c0d..094bfdb8e 100644 --- a/problems/unique-substrings-in-wraparound-string/README.md +++ b/problems/unique-substrings-in-wraparound-string/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/validate-ip-address "Validate IP Address") -## 467. Unique Substrings in Wraparound String (Medium) +## [467. Unique Substrings in Wraparound String (Medium)](https://leetcode.com/problems/unique-substrings-in-wraparound-string "็ฏ็ปๅญ็ฌฆไธฒไธญๅฏไธ็ๅญๅญ็ฌฆไธฒ")Consider the string s to be the infinite wraparound string of "abcdefghijklmnopqrstuvwxyz", so s will look like this: "...zabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcd....".
A binary tree is univalued if every node in the tree has the same value.
diff --git a/problems/unpopular-books/README.md b/problems/unpopular-books/README.md index 087e7beb9..a69b40c15 100644 --- a/problems/unpopular-books/README.md +++ b/problems/unpopular-books/README.md @@ -9,6 +9,6 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/two-sum-less-than-k "Two Sum Less Than K") -## 1098. Unpopular Books (Medium) +## [1098. Unpopular Books (Medium)](https://leetcode.com/problems/unpopular-books "ๅฐไผไนฆ็ฑ") diff --git a/problems/user-activity-for-the-past-30-days-i/README.md b/problems/user-activity-for-the-past-30-days-i/README.md index 569c34db4..1b2411702 100644 --- a/problems/user-activity-for-the-past-30-days-i/README.md +++ b/problems/user-activity-for-the-past-30-days-i/README.md @@ -9,6 +9,6 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/user-activity-for-the-past-30-days-ii "User Activity for the Past 30 Days II") -## 1141. User Activity for the Past 30 Days I (Easy) +## [1141. User Activity for the Past 30 Days I (Easy)](https://leetcode.com/problems/user-activity-for-the-past-30-days-i "") diff --git a/problems/user-activity-for-the-past-30-days-ii/README.md b/problems/user-activity-for-the-past-30-days-ii/README.md index d47805de8..5fdbbe181 100644 --- a/problems/user-activity-for-the-past-30-days-ii/README.md +++ b/problems/user-activity-for-the-past-30-days-ii/README.md @@ -9,6 +9,6 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/longest-common-subsequence "Longest Common Subsequence") -## 1142. User Activity for the Past 30 Days II (Easy) +## [1142. User Activity for the Past 30 Days II (Easy)](https://leetcode.com/problems/user-activity-for-the-past-30-days-ii "") diff --git a/problems/user-purchase-platform/README.md b/problems/user-purchase-platform/README.md index b8a9bb57a..1412d7f4e 100644 --- a/problems/user-purchase-platform/README.md +++ b/problems/user-purchase-platform/README.md @@ -9,6 +9,6 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/number-of-equivalent-domino-pairs "Number of Equivalent Domino Pairs") -## 1127. User Purchase Platform (Hard) +## [1127. User Purchase Platform (Hard)](https://leetcode.com/problems/user-purchase-platform "") diff --git a/problems/utf-8-validation/README.md b/problems/utf-8-validation/README.md index 1369db72b..78e3f6165 100644 --- a/problems/utf-8-validation/README.md +++ b/problems/utf-8-validation/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/decode-string "Decode String") -## 393. UTF-8 Validation (Medium) +## [393. UTF-8 Validation (Medium)](https://leetcode.com/problems/utf-8-validation "UTF-8 ็ผ็ ้ช่ฏ")A character in UTF8 can be from 1 to 4 bytes long, subjected to the following rules:
-
diff --git a/problems/valid-anagram/README.md b/problems/valid-anagram/README.md
index 5c81c4f3b..0b04d6ffd 100644
--- a/problems/valid-anagram/README.md
+++ b/problems/valid-anagram/README.md
@@ -9,7 +9,7 @@
ใใใใใใใใใใใใใใใใ
[Next >](https://github.com/openset/leetcode/tree/master/problems/shortest-word-distance "Shortest Word Distance")
-## 242. Valid Anagram (Easy)
+## [242. Valid Anagram (Easy)](https://leetcode.com/problems/valid-anagram "ๆๆ็ๅญๆฏๅผไฝ่ฏ")
Given two strings s and t , write a function to determine if t is an anagram of s.
diff --git a/problems/valid-boomerang/README.md b/problems/valid-boomerang/README.md index 8fa565999..e789f8a8a 100644 --- a/problems/valid-boomerang/README.md +++ b/problems/valid-boomerang/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/binary-search-tree-to-greater-sum-tree "Binary Search Tree to Greater Sum Tree") -## 1037. Valid Boomerang (Easy) +## [1037. Valid Boomerang (Easy)](https://leetcode.com/problems/valid-boomerang "ๆๆ็ๅๆ้")A boomerang is a set of 3 points that are all distinct and not in a straight line.
diff --git a/problems/valid-mountain-array/README.md b/problems/valid-mountain-array/README.md index 44ee15be1..5c330783c 100644 --- a/problems/valid-mountain-array/README.md +++ b/problems/valid-mountain-array/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/di-string-match "DI String Match") -## 941. Valid Mountain Array (Easy) +## [941. Valid Mountain Array (Easy)](https://leetcode.com/problems/valid-mountain-array "ๆๆ็ๅฑฑ่ๆฐ็ป")Given an array A of integers, return true if and only if it is a valid mountain array.
Validate if a given string can be interpreted as a decimal number.
diff --git a/problems/valid-palindrome-ii/README.md b/problems/valid-palindrome-ii/README.md index cdd99d3d0..db77d8cd9 100644 --- a/problems/valid-palindrome-ii/README.md +++ b/problems/valid-palindrome-ii/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/next-closest-time "Next Closest Time") -## 680. Valid Palindrome II (Easy) +## [680. Valid Palindrome II (Easy)](https://leetcode.com/problems/valid-palindrome-ii "้ช่ฏๅๆๅญ็ฌฆไธฒ โ ก")
Given a non-empty string s, you may delete at most one character. Judge whether you can make it a palindrome.
diff --git a/problems/valid-palindrome/README.md b/problems/valid-palindrome/README.md
index f63c02a28..88ffb9a5f 100644
--- a/problems/valid-palindrome/README.md
+++ b/problems/valid-palindrome/README.md
@@ -9,7 +9,7 @@
ใใใใใใใใใใใใใใใใ
[Next >](https://github.com/openset/leetcode/tree/master/problems/word-ladder-ii "Word Ladder II")
-## 125. Valid Palindrome (Easy)
+## [125. Valid Palindrome (Easy)](https://leetcode.com/problems/valid-palindrome "้ช่ฏๅๆไธฒ")
Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.
diff --git a/problems/valid-parentheses/README.md b/problems/valid-parentheses/README.md index 40b27ab71..7ad6dabb1 100644 --- a/problems/valid-parentheses/README.md +++ b/problems/valid-parentheses/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/merge-two-sorted-lists "Merge Two Sorted Lists") -## 20. Valid Parentheses (Easy) +## [20. Valid Parentheses (Easy)](https://leetcode.com/problems/valid-parentheses "ๆๆ็ๆฌๅท")Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.
Given a string containing only three types of characters: '(', ')' and '*', write a function to check whether this string is valid. We define the validity of a string by these rules: diff --git a/problems/valid-perfect-square/README.md b/problems/valid-perfect-square/README.md index 85d4fe423..3f6ec1c3f 100644 --- a/problems/valid-perfect-square/README.md +++ b/problems/valid-perfect-square/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/largest-divisible-subset "Largest Divisible Subset") -## 367. Valid Perfect Square (Easy) +## [367. Valid Perfect Square (Easy)](https://leetcode.com/problems/valid-perfect-square "ๆๆ็ๅฎๅ จๅนณๆนๆฐ")
Given a positive integer num, write a function which returns True if num is a perfect square else False.
diff --git a/problems/valid-permutations-for-di-sequence/README.md b/problems/valid-permutations-for-di-sequence/README.md index a9a039d62..19a96c7b1 100644 --- a/problems/valid-permutations-for-di-sequence/README.md +++ b/problems/valid-permutations-for-di-sequence/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/fruit-into-baskets "Fruit Into Baskets") -## 903. Valid Permutations for DI Sequence (Hard) +## [903. Valid Permutations for DI Sequence (Hard)](https://leetcode.com/problems/valid-permutations-for-di-sequence "DI ๅบๅ็ๆๆๆๅ")We are given S, a length n string of characters from the set {'D', 'I'}. (These letters stand for "decreasing" and "increasing".)
Given a text file file.txt that contains list of phone numbers (one per line), write a one liner bash script to print all valid phone numbers.
Given the coordinates of four points in 2D space, return whether the four points could construct a square.
diff --git a/problems/valid-sudoku/README.md b/problems/valid-sudoku/README.md index b8575d50c..b06125aca 100644 --- a/problems/valid-sudoku/README.md +++ b/problems/valid-sudoku/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/sudoku-solver "Sudoku Solver") -## 36. Valid Sudoku (Medium) +## [36. Valid Sudoku (Medium)](https://leetcode.com/problems/valid-sudoku "ๆๆ็ๆฐ็ฌ")Determine if a 9x9 Sudoku board is valid. Only the filled cells need to be validated according to the following rules:
diff --git a/problems/valid-tic-tac-toe-state/README.md b/problems/valid-tic-tac-toe-state/README.md index b787aa417..25541e46b 100644 --- a/problems/valid-tic-tac-toe-state/README.md +++ b/problems/valid-tic-tac-toe-state/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/number-of-subarrays-with-bounded-maximum "Number of Subarrays with Bounded Maximum") -## 794. Valid Tic-Tac-Toe State (Medium) +## [794. Valid Tic-Tac-Toe State (Medium)](https://leetcode.com/problems/valid-tic-tac-toe-state "ๆๆ็ไบๅญๆธธๆ")A Tic-Tac-Toe board is given as a string array board. Return True if and only if it is possible to reach this board position during the course of a valid tic-tac-toe game.
Given a binary tree, determine if it is a valid binary search tree (BST).
diff --git a/problems/validate-ip-address/README.md b/problems/validate-ip-address/README.md index a94bb301c..5fa41af63 100644 --- a/problems/validate-ip-address/README.md +++ b/problems/validate-ip-address/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/convex-polygon "Convex Polygon") -## 468. Validate IP Address (Medium) +## [468. Validate IP Address (Medium)](https://leetcode.com/problems/validate-ip-address "้ช่ฏIPๅฐๅ")Write a function to check whether an input string is a valid IPv4 address or IPv6 address or neither. diff --git a/problems/validate-stack-sequences/README.md b/problems/validate-stack-sequences/README.md index ca39b45e2..702601231 100644 --- a/problems/validate-stack-sequences/README.md +++ b/problems/validate-stack-sequences/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/most-stones-removed-with-same-row-or-column "Most Stones Removed with Same Row or Column") -## 946. Validate Stack Sequences (Medium) +## [946. Validate Stack Sequences (Medium)](https://leetcode.com/problems/validate-stack-sequences "้ช่ฏๆ ๅบๅ")
Given two sequences pushed and popped with distinct values, return true if and only if this could have been the result of a sequence of push and pop operations on an initially empty stack.
One way to serialize a binary tree is to use pre-order traversal. When we encounter a non-null node, we record the node's value. If it is a null node, we record using a sentinel value such as #.
In an alien language, surprisingly they also use english lowercase letters, but possibly in a different order. The order of the alphabet is some permutation of lowercase letters.
Given a binary tree, return the vertical order traversal of its nodes values.
diff --git a/problems/video-stitching/README.md b/problems/video-stitching/README.md index 5d29f9cba..826732ee8 100644 --- a/problems/video-stitching/README.md +++ b/problems/video-stitching/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/divisor-game "Divisor Game") -## 1024. Video Stitching (Medium) +## [1024. Video Stitching (Medium)](https://leetcode.com/problems/video-stitching "่ง้ขๆผๆฅ")You are given a series of video clips from a sporting event that lasted T seconds. These video clips can be overlapping with each other and have varied lengths.
Given a wordlist, we want to implement a spellchecker that converts a query word into a correct word.
A robot on an infinite grid starts at point (0, 0) and faces north. The robot can receive one of three possible types of commands:
diff --git a/problems/walls-and-gates/README.md b/problems/walls-and-gates/README.md index cd2e63c46..3706dfe93 100644 --- a/problems/walls-and-gates/README.md +++ b/problems/walls-and-gates/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/find-the-duplicate-number "Find the Duplicate Number") -## 286. Walls and Gates (Medium) +## [286. Walls and Gates (Medium)](https://leetcode.com/problems/walls-and-gates "ๅขไธ้จ") diff --git a/problems/water-and-jug-problem/README.md b/problems/water-and-jug-problem/README.md index 811716d07..d8401d059 100644 --- a/problems/water-and-jug-problem/README.md +++ b/problems/water-and-jug-problem/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/find-leaves-of-binary-tree "Find Leaves of Binary Tree") -## 365. Water and Jug Problem (Medium) +## [365. Water and Jug Problem (Medium)](https://leetcode.com/problems/water-and-jug-problem "ๆฐดๅฃถ้ฎ้ข")You are given two jugs with capacities x and y litres. There is an infinite amount of water supply available. You need to determine whether it is possible to measure exactly z litres using these two jugs.
diff --git a/problems/wiggle-sort-ii/README.md b/problems/wiggle-sort-ii/README.md index 29a782c03..31c8a3915 100644 --- a/problems/wiggle-sort-ii/README.md +++ b/problems/wiggle-sort-ii/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/maximum-size-subarray-sum-equals-k "Maximum Size Subarray Sum Equals k") -## 324. Wiggle Sort II (Medium) +## [324. Wiggle Sort II (Medium)](https://leetcode.com/problems/wiggle-sort-ii "ๆๅจๆๅบ II")Given an unsorted array nums, reorder it such that nums[0] < nums[1] > nums[2] < nums[3]....
A sequence of numbers is called a wiggle sequence if the differences between successive numbers strictly alternate between positive and negative. The first difference (if one exists) may be either positive or negative. A sequence with fewer than two elements is trivially a wiggle sequence.
diff --git a/problems/wildcard-matching/README.md b/problems/wildcard-matching/README.md index cb7f7d97d..850c1aaed 100644 --- a/problems/wildcard-matching/README.md +++ b/problems/wildcard-matching/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/jump-game-ii "Jump Game II") -## 44. Wildcard Matching (Hard) +## [44. Wildcard Matching (Hard)](https://leetcode.com/problems/wildcard-matching "้้ ็ฌฆๅน้ ")Given an input string (s) and a pattern (p), implement wildcard pattern matching with support for '?' and '*'.
Table: Candidate
Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, add spaces in s to construct a sentence where each word is a valid dictionary word. Return all such possible sentences.
diff --git a/problems/word-break/README.md b/problems/word-break/README.md index ecdb4b6d9..350da232d 100644 --- a/problems/word-break/README.md +++ b/problems/word-break/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/word-break-ii "Word Break II") -## 139. Word Break (Medium) +## [139. Word Break (Medium)](https://leetcode.com/problems/word-break "ๅ่ฏๆๅ")Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, determine if s can be segmented into a space-separated sequence of one or more dictionary words.
diff --git a/problems/word-frequency/README.md b/problems/word-frequency/README.md index c8ea8cb93..01de1d3bd 100644 --- a/problems/word-frequency/README.md +++ b/problems/word-frequency/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/valid-phone-numbers "Valid Phone Numbers") -## 192. Word Frequency (Medium) +## [192. Word Frequency (Medium)](https://leetcode.com/problems/word-frequency "็ป่ฎก่ฏ้ข")Write a bash script to calculate the frequency of each word in a text file words.txt.
Given two words (beginWord and endWord), and a dictionary's word list, find all shortest transformation sequence(s) from beginWord to endWord, such that:
diff --git a/problems/word-ladder/README.md b/problems/word-ladder/README.md index 20478d752..84a7f94f2 100644 --- a/problems/word-ladder/README.md +++ b/problems/word-ladder/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/longest-consecutive-sequence "Longest Consecutive Sequence") -## 127. Word Ladder (Medium) +## [127. Word Ladder (Medium)](https://leetcode.com/problems/word-ladder "ๅ่ฏๆฅ้พ")Given two words (beginWord and endWord), and a dictionary's word list, find the length of shortest transformation sequence from beginWord to endWord, such that:
diff --git a/problems/word-pattern-ii/README.md b/problems/word-pattern-ii/README.md index 93c913660..ae9e138e5 100644 --- a/problems/word-pattern-ii/README.md +++ b/problems/word-pattern-ii/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/nim-game "Nim Game") -## 291. Word Pattern II (Hard) +## [291. Word Pattern II (Hard)](https://leetcode.com/problems/word-pattern-ii "ๅ่ฏ่งๅพ II") diff --git a/problems/word-pattern/README.md b/problems/word-pattern/README.md index 092451429..9fff9caf9 100644 --- a/problems/word-pattern/README.md +++ b/problems/word-pattern/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/word-pattern-ii "Word Pattern II") -## 290. Word Pattern (Easy) +## [290. Word Pattern (Easy)](https://leetcode.com/problems/word-pattern "ๅ่ฏ่งๅพ")Given a pattern and a string str, find if str follows the same pattern.
Given a 2D board and a list of words from the dictionary, find all words in the board.
diff --git a/problems/word-search/README.md b/problems/word-search/README.md index ea3ff651a..5f5b4bb13 100644 --- a/problems/word-search/README.md +++ b/problems/word-search/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/remove-duplicates-from-sorted-array-ii "Remove Duplicates from Sorted Array II") -## 79. Word Search (Medium) +## [79. Word Search (Medium)](https://leetcode.com/problems/word-search "ๅ่ฏๆ็ดข")Given a 2D board and a word, find if the word exists in the grid.
diff --git a/problems/word-squares/README.md b/problems/word-squares/README.md index 060a023b7..26d53e4fe 100644 --- a/problems/word-squares/README.md +++ b/problems/word-squares/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/convert-binary-search-tree-to-sorted-doubly-linked-list "Convert Binary Search Tree to Sorted Doubly Linked List") -## 425. Word Squares (Hard) +## [425. Word Squares (Hard)](https://leetcode.com/problems/word-squares "ๅ่ฏๆนๅ") diff --git a/problems/word-subsets/README.md b/problems/word-subsets/README.md index 2e04e6356..e3b35bbf2 100644 --- a/problems/word-subsets/README.md +++ b/problems/word-subsets/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/reverse-only-letters "Reverse Only Letters") -## 916. Word Subsets (Medium) +## [916. Word Subsets (Medium)](https://leetcode.com/problems/word-subsets "ๅ่ฏๅญ้")We are given two arrays A and B of words. Each word is a string of lowercase letters.
In a deck of cards, each card has an integer written on it.
diff --git a/problems/zigzag-conversion/README.md b/problems/zigzag-conversion/README.md index 0b45ae0f0..be8e65df8 100644 --- a/problems/zigzag-conversion/README.md +++ b/problems/zigzag-conversion/README.md @@ -9,7 +9,7 @@ ใใใใใใใใใใใใใใใใ [Next >](https://github.com/openset/leetcode/tree/master/problems/reverse-integer "Reverse Integer") -## 6. ZigZag Conversion (Medium) +## [6. ZigZag Conversion (Medium)](https://leetcode.com/problems/zigzag-conversion "Z ๅญๅฝขๅๆข")The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)
Think about Zuma Game. You have a row of balls on the table, colored red(R), yellow(Y), blue(B), green(G), and white(W). You also have several balls in your hand.
diff --git a/readme/301-600.md b/readme/301-600.md index 72daf771e..15ab4567d 100644 --- a/readme/301-600.md +++ b/readme/301-600.md @@ -265,7 +265,7 @@ LeetCode Problems' Solutions | 509 | [Fibonacci Number](https://leetcode.com/problems/fibonacci-number "ๆๆณข้ฃๅฅๆฐ") | [Go](https://github.com/openset/leetcode/tree/master/problems/fibonacci-number) | Easy | | 510 | [Inorder Successor in BST II](https://leetcode.com/problems/inorder-successor-in-bst-ii "ไบๅๆ็ดขๆ ไธญ็ไธญๅบๅ็ปง II") ๐ | [Go](https://github.com/openset/leetcode/tree/master/problems/inorder-successor-in-bst-ii) | Medium | | 511 | [Game Play Analysis I](https://leetcode.com/problems/game-play-analysis-i "ๆธธๆ็ฉๆณๅๆ I") ๐ | [MySQL](https://github.com/openset/leetcode/tree/master/problems/game-play-analysis-i) | Easy | -| 512 | [Game Play Analysis II](https://leetcode.com/problems/game-play-analysis-ii) ๐ | [MySQL](https://github.com/openset/leetcode/tree/master/problems/game-play-analysis-ii) | Easy | +| 512 | [Game Play Analysis II](https://leetcode.com/problems/game-play-analysis-ii "ๆธธๆ็ฉๆณๅๆ II") ๐ | [MySQL](https://github.com/openset/leetcode/tree/master/problems/game-play-analysis-ii) | Easy | | 513 | [Find Bottom Left Tree Value](https://leetcode.com/problems/find-bottom-left-tree-value "ๆพๆ ๅทฆไธ่ง็ๅผ") | [Go](https://github.com/openset/leetcode/tree/master/problems/find-bottom-left-tree-value) | Medium | | 514 | [Freedom Trail](https://leetcode.com/problems/freedom-trail "่ช็ฑไน่ทฏ") | [Go](https://github.com/openset/leetcode/tree/master/problems/freedom-trail) | Hard | | 515 | [Find Largest Value in Each Tree Row](https://leetcode.com/problems/find-largest-value-in-each-tree-row "ๅจๆฏไธชๆ ่กไธญๆพๆๅคงๅผ") | [Go](https://github.com/openset/leetcode/tree/master/problems/find-largest-value-in-each-tree-row) | Medium |