diff --git a/docs-en/index.md b/docs-en/index.md new file mode 100644 index 0000000000000..30b63efd3842d --- /dev/null +++ b/docs-en/index.md @@ -0,0 +1 @@ +# LeetCode EN Wiki diff --git a/docs-en/javascripts/katex.js b/docs-en/javascripts/katex.js new file mode 100644 index 0000000000000..af8344434bda8 --- /dev/null +++ b/docs-en/javascripts/katex.js @@ -0,0 +1,10 @@ +document$.subscribe(({ body }) => { + renderMathInElement(body, { + delimiters: [ + { left: '$$', right: '$$', display: true }, + { left: '$', right: '$', display: false }, + { left: '\\(', right: '\\)', display: false }, + { left: '\\[', right: '\\]', display: true }, + ], + }); +}); diff --git a/docs/index.md b/docs/index.md new file mode 100644 index 0000000000000..ba03f68b486ff --- /dev/null +++ b/docs/index.md @@ -0,0 +1 @@ +# LeetCode Wiki diff --git a/docs/javascripts/katex.js b/docs/javascripts/katex.js new file mode 100644 index 0000000000000..af8344434bda8 --- /dev/null +++ b/docs/javascripts/katex.js @@ -0,0 +1,10 @@ +document$.subscribe(({ body }) => { + renderMathInElement(body, { + delimiters: [ + { left: '$$', right: '$$', display: true }, + { left: '$', right: '$', display: false }, + { left: '\\(', right: '\\)', display: false }, + { left: '\\[', right: '\\]', display: true }, + ], + }); +}); diff --git a/main.py b/main.py index c24f20d791089..51e5bb0bcb007 100644 --- a/main.py +++ b/main.py @@ -1,25 +1,42 @@ -from itertools import pairwise import os import re +from collections import defaultdict + +# 获取 leetcode 题目，结构如下： +""" +- solution + - 0000-0099 + - 0001.Two Sum/README.md + - 0002.Add Two Numbers/README.md + - 0100-0199 + - 0100.Same Tree/README.md + - 0101.Symmetric Tree/README.md +- lcof + - 面试题03. 数组中重复的数字/README.md + - 面试题04. 二维数组中的查找/README.md +- lcof2 + - 剑指 Offer II 001. 整数除法/README.md + - 剑指 Offer II 002. 二进制加法/README.md +- lcci + - 01.01.Is Unique/README.md + - 01.02.Check Permutation/README.md +""" + +# 生成 leetcode 题目导航 +""" +nav: + - LeetCode: + - 1. 两数之和: lc/1.md + - 2. 两数相加: lc/2.md + - 100. 相同的树: lc/100.md + - 剑指 Offer（第 2 版）: + - 面试题3. 数组中重复的数字: lcof/3.md + - 剑指 Offer（专项突击版）： + - 1. 整数除法: lcof2/1.md + - 程序员面试金典（第 6 版）: + - 面试题 01.01. 判定字符是否唯一: lcci/1.1.md +""" -sorted_suffixes = [ - "py", - "java", - "cpp", - "go", - "ts", - "rs", - "js", - "cs", - "php", - "c", - "scala", - "swift", - "rb", - "kt", - "nim", - "sql", -] code_dict = { "py": ("Python3", "python"), "java": ("Java", "java"), @@ -39,162 +56,144 @@ "sql": ("MySQL", "sql"), } +mapping = {lang: name for name, lang in code_dict.values()} -# 抽取代码块 -def extract_code(): - paths = [] - for root, _, files in os.walk(os.getcwd()): - for file in files: - path = root + "/" + file - if "node_modules" in path or "__pycache__" in path or ".git" in path: - continue - if root == "D:\github-repo\leetcode": - continue - if path.endswith("README.md"): - paths.append(path) - for path in paths: - with open(path, "r", encoding="utf-8") as f: - content = f.read() - mark = "" - i = content.find(mark) - if i == -1: - continue - content = content[i + len(mark) :] - for suffix, (_, suf) in code_dict.items(): - res = re.findall(f"```{suf}\n(.*?)```", content, re.S) - if not res: - continue - cnt = 1 - for block in res: - if not block or not block.strip(): - continue - if suf in ["java", "cpp", "go", "c"]: - block = block.rstrip() - name = f"{path[:path.rfind('/')]}/Solution{'' if cnt == 1 else str(cnt)}.{suffix}" - with open(name, "w", encoding="utf-8") as f: - f.write(block) - cnt += 1 - - -def parse_content(content, start, end, titles): - i = content.find(start) - if i == -1: - return [] - j = content.find(end) - if j == -1: - return [] - content = content[i + len(start) : j] - blocks = [] - idx = [content.find(title) for title in titles] - for l, r in pairwise(idx): - block = content[l:r].strip() - if not block: - continue - line = block.split("\n")[0] - method_name = line[2:-2] - block = block.replace(line, f"### {method_name}") - blocks.append(block) - return blocks - - -def extract_solution_paragraph(): +with open("mkdocs.yml", "r", encoding="utf-8") as f: + config = f.read() + +with open("mkdocs-en.yml", "r", encoding="utf-8") as f: + en_config = f.read() + + +def get_paths(dirs: str, m: int): + dirs = 'main' + os.sep + dirs paths = [] - for root, _, files in os.walk(os.getcwd()): + for root, _, files in os.walk(dirs): for file in files: - path = root + "/" + file - if "node_modules" in path or "__pycache__" in path or ".git" in path: - continue - if root == "D:\github-repo\leetcode": - continue - if path.endswith("README.md") or path.endswith("README_EN.md"): - paths.append(path) - for path in paths: - with open(path, "r", encoding="utf-8") as f: - content = f.read() + file_name = os.path.join(root, file) + if file.endswith(".md") and len(file_name.split(os.sep)) == m: + paths.append(file_name) + return paths - is_cn = path.endswith("README.md") - if is_cn: - blocks = parse_content( - content, - "## 解法", - "", - ["**方法一：", "**方法二：", "**方法三：", "**方法四："], - ) - else: - print(path) - blocks = parse_content( - content, - "## Solutions", - "", - ["**Solution 1:", "**Solution 2:", "**Solution 3:", "**Solution 4:"], - ) - prefix = path[: path.rfind("/")] - tab_start = "" - tab_end = "" - for i in range(1, 5): - codes = [] - for suf in sorted_suffixes: - seq = '' if i == 1 else str(i) - file_name = f"{prefix}/Solution{seq}.{suf}" - try: - with open(file_name, "r", encoding="utf-8") as f: - code = f.read().strip() - code = '```' + code_dict[suf][1] + '\n' + code + '\n```' - codes.append(code) - except: - continue - if codes: - if i > len(blocks): - seq_dict = {1: '一', 2: '二', 3: '三', 4: '四'} - title = f"### 方法{seq_dict[i]}" if is_cn else f"### Solution {i}" - block = ( - title - + '\n\n' - + tab_start - + '\n\n' - + '\n\n'.join(codes) - + '\n\n' - + tab_end - ) - blocks.append(block) - else: - block = ( - blocks[i - 1] - + '\n\n' - + tab_start - + '\n\n' - + '\n\n'.join(codes) - + '\n\n' - + tab_end - ) - blocks[i - 1] = block - is_problem = ( - content.find("## 解法") != -1 - if is_cn - else content.find("## Solutions") != -1 - and content.find("## Description") != -1 - ) - start = '## 解法' if is_cn else '## Solutions' - end = '' - if blocks: - content = ( - content[: content.find(start)] - + start - + '\n\n' - + '\n\n'.join(blocks) - + '\n\n' - + end +dirs_mapping = { + "solution": ("lc", 5), + "lcof": ("lcof", 4), + "lcof2": ("lcof2", 4), + "lcci": ("lcci", 4), + "lcp": ("lcp", 4), + "lcs": ("lcs", 4), +} + +dirs = ["solution", "lcof", "lcof2", "lcci", "lcp", "lcs"] + +""" +nav: + - LeetCode + - 1. 两数之和: lc/1.md + - 2. 两数相加: lc/2.md +""" + +navdata_cn = defaultdict(list) +navdata_en = defaultdict(list) + +for dir in dirs: + target_dir, m = dirs_mapping[dir] + for p in sorted(get_paths(dir, m)): + with open(p, "r", encoding="utf-8") as f: + content = f.read() + title = content[content.find("[") + 1 : content.find("]")] + dot = title.find(".") if dir != "lcci" else title.rfind(".") + num = ( + title[:dot] + .replace("面试题", "") + .replace("剑指 Offer II", "") + .replace("LCP", "") + .replace("LCS", "") + .strip(" ") + .lstrip("0") ) - with open(path, "w", encoding="utf-8") as f: - f.write(content) - elif is_problem: - start = '## 解法' if is_cn else '## Solutions' - content = content[: content.find(start)] + start + '\n\n' + end - with open(path, "w", encoding="utf-8") as f: + name = ( + title[dot + 1 :] + .replace("面试题", "") + .replace("剑指 Offer II", "") + .replace("LCP", "") + .replace("LCS", "") + .strip(" ") + .lstrip("0") + ) + if num.endswith("- III"): + num = num[:-5] + ".3" + elif num.endswith("- II"): + num = num[:-4] + ".2" + elif num.endswith("- I"): + num = num[:-3] + ".1" + num = ".".join([x.strip(" ").lstrip("0") for x in num.split(".")]) + is_en = "README_EN" in p + if is_en: + navdata_en[dir].append(f" - {num}. {name}: {target_dir}/{num}.md") + else: + navdata_cn[dir].append(f" - {num}. {name}: {target_dir}/{num}.md") + # 修改代码块 + while True: + start = "" + end = "" + i = content.find(start) + j = content.find(end) + if i == -1 or j == -1: + break + j = content.find(end) + codes = content[i + len(start) : j].strip() + res = re.findall(r"```(.+?)\n(.+?)\n```", codes, re.DOTALL) + result = [] + if res: + for lang, code in res: + name = mapping.get(lang) + # 需要将 code 缩进 4 个空格 + code = code.replace("\n", "\n ") + code_snippet = ( + f'=== "{name}"\n\n ```{lang}\n {code}\n ```\n' + ) + result.append(code_snippet) + content = content[:i] + "\n".join(result) + content[j + len(end) :] + docs_dir = ("docs-en" if is_en else "docs") + os.sep + target_dir + if not os.path.exists(docs_dir): + os.makedirs(docs_dir) + new_path = os.path.join(docs_dir, f"{num}.md") + with open(new_path, "w", encoding="utf-8") as f: f.write(content) + navdata_en[dir].sort(key=lambda x: int(x.split(".")[0].split(" ")[-1])) + navdata_cn[dir].sort(key=lambda x: int(x.split(".")[0].split(" ")[-1])) + +if "nav:" in config: + config = config[: config.find("nav:")] +if "nav:" in en_config: + en_config = en_config[: en_config.find("nav:")] + +config += "\nnav:\n" +en_config += "\nnav:\n" +config += " - LeetCode:\n" +en_config += " - LeetCode:\n" +config += "\n".join(navdata_cn["solution"]) +en_config += "\n".join(navdata_en["solution"]) +config += "\n" +en_config += "\n" +config += " - 剑指 Offer（第 2 版）:\n" +config += "\n".join(navdata_cn["lcof"]) +config += "\n" +config += " - 剑指 Offer（专项突击版）:\n" +config += "\n".join(navdata_cn["lcof2"]) +config += "\n" +config += " - 程序员面试金典（第 6 版）:\n" +config += "\n".join(navdata_cn["lcci"]) +config += "\n" +en_config += " - Cracking the Coding Interview, 6th Edition:\n" +en_config += "\n".join(navdata_en["lcci"]) +en_config += "\n" + +with open("mkdocs.yml", "w", encoding="utf-8") as f: + f.write(config) -if __name__ == "__main__": - extract_code() - extract_solution_paragraph() +with open("mkdocs-en.yml", "w", encoding="utf-8") as f: + f.write(en_config) diff --git a/mkdocs-en.yml b/mkdocs-en.yml new file mode 100644 index 0000000000000..5c6db572e33ed --- /dev/null +++ b/mkdocs-en.yml @@ -0,0 +1,3127 @@ +INHERIT: mkdocs.yml +site_description: LeetCode solutions in any programming language +docs_dir: docs-en + + + + +nav: + - LeetCode: + - 1. Two Sum: lc/1.md + - 2. Add Two Numbers: lc/2.md + - 3. Longest Substring Without Repeating Characters: lc/3.md + - 4. Median of Two Sorted Arrays: lc/4.md + - 5. Longest Palindromic Substring: lc/5.md + - 6. Zigzag Conversion: lc/6.md + - 7. Reverse Integer: lc/7.md + - 8. String to Integer (atoi): lc/8.md + - 9. Palindrome Number: lc/9.md + - 10. Regular Expression Matching: lc/10.md + - 11. Container With Most Water: lc/11.md + - 12. Integer to Roman: lc/12.md + - 13. Roman to Integer: lc/13.md + - 14. Longest Common Prefix: lc/14.md + - 15. 3Sum: lc/15.md + - 16. 3Sum Closest: lc/16.md + - 17. Letter Combinations of a Phone Number: lc/17.md + - 18. 4Sum: lc/18.md + - 19. Remove Nth Node From End of List: lc/19.md + - 20. Valid Parentheses: lc/20.md + - 21. Merge Two Sorted Lists: lc/21.md + - 22. Generate Parentheses: lc/22.md + - 23. Merge k Sorted Lists: lc/23.md + - 24. Swap Nodes in Pairs: lc/24.md + - 25. Reverse Nodes in k-Group: lc/25.md + - 26. Remove Duplicates from Sorted Array: lc/26.md + - 27. Remove Element: lc/27.md + - 28. Find the Index of the First Occurrence in a String: lc/28.md + - 29. Divide Two Integers: lc/29.md + - 30. Substring with Concatenation of All Words: lc/30.md + - 31. Next Permutation: lc/31.md + - 32. Longest Valid Parentheses: lc/32.md + - 33. Search in Rotated Sorted Array: lc/33.md + - 34. Find First and Last Position of Element in Sorted Array: lc/34.md + - 35. Search Insert Position: lc/35.md + - 36. Valid Sudoku: lc/36.md + - 37. Sudoku Solver: lc/37.md + - 38. Count and Say: lc/38.md + - 39. Combination Sum: lc/39.md + - 40. Combination Sum II: lc/40.md + - 41. First Missing Positive: lc/41.md + - 42. Trapping Rain Water: lc/42.md + - 43. Multiply Strings: lc/43.md + - 44. Wildcard Matching: lc/44.md + - 45. Jump Game II: lc/45.md + - 46. Permutations: lc/46.md + - 47. Permutations II: lc/47.md + - 48. Rotate Image: lc/48.md + - 49. Group Anagrams: lc/49.md + - 50. Pow(x, n): lc/50.md + - 51. N-Queens: lc/51.md + - 52. N-Queens II: lc/52.md + - 53. Maximum Subarray: lc/53.md + - 54. Spiral Matrix: lc/54.md + - 55. Jump Game: lc/55.md + - 56. Merge Intervals: lc/56.md + - 57. Insert Interval: lc/57.md + - 58. Length of Last Word: lc/58.md + - 59. Spiral Matrix II: lc/59.md + - 60. Permutation Sequence: lc/60.md + - 61. Rotate List: lc/61.md + - 62. Unique Paths: lc/62.md + - 63. Unique Paths II: lc/63.md + - 64. Minimum Path Sum: lc/64.md + - 65. Valid Number: lc/65.md + - 66. Plus One: lc/66.md + - 67. Add Binary: lc/67.md + - 68. Text Justification: lc/68.md + - 69. Sqrt(x): lc/69.md + - 70. Climbing Stairs: lc/70.md + - 71. Simplify Path: lc/71.md + - 72. Edit Distance: lc/72.md + - 73. Set Matrix Zeroes: lc/73.md + - 74. Search a 2D Matrix: lc/74.md + - 75. Sort Colors: lc/75.md + - 76. Minimum Window Substring: lc/76.md + - 77. Combinations: lc/77.md + - 78. Subsets: lc/78.md + - 79. Word Search: lc/79.md + - 80. Remove Duplicates from Sorted Array II: lc/80.md + - 81. Search in Rotated Sorted Array II: lc/81.md + - 82. Remove Duplicates from Sorted List II: lc/82.md + - 83. Remove Duplicates from Sorted List: lc/83.md + - 84. Largest Rectangle in Histogram: lc/84.md + - 85. Maximal Rectangle: lc/85.md + - 86. Partition List: lc/86.md + - 87. Scramble String: lc/87.md + - 88. Merge Sorted Array: lc/88.md + - 89. Gray Code: lc/89.md + - 90. Subsets II: lc/90.md + - 91. Decode Ways: lc/91.md + - 92. Reverse Linked List II: lc/92.md + - 93. Restore IP Addresses: lc/93.md + - 94. Binary Tree Inorder Traversal: lc/94.md + - 95. Unique Binary Search Trees II: lc/95.md + - 96. Unique Binary Search Trees: lc/96.md + - 97. Interleaving String: lc/97.md + - 98. Validate Binary Search Tree: lc/98.md + - 99. Recover Binary Search Tree: lc/99.md + - 100. Same Tree: lc/100.md + - 101. Symmetric Tree: lc/101.md + - 102. Binary Tree Level Order Traversal: lc/102.md + - 103. Binary Tree Zigzag Level Order Traversal: lc/103.md + - 104. Maximum Depth of Binary Tree: lc/104.md + - 105. Construct Binary Tree from Preorder and Inorder Traversal: lc/105.md + - 106. Construct Binary Tree from Inorder and Postorder Traversal: lc/106.md + - 107. Binary Tree Level Order Traversal II: lc/107.md + - 108. Convert Sorted Array to Binary Search Tree: lc/108.md + - 109. Convert Sorted List to Binary Search Tree: lc/109.md + - 110. Balanced Binary Tree: lc/110.md + - 111. Minimum Depth of Binary Tree: lc/111.md + - 112. Path Sum: lc/112.md + - 113. Path Sum II: lc/113.md + - 114. Flatten Binary Tree to Linked List: lc/114.md + - 115. Distinct Subsequences: lc/115.md + - 116. Populating Next Right Pointers in Each Node: lc/116.md + - 117. Populating Next Right Pointers in Each Node II: lc/117.md + - 118. Pascal's Triangle: lc/118.md + - 119. Pascal's Triangle II: lc/119.md + - 120. Triangle: lc/120.md + - 121. Best Time to Buy and Sell Stock: lc/121.md + - 122. Best Time to Buy and Sell Stock II: lc/122.md + - 123. Best Time to Buy and Sell Stock III: lc/123.md + - 124. Binary Tree Maximum Path Sum: lc/124.md + - 125. Valid Palindrome: lc/125.md + - 126. Word Ladder II: lc/126.md + - 127. Word Ladder: lc/127.md + - 128. Longest Consecutive Sequence: lc/128.md + - 129. Sum Root to Leaf Numbers: lc/129.md + - 130. Surrounded Regions: lc/130.md + - 131. Palindrome Partitioning: lc/131.md + - 132. Palindrome Partitioning II: lc/132.md + - 133. Clone Graph: lc/133.md + - 134. Gas Station: lc/134.md + - 135. Candy: lc/135.md + - 136. Single Number: lc/136.md + - 137. Single Number II: lc/137.md + - 138. Copy List with Random Pointer: lc/138.md + - 139. Word Break: lc/139.md + - 140. Word Break II: lc/140.md + - 141. Linked List Cycle: lc/141.md + - 142. Linked List Cycle II: lc/142.md + - 143. Reorder List: lc/143.md + - 144. Binary Tree Preorder Traversal: lc/144.md + - 145. Binary Tree Postorder Traversal: lc/145.md + - 146. LRU Cache: lc/146.md + - 147. Insertion Sort List: lc/147.md + - 148. Sort List: lc/148.md + - 149. Max Points on a Line: lc/149.md + - 150. Evaluate Reverse Polish Notation: lc/150.md + - 151. Reverse Words in a String: lc/151.md + - 152. Maximum Product Subarray: lc/152.md + - 153. Find Minimum in Rotated Sorted Array: lc/153.md + - 154. Find Minimum in Rotated Sorted Array II: lc/154.md + - 155. Min Stack: lc/155.md + - 156. Binary Tree Upside Down: lc/156.md + - 157. Read N Characters Given Read4: lc/157.md + - 158. Read N Characters Given read4 II - Call Multiple Times: lc/158.md + - 159. Longest Substring with At Most Two Distinct Characters: lc/159.md + - 160. Intersection of Two Linked Lists: lc/160.md + - 161. One Edit Distance: lc/161.md + - 162. Find Peak Element: lc/162.md + - 163. Missing Ranges: lc/163.md + - 164. Maximum Gap: lc/164.md + - 165. Compare Version Numbers: lc/165.md + - 166. Fraction to Recurring Decimal: lc/166.md + - 167. Two Sum II - Input Array Is Sorted: lc/167.md + - 168. Excel Sheet Column Title: lc/168.md + - 169. Majority Element: lc/169.md + - 170. Two Sum III - Data structure design: lc/170.md + - 171. Excel Sheet Column Number: lc/171.md + - 172. Factorial Trailing Zeroes: lc/172.md + - 173. Binary Search Tree Iterator: lc/173.md + - 174. Dungeon Game: lc/174.md + - 175. Combine Two Tables: lc/175.md + - 176. Second Highest Salary: lc/176.md + - 177. Nth Highest Salary: lc/177.md + - 178. Rank Scores: lc/178.md + - 179. Largest Number: lc/179.md + - 180. Consecutive Numbers: lc/180.md + - 181. Employees Earning More Than Their Managers: lc/181.md + - 182. Duplicate Emails: lc/182.md + - 183. Customers Who Never Order: lc/183.md + - 184. Department Highest Salary: lc/184.md + - 185. Department Top Three Salaries: lc/185.md + - 186. Reverse Words in a String II: lc/186.md + - 187. Repeated DNA Sequences: lc/187.md + - 188. Best Time to Buy and Sell Stock IV: lc/188.md + - 189. Rotate Array: lc/189.md + - 190. Reverse Bits: lc/190.md + - 191. Number of 1 Bits: lc/191.md + - 192. Word Frequency: lc/192.md + - 193. Valid Phone Numbers: lc/193.md + - 194. Transpose File: lc/194.md + - 195. Tenth Line: lc/195.md + - 196. Delete Duplicate Emails: lc/196.md + - 197. Rising Temperature: lc/197.md + - 198. House Robber: lc/198.md + - 199. Binary Tree Right Side View: lc/199.md + - 200. Number of Islands: lc/200.md + - 201. Bitwise AND of Numbers Range: lc/201.md + - 202. Happy Number: lc/202.md + - 203. Remove Linked List Elements: lc/203.md + - 204. Count Primes: lc/204.md + - 205. Isomorphic Strings: lc/205.md + - 206. Reverse Linked List: lc/206.md + - 207. Course Schedule: lc/207.md + - 208. Implement Trie (Prefix Tree): lc/208.md + - 209. Minimum Size Subarray Sum: lc/209.md + - 210. Course Schedule II: lc/210.md + - 211. Design Add and Search Words Data Structure: lc/211.md + - 212. Word Search II: lc/212.md + - 213. House Robber II: lc/213.md + - 214. Shortest Palindrome: lc/214.md + - 215. Kth Largest Element in an Array: lc/215.md + - 216. Combination Sum III: lc/216.md + - 217. Contains Duplicate: lc/217.md + - 218. The Skyline Problem: lc/218.md + - 219. Contains Duplicate II: lc/219.md + - 220. Contains Duplicate III: lc/220.md + - 221. Maximal Square: lc/221.md + - 222. Count Complete Tree Nodes: lc/222.md + - 223. Rectangle Area: lc/223.md + - 224. Basic Calculator: lc/224.md + - 225. Implement Stack using Queues: lc/225.md + - 226. Invert Binary Tree: lc/226.md + - 227. Basic Calculator II: lc/227.md + - 228. Summary Ranges: lc/228.md + - 229. Majority Element II: lc/229.md + - 230. Kth Smallest Element in a BST: lc/230.md + - 231. Power of Two: lc/231.md + - 232. Implement Queue using Stacks: lc/232.md + - 233. Number of Digit One: lc/233.md + - 234. Palindrome Linked List: lc/234.md + - 235. Lowest Common Ancestor of a Binary Search Tree: lc/235.md + - 236. Lowest Common Ancestor of a Binary Tree: lc/236.md + - 237. Delete Node in a Linked List: lc/237.md + - 238. Product of Array Except Self: lc/238.md + - 239. Sliding Window Maximum: lc/239.md + - 240. Search a 2D Matrix II: lc/240.md + - 241. Different Ways to Add Parentheses: lc/241.md + - 242. Valid Anagram: lc/242.md + - 243. Shortest Word Distance: lc/243.md + - 244. Shortest Word Distance II: lc/244.md + - 245. Shortest Word Distance III: lc/245.md + - 246. Strobogrammatic Number: lc/246.md + - 247. Strobogrammatic Number II: lc/247.md + - 248. Strobogrammatic Number III: lc/248.md + - 249. Group Shifted Strings: lc/249.md + - 250. Count Univalue Subtrees: lc/250.md + - 251. Flatten 2D Vector: lc/251.md + - 252. Meeting Rooms: lc/252.md + - 253. Meeting Rooms II: lc/253.md + - 254. Factor Combinations: lc/254.md + - 255. Verify Preorder Sequence in Binary Search Tree: lc/255.md + - 256. Paint House: lc/256.md + - 257. Binary Tree Paths: lc/257.md + - 258. Add Digits: lc/258.md + - 259. 3Sum Smaller: lc/259.md + - 260. Single Number III: lc/260.md + - 261. Graph Valid Tree: lc/261.md + - 262. Trips and Users: lc/262.md + - 263. Ugly Number: lc/263.md + - 264. Ugly Number II: lc/264.md + - 265. Paint House II: lc/265.md + - 266. Palindrome Permutation: lc/266.md + - 267. Palindrome Permutation II: lc/267.md + - 268. Missing Number: lc/268.md + - 269. Alien Dictionary: lc/269.md + - 270. Closest Binary Search Tree Value: lc/270.md + - 271. Encode and Decode Strings: lc/271.md + - 272. Closest Binary Search Tree Value II: lc/272.md + - 273. Integer to English Words: lc/273.md + - 274. H-Index: lc/274.md + - 275. H-Index II: lc/275.md + - 276. Paint Fence: lc/276.md + - 277. Find the Celebrity: lc/277.md + - 278. First Bad Version: lc/278.md + - 279. Perfect Squares: lc/279.md + - 280. Wiggle Sort: lc/280.md + - 281. Zigzag Iterator: lc/281.md + - 282. Expression Add Operators: lc/282.md + - 283. Move Zeroes: lc/283.md + - 284. Peeking Iterator: lc/284.md + - 285. Inorder Successor in BST: lc/285.md + - 286. Walls and Gates: lc/286.md + - 287. Find the Duplicate Number: lc/287.md + - 288. Unique Word Abbreviation: lc/288.md + - 289. Game of Life: lc/289.md + - 290. Word Pattern: lc/290.md + - 291. Word Pattern II: lc/291.md + - 292. Nim Game: lc/292.md + - 293. Flip Game: lc/293.md + - 294. Flip Game II: lc/294.md + - 295. Find Median from Data Stream: lc/295.md + - 296. Best Meeting Point: lc/296.md + - 297. Serialize and Deserialize Binary Tree: lc/297.md + - 298. Binary Tree Longest Consecutive Sequence: lc/298.md + - 299. Bulls and Cows: lc/299.md + - 300. Longest Increasing Subsequence: lc/300.md + - 301. Remove Invalid Parentheses: lc/301.md + - 302. Smallest Rectangle Enclosing Black Pixels: lc/302.md + - 303. Range Sum Query - Immutable: lc/303.md + - 304. Range Sum Query 2D - Immutable: lc/304.md + - 305. Number of Islands II: lc/305.md + - 306. Additive Number: lc/306.md + - 307. Range Sum Query - Mutable: lc/307.md + - 308. Range Sum Query 2D - Mutable: lc/308.md + - 309. Best Time to Buy and Sell Stock with Cooldown: lc/309.md + - 310. Minimum Height Trees: lc/310.md + - 311. Sparse Matrix Multiplication: lc/311.md + - 312. Burst Balloons: lc/312.md + - 313. Super Ugly Number: lc/313.md + - 314. Binary Tree Vertical Order Traversal: lc/314.md + - 315. Count of Smaller Numbers After Self: lc/315.md + - 316. Remove Duplicate Letters: lc/316.md + - 317. Shortest Distance from All Buildings: lc/317.md + - 318. Maximum Product of Word Lengths: lc/318.md + - 319. Bulb Switcher: lc/319.md + - 320. Generalized Abbreviation: lc/320.md + - 321. Create Maximum Number: lc/321.md + - 322. Coin Change: lc/322.md + - 323. Number of Connected Components in an Undirected Graph: lc/323.md + - 324. Wiggle Sort II: lc/324.md + - 325. Maximum Size Subarray Sum Equals k: lc/325.md + - 326. Power of Three: lc/326.md + - 327. Count of Range Sum: lc/327.md + - 328. Odd Even Linked List: lc/328.md + - 329. Longest Increasing Path in a Matrix: lc/329.md + - 330. Patching Array: lc/330.md + - 331. Verify Preorder Serialization of a Binary Tree: lc/331.md + - 332. Reconstruct Itinerary: lc/332.md + - 333. Largest BST Subtree: lc/333.md + - 334. Increasing Triplet Subsequence: lc/334.md + - 335. Self Crossing: lc/335.md + - 336. Palindrome Pairs: lc/336.md + - 337. House Robber III: lc/337.md + - 338. Counting Bits: lc/338.md + - 339. Nested List Weight Sum: lc/339.md + - 340. Longest Substring with At Most K Distinct Characters: lc/340.md + - 341. Flatten Nested List Iterator: lc/341.md + - 342. Power of Four: lc/342.md + - 343. Integer Break: lc/343.md + - 344. Reverse String: lc/344.md + - 345. Reverse Vowels of a String: lc/345.md + - 346. Moving Average from Data Stream: lc/346.md + - 347. Top K Frequent Elements: lc/347.md + - 348. Design Tic-Tac-Toe: lc/348.md + - 349. Intersection of Two Arrays: lc/349.md + - 350. Intersection of Two Arrays II: lc/350.md + - 351. Android Unlock Patterns: lc/351.md + - 352. Data Stream as Disjoint Intervals: lc/352.md + - 353. Design Snake Game: lc/353.md + - 354. Russian Doll Envelopes: lc/354.md + - 355. Design Twitter: lc/355.md + - 356. Line Reflection: lc/356.md + - 357. Count Numbers with Unique Digits: lc/357.md + - 358. Rearrange String k Distance Apart: lc/358.md + - 359. Logger Rate Limiter: lc/359.md + - 360. Sort Transformed Array: lc/360.md + - 361. Bomb Enemy: lc/361.md + - 362. Design Hit Counter: lc/362.md + - 363. Max Sum of Rectangle No Larger Than K: lc/363.md + - 364. Nested List Weight Sum II: lc/364.md + - 365. Water and Jug Problem: lc/365.md + - 366. Find Leaves of Binary Tree: lc/366.md + - 367. Valid Perfect Square: lc/367.md + - 368. Largest Divisible Subset: lc/368.md + - 369. Plus One Linked List: lc/369.md + - 370. Range Addition: lc/370.md + - 371. Sum of Two Integers: lc/371.md + - 372. Super Pow: lc/372.md + - 373. Find K Pairs with Smallest Sums: lc/373.md + - 374. Guess Number Higher or Lower: lc/374.md + - 375. Guess Number Higher or Lower II: lc/375.md + - 376. Wiggle Subsequence: lc/376.md + - 377. Combination Sum IV: lc/377.md + - 378. Kth Smallest Element in a Sorted Matrix: lc/378.md + - 379. Design Phone Directory: lc/379.md + - 380. Insert Delete GetRandom O(1): lc/380.md + - 381. Insert Delete GetRandom O(1) - Duplicates allowed: lc/381.md + - 382. Linked List Random Node: lc/382.md + - 383. Ransom Note: lc/383.md + - 384. Shuffle an Array: lc/384.md + - 385. Mini Parser: lc/385.md + - 386. Lexicographical Numbers: lc/386.md + - 387. First Unique Character in a String: lc/387.md + - 388. Longest Absolute File Path: lc/388.md + - 389. Find the Difference: lc/389.md + - 390. Elimination Game: lc/390.md + - 391. Perfect Rectangle: lc/391.md + - 392. Is Subsequence: lc/392.md + - 393. UTF-8 Validation: lc/393.md + - 394. Decode String: lc/394.md + - 395. Longest Substring with At Least K Repeating Characters: lc/395.md + - 396. Rotate Function: lc/396.md + - 397. Integer Replacement: lc/397.md + - 398. Random Pick Index: lc/398.md + - 399. Evaluate Division: lc/399.md + - 400. Nth Digit: lc/400.md + - 401. Binary Watch: lc/401.md + - 402. Remove K Digits: lc/402.md + - 403. Frog Jump: lc/403.md + - 404. Sum of Left Leaves: lc/404.md + - 405. Convert a Number to Hexadecimal: lc/405.md + - 406. Queue Reconstruction by Height: lc/406.md + - 407. Trapping Rain Water II: lc/407.md + - 408. Valid Word Abbreviation: lc/408.md + - 409. Longest Palindrome: lc/409.md + - 410. Split Array Largest Sum: lc/410.md + - 411. Minimum Unique Word Abbreviation: lc/411.md + - 412. Fizz Buzz: lc/412.md + - 413. Arithmetic Slices: lc/413.md + - 414. Third Maximum Number: lc/414.md + - 415. Add Strings: lc/415.md + - 416. Partition Equal Subset Sum: lc/416.md + - 417. Pacific Atlantic Water Flow: lc/417.md + - 418. Sentence Screen Fitting: lc/418.md + - 419. Battleships in a Board: lc/419.md + - 420. Strong Password Checker: lc/420.md + - 421. Maximum XOR of Two Numbers in an Array: lc/421.md + - 422. Valid Word Square: lc/422.md + - 423. Reconstruct Original Digits from English: lc/423.md + - 424. Longest Repeating Character Replacement: lc/424.md + - 425. Word Squares: lc/425.md + - 426. Convert Binary Search Tree to Sorted Doubly Linked List: lc/426.md + - 427. Construct Quad Tree: lc/427.md + - 428. Serialize and Deserialize N-ary Tree: lc/428.md + - 429. N-ary Tree Level Order Traversal: lc/429.md + - 430. Flatten a Multilevel Doubly Linked List: lc/430.md + - 431. Encode N-ary Tree to Binary Tree: lc/431.md + - 432. All O`one Data Structure: lc/432.md + - 433. Minimum Genetic Mutation: lc/433.md + - 434. Number of Segments in a String: lc/434.md + - 435. Non-overlapping Intervals: lc/435.md + - 436. Find Right Interval: lc/436.md + - 437. Path Sum III: lc/437.md + - 438. Find All Anagrams in a String: lc/438.md + - 439. Ternary Expression Parser: lc/439.md + - 440. K-th Smallest in Lexicographical Order: lc/440.md + - 441. Arranging Coins: lc/441.md + - 442. Find All Duplicates in an Array: lc/442.md + - 443. String Compression: lc/443.md + - 444. Sequence Reconstruction: lc/444.md + - 445. Add Two Numbers II: lc/445.md + - 446. Arithmetic Slices II - Subsequence: lc/446.md + - 447. Number of Boomerangs: lc/447.md + - 448. Find All Numbers Disappeared in an Array: lc/448.md + - 449. Serialize and Deserialize BST: lc/449.md + - 450. Delete Node in a BST: lc/450.md + - 451. Sort Characters By Frequency: lc/451.md + - 452. Minimum Number of Arrows to Burst Balloons: lc/452.md + - 453. Minimum Moves to Equal Array Elements: lc/453.md + - 454. 4Sum II: lc/454.md + - 455. Assign Cookies: lc/455.md + - 456. 132 Pattern: lc/456.md + - 457. Circular Array Loop: lc/457.md + - 458. Poor Pigs: lc/458.md + - 459. Repeated Substring Pattern: lc/459.md + - 460. LFU Cache: lc/460.md + - 461. Hamming Distance: lc/461.md + - 462. Minimum Moves to Equal Array Elements II: lc/462.md + - 463. Island Perimeter: lc/463.md + - 464. Can I Win: lc/464.md + - 465. Optimal Account Balancing: lc/465.md + - 466. Count The Repetitions: lc/466.md + - 467. Unique Substrings in Wraparound String: lc/467.md + - 468. Validate IP Address: lc/468.md + - 469. Convex Polygon: lc/469.md + - 470. Implement Rand10() Using Rand7(): lc/470.md + - 471. Encode String with Shortest Length: lc/471.md + - 472. Concatenated Words: lc/472.md + - 473. Matchsticks to Square: lc/473.md + - 474. Ones and Zeroes: lc/474.md + - 475. Heaters: lc/475.md + - 476. Number Complement: lc/476.md + - 477. Total Hamming Distance: lc/477.md + - 478. Generate Random Point in a Circle: lc/478.md + - 479. Largest Palindrome Product: lc/479.md + - 480. Sliding Window Median: lc/480.md + - 481. Magical String: lc/481.md + - 482. License Key Formatting: lc/482.md + - 483. Smallest Good Base: lc/483.md + - 484. Find Permutation: lc/484.md + - 485. Max Consecutive Ones: lc/485.md + - 486. Predict the Winner: lc/486.md + - 487. Max Consecutive Ones II: lc/487.md + - 488. Zuma Game: lc/488.md + - 489. Robot Room Cleaner: lc/489.md + - 490. The Maze: lc/490.md + - 491. Non-decreasing Subsequences: lc/491.md + - 492. Construct the Rectangle: lc/492.md + - 493. Reverse Pairs: lc/493.md + - 494. Target Sum: lc/494.md + - 495. Teemo Attacking: lc/495.md + - 496. Next Greater Element I: lc/496.md + - 497. Random Point in Non-overlapping Rectangles: lc/497.md + - 498. Diagonal Traverse: lc/498.md + - 499. The Maze III: lc/499.md + - 500. Keyboard Row: lc/500.md + - 501. Find Mode in Binary Search Tree: lc/501.md + - 502. IPO: lc/502.md + - 503. Next Greater Element II: lc/503.md + - 504. Base 7: lc/504.md + - 505. The Maze II: lc/505.md + - 506. Relative Ranks: lc/506.md + - 507. Perfect Number: lc/507.md + - 508. Most Frequent Subtree Sum: lc/508.md + - 509. Fibonacci Number: lc/509.md + - 510. Inorder Successor in BST II: lc/510.md + - 511. Game Play Analysis I: lc/511.md + - 512. Game Play Analysis II: lc/512.md + - 513. Find Bottom Left Tree Value: lc/513.md + - 514. Freedom Trail: lc/514.md + - 515. Find Largest Value in Each Tree Row: lc/515.md + - 516. Longest Palindromic Subsequence: lc/516.md + - 517. Super Washing Machines: lc/517.md + - 518. Coin Change II: lc/518.md + - 519. Random Flip Matrix: lc/519.md + - 520. Detect Capital: lc/520.md + - 521. Longest Uncommon Subsequence I: lc/521.md + - 522. Longest Uncommon Subsequence II: lc/522.md + - 523. Continuous Subarray Sum: lc/523.md + - 524. Longest Word in Dictionary through Deleting: lc/524.md + - 525. Contiguous Array: lc/525.md + - 526. Beautiful Arrangement: lc/526.md + - 527. Word Abbreviation: lc/527.md + - 528. Random Pick with Weight: lc/528.md + - 529. Minesweeper: lc/529.md + - 530. Minimum Absolute Difference in BST: lc/530.md + - 531. Lonely Pixel I: lc/531.md + - 532. K-diff Pairs in an Array: lc/532.md + - 533. Lonely Pixel II: lc/533.md + - 534. Game Play Analysis III: lc/534.md + - 535. Encode and Decode TinyURL: lc/535.md + - 536. Construct Binary Tree from String: lc/536.md + - 537. Complex Number Multiplication: lc/537.md + - 538. Convert BST to Greater Tree: lc/538.md + - 539. Minimum Time Difference: lc/539.md + - 540. Single Element in a Sorted Array: lc/540.md + - 541. Reverse String II: lc/541.md + - 542. 1 Matrix: lc/542.md + - 543. Diameter of Binary Tree: lc/543.md + - 544. Output Contest Matches: lc/544.md + - 545. Boundary of Binary Tree: lc/545.md + - 546. Remove Boxes: lc/546.md + - 547. Number of Provinces: lc/547.md + - 548. Split Array with Equal Sum: lc/548.md + - 549. Binary Tree Longest Consecutive Sequence II: lc/549.md + - 550. Game Play Analysis IV: lc/550.md + - 551. Student Attendance Record I: lc/551.md + - 552. Student Attendance Record II: lc/552.md + - 553. Optimal Division: lc/553.md + - 554. Brick Wall: lc/554.md + - 555. Split Concatenated Strings: lc/555.md + - 556. Next Greater Element III: lc/556.md + - 557. Reverse Words in a String III: lc/557.md + - 558. Logical OR of Two Binary Grids Represented as Quad-Trees: lc/558.md + - 559. Maximum Depth of N-ary Tree: lc/559.md + - 560. Subarray Sum Equals K: lc/560.md + - 561. Array Partition: lc/561.md + - 562. Longest Line of Consecutive One in Matrix: lc/562.md + - 563. Binary Tree Tilt: lc/563.md + - 564. Find the Closest Palindrome: lc/564.md + - 565. Array Nesting: lc/565.md + - 566. Reshape the Matrix: lc/566.md + - 567. Permutation in String: lc/567.md + - 568. Maximum Vacation Days: lc/568.md + - 569. Median Employee Salary: lc/569.md + - 570. Managers with at Least 5 Direct Reports: lc/570.md + - 571. Find Median Given Frequency of Numbers: lc/571.md + - 572. Subtree of Another Tree: lc/572.md + - 573. Squirrel Simulation: lc/573.md + - 574. Winning Candidate: lc/574.md + - 575. Distribute Candies: lc/575.md + - 576. Out of Boundary Paths: lc/576.md + - 577. Employee Bonus: lc/577.md + - 578. Get Highest Answer Rate Question: lc/578.md + - 579. Find Cumulative Salary of an Employee: lc/579.md + - 580. Count Student Number in Departments: lc/580.md + - 581. Shortest Unsorted Continuous Subarray: lc/581.md + - 582. Kill Process: lc/582.md + - 583. Delete Operation for Two Strings: lc/583.md + - 584. Find Customer Referee: lc/584.md + - 585. Investments in 2016: lc/585.md + - 586. Customer Placing the Largest Number of Orders: lc/586.md + - 587. Erect the Fence: lc/587.md + - 588. Design In-Memory File System: lc/588.md + - 589. N-ary Tree Preorder Traversal: lc/589.md + - 590. N-ary Tree Postorder Traversal: lc/590.md + - 591. Tag Validator: lc/591.md + - 592. Fraction Addition and Subtraction: lc/592.md + - 593. Valid Square: lc/593.md + - 594. Longest Harmonious Subsequence: lc/594.md + - 595. Big Countries: lc/595.md + - 596. Classes More Than 5 Students: lc/596.md + - 597. Friend Requests I Overall Acceptance Rate: lc/597.md + - 598. Range Addition II: lc/598.md + - 599. Minimum Index Sum of Two Lists: lc/599.md + - 600. Non-negative Integers without Consecutive Ones: lc/600.md + - 601. Human Traffic of Stadium: lc/601.md + - 602. Friend Requests II Who Has the Most Friends: lc/602.md + - 603. Consecutive Available Seats: lc/603.md + - 604. Design Compressed String Iterator: lc/604.md + - 605. Can Place Flowers: lc/605.md + - 606. Construct String from Binary Tree: lc/606.md + - 607. Sales Person: lc/607.md + - 608. Tree Node: lc/608.md + - 609. Find Duplicate File in System: lc/609.md + - 610. Triangle Judgement: lc/610.md + - 611. Valid Triangle Number: lc/611.md + - 612. Shortest Distance in a Plane: lc/612.md + - 613. Shortest Distance in a Line: lc/613.md + - 614. Second Degree Follower: lc/614.md + - 615. Average Salary Departments VS Company: lc/615.md + - 616. Add Bold Tag in String: lc/616.md + - 617. Merge Two Binary Trees: lc/617.md + - 618. Students Report By Geography: lc/618.md + - 619. Biggest Single Number: lc/619.md + - 620. Not Boring Movies: lc/620.md + - 621. Task Scheduler: lc/621.md + - 622. Design Circular Queue: lc/622.md + - 623. Add One Row to Tree: lc/623.md + - 624. Maximum Distance in Arrays: lc/624.md + - 625. Minimum Factorization: lc/625.md + - 626. Exchange Seats: lc/626.md + - 627. Swap Salary: lc/627.md + - 628. Maximum Product of Three Numbers: lc/628.md + - 629. K Inverse Pairs Array: lc/629.md + - 630. Course Schedule III: lc/630.md + - 631. Design Excel Sum Formula: lc/631.md + - 632. Smallest Range Covering Elements from K Lists: lc/632.md + - 633. Sum of Square Numbers: lc/633.md + - 634. Find the Derangement of An Array: lc/634.md + - 635. Design Log Storage System: lc/635.md + - 636. Exclusive Time of Functions: lc/636.md + - 637. Average of Levels in Binary Tree: lc/637.md + - 638. Shopping Offers: lc/638.md + - 639. Decode Ways II: lc/639.md + - 640. Solve the Equation: lc/640.md + - 641. Design Circular Deque: lc/641.md + - 642. Design Search Autocomplete System: lc/642.md + - 643. Maximum Average Subarray I: lc/643.md + - 644. Maximum Average Subarray II: lc/644.md + - 645. Set Mismatch: lc/645.md + - 646. Maximum Length of Pair Chain: lc/646.md + - 647. Palindromic Substrings: lc/647.md + - 648. Replace Words: lc/648.md + - 649. Dota2 Senate: lc/649.md + - 650. 2 Keys Keyboard: lc/650.md + - 651. 4 Keys Keyboard: lc/651.md + - 652. Find Duplicate Subtrees: lc/652.md + - 653. Two Sum IV - Input is a BST: lc/653.md + - 654. Maximum Binary Tree: lc/654.md + - 655. Print Binary Tree: lc/655.md + - 656. Coin Path: lc/656.md + - 657. Robot Return to Origin: lc/657.md + - 658. Find K Closest Elements: lc/658.md + - 659. Split Array into Consecutive Subsequences: lc/659.md + - 660. Remove 9: lc/660.md + - 661. Image Smoother: lc/661.md + - 662. Maximum Width of Binary Tree: lc/662.md + - 663. Equal Tree Partition: lc/663.md + - 664. Strange Printer: lc/664.md + - 665. Non-decreasing Array: lc/665.md + - 666. Path Sum IV: lc/666.md + - 667. Beautiful Arrangement II: lc/667.md + - 668. Kth Smallest Number in Multiplication Table: lc/668.md + - 669. Trim a Binary Search Tree: lc/669.md + - 670. Maximum Swap: lc/670.md + - 671. Second Minimum Node In a Binary Tree: lc/671.md + - 672. Bulb Switcher II: lc/672.md + - 673. Number of Longest Increasing Subsequence: lc/673.md + - 674. Longest Continuous Increasing Subsequence: lc/674.md + - 675. Cut Off Trees for Golf Event: lc/675.md + - 676. Implement Magic Dictionary: lc/676.md + - 677. Map Sum Pairs: lc/677.md + - 678. Valid Parenthesis String: lc/678.md + - 679. 24 Game: lc/679.md + - 680. Valid Palindrome II: lc/680.md + - 681. Next Closest Time: lc/681.md + - 682. Baseball Game: lc/682.md + - 683. K Empty Slots: lc/683.md + - 684. Redundant Connection: lc/684.md + - 685. Redundant Connection II: lc/685.md + - 686. Repeated String Match: lc/686.md + - 687. Longest Univalue Path: lc/687.md + - 688. Knight Probability in Chessboard: lc/688.md + - 689. Maximum Sum of 3 Non-Overlapping Subarrays: lc/689.md + - 690. Employee Importance: lc/690.md + - 691. Stickers to Spell Word: lc/691.md + - 692. Top K Frequent Words: lc/692.md + - 693. Binary Number with Alternating Bits: lc/693.md + - 694. Number of Distinct Islands: lc/694.md + - 695. Max Area of Island: lc/695.md + - 696. Count Binary Substrings: lc/696.md + - 697. Degree of an Array: lc/697.md + - 698. Partition to K Equal Sum Subsets: lc/698.md + - 699. Falling Squares: lc/699.md + - 700. Search in a Binary Search Tree: lc/700.md + - 701. Insert into a Binary Search Tree: lc/701.md + - 702. Search in a Sorted Array of Unknown Size: lc/702.md + - 703. Kth Largest Element in a Stream: lc/703.md + - 704. Binary Search: lc/704.md + - 705. Design HashSet: lc/705.md + - 706. Design HashMap: lc/706.md + - 707. Design Linked List: lc/707.md + - 708. Insert into a Sorted Circular Linked List: lc/708.md + - 709. To Lower Case: lc/709.md + - 710. Random Pick with Blacklist: lc/710.md + - 711. Number of Distinct Islands II: lc/711.md + - 712. Minimum ASCII Delete Sum for Two Strings: lc/712.md + - 713. Subarray Product Less Than K: lc/713.md + - 714. Best Time to Buy and Sell Stock with Transaction Fee: lc/714.md + - 715. Range Module: lc/715.md + - 716. Max Stack: lc/716.md + - 717. 1-bit and 2-bit Characters: lc/717.md + - 718. Maximum Length of Repeated Subarray: lc/718.md + - 719. Find K-th Smallest Pair Distance: lc/719.md + - 720. Longest Word in Dictionary: lc/720.md + - 721. Accounts Merge: lc/721.md + - 722. Remove Comments: lc/722.md + - 723. Candy Crush: lc/723.md + - 724. Find Pivot Index: lc/724.md + - 725. Split Linked List in Parts: lc/725.md + - 726. Number of Atoms: lc/726.md + - 727. Minimum Window Subsequence: lc/727.md + - 728. Self Dividing Numbers: lc/728.md + - 729. My Calendar I: lc/729.md + - 730. Count Different Palindromic Subsequences: lc/730.md + - 731. My Calendar II: lc/731.md + - 732. My Calendar III: lc/732.md + - 733. Flood Fill: lc/733.md + - 734. Sentence Similarity: lc/734.md + - 735. Asteroid Collision: lc/735.md + - 736. Parse Lisp Expression: lc/736.md + - 737. Sentence Similarity II: lc/737.md + - 738. Monotone Increasing Digits: lc/738.md + - 739. Daily Temperatures: lc/739.md + - 740. Delete and Earn: lc/740.md + - 741. Cherry Pickup: lc/741.md + - 742. Closest Leaf in a Binary Tree: lc/742.md + - 743. Network Delay Time: lc/743.md + - 744. Find Smallest Letter Greater Than Target: lc/744.md + - 745. Prefix and Suffix Search: lc/745.md + - 746. Min Cost Climbing Stairs: lc/746.md + - 747. Largest Number At Least Twice of Others: lc/747.md + - 748. Shortest Completing Word: lc/748.md + - 749. Contain Virus: lc/749.md + - 750. Number Of Corner Rectangles: lc/750.md + - 751. IP to CIDR: lc/751.md + - 752. Open the Lock: lc/752.md + - 753. Cracking the Safe: lc/753.md + - 754. Reach a Number: lc/754.md + - 755. Pour Water: lc/755.md + - 756. Pyramid Transition Matrix: lc/756.md + - 757. Set Intersection Size At Least Two: lc/757.md + - 758. Bold Words in String: lc/758.md + - 759. Employee Free Time: lc/759.md + - 760. Find Anagram Mappings: lc/760.md + - 761. Special Binary String: lc/761.md + - 762. Prime Number of Set Bits in Binary Representation: lc/762.md + - 763. Partition Labels: lc/763.md + - 764. Largest Plus Sign: lc/764.md + - 765. Couples Holding Hands: lc/765.md + - 766. Toeplitz Matrix: lc/766.md + - 767. Reorganize String: lc/767.md + - 768. Max Chunks To Make Sorted II: lc/768.md + - 769. Max Chunks To Make Sorted: lc/769.md + - 770. Basic Calculator IV: lc/770.md + - 771. Jewels and Stones: lc/771.md + - 772. Basic Calculator III: lc/772.md + - 773. Sliding Puzzle: lc/773.md + - 774. Minimize Max Distance to Gas Station: lc/774.md + - 775. Global and Local Inversions: lc/775.md + - 776. Split BST: lc/776.md + - 777. Swap Adjacent in LR String: lc/777.md + - 778. Swim in Rising Water: lc/778.md + - 779. K-th Symbol in Grammar: lc/779.md + - 780. Reaching Points: lc/780.md + - 781. Rabbits in Forest: lc/781.md + - 782. Transform to Chessboard: lc/782.md + - 783. Minimum Distance Between BST Nodes: lc/783.md + - 784. Letter Case Permutation: lc/784.md + - 785. Is Graph Bipartite: lc/785.md + - 786. K-th Smallest Prime Fraction: lc/786.md + - 787. Cheapest Flights Within K Stops: lc/787.md + - 788. Rotated Digits: lc/788.md + - 789. Escape The Ghosts: lc/789.md + - 790. Domino and Tromino Tiling: lc/790.md + - 791. Custom Sort String: lc/791.md + - 792. Number of Matching Subsequences: lc/792.md + - 793. Preimage Size of Factorial Zeroes Function: lc/793.md + - 794. Valid Tic-Tac-Toe State: lc/794.md + - 795. Number of Subarrays with Bounded Maximum: lc/795.md + - 796. Rotate String: lc/796.md + - 797. All Paths From Source to Target: lc/797.md + - 798. Smallest Rotation with Highest Score: lc/798.md + - 799. Champagne Tower: lc/799.md + - 800. Similar RGB Color: lc/800.md + - 801. Minimum Swaps To Make Sequences Increasing: lc/801.md + - 802. Find Eventual Safe States: lc/802.md + - 803. Bricks Falling When Hit: lc/803.md + - 804. Unique Morse Code Words: lc/804.md + - 805. Split Array With Same Average: lc/805.md + - 806. Number of Lines To Write String: lc/806.md + - 807. Max Increase to Keep City Skyline: lc/807.md + - 808. Soup Servings: lc/808.md + - 809. Expressive Words: lc/809.md + - 810. Chalkboard XOR Game: lc/810.md + - 811. Subdomain Visit Count: lc/811.md + - 812. Largest Triangle Area: lc/812.md + - 813. Largest Sum of Averages: lc/813.md + - 814. Binary Tree Pruning: lc/814.md + - 815. Bus Routes: lc/815.md + - 816. Ambiguous Coordinates: lc/816.md + - 817. Linked List Components: lc/817.md + - 818. Race Car: lc/818.md + - 819. Most Common Word: lc/819.md + - 820. Short Encoding of Words: lc/820.md + - 821. Shortest Distance to a Character: lc/821.md + - 822. Card Flipping Game: lc/822.md + - 823. Binary Trees With Factors: lc/823.md + - 824. Goat Latin: lc/824.md + - 825. Friends Of Appropriate Ages: lc/825.md + - 826. Most Profit Assigning Work: lc/826.md + - 827. Making A Large Island: lc/827.md + - 828. Count Unique Characters of All Substrings of a Given String: lc/828.md + - 829. Consecutive Numbers Sum: lc/829.md + - 830. Positions of Large Groups: lc/830.md + - 831. Masking Personal Information: lc/831.md + - 832. Flipping an Image: lc/832.md + - 833. Find And Replace in String: lc/833.md + - 834. Sum of Distances in Tree: lc/834.md + - 835. Image Overlap: lc/835.md + - 836. Rectangle Overlap: lc/836.md + - 837. New 21 Game: lc/837.md + - 838. Push Dominoes: lc/838.md + - 839. Similar String Groups: lc/839.md + - 840. Magic Squares In Grid: lc/840.md + - 841. Keys and Rooms: lc/841.md + - 842. Split Array into Fibonacci Sequence: lc/842.md + - 843. Guess the Word: lc/843.md + - 844. Backspace String Compare: lc/844.md + - 845. Longest Mountain in Array: lc/845.md + - 846. Hand of Straights: lc/846.md + - 847. Shortest Path Visiting All Nodes: lc/847.md + - 848. Shifting Letters: lc/848.md + - 849. Maximize Distance to Closest Person: lc/849.md + - 850. Rectangle Area II: lc/850.md + - 851. Loud and Rich: lc/851.md + - 852. Peak Index in a Mountain Array: lc/852.md + - 853. Car Fleet: lc/853.md + - 854. K-Similar Strings: lc/854.md + - 855. Exam Room: lc/855.md + - 856. Score of Parentheses: lc/856.md + - 857. Minimum Cost to Hire K Workers: lc/857.md + - 858. Mirror Reflection: lc/858.md + - 859. Buddy Strings: lc/859.md + - 860. Lemonade Change: lc/860.md + - 861. Score After Flipping Matrix: lc/861.md + - 862. Shortest Subarray with Sum at Least K: lc/862.md + - 863. All Nodes Distance K in Binary Tree: lc/863.md + - 864. Shortest Path to Get All Keys: lc/864.md + - 865. Smallest Subtree with all the Deepest Nodes: lc/865.md + - 866. Prime Palindrome: lc/866.md + - 867. Transpose Matrix: lc/867.md + - 868. Binary Gap: lc/868.md + - 869. Reordered Power of 2: lc/869.md + - 870. Advantage Shuffle: lc/870.md + - 871. Minimum Number of Refueling Stops: lc/871.md + - 872. Leaf-Similar Trees: lc/872.md + - 873. Length of Longest Fibonacci Subsequence: lc/873.md + - 874. Walking Robot Simulation: lc/874.md + - 875. Koko Eating Bananas: lc/875.md + - 876. Middle of the Linked List: lc/876.md + - 877. Stone Game: lc/877.md + - 878. Nth Magical Number: lc/878.md + - 879. Profitable Schemes: lc/879.md + - 880. Decoded String at Index: lc/880.md + - 881. Boats to Save People: lc/881.md + - 882. Reachable Nodes In Subdivided Graph: lc/882.md + - 883. Projection Area of 3D Shapes: lc/883.md + - 884. Uncommon Words from Two Sentences: lc/884.md + - 885. Spiral Matrix III: lc/885.md + - 886. Possible Bipartition: lc/886.md + - 887. Super Egg Drop: lc/887.md + - 888. Fair Candy Swap: lc/888.md + - 889. Construct Binary Tree from Preorder and Postorder Traversal: lc/889.md + - 890. Find and Replace Pattern: lc/890.md + - 891. Sum of Subsequence Widths: lc/891.md + - 892. Surface Area of 3D Shapes: lc/892.md + - 893. Groups of Special-Equivalent Strings: lc/893.md + - 894. All Possible Full Binary Trees: lc/894.md + - 895. Maximum Frequency Stack: lc/895.md + - 896. Monotonic Array: lc/896.md + - 897. Increasing Order Search Tree: lc/897.md + - 898. Bitwise ORs of Subarrays: lc/898.md + - 899. Orderly Queue: lc/899.md + - 900. RLE Iterator: lc/900.md + - 901. Online Stock Span: lc/901.md + - 902. Numbers At Most N Given Digit Set: lc/902.md + - 903. Valid Permutations for DI Sequence: lc/903.md + - 904. Fruit Into Baskets: lc/904.md + - 905. Sort Array By Parity: lc/905.md + - 906. Super Palindromes: lc/906.md + - 907. Sum of Subarray Minimums: lc/907.md + - 908. Smallest Range I: lc/908.md + - 909. Snakes and Ladders: lc/909.md + - 910. Smallest Range II: lc/910.md + - 911. Online Election: lc/911.md + - 912. Sort an Array: lc/912.md + - 913. Cat and Mouse: lc/913.md + - 914. X of a Kind in a Deck of Cards: lc/914.md + - 915. Partition Array into Disjoint Intervals: lc/915.md + - 916. Word Subsets: lc/916.md + - 917. Reverse Only Letters: lc/917.md + - 918. Maximum Sum Circular Subarray: lc/918.md + - 919. Complete Binary Tree Inserter: lc/919.md + - 920. Number of Music Playlists: lc/920.md + - 921. Minimum Add to Make Parentheses Valid: lc/921.md + - 922. Sort Array By Parity II: lc/922.md + - 923. 3Sum With Multiplicity: lc/923.md + - 924. Minimize Malware Spread: lc/924.md + - 925. Long Pressed Name: lc/925.md + - 926. Flip String to Monotone Increasing: lc/926.md + - 927. Three Equal Parts: lc/927.md + - 928. Minimize Malware Spread II: lc/928.md + - 929. Unique Email Addresses: lc/929.md + - 930. Binary Subarrays With Sum: lc/930.md + - 931. Minimum Falling Path Sum: lc/931.md + - 932. Beautiful Array: lc/932.md + - 933. Number of Recent Calls: lc/933.md + - 934. Shortest Bridge: lc/934.md + - 935. Knight Dialer: lc/935.md + - 936. Stamping The Sequence: lc/936.md + - 937. Reorder Data in Log Files: lc/937.md + - 938. Range Sum of BST: lc/938.md + - 939. Minimum Area Rectangle: lc/939.md + - 940. Distinct Subsequences II: lc/940.md + - 941. Valid Mountain Array: lc/941.md + - 942. DI String Match: lc/942.md + - 943. Find the Shortest Superstring: lc/943.md + - 944. Delete Columns to Make Sorted: lc/944.md + - 945. Minimum Increment to Make Array Unique: lc/945.md + - 946. Validate Stack Sequences: lc/946.md + - 947. Most Stones Removed with Same Row or Column: lc/947.md + - 948. Bag of Tokens: lc/948.md + - 949. Largest Time for Given Digits: lc/949.md + - 950. Reveal Cards In Increasing Order: lc/950.md + - 951. Flip Equivalent Binary Trees: lc/951.md + - 952. Largest Component Size by Common Factor: lc/952.md + - 953. Verifying an Alien Dictionary: lc/953.md + - 954. Array of Doubled Pairs: lc/954.md + - 955. Delete Columns to Make Sorted II: lc/955.md + - 956. Tallest Billboard: lc/956.md + - 957. Prison Cells After N Days: lc/957.md + - 958. Check Completeness of a Binary Tree: lc/958.md + - 959. Regions Cut By Slashes: lc/959.md + - 960. Delete Columns to Make Sorted III: lc/960.md + - 961. N-Repeated Element in Size 2N Array: lc/961.md + - 962. Maximum Width Ramp: lc/962.md + - 963. Minimum Area Rectangle II: lc/963.md + - 964. Least Operators to Express Number: lc/964.md + - 965. Univalued Binary Tree: lc/965.md + - 966. Vowel Spellchecker: lc/966.md + - 967. Numbers With Same Consecutive Differences: lc/967.md + - 968. Binary Tree Cameras: lc/968.md + - 969. Pancake Sorting: lc/969.md + - 970. Powerful Integers: lc/970.md + - 971. Flip Binary Tree To Match Preorder Traversal: lc/971.md + - 972. Equal Rational Numbers: lc/972.md + - 973. K Closest Points to Origin: lc/973.md + - 974. Subarray Sums Divisible by K: lc/974.md + - 975. Odd Even Jump: lc/975.md + - 976. Largest Perimeter Triangle: lc/976.md + - 977. Squares of a Sorted Array: lc/977.md + - 978. Longest Turbulent Subarray: lc/978.md + - 979. Distribute Coins in Binary Tree: lc/979.md + - 980. Unique Paths III: lc/980.md + - 981. Time Based Key-Value Store: lc/981.md + - 982. Triples with Bitwise AND Equal To Zero: lc/982.md + - 983. Minimum Cost For Tickets: lc/983.md + - 984. String Without AAA or BBB: lc/984.md + - 985. Sum of Even Numbers After Queries: lc/985.md + - 986. Interval List Intersections: lc/986.md + - 987. Vertical Order Traversal of a Binary Tree: lc/987.md + - 988. Smallest String Starting From Leaf: lc/988.md + - 989. Add to Array-Form of Integer: lc/989.md + - 990. Satisfiability of Equality Equations: lc/990.md + - 991. Broken Calculator: lc/991.md + - 992. Subarrays with K Different Integers: lc/992.md + - 993. Cousins in Binary Tree: lc/993.md + - 994. Rotting Oranges: lc/994.md + - 995. Minimum Number of K Consecutive Bit Flips: lc/995.md + - 996. Number of Squareful Arrays: lc/996.md + - 997. Find the Town Judge: lc/997.md + - 998. Maximum Binary Tree II: lc/998.md + - 999. Available Captures for Rook: lc/999.md + - 1000. Minimum Cost to Merge Stones: lc/1000.md + - 1001. Grid Illumination: lc/1001.md + - 1002. Find Common Characters: lc/1002.md + - 1003. Check If Word Is Valid After Substitutions: lc/1003.md + - 1004. Max Consecutive Ones III: lc/1004.md + - 1005. Maximize Sum Of Array After K Negations: lc/1005.md + - 1006. Clumsy Factorial: lc/1006.md + - 1007. Minimum Domino Rotations For Equal Row: lc/1007.md + - 1008. Construct Binary Search Tree from Preorder Traversal: lc/1008.md + - 1009. Complement of Base 10 Integer: lc/1009.md + - 1010. Pairs of Songs With Total Durations Divisible by 60: lc/1010.md + - 1011. Capacity To Ship Packages Within D Days: lc/1011.md + - 1012. Numbers With Repeated Digits: lc/1012.md + - 1013. Partition Array Into Three Parts With Equal Sum: lc/1013.md + - 1014. Best Sightseeing Pair: lc/1014.md + - 1015. Smallest Integer Divisible by K: lc/1015.md + - 1016. Binary String With Substrings Representing 1 To N: lc/1016.md + - 1017. Convert to Base -2: lc/1017.md + - 1018. Binary Prefix Divisible By 5: lc/1018.md + - 1019. Next Greater Node In Linked List: lc/1019.md + - 1020. Number of Enclaves: lc/1020.md + - 1021. Remove Outermost Parentheses: lc/1021.md + - 1022. Sum of Root To Leaf Binary Numbers: lc/1022.md + - 1023. Camelcase Matching: lc/1023.md + - 1024. Video Stitching: lc/1024.md + - 1025. Divisor Game: lc/1025.md + - 1026. Maximum Difference Between Node and Ancestor: lc/1026.md + - 1027. Longest Arithmetic Subsequence: lc/1027.md + - 1028. Recover a Tree From Preorder Traversal: lc/1028.md + - 1029. Two City Scheduling: lc/1029.md + - 1030. Matrix Cells in Distance Order: lc/1030.md + - 1031. Maximum Sum of Two Non-Overlapping Subarrays: lc/1031.md + - 1032. Stream of Characters: lc/1032.md + - 1033. Moving Stones Until Consecutive: lc/1033.md + - 1034. Coloring A Border: lc/1034.md + - 1035. Uncrossed Lines: lc/1035.md + - 1036. Escape a Large Maze: lc/1036.md + - 1037. Valid Boomerang: lc/1037.md + - 1038. Binary Search Tree to Greater Sum Tree: lc/1038.md + - 1039. Minimum Score Triangulation of Polygon: lc/1039.md + - 1040. Moving Stones Until Consecutive II: lc/1040.md + - 1041. Robot Bounded In Circle: lc/1041.md + - 1042. Flower Planting With No Adjacent: lc/1042.md + - 1043. Partition Array for Maximum Sum: lc/1043.md + - 1044. Longest Duplicate Substring: lc/1044.md + - 1045. Customers Who Bought All Products: lc/1045.md + - 1046. Last Stone Weight: lc/1046.md + - 1047. Remove All Adjacent Duplicates In String: lc/1047.md + - 1048. Longest String Chain: lc/1048.md + - 1049. Last Stone Weight II: lc/1049.md + - 1050. Actors and Directors Who Cooperated At Least Three Times: lc/1050.md + - 1051. Height Checker: lc/1051.md + - 1052. Grumpy Bookstore Owner: lc/1052.md + - 1053. Previous Permutation With One Swap: lc/1053.md + - 1054. Distant Barcodes: lc/1054.md + - 1055. Shortest Way to Form String: lc/1055.md + - 1056. Confusing Number: lc/1056.md + - 1057. Campus Bikes: lc/1057.md + - 1058. Minimize Rounding Error to Meet Target: lc/1058.md + - 1059. All Paths from Source Lead to Destination: lc/1059.md + - 1060. Missing Element in Sorted Array: lc/1060.md + - 1061. Lexicographically Smallest Equivalent String: lc/1061.md + - 1062. Longest Repeating Substring: lc/1062.md + - 1063. Number of Valid Subarrays: lc/1063.md + - 1064. Fixed Point: lc/1064.md + - 1065. Index Pairs of a String: lc/1065.md + - 1066. Campus Bikes II: lc/1066.md + - 1067. Digit Count in Range: lc/1067.md + - 1068. Product Sales Analysis I: lc/1068.md + - 1069. Product Sales Analysis II: lc/1069.md + - 1070. Product Sales Analysis III: lc/1070.md + - 1071. Greatest Common Divisor of Strings: lc/1071.md + - 1072. Flip Columns For Maximum Number of Equal Rows: lc/1072.md + - 1073. Adding Two Negabinary Numbers: lc/1073.md + - 1074. Number of Submatrices That Sum to Target: lc/1074.md + - 1075. Project Employees I: lc/1075.md + - 1076. Project Employees II: lc/1076.md + - 1077. Project Employees III: lc/1077.md + - 1078. Occurrences After Bigram: lc/1078.md + - 1079. Letter Tile Possibilities: lc/1079.md + - 1080. Insufficient Nodes in Root to Leaf Paths: lc/1080.md + - 1081. Smallest Subsequence of Distinct Characters: lc/1081.md + - 1082. Sales Analysis I: lc/1082.md + - 1083. Sales Analysis II: lc/1083.md + - 1084. Sales Analysis III: lc/1084.md + - 1085. Sum of Digits in the Minimum Number: lc/1085.md + - 1086. High Five: lc/1086.md + - 1087. Brace Expansion: lc/1087.md + - 1088. Confusing Number II: lc/1088.md + - 1089. Duplicate Zeros: lc/1089.md + - 1090. Largest Values From Labels: lc/1090.md + - 1091. Shortest Path in Binary Matrix: lc/1091.md + - 1092. Shortest Common Supersequence: lc/1092.md + - 1093. Statistics from a Large Sample: lc/1093.md + - 1094. Car Pooling: lc/1094.md + - 1095. Find in Mountain Array: lc/1095.md + - 1096. Brace Expansion II: lc/1096.md + - 1097. Game Play Analysis V: lc/1097.md + - 1098. Unpopular Books: lc/1098.md + - 1099. Two Sum Less Than K: lc/1099.md + - 1100. Find K-Length Substrings With No Repeated Characters: lc/1100.md + - 1101. The Earliest Moment When Everyone Become Friends: lc/1101.md + - 1102. Path With Maximum Minimum Value: lc/1102.md + - 1103. Distribute Candies to People: lc/1103.md + - 1104. Path In Zigzag Labelled Binary Tree: lc/1104.md + - 1105. Filling Bookcase Shelves: lc/1105.md + - 1106. Parsing A Boolean Expression: lc/1106.md + - 1107. New Users Daily Count: lc/1107.md + - 1108. Defanging an IP Address: lc/1108.md + - 1109. Corporate Flight Bookings: lc/1109.md + - 1110. Delete Nodes And Return Forest: lc/1110.md + - 1111. Maximum Nesting Depth of Two Valid Parentheses Strings: lc/1111.md + - 1112. Highest Grade For Each Student: lc/1112.md + - 1113. Reported Posts: lc/1113.md + - 1114. Print in Order: lc/1114.md + - 1115. Print FooBar Alternately: lc/1115.md + - 1116. Print Zero Even Odd: lc/1116.md + - 1117. Building H2O: lc/1117.md + - 1118. Number of Days in a Month: lc/1118.md + - 1119. Remove Vowels from a String: lc/1119.md + - 1120. Maximum Average Subtree: lc/1120.md + - 1121. Divide Array Into Increasing Sequences: lc/1121.md + - 1122. Relative Sort Array: lc/1122.md + - 1123. Lowest Common Ancestor of Deepest Leaves: lc/1123.md + - 1124. Longest Well-Performing Interval: lc/1124.md + - 1125. Smallest Sufficient Team: lc/1125.md + - 1126. Active Businesses: lc/1126.md + - 1127. User Purchase Platform: lc/1127.md + - 1128. Number of Equivalent Domino Pairs: lc/1128.md + - 1129. Shortest Path with Alternating Colors: lc/1129.md + - 1130. Minimum Cost Tree From Leaf Values: lc/1130.md + - 1131. Maximum of Absolute Value Expression: lc/1131.md + - 1132. Reported Posts II: lc/1132.md + - 1133. Largest Unique Number: lc/1133.md + - 1134. Armstrong Number: lc/1134.md + - 1135. Connecting Cities With Minimum Cost: lc/1135.md + - 1136. Parallel Courses: lc/1136.md + - 1137. N-th Tribonacci Number: lc/1137.md + - 1138. Alphabet Board Path: lc/1138.md + - 1139. Largest 1-Bordered Square: lc/1139.md + - 1140. Stone Game II: lc/1140.md + - 1141. User Activity for the Past 30 Days I: lc/1141.md + - 1142. User Activity for the Past 30 Days II: lc/1142.md + - 1143. Longest Common Subsequence: lc/1143.md + - 1144. Decrease Elements To Make Array Zigzag: lc/1144.md + - 1145. Binary Tree Coloring Game: lc/1145.md + - 1146. Snapshot Array: lc/1146.md + - 1147. Longest Chunked Palindrome Decomposition: lc/1147.md + - 1148. Article Views I: lc/1148.md + - 1149. Article Views II: lc/1149.md + - 1150. Check If a Number Is Majority Element in a Sorted Array: lc/1150.md + - 1151. Minimum Swaps to Group All 1's Together: lc/1151.md + - 1152. Analyze User Website Visit Pattern: lc/1152.md + - 1153. String Transforms Into Another String: lc/1153.md + - 1154. Day of the Year: lc/1154.md + - 1155. Number of Dice Rolls With Target Sum: lc/1155.md + - 1156. Swap For Longest Repeated Character Substring: lc/1156.md + - 1157. Online Majority Element In Subarray: lc/1157.md + - 1158. Market Analysis I: lc/1158.md + - 1159. Market Analysis II: lc/1159.md + - 1160. Find Words That Can Be Formed by Characters: lc/1160.md + - 1161. Maximum Level Sum of a Binary Tree: lc/1161.md + - 1162. As Far from Land as Possible: lc/1162.md + - 1163. Last Substring in Lexicographical Order: lc/1163.md + - 1164. Product Price at a Given Date: lc/1164.md + - 1165. Single-Row Keyboard: lc/1165.md + - 1166. Design File System: lc/1166.md + - 1167. Minimum Cost to Connect Sticks: lc/1167.md + - 1168. Optimize Water Distribution in a Village: lc/1168.md + - 1169. Invalid Transactions: lc/1169.md + - 1170. Compare Strings by Frequency of the Smallest Character: lc/1170.md + - 1171. Remove Zero Sum Consecutive Nodes from Linked List: lc/1171.md + - 1172. Dinner Plate Stacks: lc/1172.md + - 1173. Immediate Food Delivery I: lc/1173.md + - 1174. Immediate Food Delivery II: lc/1174.md + - 1175. Prime Arrangements: lc/1175.md + - 1176. Diet Plan Performance: lc/1176.md + - 1177. Can Make Palindrome from Substring: lc/1177.md + - 1178. Number of Valid Words for Each Puzzle: lc/1178.md + - 1179. Reformat Department Table: lc/1179.md + - 1180. Count Substrings with Only One Distinct Letter: lc/1180.md + - 1181. Before and After Puzzle: lc/1181.md + - 1182. Shortest Distance to Target Color: lc/1182.md + - 1183. Maximum Number of Ones: lc/1183.md + - 1184. Distance Between Bus Stops: lc/1184.md + - 1185. Day of the Week: lc/1185.md + - 1186. Maximum Subarray Sum with One Deletion: lc/1186.md + - 1187. Make Array Strictly Increasing: lc/1187.md + - 1188. Design Bounded Blocking Queue: lc/1188.md + - 1189. Maximum Number of Balloons: lc/1189.md + - 1190. Reverse Substrings Between Each Pair of Parentheses: lc/1190.md + - 1191. K-Concatenation Maximum Sum: lc/1191.md + - 1192. Critical Connections in a Network: lc/1192.md + - 1193. Monthly Transactions I: lc/1193.md + - 1194. Tournament Winners: lc/1194.md + - 1195. Fizz Buzz Multithreaded: lc/1195.md + - 1196. How Many Apples Can You Put into the Basket: lc/1196.md + - 1197. Minimum Knight Moves: lc/1197.md + - 1198. Find Smallest Common Element in All Rows: lc/1198.md + - 1199. Minimum Time to Build Blocks: lc/1199.md + - 1200. Minimum Absolute Difference: lc/1200.md + - 1201. Ugly Number III: lc/1201.md + - 1202. Smallest String With Swaps: lc/1202.md + - 1203. Sort Items by Groups Respecting Dependencies: lc/1203.md + - 1204. Last Person to Fit in the Bus: lc/1204.md + - 1205. Monthly Transactions II: lc/1205.md + - 1206. Design Skiplist: lc/1206.md + - 1207. Unique Number of Occurrences: lc/1207.md + - 1208. Get Equal Substrings Within Budget: lc/1208.md + - 1209. Remove All Adjacent Duplicates in String II: lc/1209.md + - 1210. Minimum Moves to Reach Target with Rotations: lc/1210.md + - 1211. Queries Quality and Percentage: lc/1211.md + - 1212. Team Scores in Football Tournament: lc/1212.md + - 1213. Intersection of Three Sorted Arrays: lc/1213.md + - 1214. Two Sum BSTs: lc/1214.md + - 1215. Stepping Numbers: lc/1215.md + - 1216. Valid Palindrome III: lc/1216.md + - 1217. Minimum Cost to Move Chips to The Same Position: lc/1217.md + - 1218. Longest Arithmetic Subsequence of Given Difference: lc/1218.md + - 1219. Path with Maximum Gold: lc/1219.md + - 1220. Count Vowels Permutation: lc/1220.md + - 1221. Split a String in Balanced Strings: lc/1221.md + - 1222. Queens That Can Attack the King: lc/1222.md + - 1223. Dice Roll Simulation: lc/1223.md + - 1224. Maximum Equal Frequency: lc/1224.md + - 1225. Report Contiguous Dates: lc/1225.md + - 1226. The Dining Philosophers: lc/1226.md + - 1227. Airplane Seat Assignment Probability: lc/1227.md + - 1228. Missing Number In Arithmetic Progression: lc/1228.md + - 1229. Meeting Scheduler: lc/1229.md + - 1230. Toss Strange Coins: lc/1230.md + - 1231. Divide Chocolate: lc/1231.md + - 1232. Check If It Is a Straight Line: lc/1232.md + - 1233. Remove Sub-Folders from the Filesystem: lc/1233.md + - 1234. Replace the Substring for Balanced String: lc/1234.md + - 1235. Maximum Profit in Job Scheduling: lc/1235.md + - 1236. Web Crawler: lc/1236.md + - 1237. Find Positive Integer Solution for a Given Equation: lc/1237.md + - 1238. Circular Permutation in Binary Representation: lc/1238.md + - 1239. Maximum Length of a Concatenated String with Unique Characters: lc/1239.md + - 1240. Tiling a Rectangle with the Fewest Squares: lc/1240.md + - 1241. Number of Comments per Post: lc/1241.md + - 1242. Web Crawler Multithreaded: lc/1242.md + - 1243. Array Transformation: lc/1243.md + - 1244. Design A Leaderboard: lc/1244.md + - 1245. Tree Diameter: lc/1245.md + - 1246. Palindrome Removal: lc/1246.md + - 1247. Minimum Swaps to Make Strings Equal: lc/1247.md + - 1248. Count Number of Nice Subarrays: lc/1248.md + - 1249. Minimum Remove to Make Valid Parentheses: lc/1249.md + - 1250. Check If It Is a Good Array: lc/1250.md + - 1251. Average Selling Price: lc/1251.md + - 1252. Cells with Odd Values in a Matrix: lc/1252.md + - 1253. Reconstruct a 2-Row Binary Matrix: lc/1253.md + - 1254. Number of Closed Islands: lc/1254.md + - 1255. Maximum Score Words Formed by Letters: lc/1255.md + - 1256. Encode Number: lc/1256.md + - 1257. Smallest Common Region: lc/1257.md + - 1258. Synonymous Sentences: lc/1258.md + - 1259. Handshakes That Don't Cross: lc/1259.md + - 1260. Shift 2D Grid: lc/1260.md + - 1261. Find Elements in a Contaminated Binary Tree: lc/1261.md + - 1262. Greatest Sum Divisible by Three: lc/1262.md + - 1263. Minimum Moves to Move a Box to Their Target Location: lc/1263.md + - 1264. Page Recommendations: lc/1264.md + - 1265. Print Immutable Linked List in Reverse: lc/1265.md + - 1266. Minimum Time Visiting All Points: lc/1266.md + - 1267. Count Servers that Communicate: lc/1267.md + - 1268. Search Suggestions System: lc/1268.md + - 1269. Number of Ways to Stay in the Same Place After Some Steps: lc/1269.md + - 1270. All People Report to the Given Manager: lc/1270.md + - 1271. Hexspeak: lc/1271.md + - 1272. Remove Interval: lc/1272.md + - 1273. Delete Tree Nodes: lc/1273.md + - 1274. Number of Ships in a Rectangle: lc/1274.md + - 1275. Find Winner on a Tic Tac Toe Game: lc/1275.md + - 1276. Number of Burgers with No Waste of Ingredients: lc/1276.md + - 1277. Count Square Submatrices with All Ones: lc/1277.md + - 1278. Palindrome Partitioning III: lc/1278.md + - 1279. Traffic Light Controlled Intersection: lc/1279.md + - 1280. Students and Examinations: lc/1280.md + - 1281. Subtract the Product and Sum of Digits of an Integer: lc/1281.md + - 1282. Group the People Given the Group Size They Belong To: lc/1282.md + - 1283. Find the Smallest Divisor Given a Threshold: lc/1283.md + - 1284. Minimum Number of Flips to Convert Binary Matrix to Zero Matrix: lc/1284.md + - 1285. Find the Start and End Number of Continuous Ranges: lc/1285.md + - 1286. Iterator for Combination: lc/1286.md + - 1287. Element Appearing More Than 25% In Sorted Array: lc/1287.md + - 1288. Remove Covered Intervals: lc/1288.md + - 1289. Minimum Falling Path Sum II: lc/1289.md + - 1290. Convert Binary Number in a Linked List to Integer: lc/1290.md + - 1291. Sequential Digits: lc/1291.md + - 1292. Maximum Side Length of a Square with Sum Less than or Equal to Threshold: lc/1292.md + - 1293. Shortest Path in a Grid with Obstacles Elimination: lc/1293.md + - 1294. Weather Type in Each Country: lc/1294.md + - 1295. Find Numbers with Even Number of Digits: lc/1295.md + - 1296. Divide Array in Sets of K Consecutive Numbers: lc/1296.md + - 1297. Maximum Number of Occurrences of a Substring: lc/1297.md + - 1298. Maximum Candies You Can Get from Boxes: lc/1298.md + - 1299. Replace Elements with Greatest Element on Right Side: lc/1299.md + - 1300. Sum of Mutated Array Closest to Target: lc/1300.md + - 1301. Number of Paths with Max Score: lc/1301.md + - 1302. Deepest Leaves Sum: lc/1302.md + - 1303. Find the Team Size: lc/1303.md + - 1304. Find N Unique Integers Sum up to Zero: lc/1304.md + - 1305. All Elements in Two Binary Search Trees: lc/1305.md + - 1306. Jump Game III: lc/1306.md + - 1307. Verbal Arithmetic Puzzle: lc/1307.md + - 1308. Running Total for Different Genders: lc/1308.md + - 1309. Decrypt String from Alphabet to Integer Mapping: lc/1309.md + - 1310. XOR Queries of a Subarray: lc/1310.md + - 1311. Get Watched Videos by Your Friends: lc/1311.md + - 1312. Minimum Insertion Steps to Make a String Palindrome: lc/1312.md + - 1313. Decompress Run-Length Encoded List: lc/1313.md + - 1314. Matrix Block Sum: lc/1314.md + - 1315. Sum of Nodes with Even-Valued Grandparent: lc/1315.md + - 1316. Distinct Echo Substrings: lc/1316.md + - 1317. Convert Integer to the Sum of Two No-Zero Integers: lc/1317.md + - 1318. Minimum Flips to Make a OR b Equal to c: lc/1318.md + - 1319. Number of Operations to Make Network Connected: lc/1319.md + - 1320. Minimum Distance to Type a Word Using Two Fingers: lc/1320.md + - 1321. Restaurant Growth: lc/1321.md + - 1322. Ads Performance: lc/1322.md + - 1323. Maximum 69 Number: lc/1323.md + - 1324. Print Words Vertically: lc/1324.md + - 1325. Delete Leaves With a Given Value: lc/1325.md + - 1326. Minimum Number of Taps to Open to Water a Garden: lc/1326.md + - 1327. List the Products Ordered in a Period: lc/1327.md + - 1328. Break a Palindrome: lc/1328.md + - 1329. Sort the Matrix Diagonally: lc/1329.md + - 1330. Reverse Subarray To Maximize Array Value: lc/1330.md + - 1331. Rank Transform of an Array: lc/1331.md + - 1332. Remove Palindromic Subsequences: lc/1332.md + - 1333. Filter Restaurants by Vegan-Friendly, Price and Distance: lc/1333.md + - 1334. Find the City With the Smallest Number of Neighbors at a Threshold Distance: lc/1334.md + - 1335. Minimum Difficulty of a Job Schedule: lc/1335.md + - 1336. Number of Transactions per Visit: lc/1336.md + - 1337. The K Weakest Rows in a Matrix: lc/1337.md + - 1338. Reduce Array Size to The Half: lc/1338.md + - 1339. Maximum Product of Splitted Binary Tree: lc/1339.md + - 1340. Jump Game V: lc/1340.md + - 1341. Movie Rating: lc/1341.md + - 1342. Number of Steps to Reduce a Number to Zero: lc/1342.md + - 1343. Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold: lc/1343.md + - 1344. Angle Between Hands of a Clock: lc/1344.md + - 1345. Jump Game IV: lc/1345.md + - 1346. Check If N and Its Double Exist: lc/1346.md + - 1347. Minimum Number of Steps to Make Two Strings Anagram: lc/1347.md + - 1348. Tweet Counts Per Frequency: lc/1348.md + - 1349. Maximum Students Taking Exam: lc/1349.md + - 1350. Students With Invalid Departments: lc/1350.md + - 1351. Count Negative Numbers in a Sorted Matrix: lc/1351.md + - 1352. Product of the Last K Numbers: lc/1352.md + - 1353. Maximum Number of Events That Can Be Attended: lc/1353.md + - 1354. Construct Target Array With Multiple Sums: lc/1354.md + - 1355. Activity Participants: lc/1355.md + - 1356. Sort Integers by The Number of 1 Bits: lc/1356.md + - 1357. Apply Discount Every n Orders: lc/1357.md + - 1358. Number of Substrings Containing All Three Characters: lc/1358.md + - 1359. Count All Valid Pickup and Delivery Options: lc/1359.md + - 1360. Number of Days Between Two Dates: lc/1360.md + - 1361. Validate Binary Tree Nodes: lc/1361.md + - 1362. Closest Divisors: lc/1362.md + - 1363. Largest Multiple of Three: lc/1363.md + - 1364. Number of Trusted Contacts of a Customer: lc/1364.md + - 1365. How Many Numbers Are Smaller Than the Current Number: lc/1365.md + - 1366. Rank Teams by Votes: lc/1366.md + - 1367. Linked List in Binary Tree: lc/1367.md + - 1368. Minimum Cost to Make at Least One Valid Path in a Grid: lc/1368.md + - 1369. Get the Second Most Recent Activity: lc/1369.md + - 1370. Increasing Decreasing String: lc/1370.md + - 1371. Find the Longest Substring Containing Vowels in Even Counts: lc/1371.md + - 1372. Longest ZigZag Path in a Binary Tree: lc/1372.md + - 1373. Maximum Sum BST in Binary Tree: lc/1373.md + - 1374. Generate a String With Characters That Have Odd Counts: lc/1374.md + - 1375. Number of Times Binary String Is Prefix-Aligned: lc/1375.md + - 1376. Time Needed to Inform All Employees: lc/1376.md + - 1377. Frog Position After T Seconds: lc/1377.md + - 1378. Replace Employee ID With The Unique Identifier: lc/1378.md + - 1379. Find a Corresponding Node of a Binary Tree in a Clone of That Tree: lc/1379.md + - 1380. Lucky Numbers in a Matrix: lc/1380.md + - 1381. Design a Stack With Increment Operation: lc/1381.md + - 1382. Balance a Binary Search Tree: lc/1382.md + - 1383. Maximum Performance of a Team: lc/1383.md + - 1384. Total Sales Amount by Year: lc/1384.md + - 1385. Find the Distance Value Between Two Arrays: lc/1385.md + - 1386. Cinema Seat Allocation: lc/1386.md + - 1387. Sort Integers by The Power Value: lc/1387.md + - 1388. Pizza With 3n Slices: lc/1388.md + - 1389. Create Target Array in the Given Order: lc/1389.md + - 1390. Four Divisors: lc/1390.md + - 1391. Check if There is a Valid Path in a Grid: lc/1391.md + - 1392. Longest Happy Prefix: lc/1392.md + - 1393. Capital GainLoss: lc/1393.md + - 1394. Find Lucky Integer in an Array: lc/1394.md + - 1395. Count Number of Teams: lc/1395.md + - 1396. Design Underground System: lc/1396.md + - 1397. Find All Good Strings: lc/1397.md + - 1398. Customers Who Bought Products A and B but Not C: lc/1398.md + - 1399. Count Largest Group: lc/1399.md + - 1400. Construct K Palindrome Strings: lc/1400.md + - 1401. Circle and Rectangle Overlapping: lc/1401.md + - 1402. Reducing Dishes: lc/1402.md + - 1403. Minimum Subsequence in Non-Increasing Order: lc/1403.md + - 1404. Number of Steps to Reduce a Number in Binary Representation to One: lc/1404.md + - 1405. Longest Happy String: lc/1405.md + - 1406. Stone Game III: lc/1406.md + - 1407. Top Travellers: lc/1407.md + - 1408. String Matching in an Array: lc/1408.md + - 1409. Queries on a Permutation With Key: lc/1409.md + - 1410. HTML Entity Parser: lc/1410.md + - 1411. Number of Ways to Paint N × 3 Grid: lc/1411.md + - 1412. Find the Quiet Students in All Exams: lc/1412.md + - 1413. Minimum Value to Get Positive Step by Step Sum: lc/1413.md + - 1414. Find the Minimum Number of Fibonacci Numbers Whose Sum Is K: lc/1414.md + - 1415. The k-th Lexicographical String of All Happy Strings of Length n: lc/1415.md + - 1416. Restore The Array: lc/1416.md + - 1417. Reformat The String: lc/1417.md + - 1418. Display Table of Food Orders in a Restaurant: lc/1418.md + - 1419. Minimum Number of Frogs Croaking: lc/1419.md + - 1420. Build Array Where You Can Find The Maximum Exactly K Comparisons: lc/1420.md + - 1421. NPV Queries: lc/1421.md + - 1422. Maximum Score After Splitting a String: lc/1422.md + - 1423. Maximum Points You Can Obtain from Cards: lc/1423.md + - 1424. Diagonal Traverse II: lc/1424.md + - 1425. Constrained Subsequence Sum: lc/1425.md + - 1426. Counting Elements: lc/1426.md + - 1427. Perform String Shifts: lc/1427.md + - 1428. Leftmost Column with at Least a One: lc/1428.md + - 1429. First Unique Number: lc/1429.md + - 1430. Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree: lc/1430.md + - 1431. Kids With the Greatest Number of Candies: lc/1431.md + - 1432. Max Difference You Can Get From Changing an Integer: lc/1432.md + - 1433. Check If a String Can Break Another String: lc/1433.md + - 1434. Number of Ways to Wear Different Hats to Each Other: lc/1434.md + - 1435. Create a Session Bar Chart: lc/1435.md + - 1436. Destination City: lc/1436.md + - 1437. Check If All 1's Are at Least Length K Places Away: lc/1437.md + - 1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit: lc/1438.md + - 1439. Find the Kth Smallest Sum of a Matrix With Sorted Rows: lc/1439.md + - 1440. Evaluate Boolean Expression: lc/1440.md + - 1441. Build an Array With Stack Operations: lc/1441.md + - 1442. Count Triplets That Can Form Two Arrays of Equal XOR: lc/1442.md + - 1443. Minimum Time to Collect All Apples in a Tree: lc/1443.md + - 1444. Number of Ways of Cutting a Pizza: lc/1444.md + - 1445. Apples & Oranges: lc/1445.md + - 1446. Consecutive Characters: lc/1446.md + - 1447. Simplified Fractions: lc/1447.md + - 1448. Count Good Nodes in Binary Tree: lc/1448.md + - 1449. Form Largest Integer With Digits That Add up to Target: lc/1449.md + - 1450. Number of Students Doing Homework at a Given Time: lc/1450.md + - 1451. Rearrange Words in a Sentence: lc/1451.md + - 1452. People Whose List of Favorite Companies Is Not a Subset of Another List: lc/1452.md + - 1453. Maximum Number of Darts Inside of a Circular Dartboard: lc/1453.md + - 1454. Active Users: lc/1454.md + - 1455. Check If a Word Occurs As a Prefix of Any Word in a Sentence: lc/1455.md + - 1456. Maximum Number of Vowels in a Substring of Given Length: lc/1456.md + - 1457. Pseudo-Palindromic Paths in a Binary Tree: lc/1457.md + - 1458. Max Dot Product of Two Subsequences: lc/1458.md + - 1459. Rectangles Area: lc/1459.md + - 1460. Make Two Arrays Equal by Reversing Subarrays: lc/1460.md + - 1461. Check If a String Contains All Binary Codes of Size K: lc/1461.md + - 1462. Course Schedule IV: lc/1462.md + - 1463. Cherry Pickup II: lc/1463.md + - 1464. Maximum Product of Two Elements in an Array: lc/1464.md + - 1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts: lc/1465.md + - 1466. Reorder Routes to Make All Paths Lead to the City Zero: lc/1466.md + - 1467. Probability of a Two Boxes Having The Same Number of Distinct Balls: lc/1467.md + - 1468. Calculate Salaries: lc/1468.md + - 1469. Find All The Lonely Nodes: lc/1469.md + - 1470. Shuffle the Array: lc/1470.md + - 1471. The k Strongest Values in an Array: lc/1471.md + - 1472. Design Browser History: lc/1472.md + - 1473. Paint House III: lc/1473.md + - 1474. Delete N Nodes After M Nodes of a Linked List: lc/1474.md + - 1475. Final Prices With a Special Discount in a Shop: lc/1475.md + - 1476. Subrectangle Queries: lc/1476.md + - 1477. Find Two Non-overlapping Sub-arrays Each With Target Sum: lc/1477.md + - 1478. Allocate Mailboxes: lc/1478.md + - 1479. Sales by Day of the Week: lc/1479.md + - 1480. Running Sum of 1d Array: lc/1480.md + - 1481. Least Number of Unique Integers after K Removals: lc/1481.md + - 1482. Minimum Number of Days to Make m Bouquets: lc/1482.md + - 1483. Kth Ancestor of a Tree Node: lc/1483.md + - 1484. Group Sold Products By The Date: lc/1484.md + - 1485. Clone Binary Tree With Random Pointer: lc/1485.md + - 1486. XOR Operation in an Array: lc/1486.md + - 1487. Making File Names Unique: lc/1487.md + - 1488. Avoid Flood in The City: lc/1488.md + - 1489. Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree: lc/1489.md + - 1490. Clone N-ary Tree: lc/1490.md + - 1491. Average Salary Excluding the Minimum and Maximum Salary: lc/1491.md + - 1492. The kth Factor of n: lc/1492.md + - 1493. Longest Subarray of 1's After Deleting One Element: lc/1493.md + - 1494. Parallel Courses II: lc/1494.md + - 1495. Friendly Movies Streamed Last Month: lc/1495.md + - 1496. Path Crossing: lc/1496.md + - 1497. Check If Array Pairs Are Divisible by k: lc/1497.md + - 1498. Number of Subsequences That Satisfy the Given Sum Condition: lc/1498.md + - 1499. Max Value of Equation: lc/1499.md + - 1500. Design a File Sharing System: lc/1500.md + - 1501. Countries You Can Safely Invest In: lc/1501.md + - 1502. Can Make Arithmetic Progression From Sequence: lc/1502.md + - 1503. Last Moment Before All Ants Fall Out of a Plank: lc/1503.md + - 1504. Count Submatrices With All Ones: lc/1504.md + - 1505. Minimum Possible Integer After at Most K Adjacent Swaps On Digits: lc/1505.md + - 1506. Find Root of N-Ary Tree: lc/1506.md + - 1507. Reformat Date: lc/1507.md + - 1508. Range Sum of Sorted Subarray Sums: lc/1508.md + - 1509. Minimum Difference Between Largest and Smallest Value in Three Moves: lc/1509.md + - 1510. Stone Game IV: lc/1510.md + - 1511. Customer Order Frequency: lc/1511.md + - 1512. Number of Good Pairs: lc/1512.md + - 1513. Number of Substrings With Only 1s: lc/1513.md + - 1514. Path with Maximum Probability: lc/1514.md + - 1515. Best Position for a Service Centre: lc/1515.md + - 1516. Move Sub-Tree of N-Ary Tree: lc/1516.md + - 1517. Find Users With Valid E-Mails: lc/1517.md + - 1518. Water Bottles: lc/1518.md + - 1519. Number of Nodes in the Sub-Tree With the Same Label: lc/1519.md + - 1520. Maximum Number of Non-Overlapping Substrings: lc/1520.md + - 1521. Find a Value of a Mysterious Function Closest to Target: lc/1521.md + - 1522. Diameter of N-Ary Tree: lc/1522.md + - 1523. Count Odd Numbers in an Interval Range: lc/1523.md + - 1524. Number of Sub-arrays With Odd Sum: lc/1524.md + - 1525. Number of Good Ways to Split a String: lc/1525.md + - 1526. Minimum Number of Increments on Subarrays to Form a Target Array: lc/1526.md + - 1527. Patients With a Condition: lc/1527.md + - 1528. Shuffle String: lc/1528.md + - 1529. Minimum Suffix Flips: lc/1529.md + - 1530. Number of Good Leaf Nodes Pairs: lc/1530.md + - 1531. String Compression II: lc/1531.md + - 1532. The Most Recent Three Orders: lc/1532.md + - 1533. Find the Index of the Large Integer: lc/1533.md + - 1534. Count Good Triplets: lc/1534.md + - 1535. Find the Winner of an Array Game: lc/1535.md + - 1536. Minimum Swaps to Arrange a Binary Grid: lc/1536.md + - 1537. Get the Maximum Score: lc/1537.md + - 1538. Guess the Majority in a Hidden Array: lc/1538.md + - 1539. Kth Missing Positive Number: lc/1539.md + - 1540. Can Convert String in K Moves: lc/1540.md + - 1541. Minimum Insertions to Balance a Parentheses String: lc/1541.md + - 1542. Find Longest Awesome Substring: lc/1542.md + - 1543. Fix Product Name Format: lc/1543.md + - 1544. Make The String Great: lc/1544.md + - 1545. Find Kth Bit in Nth Binary String: lc/1545.md + - 1546. Maximum Number of Non-Overlapping Subarrays With Sum Equals Target: lc/1546.md + - 1547. Minimum Cost to Cut a Stick: lc/1547.md + - 1548. The Most Similar Path in a Graph: lc/1548.md + - 1549. The Most Recent Orders for Each Product: lc/1549.md + - 1550. Three Consecutive Odds: lc/1550.md + - 1551. Minimum Operations to Make Array Equal: lc/1551.md + - 1552. Magnetic Force Between Two Balls: lc/1552.md + - 1553. Minimum Number of Days to Eat N Oranges: lc/1553.md + - 1554. Strings Differ by One Character: lc/1554.md + - 1555. Bank Account Summary: lc/1555.md + - 1556. Thousand Separator: lc/1556.md + - 1557. Minimum Number of Vertices to Reach All Nodes: lc/1557.md + - 1558. Minimum Numbers of Function Calls to Make Target Array: lc/1558.md + - 1559. Detect Cycles in 2D Grid: lc/1559.md + - 1560. Most Visited Sector in a Circular Track: lc/1560.md + - 1561. Maximum Number of Coins You Can Get: lc/1561.md + - 1562. Find Latest Group of Size M: lc/1562.md + - 1563. Stone Game V: lc/1563.md + - 1564. Put Boxes Into the Warehouse I: lc/1564.md + - 1565. Unique Orders and Customers Per Month: lc/1565.md + - 1566. Detect Pattern of Length M Repeated K or More Times: lc/1566.md + - 1567. Maximum Length of Subarray With Positive Product: lc/1567.md + - 1568. Minimum Number of Days to Disconnect Island: lc/1568.md + - 1569. Number of Ways to Reorder Array to Get Same BST: lc/1569.md + - 1570. Dot Product of Two Sparse Vectors: lc/1570.md + - 1571. Warehouse Manager: lc/1571.md + - 1572. Matrix Diagonal Sum: lc/1572.md + - 1573. Number of Ways to Split a String: lc/1573.md + - 1574. Shortest Subarray to be Removed to Make Array Sorted: lc/1574.md + - 1575. Count All Possible Routes: lc/1575.md + - 1576. Replace All 's to Avoid Consecutive Repeating Characters: lc/1576.md + - 1577. Number of Ways Where Square of Number Is Equal to Product of Two Numbers: lc/1577.md + - 1578. Minimum Time to Make Rope Colorful: lc/1578.md + - 1579. Remove Max Number of Edges to Keep Graph Fully Traversable: lc/1579.md + - 1580. Put Boxes Into the Warehouse II: lc/1580.md + - 1581. Customer Who Visited but Did Not Make Any Transactions: lc/1581.md + - 1582. Special Positions in a Binary Matrix: lc/1582.md + - 1583. Count Unhappy Friends: lc/1583.md + - 1584. Min Cost to Connect All Points: lc/1584.md + - 1585. Check If String Is Transformable With Substring Sort Operations: lc/1585.md + - 1586. Binary Search Tree Iterator II: lc/1586.md + - 1587. Bank Account Summary II: lc/1587.md + - 1588. Sum of All Odd Length Subarrays: lc/1588.md + - 1589. Maximum Sum Obtained of Any Permutation: lc/1589.md + - 1590. Make Sum Divisible by P: lc/1590.md + - 1591. Strange Printer II: lc/1591.md + - 1592. Rearrange Spaces Between Words: lc/1592.md + - 1593. Split a String Into the Max Number of Unique Substrings: lc/1593.md + - 1594. Maximum Non Negative Product in a Matrix: lc/1594.md + - 1595. Minimum Cost to Connect Two Groups of Points: lc/1595.md + - 1596. The Most Frequently Ordered Products for Each Customer: lc/1596.md + - 1597. Build Binary Expression Tree From Infix Expression: lc/1597.md + - 1598. Crawler Log Folder: lc/1598.md + - 1599. Maximum Profit of Operating a Centennial Wheel: lc/1599.md + - 1600. Throne Inheritance: lc/1600.md + - 1601. Maximum Number of Achievable Transfer Requests: lc/1601.md + - 1602. Find Nearest Right Node in Binary Tree: lc/1602.md + - 1603. Design Parking System: lc/1603.md + - 1604. Alert Using Same Key-Card Three or More Times in a One Hour Period: lc/1604.md + - 1605. Find Valid Matrix Given Row and Column Sums: lc/1605.md + - 1606. Find Servers That Handled Most Number of Requests: lc/1606.md + - 1607. Sellers With No Sales: lc/1607.md + - 1608. Special Array With X Elements Greater Than or Equal X: lc/1608.md + - 1609. Even Odd Tree: lc/1609.md + - 1610. Maximum Number of Visible Points: lc/1610.md + - 1611. Minimum One Bit Operations to Make Integers Zero: lc/1611.md + - 1612. Check If Two Expression Trees are Equivalent: lc/1612.md + - 1613. Find the Missing IDs: lc/1613.md + - 1614. Maximum Nesting Depth of the Parentheses: lc/1614.md + - 1615. Maximal Network Rank: lc/1615.md + - 1616. Split Two Strings to Make Palindrome: lc/1616.md + - 1617. Count Subtrees With Max Distance Between Cities: lc/1617.md + - 1618. Maximum Font to Fit a Sentence in a Screen: lc/1618.md + - 1619. Mean of Array After Removing Some Elements: lc/1619.md + - 1620. Coordinate With Maximum Network Quality: lc/1620.md + - 1621. Number of Sets of K Non-Overlapping Line Segments: lc/1621.md + - 1622. Fancy Sequence: lc/1622.md + - 1623. All Valid Triplets That Can Represent a Country: lc/1623.md + - 1624. Largest Substring Between Two Equal Characters: lc/1624.md + - 1625. Lexicographically Smallest String After Applying Operations: lc/1625.md + - 1626. Best Team With No Conflicts: lc/1626.md + - 1627. Graph Connectivity With Threshold: lc/1627.md + - 1628. Design an Expression Tree With Evaluate Function: lc/1628.md + - 1629. Slowest Key: lc/1629.md + - 1630. Arithmetic Subarrays: lc/1630.md + - 1631. Path With Minimum Effort: lc/1631.md + - 1632. Rank Transform of a Matrix: lc/1632.md + - 1633. Percentage of Users Attended a Contest: lc/1633.md + - 1634. Add Two Polynomials Represented as Linked Lists: lc/1634.md + - 1635. Hopper Company Queries I: lc/1635.md + - 1636. Sort Array by Increasing Frequency: lc/1636.md + - 1637. Widest Vertical Area Between Two Points Containing No Points: lc/1637.md + - 1638. Count Substrings That Differ by One Character: lc/1638.md + - 1639. Number of Ways to Form a Target String Given a Dictionary: lc/1639.md + - 1640. Check Array Formation Through Concatenation: lc/1640.md + - 1641. Count Sorted Vowel Strings: lc/1641.md + - 1642. Furthest Building You Can Reach: lc/1642.md + - 1643. Kth Smallest Instructions: lc/1643.md + - 1644. Lowest Common Ancestor of a Binary Tree II: lc/1644.md + - 1645. Hopper Company Queries II: lc/1645.md + - 1646. Get Maximum in Generated Array: lc/1646.md + - 1647. Minimum Deletions to Make Character Frequencies Unique: lc/1647.md + - 1648. Sell Diminishing-Valued Colored Balls: lc/1648.md + - 1649. Create Sorted Array through Instructions: lc/1649.md + - 1650. Lowest Common Ancestor of a Binary Tree III: lc/1650.md + - 1651. Hopper Company Queries III: lc/1651.md + - 1652. Defuse the Bomb: lc/1652.md + - 1653. Minimum Deletions to Make String Balanced: lc/1653.md + - 1654. Minimum Jumps to Reach Home: lc/1654.md + - 1655. Distribute Repeating Integers: lc/1655.md + - 1656. Design an Ordered Stream: lc/1656.md + - 1657. Determine if Two Strings Are Close: lc/1657.md + - 1658. Minimum Operations to Reduce X to Zero: lc/1658.md + - 1659. Maximize Grid Happiness: lc/1659.md + - 1660. Correct a Binary Tree: lc/1660.md + - 1661. Average Time of Process per Machine: lc/1661.md + - 1662. Check If Two String Arrays are Equivalent: lc/1662.md + - 1663. Smallest String With A Given Numeric Value: lc/1663.md + - 1664. Ways to Make a Fair Array: lc/1664.md + - 1665. Minimum Initial Energy to Finish Tasks: lc/1665.md + - 1666. Change the Root of a Binary Tree: lc/1666.md + - 1667. Fix Names in a Table: lc/1667.md + - 1668. Maximum Repeating Substring: lc/1668.md + - 1669. Merge In Between Linked Lists: lc/1669.md + - 1670. Design Front Middle Back Queue: lc/1670.md + - 1671. Minimum Number of Removals to Make Mountain Array: lc/1671.md + - 1672. Richest Customer Wealth: lc/1672.md + - 1673. Find the Most Competitive Subsequence: lc/1673.md + - 1674. Minimum Moves to Make Array Complementary: lc/1674.md + - 1675. Minimize Deviation in Array: lc/1675.md + - 1676. Lowest Common Ancestor of a Binary Tree IV: lc/1676.md + - 1677. Product's Worth Over Invoices: lc/1677.md + - 1678. Goal Parser Interpretation: lc/1678.md + - 1679. Max Number of K-Sum Pairs: lc/1679.md + - 1680. Concatenation of Consecutive Binary Numbers: lc/1680.md + - 1681. Minimum Incompatibility: lc/1681.md + - 1682. Longest Palindromic Subsequence II: lc/1682.md + - 1683. Invalid Tweets: lc/1683.md + - 1684. Count the Number of Consistent Strings: lc/1684.md + - 1685. Sum of Absolute Differences in a Sorted Array: lc/1685.md + - 1686. Stone Game VI: lc/1686.md + - 1687. Delivering Boxes from Storage to Ports: lc/1687.md + - 1688. Count of Matches in Tournament: lc/1688.md + - 1689. Partitioning Into Minimum Number Of Deci-Binary Numbers: lc/1689.md + - 1690. Stone Game VII: lc/1690.md + - 1691. Maximum Height by Stacking Cuboids: lc/1691.md + - 1692. Count Ways to Distribute Candies: lc/1692.md + - 1693. Daily Leads and Partners: lc/1693.md + - 1694. Reformat Phone Number: lc/1694.md + - 1695. Maximum Erasure Value: lc/1695.md + - 1696. Jump Game VI: lc/1696.md + - 1697. Checking Existence of Edge Length Limited Paths: lc/1697.md + - 1698. Number of Distinct Substrings in a String: lc/1698.md + - 1699. Number of Calls Between Two Persons: lc/1699.md + - 1700. Number of Students Unable to Eat Lunch: lc/1700.md + - 1701. Average Waiting Time: lc/1701.md + - 1702. Maximum Binary String After Change: lc/1702.md + - 1703. Minimum Adjacent Swaps for K Consecutive Ones: lc/1703.md + - 1704. Determine if String Halves Are Alike: lc/1704.md + - 1705. Maximum Number of Eaten Apples: lc/1705.md + - 1706. Where Will the Ball Fall: lc/1706.md + - 1707. Maximum XOR With an Element From Array: lc/1707.md + - 1708. Largest Subarray Length K: lc/1708.md + - 1709. Biggest Window Between Visits: lc/1709.md + - 1710. Maximum Units on a Truck: lc/1710.md + - 1711. Count Good Meals: lc/1711.md + - 1712. Ways to Split Array Into Three Subarrays: lc/1712.md + - 1713. Minimum Operations to Make a Subsequence: lc/1713.md + - 1714. Sum Of Special Evenly-Spaced Elements In Array: lc/1714.md + - 1715. Count Apples and Oranges: lc/1715.md + - 1716. Calculate Money in Leetcode Bank: lc/1716.md + - 1717. Maximum Score From Removing Substrings: lc/1717.md + - 1718. Construct the Lexicographically Largest Valid Sequence: lc/1718.md + - 1719. Number Of Ways To Reconstruct A Tree: lc/1719.md + - 1720. Decode XORed Array: lc/1720.md + - 1721. Swapping Nodes in a Linked List: lc/1721.md + - 1722. Minimize Hamming Distance After Swap Operations: lc/1722.md + - 1723. Find Minimum Time to Finish All Jobs: lc/1723.md + - 1724. Checking Existence of Edge Length Limited Paths II: lc/1724.md + - 1725. Number Of Rectangles That Can Form The Largest Square: lc/1725.md + - 1726. Tuple with Same Product: lc/1726.md + - 1727. Largest Submatrix With Rearrangements: lc/1727.md + - 1728. Cat and Mouse II: lc/1728.md + - 1729. Find Followers Count: lc/1729.md + - 1730. Shortest Path to Get Food: lc/1730.md + - 1731. The Number of Employees Which Report to Each Employee: lc/1731.md + - 1732. Find the Highest Altitude: lc/1732.md + - 1733. Minimum Number of People to Teach: lc/1733.md + - 1734. Decode XORed Permutation: lc/1734.md + - 1735. Count Ways to Make Array With Product: lc/1735.md + - 1736. Latest Time by Replacing Hidden Digits: lc/1736.md + - 1737. Change Minimum Characters to Satisfy One of Three Conditions: lc/1737.md + - 1738. Find Kth Largest XOR Coordinate Value: lc/1738.md + - 1739. Building Boxes: lc/1739.md + - 1740. Find Distance in a Binary Tree: lc/1740.md + - 1741. Find Total Time Spent by Each Employee: lc/1741.md + - 1742. Maximum Number of Balls in a Box: lc/1742.md + - 1743. Restore the Array From Adjacent Pairs: lc/1743.md + - 1744. Can You Eat Your Favorite Candy on Your Favorite Day: lc/1744.md + - 1745. Palindrome Partitioning IV: lc/1745.md + - 1746. Maximum Subarray Sum After One Operation: lc/1746.md + - 1747. Leetflex Banned Accounts: lc/1747.md + - 1748. Sum of Unique Elements: lc/1748.md + - 1749. Maximum Absolute Sum of Any Subarray: lc/1749.md + - 1750. Minimum Length of String After Deleting Similar Ends: lc/1750.md + - 1751. Maximum Number of Events That Can Be Attended II: lc/1751.md + - 1752. Check if Array Is Sorted and Rotated: lc/1752.md + - 1753. Maximum Score From Removing Stones: lc/1753.md + - 1754. Largest Merge Of Two Strings: lc/1754.md + - 1755. Closest Subsequence Sum: lc/1755.md + - 1756. Design Most Recently Used Queue: lc/1756.md + - 1757. Recyclable and Low Fat Products: lc/1757.md + - 1758. Minimum Changes To Make Alternating Binary String: lc/1758.md + - 1759. Count Number of Homogenous Substrings: lc/1759.md + - 1760. Minimum Limit of Balls in a Bag: lc/1760.md + - 1761. Minimum Degree of a Connected Trio in a Graph: lc/1761.md + - 1762. Buildings With an Ocean View: lc/1762.md + - 1763. Longest Nice Substring: lc/1763.md + - 1764. Form Array by Concatenating Subarrays of Another Array: lc/1764.md + - 1765. Map of Highest Peak: lc/1765.md + - 1766. Tree of Coprimes: lc/1766.md + - 1767. Find the Subtasks That Did Not Execute: lc/1767.md + - 1768. Merge Strings Alternately: lc/1768.md + - 1769. Minimum Number of Operations to Move All Balls to Each Box: lc/1769.md + - 1770. Maximum Score from Performing Multiplication Operations: lc/1770.md + - 1771. Maximize Palindrome Length From Subsequences: lc/1771.md + - 1772. Sort Features by Popularity: lc/1772.md + - 1773. Count Items Matching a Rule: lc/1773.md + - 1774. Closest Dessert Cost: lc/1774.md + - 1775. Equal Sum Arrays With Minimum Number of Operations: lc/1775.md + - 1776. Car Fleet II: lc/1776.md + - 1777. Product's Price for Each Store: lc/1777.md + - 1778. Shortest Path in a Hidden Grid: lc/1778.md + - 1779. Find Nearest Point That Has the Same X or Y Coordinate: lc/1779.md + - 1780. Check if Number is a Sum of Powers of Three: lc/1780.md + - 1781. Sum of Beauty of All Substrings: lc/1781.md + - 1782. Count Pairs Of Nodes: lc/1782.md + - 1783. Grand Slam Titles: lc/1783.md + - 1784. Check if Binary String Has at Most One Segment of Ones: lc/1784.md + - 1785. Minimum Elements to Add to Form a Given Sum: lc/1785.md + - 1786. Number of Restricted Paths From First to Last Node: lc/1786.md + - 1787. Make the XOR of All Segments Equal to Zero: lc/1787.md + - 1788. Maximize the Beauty of the Garden: lc/1788.md + - 1789. Primary Department for Each Employee: lc/1789.md + - 1790. Check if One String Swap Can Make Strings Equal: lc/1790.md + - 1791. Find Center of Star Graph: lc/1791.md + - 1792. Maximum Average Pass Ratio: lc/1792.md + - 1793. Maximum Score of a Good Subarray: lc/1793.md + - 1794. Count Pairs of Equal Substrings With Minimum Difference: lc/1794.md + - 1795. Rearrange Products Table: lc/1795.md + - 1796. Second Largest Digit in a String: lc/1796.md + - 1797. Design Authentication Manager: lc/1797.md + - 1798. Maximum Number of Consecutive Values You Can Make: lc/1798.md + - 1799. Maximize Score After N Operations: lc/1799.md + - 1800. Maximum Ascending Subarray Sum: lc/1800.md + - 1801. Number of Orders in the Backlog: lc/1801.md + - 1802. Maximum Value at a Given Index in a Bounded Array: lc/1802.md + - 1803. Count Pairs With XOR in a Range: lc/1803.md + - 1804. Implement Trie II (Prefix Tree): lc/1804.md + - 1805. Number of Different Integers in a String: lc/1805.md + - 1806. Minimum Number of Operations to Reinitialize a Permutation: lc/1806.md + - 1807. Evaluate the Bracket Pairs of a String: lc/1807.md + - 1808. Maximize Number of Nice Divisors: lc/1808.md + - 1809. Ad-Free Sessions: lc/1809.md + - 1810. Minimum Path Cost in a Hidden Grid: lc/1810.md + - 1811. Find Interview Candidates: lc/1811.md + - 1812. Determine Color of a Chessboard Square: lc/1812.md + - 1813. Sentence Similarity III: lc/1813.md + - 1814. Count Nice Pairs in an Array: lc/1814.md + - 1815. Maximum Number of Groups Getting Fresh Donuts: lc/1815.md + - 1816. Truncate Sentence: lc/1816.md + - 1817. Finding the Users Active Minutes: lc/1817.md + - 1818. Minimum Absolute Sum Difference: lc/1818.md + - 1819. Number of Different Subsequences GCDs: lc/1819.md + - 1820. Maximum Number of Accepted Invitations: lc/1820.md + - 1821. Find Customers With Positive Revenue this Year: lc/1821.md + - 1822. Sign of the Product of an Array: lc/1822.md + - 1823. Find the Winner of the Circular Game: lc/1823.md + - 1824. Minimum Sideway Jumps: lc/1824.md + - 1825. Finding MK Average: lc/1825.md + - 1826. Faulty Sensor: lc/1826.md + - 1827. Minimum Operations to Make the Array Increasing: lc/1827.md + - 1828. Queries on Number of Points Inside a Circle: lc/1828.md + - 1829. Maximum XOR for Each Query: lc/1829.md + - 1830. Minimum Number of Operations to Make String Sorted: lc/1830.md + - 1831. Maximum Transaction Each Day: lc/1831.md + - 1832. Check if the Sentence Is Pangram: lc/1832.md + - 1833. Maximum Ice Cream Bars: lc/1833.md + - 1834. Single-Threaded CPU: lc/1834.md + - 1835. Find XOR Sum of All Pairs Bitwise AND: lc/1835.md + - 1836. Remove Duplicates From an Unsorted Linked List: lc/1836.md + - 1837. Sum of Digits in Base K: lc/1837.md + - 1838. Frequency of the Most Frequent Element: lc/1838.md + - 1839. Longest Substring Of All Vowels in Order: lc/1839.md + - 1840. Maximum Building Height: lc/1840.md + - 1841. League Statistics: lc/1841.md + - 1842. Next Palindrome Using Same Digits: lc/1842.md + - 1843. Suspicious Bank Accounts: lc/1843.md + - 1844. Replace All Digits with Characters: lc/1844.md + - 1845. Seat Reservation Manager: lc/1845.md + - 1846. Maximum Element After Decreasing and Rearranging: lc/1846.md + - 1847. Closest Room: lc/1847.md + - 1848. Minimum Distance to the Target Element: lc/1848.md + - 1849. Splitting a String Into Descending Consecutive Values: lc/1849.md + - 1850. Minimum Adjacent Swaps to Reach the Kth Smallest Number: lc/1850.md + - 1851. Minimum Interval to Include Each Query: lc/1851.md + - 1852. Distinct Numbers in Each Subarray: lc/1852.md + - 1853. Convert Date Format: lc/1853.md + - 1854. Maximum Population Year: lc/1854.md + - 1855. Maximum Distance Between a Pair of Values: lc/1855.md + - 1856. Maximum Subarray Min-Product: lc/1856.md + - 1857. Largest Color Value in a Directed Graph: lc/1857.md + - 1858. Longest Word With All Prefixes: lc/1858.md + - 1859. Sorting the Sentence: lc/1859.md + - 1860. Incremental Memory Leak: lc/1860.md + - 1861. Rotating the Box: lc/1861.md + - 1862. Sum of Floored Pairs: lc/1862.md + - 1863. Sum of All Subset XOR Totals: lc/1863.md + - 1864. Minimum Number of Swaps to Make the Binary String Alternating: lc/1864.md + - 1865. Finding Pairs With a Certain Sum: lc/1865.md + - 1866. Number of Ways to Rearrange Sticks With K Sticks Visible: lc/1866.md + - 1867. Orders With Maximum Quantity Above Average: lc/1867.md + - 1868. Product of Two Run-Length Encoded Arrays: lc/1868.md + - 1869. Longer Contiguous Segments of Ones than Zeros: lc/1869.md + - 1870. Minimum Speed to Arrive on Time: lc/1870.md + - 1871. Jump Game VII: lc/1871.md + - 1872. Stone Game VIII: lc/1872.md + - 1873. Calculate Special Bonus: lc/1873.md + - 1874. Minimize Product Sum of Two Arrays: lc/1874.md + - 1875. Group Employees of the Same Salary: lc/1875.md + - 1876. Substrings of Size Three with Distinct Characters: lc/1876.md + - 1877. Minimize Maximum Pair Sum in Array: lc/1877.md + - 1878. Get Biggest Three Rhombus Sums in a Grid: lc/1878.md + - 1879. Minimum XOR Sum of Two Arrays: lc/1879.md + - 1880. Check if Word Equals Summation of Two Words: lc/1880.md + - 1881. Maximum Value after Insertion: lc/1881.md + - 1882. Process Tasks Using Servers: lc/1882.md + - 1883. Minimum Skips to Arrive at Meeting On Time: lc/1883.md + - 1884. Egg Drop With 2 Eggs and N Floors: lc/1884.md + - 1885. Count Pairs in Two Arrays: lc/1885.md + - 1886. Determine Whether Matrix Can Be Obtained By Rotation: lc/1886.md + - 1887. Reduction Operations to Make the Array Elements Equal: lc/1887.md + - 1888. Minimum Number of Flips to Make the Binary String Alternating: lc/1888.md + - 1889. Minimum Space Wasted From Packaging: lc/1889.md + - 1890. The Latest Login in 2020: lc/1890.md + - 1891. Cutting Ribbons: lc/1891.md + - 1892. Page Recommendations II: lc/1892.md + - 1893. Check if All the Integers in a Range Are Covered: lc/1893.md + - 1894. Find the Student that Will Replace the Chalk: lc/1894.md + - 1895. Largest Magic Square: lc/1895.md + - 1896. Minimum Cost to Change the Final Value of Expression: lc/1896.md + - 1897. Redistribute Characters to Make All Strings Equal: lc/1897.md + - 1898. Maximum Number of Removable Characters: lc/1898.md + - 1899. Merge Triplets to Form Target Triplet: lc/1899.md + - 1900. The Earliest and Latest Rounds Where Players Compete: lc/1900.md + - 1901. Find a Peak Element II: lc/1901.md + - 1902. Depth of BST Given Insertion Order: lc/1902.md + - 1903. Largest Odd Number in String: lc/1903.md + - 1904. The Number of Full Rounds You Have Played: lc/1904.md + - 1905. Count Sub Islands: lc/1905.md + - 1906. Minimum Absolute Difference Queries: lc/1906.md + - 1907. Count Salary Categories: lc/1907.md + - 1908. Game of Nim: lc/1908.md + - 1909. Remove One Element to Make the Array Strictly Increasing: lc/1909.md + - 1910. Remove All Occurrences of a Substring: lc/1910.md + - 1911. Maximum Alternating Subsequence Sum: lc/1911.md + - 1912. Design Movie Rental System: lc/1912.md + - 1913. Maximum Product Difference Between Two Pairs: lc/1913.md + - 1914. Cyclically Rotating a Grid: lc/1914.md + - 1915. Number of Wonderful Substrings: lc/1915.md + - 1916. Count Ways to Build Rooms in an Ant Colony: lc/1916.md + - 1917. Leetcodify Friends Recommendations: lc/1917.md + - 1918. Kth Smallest Subarray Sum: lc/1918.md + - 1919. Leetcodify Similar Friends: lc/1919.md + - 1920. Build Array from Permutation: lc/1920.md + - 1921. Eliminate Maximum Number of Monsters: lc/1921.md + - 1922. Count Good Numbers: lc/1922.md + - 1923. Longest Common Subpath: lc/1923.md + - 1924. Erect the Fence II: lc/1924.md + - 1925. Count Square Sum Triples: lc/1925.md + - 1926. Nearest Exit from Entrance in Maze: lc/1926.md + - 1927. Sum Game: lc/1927.md + - 1928. Minimum Cost to Reach Destination in Time: lc/1928.md + - 1929. Concatenation of Array: lc/1929.md + - 1930. Unique Length-3 Palindromic Subsequences: lc/1930.md + - 1931. Painting a Grid With Three Different Colors: lc/1931.md + - 1932. Merge BSTs to Create Single BST: lc/1932.md + - 1933. Check if String Is Decomposable Into Value-Equal Substrings: lc/1933.md + - 1934. Confirmation Rate: lc/1934.md + - 1935. Maximum Number of Words You Can Type: lc/1935.md + - 1936. Add Minimum Number of Rungs: lc/1936.md + - 1937. Maximum Number of Points with Cost: lc/1937.md + - 1938. Maximum Genetic Difference Query: lc/1938.md + - 1939. Users That Actively Request Confirmation Messages: lc/1939.md + - 1940. Longest Common Subsequence Between Sorted Arrays: lc/1940.md + - 1941. Check if All Characters Have Equal Number of Occurrences: lc/1941.md + - 1942. The Number of the Smallest Unoccupied Chair: lc/1942.md + - 1943. Describe the Painting: lc/1943.md + - 1944. Number of Visible People in a Queue: lc/1944.md + - 1945. Sum of Digits of String After Convert: lc/1945.md + - 1946. Largest Number After Mutating Substring: lc/1946.md + - 1947. Maximum Compatibility Score Sum: lc/1947.md + - 1948. Delete Duplicate Folders in System: lc/1948.md + - 1949. Strong Friendship: lc/1949.md + - 1950. Maximum of Minimum Values in All Subarrays: lc/1950.md + - 1951. All the Pairs With the Maximum Number of Common Followers: lc/1951.md + - 1952. Three Divisors: lc/1952.md + - 1953. Maximum Number of Weeks for Which You Can Work: lc/1953.md + - 1954. Minimum Garden Perimeter to Collect Enough Apples: lc/1954.md + - 1955. Count Number of Special Subsequences: lc/1955.md + - 1956. Minimum Time For K Virus Variants to Spread: lc/1956.md + - 1957. Delete Characters to Make Fancy String: lc/1957.md + - 1958. Check if Move is Legal: lc/1958.md + - 1959. Minimum Total Space Wasted With K Resizing Operations: lc/1959.md + - 1960. Maximum Product of the Length of Two Palindromic Substrings: lc/1960.md + - 1961. Check If String Is a Prefix of Array: lc/1961.md + - 1962. Remove Stones to Minimize the Total: lc/1962.md + - 1963. Minimum Number of Swaps to Make the String Balanced: lc/1963.md + - 1964. Find the Longest Valid Obstacle Course at Each Position: lc/1964.md + - 1965. Employees With Missing Information: lc/1965.md + - 1966. Binary Searchable Numbers in an Unsorted Array: lc/1966.md + - 1967. Number of Strings That Appear as Substrings in Word: lc/1967.md + - 1968. Array With Elements Not Equal to Average of Neighbors: lc/1968.md + - 1969. Minimum Non-Zero Product of the Array Elements: lc/1969.md + - 1970. Last Day Where You Can Still Cross: lc/1970.md + - 1971. Find if Path Exists in Graph: lc/1971.md + - 1972. First and Last Call On the Same Day: lc/1972.md + - 1973. Count Nodes Equal to Sum of Descendants: lc/1973.md + - 1974. Minimum Time to Type Word Using Special Typewriter: lc/1974.md + - 1975. Maximum Matrix Sum: lc/1975.md + - 1976. Number of Ways to Arrive at Destination: lc/1976.md + - 1977. Number of Ways to Separate Numbers: lc/1977.md + - 1978. Employees Whose Manager Left the Company: lc/1978.md + - 1979. Find Greatest Common Divisor of Array: lc/1979.md + - 1980. Find Unique Binary String: lc/1980.md + - 1981. Minimize the Difference Between Target and Chosen Elements: lc/1981.md + - 1982. Find Array Given Subset Sums: lc/1982.md + - 1983. Widest Pair of Indices With Equal Range Sum: lc/1983.md + - 1984. Minimum Difference Between Highest and Lowest of K Scores: lc/1984.md + - 1985. Find the Kth Largest Integer in the Array: lc/1985.md + - 1986. Minimum Number of Work Sessions to Finish the Tasks: lc/1986.md + - 1987. Number of Unique Good Subsequences: lc/1987.md + - 1988. Find Cutoff Score for Each School: lc/1988.md + - 1989. Maximum Number of People That Can Be Caught in Tag: lc/1989.md + - 1990. Count the Number of Experiments: lc/1990.md + - 1991. Find the Middle Index in Array: lc/1991.md + - 1992. Find All Groups of Farmland: lc/1992.md + - 1993. Operations on Tree: lc/1993.md + - 1994. The Number of Good Subsets: lc/1994.md + - 1995. Count Special Quadruplets: lc/1995.md + - 1996. The Number of Weak Characters in the Game: lc/1996.md + - 1997. First Day Where You Have Been in All the Rooms: lc/1997.md + - 1998. GCD Sort of an Array: lc/1998.md + - 1999. Smallest Greater Multiple Made of Two Digits: lc/1999.md + - 2000. Reverse Prefix of Word: lc/2000.md + - 2001. Number of Pairs of Interchangeable Rectangles: lc/2001.md + - 2002. Maximum Product of the Length of Two Palindromic Subsequences: lc/2002.md + - 2003. Smallest Missing Genetic Value in Each Subtree: lc/2003.md + - 2004. The Number of Seniors and Juniors to Join the Company: lc/2004.md + - 2005. Subtree Removal Game with Fibonacci Tree: lc/2005.md + - 2006. Count Number of Pairs With Absolute Difference K: lc/2006.md + - 2007. Find Original Array From Doubled Array: lc/2007.md + - 2008. Maximum Earnings From Taxi: lc/2008.md + - 2009. Minimum Number of Operations to Make Array Continuous: lc/2009.md + - 2010. The Number of Seniors and Juniors to Join the Company II: lc/2010.md + - 2011. Final Value of Variable After Performing Operations: lc/2011.md + - 2012. Sum of Beauty in the Array: lc/2012.md + - 2013. Detect Squares: lc/2013.md + - 2014. Longest Subsequence Repeated k Times: lc/2014.md + - 2015. Average Height of Buildings in Each Segment: lc/2015.md + - 2016. Maximum Difference Between Increasing Elements: lc/2016.md + - 2017. Grid Game: lc/2017.md + - 2018. Check if Word Can Be Placed In Crossword: lc/2018.md + - 2019. The Score of Students Solving Math Expression: lc/2019.md + - 2020. Number of Accounts That Did Not Stream: lc/2020.md + - 2021. Brightest Position on Street: lc/2021.md + - 2022. Convert 1D Array Into 2D Array: lc/2022.md + - 2023. Number of Pairs of Strings With Concatenation Equal to Target: lc/2023.md + - 2024. Maximize the Confusion of an Exam: lc/2024.md + - 2025. Maximum Number of Ways to Partition an Array: lc/2025.md + - 2026. Low-Quality Problems: lc/2026.md + - 2027. Minimum Moves to Convert String: lc/2027.md + - 2028. Find Missing Observations: lc/2028.md + - 2029. Stone Game IX: lc/2029.md + - 2030. Smallest K-Length Subsequence With Occurrences of a Letter: lc/2030.md + - 2031. Count Subarrays With More Ones Than Zeros: lc/2031.md + - 2032. Two Out of Three: lc/2032.md + - 2033. Minimum Operations to Make a Uni-Value Grid: lc/2033.md + - 2034. Stock Price Fluctuation: lc/2034.md + - 2035. Partition Array Into Two Arrays to Minimize Sum Difference: lc/2035.md + - 2036. Maximum Alternating Subarray Sum: lc/2036.md + - 2037. Minimum Number of Moves to Seat Everyone: lc/2037.md + - 2038. Remove Colored Pieces if Both Neighbors are the Same Color: lc/2038.md + - 2039. The Time When the Network Becomes Idle: lc/2039.md + - 2040. Kth Smallest Product of Two Sorted Arrays: lc/2040.md + - 2041. Accepted Candidates From the Interviews: lc/2041.md + - 2042. Check if Numbers Are Ascending in a Sentence: lc/2042.md + - 2043. Simple Bank System: lc/2043.md + - 2044. Count Number of Maximum Bitwise-OR Subsets: lc/2044.md + - 2045. Second Minimum Time to Reach Destination: lc/2045.md + - 2046. Sort Linked List Already Sorted Using Absolute Values: lc/2046.md + - 2047. Number of Valid Words in a Sentence: lc/2047.md + - 2048. Next Greater Numerically Balanced Number: lc/2048.md + - 2049. Count Nodes With the Highest Score: lc/2049.md + - 2050. Parallel Courses III: lc/2050.md + - 2051. The Category of Each Member in the Store: lc/2051.md + - 2052. Minimum Cost to Separate Sentence Into Rows: lc/2052.md + - 2053. Kth Distinct String in an Array: lc/2053.md + - 2054. Two Best Non-Overlapping Events: lc/2054.md + - 2055. Plates Between Candles: lc/2055.md + - 2056. Number of Valid Move Combinations On Chessboard: lc/2056.md + - 2057. Smallest Index With Equal Value: lc/2057.md + - 2058. Find the Minimum and Maximum Number of Nodes Between Critical Points: lc/2058.md + - 2059. Minimum Operations to Convert Number: lc/2059.md + - 2060. Check if an Original String Exists Given Two Encoded Strings: lc/2060.md + - 2061. Number of Spaces Cleaning Robot Cleaned: lc/2061.md + - 2062. Count Vowel Substrings of a String: lc/2062.md + - 2063. Vowels of All Substrings: lc/2063.md + - 2064. Minimized Maximum of Products Distributed to Any Store: lc/2064.md + - 2065. Maximum Path Quality of a Graph: lc/2065.md + - 2066. Account Balance: lc/2066.md + - 2067. Number of Equal Count Substrings: lc/2067.md + - 2068. Check Whether Two Strings are Almost Equivalent: lc/2068.md + - 2069. Walking Robot Simulation II: lc/2069.md + - 2070. Most Beautiful Item for Each Query: lc/2070.md + - 2071. Maximum Number of Tasks You Can Assign: lc/2071.md + - 2072. The Winner University: lc/2072.md + - 2073. Time Needed to Buy Tickets: lc/2073.md + - 2074. Reverse Nodes in Even Length Groups: lc/2074.md + - 2075. Decode the Slanted Ciphertext: lc/2075.md + - 2076. Process Restricted Friend Requests: lc/2076.md + - 2077. Paths in Maze That Lead to Same Room: lc/2077.md + - 2078. Two Furthest Houses With Different Colors: lc/2078.md + - 2079. Watering Plants: lc/2079.md + - 2080. Range Frequency Queries: lc/2080.md + - 2081. Sum of k-Mirror Numbers: lc/2081.md + - 2082. The Number of Rich Customers: lc/2082.md + - 2083. Substrings That Begin and End With the Same Letter: lc/2083.md + - 2084. Drop Type 1 Orders for Customers With Type 0 Orders: lc/2084.md + - 2085. Count Common Words With One Occurrence: lc/2085.md + - 2086. Minimum Number of Food Buckets to Feed the Hamsters: lc/2086.md + - 2087. Minimum Cost Homecoming of a Robot in a Grid: lc/2087.md + - 2088. Count Fertile Pyramids in a Land: lc/2088.md + - 2089. Find Target Indices After Sorting Array: lc/2089.md + - 2090. K Radius Subarray Averages: lc/2090.md + - 2091. Removing Minimum and Maximum From Array: lc/2091.md + - 2092. Find All People With Secret: lc/2092.md + - 2093. Minimum Cost to Reach City With Discounts: lc/2093.md + - 2094. Finding 3-Digit Even Numbers: lc/2094.md + - 2095. Delete the Middle Node of a Linked List: lc/2095.md + - 2096. Step-By-Step Directions From a Binary Tree Node to Another: lc/2096.md + - 2097. Valid Arrangement of Pairs: lc/2097.md + - 2098. Subsequence of Size K With the Largest Even Sum: lc/2098.md + - 2099. Find Subsequence of Length K With the Largest Sum: lc/2099.md + - 2100. Find Good Days to Rob the Bank: lc/2100.md + - 2101. Detonate the Maximum Bombs: lc/2101.md + - 2102. Sequentially Ordinal Rank Tracker: lc/2102.md + - 2103. Rings and Rods: lc/2103.md + - 2104. Sum of Subarray Ranges: lc/2104.md + - 2105. Watering Plants II: lc/2105.md + - 2106. Maximum Fruits Harvested After at Most K Steps: lc/2106.md + - 2107. Number of Unique Flavors After Sharing K Candies: lc/2107.md + - 2108. Find First Palindromic String in the Array: lc/2108.md + - 2109. Adding Spaces to a String: lc/2109.md + - 2110. Number of Smooth Descent Periods of a Stock: lc/2110.md + - 2111. Minimum Operations to Make the Array K-Increasing: lc/2111.md + - 2112. The Airport With the Most Traffic: lc/2112.md + - 2113. Elements in Array After Removing and Replacing Elements: lc/2113.md + - 2114. Maximum Number of Words Found in Sentences: lc/2114.md + - 2115. Find All Possible Recipes from Given Supplies: lc/2115.md + - 2116. Check if a Parentheses String Can Be Valid: lc/2116.md + - 2117. Abbreviating the Product of a Range: lc/2117.md + - 2118. Build the Equation: lc/2118.md + - 2119. A Number After a Double Reversal: lc/2119.md + - 2120. Execution of All Suffix Instructions Staying in a Grid: lc/2120.md + - 2121. Intervals Between Identical Elements: lc/2121.md + - 2122. Recover the Original Array: lc/2122.md + - 2123. Minimum Operations to Remove Adjacent Ones in Matrix: lc/2123.md + - 2124. Check if All A's Appears Before All B's: lc/2124.md + - 2125. Number of Laser Beams in a Bank: lc/2125.md + - 2126. Destroying Asteroids: lc/2126.md + - 2127. Maximum Employees to Be Invited to a Meeting: lc/2127.md + - 2128. Remove All Ones With Row and Column Flips: lc/2128.md + - 2129. Capitalize the Title: lc/2129.md + - 2130. Maximum Twin Sum of a Linked List: lc/2130.md + - 2131. Longest Palindrome by Concatenating Two Letter Words: lc/2131.md + - 2132. Stamping the Grid: lc/2132.md + - 2133. Check if Every Row and Column Contains All Numbers: lc/2133.md + - 2134. Minimum Swaps to Group All 1's Together II: lc/2134.md + - 2135. Count Words Obtained After Adding a Letter: lc/2135.md + - 2136. Earliest Possible Day of Full Bloom: lc/2136.md + - 2137. Pour Water Between Buckets to Make Water Levels Equal: lc/2137.md + - 2138. Divide a String Into Groups of Size k: lc/2138.md + - 2139. Minimum Moves to Reach Target Score: lc/2139.md + - 2140. Solving Questions With Brainpower: lc/2140.md + - 2141. Maximum Running Time of N Computers: lc/2141.md + - 2142. The Number of Passengers in Each Bus I: lc/2142.md + - 2143. Choose Numbers From Two Arrays in Range: lc/2143.md + - 2144. Minimum Cost of Buying Candies With Discount: lc/2144.md + - 2145. Count the Hidden Sequences: lc/2145.md + - 2146. K Highest Ranked Items Within a Price Range: lc/2146.md + - 2147. Number of Ways to Divide a Long Corridor: lc/2147.md + - 2148. Count Elements With Strictly Smaller and Greater Elements: lc/2148.md + - 2149. Rearrange Array Elements by Sign: lc/2149.md + - 2150. Find All Lonely Numbers in the Array: lc/2150.md + - 2151. Maximum Good People Based on Statements: lc/2151.md + - 2152. Minimum Number of Lines to Cover Points: lc/2152.md + - 2153. The Number of Passengers in Each Bus II: lc/2153.md + - 2154. Keep Multiplying Found Values by Two: lc/2154.md + - 2155. All Divisions With the Highest Score of a Binary Array: lc/2155.md + - 2156. Find Substring With Given Hash Value: lc/2156.md + - 2157. Groups of Strings: lc/2157.md + - 2158. Amount of New Area Painted Each Day: lc/2158.md + - 2159. Order Two Columns Independently: lc/2159.md + - 2160. Minimum Sum of Four Digit Number After Splitting Digits: lc/2160.md + - 2161. Partition Array According to Given Pivot: lc/2161.md + - 2162. Minimum Cost to Set Cooking Time: lc/2162.md + - 2163. Minimum Difference in Sums After Removal of Elements: lc/2163.md + - 2164. Sort Even and Odd Indices Independently: lc/2164.md + - 2165. Smallest Value of the Rearranged Number: lc/2165.md + - 2166. Design Bitset: lc/2166.md + - 2167. Minimum Time to Remove All Cars Containing Illegal Goods: lc/2167.md + - 2168. Unique Substrings With Equal Digit Frequency: lc/2168.md + - 2169. Count Operations to Obtain Zero: lc/2169.md + - 2170. Minimum Operations to Make the Array Alternating: lc/2170.md + - 2171. Removing Minimum Number of Magic Beans: lc/2171.md + - 2172. Maximum AND Sum of Array: lc/2172.md + - 2173. Longest Winning Streak: lc/2173.md + - 2174. Remove All Ones With Row and Column Flips II: lc/2174.md + - 2175. The Change in Global Rankings: lc/2175.md + - 2176. Count Equal and Divisible Pairs in an Array: lc/2176.md + - 2177. Find Three Consecutive Integers That Sum to a Given Number: lc/2177.md + - 2178. Maximum Split of Positive Even Integers: lc/2178.md + - 2179. Count Good Triplets in an Array: lc/2179.md + - 2180. Count Integers With Even Digit Sum: lc/2180.md + - 2181. Merge Nodes in Between Zeros: lc/2181.md + - 2182. Construct String With Repeat Limit: lc/2182.md + - 2183. Count Array Pairs Divisible by K: lc/2183.md + - 2184. Number of Ways to Build Sturdy Brick Wall: lc/2184.md + - 2185. Counting Words With a Given Prefix: lc/2185.md + - 2186. Minimum Number of Steps to Make Two Strings Anagram II: lc/2186.md + - 2187. Minimum Time to Complete Trips: lc/2187.md + - 2188. Minimum Time to Finish the Race: lc/2188.md + - 2189. Number of Ways to Build House of Cards: lc/2189.md + - 2190. Most Frequent Number Following Key In an Array: lc/2190.md + - 2191. Sort the Jumbled Numbers: lc/2191.md + - 2192. All Ancestors of a Node in a Directed Acyclic Graph: lc/2192.md + - 2193. Minimum Number of Moves to Make Palindrome: lc/2193.md + - 2194. Cells in a Range on an Excel Sheet: lc/2194.md + - 2195. Append K Integers With Minimal Sum: lc/2195.md + - 2196. Create Binary Tree From Descriptions: lc/2196.md + - 2197. Replace Non-Coprime Numbers in Array: lc/2197.md + - 2198. Number of Single Divisor Triplets: lc/2198.md + - 2199. Finding the Topic of Each Post: lc/2199.md + - 2200. Find All K-Distant Indices in an Array: lc/2200.md + - 2201. Count Artifacts That Can Be Extracted: lc/2201.md + - 2202. Maximize the Topmost Element After K Moves: lc/2202.md + - 2203. Minimum Weighted Subgraph With the Required Paths: lc/2203.md + - 2204. Distance to a Cycle in Undirected Graph: lc/2204.md + - 2205. The Number of Users That Are Eligible for Discount: lc/2205.md + - 2206. Divide Array Into Equal Pairs: lc/2206.md + - 2207. Maximize Number of Subsequences in a String: lc/2207.md + - 2208. Minimum Operations to Halve Array Sum: lc/2208.md + - 2209. Minimum White Tiles After Covering With Carpets: lc/2209.md + - 2210. Count Hills and Valleys in an Array: lc/2210.md + - 2211. Count Collisions on a Road: lc/2211.md + - 2212. Maximum Points in an Archery Competition: lc/2212.md + - 2213. Longest Substring of One Repeating Character: lc/2213.md + - 2214. Minimum Health to Beat Game: lc/2214.md + - 2215. Find the Difference of Two Arrays: lc/2215.md + - 2216. Minimum Deletions to Make Array Beautiful: lc/2216.md + - 2217. Find Palindrome With Fixed Length: lc/2217.md + - 2218. Maximum Value of K Coins From Piles: lc/2218.md + - 2219. Maximum Sum Score of Array: lc/2219.md + - 2220. Minimum Bit Flips to Convert Number: lc/2220.md + - 2221. Find Triangular Sum of an Array: lc/2221.md + - 2222. Number of Ways to Select Buildings: lc/2222.md + - 2223. Sum of Scores of Built Strings: lc/2223.md + - 2224. Minimum Number of Operations to Convert Time: lc/2224.md + - 2225. Find Players With Zero or One Losses: lc/2225.md + - 2226. Maximum Candies Allocated to K Children: lc/2226.md + - 2227. Encrypt and Decrypt Strings: lc/2227.md + - 2228. Users With Two Purchases Within Seven Days: lc/2228.md + - 2229. Check if an Array Is Consecutive: lc/2229.md + - 2230. The Users That Are Eligible for Discount: lc/2230.md + - 2231. Largest Number After Digit Swaps by Parity: lc/2231.md + - 2232. Minimize Result by Adding Parentheses to Expression: lc/2232.md + - 2233. Maximum Product After K Increments: lc/2233.md + - 2234. Maximum Total Beauty of the Gardens: lc/2234.md + - 2235. Add Two Integers: lc/2235.md + - 2236. Root Equals Sum of Children: lc/2236.md + - 2237. Count Positions on Street With Required Brightness: lc/2237.md + - 2238. Number of Times a Driver Was a Passenger: lc/2238.md + - 2239. Find Closest Number to Zero: lc/2239.md + - 2240. Number of Ways to Buy Pens and Pencils: lc/2240.md + - 2241. Design an ATM Machine: lc/2241.md + - 2242. Maximum Score of a Node Sequence: lc/2242.md + - 2243. Calculate Digit Sum of a String: lc/2243.md + - 2244. Minimum Rounds to Complete All Tasks: lc/2244.md + - 2245. Maximum Trailing Zeros in a Cornered Path: lc/2245.md + - 2246. Longest Path With Different Adjacent Characters: lc/2246.md + - 2247. Maximum Cost of Trip With K Highways: lc/2247.md + - 2248. Intersection of Multiple Arrays: lc/2248.md + - 2249. Count Lattice Points Inside a Circle: lc/2249.md + - 2250. Count Number of Rectangles Containing Each Point: lc/2250.md + - 2251. Number of Flowers in Full Bloom: lc/2251.md + - 2252. Dynamic Pivoting of a Table: lc/2252.md + - 2253. Dynamic Unpivoting of a Table: lc/2253.md + - 2254. Design Video Sharing Platform: lc/2254.md + - 2255. Count Prefixes of a Given String: lc/2255.md + - 2256. Minimum Average Difference: lc/2256.md + - 2257. Count Unguarded Cells in the Grid: lc/2257.md + - 2258. Escape the Spreading Fire: lc/2258.md + - 2259. Remove Digit From Number to Maximize Result: lc/2259.md + - 2260. Minimum Consecutive Cards to Pick Up: lc/2260.md + - 2261. K Divisible Elements Subarrays: lc/2261.md + - 2262. Total Appeal of A String: lc/2262.md + - 2263. Make Array Non-decreasing or Non-increasing: lc/2263.md + - 2264. Largest 3-Same-Digit Number in String: lc/2264.md + - 2265. Count Nodes Equal to Average of Subtree: lc/2265.md + - 2266. Count Number of Texts: lc/2266.md + - 2267. Check if There Is a Valid Parentheses String Path: lc/2267.md + - 2268. Minimum Number of Keypresses: lc/2268.md + - 2269. Find the K-Beauty of a Number: lc/2269.md + - 2270. Number of Ways to Split Array: lc/2270.md + - 2271. Maximum White Tiles Covered by a Carpet: lc/2271.md + - 2272. Substring With Largest Variance: lc/2272.md + - 2273. Find Resultant Array After Removing Anagrams: lc/2273.md + - 2274. Maximum Consecutive Floors Without Special Floors: lc/2274.md + - 2275. Largest Combination With Bitwise AND Greater Than Zero: lc/2275.md + - 2276. Count Integers in Intervals: lc/2276.md + - 2277. Closest Node to Path in Tree: lc/2277.md + - 2278. Percentage of Letter in String: lc/2278.md + - 2279. Maximum Bags With Full Capacity of Rocks: lc/2279.md + - 2280. Minimum Lines to Represent a Line Chart: lc/2280.md + - 2281. Sum of Total Strength of Wizards: lc/2281.md + - 2282. Number of People That Can Be Seen in a Grid: lc/2282.md + - 2283. Check if Number Has Equal Digit Count and Digit Value: lc/2283.md + - 2284. Sender With Largest Word Count: lc/2284.md + - 2285. Maximum Total Importance of Roads: lc/2285.md + - 2286. Booking Concert Tickets in Groups: lc/2286.md + - 2287. Rearrange Characters to Make Target String: lc/2287.md + - 2288. Apply Discount to Prices: lc/2288.md + - 2289. Steps to Make Array Non-decreasing: lc/2289.md + - 2290. Minimum Obstacle Removal to Reach Corner: lc/2290.md + - 2291. Maximum Profit From Trading Stocks: lc/2291.md + - 2292. Products With Three or More Orders in Two Consecutive Years: lc/2292.md + - 2293. Min Max Game: lc/2293.md + - 2294. Partition Array Such That Maximum Difference Is K: lc/2294.md + - 2295. Replace Elements in an Array: lc/2295.md + - 2296. Design a Text Editor: lc/2296.md + - 2297. Jump Game VIII: lc/2297.md + - 2298. Tasks Count in the Weekend: lc/2298.md + - 2299. Strong Password Checker II: lc/2299.md + - 2300. Successful Pairs of Spells and Potions: lc/2300.md + - 2301. Match Substring After Replacement: lc/2301.md + - 2302. Count Subarrays With Score Less Than K: lc/2302.md + - 2303. Calculate Amount Paid in Taxes: lc/2303.md + - 2304. Minimum Path Cost in a Grid: lc/2304.md + - 2305. Fair Distribution of Cookies: lc/2305.md + - 2306. Naming a Company: lc/2306.md + - 2307. Check for Contradictions in Equations: lc/2307.md + - 2308. Arrange Table by Gender: lc/2308.md + - 2309. Greatest English Letter in Upper and Lower Case: lc/2309.md + - 2310. Sum of Numbers With Units Digit K: lc/2310.md + - 2311. Longest Binary Subsequence Less Than or Equal to K: lc/2311.md + - 2312. Selling Pieces of Wood: lc/2312.md + - 2313. Minimum Flips in Binary Tree to Get Result: lc/2313.md + - 2314. The First Day of the Maximum Recorded Degree in Each City: lc/2314.md + - 2315. Count Asterisks: lc/2315.md + - 2316. Count Unreachable Pairs of Nodes in an Undirected Graph: lc/2316.md + - 2317. Maximum XOR After Operations: lc/2317.md + - 2318. Number of Distinct Roll Sequences: lc/2318.md + - 2319. Check if Matrix Is X-Matrix: lc/2319.md + - 2320. Count Number of Ways to Place Houses: lc/2320.md + - 2321. Maximum Score Of Spliced Array: lc/2321.md + - 2322. Minimum Score After Removals on a Tree: lc/2322.md + - 2323. Find Minimum Time to Finish All Jobs II: lc/2323.md + - 2324. Product Sales Analysis IV: lc/2324.md + - 2325. Decode the Message: lc/2325.md + - 2326. Spiral Matrix IV: lc/2326.md + - 2327. Number of People Aware of a Secret: lc/2327.md + - 2328. Number of Increasing Paths in a Grid: lc/2328.md + - 2329. Product Sales Analysis V: lc/2329.md + - 2330. Valid Palindrome IV: lc/2330.md + - 2331. Evaluate Boolean Binary Tree: lc/2331.md + - 2332. The Latest Time to Catch a Bus: lc/2332.md + - 2333. Minimum Sum of Squared Difference: lc/2333.md + - 2334. Subarray With Elements Greater Than Varying Threshold: lc/2334.md + - 2335. Minimum Amount of Time to Fill Cups: lc/2335.md + - 2336. Smallest Number in Infinite Set: lc/2336.md + - 2337. Move Pieces to Obtain a String: lc/2337.md + - 2338. Count the Number of Ideal Arrays: lc/2338.md + - 2339. All the Matches of the League: lc/2339.md + - 2340. Minimum Adjacent Swaps to Make a Valid Array: lc/2340.md + - 2341. Maximum Number of Pairs in Array: lc/2341.md + - 2342. Max Sum of a Pair With Equal Sum of Digits: lc/2342.md + - 2343. Query Kth Smallest Trimmed Number: lc/2343.md + - 2344. Minimum Deletions to Make Array Divisible: lc/2344.md + - 2345. Finding the Number of Visible Mountains: lc/2345.md + - 2346. Compute the Rank as a Percentage: lc/2346.md + - 2347. Best Poker Hand: lc/2347.md + - 2348. Number of Zero-Filled Subarrays: lc/2348.md + - 2349. Design a Number Container System: lc/2349.md + - 2350. Shortest Impossible Sequence of Rolls: lc/2350.md + - 2351. First Letter to Appear Twice: lc/2351.md + - 2352. Equal Row and Column Pairs: lc/2352.md + - 2353. Design a Food Rating System: lc/2353.md + - 2354. Number of Excellent Pairs: lc/2354.md + - 2355. Maximum Number of Books You Can Take: lc/2355.md + - 2356. Number of Unique Subjects Taught by Each Teacher: lc/2356.md + - 2357. Make Array Zero by Subtracting Equal Amounts: lc/2357.md + - 2358. Maximum Number of Groups Entering a Competition: lc/2358.md + - 2359. Find Closest Node to Given Two Nodes: lc/2359.md + - 2360. Longest Cycle in a Graph: lc/2360.md + - 2361. Minimum Costs Using the Train Line: lc/2361.md + - 2362. Generate the Invoice: lc/2362.md + - 2363. Merge Similar Items: lc/2363.md + - 2364. Count Number of Bad Pairs: lc/2364.md + - 2365. Task Scheduler II: lc/2365.md + - 2366. Minimum Replacements to Sort the Array: lc/2366.md + - 2367. Number of Arithmetic Triplets: lc/2367.md + - 2368. Reachable Nodes With Restrictions: lc/2368.md + - 2369. Check if There is a Valid Partition For The Array: lc/2369.md + - 2370. Longest Ideal Subsequence: lc/2370.md + - 2371. Minimize Maximum Value in a Grid: lc/2371.md + - 2372. Calculate the Influence of Each Salesperson: lc/2372.md + - 2373. Largest Local Values in a Matrix: lc/2373.md + - 2374. Node With Highest Edge Score: lc/2374.md + - 2375. Construct Smallest Number From DI String: lc/2375.md + - 2376. Count Special Integers: lc/2376.md + - 2377. Sort the Olympic Table: lc/2377.md + - 2378. Choose Edges to Maximize Score in a Tree: lc/2378.md + - 2379. Minimum Recolors to Get K Consecutive Black Blocks: lc/2379.md + - 2380. Time Needed to Rearrange a Binary String: lc/2380.md + - 2381. Shifting Letters II: lc/2381.md + - 2382. Maximum Segment Sum After Removals: lc/2382.md + - 2383. Minimum Hours of Training to Win a Competition: lc/2383.md + - 2384. Largest Palindromic Number: lc/2384.md + - 2385. Amount of Time for Binary Tree to Be Infected: lc/2385.md + - 2386. Find the K-Sum of an Array: lc/2386.md + - 2387. Median of a Row Wise Sorted Matrix: lc/2387.md + - 2388. Change Null Values in a Table to the Previous Value: lc/2388.md + - 2389. Longest Subsequence With Limited Sum: lc/2389.md + - 2390. Removing Stars From a String: lc/2390.md + - 2391. Minimum Amount of Time to Collect Garbage: lc/2391.md + - 2392. Build a Matrix With Conditions: lc/2392.md + - 2393. Count Strictly Increasing Subarrays: lc/2393.md + - 2394. Employees With Deductions: lc/2394.md + - 2395. Find Subarrays With Equal Sum: lc/2395.md + - 2396. Strictly Palindromic Number: lc/2396.md + - 2397. Maximum Rows Covered by Columns: lc/2397.md + - 2398. Maximum Number of Robots Within Budget: lc/2398.md + - 2399. Check Distances Between Same Letters: lc/2399.md + - 2400. Number of Ways to Reach a Position After Exactly k Steps: lc/2400.md + - 2401. Longest Nice Subarray: lc/2401.md + - 2402. Meeting Rooms III: lc/2402.md + - 2403. Minimum Time to Kill All Monsters: lc/2403.md + - 2404. Most Frequent Even Element: lc/2404.md + - 2405. Optimal Partition of String: lc/2405.md + - 2406. Divide Intervals Into Minimum Number of Groups: lc/2406.md + - 2407. Longest Increasing Subsequence II: lc/2407.md + - 2408. Design SQL: lc/2408.md + - 2409. Count Days Spent Together: lc/2409.md + - 2410. Maximum Matching of Players With Trainers: lc/2410.md + - 2411. Smallest Subarrays With Maximum Bitwise OR: lc/2411.md + - 2412. Minimum Money Required Before Transactions: lc/2412.md + - 2413. Smallest Even Multiple: lc/2413.md + - 2414. Length of the Longest Alphabetical Continuous Substring: lc/2414.md + - 2415. Reverse Odd Levels of Binary Tree: lc/2415.md + - 2416. Sum of Prefix Scores of Strings: lc/2416.md + - 2417. Closest Fair Integer: lc/2417.md + - 2418. Sort the People: lc/2418.md + - 2419. Longest Subarray With Maximum Bitwise AND: lc/2419.md + - 2420. Find All Good Indices: lc/2420.md + - 2421. Number of Good Paths: lc/2421.md + - 2422. Merge Operations to Turn Array Into a Palindrome: lc/2422.md + - 2423. Remove Letter To Equalize Frequency: lc/2423.md + - 2424. Longest Uploaded Prefix: lc/2424.md + - 2425. Bitwise XOR of All Pairings: lc/2425.md + - 2426. Number of Pairs Satisfying Inequality: lc/2426.md + - 2427. Number of Common Factors: lc/2427.md + - 2428. Maximum Sum of an Hourglass: lc/2428.md + - 2429. Minimize XOR: lc/2429.md + - 2430. Maximum Deletions on a String: lc/2430.md + - 2431. Maximize Total Tastiness of Purchased Fruits: lc/2431.md + - 2432. The Employee That Worked on the Longest Task: lc/2432.md + - 2433. Find The Original Array of Prefix Xor: lc/2433.md + - 2434. Using a Robot to Print the Lexicographically Smallest String: lc/2434.md + - 2435. Paths in Matrix Whose Sum Is Divisible by K: lc/2435.md + - 2436. Minimum Split Into Subarrays With GCD Greater Than One: lc/2436.md + - 2437. Number of Valid Clock Times: lc/2437.md + - 2438. Range Product Queries of Powers: lc/2438.md + - 2439. Minimize Maximum of Array: lc/2439.md + - 2440. Create Components With Same Value: lc/2440.md + - 2441. Largest Positive Integer That Exists With Its Negative: lc/2441.md + - 2442. Count Number of Distinct Integers After Reverse Operations: lc/2442.md + - 2443. Sum of Number and Its Reverse: lc/2443.md + - 2444. Count Subarrays With Fixed Bounds: lc/2444.md + - 2445. Number of Nodes With Value One: lc/2445.md + - 2446. Determine if Two Events Have Conflict: lc/2446.md + - 2447. Number of Subarrays With GCD Equal to K: lc/2447.md + - 2448. Minimum Cost to Make Array Equal: lc/2448.md + - 2449. Minimum Number of Operations to Make Arrays Similar: lc/2449.md + - 2450. Number of Distinct Binary Strings After Applying Operations: lc/2450.md + - 2451. Odd String Difference: lc/2451.md + - 2452. Words Within Two Edits of Dictionary: lc/2452.md + - 2453. Destroy Sequential Targets: lc/2453.md + - 2454. Next Greater Element IV: lc/2454.md + - 2455. Average Value of Even Numbers That Are Divisible by Three: lc/2455.md + - 2456. Most Popular Video Creator: lc/2456.md + - 2457. Minimum Addition to Make Integer Beautiful: lc/2457.md + - 2458. Height of Binary Tree After Subtree Removal Queries: lc/2458.md + - 2459. Sort Array by Moving Items to Empty Space: lc/2459.md + - 2460. Apply Operations to an Array: lc/2460.md + - 2461. Maximum Sum of Distinct Subarrays With Length K: lc/2461.md + - 2462. Total Cost to Hire K Workers: lc/2462.md + - 2463. Minimum Total Distance Traveled: lc/2463.md + - 2464. Minimum Subarrays in a Valid Split: lc/2464.md + - 2465. Number of Distinct Averages: lc/2465.md + - 2466. Count Ways To Build Good Strings: lc/2466.md + - 2467. Most Profitable Path in a Tree: lc/2467.md + - 2468. Split Message Based on Limit: lc/2468.md + - 2469. Convert the Temperature: lc/2469.md + - 2470. Number of Subarrays With LCM Equal to K: lc/2470.md + - 2471. Minimum Number of Operations to Sort a Binary Tree by Level: lc/2471.md + - 2472. Maximum Number of Non-overlapping Palindrome Substrings: lc/2472.md + - 2473. Minimum Cost to Buy Apples: lc/2473.md + - 2474. Customers With Strictly Increasing Purchases: lc/2474.md + - 2475. Number of Unequal Triplets in Array: lc/2475.md + - 2476. Closest Nodes Queries in a Binary Search Tree: lc/2476.md + - 2477. Minimum Fuel Cost to Report to the Capital: lc/2477.md + - 2478. Number of Beautiful Partitions: lc/2478.md + - 2479. Maximum XOR of Two Non-Overlapping Subtrees: lc/2479.md + - 2480. Form a Chemical Bond: lc/2480.md + - 2481. Minimum Cuts to Divide a Circle: lc/2481.md + - 2482. Difference Between Ones and Zeros in Row and Column: lc/2482.md + - 2483. Minimum Penalty for a Shop: lc/2483.md + - 2484. Count Palindromic Subsequences: lc/2484.md + - 2485. Find the Pivot Integer: lc/2485.md + - 2486. Append Characters to String to Make Subsequence: lc/2486.md + - 2487. Remove Nodes From Linked List: lc/2487.md + - 2488. Count Subarrays With Median K: lc/2488.md + - 2489. Number of Substrings With Fixed Ratio: lc/2489.md + - 2490. Circular Sentence: lc/2490.md + - 2491. Divide Players Into Teams of Equal Skill: lc/2491.md + - 2492. Minimum Score of a Path Between Two Cities: lc/2492.md + - 2493. Divide Nodes Into the Maximum Number of Groups: lc/2493.md + - 2494. Merge Overlapping Events in the Same Hall: lc/2494.md + - 2495. Number of Subarrays Having Even Product: lc/2495.md + - 2496. Maximum Value of a String in an Array: lc/2496.md + - 2497. Maximum Star Sum of a Graph: lc/2497.md + - 2498. Frog Jump II: lc/2498.md + - 2499. Minimum Total Cost to Make Arrays Unequal: lc/2499.md + - 2500. Delete Greatest Value in Each Row: lc/2500.md + - 2501. Longest Square Streak in an Array: lc/2501.md + - 2502. Design Memory Allocator: lc/2502.md + - 2503. Maximum Number of Points From Grid Queries: lc/2503.md + - 2504. Concatenate the Name and the Profession: lc/2504.md + - 2505. Bitwise OR of All Subsequence Sums: lc/2505.md + - 2506. Count Pairs Of Similar Strings: lc/2506.md + - 2507. Smallest Value After Replacing With Sum of Prime Factors: lc/2507.md + - 2508. Add Edges to Make Degrees of All Nodes Even: lc/2508.md + - 2509. Cycle Length Queries in a Tree: lc/2509.md + - 2510. Check if There is a Path With Equal Number of 0's And 1's: lc/2510.md + - 2511. Maximum Enemy Forts That Can Be Captured: lc/2511.md + - 2512. Reward Top K Students: lc/2512.md + - 2513. Minimize the Maximum of Two Arrays: lc/2513.md + - 2514. Count Anagrams: lc/2514.md + - 2515. Shortest Distance to Target String in a Circular Array: lc/2515.md + - 2516. Take K of Each Character From Left and Right: lc/2516.md + - 2517. Maximum Tastiness of Candy Basket: lc/2517.md + - 2518. Number of Great Partitions: lc/2518.md + - 2519. Count the Number of K-Big Indices: lc/2519.md + - 2520. Count the Digits That Divide a Number: lc/2520.md + - 2521. Distinct Prime Factors of Product of Array: lc/2521.md + - 2522. Partition String Into Substrings With Values at Most K: lc/2522.md + - 2523. Closest Prime Numbers in Range: lc/2523.md + - 2524. Maximum Frequency Score of a Subarray: lc/2524.md + - 2525. Categorize Box According to Criteria: lc/2525.md + - 2526. Find Consecutive Integers from a Data Stream: lc/2526.md + - 2527. Find Xor-Beauty of Array: lc/2527.md + - 2528. Maximize the Minimum Powered City: lc/2528.md + - 2529. Maximum Count of Positive Integer and Negative Integer: lc/2529.md + - 2530. Maximal Score After Applying K Operations: lc/2530.md + - 2531. Make Number of Distinct Characters Equal: lc/2531.md + - 2532. Time to Cross a Bridge: lc/2532.md + - 2533. Number of Good Binary Strings: lc/2533.md + - 2534. Time Taken to Cross the Door: lc/2534.md + - 2535. Difference Between Element Sum and Digit Sum of an Array: lc/2535.md + - 2536. Increment Submatrices by One: lc/2536.md + - 2537. Count the Number of Good Subarrays: lc/2537.md + - 2538. Difference Between Maximum and Minimum Price Sum: lc/2538.md + - 2539. Count the Number of Good Subsequences: lc/2539.md + - 2540. Minimum Common Value: lc/2540.md + - 2541. Minimum Operations to Make Array Equal II: lc/2541.md + - 2542. Maximum Subsequence Score: lc/2542.md + - 2543. Check if Point Is Reachable: lc/2543.md + - 2544. Alternating Digit Sum: lc/2544.md + - 2545. Sort the Students by Their Kth Score: lc/2545.md + - 2546. Apply Bitwise Operations to Make Strings Equal: lc/2546.md + - 2547. Minimum Cost to Split an Array: lc/2547.md + - 2548. Maximum Price to Fill a Bag: lc/2548.md + - 2549. Count Distinct Numbers on Board: lc/2549.md + - 2550. Count Collisions of Monkeys on a Polygon: lc/2550.md + - 2551. Put Marbles in Bags: lc/2551.md + - 2552. Count Increasing Quadruplets: lc/2552.md + - 2553. Separate the Digits in an Array: lc/2553.md + - 2554. Maximum Number of Integers to Choose From a Range I: lc/2554.md + - 2555. Maximize Win From Two Segments: lc/2555.md + - 2556. Disconnect Path in a Binary Matrix by at Most One Flip: lc/2556.md + - 2557. Maximum Number of Integers to Choose From a Range II: lc/2557.md + - 2558. Take Gifts From the Richest Pile: lc/2558.md + - 2559. Count Vowel Strings in Ranges: lc/2559.md + - 2560. House Robber IV: lc/2560.md + - 2561. Rearranging Fruits: lc/2561.md + - 2562. Find the Array Concatenation Value: lc/2562.md + - 2563. Count the Number of Fair Pairs: lc/2563.md + - 2564. Substring XOR Queries: lc/2564.md + - 2565. Subsequence With the Minimum Score: lc/2565.md + - 2566. Maximum Difference by Remapping a Digit: lc/2566.md + - 2567. Minimum Score by Changing Two Elements: lc/2567.md + - 2568. Minimum Impossible OR: lc/2568.md + - 2569. Handling Sum Queries After Update: lc/2569.md + - 2570. Merge Two 2D Arrays by Summing Values: lc/2570.md + - 2571. Minimum Operations to Reduce an Integer to 0: lc/2571.md + - 2572. Count the Number of Square-Free Subsets: lc/2572.md + - 2573. Find the String with: lc/2573.md + - 2574. Left and Right Sum Differences: lc/2574.md + - 2575. Find the Divisibility Array of a String: lc/2575.md + - 2576. Find the Maximum Number of Marked Indices: lc/2576.md + - 2577. Minimum Time to Visit a Cell In a Grid: lc/2577.md + - 2578. Split With Minimum Sum: lc/2578.md + - 2579. Count Total Number of Colored Cells: lc/2579.md + - 2580. Count Ways to Group Overlapping Ranges: lc/2580.md + - 2581. Count Number of Possible Root Nodes: lc/2581.md + - 2582. Pass the Pillow: lc/2582.md + - 2583. Kth Largest Sum in a Binary Tree: lc/2583.md + - 2584. Split the Array to Make Coprime Products: lc/2584.md + - 2585. Number of Ways to Earn Points: lc/2585.md + - 2586. Count the Number of Vowel Strings in Range: lc/2586.md + - 2587. Rearrange Array to Maximize Prefix Score: lc/2587.md + - 2588. Count the Number of Beautiful Subarrays: lc/2588.md + - 2589. Minimum Time to Complete All Tasks: lc/2589.md + - 2590. Design a Todo List: lc/2590.md + - 2591. Distribute Money to Maximum Children: lc/2591.md + - 2592. Maximize Greatness of an Array: lc/2592.md + - 2593. Find Score of an Array After Marking All Elements: lc/2593.md + - 2594. Minimum Time to Repair Cars: lc/2594.md + - 2595. Number of Even and Odd Bits: lc/2595.md + - 2596. Check Knight Tour Configuration: lc/2596.md + - 2597. The Number of Beautiful Subsets: lc/2597.md + - 2598. Smallest Missing Non-negative Integer After Operations: lc/2598.md + - 2599. Make the Prefix Sum Non-negative: lc/2599.md + - 2600. K Items With the Maximum Sum: lc/2600.md + - 2601. Prime Subtraction Operation: lc/2601.md + - 2602. Minimum Operations to Make All Array Elements Equal: lc/2602.md + - 2603. Collect Coins in a Tree: lc/2603.md + - 2604. Minimum Time to Eat All Grains: lc/2604.md + - 2605. Form Smallest Number From Two Digit Arrays: lc/2605.md + - 2606. Find the Substring With Maximum Cost: lc/2606.md + - 2607. Make K-Subarray Sums Equal: lc/2607.md + - 2608. Shortest Cycle in a Graph: lc/2608.md + - 2609. Find the Longest Balanced Substring of a Binary String: lc/2609.md + - 2610. Convert an Array Into a 2D Array With Conditions: lc/2610.md + - 2611. Mice and Cheese: lc/2611.md + - 2612. Minimum Reverse Operations: lc/2612.md + - 2613. Beautiful Pairs: lc/2613.md + - 2614. Prime In Diagonal: lc/2614.md + - 2615. Sum of Distances: lc/2615.md + - 2616. Minimize the Maximum Difference of Pairs: lc/2616.md + - 2617. Minimum Number of Visited Cells in a Grid: lc/2617.md + - 2618. Check if Object Instance of Class: lc/2618.md + - 2619. Array Prototype Last: lc/2619.md + - 2620. Counter: lc/2620.md + - 2621. Sleep: lc/2621.md + - 2622. Cache With Time Limit: lc/2622.md + - 2623. Memoize: lc/2623.md + - 2624. Snail Traversal: lc/2624.md + - 2625. Flatten Deeply Nested Array: lc/2625.md + - 2626. Array Reduce Transformation: lc/2626.md + - 2627. Debounce: lc/2627.md + - 2628. JSON Deep Equal: lc/2628.md + - 2629. Function Composition: lc/2629.md + - 2630. Memoize II: lc/2630.md + - 2631. Group By: lc/2631.md + - 2632. Curry: lc/2632.md + - 2633. Convert Object to JSON String: lc/2633.md + - 2634. Filter Elements from Array: lc/2634.md + - 2635. Apply Transform Over Each Element in Array: lc/2635.md + - 2636. Promise Pool: lc/2636.md + - 2637. Promise Time Limit: lc/2637.md + - 2638. Count the Number of K-Free Subsets: lc/2638.md + - 2639. Find the Width of Columns of a Grid: lc/2639.md + - 2640. Find the Score of All Prefixes of an Array: lc/2640.md + - 2641. Cousins in Binary Tree II: lc/2641.md + - 2642. Design Graph With Shortest Path Calculator: lc/2642.md + - 2643. Row With Maximum Ones: lc/2643.md + - 2644. Find the Maximum Divisibility Score: lc/2644.md + - 2645. Minimum Additions to Make Valid String: lc/2645.md + - 2646. Minimize the Total Price of the Trips: lc/2646.md + - 2647. Color the Triangle Red: lc/2647.md + - 2648. Generate Fibonacci Sequence: lc/2648.md + - 2649. Nested Array Generator: lc/2649.md + - 2650. Design Cancellable Function: lc/2650.md + - 2651. Calculate Delayed Arrival Time: lc/2651.md + - 2652. Sum Multiples: lc/2652.md + - 2653. Sliding Subarray Beauty: lc/2653.md + - 2654. Minimum Number of Operations to Make All Array Elements Equal to 1: lc/2654.md + - 2655. Find Maximal Uncovered Ranges: lc/2655.md + - 2656. Maximum Sum With Exactly K Elements: lc/2656.md + - 2657. Find the Prefix Common Array of Two Arrays: lc/2657.md + - 2658. Maximum Number of Fish in a Grid: lc/2658.md + - 2659. Make Array Empty: lc/2659.md + - 2660. Determine the Winner of a Bowling Game: lc/2660.md + - 2661. First Completely Painted Row or Column: lc/2661.md + - 2662. Minimum Cost of a Path With Special Roads: lc/2662.md + - 2663. Lexicographically Smallest Beautiful String: lc/2663.md + - 2664. The Knight’s Tour: lc/2664.md + - 2665. Counter II: lc/2665.md + - 2666. Allow One Function Call: lc/2666.md + - 2667. Create Hello World Function: lc/2667.md + - 2668. Find Latest Salaries: lc/2668.md + - 2669. Count Artist Occurrences On Spotify Ranking List: lc/2669.md + - 2670. Find the Distinct Difference Array: lc/2670.md + - 2671. Frequency Tracker: lc/2671.md + - 2672. Number of Adjacent Elements With the Same Color: lc/2672.md + - 2673. Make Costs of Paths Equal in a Binary Tree: lc/2673.md + - 2674. Split a Circular Linked List: lc/2674.md + - 2675. Array of Objects to Matrix: lc/2675.md + - 2676. Throttle: lc/2676.md + - 2677. Chunk Array: lc/2677.md + - 2678. Number of Senior Citizens: lc/2678.md + - 2679. Sum in a Matrix: lc/2679.md + - 2680. Maximum OR: lc/2680.md + - 2681. Power of Heroes: lc/2681.md + - 2682. Find the Losers of the Circular Game: lc/2682.md + - 2683. Neighboring Bitwise XOR: lc/2683.md + - 2684. Maximum Number of Moves in a Grid: lc/2684.md + - 2685. Count the Number of Complete Components: lc/2685.md + - 2686. Immediate Food Delivery III: lc/2686.md + - 2687. Bikes Last Time Used: lc/2687.md + - 2688. Find Active Users: lc/2688.md + - 2689. Extract Kth Character From The Rope Tree: lc/2689.md + - 2690. Infinite Method Object: lc/2690.md + - 2691. Immutability Helper: lc/2691.md + - 2692. Make Object Immutable: lc/2692.md + - 2693. Call Function with Custom Context: lc/2693.md + - 2694. Event Emitter: lc/2694.md + - 2695. Array Wrapper: lc/2695.md + - 2696. Minimum String Length After Removing Substrings: lc/2696.md + - 2697. Lexicographically Smallest Palindrome: lc/2697.md + - 2698. Find the Punishment Number of an Integer: lc/2698.md + - 2699. Modify Graph Edge Weights: lc/2699.md + - 2700. Differences Between Two Objects: lc/2700.md + - 2701. Consecutive Transactions with Increasing Amounts: lc/2701.md + - 2702. Minimum Operations to Make Numbers Non-positive: lc/2702.md + - 2703. Return Length of Arguments Passed: lc/2703.md + - 2704. To Be Or Not To Be: lc/2704.md + - 2705. Compact Object: lc/2705.md + - 2706. Buy Two Chocolates: lc/2706.md + - 2707. Extra Characters in a String: lc/2707.md + - 2708. Maximum Strength of a Group: lc/2708.md + - 2709. Greatest Common Divisor Traversal: lc/2709.md + - 2710. Remove Trailing Zeros From a String: lc/2710.md + - 2711. Difference of Number of Distinct Values on Diagonals: lc/2711.md + - 2712. Minimum Cost to Make All Characters Equal: lc/2712.md + - 2713. Maximum Strictly Increasing Cells in a Matrix: lc/2713.md + - 2714. Find Shortest Path with K Hops: lc/2714.md + - 2715. Timeout Cancellation: lc/2715.md + - 2716. Minimize String Length: lc/2716.md + - 2717. Semi-Ordered Permutation: lc/2717.md + - 2718. Sum of Matrix After Queries: lc/2718.md + - 2719. Count of Integers: lc/2719.md + - 2720. Popularity Percentage: lc/2720.md + - 2721. Execute Asynchronous Functions in Parallel: lc/2721.md + - 2722. Join Two Arrays by ID: lc/2722.md + - 2723. Add Two Promises: lc/2723.md + - 2724. Sort By: lc/2724.md + - 2725. Interval Cancellation: lc/2725.md + - 2726. Calculator with Method Chaining: lc/2726.md + - 2727. Is Object Empty: lc/2727.md + - 2728. Count Houses in a Circular Street: lc/2728.md + - 2729. Check if The Number is Fascinating: lc/2729.md + - 2730. Find the Longest Semi-Repetitive Substring: lc/2730.md + - 2731. Movement of Robots: lc/2731.md + - 2732. Find a Good Subset of the Matrix: lc/2732.md + - 2733. Neither Minimum nor Maximum: lc/2733.md + - 2734. Lexicographically Smallest String After Substring Operation: lc/2734.md + - 2735. Collecting Chocolates: lc/2735.md + - 2736. Maximum Sum Queries: lc/2736.md + - 2737. Find the Closest Marked Node: lc/2737.md + - 2738. Count Occurrences in Text: lc/2738.md + - 2739. Total Distance Traveled: lc/2739.md + - 2740. Find the Value of the Partition: lc/2740.md + - 2741. Special Permutations: lc/2741.md + - 2742. Painting the Walls: lc/2742.md + - 2743. Count Substrings Without Repeating Character: lc/2743.md + - 2744. Find Maximum Number of String Pairs: lc/2744.md + - 2745. Construct the Longest New String: lc/2745.md + - 2746. Decremental String Concatenation: lc/2746.md + - 2747. Count Zero Request Servers: lc/2747.md + - 2748. Number of Beautiful Pairs: lc/2748.md + - 2749. Minimum Operations to Make the Integer Zero: lc/2749.md + - 2750. Ways to Split Array Into Good Subarrays: lc/2750.md + - 2751. Robot Collisions: lc/2751.md + - 2752. Customers with Maximum Number of Transactions on Consecutive Days: lc/2752.md + - 2753. Count Houses in a Circular Street II: lc/2753.md + - 2754. Bind Function to Context: lc/2754.md + - 2755. Deep Merge of Two Objects: lc/2755.md + - 2756. Query Batching: lc/2756.md + - 2757. Generate Circular Array Values: lc/2757.md + - 2758. Next Day: lc/2758.md + - 2759. Convert JSON String to Object: lc/2759.md + - 2760. Longest Even Odd Subarray With Threshold: lc/2760.md + - 2761. Prime Pairs With Target Sum: lc/2761.md + - 2762. Continuous Subarrays: lc/2762.md + - 2763. Sum of Imbalance Numbers of All Subarrays: lc/2763.md + - 2764. Is Array a Preorder of Some ‌Binary Tree: lc/2764.md + - 2765. Longest Alternating Subarray: lc/2765.md + - 2766. Relocate Marbles: lc/2766.md + - 2767. Partition String Into Minimum Beautiful Substrings: lc/2767.md + - 2768. Number of Black Blocks: lc/2768.md + - 2769. Find the Maximum Achievable Number: lc/2769.md + - 2770. Maximum Number of Jumps to Reach the Last Index: lc/2770.md + - 2771. Longest Non-decreasing Subarray From Two Arrays: lc/2771.md + - 2772. Apply Operations to Make All Array Elements Equal to Zero: lc/2772.md + - 2773. Height of Special Binary Tree: lc/2773.md + - 2774. Array Upper Bound: lc/2774.md + - 2775. Undefined to Null: lc/2775.md + - 2776. Convert Callback Based Function to Promise Based Function: lc/2776.md + - 2777. Date Range Generator: lc/2777.md + - 2778. Sum of Squares of Special Elements: lc/2778.md + - 2779. Maximum Beauty of an Array After Applying Operation: lc/2779.md + - 2780. Minimum Index of a Valid Split: lc/2780.md + - 2781. Length of the Longest Valid Substring: lc/2781.md + - 2782. Number of Unique Categories: lc/2782.md + - 2783. Flight Occupancy and Waitlist Analysis: lc/2783.md + - 2784. Check if Array is Good: lc/2784.md + - 2785. Sort Vowels in a String: lc/2785.md + - 2786. Visit Array Positions to Maximize Score: lc/2786.md + - 2787. Ways to Express an Integer as Sum of Powers: lc/2787.md + - 2788. Split Strings by Separator: lc/2788.md + - 2789. Largest Element in an Array after Merge Operations: lc/2789.md + - 2790. Maximum Number of Groups With Increasing Length: lc/2790.md + - 2791. Count Paths That Can Form a Palindrome in a Tree: lc/2791.md + - 2792. Count Nodes That Are Great Enough: lc/2792.md + - 2793. Status of Flight Tickets: lc/2793.md + - 2794. Create Object from Two Arrays: lc/2794.md + - 2795. Parallel Execution of Promises for Individual Results Retrieval: lc/2795.md + - 2796. Repeat String: lc/2796.md + - 2797. Partial Function with Placeholders: lc/2797.md + - 2798. Number of Employees Who Met the Target: lc/2798.md + - 2799. Count Complete Subarrays in an Array: lc/2799.md + - 2800. Shortest String That Contains Three Strings: lc/2800.md + - 2801. Count Stepping Numbers in Range: lc/2801.md + - 2802. Find The K-th Lucky Number: lc/2802.md + - 2803. Factorial Generator: lc/2803.md + - 2804. Array Prototype ForEach: lc/2804.md + - 2805. Custom Interval: lc/2805.md + - 2806. Account Balance After Rounded Purchase: lc/2806.md + - 2807. Insert Greatest Common Divisors in Linked List: lc/2807.md + - 2808. Minimum Seconds to Equalize a Circular Array: lc/2808.md + - 2809. Minimum Time to Make Array Sum At Most x: lc/2809.md + - 2810. Faulty Keyboard: lc/2810.md + - 2811. Check if it is Possible to Split Array: lc/2811.md + - 2812. Find the Safest Path in a Grid: lc/2812.md + - 2813. Maximum Elegance of a K-Length Subsequence: lc/2813.md + - 2814. Minimum Time Takes to Reach Destination Without Drowning: lc/2814.md + - 2815. Max Pair Sum in an Array: lc/2815.md + - 2816. Double a Number Represented as a Linked List: lc/2816.md + - 2817. Minimum Absolute Difference Between Elements With Constraint: lc/2817.md + - 2818. Apply Operations to Maximize Score: lc/2818.md + - 2819. Minimum Relative Loss After Buying Chocolates: lc/2819.md + - 2820. Election Results: lc/2820.md + - 2821. Delay the Resolution of Each Promise: lc/2821.md + - 2822. Inversion of Object: lc/2822.md + - 2823. Deep Object Filter: lc/2823.md + - 2824. Count Pairs Whose Sum is Less than Target: lc/2824.md + - 2825. Make String a Subsequence Using Cyclic Increments: lc/2825.md + - 2826. Sorting Three Groups: lc/2826.md + - 2827. Number of Beautiful Integers in the Range: lc/2827.md + - 2828. Check if a String Is an Acronym of Words: lc/2828.md + - 2829. Determine the Minimum Sum of a k-avoiding Array: lc/2829.md + - 2830. Maximize the Profit as the Salesman: lc/2830.md + - 2831. Find the Longest Equal Subarray: lc/2831.md + - 2832. Maximal Range That Each Element Is Maximum in It: lc/2832.md + - 2833. Furthest Point From Origin: lc/2833.md + - 2834. Find the Minimum Possible Sum of a Beautiful Array: lc/2834.md + - 2835. Minimum Operations to Form Subsequence With Target Sum: lc/2835.md + - 2836. Maximize Value of Function in a Ball Passing Game: lc/2836.md + - 2837. Total Traveled Distance: lc/2837.md + - 2838. Maximum Coins Heroes Can Collect: lc/2838.md + - 2839. Check if Strings Can be Made Equal With Operations I: lc/2839.md + - 2840. Check if Strings Can be Made Equal With Operations II: lc/2840.md + - 2841. Maximum Sum of Almost Unique Subarray: lc/2841.md + - 2842. Count K-Subsequences of a String With Maximum Beauty: lc/2842.md + - 2843. Count Symmetric Integers: lc/2843.md + - 2844. Minimum Operations to Make a Special Number: lc/2844.md + - 2845. Count of Interesting Subarrays: lc/2845.md + - 2846. Minimum Edge Weight Equilibrium Queries in a Tree: lc/2846.md + - 2847. Smallest Number With Given Digit Product: lc/2847.md + - 2848. Points That Intersect With Cars: lc/2848.md + - 2849. Determine if a Cell Is Reachable at a Given Time: lc/2849.md + - 2850. Minimum Moves to Spread Stones Over Grid: lc/2850.md + - 2851. String Transformation: lc/2851.md + - 2852. Sum of Remoteness of All Cells: lc/2852.md + - 2853. Highest Salaries Difference: lc/2853.md + - 2854. Rolling Average Steps: lc/2854.md + - 2855. Minimum Right Shifts to Sort the Array: lc/2855.md + - 2856. Minimum Array Length After Pair Removals: lc/2856.md + - 2857. Count Pairs of Points With Distance k: lc/2857.md + - 2858. Minimum Edge Reversals So Every Node Is Reachable: lc/2858.md + - 2859. Sum of Values at Indices With K Set Bits: lc/2859.md + - 2860. Happy Students: lc/2860.md + - 2861. Maximum Number of Alloys: lc/2861.md + - 2862. Maximum Element-Sum of a Complete Subset of Indices: lc/2862.md + - 2863. Maximum Length of Semi-Decreasing Subarrays: lc/2863.md + - 2864. Maximum Odd Binary Number: lc/2864.md + - 2865. Beautiful Towers I: lc/2865.md + - 2866. Beautiful Towers II: lc/2866.md + - 2867. Count Valid Paths in a Tree: lc/2867.md + - 2868. The Wording Game: lc/2868.md + - 2869. Minimum Operations to Collect Elements: lc/2869.md + - 2870. Minimum Number of Operations to Make Array Empty: lc/2870.md + - 2871. Split Array Into Maximum Number of Subarrays: lc/2871.md + - 2872. Maximum Number of K-Divisible Components: lc/2872.md + - 2873. Maximum Value of an Ordered Triplet I: lc/2873.md + - 2874. Maximum Value of an Ordered Triplet II: lc/2874.md + - 2875. Minimum Size Subarray in Infinite Array: lc/2875.md + - 2876. Count Visited Nodes in a Directed Graph: lc/2876.md + - 2877. Create a DataFrame from List: lc/2877.md + - 2878. Get the Size of a DataFrame: lc/2878.md + - 2879. Display the First Three Rows: lc/2879.md + - 2880. Select Data: lc/2880.md + - 2881. Create a New Column: lc/2881.md + - 2882. Drop Duplicate Rows: lc/2882.md + - 2883. Drop Missing Data: lc/2883.md + - 2884. Modify Columns: lc/2884.md + - 2885. Rename Columns: lc/2885.md + - 2886. Change Data Type: lc/2886.md + - 2887. Fill Missing Data: lc/2887.md + - 2888. Reshape Data Concatenate: lc/2888.md + - 2889. Reshape Data Pivot: lc/2889.md + - 2890. Reshape Data Melt: lc/2890.md + - 2891. Method Chaining: lc/2891.md + - 2892. Minimizing Array After Replacing Pairs With Their Product: lc/2892.md + - 2893. Calculate Orders Within Each Interval: lc/2893.md + - 2894. Divisible and Non-divisible Sums Difference: lc/2894.md + - 2895. Minimum Processing Time: lc/2895.md + - 2896. Apply Operations to Make Two Strings Equal: lc/2896.md + - 2897. Apply Operations on Array to Maximize Sum of Squares: lc/2897.md + - 2898. Maximum Linear Stock Score: lc/2898.md + - 2899. Last Visited Integers: lc/2899.md + - 2900. Longest Unequal Adjacent Groups Subsequence I: lc/2900.md + - 2901. Longest Unequal Adjacent Groups Subsequence II: lc/2901.md + - 2902. Count of Sub-Multisets With Bounded Sum: lc/2902.md + - 2903. Find Indices With Index and Value Difference I: lc/2903.md + - 2904. Shortest and Lexicographically Smallest Beautiful String: lc/2904.md + - 2905. Find Indices With Index and Value Difference II: lc/2905.md + - 2906. Construct Product Matrix: lc/2906.md + - 2907. Maximum Profitable Triplets With Increasing Prices I: lc/2907.md + - 2908. Minimum Sum of Mountain Triplets I: lc/2908.md + - 2909. Minimum Sum of Mountain Triplets II: lc/2909.md + - 2910. Minimum Number of Groups to Create a Valid Assignment: lc/2910.md + - 2911. Minimum Changes to Make K Semi-palindromes: lc/2911.md + - 2912. Number of Ways to Reach Destination in the Grid: lc/2912.md + - 2913. Subarrays Distinct Element Sum of Squares I: lc/2913.md + - 2914. Minimum Number of Changes to Make Binary String Beautiful: lc/2914.md + - 2915. Length of the Longest Subsequence That Sums to Target: lc/2915.md + - 2916. Subarrays Distinct Element Sum of Squares II: lc/2916.md + - 2917. Find the K-or of an Array: lc/2917.md + - 2918. Minimum Equal Sum of Two Arrays After Replacing Zeros: lc/2918.md + - 2919. Minimum Increment Operations to Make Array Beautiful: lc/2919.md + - 2920. Maximum Points After Collecting Coins From All Nodes: lc/2920.md + - 2921. Maximum Profitable Triplets With Increasing Prices II: lc/2921.md + - 2922. Market Analysis III: lc/2922.md + - 2923. Find Champion I: lc/2923.md + - 2924. Find Champion II: lc/2924.md + - 2925. Maximum Score After Applying Operations on a Tree: lc/2925.md + - 2926. Maximum Balanced Subsequence Sum: lc/2926.md + - 2927. Distribute Candies Among Children III: lc/2927.md + - 2928. Distribute Candies Among Children I: lc/2928.md + - 2929. Distribute Candies Among Children II: lc/2929.md + - 2930. Number of Strings Which Can Be Rearranged to Contain Substring: lc/2930.md + - 2931. Maximum Spending After Buying Items: lc/2931.md + - 2932. Maximum Strong Pair XOR I: lc/2932.md + - 2933. High-Access Employees: lc/2933.md + - 2934. Minimum Operations to Maximize Last Elements in Arrays: lc/2934.md + - 2935. Maximum Strong Pair XOR II: lc/2935.md + - 2936. Number of Equal Numbers Blocks: lc/2936.md + - 2937. Make Three Strings Equal: lc/2937.md + - 2938. Separate Black and White Balls: lc/2938.md + - 2939. Maximum Xor Product: lc/2939.md + - 2940. Find Building Where Alice and Bob Can Meet: lc/2940.md + - 2941. Maximum GCD-Sum of a Subarray: lc/2941.md + - 2942. Find Words Containing Character: lc/2942.md + - 2943. Maximize Area of Square Hole in Grid: lc/2943.md + - 2944. Minimum Number of Coins for Fruits: lc/2944.md + - 2945. Find Maximum Non-decreasing Array Length: lc/2945.md + - 2946. Matrix Similarity After Cyclic Shifts: lc/2946.md + - 2947. Count Beautiful Substrings I: lc/2947.md + - 2948. Make Lexicographically Smallest Array by Swapping Elements: lc/2948.md + - 2949. Count Beautiful Substrings II: lc/2949.md + - 2950. Number of Divisible Substrings: lc/2950.md + - 2951. Find the Peaks: lc/2951.md + - 2952. Minimum Number of Coins to be Added: lc/2952.md + - 2953. Count Complete Substrings: lc/2953.md + - 2954. Count the Number of Infection Sequences: lc/2954.md + - 2955. Number of Same-End Substrings: lc/2955.md + - 2956. Find Common Elements Between Two Arrays: lc/2956.md + - 2957. Remove Adjacent Almost-Equal Characters: lc/2957.md + - 2958. Length of Longest Subarray With at Most K Frequency: lc/2958.md + - 2959. Number of Possible Sets of Closing Branches: lc/2959.md + - 2960. Count Tested Devices After Test Operations: lc/2960.md + - 2961. Double Modular Exponentiation: lc/2961.md + - 2962. Count Subarrays Where Max Element Appears at Least K Times: lc/2962.md + - 2963. Count the Number of Good Partitions: lc/2963.md + - 2964. Number of Divisible Triplet Sums: lc/2964.md + - 2965. Find Missing and Repeated Values: lc/2965.md + - 2966. Divide Array Into Arrays With Max Difference: lc/2966.md + - 2967. Minimum Cost to Make Array Equalindromic: lc/2967.md + - 2968. Apply Operations to Maximize Frequency Score: lc/2968.md + - 2969. Minimum Number of Coins for Fruits II: lc/2969.md + - 2970. Count the Number of Incremovable Subarrays I: lc/2970.md + - 2971. Find Polygon With the Largest Perimeter: lc/2971.md + - 2972. Count the Number of Incremovable Subarrays II: lc/2972.md + - 2973. Find Number of Coins to Place in Tree Nodes: lc/2973.md + - 2974. Minimum Number Game: lc/2974.md + - 2975. Maximum Square Area by Removing Fences From a Field: lc/2975.md + - 2976. Minimum Cost to Convert String I: lc/2976.md + - 2977. Minimum Cost to Convert String II: lc/2977.md + - 2978. Symmetric Coordinates: lc/2978.md + - 2979. Most Expensive Item That Can Not Be Bought: lc/2979.md + - 2980. Check if Bitwise OR Has Trailing Zeros: lc/2980.md + - 2981. Find Longest Special Substring That Occurs Thrice I: lc/2981.md + - 2982. Find Longest Special Substring That Occurs Thrice II: lc/2982.md + - 2983. Palindrome Rearrangement Queries: lc/2983.md + - 2984. Find Peak Calling Hours for Each City: lc/2984.md + - 2985. Calculate Compressed Mean: lc/2985.md + - 2986. Find Third Transaction: lc/2986.md + - 2987. Find Expensive Cities: lc/2987.md + - 2988. Manager of the Largest Department: lc/2988.md + - 2989. Class Performance: lc/2989.md + - 2990. Loan Types: lc/2990.md + - 2991. Top Three Wineries: lc/2991.md + - 2992. Number of Self-Divisible Permutations: lc/2992.md + - 2993. Friday Purchases I: lc/2993.md + - 2994. Friday Purchases II: lc/2994.md + - 2995. Viewers Turned Streamers: lc/2995.md + - 2996. Smallest Missing Integer Greater Than Sequential Prefix Sum: lc/2996.md + - 2997. Minimum Number of Operations to Make Array XOR Equal to K: lc/2997.md + - 2998. Minimum Number of Operations to Make X and Y Equal: lc/2998.md + - 2999. Count the Number of Powerful Integers: lc/2999.md + - 3000. Maximum Area of Longest Diagonal Rectangle: lc/3000.md + - 3001. Minimum Moves to Capture The Queen: lc/3001.md + - 3002. Maximum Size of a Set After Removals: lc/3002.md + - 3003. Maximize the Number of Partitions After Operations: lc/3003.md + - 3004. Maximum Subtree of the Same Color: lc/3004.md + - 3005. Count Elements With Maximum Frequency: lc/3005.md + - 3006. Find Beautiful Indices in the Given Array I: lc/3006.md + - 3007. Maximum Number That Sum of the Prices Is Less Than or Equal to K: lc/3007.md + - 3008. Find Beautiful Indices in the Given Array II: lc/3008.md + - Cracking the Coding Interview, 6th Edition: + - 1.1. Is Unique: lcci/1.1.md + - 1.2. Check Permutation: lcci/1.2.md + - 1.3. String to URL: lcci/1.3.md + - 1.4. Palindrome Permutation: lcci/1.4.md + - 1.5. One Away: lcci/1.5.md + - 1.6. Compress String: lcci/1.6.md + - 1.7. Rotate Matrix: lcci/1.7.md + - 1.8. Zero Matrix: lcci/1.8.md + - 1.9. String Rotation: lcci/1.9.md + - 2.1. Remove Duplicate Node: lcci/2.1.md + - 2.2. Kth Node From End of List: lcci/2.2.md + - 2.3. Delete Middle Node: lcci/2.3.md + - 2.4. Partition List: lcci/2.4.md + - 2.5. Sum Lists: lcci/2.5.md + - 2.6. Palindrome Linked List: lcci/2.6.md + - 2.7. Intersection of Two Linked Lists: lcci/2.7.md + - 2.8. Linked List Cycle: lcci/2.8.md + - 3.1. Three in One: lcci/3.1.md + - 3.2. Min Stack: lcci/3.2.md + - 3.3. Stack of Plates: lcci/3.3.md + - 3.4. Implement Queue using Stacks: lcci/3.4.md + - 3.5. Sort of Stacks: lcci/3.5.md + - 3.6. Animal Shelter: lcci/3.6.md + - 4.1. Route Between Nodes: lcci/4.1.md + - 4.2. Minimum Height Tree: lcci/4.2.md + - 4.3. List of Depth: lcci/4.3.md + - 4.4. Check Balance: lcci/4.4.md + - 4.5. Legal Binary Search Tree: lcci/4.5.md + - 4.6. Successor: lcci/4.6.md + - 4.8. First Common Ancestor: lcci/4.8.md + - 4.9. BST Sequences: lcci/4.9.md + - 4.10. Check SubTree: lcci/4.10.md + - 4.12. Paths with Sum: lcci/4.12.md + - 5.1. Insert Into Bits: lcci/5.1.md + - 5.2. Binary Number to String: lcci/5.2.md + - 5.3. Reverse Bits: lcci/5.3.md + - 5.4. Closed Number: lcci/5.4.md + - 5.6. Convert Integer: lcci/5.6.md + - 5.7. Exchange: lcci/5.7.md + - 5.8. Draw Line: lcci/5.8.md + - 8.1. Three Steps Problem: lcci/8.1.md + - 8.2. Robot in a Grid: lcci/8.2.md + - 8.3. Magic Index: lcci/8.3.md + - 8.4. Power Set: lcci/8.4.md + - 8.5. Recursive Mulitply: lcci/8.5.md + - 8.6. Hanota: lcci/8.6.md + - 8.7. Permutation I: lcci/8.7.md + - 8.8. Permutation II: lcci/8.8.md + - 8.9. Bracket: lcci/8.9.md + - 8.10. Color Fill: lcci/8.10.md + - 8.11. Coin: lcci/8.11.md + - 8.12. Eight Queens: lcci/8.12.md + - 8.13. Pile Box: lcci/8.13.md + - 8.14. Boolean Evaluation: lcci/8.14.md + - 10.1. Sorted Merge: lcci/10.1.md + - 10.2. Group Anagrams: lcci/10.2.md + - 10.3. Search Rotate Array: lcci/10.3.md + - 10.5. Sparse Array Search: lcci/10.5.md + - 10.9. Sorted Matrix Search: lcci/10.9.md + - 10.10. Rank from Stream: lcci/10.10.md + - 10.11. Peaks and Valleys: lcci/10.11.md + - 16.1. Swap Numbers: lcci/16.1.md + - 16.2. Words Frequency: lcci/16.2.md + - 16.3. Intersection: lcci/16.3.md + - 16.4. Tic-Tac-Toe: lcci/16.4.md + - 16.5. Factorial Zeros: lcci/16.5.md + - 16.6. Smallest Difference: lcci/16.6.md + - 16.7. Maximum: lcci/16.7.md + - 16.8. English Int: lcci/16.8.md + - 16.9. Operations: lcci/16.9.md + - 16.10. Living People: lcci/16.10.md + - 16.11. Diving Board: lcci/16.11.md + - 16.13. Bisect Squares: lcci/16.13.md + - 16.14. Best Line: lcci/16.14.md + - 16.15. Master Mind: lcci/16.15.md + - 16.16. Sub Sort: lcci/16.16.md + - 16.17. Contiguous Sequence: lcci/16.17.md + - 16.18. Pattern Matching: lcci/16.18.md + - 16.19. Pond Sizes: lcci/16.19.md + - 16.20. T9: lcci/16.20.md + - 16.21. Sum Swap: lcci/16.21.md + - 16.22. Langtons Ant: lcci/16.22.md + - 16.24. Pairs With Sum: lcci/16.24.md + - 16.25. LRU Cache: lcci/16.25.md + - 16.26. Calculator: lcci/16.26.md + - 17.1. Add Without Plus: lcci/17.1.md + - 17.4. Missing Number: lcci/17.4.md + - 17.5. Find Longest Subarray: lcci/17.5.md + - 17.6. Number Of 2s In Range: lcci/17.6.md + - 17.7. Baby Names: lcci/17.7.md + - 17.8. Circus Tower: lcci/17.8.md + - 17.9. Get Kth Magic Number: lcci/17.9.md + - 17.10. Find Majority Element: lcci/17.10.md + - 17.11. Find Closest: lcci/17.11.md + - 17.12. BiNode: lcci/17.12.md + - 17.13. Re-Space: lcci/17.13.md + - 17.14. Smallest K: lcci/17.14.md + - 17.15. Longest Word: lcci/17.15.md + - 17.16. The Masseuse: lcci/17.16.md + - 17.17. Multi Search: lcci/17.17.md + - 17.18. Shortest Supersequence: lcci/17.18.md + - 17.19. Missing Two: lcci/17.19.md + - 17.20. Continuous Median: lcci/17.20.md + - 17.21. Volume of Histogram: lcci/17.21.md + - 17.22. Word Transformer: lcci/17.22.md + - 17.23. Max Black Square: lcci/17.23.md + - 17.24. Max Submatrix: lcci/17.24.md + - 17.25. Word Rectangle: lcci/17.25.md + - 17.26. Sparse Similarity: lcci/17.26.md diff --git a/mkdocs.yml b/mkdocs.yml new file mode 100644 index 0000000000000..114b38637ddfe --- /dev/null +++ b/mkdocs.yml @@ -0,0 +1,3411 @@ +site_name: LeetCode Wiki +site_url: https://doocs.github.io/leetcode +site_description: 多种编程语言实现 LeetCode、《剑指 Offer（第 2 版）》、《程序员面试金典（第 6 版）》题解 +site_author: yanglbme +docs_dir: docs +repo_name: doocs/leetcode +repo_url: https://github.com/doocs/leetcode +copyright: Copyright © 2024 Doocs + +theme: + name: material + features: + - announce.dismiss + - content.code.annotate + - content.code.copy + # - content.code.select + # - content.tabs.link + - content.tooltips + # - header.autohide + # - navigation.expand + - navigation.footer + - navigation.indexes + # - navigation.instant + # - navigation.instant.prefetch + # - navigation.instant.progress + # - navigation.prune + - navigation.sections + - navigation.tabs + # - navigation.tabs.sticky + - navigation.top + - navigation.tracking + - search.highlight + - search.share + - search.suggest + - toc.follow + # - toc.integrate + icon: + repo: fontawesome/brands/github + language: zh + palette: + - media: "(prefers-color-scheme)" + toggle: + icon: material/link + name: Switch to light mode + - media: "(prefers-color-scheme: light)" + scheme: default + primary: indigo + accent: indigo + toggle: + icon: material/toggle-switch + name: Switch to dark mode + - media: "(prefers-color-scheme: dark)" + scheme: slate + primary: black + accent: indigo + toggle: + icon: material/toggle-switch-off + name: Switch to system preference + +plugins: + - search: + separator: '[\s\-,:!=\[\]()"/]+|(?!\b)(?=[A-Z][a-z])|\.(?!\d)|&[lg]t;' + +markdown_extensions: + - pymdownx.superfences + - pymdownx.tabbed: + alternate_style: true + +extra_javascript: + - javascripts/katex.js + - https://cdnjs.cloudflare.com/ajax/libs/KaTeX/0.16.7/katex.min.js + - https://cdnjs.cloudflare.com/ajax/libs/KaTeX/0.16.7/contrib/auto-render.min.js + +extra_css: + - https://cdnjs.cloudflare.com/ajax/libs/KaTeX/0.16.7/katex.min.css + +extra: + social: + - icon: fontawesome/brands/github + link: https://github.com/yanglbme + - icon: fontawesome/solid/paper-plane + link: mailto:contact@yanglibin.info + - icon: fontawesome/solid/code + link: https://leetcode.cn/u/lcbin/ + alternate: + - name: English + link: /en/ + lang: en + - name: 中文 + link: / + lang: zh + + + + +nav: + - LeetCode: + - 1. 两数之和: lc/1.md + - 2. 两数相加: lc/2.md + - 3. 无重复字符的最长子串: lc/3.md + - 4. 寻找两个正序数组的中位数: lc/4.md + - 5. 最长回文子串: lc/5.md + - 6. Z 字形变换: lc/6.md + - 7. 整数反转: lc/7.md + - 8. 字符串转换整数 (atoi): lc/8.md + - 9. 回文数: lc/9.md + - 10. 正则表达式匹配: lc/10.md + - 11. 盛最多水的容器: lc/11.md + - 12. 整数转罗马数字: lc/12.md + - 13. 罗马数字转整数: lc/13.md + - 14. 最长公共前缀: lc/14.md + - 15. 三数之和: lc/15.md + - 16. 最接近的三数之和: lc/16.md + - 17. 电话号码的字母组合: lc/17.md + - 18. 四数之和: lc/18.md + - 19. 删除链表的倒数第 N 个结点: lc/19.md + - 20. 有效的括号: lc/20.md + - 21. 合并两个有序链表: lc/21.md + - 22. 括号生成: lc/22.md + - 23. 合并 K 个升序链表: lc/23.md + - 24. 两两交换链表中的节点: lc/24.md + - 25. K 个一组翻转链表: lc/25.md + - 26. 删除有序数组中的重复项: lc/26.md + - 27. 移除元素: lc/27.md + - 28. 找出字符串中第一个匹配项的下标: lc/28.md + - 29. 两数相除: lc/29.md + - 30. 串联所有单词的子串: lc/30.md + - 31. 下一个排列: lc/31.md + - 32. 最长有效括号: lc/32.md + - 33. 搜索旋转排序数组: lc/33.md + - 34. 在排序数组中查找元素的第一个和最后一个位置: lc/34.md + - 35. 搜索插入位置: lc/35.md + - 36. 有效的数独: lc/36.md + - 37. 解数独: lc/37.md + - 38. 外观数列: lc/38.md + - 39. 组合总和: lc/39.md + - 40. 组合总和 II: lc/40.md + - 41. 缺失的第一个正数: lc/41.md + - 42. 接雨水: lc/42.md + - 43. 字符串相乘: lc/43.md + - 44. 通配符匹配: lc/44.md + - 45. 跳跃游戏 II: lc/45.md + - 46. 全排列: lc/46.md + - 47. 全排列 II: lc/47.md + - 48. 旋转图像: lc/48.md + - 49. 字母异位词分组: lc/49.md + - 50. Pow(x, n): lc/50.md + - 51. N 皇后: lc/51.md + - 52. N 皇后 II: lc/52.md + - 53. 最大子数组和: lc/53.md + - 54. 螺旋矩阵: lc/54.md + - 55. 跳跃游戏: lc/55.md + - 56. 合并区间: lc/56.md + - 57. 插入区间: lc/57.md + - 58. 最后一个单词的长度: lc/58.md + - 59. 螺旋矩阵 II: lc/59.md + - 60. 排列序列: lc/60.md + - 61. 旋转链表: lc/61.md + - 62. 不同路径: lc/62.md + - 63. 不同路径 II: lc/63.md + - 64. 最小路径和: lc/64.md + - 65. 有效数字: lc/65.md + - 66. 加一: lc/66.md + - 67. 二进制求和: lc/67.md + - 68. 文本左右对齐: lc/68.md + - 69. x 的平方根: lc/69.md + - 70. 爬楼梯: lc/70.md + - 71. 简化路径: lc/71.md + - 72. 编辑距离: lc/72.md + - 73. 矩阵置零: lc/73.md + - 74. 搜索二维矩阵: lc/74.md + - 75. 颜色分类: lc/75.md + - 76. 最小覆盖子串: lc/76.md + - 77. 组合: lc/77.md + - 78. 子集: lc/78.md + - 79. 单词搜索: lc/79.md + - 80. 删除有序数组中的重复项 II: lc/80.md + - 81. 搜索旋转排序数组 II: lc/81.md + - 82. 删除排序链表中的重复元素 II: lc/82.md + - 83. 删除排序链表中的重复元素: lc/83.md + - 84. 柱状图中最大的矩形: lc/84.md + - 85. 最大矩形: lc/85.md + - 86. 分隔链表: lc/86.md + - 87. 扰乱字符串: lc/87.md + - 88. 合并两个有序数组: lc/88.md + - 89. 格雷编码: lc/89.md + - 90. 子集 II: lc/90.md + - 91. 解码方法: lc/91.md + - 92. 反转链表 II: lc/92.md + - 93. 复原 IP 地址: lc/93.md + - 94. 二叉树的中序遍历: lc/94.md + - 95. 不同的二叉搜索树 II: lc/95.md + - 96. 不同的二叉搜索树: lc/96.md + - 97. 交错字符串: lc/97.md + - 98. 验证二叉搜索树: lc/98.md + - 99. 恢复二叉搜索树: lc/99.md + - 100. 相同的树: lc/100.md + - 101. 对称二叉树: lc/101.md + - 102. 二叉树的层序遍历: lc/102.md + - 103. 二叉树的锯齿形层序遍历: lc/103.md + - 104. 二叉树的最大深度: lc/104.md + - 105. 从前序与中序遍历序列构造二叉树: lc/105.md + - 106. 从中序与后序遍历序列构造二叉树: lc/106.md + - 107. 二叉树的层序遍历 II: lc/107.md + - 108. 将有序数组转换为二叉搜索树: lc/108.md + - 109. 有序链表转换二叉搜索树: lc/109.md + - 110. 平衡二叉树: lc/110.md + - 111. 二叉树的最小深度: lc/111.md + - 112. 路径总和: lc/112.md + - 113. 路径总和 II: lc/113.md + - 114. 二叉树展开为链表: lc/114.md + - 115. 不同的子序列: lc/115.md + - 116. 填充每个节点的下一个右侧节点指针: lc/116.md + - 117. 填充每个节点的下一个右侧节点指针 II: lc/117.md + - 118. 杨辉三角: lc/118.md + - 119. 杨辉三角 II: lc/119.md + - 120. 三角形最小路径和: lc/120.md + - 121. 买卖股票的最佳时机: lc/121.md + - 122. 买卖股票的最佳时机 II: lc/122.md + - 123. 买卖股票的最佳时机 III: lc/123.md + - 124. 二叉树中的最大路径和: lc/124.md + - 125. 验证回文串: lc/125.md + - 126. 单词接龙 II: lc/126.md + - 127. 单词接龙: lc/127.md + - 128. 最长连续序列: lc/128.md + - 129. 求根节点到叶节点数字之和: lc/129.md + - 130. 被围绕的区域: lc/130.md + - 131. 分割回文串: lc/131.md + - 132. 分割回文串 II: lc/132.md + - 133. 克隆图: lc/133.md + - 134. 加油站: lc/134.md + - 135. 分发糖果: lc/135.md + - 136. 只出现一次的数字: lc/136.md + - 137. 只出现一次的数字 II: lc/137.md + - 138. 随机链表的复制: lc/138.md + - 139. 单词拆分: lc/139.md + - 140. 单词拆分 II: lc/140.md + - 141. 环形链表: lc/141.md + - 142. 环形链表 II: lc/142.md + - 143. 重排链表: lc/143.md + - 144. 二叉树的前序遍历: lc/144.md + - 145. 二叉树的后序遍历: lc/145.md + - 146. LRU 缓存: lc/146.md + - 147. 对链表进行插入排序: lc/147.md + - 148. 排序链表: lc/148.md + - 149. 直线上最多的点数: lc/149.md + - 150. 逆波兰表达式求值: lc/150.md + - 151. 反转字符串中的单词: lc/151.md + - 152. 乘积最大子数组: lc/152.md + - 153. 寻找旋转排序数组中的最小值: lc/153.md + - 154. 寻找旋转排序数组中的最小值 II: lc/154.md + - 155. 最小栈: lc/155.md + - 156. 上下翻转二叉树: lc/156.md + - 157. 用 Read4 读取 N 个字符: lc/157.md + - 158. 用 Read4 读取 N 个字符 II - 多次调用: lc/158.md + - 159. 至多包含两个不同字符的最长子串: lc/159.md + - 160. 相交链表: lc/160.md + - 161. 相隔为 1 的编辑距离: lc/161.md + - 162. 寻找峰值: lc/162.md + - 163. 缺失的区间: lc/163.md + - 164. 最大间距: lc/164.md + - 165. 比较版本号: lc/165.md + - 166. 分数到小数: lc/166.md + - 167. 两数之和 II - 输入有序数组: lc/167.md + - 168. Excel 表列名称: lc/168.md + - 169. 多数元素: lc/169.md + - 170. 两数之和 III - 数据结构设计: lc/170.md + - 171. Excel 表列序号: lc/171.md + - 172. 阶乘后的零: lc/172.md + - 173. 二叉搜索树迭代器: lc/173.md + - 174. 地下城游戏: lc/174.md + - 175. 组合两个表: lc/175.md + - 176. 第二高的薪水: lc/176.md + - 177. 第 N 高的薪水: lc/177.md + - 178. 分数排名: lc/178.md + - 179. 最大数: lc/179.md + - 180. 连续出现的数字: lc/180.md + - 181. 超过经理收入的员工: lc/181.md + - 182. 查找重复的电子邮箱: lc/182.md + - 183. 从不订购的客户: lc/183.md + - 184. 部门工资最高的员工: lc/184.md + - 185. 部门工资前三高的所有员工: lc/185.md + - 186. 反转字符串中的单词 II: lc/186.md + - 187. 重复的 DNA 序列: lc/187.md + - 188. 买卖股票的最佳时机 IV: lc/188.md + - 189. 轮转数组: lc/189.md + - 190. 颠倒二进制位: lc/190.md + - 191. 位 1 的个数: lc/191.md + - 192. 统计词频: lc/192.md + - 193. 有效电话号码: lc/193.md + - 194. 转置文件: lc/194.md + - 195. 第十行: lc/195.md + - 196. 删除重复的电子邮箱: lc/196.md + - 197. 上升的温度: lc/197.md + - 198. 打家劫舍: lc/198.md + - 199. 二叉树的右视图: lc/199.md + - 200. 岛屿数量: lc/200.md + - 201. 数字范围按位与: lc/201.md + - 202. 快乐数: lc/202.md + - 203. 移除链表元素: lc/203.md + - 204. 计数质数: lc/204.md + - 205. 同构字符串: lc/205.md + - 206. 反转链表: lc/206.md + - 207. 课程表: lc/207.md + - 208. 实现 Trie (前缀树): lc/208.md + - 209. 长度最小的子数组: lc/209.md + - 210. 课程表 II: lc/210.md + - 211. 添加与搜索单词 - 数据结构设计: lc/211.md + - 212. 单词搜索 II: lc/212.md + - 213. 打家劫舍 II: lc/213.md + - 214. 最短回文串: lc/214.md + - 215. 数组中的第 K 个最大元素: lc/215.md + - 216. 组合总和 III: lc/216.md + - 217. 存在重复元素: lc/217.md + - 218. 天际线问题: lc/218.md + - 219. 存在重复元素 II: lc/219.md + - 220. 存在重复元素 III: lc/220.md + - 221. 最大正方形: lc/221.md + - 222. 完全二叉树的节点个数: lc/222.md + - 223. 矩形面积: lc/223.md + - 224. 基本计算器: lc/224.md + - 225. 用队列实现栈: lc/225.md + - 226. 翻转二叉树: lc/226.md + - 227. 基本计算器 II: lc/227.md + - 228. 汇总区间: lc/228.md + - 229. 多数元素 II: lc/229.md + - 230. 二叉搜索树中第 K 小的元素: lc/230.md + - 231. 2 的幂: lc/231.md + - 232. 用栈实现队列: lc/232.md + - 233. 数字 1 的个数: lc/233.md + - 234. 回文链表: lc/234.md + - 235. 二叉搜索树的最近公共祖先: lc/235.md + - 236. 二叉树的最近公共祖先: lc/236.md + - 237. 删除链表中的节点: lc/237.md + - 238. 除自身以外数组的乘积: lc/238.md + - 239. 滑动窗口最大值: lc/239.md + - 240. 搜索二维矩阵 II: lc/240.md + - 241. 为运算表达式设计优先级: lc/241.md + - 242. 有效的字母异位词: lc/242.md + - 243. 最短单词距离: lc/243.md + - 244. 最短单词距离 II: lc/244.md + - 245. 最短单词距离 III: lc/245.md + - 246. 中心对称数: lc/246.md + - 247. 中心对称数 II: lc/247.md + - 248. 中心对称数 III: lc/248.md + - 249. 移位字符串分组: lc/249.md + - 250. 统计同值子树: lc/250.md + - 251. 展开二维向量: lc/251.md + - 252. 会议室: lc/252.md + - 253. 会议室 II: lc/253.md + - 254. 因子的组合: lc/254.md + - 255. 验证二叉搜索树的前序遍历序列: lc/255.md + - 256. 粉刷房子: lc/256.md + - 257. 二叉树的所有路径: lc/257.md + - 258. 各位相加: lc/258.md + - 259. 较小的三数之和: lc/259.md + - 260. 只出现一次的数字 III: lc/260.md + - 261. 以图判树: lc/261.md + - 262. 行程和用户: lc/262.md + - 263. 丑数: lc/263.md + - 264. 丑数 II: lc/264.md + - 265. 粉刷房子 II: lc/265.md + - 266. 回文排列: lc/266.md + - 267. 回文排列 II: lc/267.md + - 268. 丢失的数字: lc/268.md + - 269. 火星词典: lc/269.md + - 270. 最接近的二叉搜索树值: lc/270.md + - 271. 字符串的编码与解码: lc/271.md + - 272. 最接近的二叉搜索树值 II: lc/272.md + - 273. 整数转换英文表示: lc/273.md + - 274. H 指数: lc/274.md + - 275. H 指数 II: lc/275.md + - 276. 栅栏涂色: lc/276.md + - 277. 搜寻名人: lc/277.md + - 278. 第一个错误的版本: lc/278.md + - 279. 完全平方数: lc/279.md + - 280. 摆动排序: lc/280.md + - 281. 锯齿迭代器: lc/281.md + - 282. 给表达式添加运算符: lc/282.md + - 283. 移动零: lc/283.md + - 284. 窥视迭代器: lc/284.md + - 285. 二叉搜索树中的中序后继: lc/285.md + - 286. 墙与门: lc/286.md + - 287. 寻找重复数: lc/287.md + - 288. 单词的唯一缩写: lc/288.md + - 289. 生命游戏: lc/289.md + - 290. 单词规律: lc/290.md + - 291. 单词规律 II: lc/291.md + - 292. Nim 游戏: lc/292.md + - 293. 翻转游戏: lc/293.md + - 294. 翻转游戏 II: lc/294.md + - 295. 数据流的中位数: lc/295.md + - 296. 最佳的碰头地点: lc/296.md + - 297. 二叉树的序列化与反序列化: lc/297.md + - 298. 二叉树最长连续序列: lc/298.md + - 299. 猜数字游戏: lc/299.md + - 300. 最长递增子序列: lc/300.md + - 301. 删除无效的括号: lc/301.md + - 302. 包含全部黑色像素的最小矩形: lc/302.md + - 303. 区域和检索 - 数组不可变: lc/303.md + - 304. 二维区域和检索 - 矩阵不可变: lc/304.md + - 305. 岛屿数量 II: lc/305.md + - 306. 累加数: lc/306.md + - 307. 区域和检索 - 数组可修改: lc/307.md + - 308. 二维区域和检索 - 可变: lc/308.md + - 309. 买卖股票的最佳时机含冷冻期: lc/309.md + - 310. 最小高度树: lc/310.md + - 311. 稀疏矩阵的乘法: lc/311.md + - 312. 戳气球: lc/312.md + - 313. 超级丑数: lc/313.md + - 314. 二叉树的垂直遍历: lc/314.md + - 315. 计算右侧小于当前元素的个数: lc/315.md + - 316. 去除重复字母: lc/316.md + - 317. 离建筑物最近的距离: lc/317.md + - 318. 最大单词长度乘积: lc/318.md + - 319. 灯泡开关: lc/319.md + - 320. 列举单词的全部缩写: lc/320.md + - 321. 拼接最大数: lc/321.md + - 322. 零钱兑换: lc/322.md + - 323. 无向图中连通分量的数目: lc/323.md + - 324. 摆动排序 II: lc/324.md + - 325. 和等于 k 的最长子数组长度: lc/325.md + - 326. 3 的幂: lc/326.md + - 327. 区间和的个数: lc/327.md + - 328. 奇偶链表: lc/328.md + - 329. 矩阵中的最长递增路径: lc/329.md + - 330. 按要求补齐数组: lc/330.md + - 331. 验证二叉树的前序序列化: lc/331.md + - 332. 重新安排行程: lc/332.md + - 333. 最大 BST 子树: lc/333.md + - 334. 递增的三元子序列: lc/334.md + - 335. 路径交叉: lc/335.md + - 336. 回文对: lc/336.md + - 337. 打家劫舍 III: lc/337.md + - 338. 比特位计数: lc/338.md + - 339. 嵌套列表加权和: lc/339.md + - 340. 至多包含 K 个不同字符的最长子串: lc/340.md + - 341. 扁平化嵌套列表迭代器: lc/341.md + - 342. 4 的幂: lc/342.md + - 343. 整数拆分: lc/343.md + - 344. 反转字符串: lc/344.md + - 345. 反转字符串中的元音字母: lc/345.md + - 346. 数据流中的移动平均值: lc/346.md + - 347. 前 K 个高频元素: lc/347.md + - 348. 设计井字棋: lc/348.md + - 349. 两个数组的交集: lc/349.md + - 350. 两个数组的交集 II: lc/350.md + - 351. 安卓系统手势解锁: lc/351.md + - 352. 将数据流变为多个不相交区间: lc/352.md + - 353. 贪吃蛇: lc/353.md + - 354. 俄罗斯套娃信封问题: lc/354.md + - 355. 设计推特: lc/355.md + - 356. 直线镜像: lc/356.md + - 357. 统计各位数字都不同的数字个数: lc/357.md + - 358. K 距离间隔重排字符串: lc/358.md + - 359. 日志速率限制器: lc/359.md + - 360. 有序转化数组: lc/360.md + - 361. 轰炸敌人: lc/361.md + - 362. 敲击计数器: lc/362.md + - 363. 矩形区域不超过 K 的最大数值和: lc/363.md + - 364. 嵌套列表加权和 II: lc/364.md + - 365. 水壶问题: lc/365.md + - 366. 寻找二叉树的叶子节点: lc/366.md + - 367. 有效的完全平方数: lc/367.md + - 368. 最大整除子集: lc/368.md + - 369. 给单链表加一: lc/369.md + - 370. 区间加法: lc/370.md + - 371. 两整数之和: lc/371.md + - 372. 超级次方: lc/372.md + - 373. 查找和最小的 K 对数字: lc/373.md + - 374. 猜数字大小: lc/374.md + - 375. 猜数字大小 II: lc/375.md + - 376. 摆动序列: lc/376.md + - 377. 组合总和 Ⅳ: lc/377.md + - 378. 有序矩阵中第 K 小的元素: lc/378.md + - 379. 电话目录管理系统: lc/379.md + - 380. O(1) 时间插入、删除和获取随机元素: lc/380.md + - 381. O(1) 时间插入、删除和获取随机元素 - 允许重复: lc/381.md + - 382. 链表随机节点: lc/382.md + - 383. 赎金信: lc/383.md + - 384. 打乱数组: lc/384.md + - 385. 迷你语法分析器: lc/385.md + - 386. 字典序排数: lc/386.md + - 387. 字符串中的第一个唯一字符: lc/387.md + - 388. 文件的最长绝对路径: lc/388.md + - 389. 找不同: lc/389.md + - 390. 消除游戏: lc/390.md + - 391. 完美矩形: lc/391.md + - 392. 判断子序列: lc/392.md + - 393. UTF-8 编码验证: lc/393.md + - 394. 字符串解码: lc/394.md + - 395. 至少有 K 个重复字符的最长子串: lc/395.md + - 396. 旋转函数: lc/396.md + - 397. 整数替换: lc/397.md + - 398. 随机数索引: lc/398.md + - 399. 除法求值: lc/399.md + - 400. 第 N 位数字: lc/400.md + - 401. 二进制手表: lc/401.md + - 402. 移掉 K 位数字: lc/402.md + - 403. 青蛙过河: lc/403.md + - 404. 左叶子之和: lc/404.md + - 405. 数字转换为十六进制数: lc/405.md + - 406. 根据身高重建队列: lc/406.md + - 407. 接雨水 II: lc/407.md + - 408. 有效单词缩写: lc/408.md + - 409. 最长回文串: lc/409.md + - 410. 分割数组的最大值: lc/410.md + - 411. 最短独占单词缩写: lc/411.md + - 412. Fizz Buzz: lc/412.md + - 413. 等差数列划分: lc/413.md + - 414. 第三大的数: lc/414.md + - 415. 字符串相加: lc/415.md + - 416. 分割等和子集: lc/416.md + - 417. 太平洋大西洋水流问题: lc/417.md + - 418. 屏幕可显示句子的数量: lc/418.md + - 419. 甲板上的战舰: lc/419.md + - 420. 强密码检验器: lc/420.md + - 421. 数组中两个数的最大异或值: lc/421.md + - 422. 有效的单词方块: lc/422.md + - 423. 从英文中重建数字: lc/423.md + - 424. 替换后的最长重复字符: lc/424.md + - 425. 单词方块: lc/425.md + - 426. 将二叉搜索树转化为排序的双向链表: lc/426.md + - 427. 建立四叉树: lc/427.md + - 428. 序列化和反序列化 N 叉树: lc/428.md + - 429. N 叉树的层序遍历: lc/429.md + - 430. 扁平化多级双向链表: lc/430.md + - 431. 将 N 叉树编码为二叉树: lc/431.md + - 432. 全 O(1) 的数据结构: lc/432.md + - 433. 最小基因变化: lc/433.md + - 434. 字符串中的单词数: lc/434.md + - 435. 无重叠区间: lc/435.md + - 436. 寻找右区间: lc/436.md + - 437. 路径总和 III: lc/437.md + - 438. 找到字符串中所有字母异位词: lc/438.md + - 439. 三元表达式解析器: lc/439.md + - 440. 字典序的第 K 小数字: lc/440.md + - 441. 排列硬币: lc/441.md + - 442. 数组中重复的数据: lc/442.md + - 443. 压缩字符串: lc/443.md + - 444. 序列重建: lc/444.md + - 445. 两数相加 II: lc/445.md + - 446. 等差数列划分 II - 子序列: lc/446.md + - 447. 回旋镖的数量: lc/447.md + - 448. 找到所有数组中消失的数字: lc/448.md + - 449. 序列化和反序列化二叉搜索树: lc/449.md + - 450. 删除二叉搜索树中的节点: lc/450.md + - 451. 根据字符出现频率排序: lc/451.md + - 452. 用最少数量的箭引爆气球: lc/452.md + - 453. 最小操作次数使数组元素相等: lc/453.md + - 454. 四数相加 II: lc/454.md + - 455. 分发饼干: lc/455.md + - 456. 132 模式: lc/456.md + - 457. 环形数组是否存在循环: lc/457.md + - 458. 可怜的小猪: lc/458.md + - 459. 重复的子字符串: lc/459.md + - 460. LFU 缓存: lc/460.md + - 461. 汉明距离: lc/461.md + - 462. 最小操作次数使数组元素相等 II: lc/462.md + - 463. 岛屿的周长: lc/463.md + - 464. 我能赢吗: lc/464.md + - 465. 最优账单平衡: lc/465.md + - 466. 统计重复个数: lc/466.md + - 467. 环绕字符串中唯一的子字符串: lc/467.md + - 468. 验证 IP 地址: lc/468.md + - 469. 凸多边形: lc/469.md + - 470. 用 Rand7() 实现 Rand10(): lc/470.md + - 471. 编码最短长度的字符串: lc/471.md + - 472. 连接词: lc/472.md + - 473. 火柴拼正方形: lc/473.md + - 474. 一和零: lc/474.md + - 475. 供暖器: lc/475.md + - 476. 数字的补数: lc/476.md + - 477. 汉明距离总和: lc/477.md + - 478. 在圆内随机生成点: lc/478.md + - 479. 最大回文数乘积: lc/479.md + - 480. 滑动窗口中位数: lc/480.md + - 481. 神奇字符串: lc/481.md + - 482. 密钥格式化: lc/482.md + - 483. 最小好进制: lc/483.md + - 484. 寻找排列: lc/484.md + - 485. 最大连续 1 的个数: lc/485.md + - 486. 预测赢家: lc/486.md + - 487. 最大连续 1 的个数 II: lc/487.md + - 488. 祖玛游戏: lc/488.md + - 489. 扫地机器人: lc/489.md + - 490. 迷宫: lc/490.md + - 491. 非递减子序列: lc/491.md + - 492. 构造矩形: lc/492.md + - 493. 翻转对: lc/493.md + - 494. 目标和: lc/494.md + - 495. 提莫攻击: lc/495.md + - 496. 下一个更大元素 I: lc/496.md + - 497. 非重叠矩形中的随机点: lc/497.md + - 498. 对角线遍历: lc/498.md + - 499. 迷宫 III: lc/499.md + - 500. 键盘行: lc/500.md + - 501. 二叉搜索树中的众数: lc/501.md + - 502. IPO: lc/502.md + - 503. 下一个更大元素 II: lc/503.md + - 504. 七进制数: lc/504.md + - 505. 迷宫 II: lc/505.md + - 506. 相对名次: lc/506.md + - 507. 完美数: lc/507.md + - 508. 出现次数最多的子树元素和: lc/508.md + - 509. 斐波那契数: lc/509.md + - 510. 二叉搜索树中的中序后继 II: lc/510.md + - 511. 游戏玩法分析 I: lc/511.md + - 512. 游戏玩法分析 II: lc/512.md + - 513. 找树左下角的值: lc/513.md + - 514. 自由之路: lc/514.md + - 515. 在每个树行中找最大值: lc/515.md + - 516. 最长回文子序列: lc/516.md + - 517. 超级洗衣机: lc/517.md + - 518. 零钱兑换 II: lc/518.md + - 519. 随机翻转矩阵: lc/519.md + - 520. 检测大写字母: lc/520.md + - 521. 最长特殊序列 Ⅰ: lc/521.md + - 522. 最长特殊序列 II: lc/522.md + - 523. 连续的子数组和: lc/523.md + - 524. 通过删除字母匹配到字典里最长单词: lc/524.md + - 525. 连续数组: lc/525.md + - 526. 优美的排列: lc/526.md + - 527. 单词缩写: lc/527.md + - 528. 按权重随机选择: lc/528.md + - 529. 扫雷游戏: lc/529.md + - 530. 二叉搜索树的最小绝对差: lc/530.md + - 531. 孤独像素 I: lc/531.md + - 532. 数组中的 k-diff 数对: lc/532.md + - 533. 孤独像素 II: lc/533.md + - 534. 游戏玩法分析 III: lc/534.md + - 535. TinyURL 的加密与解密: lc/535.md + - 536. 从字符串生成二叉树: lc/536.md + - 537. 复数乘法: lc/537.md + - 538. 把二叉搜索树转换为累加树: lc/538.md + - 539. 最小时间差: lc/539.md + - 540. 有序数组中的单一元素: lc/540.md + - 541. 反转字符串 II: lc/541.md + - 542. 1 矩阵: lc/542.md + - 543. 二叉树的直径: lc/543.md + - 544. 输出比赛匹配对: lc/544.md + - 545. 二叉树的边界: lc/545.md + - 546. 移除盒子: lc/546.md + - 547. 省份数量: lc/547.md + - 548. 将数组分割成和相等的子数组: lc/548.md + - 549. 二叉树中最长的连续序列: lc/549.md + - 550. 游戏玩法分析 IV: lc/550.md + - 551. 学生出勤记录 I: lc/551.md + - 552. 学生出勤记录 II: lc/552.md + - 553. 最优除法: lc/553.md + - 554. 砖墙: lc/554.md + - 555. 分割连接字符串: lc/555.md + - 556. 下一个更大元素 III: lc/556.md + - 557. 反转字符串中的单词 III: lc/557.md + - 558. 四叉树交集: lc/558.md + - 559. N 叉树的最大深度: lc/559.md + - 560. 和为 K 的子数组: lc/560.md + - 561. 数组拆分: lc/561.md + - 562. 矩阵中最长的连续 1 线段: lc/562.md + - 563. 二叉树的坡度: lc/563.md + - 564. 寻找最近的回文数: lc/564.md + - 565. 数组嵌套: lc/565.md + - 566. 重塑矩阵: lc/566.md + - 567. 字符串的排列: lc/567.md + - 568. 最大休假天数: lc/568.md + - 569. 员工薪水中位数: lc/569.md + - 570. 至少有 5 名直接下属的经理: lc/570.md + - 571. 给定数字的频率查询中位数: lc/571.md + - 572. 另一棵树的子树: lc/572.md + - 573. 松鼠模拟: lc/573.md + - 574. 当选者: lc/574.md + - 575. 分糖果: lc/575.md + - 576. 出界的路径数: lc/576.md + - 577. 员工奖金: lc/577.md + - 578. 查询回答率最高的问题: lc/578.md + - 579. 查询员工的累计薪水: lc/579.md + - 580. 统计各专业学生人数: lc/580.md + - 581. 最短无序连续子数组: lc/581.md + - 582. 杀掉进程: lc/582.md + - 583. 两个字符串的删除操作: lc/583.md + - 584. 寻找用户推荐人: lc/584.md + - 585. 2016 年的投资: lc/585.md + - 586. 订单最多的客户: lc/586.md + - 587. 安装栅栏: lc/587.md + - 588. 设计内存文件系统: lc/588.md + - 589. N 叉树的前序遍历: lc/589.md + - 590. N 叉树的后序遍历: lc/590.md + - 591. 标签验证器: lc/591.md + - 592. 分数加减运算: lc/592.md + - 593. 有效的正方形: lc/593.md + - 594. 最长和谐子序列: lc/594.md + - 595. 大的国家: lc/595.md + - 596. 超过 5 名学生的课: lc/596.md + - 597. 好友申请 I：总体通过率: lc/597.md + - 598. 区间加法 II: lc/598.md + - 599. 两个列表的最小索引总和: lc/599.md + - 600. 不含连续 1 的非负整数: lc/600.md + - 601. 体育馆的人流量: lc/601.md + - 602. 好友申请 II ：谁有最多的好友: lc/602.md + - 603. 连续空余座位: lc/603.md + - 604. 迭代压缩字符串: lc/604.md + - 605. 种花问题: lc/605.md + - 606. 根据二叉树创建字符串: lc/606.md + - 607. 销售员: lc/607.md + - 608. 树节点: lc/608.md + - 609. 在系统中查找重复文件: lc/609.md + - 610. 判断三角形: lc/610.md + - 611. 有效三角形的个数: lc/611.md + - 612. 平面上的最近距离: lc/612.md + - 613. 直线上的最近距离: lc/613.md + - 614. 二级关注者: lc/614.md + - 615. 平均工资：部门与公司比较: lc/615.md + - 616. 给字符串添加加粗标签: lc/616.md + - 617. 合并二叉树: lc/617.md + - 618. 学生地理信息报告: lc/618.md + - 619. 只出现一次的最大数字: lc/619.md + - 620. 有趣的电影: lc/620.md + - 621. 任务调度器: lc/621.md + - 622. 设计循环队列: lc/622.md + - 623. 在二叉树中增加一行: lc/623.md + - 624. 数组列表中的最大距离: lc/624.md + - 625. 最小因式分解: lc/625.md + - 626. 换座位: lc/626.md + - 627. 变更性别: lc/627.md + - 628. 三个数的最大乘积: lc/628.md + - 629. K 个逆序对数组: lc/629.md + - 630. 课程表 III: lc/630.md + - 631. 设计 Excel 求和公式: lc/631.md + - 632. 最小区间: lc/632.md + - 633. 平方数之和: lc/633.md + - 634. 寻找数组的错位排列: lc/634.md + - 635. 设计日志存储系统: lc/635.md + - 636. 函数的独占时间: lc/636.md + - 637. 二叉树的层平均值: lc/637.md + - 638. 大礼包: lc/638.md + - 639. 解码方法 II: lc/639.md + - 640. 求解方程: lc/640.md + - 641. 设计循环双端队列: lc/641.md + - 642. 设计搜索自动补全系统: lc/642.md + - 643. 子数组最大平均数 I: lc/643.md + - 644. 子数组最大平均数 II: lc/644.md + - 645. 错误的集合: lc/645.md + - 646. 最长数对链: lc/646.md + - 647. 回文子串: lc/647.md + - 648. 单词替换: lc/648.md + - 649. Dota2 参议院: lc/649.md + - 650. 两个键的键盘: lc/650.md + - 651. 四个键的键盘: lc/651.md + - 652. 寻找重复的子树: lc/652.md + - 653. 两数之和 IV - 输入二叉搜索树: lc/653.md + - 654. 最大二叉树: lc/654.md + - 655. 输出二叉树: lc/655.md + - 656. 金币路径: lc/656.md + - 657. 机器人能否返回原点: lc/657.md + - 658. 找到 K 个最接近的元素: lc/658.md + - 659. 分割数组为连续子序列: lc/659.md + - 660. 移除 9: lc/660.md + - 661. 图片平滑器: lc/661.md + - 662. 二叉树最大宽度: lc/662.md + - 663. 均匀树划分: lc/663.md + - 664. 奇怪的打印机: lc/664.md + - 665. 非递减数列: lc/665.md + - 666. 路径总和 IV: lc/666.md + - 667. 优美的排列 II: lc/667.md + - 668. 乘法表中第 k 小的数: lc/668.md + - 669. 修剪二叉搜索树: lc/669.md + - 670. 最大交换: lc/670.md + - 671. 二叉树中第二小的节点: lc/671.md + - 672. 灯泡开关 Ⅱ: lc/672.md + - 673. 最长递增子序列的个数: lc/673.md + - 674. 最长连续递增序列: lc/674.md + - 675. 为高尔夫比赛砍树: lc/675.md + - 676. 实现一个魔法字典: lc/676.md + - 677. 键值映射: lc/677.md + - 678. 有效的括号字符串: lc/678.md + - 679. 24 点游戏: lc/679.md + - 680. 验证回文串 II: lc/680.md + - 681. 最近时刻: lc/681.md + - 682. 棒球比赛: lc/682.md + - 683. K 个关闭的灯泡: lc/683.md + - 684. 冗余连接: lc/684.md + - 685. 冗余连接 II: lc/685.md + - 686. 重复叠加字符串匹配: lc/686.md + - 687. 最长同值路径: lc/687.md + - 688. 骑士在棋盘上的概率: lc/688.md + - 689. 三个无重叠子数组的最大和: lc/689.md + - 690. 员工的重要性: lc/690.md + - 691. 贴纸拼词: lc/691.md + - 692. 前 K 个高频单词: lc/692.md + - 693. 交替位二进制数: lc/693.md + - 694. 不同岛屿的数量: lc/694.md + - 695. 岛屿的最大面积: lc/695.md + - 696. 计数二进制子串: lc/696.md + - 697. 数组的度: lc/697.md + - 698. 划分为 k 个相等的子集: lc/698.md + - 699. 掉落的方块: lc/699.md + - 700. 二叉搜索树中的搜索: lc/700.md + - 701. 二叉搜索树中的插入操作: lc/701.md + - 702. 搜索长度未知的有序数组: lc/702.md + - 703. 数据流中的第 K 大元素: lc/703.md + - 704. 二分查找: lc/704.md + - 705. 设计哈希集合: lc/705.md + - 706. 设计哈希映射: lc/706.md + - 707. 设计链表: lc/707.md + - 708. 循环有序列表的插入: lc/708.md + - 709. 转换成小写字母: lc/709.md + - 710. 黑名单中的随机数: lc/710.md + - 711. 不同岛屿的数量 II: lc/711.md + - 712. 两个字符串的最小 ASCII 删除和: lc/712.md + - 713. 乘积小于 K 的子数组: lc/713.md + - 714. 买卖股票的最佳时机含手续费: lc/714.md + - 715. Range 模块: lc/715.md + - 716. 最大栈: lc/716.md + - 717. 1 比特与 2 比特字符: lc/717.md + - 718. 最长重复子数组: lc/718.md + - 719. 找出第 K 小的数对距离: lc/719.md + - 720. 词典中最长的单词: lc/720.md + - 721. 账户合并: lc/721.md + - 722. 删除注释: lc/722.md + - 723. 粉碎糖果: lc/723.md + - 724. 寻找数组的中心下标: lc/724.md + - 725. 分隔链表: lc/725.md + - 726. 原子的数量: lc/726.md + - 727. 最小窗口子序列: lc/727.md + - 728. 自除数: lc/728.md + - 729. 我的日程安排表 I: lc/729.md + - 730. 统计不同回文子序列: lc/730.md + - 731. 我的日程安排表 II: lc/731.md + - 732. 我的日程安排表 III: lc/732.md + - 733. 图像渲染: lc/733.md + - 734. 句子相似性: lc/734.md + - 735. 小行星碰撞: lc/735.md + - 736. Lisp 语法解析: lc/736.md + - 737. 句子相似性 II: lc/737.md + - 738. 单调递增的数字: lc/738.md + - 739. 每日温度: lc/739.md + - 740. 删除并获得点数: lc/740.md + - 741. 摘樱桃: lc/741.md + - 742. 二叉树最近的叶节点: lc/742.md + - 743. 网络延迟时间: lc/743.md + - 744. 寻找比目标字母大的最小字母: lc/744.md + - 745. 前缀和后缀搜索: lc/745.md + - 746. 使用最小花费爬楼梯: lc/746.md + - 747. 至少是其他数字两倍的最大数: lc/747.md + - 748. 最短补全词: lc/748.md + - 749. 隔离病毒: lc/749.md + - 750. 角矩形的数量: lc/750.md + - 751. IP 到 CIDR: lc/751.md + - 752. 打开转盘锁: lc/752.md + - 753. 破解保险箱: lc/753.md + - 754. 到达终点数字: lc/754.md + - 755. 倒水: lc/755.md + - 756. 金字塔转换矩阵: lc/756.md + - 757. 设置交集大小至少为 2: lc/757.md + - 758. 字符串中的加粗单词: lc/758.md + - 759. 员工空闲时间: lc/759.md + - 760. 找出变位映射: lc/760.md + - 761. 特殊的二进制序列: lc/761.md + - 762. 二进制表示中质数个计算置位: lc/762.md + - 763. 划分字母区间: lc/763.md + - 764. 最大加号标志: lc/764.md + - 765. 情侣牵手: lc/765.md + - 766. 托普利茨矩阵: lc/766.md + - 767. 重构字符串: lc/767.md + - 768. 最多能完成排序的块 II: lc/768.md + - 769. 最多能完成排序的块: lc/769.md + - 770. 基本计算器 IV: lc/770.md + - 771. 宝石与石头: lc/771.md + - 772. 基本计算器 III: lc/772.md + - 773. 滑动谜题: lc/773.md + - 774. 最小化去加油站的最大距离: lc/774.md + - 775. 全局倒置与局部倒置: lc/775.md + - 776. 拆分二叉搜索树: lc/776.md + - 777. 在 LR 字符串中交换相邻字符: lc/777.md + - 778. 水位上升的泳池中游泳: lc/778.md + - 779. 第 K 个语法符号: lc/779.md + - 780. 到达终点: lc/780.md + - 781. 森林中的兔子: lc/781.md + - 782. 变为棋盘: lc/782.md + - 783. 二叉搜索树节点最小距离: lc/783.md + - 784. 字母大小写全排列: lc/784.md + - 785. 判断二分图: lc/785.md + - 786. 第 K 个最小的素数分数: lc/786.md + - 787. K 站中转内最便宜的航班: lc/787.md + - 788. 旋转数字: lc/788.md + - 789. 逃脱阻碍者: lc/789.md + - 790. 多米诺和托米诺平铺: lc/790.md + - 791. 自定义字符串排序: lc/791.md + - 792. 匹配子序列的单词数: lc/792.md + - 793. 阶乘函数后 K 个零: lc/793.md + - 794. 有效的井字游戏: lc/794.md + - 795. 区间子数组个数: lc/795.md + - 796. 旋转字符串: lc/796.md + - 797. 所有可能的路径: lc/797.md + - 798. 得分最高的最小轮调: lc/798.md + - 799. 香槟塔: lc/799.md + - 800. 相似 RGB 颜色: lc/800.md + - 801. 使序列递增的最小交换次数: lc/801.md + - 802. 找到最终的安全状态: lc/802.md + - 803. 打砖块: lc/803.md + - 804. 唯一摩尔斯密码词: lc/804.md + - 805. 数组的均值分割: lc/805.md + - 806. 写字符串需要的行数: lc/806.md + - 807. 保持城市天际线: lc/807.md + - 808. 分汤: lc/808.md + - 809. 情感丰富的文字: lc/809.md + - 810. 黑板异或游戏: lc/810.md + - 811. 子域名访问计数: lc/811.md + - 812. 最大三角形面积: lc/812.md + - 813. 最大平均值和的分组: lc/813.md + - 814. 二叉树剪枝: lc/814.md + - 815. 公交路线: lc/815.md + - 816. 模糊坐标: lc/816.md + - 817. 链表组件: lc/817.md + - 818. 赛车: lc/818.md + - 819. 最常见的单词: lc/819.md + - 820. 单词的压缩编码: lc/820.md + - 821. 字符的最短距离: lc/821.md + - 822. 翻转卡片游戏: lc/822.md + - 823. 带因子的二叉树: lc/823.md + - 824. 山羊拉丁文: lc/824.md + - 825. 适龄的朋友: lc/825.md + - 826. 安排工作以达到最大收益: lc/826.md + - 827. 最大人工岛: lc/827.md + - 828. 统计子串中的唯一字符: lc/828.md + - 829. 连续整数求和: lc/829.md + - 830. 较大分组的位置: lc/830.md + - 831. 隐藏个人信息: lc/831.md + - 832. 翻转图像: lc/832.md + - 833. 字符串中的查找与替换: lc/833.md + - 834. 树中距离之和: lc/834.md + - 835. 图像重叠: lc/835.md + - 836. 矩形重叠: lc/836.md + - 837. 新 21 点: lc/837.md + - 838. 推多米诺: lc/838.md + - 839. 相似字符串组: lc/839.md + - 840. 矩阵中的幻方: lc/840.md + - 841. 钥匙和房间: lc/841.md + - 842. 将数组拆分成斐波那契序列: lc/842.md + - 843. 猜猜这个单词: lc/843.md + - 844. 比较含退格的字符串: lc/844.md + - 845. 数组中的最长山脉: lc/845.md + - 846. 一手顺子: lc/846.md + - 847. 访问所有节点的最短路径: lc/847.md + - 848. 字母移位: lc/848.md + - 849. 到最近的人的最大距离: lc/849.md + - 850. 矩形面积 II: lc/850.md + - 851. 喧闹和富有: lc/851.md + - 852. 山脉数组的峰顶索引: lc/852.md + - 853. 车队: lc/853.md + - 854. 相似度为 K 的字符串: lc/854.md + - 855. 考场就座: lc/855.md + - 856. 括号的分数: lc/856.md + - 857. 雇佣 K 名工人的最低成本: lc/857.md + - 858. 镜面反射: lc/858.md + - 859. 亲密字符串: lc/859.md + - 860. 柠檬水找零: lc/860.md + - 861. 翻转矩阵后的得分: lc/861.md + - 862. 和至少为 K 的最短子数组: lc/862.md + - 863. 二叉树中所有距离为 K 的结点: lc/863.md + - 864. 获取所有钥匙的最短路径: lc/864.md + - 865. 具有所有最深节点的最小子树: lc/865.md + - 866. 回文素数: lc/866.md + - 867. 转置矩阵: lc/867.md + - 868. 二进制间距: lc/868.md + - 869. 重新排序得到 2 的幂: lc/869.md + - 870. 优势洗牌: lc/870.md + - 871. 最低加油次数: lc/871.md + - 872. 叶子相似的树: lc/872.md + - 873. 最长的斐波那契子序列的长度: lc/873.md + - 874. 模拟行走机器人: lc/874.md + - 875. 爱吃香蕉的珂珂: lc/875.md + - 876. 链表的中间结点: lc/876.md + - 877. 石子游戏: lc/877.md + - 878. 第 N 个神奇数字: lc/878.md + - 879. 盈利计划: lc/879.md + - 880. 索引处的解码字符串: lc/880.md + - 881. 救生艇: lc/881.md + - 882. 细分图中的可到达节点: lc/882.md + - 883. 三维形体投影面积: lc/883.md + - 884. 两句话中的不常见单词: lc/884.md + - 885. 螺旋矩阵 III: lc/885.md + - 886. 可能的二分法: lc/886.md + - 887. 鸡蛋掉落: lc/887.md + - 888. 公平的糖果交换: lc/888.md + - 889. 根据前序和后序遍历构造二叉树: lc/889.md + - 890. 查找和替换模式: lc/890.md + - 891. 子序列宽度之和: lc/891.md + - 892. 三维形体的表面积: lc/892.md + - 893. 特殊等价字符串组: lc/893.md + - 894. 所有可能的真二叉树: lc/894.md + - 895. 最大频率栈: lc/895.md + - 896. 单调数列: lc/896.md + - 897. 递增顺序搜索树: lc/897.md + - 898. 子数组按位或操作: lc/898.md + - 899. 有序队列: lc/899.md + - 900. RLE 迭代器: lc/900.md + - 901. 股票价格跨度: lc/901.md + - 902. 最大为 N 的数字组合: lc/902.md + - 903. DI 序列的有效排列: lc/903.md + - 904. 水果成篮: lc/904.md + - 905. 按奇偶排序数组: lc/905.md + - 906. 超级回文数: lc/906.md + - 907. 子数组的最小值之和: lc/907.md + - 908. 最小差值 I: lc/908.md + - 909. 蛇梯棋: lc/909.md + - 910. 最小差值 II: lc/910.md + - 911. 在线选举: lc/911.md + - 912. 排序数组: lc/912.md + - 913. 猫和老鼠: lc/913.md + - 914. 卡牌分组: lc/914.md + - 915. 分割数组: lc/915.md + - 916. 单词子集: lc/916.md + - 917. 仅仅反转字母: lc/917.md + - 918. 环形子数组的最大和: lc/918.md + - 919. 完全二叉树插入器: lc/919.md + - 920. 播放列表的数量: lc/920.md + - 921. 使括号有效的最少添加: lc/921.md + - 922. 按奇偶排序数组 II: lc/922.md + - 923. 三数之和的多种可能: lc/923.md + - 924. 尽量减少恶意软件的传播: lc/924.md + - 925. 长按键入: lc/925.md + - 926. 将字符串翻转到单调递增: lc/926.md + - 927. 三等分: lc/927.md + - 928. 尽量减少恶意软件的传播 II: lc/928.md + - 929. 独特的电子邮件地址: lc/929.md + - 930. 和相同的二元子数组: lc/930.md + - 931. 下降路径最小和: lc/931.md + - 932. 漂亮数组: lc/932.md + - 933. 最近的请求次数: lc/933.md + - 934. 最短的桥: lc/934.md + - 935. 骑士拨号器: lc/935.md + - 936. 戳印序列: lc/936.md + - 937. 重新排列日志文件: lc/937.md + - 938. 二叉搜索树的范围和: lc/938.md + - 939. 最小面积矩形: lc/939.md + - 940. 不同的子序列 II: lc/940.md + - 941. 有效的山脉数组: lc/941.md + - 942. 增减字符串匹配: lc/942.md + - 943. 最短超级串: lc/943.md + - 944. 删列造序: lc/944.md + - 945. 使数组唯一的最小增量: lc/945.md + - 946. 验证栈序列: lc/946.md + - 947. 移除最多的同行或同列石头: lc/947.md + - 948. 令牌放置: lc/948.md + - 949. 给定数字能组成的最大时间: lc/949.md + - 950. 按递增顺序显示卡牌: lc/950.md + - 951. 翻转等价二叉树: lc/951.md + - 952. 按公因数计算最大组件大小: lc/952.md + - 953. 验证外星语词典: lc/953.md + - 954. 二倍数对数组: lc/954.md + - 955. 删列造序 II: lc/955.md + - 956. 最高的广告牌: lc/956.md + - 957. N 天后的牢房: lc/957.md + - 958. 二叉树的完全性检验: lc/958.md + - 959. 由斜杠划分区域: lc/959.md + - 960. 删列造序 III: lc/960.md + - 961. 在长度 2N 的数组中找出重复 N 次的元素: lc/961.md + - 962. 最大宽度坡: lc/962.md + - 963. 最小面积矩形 II: lc/963.md + - 964. 表示数字的最少运算符: lc/964.md + - 965. 单值二叉树: lc/965.md + - 966. 元音拼写检查器: lc/966.md + - 967. 连续差相同的数字: lc/967.md + - 968. 监控二叉树: lc/968.md + - 969. 煎饼排序: lc/969.md + - 970. 强整数: lc/970.md + - 971. 翻转二叉树以匹配先序遍历: lc/971.md + - 972. 相等的有理数: lc/972.md + - 973. 最接近原点的 K 个点: lc/973.md + - 974. 和可被 K 整除的子数组: lc/974.md + - 975. 奇偶跳: lc/975.md + - 976. 三角形的最大周长: lc/976.md + - 977. 有序数组的平方: lc/977.md + - 978. 最长湍流子数组: lc/978.md + - 979. 在二叉树中分配硬币: lc/979.md + - 980. 不同路径 III: lc/980.md + - 981. 基于时间的键值存储: lc/981.md + - 982. 按位与为零的三元组: lc/982.md + - 983. 最低票价: lc/983.md + - 984. 不含 AAA 或 BBB 的字符串: lc/984.md + - 985. 查询后的偶数和: lc/985.md + - 986. 区间列表的交集: lc/986.md + - 987. 二叉树的垂序遍历: lc/987.md + - 988. 从叶结点开始的最小字符串: lc/988.md + - 989. 数组形式的整数加法: lc/989.md + - 990. 等式方程的可满足性: lc/990.md + - 991. 坏了的计算器: lc/991.md + - 992. K 个不同整数的子数组: lc/992.md + - 993. 二叉树的堂兄弟节点: lc/993.md + - 994. 腐烂的橘子: lc/994.md + - 995. K 连续位的最小翻转次数: lc/995.md + - 996. 正方形数组的数目: lc/996.md + - 997. 找到小镇的法官: lc/997.md + - 998. 最大二叉树 II: lc/998.md + - 999. 可以被一步捕获的棋子数: lc/999.md + - 1000. 合并石头的最低成本: lc/1000.md + - 1001. 网格照明: lc/1001.md + - 1002. 查找共用字符: lc/1002.md + - 1003. 检查替换后的词是否有效: lc/1003.md + - 1004. 最大连续 1 的个数 III: lc/1004.md + - 1005. K 次取反后最大化的数组和: lc/1005.md + - 1006. 笨阶乘: lc/1006.md + - 1007. 行相等的最少多米诺旋转: lc/1007.md + - 1008. 前序遍历构造二叉搜索树: lc/1008.md + - 1009. 十进制整数的反码: lc/1009.md + - 1010. 总持续时间可被 60 整除的歌曲: lc/1010.md + - 1011. 在 D 天内送达包裹的能力: lc/1011.md + - 1012. 至少有 1 位重复的数字: lc/1012.md + - 1013. 将数组分成和相等的三个部分: lc/1013.md + - 1014. 最佳观光组合: lc/1014.md + - 1015. 可被 K 整除的最小整数: lc/1015.md + - 1016. 子串能表示从 1 到 N 数字的二进制串: lc/1016.md + - 1017. 负二进制转换: lc/1017.md + - 1018. 可被 5 整除的二进制前缀: lc/1018.md + - 1019. 链表中的下一个更大节点: lc/1019.md + - 1020. 飞地的数量: lc/1020.md + - 1021. 删除最外层的括号: lc/1021.md + - 1022. 从根到叶的二进制数之和: lc/1022.md + - 1023. 驼峰式匹配: lc/1023.md + - 1024. 视频拼接: lc/1024.md + - 1025. 除数博弈: lc/1025.md + - 1026. 节点与其祖先之间的最大差值: lc/1026.md + - 1027. 最长等差数列: lc/1027.md + - 1028. 从先序遍历还原二叉树: lc/1028.md + - 1029. 两地调度: lc/1029.md + - 1030. 距离顺序排列矩阵单元格: lc/1030.md + - 1031. 两个非重叠子数组的最大和: lc/1031.md + - 1032. 字符流: lc/1032.md + - 1033. 移动石子直到连续: lc/1033.md + - 1034. 边界着色: lc/1034.md + - 1035. 不相交的线: lc/1035.md + - 1036. 逃离大迷宫: lc/1036.md + - 1037. 有效的回旋镖: lc/1037.md + - 1038. 从二叉搜索树到更大和树: lc/1038.md + - 1039. 多边形三角剖分的最低得分: lc/1039.md + - 1040. 移动石子直到连续 II: lc/1040.md + - 1041. 困于环中的机器人: lc/1041.md + - 1042. 不邻接植花: lc/1042.md + - 1043. 分隔数组以得到最大和: lc/1043.md + - 1044. 最长重复子串: lc/1044.md + - 1045. 买下所有产品的客户: lc/1045.md + - 1046. 最后一块石头的重量: lc/1046.md + - 1047. 删除字符串中的所有相邻重复项: lc/1047.md + - 1048. 最长字符串链: lc/1048.md + - 1049. 最后一块石头的重量 II: lc/1049.md + - 1050. 合作过至少三次的演员和导演: lc/1050.md + - 1051. 高度检查器: lc/1051.md + - 1052. 爱生气的书店老板: lc/1052.md + - 1053. 交换一次的先前排列: lc/1053.md + - 1054. 距离相等的条形码: lc/1054.md + - 1055. 形成字符串的最短路径: lc/1055.md + - 1056. 易混淆数: lc/1056.md + - 1057. 校园自行车分配: lc/1057.md + - 1058. 最小化舍入误差以满足目标: lc/1058.md + - 1059. 从始点到终点的所有路径: lc/1059.md + - 1060. 有序数组中的缺失元素: lc/1060.md + - 1061. 按字典序排列最小的等效字符串: lc/1061.md + - 1062. 最长重复子串: lc/1062.md + - 1063. 有效子数组的数目: lc/1063.md + - 1064. 不动点: lc/1064.md + - 1065. 字符串的索引对: lc/1065.md + - 1066. 校园自行车分配 II: lc/1066.md + - 1067. 范围内的数字计数: lc/1067.md + - 1068. 产品销售分析 I: lc/1068.md + - 1069. 产品销售分析 II: lc/1069.md + - 1070. 产品销售分析 III: lc/1070.md + - 1071. 字符串的最大公因子: lc/1071.md + - 1072. 按列翻转得到最大值等行数: lc/1072.md + - 1073. 负二进制数相加: lc/1073.md + - 1074. 元素和为目标值的子矩阵数量: lc/1074.md + - 1075. 项目员工 I: lc/1075.md + - 1076. 项目员工 II: lc/1076.md + - 1077. 项目员工 III: lc/1077.md + - 1078. Bigram 分词: lc/1078.md + - 1079. 活字印刷: lc/1079.md + - 1080. 根到叶路径上的不足节点: lc/1080.md + - 1081. 不同字符的最小子序列: lc/1081.md + - 1082. 销售分析 I: lc/1082.md + - 1083. 销售分析 II: lc/1083.md + - 1084. 销售分析 III: lc/1084.md + - 1085. 最小元素各数位之和: lc/1085.md + - 1086. 前五科的均分: lc/1086.md + - 1087. 花括号展开: lc/1087.md + - 1088. 易混淆数 II: lc/1088.md + - 1089. 复写零: lc/1089.md + - 1090. 受标签影响的最大值: lc/1090.md + - 1091. 二进制矩阵中的最短路径: lc/1091.md + - 1092. 最短公共超序列: lc/1092.md + - 1093. 大样本统计: lc/1093.md + - 1094. 拼车: lc/1094.md + - 1095. 山脉数组中查找目标值: lc/1095.md + - 1096. 花括号展开 II: lc/1096.md + - 1097. 游戏玩法分析 V: lc/1097.md + - 1098. 小众书籍: lc/1098.md + - 1099. 小于 K 的两数之和: lc/1099.md + - 1100. 长度为 K 的无重复字符子串: lc/1100.md + - 1101. 彼此熟识的最早时间: lc/1101.md + - 1102. 得分最高的路径: lc/1102.md + - 1103. 分糖果 II: lc/1103.md + - 1104. 二叉树寻路: lc/1104.md + - 1105. 填充书架: lc/1105.md + - 1106. 解析布尔表达式: lc/1106.md + - 1107. 每日新用户统计: lc/1107.md + - 1108. IP 地址无效化: lc/1108.md + - 1109. 航班预订统计: lc/1109.md + - 1110. 删点成林: lc/1110.md + - 1111. 有效括号的嵌套深度: lc/1111.md + - 1112. 每位学生的最高成绩: lc/1112.md + - 1113. 报告的记录: lc/1113.md + - 1114. 按序打印: lc/1114.md + - 1115. 交替打印 FooBar: lc/1115.md + - 1116. 打印零与奇偶数: lc/1116.md + - 1117. H2O 生成: lc/1117.md + - 1118. 一月有多少天: lc/1118.md + - 1119. 删去字符串中的元音: lc/1119.md + - 1120. 子树的最大平均值: lc/1120.md + - 1121. 将数组分成几个递增序列: lc/1121.md + - 1122. 数组的相对排序: lc/1122.md + - 1123. 最深叶节点的最近公共祖先: lc/1123.md + - 1124. 表现良好的最长时间段: lc/1124.md + - 1125. 最小的必要团队: lc/1125.md + - 1126. 查询活跃业务: lc/1126.md + - 1127. 用户购买平台: lc/1127.md + - 1128. 等价多米诺骨牌对的数量: lc/1128.md + - 1129. 颜色交替的最短路径: lc/1129.md + - 1130. 叶值的最小代价生成树: lc/1130.md + - 1131. 绝对值表达式的最大值: lc/1131.md + - 1132. 报告的记录 II: lc/1132.md + - 1133. 最大唯一数: lc/1133.md + - 1134. 阿姆斯特朗数: lc/1134.md + - 1135. 最低成本连通所有城市: lc/1135.md + - 1136. 并行课程: lc/1136.md + - 1137. 第 N 个泰波那契数: lc/1137.md + - 1138. 字母板上的路径: lc/1138.md + - 1139. 最大的以 1 为边界的正方形: lc/1139.md + - 1140. 石子游戏 II: lc/1140.md + - 1141. 查询近 30 天活跃用户数: lc/1141.md + - 1142. 过去 30 天的用户活动 II: lc/1142.md + - 1143. 最长公共子序列: lc/1143.md + - 1144. 递减元素使数组呈锯齿状: lc/1144.md + - 1145. 二叉树着色游戏: lc/1145.md + - 1146. 快照数组: lc/1146.md + - 1147. 段式回文: lc/1147.md + - 1148. 文章浏览 I: lc/1148.md + - 1149. 文章浏览 II: lc/1149.md + - 1150. 检查一个数是否在数组中占绝大多数: lc/1150.md + - 1151. 最少交换次数来组合所有的 1: lc/1151.md + - 1152. 用户网站访问行为分析: lc/1152.md + - 1153. 字符串转化: lc/1153.md + - 1154. 一年中的第几天: lc/1154.md + - 1155. 掷骰子等于目标和的方法数: lc/1155.md + - 1156. 单字符重复子串的最大长度: lc/1156.md + - 1157. 子数组中占绝大多数的元素: lc/1157.md + - 1158. 市场分析 I: lc/1158.md + - 1159. 市场分析 II: lc/1159.md + - 1160. 拼写单词: lc/1160.md + - 1161. 最大层内元素和: lc/1161.md + - 1162. 地图分析: lc/1162.md + - 1163. 按字典序排在最后的子串: lc/1163.md + - 1164. 指定日期的产品价格: lc/1164.md + - 1165. 单行键盘: lc/1165.md + - 1166. 设计文件系统: lc/1166.md + - 1167. 连接木棍的最低费用: lc/1167.md + - 1168. 水资源分配优化: lc/1168.md + - 1169. 查询无效交易: lc/1169.md + - 1170. 比较字符串最小字母出现频次: lc/1170.md + - 1171. 从链表中删去总和值为零的连续节点: lc/1171.md + - 1172. 餐盘栈: lc/1172.md + - 1173. 即时食物配送 I: lc/1173.md + - 1174. 即时食物配送 II: lc/1174.md + - 1175. 质数排列: lc/1175.md + - 1176. 健身计划评估: lc/1176.md + - 1177. 构建回文串检测: lc/1177.md + - 1178. 猜字谜: lc/1178.md + - 1179. 重新格式化部门表: lc/1179.md + - 1180. 统计只含单一字母的子串: lc/1180.md + - 1181. 前后拼接: lc/1181.md + - 1182. 与目标颜色间的最短距离: lc/1182.md + - 1183. 矩阵中 1 的最大数量: lc/1183.md + - 1184. 公交站间的距离: lc/1184.md + - 1185. 一周中的第几天: lc/1185.md + - 1186. 删除一次得到子数组最大和: lc/1186.md + - 1187. 使数组严格递增: lc/1187.md + - 1188. 设计有限阻塞队列: lc/1188.md + - 1189. “气球” 的最大数量: lc/1189.md + - 1190. 反转每对括号间的子串: lc/1190.md + - 1191. K 次串联后最大子数组之和: lc/1191.md + - 1192. 查找集群内的关键连接: lc/1192.md + - 1193. 每月交易 I: lc/1193.md + - 1194. 锦标赛优胜者: lc/1194.md + - 1195. 交替打印字符串: lc/1195.md + - 1196. 最多可以买到的苹果数量: lc/1196.md + - 1197. 进击的骑士: lc/1197.md + - 1198. 找出所有行中最小公共元素: lc/1198.md + - 1199. 建造街区的最短时间: lc/1199.md + - 1200. 最小绝对差: lc/1200.md + - 1201. 丑数 III: lc/1201.md + - 1202. 交换字符串中的元素: lc/1202.md + - 1203. 项目管理: lc/1203.md + - 1204. 最后一个能进入巴士的人: lc/1204.md + - 1205. 每月交易 II: lc/1205.md + - 1206. 设计跳表: lc/1206.md + - 1207. 独一无二的出现次数: lc/1207.md + - 1208. 尽可能使字符串相等: lc/1208.md + - 1209. 删除字符串中的所有相邻重复项 II: lc/1209.md + - 1210. 穿过迷宫的最少移动次数: lc/1210.md + - 1211. 查询结果的质量和占比: lc/1211.md + - 1212. 查询球队积分: lc/1212.md + - 1213. 三个有序数组的交集: lc/1213.md + - 1214. 查找两棵二叉搜索树之和: lc/1214.md + - 1215. 步进数: lc/1215.md + - 1216. 验证回文串 III: lc/1216.md + - 1217. 玩筹码: lc/1217.md + - 1218. 最长定差子序列: lc/1218.md + - 1219. 黄金矿工: lc/1219.md + - 1220. 统计元音字母序列的数目: lc/1220.md + - 1221. 分割平衡字符串: lc/1221.md + - 1222. 可以攻击国王的皇后: lc/1222.md + - 1223. 掷骰子模拟: lc/1223.md + - 1224. 最大相等频率: lc/1224.md + - 1225. 报告系统状态的连续日期: lc/1225.md + - 1226. 哲学家进餐: lc/1226.md + - 1227. 飞机座位分配概率: lc/1227.md + - 1228. 等差数列中缺失的数字: lc/1228.md + - 1229. 安排会议日程: lc/1229.md + - 1230. 抛掷硬币: lc/1230.md + - 1231. 分享巧克力: lc/1231.md + - 1232. 缀点成线: lc/1232.md + - 1233. 删除子文件夹: lc/1233.md + - 1234. 替换子串得到平衡字符串: lc/1234.md + - 1235. 规划兼职工作: lc/1235.md + - 1236. 网络爬虫: lc/1236.md + - 1237. 找出给定方程的正整数解: lc/1237.md + - 1238. 循环码排列: lc/1238.md + - 1239. 串联字符串的最大长度: lc/1239.md + - 1240. 铺瓷砖: lc/1240.md + - 1241. 每个帖子的评论数: lc/1241.md + - 1242. 多线程网页爬虫: lc/1242.md + - 1243. 数组变换: lc/1243.md + - 1244. 力扣排行榜: lc/1244.md + - 1245. 树的直径: lc/1245.md + - 1246. 删除回文子数组: lc/1246.md + - 1247. 交换字符使得字符串相同: lc/1247.md + - 1248. 统计「优美子数组」: lc/1248.md + - 1249. 移除无效的括号: lc/1249.md + - 1250. 检查「好数组」: lc/1250.md + - 1251. 平均售价: lc/1251.md + - 1252. 奇数值单元格的数目: lc/1252.md + - 1253. 重构 2 行二进制矩阵: lc/1253.md + - 1254. 统计封闭岛屿的数目: lc/1254.md + - 1255. 得分最高的单词集合: lc/1255.md + - 1256. 加密数字: lc/1256.md + - 1257. 最小公共区域: lc/1257.md + - 1258. 近义词句子: lc/1258.md + - 1259. 不相交的握手: lc/1259.md + - 1260. 二维网格迁移: lc/1260.md + - 1261. 在受污染的二叉树中查找元素: lc/1261.md + - 1262. 可被三整除的最大和: lc/1262.md + - 1263. 推箱子: lc/1263.md + - 1264. 页面推荐: lc/1264.md + - 1265. 逆序打印不可变链表: lc/1265.md + - 1266. 访问所有点的最小时间: lc/1266.md + - 1267. 统计参与通信的服务器: lc/1267.md + - 1268. 搜索推荐系统: lc/1268.md + - 1269. 停在原地的方案数: lc/1269.md + - 1270. 向公司 CEO 汇报工作的所有人: lc/1270.md + - 1271. 十六进制魔术数字: lc/1271.md + - 1272. 删除区间: lc/1272.md + - 1273. 删除树节点: lc/1273.md + - 1274. 矩形内船只的数目: lc/1274.md + - 1275. 找出井字棋的获胜者: lc/1275.md + - 1276. 不浪费原料的汉堡制作方案: lc/1276.md + - 1277. 统计全为 1 的正方形子矩阵: lc/1277.md + - 1278. 分割回文串 III: lc/1278.md + - 1279. 红绿灯路口: lc/1279.md + - 1280. 学生们参加各科测试的次数: lc/1280.md + - 1281. 整数的各位积和之差: lc/1281.md + - 1282. 用户分组: lc/1282.md + - 1283. 使结果不超过阈值的最小除数: lc/1283.md + - 1284. 转化为全零矩阵的最少反转次数: lc/1284.md + - 1285. 找到连续区间的开始和结束数字: lc/1285.md + - 1286. 字母组合迭代器: lc/1286.md + - 1287. 有序数组中出现次数超过 25%的元素: lc/1287.md + - 1288. 删除被覆盖区间: lc/1288.md + - 1289. 下降路径最小和 II: lc/1289.md + - 1290. 二进制链表转整数: lc/1290.md + - 1291. 顺次数: lc/1291.md + - 1292. 元素和小于等于阈值的正方形的最大边长: lc/1292.md + - 1293. 网格中的最短路径: lc/1293.md + - 1294. 不同国家的天气类型: lc/1294.md + - 1295. 统计位数为偶数的数字: lc/1295.md + - 1296. 划分数组为连续数字的集合: lc/1296.md + - 1297. 子串的最大出现次数: lc/1297.md + - 1298. 你能从盒子里获得的最大糖果数: lc/1298.md + - 1299. 将每个元素替换为右侧最大元素: lc/1299.md + - 1300. 转变数组后最接近目标值的数组和: lc/1300.md + - 1301. 最大得分的路径数目: lc/1301.md + - 1302. 层数最深叶子节点的和: lc/1302.md + - 1303. 求团队人数: lc/1303.md + - 1304. 和为零的 N 个不同整数: lc/1304.md + - 1305. 两棵二叉搜索树中的所有元素: lc/1305.md + - 1306. 跳跃游戏 III: lc/1306.md + - 1307. 口算难题: lc/1307.md + - 1308. 不同性别每日分数总计: lc/1308.md + - 1309. 解码字母到整数映射: lc/1309.md + - 1310. 子数组异或查询: lc/1310.md + - 1311. 获取你好友已观看的视频: lc/1311.md + - 1312. 让字符串成为回文串的最少插入次数: lc/1312.md + - 1313. 解压缩编码列表: lc/1313.md + - 1314. 矩阵区域和: lc/1314.md + - 1315. 祖父节点值为偶数的节点和: lc/1315.md + - 1316. 不同的循环子字符串: lc/1316.md + - 1317. 将整数转换为两个无零整数的和: lc/1317.md + - 1318. 或运算的最小翻转次数: lc/1318.md + - 1319. 连通网络的操作次数: lc/1319.md + - 1320. 二指输入的的最小距离: lc/1320.md + - 1321. 餐馆营业额变化增长: lc/1321.md + - 1322. 广告效果: lc/1322.md + - 1323. 6 和 9 组成的最大数字: lc/1323.md + - 1324. 竖直打印单词: lc/1324.md + - 1325. 删除给定值的叶子节点: lc/1325.md + - 1326. 灌溉花园的最少水龙头数目: lc/1326.md + - 1327. 列出指定时间段内所有的下单产品: lc/1327.md + - 1328. 破坏回文串: lc/1328.md + - 1329. 将矩阵按对角线排序: lc/1329.md + - 1330. 翻转子数组得到最大的数组值: lc/1330.md + - 1331. 数组序号转换: lc/1331.md + - 1332. 删除回文子序列: lc/1332.md + - 1333. 餐厅过滤器: lc/1333.md + - 1334. 阈值距离内邻居最少的城市: lc/1334.md + - 1335. 工作计划的最低难度: lc/1335.md + - 1336. 每次访问的交易次数: lc/1336.md + - 1337. 矩阵中战斗力最弱的 K 行: lc/1337.md + - 1338. 数组大小减半: lc/1338.md + - 1339. 分裂二叉树的最大乘积: lc/1339.md + - 1340. 跳跃游戏 V: lc/1340.md + - 1341. 电影评分: lc/1341.md + - 1342. 将数字变成 0 的操作次数: lc/1342.md + - 1343. 大小为 K 且平均值大于等于阈值的子数组数目: lc/1343.md + - 1344. 时钟指针的夹角: lc/1344.md + - 1345. 跳跃游戏 IV: lc/1345.md + - 1346. 检查整数及其两倍数是否存在: lc/1346.md + - 1347. 制造字母异位词的最小步骤数: lc/1347.md + - 1348. 推文计数: lc/1348.md + - 1349. 参加考试的最大学生数: lc/1349.md + - 1350. 院系无效的学生: lc/1350.md + - 1351. 统计有序矩阵中的负数: lc/1351.md + - 1352. 最后 K 个数的乘积: lc/1352.md + - 1353. 最多可以参加的会议数目: lc/1353.md + - 1354. 多次求和构造目标数组: lc/1354.md + - 1355. 活动参与者: lc/1355.md + - 1356. 根据数字二进制下 1 的数目排序: lc/1356.md + - 1357. 每隔 n 个顾客打折: lc/1357.md + - 1358. 包含所有三种字符的子字符串数目: lc/1358.md + - 1359. 有效的快递序列数目: lc/1359.md + - 1360. 日期之间隔几天: lc/1360.md + - 1361. 验证二叉树: lc/1361.md + - 1362. 最接近的因数: lc/1362.md + - 1363. 形成三的最大倍数: lc/1363.md + - 1364. 顾客的可信联系人数量: lc/1364.md + - 1365. 有多少小于当前数字的数字: lc/1365.md + - 1366. 通过投票对团队排名: lc/1366.md + - 1367. 二叉树中的链表: lc/1367.md + - 1368. 使网格图至少有一条有效路径的最小代价: lc/1368.md + - 1369. 获取最近第二次的活动: lc/1369.md + - 1370. 上升下降字符串: lc/1370.md + - 1371. 每个元音包含偶数次的最长子字符串: lc/1371.md + - 1372. 二叉树中的最长交错路径: lc/1372.md + - 1373. 二叉搜索子树的最大键值和: lc/1373.md + - 1374. 生成每种字符都是奇数个的字符串: lc/1374.md + - 1375. 二进制字符串前缀一致的次数: lc/1375.md + - 1376. 通知所有员工所需的时间: lc/1376.md + - 1377. T 秒后青蛙的位置: lc/1377.md + - 1378. 使用唯一标识码替换员工 ID: lc/1378.md + - 1379. 找出克隆二叉树中的相同节点: lc/1379.md + - 1380. 矩阵中的幸运数: lc/1380.md + - 1381. 设计一个支持增量操作的栈: lc/1381.md + - 1382. 将二叉搜索树变平衡: lc/1382.md + - 1383. 最大的团队表现值: lc/1383.md + - 1384. 按年度列出销售总额: lc/1384.md + - 1385. 两个数组间的距离值: lc/1385.md + - 1386. 安排电影院座位: lc/1386.md + - 1387. 将整数按权重排序: lc/1387.md + - 1388. 3n 块披萨: lc/1388.md + - 1389. 按既定顺序创建目标数组: lc/1389.md + - 1390. 四因数: lc/1390.md + - 1391. 检查网格中是否存在有效路径: lc/1391.md + - 1392. 最长快乐前缀: lc/1392.md + - 1393. 股票的资本损益: lc/1393.md + - 1394. 找出数组中的幸运数: lc/1394.md + - 1395. 统计作战单位数: lc/1395.md + - 1396. 设计地铁系统: lc/1396.md + - 1397. 找到所有好字符串: lc/1397.md + - 1398. 购买了产品 A 和产品 B 却没有购买产品 C 的顾客: lc/1398.md + - 1399. 统计最大组的数目: lc/1399.md + - 1400. 构造 K 个回文字符串: lc/1400.md + - 1401. 圆和矩形是否有重叠: lc/1401.md + - 1402. 做菜顺序: lc/1402.md + - 1403. 非递增顺序的最小子序列: lc/1403.md + - 1404. 将二进制表示减到 1 的步骤数: lc/1404.md + - 1405. 最长快乐字符串: lc/1405.md + - 1406. 石子游戏 III: lc/1406.md + - 1407. 排名靠前的旅行者: lc/1407.md + - 1408. 数组中的字符串匹配: lc/1408.md + - 1409. 查询带键的排列: lc/1409.md + - 1410. HTML 实体解析器: lc/1410.md + - 1411. 给 N x 3 网格图涂色的方案数: lc/1411.md + - 1412. 查找成绩处于中游的学生: lc/1412.md + - 1413. 逐步求和得到正数的最小值: lc/1413.md + - 1414. 和为 K 的最少斐波那契数字数目: lc/1414.md + - 1415. 长度为 n 的开心字符串中字典序第 k 小的字符串: lc/1415.md + - 1416. 恢复数组: lc/1416.md + - 1417. 重新格式化字符串: lc/1417.md + - 1418. 点菜展示表: lc/1418.md + - 1419. 数青蛙: lc/1419.md + - 1420. 生成数组: lc/1420.md + - 1421. 净现值查询: lc/1421.md + - 1422. 分割字符串的最大得分: lc/1422.md + - 1423. 可获得的最大点数: lc/1423.md + - 1424. 对角线遍历 II: lc/1424.md + - 1425. 带限制的子序列和: lc/1425.md + - 1426. 数元素: lc/1426.md + - 1427. 字符串的左右移: lc/1427.md + - 1428. 至少有一个 1 的最左端列: lc/1428.md + - 1429. 第一个唯一数字: lc/1429.md + - 1430. 判断给定的序列是否是二叉树从根到叶的路径: lc/1430.md + - 1431. 拥有最多糖果的孩子: lc/1431.md + - 1432. 改变一个整数能得到的最大差值: lc/1432.md + - 1433. 检查一个字符串是否可以打破另一个字符串: lc/1433.md + - 1434. 每个人戴不同帽子的方案数: lc/1434.md + - 1435. 制作会话柱状图: lc/1435.md + - 1436. 旅行终点站: lc/1436.md + - 1437. 是否所有 1 都至少相隔 k 个元素: lc/1437.md + - 1438. 绝对差不超过限制的最长连续子数组: lc/1438.md + - 1439. 有序矩阵中的第 k 个最小数组和: lc/1439.md + - 1440. 计算布尔表达式的值: lc/1440.md + - 1441. 用栈操作构建数组: lc/1441.md + - 1442. 形成两个异或相等数组的三元组数目: lc/1442.md + - 1443. 收集树上所有苹果的最少时间: lc/1443.md + - 1444. 切披萨的方案数: lc/1444.md + - 1445. 苹果和桔子: lc/1445.md + - 1446. 连续字符: lc/1446.md + - 1447. 最简分数: lc/1447.md + - 1448. 统计二叉树中好节点的数目: lc/1448.md + - 1449. 数位成本和为目标值的最大数字: lc/1449.md + - 1450. 在既定时间做作业的学生人数: lc/1450.md + - 1451. 重新排列句子中的单词: lc/1451.md + - 1452. 收藏清单: lc/1452.md + - 1453. 圆形靶内的最大飞镖数量: lc/1453.md + - 1454. 活跃用户: lc/1454.md + - 1455. 检查单词是否为句中其他单词的前缀: lc/1455.md + - 1456. 定长子串中元音的最大数目: lc/1456.md + - 1457. 二叉树中的伪回文路径: lc/1457.md + - 1458. 两个子序列的最大点积: lc/1458.md + - 1459. 矩形面积: lc/1459.md + - 1460. 通过翻转子数组使两个数组相等: lc/1460.md + - 1461. 检查一个字符串是否包含所有长度为 K 的二进制子串: lc/1461.md + - 1462. 课程表 IV: lc/1462.md + - 1463. 摘樱桃 II: lc/1463.md + - 1464. 数组中两元素的最大乘积: lc/1464.md + - 1465. 切割后面积最大的蛋糕: lc/1465.md + - 1466. 重新规划路线: lc/1466.md + - 1467. 两个盒子中球的颜色数相同的概率: lc/1467.md + - 1468. 计算税后工资: lc/1468.md + - 1469. 寻找所有的独生节点: lc/1469.md + - 1470. 重新排列数组: lc/1470.md + - 1471. 数组中的 k 个最强值: lc/1471.md + - 1472. 设计浏览器历史记录: lc/1472.md + - 1473. 粉刷房子 III: lc/1473.md + - 1474. 删除链表 M 个节点之后的 N 个节点: lc/1474.md + - 1475. 商品折扣后的最终价格: lc/1475.md + - 1476. 子矩形查询: lc/1476.md + - 1477. 找两个和为目标值且不重叠的子数组: lc/1477.md + - 1478. 安排邮筒: lc/1478.md + - 1479. 周内每天的销售情况: lc/1479.md + - 1480. 一维数组的动态和: lc/1480.md + - 1481. 不同整数的最少数目: lc/1481.md + - 1482. 制作 m 束花所需的最少天数: lc/1482.md + - 1483. 树节点的第 K 个祖先: lc/1483.md + - 1484. 按日期分组销售产品: lc/1484.md + - 1485. 克隆含随机指针的二叉树: lc/1485.md + - 1486. 数组异或操作: lc/1486.md + - 1487. 保证文件名唯一: lc/1487.md + - 1488. 避免洪水泛滥: lc/1488.md + - 1489. 找到最小生成树里的关键边和伪关键边: lc/1489.md + - 1490. 克隆 N 叉树: lc/1490.md + - 1491. 去掉最低工资和最高工资后的工资平均值: lc/1491.md + - 1492. n 的第 k 个因子: lc/1492.md + - 1493. 删掉一个元素以后全为 1 的最长子数组: lc/1493.md + - 1494. 并行课程 II: lc/1494.md + - 1495. 上月播放的儿童适宜电影: lc/1495.md + - 1496. 判断路径是否相交: lc/1496.md + - 1497. 检查数组对是否可以被 k 整除: lc/1497.md + - 1498. 满足条件的子序列数目: lc/1498.md + - 1499. 满足不等式的最大值: lc/1499.md + - 1500. 设计文件分享系统: lc/1500.md + - 1501. 可以放心投资的国家: lc/1501.md + - 1502. 判断能否形成等差数列: lc/1502.md + - 1503. 所有蚂蚁掉下来前的最后一刻: lc/1503.md + - 1504. 统计全 1 子矩形: lc/1504.md + - 1505. 最多 K 次交换相邻数位后得到的最小整数: lc/1505.md + - 1506. 找到 N 叉树的根节点: lc/1506.md + - 1507. 转变日期格式: lc/1507.md + - 1508. 子数组和排序后的区间和: lc/1508.md + - 1509. 三次操作后最大值与最小值的最小差: lc/1509.md + - 1510. 石子游戏 IV: lc/1510.md + - 1511. 消费者下单频率: lc/1511.md + - 1512. 好数对的数目: lc/1512.md + - 1513. 仅含 1 的子串数: lc/1513.md + - 1514. 概率最大的路径: lc/1514.md + - 1515. 服务中心的最佳位置: lc/1515.md + - 1516. 移动 N 叉树的子树: lc/1516.md + - 1517. 查找拥有有效邮箱的用户: lc/1517.md + - 1518. 换水问题: lc/1518.md + - 1519. 子树中标签相同的节点数: lc/1519.md + - 1520. 最多的不重叠子字符串: lc/1520.md + - 1521. 找到最接近目标值的函数值: lc/1521.md + - 1522. N 叉树的直径: lc/1522.md + - 1523. 在区间范围内统计奇数数目: lc/1523.md + - 1524. 和为奇数的子数组数目: lc/1524.md + - 1525. 字符串的好分割数目: lc/1525.md + - 1526. 形成目标数组的子数组最少增加次数: lc/1526.md + - 1527. 患某种疾病的患者: lc/1527.md + - 1528. 重新排列字符串: lc/1528.md + - 1529. 最少的后缀翻转次数: lc/1529.md + - 1530. 好叶子节点对的数量: lc/1530.md + - 1531. 压缩字符串 II: lc/1531.md + - 1532. 最近的三笔订单: lc/1532.md + - 1533. 找到最大整数的索引: lc/1533.md + - 1534. 统计好三元组: lc/1534.md + - 1535. 找出数组游戏的赢家: lc/1535.md + - 1536. 排布二进制网格的最少交换次数: lc/1536.md + - 1537. 最大得分: lc/1537.md + - 1538. 找出隐藏数组中出现次数最多的元素: lc/1538.md + - 1539. 第 k 个缺失的正整数: lc/1539.md + - 1540. K 次操作转变字符串: lc/1540.md + - 1541. 平衡括号字符串的最少插入次数: lc/1541.md + - 1542. 找出最长的超赞子字符串: lc/1542.md + - 1543. 产品名称格式修复: lc/1543.md + - 1544. 整理字符串: lc/1544.md + - 1545. 找出第 N 个二进制字符串中的第 K 位: lc/1545.md + - 1546. 和为目标值且不重叠的非空子数组的最大数目: lc/1546.md + - 1547. 切棍子的最小成本: lc/1547.md + - 1548. 图中最相似的路径: lc/1548.md + - 1549. 每件商品的最新订单: lc/1549.md + - 1550. 存在连续三个奇数的数组: lc/1550.md + - 1551. 使数组中所有元素相等的最小操作数: lc/1551.md + - 1552. 两球之间的磁力: lc/1552.md + - 1553. 吃掉 N 个橘子的最少天数: lc/1553.md + - 1554. 只有一个不同字符的字符串: lc/1554.md + - 1555. 银行账户概要: lc/1555.md + - 1556. 千位分隔数: lc/1556.md + - 1557. 可以到达所有点的最少点数目: lc/1557.md + - 1558. 得到目标数组的最少函数调用次数: lc/1558.md + - 1559. 二维网格图中探测环: lc/1559.md + - 1560. 圆形赛道上经过次数最多的扇区: lc/1560.md + - 1561. 你可以获得的最大硬币数目: lc/1561.md + - 1562. 查找大小为 M 的最新分组: lc/1562.md + - 1563. 石子游戏 V: lc/1563.md + - 1564. 把箱子放进仓库里 I: lc/1564.md + - 1565. 按月统计订单数与顾客数: lc/1565.md + - 1566. 重复至少 K 次且长度为 M 的模式: lc/1566.md + - 1567. 乘积为正数的最长子数组长度: lc/1567.md + - 1568. 使陆地分离的最少天数: lc/1568.md + - 1569. 将子数组重新排序得到同一个二叉搜索树的方案数: lc/1569.md + - 1570. 两个稀疏向量的点积: lc/1570.md + - 1571. 仓库经理: lc/1571.md + - 1572. 矩阵对角线元素的和: lc/1572.md + - 1573. 分割字符串的方案数: lc/1573.md + - 1574. 删除最短的子数组使剩余数组有序: lc/1574.md + - 1575. 统计所有可行路径: lc/1575.md + - 1576. 替换所有的问号: lc/1576.md + - 1577. 数的平方等于两数乘积的方法数: lc/1577.md + - 1578. 使绳子变成彩色的最短时间: lc/1578.md + - 1579. 保证图可完全遍历: lc/1579.md + - 1580. 把箱子放进仓库里 II: lc/1580.md + - 1581. 进店却未进行过交易的顾客: lc/1581.md + - 1582. 二进制矩阵中的特殊位置: lc/1582.md + - 1583. 统计不开心的朋友: lc/1583.md + - 1584. 连接所有点的最小费用: lc/1584.md + - 1585. 检查字符串是否可以通过排序子字符串得到另一个字符串: lc/1585.md + - 1586. 二叉搜索树迭代器 II: lc/1586.md + - 1587. 银行账户概要 II: lc/1587.md + - 1588. 所有奇数长度子数组的和: lc/1588.md + - 1589. 所有排列中的最大和: lc/1589.md + - 1590. 使数组和能被 P 整除: lc/1590.md + - 1591. 奇怪的打印机 II: lc/1591.md + - 1592. 重新排列单词间的空格: lc/1592.md + - 1593. 拆分字符串使唯一子字符串的数目最大: lc/1593.md + - 1594. 矩阵的最大非负积: lc/1594.md + - 1595. 连通两组点的最小成本: lc/1595.md + - 1596. 每位顾客最经常订购的商品: lc/1596.md + - 1597. 根据中缀表达式构造二叉表达式树: lc/1597.md + - 1598. 文件夹操作日志搜集器: lc/1598.md + - 1599. 经营摩天轮的最大利润: lc/1599.md + - 1600. 王位继承顺序: lc/1600.md + - 1601. 最多可达成的换楼请求数目: lc/1601.md + - 1602. 找到二叉树中最近的右侧节点: lc/1602.md + - 1603. 设计停车系统: lc/1603.md + - 1604. 警告一小时内使用相同员工卡大于等于三次的人: lc/1604.md + - 1605. 给定行和列的和求可行矩阵: lc/1605.md + - 1606. 找到处理最多请求的服务器: lc/1606.md + - 1607. 没有卖出的卖家: lc/1607.md + - 1608. 特殊数组的特征值: lc/1608.md + - 1609. 奇偶树: lc/1609.md + - 1610. 可见点的最大数目: lc/1610.md + - 1611. 使整数变为 0 的最少操作次数: lc/1611.md + - 1612. 检查两棵二叉表达式树是否等价: lc/1612.md + - 1613. 找到遗失的 ID: lc/1613.md + - 1614. 括号的最大嵌套深度: lc/1614.md + - 1615. 最大网络秩: lc/1615.md + - 1616. 分割两个字符串得到回文串: lc/1616.md + - 1617. 统计子树中城市之间最大距离: lc/1617.md + - 1618. 找出适应屏幕的最大字号: lc/1618.md + - 1619. 删除某些元素后的数组均值: lc/1619.md + - 1620. 网络信号最好的坐标: lc/1620.md + - 1621. 大小为 K 的不重叠线段的数目: lc/1621.md + - 1622. 奇妙序列: lc/1622.md + - 1623. 三人国家代表队: lc/1623.md + - 1624. 两个相同字符之间的最长子字符串: lc/1624.md + - 1625. 执行操作后字典序最小的字符串: lc/1625.md + - 1626. 无矛盾的最佳球队: lc/1626.md + - 1627. 带阈值的图连通性: lc/1627.md + - 1628. 设计带解析函数的表达式树: lc/1628.md + - 1629. 按键持续时间最长的键: lc/1629.md + - 1630. 等差子数组: lc/1630.md + - 1631. 最小体力消耗路径: lc/1631.md + - 1632. 矩阵转换后的秩: lc/1632.md + - 1633. 各赛事的用户注册率: lc/1633.md + - 1634. 求两个多项式链表的和: lc/1634.md + - 1635. Hopper 公司查询 I: lc/1635.md + - 1636. 按照频率将数组升序排序: lc/1636.md + - 1637. 两点之间不包含任何点的最宽垂直区域: lc/1637.md + - 1638. 统计只差一个字符的子串数目: lc/1638.md + - 1639. 通过给定词典构造目标字符串的方案数: lc/1639.md + - 1640. 能否连接形成数组: lc/1640.md + - 1641. 统计字典序元音字符串的数目: lc/1641.md + - 1642. 可以到达的最远建筑: lc/1642.md + - 1643. 第 K 条最小指令: lc/1643.md + - 1644. 二叉树的最近公共祖先 II: lc/1644.md + - 1645. Hopper 公司查询 II: lc/1645.md + - 1646. 获取生成数组中的最大值: lc/1646.md + - 1647. 字符频次唯一的最小删除次数: lc/1647.md + - 1648. 销售价值减少的颜色球: lc/1648.md + - 1649. 通过指令创建有序数组: lc/1649.md + - 1650. 二叉树的最近公共祖先 III: lc/1650.md + - 1651. Hopper 公司查询 III: lc/1651.md + - 1652. 拆炸弹: lc/1652.md + - 1653. 使字符串平衡的最少删除次数: lc/1653.md + - 1654. 到家的最少跳跃次数: lc/1654.md + - 1655. 分配重复整数: lc/1655.md + - 1656. 设计有序流: lc/1656.md + - 1657. 确定两个字符串是否接近: lc/1657.md + - 1658. 将 x 减到 0 的最小操作数: lc/1658.md + - 1659. 最大化网格幸福感: lc/1659.md + - 1660. 纠正二叉树: lc/1660.md + - 1661. 每台机器的进程平均运行时间: lc/1661.md + - 1662. 检查两个字符串数组是否相等: lc/1662.md + - 1663. 具有给定数值的最小字符串: lc/1663.md + - 1664. 生成平衡数组的方案数: lc/1664.md + - 1665. 完成所有任务的最少初始能量: lc/1665.md + - 1666. 改变二叉树的根节点: lc/1666.md + - 1667. 修复表中的名字: lc/1667.md + - 1668. 最大重复子字符串: lc/1668.md + - 1669. 合并两个链表: lc/1669.md + - 1670. 设计前中后队列: lc/1670.md + - 1671. 得到山形数组的最少删除次数: lc/1671.md + - 1672. 最富有客户的资产总量: lc/1672.md + - 1673. 找出最具竞争力的子序列: lc/1673.md + - 1674. 使数组互补的最少操作次数: lc/1674.md + - 1675. 数组的最小偏移量: lc/1675.md + - 1676. 二叉树的最近公共祖先 IV: lc/1676.md + - 1677. 发票中的产品金额: lc/1677.md + - 1678. 设计 Goal 解析器: lc/1678.md + - 1679. K 和数对的最大数目: lc/1679.md + - 1680. 连接连续二进制数字: lc/1680.md + - 1681. 最小不兼容性: lc/1681.md + - 1682. 最长回文子序列 II: lc/1682.md + - 1683. 无效的推文: lc/1683.md + - 1684. 统计一致字符串的数目: lc/1684.md + - 1685. 有序数组中差绝对值之和: lc/1685.md + - 1686. 石子游戏 VI: lc/1686.md + - 1687. 从仓库到码头运输箱子: lc/1687.md + - 1688. 比赛中的配对次数: lc/1688.md + - 1689. 十-二进制数的最少数目: lc/1689.md + - 1690. 石子游戏 VII: lc/1690.md + - 1691. 堆叠长方体的最大高度: lc/1691.md + - 1692. 计算分配糖果的不同方式: lc/1692.md + - 1693. 每天的领导和合伙人: lc/1693.md + - 1694. 重新格式化电话号码: lc/1694.md + - 1695. 删除子数组的最大得分: lc/1695.md + - 1696. 跳跃游戏 VI: lc/1696.md + - 1697. 检查边长度限制的路径是否存在: lc/1697.md + - 1698. 字符串的不同子字符串个数: lc/1698.md + - 1699. 两人之间的通话次数: lc/1699.md + - 1700. 无法吃午餐的学生数量: lc/1700.md + - 1701. 平均等待时间: lc/1701.md + - 1702. 修改后的最大二进制字符串: lc/1702.md + - 1703. 得到连续 K 个 1 的最少相邻交换次数: lc/1703.md + - 1704. 判断字符串的两半是否相似: lc/1704.md + - 1705. 吃苹果的最大数目: lc/1705.md + - 1706. 球会落何处: lc/1706.md + - 1707. 与数组中元素的最大异或值: lc/1707.md + - 1708. 长度为 K 的最大子数组: lc/1708.md + - 1709. 访问日期之间最大的空档期: lc/1709.md + - 1710. 卡车上的最大单元数: lc/1710.md + - 1711. 大餐计数: lc/1711.md + - 1712. 将数组分成三个子数组的方案数: lc/1712.md + - 1713. 得到子序列的最少操作次数: lc/1713.md + - 1714. 数组中特殊等间距元素的和: lc/1714.md + - 1715. 苹果和橘子的个数: lc/1715.md + - 1716. 计算力扣银行的钱: lc/1716.md + - 1717. 删除子字符串的最大得分: lc/1717.md + - 1718. 构建字典序最大的可行序列: lc/1718.md + - 1719. 重构一棵树的方案数: lc/1719.md + - 1720. 解码异或后的数组: lc/1720.md + - 1721. 交换链表中的节点: lc/1721.md + - 1722. 执行交换操作后的最小汉明距离: lc/1722.md + - 1723. 完成所有工作的最短时间: lc/1723.md + - 1724. 检查边长度限制的路径是否存在 II: lc/1724.md + - 1725. 可以形成最大正方形的矩形数目: lc/1725.md + - 1726. 同积元组: lc/1726.md + - 1727. 重新排列后的最大子矩阵: lc/1727.md + - 1728. 猫和老鼠 II: lc/1728.md + - 1729. 求关注者的数量: lc/1729.md + - 1730. 获取食物的最短路径: lc/1730.md + - 1731. 每位经理的下属员工数量: lc/1731.md + - 1732. 找到最高海拔: lc/1732.md + - 1733. 需要教语言的最少人数: lc/1733.md + - 1734. 解码异或后的排列: lc/1734.md + - 1735. 生成乘积数组的方案数: lc/1735.md + - 1736. 替换隐藏数字得到的最晚时间: lc/1736.md + - 1737. 满足三条件之一需改变的最少字符数: lc/1737.md + - 1738. 找出第 K 大的异或坐标值: lc/1738.md + - 1739. 放置盒子: lc/1739.md + - 1740. 找到二叉树中的距离: lc/1740.md + - 1741. 查找每个员工花费的总时间: lc/1741.md + - 1742. 盒子中小球的最大数量: lc/1742.md + - 1743. 从相邻元素对还原数组: lc/1743.md + - 1744. 你能在你最喜欢的那天吃到你最喜欢的糖果吗？: lc/1744.md + - 1745. 分割回文串 IV: lc/1745.md + - 1746. 经过一次操作后的最大子数组和: lc/1746.md + - 1747. 应该被禁止的 Leetflex 账户: lc/1747.md + - 1748. 唯一元素的和: lc/1748.md + - 1749. 任意子数组和的绝对值的最大值: lc/1749.md + - 1750. 删除字符串两端相同字符后的最短长度: lc/1750.md + - 1751. 最多可以参加的会议数目 II: lc/1751.md + - 1752. 检查数组是否经排序和轮转得到: lc/1752.md + - 1753. 移除石子的最大得分: lc/1753.md + - 1754. 构造字典序最大的合并字符串: lc/1754.md + - 1755. 最接近目标值的子序列和: lc/1755.md + - 1756. 设计最近使用（MRU）队列: lc/1756.md + - 1757. 可回收且低脂的产品: lc/1757.md + - 1758. 生成交替二进制字符串的最少操作数: lc/1758.md + - 1759. 统计同质子字符串的数目: lc/1759.md + - 1760. 袋子里最少数目的球: lc/1760.md + - 1761. 一个图中连通三元组的最小度数: lc/1761.md + - 1762. 能看到海景的建筑物: lc/1762.md + - 1763. 最长的美好子字符串: lc/1763.md + - 1764. 通过连接另一个数组的子数组得到一个数组: lc/1764.md + - 1765. 地图中的最高点: lc/1765.md + - 1766. 互质树: lc/1766.md + - 1767. 寻找没有被执行的任务对: lc/1767.md + - 1768. 交替合并字符串: lc/1768.md + - 1769. 移动所有球到每个盒子所需的最小操作数: lc/1769.md + - 1770. 执行乘法运算的最大分数: lc/1770.md + - 1771. 由子序列构造的最长回文串的长度: lc/1771.md + - 1772. 按受欢迎程度排列功能: lc/1772.md + - 1773. 统计匹配检索规则的物品数量: lc/1773.md + - 1774. 最接近目标价格的甜点成本: lc/1774.md + - 1775. 通过最少操作次数使数组的和相等: lc/1775.md + - 1776. 车队 II: lc/1776.md + - 1777. 每家商店的产品价格: lc/1777.md + - 1778. 未知网格中的最短路径: lc/1778.md + - 1779. 找到最近的有相同 X 或 Y 坐标的点: lc/1779.md + - 1780. 判断一个数字是否可以表示成三的幂的和: lc/1780.md + - 1781. 所有子字符串美丽值之和: lc/1781.md + - 1782. 统计点对的数目: lc/1782.md + - 1783. 大满贯数量: lc/1783.md + - 1784. 检查二进制字符串字段: lc/1784.md + - 1785. 构成特定和需要添加的最少元素: lc/1785.md + - 1786. 从第一个节点出发到最后一个节点的受限路径数: lc/1786.md + - 1787. 使所有区间的异或结果为零: lc/1787.md + - 1788. 最大化花园的美观度: lc/1788.md + - 1789. 员工的直属部门: lc/1789.md + - 1790. 仅执行一次字符串交换能否使两个字符串相等: lc/1790.md + - 1791. 找出星型图的中心节点: lc/1791.md + - 1792. 最大平均通过率: lc/1792.md + - 1793. 好子数组的最大分数: lc/1793.md + - 1794. 统计距离最小的子串对个数: lc/1794.md + - 1795. 每个产品在不同商店的价格: lc/1795.md + - 1796. 字符串中第二大的数字: lc/1796.md + - 1797. 设计一个验证系统: lc/1797.md + - 1798. 你能构造出连续值的最大数目: lc/1798.md + - 1799. N 次操作后的最大分数和: lc/1799.md + - 1800. 最大升序子数组和: lc/1800.md + - 1801. 积压订单中的订单总数: lc/1801.md + - 1802. 有界数组中指定下标处的最大值: lc/1802.md + - 1803. 统计异或值在范围内的数对有多少: lc/1803.md + - 1804. 实现 Trie （前缀树） II: lc/1804.md + - 1805. 字符串中不同整数的数目: lc/1805.md + - 1806. 还原排列的最少操作步数: lc/1806.md + - 1807. 替换字符串中的括号内容: lc/1807.md + - 1808. 好因子的最大数目: lc/1808.md + - 1809. 没有广告的剧集: lc/1809.md + - 1810. 隐藏网格下的最小消耗路径: lc/1810.md + - 1811. 寻找面试候选人: lc/1811.md + - 1812. 判断国际象棋棋盘中一个格子的颜色: lc/1812.md + - 1813. 句子相似性 III: lc/1813.md + - 1814. 统计一个数组中好对子的数目: lc/1814.md + - 1815. 得到新鲜甜甜圈的最多组数: lc/1815.md + - 1816. 截断句子: lc/1816.md + - 1817. 查找用户活跃分钟数: lc/1817.md + - 1818. 绝对差值和: lc/1818.md + - 1819. 序列中不同最大公约数的数目: lc/1819.md + - 1820. 最多邀请的个数: lc/1820.md + - 1821. 寻找今年具有正收入的客户: lc/1821.md + - 1822. 数组元素积的符号: lc/1822.md + - 1823. 找出游戏的获胜者: lc/1823.md + - 1824. 最少侧跳次数: lc/1824.md + - 1825. 求出 MK 平均值: lc/1825.md + - 1826. 有缺陷的传感器: lc/1826.md + - 1827. 最少操作使数组递增: lc/1827.md + - 1828. 统计一个圆中点的数目: lc/1828.md + - 1829. 每个查询的最大异或值: lc/1829.md + - 1830. 使字符串有序的最少操作次数: lc/1830.md + - 1831. 每天的最大交易: lc/1831.md + - 1832. 判断句子是否为全字母句: lc/1832.md + - 1833. 雪糕的最大数量: lc/1833.md + - 1834. 单线程 CPU: lc/1834.md + - 1835. 所有数对按位与结果的异或和: lc/1835.md + - 1836. 从未排序的链表中移除重复元素: lc/1836.md + - 1837. K 进制表示下的各位数字总和: lc/1837.md + - 1838. 最高频元素的频数: lc/1838.md + - 1839. 所有元音按顺序排布的最长子字符串: lc/1839.md + - 1840. 最高建筑高度: lc/1840.md + - 1841. 联赛信息统计: lc/1841.md + - 1842. 下个由相同数字构成的回文串: lc/1842.md + - 1843. 可疑银行账户: lc/1843.md + - 1844. 将所有数字用字符替换: lc/1844.md + - 1845. 座位预约管理系统: lc/1845.md + - 1846. 减小和重新排列数组后的最大元素: lc/1846.md + - 1847. 最近的房间: lc/1847.md + - 1848. 到目标元素的最小距离: lc/1848.md + - 1849. 将字符串拆分为递减的连续值: lc/1849.md + - 1850. 邻位交换的最小次数: lc/1850.md + - 1851. 包含每个查询的最小区间: lc/1851.md + - 1852. 每个子数组的数字种类数: lc/1852.md + - 1853. 转换日期格式: lc/1853.md + - 1854. 人口最多的年份: lc/1854.md + - 1855. 下标对中的最大距离: lc/1855.md + - 1856. 子数组最小乘积的最大值: lc/1856.md + - 1857. 有向图中最大颜色值: lc/1857.md + - 1858. 包含所有前缀的最长单词: lc/1858.md + - 1859. 将句子排序: lc/1859.md + - 1860. 增长的内存泄露: lc/1860.md + - 1861. 旋转盒子: lc/1861.md + - 1862. 向下取整数对和: lc/1862.md + - 1863. 找出所有子集的异或总和再求和: lc/1863.md + - 1864. 构成交替字符串需要的最小交换次数: lc/1864.md + - 1865. 找出和为指定值的下标对: lc/1865.md + - 1866. 恰有 K 根木棍可以看到的排列数目: lc/1866.md + - 1867. 最大数量高于平均水平的订单: lc/1867.md + - 1868. 两个行程编码数组的积: lc/1868.md + - 1869. 哪种连续子字符串更长: lc/1869.md + - 1870. 准时到达的列车最小时速: lc/1870.md + - 1871. 跳跃游戏 VII: lc/1871.md + - 1872. 石子游戏 VIII: lc/1872.md + - 1873. 计算特殊奖金: lc/1873.md + - 1874. 两个数组的最小乘积和: lc/1874.md + - 1875. 将工资相同的雇员分组: lc/1875.md + - 1876. 长度为三且各字符不同的子字符串: lc/1876.md + - 1877. 数组中最大数对和的最小值: lc/1877.md + - 1878. 矩阵中最大的三个菱形和: lc/1878.md + - 1879. 两个数组最小的异或值之和: lc/1879.md + - 1880. 检查某单词是否等于两单词之和: lc/1880.md + - 1881. 插入后的最大值: lc/1881.md + - 1882. 使用服务器处理任务: lc/1882.md + - 1883. 准时抵达会议现场的最小跳过休息次数: lc/1883.md + - 1884. 鸡蛋掉落-两枚鸡蛋: lc/1884.md + - 1885. 统计数对: lc/1885.md + - 1886. 判断矩阵经轮转后是否一致: lc/1886.md + - 1887. 使数组元素相等的减少操作次数: lc/1887.md + - 1888. 使二进制字符串字符交替的最少反转次数: lc/1888.md + - 1889. 装包裹的最小浪费空间: lc/1889.md + - 1890. 2020 年最后一次登录: lc/1890.md + - 1891. 割绳子: lc/1891.md + - 1892. 页面推荐 Ⅱ: lc/1892.md + - 1893. 检查是否区域内所有整数都被覆盖: lc/1893.md + - 1894. 找到需要补充粉笔的学生编号: lc/1894.md + - 1895. 最大的幻方: lc/1895.md + - 1896. 反转表达式值的最少操作次数: lc/1896.md + - 1897. 重新分配字符使所有字符串都相等: lc/1897.md + - 1898. 可移除字符的最大数目: lc/1898.md + - 1899. 合并若干三元组以形成目标三元组: lc/1899.md + - 1900. 最佳运动员的比拼回合: lc/1900.md + - 1901. 寻找峰值 II: lc/1901.md + - 1902. 给定二叉搜索树的插入顺序求深度: lc/1902.md + - 1903. 字符串中的最大奇数: lc/1903.md + - 1904. 你完成的完整对局数: lc/1904.md + - 1905. 统计子岛屿: lc/1905.md + - 1906. 查询差绝对值的最小值: lc/1906.md + - 1907. 按分类统计薪水: lc/1907.md + - 1908. Nim 游戏 II: lc/1908.md + - 1909. 删除一个元素使数组严格递增: lc/1909.md + - 1910. 删除一个字符串中所有出现的给定子字符串: lc/1910.md + - 1911. 最大子序列交替和: lc/1911.md + - 1912. 设计电影租借系统: lc/1912.md + - 1913. 两个数对之间的最大乘积差: lc/1913.md + - 1914. 循环轮转矩阵: lc/1914.md + - 1915. 最美子字符串的数目: lc/1915.md + - 1916. 统计为蚁群构筑房间的不同顺序: lc/1916.md + - 1917. Leetcodify 好友推荐: lc/1917.md + - 1918. 第 K 小的子数组和·: lc/1918.md + - 1919. 兴趣相同的朋友: lc/1919.md + - 1920. 基于排列构建数组: lc/1920.md + - 1921. 消灭怪物的最大数量: lc/1921.md + - 1922. 统计好数字的数目: lc/1922.md + - 1923. 最长公共子路径: lc/1923.md + - 1924. 安装栅栏 II: lc/1924.md + - 1925. 统计平方和三元组的数目: lc/1925.md + - 1926. 迷宫中离入口最近的出口: lc/1926.md + - 1927. 求和游戏: lc/1927.md + - 1928. 规定时间内到达终点的最小花费: lc/1928.md + - 1929. 数组串联: lc/1929.md + - 1930. 长度为 3 的不同回文子序列: lc/1930.md + - 1931. 用三种不同颜色为网格涂色: lc/1931.md + - 1932. 合并多棵二叉搜索树: lc/1932.md + - 1933. 判断字符串是否可分解为值均等的子串: lc/1933.md + - 1934. 确认率: lc/1934.md + - 1935. 可以输入的最大单词数: lc/1935.md + - 1936. 新增的最少台阶数: lc/1936.md + - 1937. 扣分后的最大得分: lc/1937.md + - 1938. 查询最大基因差: lc/1938.md + - 1939. 主动请求确认消息的用户: lc/1939.md + - 1940. 排序数组之间的最长公共子序列: lc/1940.md + - 1941. 检查是否所有字符出现次数相同: lc/1941.md + - 1942. 最小未被占据椅子的编号: lc/1942.md + - 1943. 描述绘画结果: lc/1943.md + - 1944. 队列中可以看到的人数: lc/1944.md + - 1945. 字符串转化后的各位数字之和: lc/1945.md + - 1946. 子字符串突变后可能得到的最大整数: lc/1946.md + - 1947. 最大兼容性评分和: lc/1947.md + - 1948. 删除系统中的重复文件夹: lc/1948.md + - 1949. 坚定的友谊: lc/1949.md + - 1950. 所有子数组最小值中的最大值: lc/1950.md + - 1951. 查询具有最多共同关注者的所有两两结对组: lc/1951.md + - 1952. 三除数: lc/1952.md + - 1953. 你可以工作的最大周数: lc/1953.md + - 1954. 收集足够苹果的最小花园周长: lc/1954.md + - 1955. 统计特殊子序列的数目: lc/1955.md + - 1956. 感染 K 种病毒所需的最短时间: lc/1956.md + - 1957. 删除字符使字符串变好: lc/1957.md + - 1958. 检查操作是否合法: lc/1958.md + - 1959. K 次调整数组大小浪费的最小总空间: lc/1959.md + - 1960. 两个回文子字符串长度的最大乘积: lc/1960.md + - 1961. 检查字符串是否为数组前缀: lc/1961.md + - 1962. 移除石子使总数最小: lc/1962.md + - 1963. 使字符串平衡的最小交换次数: lc/1963.md + - 1964. 找出到每个位置为止最长的有效障碍赛跑路线: lc/1964.md + - 1965. 丢失信息的雇员: lc/1965.md + - 1966. 未排序数组中的可被二分搜索的数: lc/1966.md + - 1967. 作为子字符串出现在单词中的字符串数目: lc/1967.md + - 1968. 构造元素不等于两相邻元素平均值的数组: lc/1968.md + - 1969. 数组元素的最小非零乘积: lc/1969.md + - 1970. 你能穿过矩阵的最后一天: lc/1970.md + - 1971. 寻找图中是否存在路径: lc/1971.md + - 1972. 同一天的第一个电话和最后一个电话: lc/1972.md + - 1973. 值等于子节点值之和的节点数量: lc/1973.md + - 1974. 使用特殊打字机键入单词的最少时间: lc/1974.md + - 1975. 最大方阵和: lc/1975.md + - 1976. 到达目的地的方案数: lc/1976.md + - 1977. 划分数字的方案数: lc/1977.md + - 1978. 上级经理已离职的公司员工: lc/1978.md + - 1979. 找出数组的最大公约数: lc/1979.md + - 1980. 找出不同的二进制字符串: lc/1980.md + - 1981. 最小化目标值与所选元素的差: lc/1981.md + - 1982. 从子集的和还原数组: lc/1982.md + - 1983. 范围和相等的最宽索引对: lc/1983.md + - 1984. 学生分数的最小差值: lc/1984.md + - 1985. 找出数组中的第 K 大整数: lc/1985.md + - 1986. 完成任务的最少工作时间段: lc/1986.md + - 1987. 不同的好子序列数目: lc/1987.md + - 1988. 找出每所学校的最低分数要求: lc/1988.md + - 1989. 捉迷藏中可捕获的最大人数: lc/1989.md + - 1990. 统计实验的数量: lc/1990.md + - 1991. 找到数组的中间位置: lc/1991.md + - 1992. 找到所有的农场组: lc/1992.md + - 1993. 树上的操作: lc/1993.md + - 1994. 好子集的数目: lc/1994.md + - 1995. 统计特殊四元组: lc/1995.md + - 1996. 游戏中弱角色的数量: lc/1996.md + - 1997. 访问完所有房间的第一天: lc/1997.md + - 1998. 数组的最大公因数排序: lc/1998.md + - 1999. 最小的仅由两个数组成的倍数: lc/1999.md + - 2000. 反转单词前缀: lc/2000.md + - 2001. 可互换矩形的组数: lc/2001.md + - 2002. 两个回文子序列长度的最大乘积: lc/2002.md + - 2003. 每棵子树内缺失的最小基因值: lc/2003.md + - 2004. 职员招聘人数: lc/2004.md + - 2005. 斐波那契树的移除子树游戏: lc/2005.md + - 2006. 差的绝对值为 K 的数对数目: lc/2006.md + - 2007. 从双倍数组中还原原数组: lc/2007.md + - 2008. 出租车的最大盈利: lc/2008.md + - 2009. 使数组连续的最少操作数: lc/2009.md + - 2010. 职员招聘人数 II: lc/2010.md + - 2011. 执行操作后的变量值: lc/2011.md + - 2012. 数组美丽值求和: lc/2012.md + - 2013. 检测正方形: lc/2013.md + - 2014. 重复 K 次的最长子序列: lc/2014.md + - 2015. 每段建筑物的平均高度: lc/2015.md + - 2016. 增量元素之间的最大差值: lc/2016.md + - 2017. 网格游戏: lc/2017.md + - 2018. 判断单词是否能放入填字游戏内: lc/2018.md + - 2019. 解出数学表达式的学生分数: lc/2019.md + - 2020. 无流量的帐户数: lc/2020.md + - 2021. 街上最亮的位置: lc/2021.md + - 2022. 将一维数组转变成二维数组: lc/2022.md + - 2023. 连接后等于目标字符串的字符串对: lc/2023.md + - 2024. 考试的最大困扰度: lc/2024.md + - 2025. 分割数组的最多方案数: lc/2025.md + - 2026. 低质量的问题: lc/2026.md + - 2027. 转换字符串的最少操作次数: lc/2027.md + - 2028. 找出缺失的观测数据: lc/2028.md + - 2029. 石子游戏 IX: lc/2029.md + - 2030. 含特定字母的最小子序列: lc/2030.md + - 2031. 1 比 0 多的子数组个数: lc/2031.md + - 2032. 至少在两个数组中出现的值: lc/2032.md + - 2033. 获取单值网格的最小操作数: lc/2033.md + - 2034. 股票价格波动: lc/2034.md + - 2035. 将数组分成两个数组并最小化数组和的差: lc/2035.md + - 2036. 最大交替子数组和: lc/2036.md + - 2037. 使每位学生都有座位的最少移动次数: lc/2037.md + - 2038. 如果相邻两个颜色均相同则删除当前颜色: lc/2038.md + - 2039. 网络空闲的时刻: lc/2039.md + - 2040. 两个有序数组的第 K 小乘积: lc/2040.md + - 2041. 面试中被录取的候选人: lc/2041.md + - 2042. 检查句子中的数字是否递增: lc/2042.md + - 2043. 简易银行系统: lc/2043.md + - 2044. 统计按位或能得到最大值的子集数目: lc/2044.md + - 2045. 到达目的地的第二短时间: lc/2045.md + - 2046. 给按照绝对值排序的链表排序: lc/2046.md + - 2047. 句子中的有效单词数: lc/2047.md + - 2048. 下一个更大的数值平衡数: lc/2048.md + - 2049. 统计最高分的节点数目: lc/2049.md + - 2050. 并行课程 III: lc/2050.md + - 2051. 商店中每个成员的级别: lc/2051.md + - 2052. 将句子分隔成行的最低成本: lc/2052.md + - 2053. 数组中第 K 个独一无二的字符串: lc/2053.md + - 2054. 两个最好的不重叠活动: lc/2054.md + - 2055. 蜡烛之间的盘子: lc/2055.md + - 2056. 棋盘上有效移动组合的数目: lc/2056.md + - 2057. 值相等的最小索引: lc/2057.md + - 2058. 找出临界点之间的最小和最大距离: lc/2058.md + - 2059. 转化数字的最小运算数: lc/2059.md + - 2060. 同源字符串检测: lc/2060.md + - 2061. 扫地机器人清扫过的空间个数: lc/2061.md + - 2062. 统计字符串中的元音子字符串: lc/2062.md + - 2063. 所有子字符串中的元音: lc/2063.md + - 2064. 分配给商店的最多商品的最小值: lc/2064.md + - 2065. 最大化一张图中的路径价值: lc/2065.md + - 2066. 账户余额: lc/2066.md + - 2067. 等计数子串的数量: lc/2067.md + - 2068. 检查两个字符串是否几乎相等: lc/2068.md + - 2069. 模拟行走机器人 II: lc/2069.md + - 2070. 每一个查询的最大美丽值: lc/2070.md + - 2071. 你可以安排的最多任务数目: lc/2071.md + - 2072. 赢得比赛的大学: lc/2072.md + - 2073. 买票需要的时间: lc/2073.md + - 2074. 反转偶数长度组的节点: lc/2074.md + - 2075. 解码斜向换位密码: lc/2075.md + - 2076. 处理含限制条件的好友请求: lc/2076.md + - 2077. 殊途同归: lc/2077.md + - 2078. 两栋颜色不同且距离最远的房子: lc/2078.md + - 2079. 给植物浇水: lc/2079.md + - 2080. 区间内查询数字的频率: lc/2080.md + - 2081. k 镜像数字的和: lc/2081.md + - 2082. 富有客户的数量: lc/2082.md + - 2083. 求以相同字母开头和结尾的子串总数: lc/2083.md + - 2084. 为订单类型为 0 的客户删除类型为 1 的订单: lc/2084.md + - 2085. 统计出现过一次的公共字符串: lc/2085.md + - 2086. 从房屋收集雨水需要的最少水桶数: lc/2086.md + - 2087. 网格图中机器人回家的最小代价: lc/2087.md + - 2088. 统计农场中肥沃金字塔的数目: lc/2088.md + - 2089. 找出数组排序后的目标下标: lc/2089.md + - 2090. 半径为 k 的子数组平均值: lc/2090.md + - 2091. 从数组中移除最大值和最小值: lc/2091.md + - 2092. 找出知晓秘密的所有专家: lc/2092.md + - 2093. 前往目标城市的最小费用: lc/2093.md + - 2094. 找出 3 位偶数: lc/2094.md + - 2095. 删除链表的中间节点: lc/2095.md + - 2096. 从二叉树一个节点到另一个节点每一步的方向: lc/2096.md + - 2097. 合法重新排列数对: lc/2097.md + - 2098. 长度为 K 的最大偶数和子序列: lc/2098.md + - 2099. 找到和最大的长度为 K 的子序列: lc/2099.md + - 2100. 适合野炊的日子: lc/2100.md + - 2101. 引爆最多的炸弹: lc/2101.md + - 2102. 序列顺序查询: lc/2102.md + - 2103. 环和杆: lc/2103.md + - 2104. 子数组范围和: lc/2104.md + - 2105. 给植物浇水 II: lc/2105.md + - 2106. 摘水果: lc/2106.md + - 2107. 分享 K 个糖果后独特口味的数量: lc/2107.md + - 2108. 找出数组中的第一个回文字符串: lc/2108.md + - 2109. 向字符串添加空格: lc/2109.md + - 2110. 股票平滑下跌阶段的数目: lc/2110.md + - 2111. 使数组 K 递增的最少操作次数: lc/2111.md + - 2112. 最繁忙的机场: lc/2112.md + - 2113. 查询删除和添加元素后的数组: lc/2113.md + - 2114. 句子中的最多单词数: lc/2114.md + - 2115. 从给定原材料中找到所有可以做出的菜: lc/2115.md + - 2116. 判断一个括号字符串是否有效: lc/2116.md + - 2117. 一个区间内所有数乘积的缩写: lc/2117.md + - 2118. 建立方程: lc/2118.md + - 2119. 反转两次的数字: lc/2119.md + - 2120. 执行所有后缀指令: lc/2120.md + - 2121. 相同元素的间隔之和: lc/2121.md + - 2122. 还原原数组: lc/2122.md + - 2123. 使矩阵中的 1 互不相邻的最小操作数: lc/2123.md + - 2124. 检查是否所有 A 都在 B 之前: lc/2124.md + - 2125. 银行中的激光束数量: lc/2125.md + - 2126. 摧毁小行星: lc/2126.md + - 2127. 参加会议的最多员工数: lc/2127.md + - 2128. 通过翻转行或列来去除所有的 1: lc/2128.md + - 2129. 将标题首字母大写: lc/2129.md + - 2130. 链表最大孪生和: lc/2130.md + - 2131. 连接两字母单词得到的最长回文串: lc/2131.md + - 2132. 用邮票贴满网格图: lc/2132.md + - 2133. 检查是否每一行每一列都包含全部整数: lc/2133.md + - 2134. 最少交换次数来组合所有的 1 II: lc/2134.md + - 2135. 统计追加字母可以获得的单词数: lc/2135.md + - 2136. 全部开花的最早一天: lc/2136.md + - 2137. 通过倒水操作让所有的水桶所含水量相等: lc/2137.md + - 2138. 将字符串拆分为若干长度为 k 的组: lc/2138.md + - 2139. 得到目标值的最少行动次数: lc/2139.md + - 2140. 解决智力问题: lc/2140.md + - 2141. 同时运行 N 台电脑的最长时间: lc/2141.md + - 2142. 每辆车的乘客人数 I: lc/2142.md + - 2143. 在两个数组的区间中选取数字: lc/2143.md + - 2144. 打折购买糖果的最小开销: lc/2144.md + - 2145. 统计隐藏数组数目: lc/2145.md + - 2146. 价格范围内最高排名的 K 样物品: lc/2146.md + - 2147. 分隔长廊的方案数: lc/2147.md + - 2148. 元素计数: lc/2148.md + - 2149. 按符号重排数组: lc/2149.md + - 2150. 找出数组中的所有孤独数字: lc/2150.md + - 2151. 基于陈述统计最多好人数: lc/2151.md + - 2152. 穿过所有点的所需最少直线数量: lc/2152.md + - 2153. 每辆车的乘客人数 II: lc/2153.md + - 2154. 将找到的值乘以 2: lc/2154.md + - 2155. 分组得分最高的所有下标: lc/2155.md + - 2156. 查找给定哈希值的子串: lc/2156.md + - 2157. 字符串分组: lc/2157.md + - 2158. 每天绘制新区域的数量: lc/2158.md + - 2159. 分别排序两列: lc/2159.md + - 2160. 拆分数位后四位数字的最小和: lc/2160.md + - 2161. 根据给定数字划分数组: lc/2161.md + - 2162. 设置时间的最少代价: lc/2162.md + - 2163. 删除元素后和的最小差值: lc/2163.md + - 2164. 对奇偶下标分别排序: lc/2164.md + - 2165. 重排数字的最小值: lc/2165.md + - 2166. 设计位集: lc/2166.md + - 2167. 移除所有载有违禁货物车厢所需的最少时间: lc/2167.md + - 2168. 每个数字的频率都相同的独特子字符串的数量: lc/2168.md + - 2169. 得到 0 的操作数: lc/2169.md + - 2170. 使数组变成交替数组的最少操作数: lc/2170.md + - 2171. 拿出最少数目的魔法豆: lc/2171.md + - 2172. 数组的最大与和: lc/2172.md + - 2173. 最多连胜的次数: lc/2173.md + - 2174. 通过翻转行或列来去除所有的 1 II: lc/2174.md + - 2175. 世界排名的变化: lc/2175.md + - 2176. 统计数组中相等且可以被整除的数对: lc/2176.md + - 2177. 找到和为给定整数的三个连续整数: lc/2177.md + - 2178. 拆分成最多数目的正偶数之和: lc/2178.md + - 2179. 统计数组中好三元组数目: lc/2179.md + - 2180. 统计各位数字之和为偶数的整数个数: lc/2180.md + - 2181. 合并零之间的节点: lc/2181.md + - 2182. 构造限制重复的字符串: lc/2182.md + - 2183. 统计可以被 K 整除的下标对数目: lc/2183.md + - 2184. 建造坚实的砖墙的方法数: lc/2184.md + - 2185. 统计包含给定前缀的字符串: lc/2185.md + - 2186. 使两字符串互为字母异位词的最少步骤数: lc/2186.md + - 2187. 完成旅途的最少时间: lc/2187.md + - 2188. 完成比赛的最少时间: lc/2188.md + - 2189. 建造纸牌屋的方法数: lc/2189.md + - 2190. 数组中紧跟 key 之后出现最频繁的数字: lc/2190.md + - 2191. 将杂乱无章的数字排序: lc/2191.md + - 2192. 有向无环图中一个节点的所有祖先: lc/2192.md + - 2193. 得到回文串的最少操作次数: lc/2193.md + - 2194. Excel 表中某个范围内的单元格: lc/2194.md + - 2195. 向数组中追加 K 个整数: lc/2195.md + - 2196. 根据描述创建二叉树: lc/2196.md + - 2197. 替换数组中的非互质数: lc/2197.md + - 2198. 单因数三元组: lc/2198.md + - 2199. 找到每篇文章的主题: lc/2199.md + - 2200. 找出数组中的所有 K 近邻下标: lc/2200.md + - 2201. 统计可以提取的工件: lc/2201.md + - 2202. K 次操作后最大化顶端元素: lc/2202.md + - 2203. 得到要求路径的最小带权子图: lc/2203.md + - 2204. 无向图中到环的距离: lc/2204.md + - 2205. 有资格享受折扣的用户数量: lc/2205.md + - 2206. 将数组划分成相等数对: lc/2206.md + - 2207. 字符串中最多数目的子字符串: lc/2207.md + - 2208. 将数组和减半的最少操作次数: lc/2208.md + - 2209. 用地毯覆盖后的最少白色砖块: lc/2209.md + - 2210. 统计数组中峰和谷的数量: lc/2210.md + - 2211. 统计道路上的碰撞次数: lc/2211.md + - 2212. 射箭比赛中的最大得分: lc/2212.md + - 2213. 由单个字符重复的最长子字符串: lc/2213.md + - 2214. 通关游戏所需的最低生命值: lc/2214.md + - 2215. 找出两数组的不同: lc/2215.md + - 2216. 美化数组的最少删除数: lc/2216.md + - 2217. 找到指定长度的回文数: lc/2217.md + - 2218. 从栈中取出 K 个硬币的最大面值和: lc/2218.md + - 2219. 数组的最大总分: lc/2219.md + - 2220. 转换数字的最少位翻转次数: lc/2220.md + - 2221. 数组的三角和: lc/2221.md + - 2222. 选择建筑的方案数: lc/2222.md + - 2223. 构造字符串的总得分和: lc/2223.md + - 2224. 转化时间需要的最少操作数: lc/2224.md + - 2225. 找出输掉零场或一场比赛的玩家: lc/2225.md + - 2226. 每个小孩最多能分到多少糖果: lc/2226.md + - 2227. 加密解密字符串: lc/2227.md + - 2228. 7 天内两次购买的用户: lc/2228.md + - 2229. 检查数组是否连贯: lc/2229.md + - 2230. 查找可享受优惠的用户: lc/2230.md + - 2231. 按奇偶性交换后的最大数字: lc/2231.md + - 2232. 向表达式添加括号后的最小结果: lc/2232.md + - 2233. K 次增加后的最大乘积: lc/2233.md + - 2234. 花园的最大总美丽值: lc/2234.md + - 2235. 两整数相加: lc/2235.md + - 2236. 判断根结点是否等于子结点之和: lc/2236.md + - 2237. 计算街道上满足所需亮度的位置数量: lc/2237.md + - 2238. 司机成为乘客的次数: lc/2238.md + - 2239. 找到最接近 0 的数字: lc/2239.md + - 2240. 买钢笔和铅笔的方案数: lc/2240.md + - 2241. 设计一个 ATM 机器: lc/2241.md + - 2242. 节点序列的最大得分: lc/2242.md + - 2243. 计算字符串的数字和: lc/2243.md + - 2244. 完成所有任务需要的最少轮数: lc/2244.md + - 2245. 转角路径的乘积中最多能有几个尾随零: lc/2245.md + - 2246. 相邻字符不同的最长路径: lc/2246.md + - 2247. K 条高速公路的最大旅行费用: lc/2247.md + - 2248. 多个数组求交集: lc/2248.md + - 2249. 统计圆内格点数目: lc/2249.md + - 2250. 统计包含每个点的矩形数目: lc/2250.md + - 2251. 花期内花的数目: lc/2251.md + - 2252. 表的动态旋转: lc/2252.md + - 2253. 动态取消表的旋转: lc/2253.md + - 2254. 设计视频共享平台: lc/2254.md + - 2255. 统计是给定字符串前缀的字符串数目: lc/2255.md + - 2256. 最小平均差: lc/2256.md + - 2257. 统计网格图中没有被保卫的格子数: lc/2257.md + - 2258. 逃离火灾: lc/2258.md + - 2259. 移除指定数字得到的最大结果: lc/2259.md + - 2260. 必须拿起的最小连续卡牌数: lc/2260.md + - 2261. 含最多 K 个可整除元素的子数组: lc/2261.md + - 2262. 字符串的总引力: lc/2262.md + - 2263. 数组变为有序的最小操作次数: lc/2263.md + - 2264. 字符串中最大的 3 位相同数字: lc/2264.md + - 2265. 统计值等于子树平均值的节点数: lc/2265.md + - 2266. 统计打字方案数: lc/2266.md + - 2267. 检查是否有合法括号字符串路径: lc/2267.md + - 2268. 最少按键次数: lc/2268.md + - 2269. 找到一个数字的 K 美丽值: lc/2269.md + - 2270. 分割数组的方案数: lc/2270.md + - 2271. 毯子覆盖的最多白色砖块数: lc/2271.md + - 2272. 最大波动的子字符串: lc/2272.md + - 2273. 移除字母异位词后的结果数组: lc/2273.md + - 2274. 不含特殊楼层的最大连续楼层数: lc/2274.md + - 2275. 按位与结果大于零的最长组合: lc/2275.md + - 2276. 统计区间中的整数数目: lc/2276.md + - 2277. 树中最接近路径的节点: lc/2277.md + - 2278. 字母在字符串中的百分比: lc/2278.md + - 2279. 装满石头的背包的最大数量: lc/2279.md + - 2280. 表示一个折线图的最少线段数: lc/2280.md + - 2281. 巫师的总力量和: lc/2281.md + - 2282. 在一个网格中可以看到的人数: lc/2282.md + - 2283. 判断一个数的数字计数是否等于数位的值: lc/2283.md + - 2284. 最多单词数的发件人: lc/2284.md + - 2285. 道路的最大总重要性: lc/2285.md + - 2286. 以组为单位订音乐会的门票: lc/2286.md + - 2287. 重排字符形成目标字符串: lc/2287.md + - 2288. 价格减免: lc/2288.md + - 2289. 使数组按非递减顺序排列: lc/2289.md + - 2290. 到达角落需要移除障碍物的最小数目: lc/2290.md + - 2291. 最大股票收益: lc/2291.md + - 2292. 连续两年有 3 个及以上订单的产品: lc/2292.md + - 2293. 极大极小游戏: lc/2293.md + - 2294. 划分数组使最大差为 K: lc/2294.md + - 2295. 替换数组中的元素: lc/2295.md + - 2296. 设计一个文本编辑器: lc/2296.md + - 2297. 跳跃游戏 VIII: lc/2297.md + - 2298. 周末任务计数: lc/2298.md + - 2299. 强密码检验器 II: lc/2299.md + - 2300. 咒语和药水的成功对数: lc/2300.md + - 2301. 替换字符后匹配: lc/2301.md + - 2302. 统计得分小于 K 的子数组数目: lc/2302.md + - 2303. 计算应缴税款总额: lc/2303.md + - 2304. 网格中的最小路径代价: lc/2304.md + - 2305. 公平分发饼干: lc/2305.md + - 2306. 公司命名: lc/2306.md + - 2307. 检查方程中的矛盾之处: lc/2307.md + - 2308. 按性别排列表格: lc/2308.md + - 2309. 兼具大小写的最好英文字母: lc/2309.md + - 2310. 个位数字为 K 的整数之和: lc/2310.md + - 2311. 小于等于 K 的最长二进制子序列: lc/2311.md + - 2312. 卖木头块: lc/2312.md + - 2313. 二叉树中得到结果所需的最少翻转次数: lc/2313.md + - 2314. 每个城市最高气温的第一天: lc/2314.md + - 2315. 统计星号: lc/2315.md + - 2316. 统计无向图中无法互相到达点对数: lc/2316.md + - 2317. 操作后的最大异或和: lc/2317.md + - 2318. 不同骰子序列的数目: lc/2318.md + - 2319. 判断矩阵是否是一个 X 矩阵: lc/2319.md + - 2320. 统计放置房子的方式数: lc/2320.md + - 2321. 拼接数组的最大分数: lc/2321.md + - 2322. 从树中删除边的最小分数: lc/2322.md + - 2323. 完成所有工作的最短时间 II: lc/2323.md + - 2324. 产品销售分析 IV: lc/2324.md + - 2325. 解密消息: lc/2325.md + - 2326. 螺旋矩阵 IV: lc/2326.md + - 2327. 知道秘密的人数: lc/2327.md + - 2328. 网格图中递增路径的数目: lc/2328.md + - 2329. 产品销售分析 Ⅴ: lc/2329.md + - 2330. 验证回文串 IV: lc/2330.md + - 2331. 计算布尔二叉树的值: lc/2331.md + - 2332. 坐上公交的最晚时间: lc/2332.md + - 2333. 最小差值平方和: lc/2333.md + - 2334. 元素值大于变化阈值的子数组: lc/2334.md + - 2335. 装满杯子需要的最短总时长: lc/2335.md + - 2336. 无限集中的最小数字: lc/2336.md + - 2337. 移动片段得到字符串: lc/2337.md + - 2338. 统计理想数组的数目: lc/2338.md + - 2339. 联赛的所有比赛: lc/2339.md + - 2340. 生成有效数组的最少交换次数: lc/2340.md + - 2341. 数组能形成多少数对: lc/2341.md + - 2342. 数位和相等数对的最大和: lc/2342.md + - 2343. 裁剪数字后查询第 K 小的数字: lc/2343.md + - 2344. 使数组可以被整除的最少删除次数: lc/2344.md + - 2345. 寻找可见山的数量: lc/2345.md + - 2346. 以百分比计算排名: lc/2346.md + - 2347. 最好的扑克手牌: lc/2347.md + - 2348. 全 0 子数组的数目: lc/2348.md + - 2349. 设计数字容器系统: lc/2349.md + - 2350. 不可能得到的最短骰子序列: lc/2350.md + - 2351. 第一个出现两次的字母: lc/2351.md + - 2352. 相等行列对: lc/2352.md + - 2353. 设计食物评分系统: lc/2353.md + - 2354. 优质数对的数目: lc/2354.md + - 2355. 你能拿走的最大图书数量: lc/2355.md + - 2356. 每位教师所教授的科目种类的数量: lc/2356.md + - 2357. 使数组中所有元素都等于零: lc/2357.md + - 2358. 分组的最大数量: lc/2358.md + - 2359. 找到离给定两个节点最近的节点: lc/2359.md + - 2360. 图中的最长环: lc/2360.md + - 2361. 乘坐火车路线的最少费用: lc/2361.md + - 2362. 生成发票: lc/2362.md + - 2363. 合并相似的物品: lc/2363.md + - 2364. 统计坏数对的数目: lc/2364.md + - 2365. 任务调度器 II: lc/2365.md + - 2366. 将数组排序的最少替换次数: lc/2366.md + - 2367. 算术三元组的数目: lc/2367.md + - 2368. 受限条件下可到达节点的数目: lc/2368.md + - 2369. 检查数组是否存在有效划分: lc/2369.md + - 2370. 最长理想子序列: lc/2370.md + - 2371. 最小化网格中的最大值: lc/2371.md + - 2372. 计算每个销售人员的影响力: lc/2372.md + - 2373. 矩阵中的局部最大值: lc/2373.md + - 2374. 边积分最高的节点: lc/2374.md + - 2375. 根据模式串构造最小数字: lc/2375.md + - 2376. 统计特殊整数: lc/2376.md + - 2377. 整理奥运表: lc/2377.md + - 2378. 选择边来最大化树的得分: lc/2378.md + - 2379. 得到 K 个黑块的最少涂色次数: lc/2379.md + - 2380. 二进制字符串重新安排顺序需要的时间: lc/2380.md + - 2381. 字母移位 II: lc/2381.md + - 2382. 删除操作后的最大子段和: lc/2382.md + - 2383. 赢得比赛需要的最少训练时长: lc/2383.md + - 2384. 最大回文数字: lc/2384.md + - 2385. 感染二叉树需要的总时间: lc/2385.md + - 2386. 找出数组的第 K 大和: lc/2386.md + - 2387. 行排序矩阵的中位数: lc/2387.md + - 2388. 将表中的空值更改为前一个值: lc/2388.md + - 2389. 和有限的最长子序列: lc/2389.md + - 2390. 从字符串中移除星号: lc/2390.md + - 2391. 收集垃圾的最少总时间: lc/2391.md + - 2392. 给定条件下构造矩阵: lc/2392.md + - 2393. 严格递增的子数组个数: lc/2393.md + - 2394. 开除员工: lc/2394.md + - 2395. 和相等的子数组: lc/2395.md + - 2396. 严格回文的数字: lc/2396.md + - 2397. 被列覆盖的最多行数: lc/2397.md + - 2398. 预算内的最多机器人数目: lc/2398.md + - 2399. 检查相同字母间的距离: lc/2399.md + - 2400. 恰好移动 k 步到达某一位置的方法数目: lc/2400.md + - 2401. 最长优雅子数组: lc/2401.md + - 2402. 会议室 III: lc/2402.md + - 2403. 杀死所有怪物的最短时间: lc/2403.md + - 2404. 出现最频繁的偶数元素: lc/2404.md + - 2405. 子字符串的最优划分: lc/2405.md + - 2406. 将区间分为最少组数: lc/2406.md + - 2407. 最长递增子序列 II: lc/2407.md + - 2408. 设计 SQL: lc/2408.md + - 2409. 统计共同度过的日子数: lc/2409.md + - 2410. 运动员和训练师的最大匹配数: lc/2410.md + - 2411. 按位或最大的最小子数组长度: lc/2411.md + - 2412. 完成所有交易的初始最少钱数: lc/2412.md + - 2413. 最小偶倍数: lc/2413.md + - 2414. 最长的字母序连续子字符串的长度: lc/2414.md + - 2415. 反转二叉树的奇数层: lc/2415.md + - 2416. 字符串的前缀分数和: lc/2416.md + - 2417. 最近的公平整数: lc/2417.md + - 2418. 按身高排序: lc/2418.md + - 2419. 按位与最大的最长子数组: lc/2419.md + - 2420. 找到所有好下标: lc/2420.md + - 2421. 好路径的数目: lc/2421.md + - 2422. 使用合并操作将数组转换为回文序列: lc/2422.md + - 2423. 删除字符使频率相同: lc/2423.md + - 2424. 最长上传前缀: lc/2424.md + - 2425. 所有数对的异或和: lc/2425.md + - 2426. 满足不等式的数对数目: lc/2426.md + - 2427. 公因子的数目: lc/2427.md + - 2428. 沙漏的最大总和: lc/2428.md + - 2429. 最小异或: lc/2429.md + - 2430. 对字母串可执行的最大删除数: lc/2430.md + - 2431. 最大限度地提高购买水果的口味: lc/2431.md + - 2432. 处理用时最长的那个任务的员工: lc/2432.md + - 2433. 找出前缀异或的原始数组: lc/2433.md + - 2434. 使用机器人打印字典序最小的字符串: lc/2434.md + - 2435. 矩阵中和能被 K 整除的路径: lc/2435.md + - 2436. 使子数组最大公约数大于一的最小分割数: lc/2436.md + - 2437. 有效时间的数目: lc/2437.md + - 2438. 二的幂数组中查询范围内的乘积: lc/2438.md + - 2439. 最小化数组中的最大值: lc/2439.md + - 2440. 创建价值相同的连通块: lc/2440.md + - 2441. 与对应负数同时存在的最大正整数: lc/2441.md + - 2442. 反转之后不同整数的数目: lc/2442.md + - 2443. 反转之后的数字和: lc/2443.md + - 2444. 统计定界子数组的数目: lc/2444.md + - 2445. 值为 1 的节点数: lc/2445.md + - 2446. 判断两个事件是否存在冲突: lc/2446.md + - 2447. 最大公因数等于 K 的子数组数目: lc/2447.md + - 2448. 使数组相等的最小开销: lc/2448.md + - 2449. 使数组相似的最少操作次数: lc/2449.md + - 2450. 应用操作后不同二进制字符串的数量: lc/2450.md + - 2451. 差值数组不同的字符串: lc/2451.md + - 2452. 距离字典两次编辑以内的单词: lc/2452.md + - 2453. 摧毁一系列目标: lc/2453.md + - 2454. 下一个更大元素 IV: lc/2454.md + - 2455. 可被三整除的偶数的平均值: lc/2455.md + - 2456. 最流行的视频创作者: lc/2456.md + - 2457. 美丽整数的最小增量: lc/2457.md + - 2458. 移除子树后的二叉树高度: lc/2458.md + - 2459. 通过移动项目到空白区域来排序数组: lc/2459.md + - 2460. 对数组执行操作: lc/2460.md + - 2461. 长度为 K 子数组中的最大和: lc/2461.md + - 2462. 雇佣 K 位工人的总代价: lc/2462.md + - 2463. 最小移动总距离: lc/2463.md + - 2464. 有效分割中的最少子数组数目: lc/2464.md + - 2465. 不同的平均值数目: lc/2465.md + - 2466. 统计构造好字符串的方案数: lc/2466.md + - 2467. 树上最大得分和路径: lc/2467.md + - 2468. 根据限制分割消息: lc/2468.md + - 2469. 温度转换: lc/2469.md + - 2470. 最小公倍数为 K 的子数组数目: lc/2470.md + - 2471. 逐层排序二叉树所需的最少操作数目: lc/2471.md + - 2472. 不重叠回文子字符串的最大数目: lc/2472.md + - 2473. 购买苹果的最低成本: lc/2473.md + - 2474. 购买量严格增加的客户: lc/2474.md + - 2475. 数组中不等三元组的数目: lc/2475.md + - 2476. 二叉搜索树最近节点查询: lc/2476.md + - 2477. 到达首都的最少油耗: lc/2477.md + - 2478. 完美分割的方案数: lc/2478.md + - 2479. 两个不重叠子树的最大异或值: lc/2479.md + - 2480. 形成化学键: lc/2480.md + - 2481. 分割圆的最少切割次数: lc/2481.md + - 2482. 行和列中一和零的差值: lc/2482.md + - 2483. 商店的最少代价: lc/2483.md + - 2484. 统计回文子序列数目: lc/2484.md + - 2485. 找出中枢整数: lc/2485.md + - 2486. 追加字符以获得子序列: lc/2486.md + - 2487. 从链表中移除节点: lc/2487.md + - 2488. 统计中位数为 K 的子数组: lc/2488.md + - 2489. 固定比率的子字符串数: lc/2489.md + - 2490. 回环句: lc/2490.md + - 2491. 划分技能点相等的团队: lc/2491.md + - 2492. 两个城市间路径的最小分数: lc/2492.md + - 2493. 将节点分成尽可能多的组: lc/2493.md + - 2494. 合并在同一个大厅重叠的活动: lc/2494.md + - 2495. 乘积为偶数的子数组数: lc/2495.md + - 2496. 数组中字符串的最大值: lc/2496.md + - 2497. 图中最大星和: lc/2497.md + - 2498. 青蛙过河 II: lc/2498.md + - 2499. 让数组不相等的最小总代价: lc/2499.md + - 2500. 删除每行中的最大值: lc/2500.md + - 2501. 数组中最长的方波: lc/2501.md + - 2502. 设计内存分配器: lc/2502.md + - 2503. 矩阵查询可获得的最大分数: lc/2503.md + - 2504. 把名字和职业联系起来: lc/2504.md + - 2505. 所有子序列和的按位或: lc/2505.md + - 2506. 统计相似字符串对的数目: lc/2506.md + - 2507. 使用质因数之和替换后可以取到的最小值: lc/2507.md + - 2508. 添加边使所有节点度数都为偶数: lc/2508.md + - 2509. 查询树中环的长度: lc/2509.md + - 2510. 检查是否有路径经过相同数量的 0 和 1: lc/2510.md + - 2511. 最多可以摧毁的敌人城堡数目: lc/2511.md + - 2512. 奖励最顶尖的 K 名学生: lc/2512.md + - 2513. 最小化两个数组中的最大值: lc/2513.md + - 2514. 统计同位异构字符串数目: lc/2514.md + - 2515. 到目标字符串的最短距离: lc/2515.md + - 2516. 每种字符至少取 K 个: lc/2516.md + - 2517. 礼盒的最大甜蜜度: lc/2517.md + - 2518. 好分区的数目: lc/2518.md + - 2519. 统计 K-Big 索引的数量: lc/2519.md + - 2520. 统计能整除数字的位数: lc/2520.md + - 2521. 数组乘积中的不同质因数数目: lc/2521.md + - 2522. 将字符串分割成值不超过 K 的子字符串: lc/2522.md + - 2523. 范围内最接近的两个质数: lc/2523.md + - 2524. 子数组的最大频率分数: lc/2524.md + - 2525. 根据规则将箱子分类: lc/2525.md + - 2526. 找到数据流中的连续整数: lc/2526.md + - 2527. 查询数组异或美丽值: lc/2527.md + - 2528. 最大化城市的最小电量: lc/2528.md + - 2529. 正整数和负整数的最大计数: lc/2529.md + - 2530. 执行 K 次操作后的最大分数: lc/2530.md + - 2531. 使字符串中不同字符的数目相等: lc/2531.md + - 2532. 过桥的时间: lc/2532.md + - 2533. 好二进制字符串的数量: lc/2533.md + - 2534. 通过门的时间: lc/2534.md + - 2535. 数组元素和与数字和的绝对差: lc/2535.md + - 2536. 子矩阵元素加 1: lc/2536.md + - 2537. 统计好子数组的数目: lc/2537.md + - 2538. 最大价值和与最小价值和的差值: lc/2538.md + - 2539. 好子序列的个数: lc/2539.md + - 2540. 最小公共值: lc/2540.md + - 2541. 使数组中所有元素相等的最小操作数 II: lc/2541.md + - 2542. 最大子序列的分数: lc/2542.md + - 2543. 判断一个点是否可以到达: lc/2543.md + - 2544. 交替数字和: lc/2544.md + - 2545. 根据第 K 场考试的分数排序: lc/2545.md + - 2546. 执行逐位运算使字符串相等: lc/2546.md + - 2547. 拆分数组的最小代价: lc/2547.md + - 2548. 填满背包的最大价格: lc/2548.md + - 2549. 统计桌面上的不同数字: lc/2549.md + - 2550. 猴子碰撞的方法数: lc/2550.md + - 2551. 将珠子放入背包中: lc/2551.md + - 2552. 统计上升四元组: lc/2552.md + - 2553. 分割数组中数字的数位: lc/2553.md + - 2554. 从一个范围内选择最多整数 I: lc/2554.md + - 2555. 两个线段获得的最多奖品: lc/2555.md + - 2556. 二进制矩阵中翻转最多一次使路径不连通: lc/2556.md + - 2557. 从一个范围内选择最多整数 II: lc/2557.md + - 2558. 从数量最多的堆取走礼物: lc/2558.md + - 2559. 统计范围内的元音字符串数: lc/2559.md + - 2560. 打家劫舍 IV: lc/2560.md + - 2561. 重排水果: lc/2561.md + - 2562. 找出数组的串联值: lc/2562.md + - 2563. 统计公平数对的数目: lc/2563.md + - 2564. 子字符串异或查询: lc/2564.md + - 2565. 最少得分子序列: lc/2565.md + - 2566. 替换一个数字后的最大差值: lc/2566.md + - 2567. 修改两个元素的最小分数: lc/2567.md + - 2568. 最小无法得到的或值: lc/2568.md + - 2569. 更新数组后处理求和查询: lc/2569.md + - 2570. 合并两个二维数组 - 求和法: lc/2570.md + - 2571. 将整数减少到零需要的最少操作数: lc/2571.md + - 2572. 无平方子集计数: lc/2572.md + - 2573. 找出对应 矩阵的字符串: lc/2573.md + - 2574. 左右元素和的差值: lc/2574.md + - 2575. 找出字符串的可整除数组: lc/2575.md + - 2576. 求出最多标记下标: lc/2576.md + - 2577. 在网格图中访问一个格子的最少时间: lc/2577.md + - 2578. 最小和分割: lc/2578.md + - 2579. 统计染色格子数: lc/2579.md + - 2580. 统计将重叠区间合并成组的方案数: lc/2580.md + - 2581. 统计可能的树根数目: lc/2581.md + - 2582. 递枕头: lc/2582.md + - 2583. 二叉树中的第 K 大层和: lc/2583.md + - 2584. 分割数组使乘积互质: lc/2584.md + - 2585. 获得分数的方法数: lc/2585.md + - 2586. 统计范围内的元音字符串数: lc/2586.md + - 2587. 重排数组以得到最大前缀分数: lc/2587.md + - 2588. 统计美丽子数组数目: lc/2588.md + - 2589. 完成所有任务的最少时间: lc/2589.md + - 2590. 设计一个待办事项清单: lc/2590.md + - 2591. 将钱分给最多的儿童: lc/2591.md + - 2592. 最大化数组的伟大值: lc/2592.md + - 2593. 标记所有元素后数组的分数: lc/2593.md + - 2594. 修车的最少时间: lc/2594.md + - 2595. 奇偶位数: lc/2595.md + - 2596. 检查骑士巡视方案: lc/2596.md + - 2597. 美丽子集的数目: lc/2597.md + - 2598. 执行操作后的最大 MEX: lc/2598.md + - 2599. 使前缀和数组非负: lc/2599.md + - 2600. K 件物品的最大和: lc/2600.md + - 2601. 质数减法运算: lc/2601.md + - 2602. 使数组元素全部相等的最少操作次数: lc/2602.md + - 2603. 收集树中金币: lc/2603.md + - 2604. 吃掉所有谷子的最短时间: lc/2604.md + - 2605. 从两个数字数组里生成最小数字: lc/2605.md + - 2606. 找到最大开销的子字符串: lc/2606.md + - 2607. 使子数组元素和相等: lc/2607.md + - 2608. 图中的最短环: lc/2608.md + - 2609. 最长平衡子字符串: lc/2609.md + - 2610. 转换二维数组: lc/2610.md + - 2611. 老鼠和奶酪: lc/2611.md + - 2612. 最少翻转操作数: lc/2612.md + - 2613. 美数对: lc/2613.md + - 2614. 对角线上的质数: lc/2614.md + - 2615. 等值距离和: lc/2615.md + - 2616. 最小化数对的最大差值: lc/2616.md + - 2617. 网格图中最少访问的格子数: lc/2617.md + - 2618. 检查是否是类的对象实例: lc/2618.md + - 2619. 数组原型对象的最后一个元素: lc/2619.md + - 2620. 计数器: lc/2620.md + - 2621. 睡眠函数: lc/2621.md + - 2622. 有时间限制的缓存: lc/2622.md + - 2623. 记忆函数: lc/2623.md + - 2624. 蜗牛排序: lc/2624.md + - 2625. 扁平化嵌套数组: lc/2625.md + - 2626. 数组归约运算: lc/2626.md + - 2627. 函数防抖: lc/2627.md + - 2628. 完全相等的 JSON 字符串: lc/2628.md + - 2629. 复合函数: lc/2629.md + - 2630. 记忆函数 II: lc/2630.md + - 2631. 分组: lc/2631.md + - 2632. 柯里化: lc/2632.md + - 2633. 将对象转换为 JSON 字符串: lc/2633.md + - 2634. 过滤数组中的元素: lc/2634.md + - 2635. 转换数组中的每个元素: lc/2635.md + - 2636. Promise 对象池: lc/2636.md + - 2637. 有时间限制的 Promise 对象: lc/2637.md + - 2638. 统计 K-Free 子集的总数: lc/2638.md + - 2639. 查询网格图中每一列的宽度: lc/2639.md + - 2640. 一个数组所有前缀的分数: lc/2640.md + - 2641. 二叉树的堂兄弟节点 II: lc/2641.md + - 2642. 设计可以求最短路径的图类: lc/2642.md + - 2643. 一最多的行: lc/2643.md + - 2644. 找出可整除性得分最大的整数: lc/2644.md + - 2645. 构造有效字符串的最少插入数: lc/2645.md + - 2646. 最小化旅行的价格总和: lc/2646.md + - 2647. 把三角形染成红色: lc/2647.md + - 2648. 生成斐波那契数列: lc/2648.md + - 2649. 嵌套数组生成器: lc/2649.md + - 2650. 设计可取消函数: lc/2650.md + - 2651. 计算列车到站时间: lc/2651.md + - 2652. 倍数求和: lc/2652.md + - 2653. 滑动子数组的美丽值: lc/2653.md + - 2654. 使数组所有元素变成 1 的最少操作次数: lc/2654.md + - 2655. 寻找最大长度的未覆盖区间: lc/2655.md + - 2656. K 个元素的最大和: lc/2656.md + - 2657. 找到两个数组的前缀公共数组: lc/2657.md + - 2658. 网格图中鱼的最大数目: lc/2658.md + - 2659. 将数组清空: lc/2659.md + - 2660. 保龄球游戏的获胜者: lc/2660.md + - 2661. 找出叠涂元素: lc/2661.md + - 2662. 前往目标的最小代价: lc/2662.md + - 2663. 字典序最小的美丽字符串: lc/2663.md + - 2664. 巡逻的骑士: lc/2664.md + - 2665. 计数器 II: lc/2665.md + - 2666. 只允许一次函数调用: lc/2666.md + - 2667. 创建 Hello World 函数: lc/2667.md + - 2668. 查询员工当前薪水: lc/2668.md + - 2669. 统计 Spotify 排行榜上艺术家出现次数: lc/2669.md + - 2670. 找出不同元素数目差数组: lc/2670.md + - 2671. 频率跟踪器: lc/2671.md + - 2672. 有相同颜色的相邻元素数目: lc/2672.md + - 2673. 使二叉树所有路径值相等的最小代价: lc/2673.md + - 2674. 拆分循环链表: lc/2674.md + - 2675. 将对象数组转换为矩阵: lc/2675.md + - 2676. 节流: lc/2676.md + - 2677. 分块数组: lc/2677.md + - 2678. 老人的数目: lc/2678.md + - 2679. 矩阵中的和: lc/2679.md + - 2680. 最大或值: lc/2680.md + - 2681. 英雄的力量: lc/2681.md + - 2682. 找出转圈游戏输家: lc/2682.md + - 2683. 相邻值的按位异或: lc/2683.md + - 2684. 矩阵中移动的最大次数: lc/2684.md + - 2685. 统计完全连通分量的数量: lc/2685.md + - 2686. 即时食物配送 III: lc/2686.md + - 2687. 自行车的最后使用时间: lc/2687.md + - 2688. 查找活跃用户: lc/2688.md + - 2689. 从 Rope 树中提取第 K 个字符: lc/2689.md + - 2690. 无穷方法对象: lc/2690.md + - 2691. 不可变辅助工具: lc/2691.md + - 2692. 使对象不可变: lc/2692.md + - 2693. 使用自定义上下文调用函数: lc/2693.md + - 2694. 事件发射器: lc/2694.md + - 2695. 包装数组: lc/2695.md + - 2696. 删除子串后的字符串最小长度: lc/2696.md + - 2697. 字典序最小回文串: lc/2697.md + - 2698. 求一个整数的惩罚数: lc/2698.md + - 2699. 修改图中的边权: lc/2699.md + - 2700. 两个对象之间的差异: lc/2700.md + - 2701. 连续递增交易: lc/2701.md + - 2702. 使数字变为非正数的最小操作次数: lc/2702.md + - 2703. 返回传递的参数的长度: lc/2703.md + - 2704. 相等还是不相等: lc/2704.md + - 2705. 精简对象: lc/2705.md + - 2706. 购买两块巧克力: lc/2706.md + - 2707. 字符串中的额外字符: lc/2707.md + - 2708. 一个小组的最大实力值: lc/2708.md + - 2709. 最大公约数遍历: lc/2709.md + - 2710. 移除字符串中的尾随零: lc/2710.md + - 2711. 对角线上不同值的数量差: lc/2711.md + - 2712. 使所有字符相等的最小成本: lc/2712.md + - 2713. 矩阵中严格递增的单元格数: lc/2713.md + - 2714. 找到最短路径的 K 次跨越: lc/2714.md + - 2715. 执行可取消的延迟函数: lc/2715.md + - 2716. 最小化字符串长度: lc/2716.md + - 2717. 半有序排列: lc/2717.md + - 2718. 查询后矩阵的和: lc/2718.md + - 2719. 统计整数数目: lc/2719.md + - 2720. 受欢迎度百分比: lc/2720.md + - 2721. 并行执行异步函数: lc/2721.md + - 2722. 根据 ID 合并两个数组: lc/2722.md + - 2723. 两个 Promise 对象相加: lc/2723.md + - 2724. 排序方式: lc/2724.md + - 2725. 间隔取消: lc/2725.md + - 2726. 使用方法链的计算器: lc/2726.md + - 2727. 判断对象是否为空: lc/2727.md + - 2728. 计算一个环形街道上的房屋数量: lc/2728.md + - 2729. 判断一个数是否迷人: lc/2729.md + - 2730. 找到最长的半重复子字符串: lc/2730.md + - 2731. 移动机器人: lc/2731.md + - 2732. 找到矩阵中的好子集: lc/2732.md + - 2733. 既不是最小值也不是最大值: lc/2733.md + - 2734. 执行子串操作后的字典序最小字符串: lc/2734.md + - 2735. 收集巧克力: lc/2735.md + - 2736. 最大和查询: lc/2736.md + - 2737. 找到最近的标记节点: lc/2737.md + - 2738. 统计文本中单词的出现次数: lc/2738.md + - 2739. 总行驶距离: lc/2739.md + - 2740. 找出分区值: lc/2740.md + - 2741. 特别的排列: lc/2741.md + - 2742. 给墙壁刷油漆: lc/2742.md + - 2743. 计算没有重复字符的子字符串数量: lc/2743.md + - 2744. 最大字符串配对数目: lc/2744.md + - 2745. 构造最长的新字符串: lc/2745.md + - 2746. 字符串连接删减字母: lc/2746.md + - 2747. 统计没有收到请求的服务器数目: lc/2747.md + - 2748. 美丽下标对的数目: lc/2748.md + - 2749. 得到整数零需要执行的最少操作数: lc/2749.md + - 2750. 将数组划分成若干好子数组的方式: lc/2750.md + - 2751. 机器人碰撞: lc/2751.md + - 2752. 在连续天数上进行了最多交易次数的顾客: lc/2752.md + - 2753. 计算一个环形街道上的房屋数量 II: lc/2753.md + - 2754. 将函数绑定到上下文: lc/2754.md + - 2755. 深度合并两个对象: lc/2755.md + - 2756. 批处理查询: lc/2756.md + - 2757. 生成循环数组的值: lc/2757.md + - 2758. 下一天: lc/2758.md + - 2759. 将 JSON 字符串转换为对象: lc/2759.md + - 2760. 最长奇偶子数组: lc/2760.md + - 2761. 和等于目标值的质数对: lc/2761.md + - 2762. 不间断子数组: lc/2762.md + - 2763. 所有子数组中不平衡数字之和: lc/2763.md + - 2764. 数组是否表示某二叉树的前序遍历: lc/2764.md + - 2765. 最长交替子序列: lc/2765.md + - 2766. 重新放置石块: lc/2766.md + - 2767. 将字符串分割为最少的美丽子字符串: lc/2767.md + - 2768. 黑格子的数目: lc/2768.md + - 2769. 找出最大的可达成数字: lc/2769.md + - 2770. 达到末尾下标所需的最大跳跃次数: lc/2770.md + - 2771. 构造最长非递减子数组: lc/2771.md + - 2772. 使数组中的所有元素都等于零: lc/2772.md + - 2773. 特殊二叉树的高度: lc/2773.md + - 2774. 数组的上界: lc/2774.md + - 2775. 将 undefined 转为 null: lc/2775.md + - 2776. 转换回调函数为 Promise 函数: lc/2776.md + - 2777. 日期范围生成器: lc/2777.md + - 2778. 特殊元素平方和: lc/2778.md + - 2779. 数组的最大美丽值: lc/2779.md + - 2780. 合法分割的最小下标: lc/2780.md + - 2781. 最长合法子字符串的长度: lc/2781.md + - 2782. 唯一类别的数量: lc/2782.md + - 2783. 航班入座率和等待名单分析: lc/2783.md + - 2784. 检查数组是否是好的: lc/2784.md + - 2785. 将字符串中的元音字母排序: lc/2785.md + - 2786. 访问数组中的位置使分数最大: lc/2786.md + - 2787. 将一个数字表示成幂的和的方案数: lc/2787.md + - 2788. 按分隔符拆分字符串: lc/2788.md + - 2789. 合并后数组中的最大元素: lc/2789.md + - 2790. 长度递增组的最大数目: lc/2790.md + - 2791. 树中可以形成回文的路径数: lc/2791.md + - 2792. 计算满足条件的节点数: lc/2792.md + - 2793. 航班机票状态: lc/2793.md + - 2794. 从两个数组中创建对象: lc/2794.md + - 2795. 并行执行 Promise 以获取独有的结果: lc/2795.md + - 2796. 重复字符串: lc/2796.md + - 2797. 带有占位符的部分函数: lc/2797.md + - 2798. 满足目标工作时长的员工数目: lc/2798.md + - 2799. 统计完全子数组的数目: lc/2799.md + - 2800. 包含三个字符串的最短字符串: lc/2800.md + - 2801. 统计范围内的步进数字数目: lc/2801.md + - 2802. 找出第 K 个幸运数字: lc/2802.md + - 2803. 阶乘生成器: lc/2803.md + - 2804. 数组原型的 forEach 方法: lc/2804.md + - 2805. 自定义间隔: lc/2805.md + - 2806. 取整购买后的账户余额: lc/2806.md + - 2807. 在链表中插入最大公约数: lc/2807.md + - 2808. 使循环数组所有元素相等的最少秒数: lc/2808.md + - 2809. 使数组和小于等于 x 的最少时间: lc/2809.md + - 2810. 故障键盘: lc/2810.md + - 2811. 判断是否能拆分数组: lc/2811.md + - 2812. 找出最安全路径: lc/2812.md + - 2813. 子序列最大优雅度: lc/2813.md + - 2814. 避免淹死并到达目的地的最短时间: lc/2814.md + - 2815. 数组中的最大数对和: lc/2815.md + - 2816. 翻倍以链表形式表示的数字: lc/2816.md + - 2817. 限制条件下元素之间的最小绝对差: lc/2817.md + - 2818. 操作使得分最大: lc/2818.md + - 2819. 购买巧克力后的最小相对损失: lc/2819.md + - 2820. 选举结果: lc/2820.md + - 2821. 延迟每个 Promise 对象的解析: lc/2821.md + - 2822. 对象反转: lc/2822.md + - 2823. 深度对象筛选: lc/2823.md + - 2824. 统计和小于目标的下标对数目: lc/2824.md + - 2825. 循环增长使字符串子序列等于另一个字符串: lc/2825.md + - 2826. 将三个组排序: lc/2826.md + - 2827. 范围中美丽整数的数目: lc/2827.md + - 2828. 判别首字母缩略词: lc/2828.md + - 2829. k-avoiding 数组的最小总和: lc/2829.md + - 2830. 销售利润最大化: lc/2830.md + - 2831. 找出最长等值子数组: lc/2831.md + - 2832. 每个元素为最大值的最大范围: lc/2832.md + - 2833. 距离原点最远的点: lc/2833.md + - 2834. 找出美丽数组的最小和: lc/2834.md + - 2835. 使子序列的和等于目标的最少操作次数: lc/2835.md + - 2836. 在传球游戏中最大化函数值: lc/2836.md + - 2837. 总旅行距离: lc/2837.md + - 2838. Maximum Coins Heroes Can Collect: lc/2838.md + - 2839. 判断通过操作能否让字符串相等 I: lc/2839.md + - 2840. 判断通过操作能否让字符串相等 II: lc/2840.md + - 2841. 几乎唯一子数组的最大和: lc/2841.md + - 2842. 统计一个字符串的 k 子序列美丽值最大的数目: lc/2842.md + - 2843. 统计对称整数的数目: lc/2843.md + - 2844. 生成特殊数字的最少操作: lc/2844.md + - 2845. 统计趣味子数组的数目: lc/2845.md + - 2846. 边权重均等查询: lc/2846.md + - 2847. 给定数字乘积的最小数字: lc/2847.md + - 2848. 与车相交的点: lc/2848.md + - 2849. 判断能否在给定时间到达单元格: lc/2849.md + - 2850. 将石头分散到网格图的最少移动次数: lc/2850.md + - 2851. 字符串转换: lc/2851.md + - 2852. 所有单元格的远离程度之和: lc/2852.md + - 2853. 最高薪水差异: lc/2853.md + - 2854. 滚动平均步数: lc/2854.md + - 2855. 使数组成为递增数组的最少右移次数: lc/2855.md + - 2856. 删除数对后的最小数组长度: lc/2856.md + - 2857. 统计距离为 k 的点对: lc/2857.md + - 2858. 可以到达每一个节点的最少边反转次数: lc/2858.md + - 2859. 计算 K 置位下标对应元素的和: lc/2859.md + - 2860. 让所有学生保持开心的分组方法数: lc/2860.md + - 2861. 最大合金数: lc/2861.md + - 2862. 完全子集的最大元素和: lc/2862.md + - 2863. 最长半递减数组: lc/2863.md + - 2864. 最大二进制奇数: lc/2864.md + - 2865. 美丽塔 I: lc/2865.md + - 2866. 美丽塔 II: lc/2866.md + - 2867. 统计树中的合法路径数目: lc/2867.md + - 2868. 单词游戏: lc/2868.md + - 2869. 收集元素的最少操作次数: lc/2869.md + - 2870. 使数组为空的最少操作次数: lc/2870.md + - 2871. 将数组分割成最多数目的子数组: lc/2871.md + - 2872. 可以被 K 整除连通块的最大数目: lc/2872.md + - 2873. 有序三元组中的最大值 I: lc/2873.md + - 2874. 有序三元组中的最大值 II: lc/2874.md + - 2875. 无限数组的最短子数组: lc/2875.md + - 2876. 有向图访问计数: lc/2876.md + - 2877. 从表中创建 DataFrame: lc/2877.md + - 2878. 获取 DataFrame 的大小: lc/2878.md + - 2879. 显示前三行: lc/2879.md + - 2880. 数据选取: lc/2880.md + - 2881. 创建新列: lc/2881.md + - 2882. 删去重复的行: lc/2882.md + - 2883. 删去丢失的数据: lc/2883.md + - 2884. 修改列: lc/2884.md + - 2885. 重命名列: lc/2885.md + - 2886. 改变数据类型: lc/2886.md + - 2887. 填充缺失值: lc/2887.md + - 2888. 重塑数据：连结: lc/2888.md + - 2889. 数据重塑：透视: lc/2889.md + - 2890. 重塑数据：融合: lc/2890.md + - 2891. 方法链: lc/2891.md + - 2892. 将相邻元素相乘后得到最小化数组: lc/2892.md + - 2893. 计算每个区间内的订单: lc/2893.md + - 2894. 分类求和并作差: lc/2894.md + - 2895. 最小处理时间: lc/2895.md + - 2896. 执行操作使两个字符串相等: lc/2896.md + - 2897. 对数组执行操作使平方和最大: lc/2897.md + - 2898. 最大线性股票得分: lc/2898.md + - 2899. 上一个遍历的整数: lc/2899.md + - 2900. 最长相邻不相等子序列 I: lc/2900.md + - 2901. 最长相邻不相等子序列 II: lc/2901.md + - 2902. 和带限制的子多重集合的数目: lc/2902.md + - 2903. 找出满足差值条件的下标 I: lc/2903.md + - 2904. 最短且字典序最小的美丽子字符串: lc/2904.md + - 2905. 找出满足差值条件的下标 II: lc/2905.md + - 2906. 构造乘积矩阵: lc/2906.md + - 2907. 价格递增的最大利润三元组 I: lc/2907.md + - 2908. 元素和最小的山形三元组 I: lc/2908.md + - 2909. 元素和最小的山形三元组 II: lc/2909.md + - 2910. 合法分组的最少组数: lc/2910.md + - 2911. 得到 K 个半回文串的最少修改次数: lc/2911.md + - 2912. 在网格上移动到目的地的方法数: lc/2912.md + - 2913. 子数组不同元素数目的平方和 I: lc/2913.md + - 2914. 使二进制字符串变美丽的最少修改次数: lc/2914.md + - 2915. 和为目标值的最长子序列的长度: lc/2915.md + - 2916. 子数组不同元素数目的平方和 II: lc/2916.md + - 2917. 找出数组中的 K-or 值: lc/2917.md + - 2918. 数组的最小相等和: lc/2918.md + - 2919. 使数组变美的最小增量运算数: lc/2919.md + - 2920. 收集所有金币可获得的最大积分: lc/2920.md + - 2921. 价格递增的最大利润三元组 II: lc/2921.md + - 2922. 市场分析 III: lc/2922.md + - 2923. 找到冠军 I: lc/2923.md + - 2924. 找到冠军 II: lc/2924.md + - 2925. 在树上执行操作以后得到的最大分数: lc/2925.md + - 2926. 平衡子序列的最大和: lc/2926.md + - 2927. 给小朋友们分糖果 III: lc/2927.md + - 2928. 给小朋友们分糖果 I: lc/2928.md + - 2929. 给小朋友们分糖果 II: lc/2929.md + - 2930. 重新排列后包含指定子字符串的字符串数目: lc/2930.md + - 2931. 购买物品的最大开销: lc/2931.md + - 2932. 找出强数对的最大异或值 I: lc/2932.md + - 2933. 高访问员工: lc/2933.md + - 2934. 最大化数组末位元素的最少操作次数: lc/2934.md + - 2935. 找出强数对的最大异或值 II: lc/2935.md + - 2936. 包含相等值数字块的数量: lc/2936.md + - 2937. 使三个字符串相等: lc/2937.md + - 2938. 区分黑球与白球: lc/2938.md + - 2939. 最大异或乘积: lc/2939.md + - 2940. 找到 Alice 和 Bob 可以相遇的建筑: lc/2940.md + - 2941. 子数组的最大 GCD-Sum: lc/2941.md + - 2942. 查找包含给定字符的单词: lc/2942.md + - 2943. 最大化网格图中正方形空洞的面积: lc/2943.md + - 2944. 购买水果需要的最少金币数: lc/2944.md + - 2945. 找到最大非递减数组的长度: lc/2945.md + - 2946. 循环移位后的矩阵相似检查: lc/2946.md + - 2947. 统计美丽子字符串 I: lc/2947.md + - 2948. 交换得到字典序最小的数组: lc/2948.md + - 2949. 统计美丽子字符串 II: lc/2949.md + - 2950. 可整除子串的数量: lc/2950.md + - 2951. 找出峰值: lc/2951.md + - 2952. 需要添加的硬币的最小数量: lc/2952.md + - 2953. 统计完全子字符串: lc/2953.md + - 2954. 统计感冒序列的数目: lc/2954.md + - 2955. Number of Same-End Substrings: lc/2955.md + - 2956. 找到两个数组中的公共元素: lc/2956.md + - 2957. 消除相邻近似相等字符: lc/2957.md + - 2958. 最多 K 个重复元素的最长子数组: lc/2958.md + - 2959. 关闭分部的可行集合数目: lc/2959.md + - 2960. 统计已测试设备: lc/2960.md + - 2961. 双模幂运算: lc/2961.md + - 2962. 统计最大元素出现至少 K 次的子数组: lc/2962.md + - 2963. 统计好分割方案的数目: lc/2963.md + - 2964. 可被整除的三元组数量: lc/2964.md + - 2965. 找出缺失和重复的数字: lc/2965.md + - 2966. 划分数组并满足最大差限制: lc/2966.md + - 2967. 使数组成为等数数组的最小代价: lc/2967.md + - 2968. 执行操作使频率分数最大: lc/2968.md + - 2969. 购买水果需要的最少金币数 II: lc/2969.md + - 2970. 统计移除递增子数组的数目 I: lc/2970.md + - 2971. 找到最大周长的多边形: lc/2971.md + - 2972. 统计移除递增子数组的数目 II: lc/2972.md + - 2973. 树中每个节点放置的金币数目: lc/2973.md + - 2974. 最小数字游戏: lc/2974.md + - 2975. 移除栅栏得到的正方形田地的最大面积: lc/2975.md + - 2976. 转换字符串的最小成本 I: lc/2976.md + - 2977. 转换字符串的最小成本 II: lc/2977.md + - 2978. Symmetric Coordinates: lc/2978.md + - 2979. 最贵的无法购买的商品: lc/2979.md + - 2980. 检查按位或是否存在尾随零: lc/2980.md + - 2981. 找出出现至少三次的最长特殊子字符串 I: lc/2981.md + - 2982. 找出出现至少三次的最长特殊子字符串 II: lc/2982.md + - 2983. 回文串重新排列查询: lc/2983.md + - 2984. 找到每座城市的高峰通话时间: lc/2984.md + - 2985. 计算订单平均商品数量: lc/2985.md + - 2986. 找到第三笔交易: lc/2986.md + - 2987. 寻找房价最贵的城市: lc/2987.md + - 2988. 最大部门的经理: lc/2988.md + - 2989. 班级表现: lc/2989.md + - 2990. 贷款类型: lc/2990.md + - 2991. 最好的三家酒庄: lc/2991.md + - 2992. 自整除排列的数量: lc/2992.md + - 2993. Friday Purchases I: lc/2993.md + - 2994. Friday Purchases II: lc/2994.md + - 2995. 观众变主播: lc/2995.md + - 2996. 大于等于顺序前缀和的最小缺失整数: lc/2996.md + - 2997. 使数组异或和等于 K 的最少操作次数: lc/2997.md + - 2998. 使 X 和 Y 相等的最少操作次数: lc/2998.md + - 2999. 统计强大整数的数目: lc/2999.md + - 3000. 对角线最长的矩形的面积: lc/3000.md + - 3001. 捕获黑皇后需要的最少移动次数: lc/3001.md + - 3002. 移除后集合的最多元素数: lc/3002.md + - 3003. 执行操作后的最大分割数量: lc/3003.md + - 3004. Maximum Subtree of the Same Color: lc/3004.md + - 3005. 最大频率元素计数: lc/3005.md + - 3006. 找出数组中的美丽下标 I: lc/3006.md + - 3007. 价值和小于等于 K 的最大数字: lc/3007.md + - 3008. 找出数组中的美丽下标 II: lc/3008.md + - 剑指 Offer（第 2 版）: + - 3. 数组中重复的数字: lcof/3.md + - 4. 二维数组中的查找: lcof/4.md + - 5. 替换空格: lcof/5.md + - 6. 从尾到头打印链表: lcof/6.md + - 7. 重建二叉树: lcof/7.md + - 9. 用两个栈实现队列: lcof/9.md + - 10.1. 斐波那契数列: lcof/10.1.md + - 10.2. 青蛙跳台阶问题: lcof/10.2.md + - 11. 旋转数组的最小数字: lcof/11.md + - 12. 矩阵中的路径: lcof/12.md + - 13. 机器人的运动范围: lcof/13.md + - 14.1. 剪绳子: lcof/14.1.md + - 14.2. 剪绳子 II: lcof/14.2.md + - 15. 二进制中 1 的个数: lcof/15.md + - 16. 数值的整数次方: lcof/16.md + - 17. 打印从 1 到最大的 n 位数: lcof/17.md + - 18. 删除链表的节点: lcof/18.md + - 19. 正则表达式匹配: lcof/19.md + - 20. 表示数值的字符串: lcof/20.md + - 21. 调整数组顺序使奇数位于偶数前面: lcof/21.md + - 22. 链表中倒数第 k 个节点: lcof/22.md + - 24. 反转链表: lcof/24.md + - 25. 合并两个排序的链表: lcof/25.md + - 26. 树的子结构: lcof/26.md + - 27. 二叉树的镜像: lcof/27.md + - 28. 对称的二叉树: lcof/28.md + - 29. 顺时针打印矩阵: lcof/29.md + - 30. 包含 min 函数的栈: lcof/30.md + - 31. 栈的压入、弹出序列: lcof/31.md + - 32.1. 从上到下打印二叉树: lcof/32.1.md + - 32.2. 从上到下打印二叉树 II: lcof/32.2.md + - 32.3. 从上到下打印二叉树 III: lcof/32.3.md + - 33. 二叉搜索树的后序遍历序列: lcof/33.md + - 34. 二叉树中和为某一值的路径: lcof/34.md + - 35. 复杂链表的复制: lcof/35.md + - 36. 二叉搜索树与双向链表: lcof/36.md + - 37. 序列化二叉树: lcof/37.md + - 38. 字符串的排列: lcof/38.md + - 39. 数组中出现次数超过一半的数字: lcof/39.md + - 40. 最小的 k 个数: lcof/40.md + - 41. 数据流中的中位数: lcof/41.md + - 42. 连续子数组的最大和: lcof/42.md + - 43. 1 ～ n 整数中 1 出现的次数: lcof/43.md + - 44. 数字序列中某一位的数字: lcof/44.md + - 45. 把数组排成最小的数: lcof/45.md + - 46. 把数字翻译成字符串: lcof/46.md + - 47. 礼物的最大价值: lcof/47.md + - 48. 最长不含重复字符的子字符串: lcof/48.md + - 49. 丑数: lcof/49.md + - 50. 第一个只出现一次的字符: lcof/50.md + - 51. 数组中的逆序对: lcof/51.md + - 52. 两个链表的第一个公共节点: lcof/52.md + - 53.1. 在排序数组中查找数字 I: lcof/53.1.md + - 53.2. ～ n-1 中缺失的数字: lcof/53.2.md + - 54. 二叉搜索树的第 k 大节点: lcof/54.md + - 55.1. 二叉树的深度: lcof/55.1.md + - 55.2. 平衡二叉树: lcof/55.2.md + - 56.1. 数组中数字出现的次数: lcof/56.1.md + - 56.2. 数组中数字出现的次数 II: lcof/56.2.md + - 57.2. 和为 s 的连续正数序列: lcof/57.2.md + - 57. 和为 s 的两个数字: lcof/57.md + - 58.1. 翻转单词顺序: lcof/58.1.md + - 58.2. 左旋转字符串: lcof/58.2.md + - 59.1. 滑动窗口的最大值: lcof/59.1.md + - 59.2. 队列的最大值: lcof/59.2.md + - 60. n 个骰子的点数: lcof/60.md + - 61. 扑克牌中的顺子: lcof/61.md + - 62. 圆圈中最后剩下的数字: lcof/62.md + - 63. 股票的最大利润: lcof/63.md + - 64. 求 1+2+…+n: lcof/64.md + - 65. 不用加减乘除做加法: lcof/65.md + - 66. 构建乘积数组: lcof/66.md + - 67. 把字符串转换成整数: lcof/67.md + - 68.1. 二叉搜索树的最近公共祖先: lcof/68.1.md + - 68.2. 二叉树的最近公共祖先: lcof/68.2.md + - 剑指 Offer（专项突击版）: + - 1. 整数除法: lcof2/1.md + - 2. 二进制加法: lcof2/2.md + - 3. 前 n 个数字二进制中 1 的个数: lcof2/3.md + - 4. 只出现一次的数字: lcof2/4.md + - 5. 单词长度的最大乘积: lcof2/5.md + - 6. 排序数组中两个数字之和: lcof2/6.md + - 7. 数组中和为 0 的三个数: lcof2/7.md + - 8. 和大于等于 target 的最短子数组: lcof2/8.md + - 9. 乘积小于 K 的子数组: lcof2/9.md + - 10. 和为 k 的子数组: lcof2/10.md + - 11. 和 1 个数相同的子数组: lcof2/11.md + - 12. 左右两边子数组的和相等: lcof2/12.md + - 13. 二维子矩阵的和: lcof2/13.md + - 14. 字符串中的变位词: lcof2/14.md + - 15. 字符串中的所有变位词: lcof2/15.md + - 16. 不含重复字符的最长子字符串: lcof2/16.md + - 17. 含有所有字符的最短字符串: lcof2/17.md + - 18. 有效的回文: lcof2/18.md + - 19. 最多删除一个字符得到回文: lcof2/19.md + - 20. 回文子字符串的个数: lcof2/20.md + - 21. 删除链表的倒数第 n 个结点: lcof2/21.md + - 22. 链表中环的入口节点: lcof2/22.md + - 23. 两个链表的第一个重合节点: lcof2/23.md + - 24. 反转链表: lcof2/24.md + - 25. 链表中的两数相加: lcof2/25.md + - 26. 重排链表: lcof2/26.md + - 27. 回文链表: lcof2/27.md + - 28. 展平多级双向链表: lcof2/28.md + - 29. 排序的循环链表: lcof2/29.md + - 30. 插入、删除和随机访问都是 O(1) 的容器: lcof2/30.md + - 31. 最近最少使用缓存: lcof2/31.md + - 32. 有效的变位词: lcof2/32.md + - 33. 变位词组: lcof2/33.md + - 34. 外星语言是否排序: lcof2/34.md + - 35. 最小时间差: lcof2/35.md + - 36. 后缀表达式: lcof2/36.md + - 37. 小行星碰撞: lcof2/37.md + - 38. 每日温度: lcof2/38.md + - 39. 直方图最大矩形面积: lcof2/39.md + - 40. 矩阵中最大的矩形: lcof2/40.md + - 41. 滑动窗口的平均值: lcof2/41.md + - 42. 最近请求次数: lcof2/42.md + - 43. 往完全二叉树添加节点: lcof2/43.md + - 44. 二叉树每层的最大值: lcof2/44.md + - 45. 二叉树最底层最左边的值: lcof2/45.md + - 46. 二叉树的右侧视图: lcof2/46.md + - 47. 二叉树剪枝: lcof2/47.md + - 48. 序列化与反序列化二叉树: lcof2/48.md + - 49. 从根节点到叶节点的路径数字之和: lcof2/49.md + - 50. 向下的路径节点之和: lcof2/50.md + - 51. 节点之和最大的路径: lcof2/51.md + - 52. 展平二叉搜索树: lcof2/52.md + - 53. 二叉搜索树中的中序后继: lcof2/53.md + - 54. 所有大于等于节点的值之和: lcof2/54.md + - 55. 二叉搜索树迭代器: lcof2/55.md + - 56. 二叉搜索树中两个节点之和: lcof2/56.md + - 57. 值和下标之差都在给定的范围内: lcof2/57.md + - 58. 日程表: lcof2/58.md + - 59. 数据流的第 K 大数值: lcof2/59.md + - 60. 出现频率最高的 k 个数字: lcof2/60.md + - 61. 和最小的 k 个数对: lcof2/61.md + - 62. 实现前缀树: lcof2/62.md + - 63. 替换单词: lcof2/63.md + - 64. 神奇的字典: lcof2/64.md + - 65. 最短的单词编码: lcof2/65.md + - 66. 单词之和: lcof2/66.md + - 67. 最大的异或: lcof2/67.md + - 68. 查找插入位置: lcof2/68.md + - 69. 山峰数组的顶部: lcof2/69.md + - 70. 排序数组中只出现一次的数字: lcof2/70.md + - 71. 按权重生成随机数: lcof2/71.md + - 72. 求平方根: lcof2/72.md + - 73. 狒狒吃香蕉: lcof2/73.md + - 74. 合并区间: lcof2/74.md + - 75. 数组相对排序: lcof2/75.md + - 76. 数组中的第 k 大的数字: lcof2/76.md + - 77. 链表排序: lcof2/77.md + - 78. 合并排序链表: lcof2/78.md + - 79. 所有子集: lcof2/79.md + - 80. 含有 k 个元素的组合: lcof2/80.md + - 81. 允许重复选择元素的组合: lcof2/81.md + - 82. 含有重复元素集合的组合: lcof2/82.md + - 83. 没有重复元素集合的全排列: lcof2/83.md + - 84. 含有重复元素集合的全排列: lcof2/84.md + - 85. 生成匹配的括号: lcof2/85.md + - 86. 分割回文子字符串: lcof2/86.md + - 87. 复原 IP: lcof2/87.md + - 88. 爬楼梯的最少成本: lcof2/88.md + - 89. 房屋偷盗: lcof2/89.md + - 90. 环形房屋偷盗: lcof2/90.md + - 91. 粉刷房子: lcof2/91.md + - 92. 翻转字符: lcof2/92.md + - 93. 最长斐波那契数列: lcof2/93.md + - 94. 最少回文分割: lcof2/94.md + - 95. 最长公共子序列: lcof2/95.md + - 96. 字符串交织: lcof2/96.md + - 97. 子序列的数目: lcof2/97.md + - 98. 路径的数目: lcof2/98.md + - 99. 最小路径之和: lcof2/99.md + - 100. 三角形中最小路径之和: lcof2/100.md + - 101. 分割等和子串: lcof2/101.md + - 102. 加减的目标值: lcof2/102.md + - 103. 最少的硬币数目: lcof2/103.md + - 104. 排列的数目: lcof2/104.md + - 105. 岛屿的最大面积: lcof2/105.md + - 106. 二分图: lcof2/106.md + - 107. 矩阵中的距离: lcof2/107.md + - 108. 单词演变: lcof2/108.md + - 109. 开密码锁: lcof2/109.md + - 110. 所有路径: lcof2/110.md + - 111. 计算除法: lcof2/111.md + - 112. 最长递增路径: lcof2/112.md + - 113. 课程顺序: lcof2/113.md + - 114. 外星文字典: lcof2/114.md + - 115. 重建序列: lcof2/115.md + - 116. 朋友圈: lcof2/116.md + - 117. 相似的字符串: lcof2/117.md + - 118. 多余的边: lcof2/118.md + - 119. 最长连续序列: lcof2/119.md + - 程序员面试金典（第 6 版）: + - 1.1. 判定字符是否唯一: lcci/1.1.md + - 1.2. 判定是否互为字符重排: lcci/1.2.md + - 1.3. URL 化: lcci/1.3.md + - 1.4. 回文排列: lcci/1.4.md + - 1.5. 一次编辑: lcci/1.5.md + - 1.6. 字符串压缩: lcci/1.6.md + - 1.7. 旋转矩阵: lcci/1.7.md + - 1.8. 零矩阵: lcci/1.8.md + - 1.9. 字符串轮转: lcci/1.9.md + - 2.1. 移除重复节点: lcci/2.1.md + - 2.2. 返回倒数第 k 个节点: lcci/2.2.md + - 2.3. 删除中间节点: lcci/2.3.md + - 2.4. 分割链表: lcci/2.4.md + - 2.5. 链表求和: lcci/2.5.md + - 2.6. 回文链表: lcci/2.6.md + - 2.7. 链表相交: lcci/2.7.md + - 2.8. 环路检测: lcci/2.8.md + - 3.1. 三合一: lcci/3.1.md + - 3.2. 栈的最小值: lcci/3.2.md + - 3.3. 堆盘子: lcci/3.3.md + - 3.4. 化栈为队: lcci/3.4.md + - 3.5. 栈排序: lcci/3.5.md + - 3.6. 动物收容所: lcci/3.6.md + - 4.1. 节点间通路: lcci/4.1.md + - 4.2. 最小高度树: lcci/4.2.md + - 4.3. 特定深度节点链表: lcci/4.3.md + - 4.4. 检查平衡性: lcci/4.4.md + - 4.5. 合法二叉搜索树: lcci/4.5.md + - 4.6. 后继者: lcci/4.6.md + - 4.8. 首个共同祖先: lcci/4.8.md + - 4.9. 二叉搜索树序列: lcci/4.9.md + - 4.10. 检查子树: lcci/4.10.md + - 4.12. 求和路径: lcci/4.12.md + - 5.1. 插入: lcci/5.1.md + - 5.2. 二进制数转字符串: lcci/5.2.md + - 5.3. 翻转数位: lcci/5.3.md + - 5.4. 下一个数: lcci/5.4.md + - 5.6. 整数转换: lcci/5.6.md + - 5.7. 配对交换: lcci/5.7.md + - 5.8. 绘制直线: lcci/5.8.md + - 8.1. 三步问题: lcci/8.1.md + - 8.2. 迷路的机器人: lcci/8.2.md + - 8.3. 魔术索引: lcci/8.3.md + - 8.4. 幂集: lcci/8.4.md + - 8.5. 递归乘法: lcci/8.5.md + - 8.6. 汉诺塔问题: lcci/8.6.md + - 8.7. 无重复字符串的排列组合: lcci/8.7.md + - 8.8. 有重复字符串的排列组合: lcci/8.8.md + - 8.9. 括号: lcci/8.9.md + - 8.10. 颜色填充: lcci/8.10.md + - 8.11. 硬币: lcci/8.11.md + - 8.12. 八皇后: lcci/8.12.md + - 8.13. 堆箱子: lcci/8.13.md + - 8.14. 布尔运算: lcci/8.14.md + - 10.1. 合并排序的数组: lcci/10.1.md + - 10.2. 变位词组: lcci/10.2.md + - 10.3. 搜索旋转数组: lcci/10.3.md + - 10.5. 稀疏数组搜索: lcci/10.5.md + - 10.9. 排序矩阵查找: lcci/10.9.md + - 10.10. 数字流的秩: lcci/10.10.md + - 10.11. 峰与谷: lcci/10.11.md + - 16.1. 交换数字: lcci/16.1.md + - 16.2. 单词频率: lcci/16.2.md + - 16.3. 交点: lcci/16.3.md + - 16.4. 井字游戏: lcci/16.4.md + - 16.5. 阶乘尾数: lcci/16.5.md + - 16.6. 最小差: lcci/16.6.md + - 16.7. 最大数值: lcci/16.7.md + - 16.8. 整数的英语表示: lcci/16.8.md + - 16.9. 运算: lcci/16.9.md + - 16.10. 生存人数: lcci/16.10.md + - 16.11. 跳水板: lcci/16.11.md + - 16.13. 平分正方形: lcci/16.13.md + - 16.14. 最佳直线: lcci/16.14.md + - 16.15. 珠玑妙算: lcci/16.15.md + - 16.16. 部分排序: lcci/16.16.md + - 16.17. 连续数列: lcci/16.17.md + - 16.18. 模式匹配: lcci/16.18.md + - 16.19. 水域大小: lcci/16.19.md + - 16.20. T9 键盘: lcci/16.20.md + - 16.21. 交换和: lcci/16.21.md + - 16.22. 兰顿蚂蚁: lcci/16.22.md + - 16.24. 数对和: lcci/16.24.md + - 16.25. LRU 缓存: lcci/16.25.md + - 16.26. 计算器: lcci/16.26.md + - 17.1. 不用加号的加法: lcci/17.1.md + - 17.4. 消失的数字: lcci/17.4.md + - 17.5. 字母与数字: lcci/17.5.md + - 17.6. 2 出现的次数: lcci/17.6.md + - 17.7. 婴儿名字: lcci/17.7.md + - 17.8. 马戏团人塔: lcci/17.8.md + - 17.9. 第 k 个数: lcci/17.9.md + - 17.10. 主要元素: lcci/17.10.md + - 17.11. 单词距离: lcci/17.11.md + - 17.12. BiNode: lcci/17.12.md + - 17.13. 恢复空格: lcci/17.13.md + - 17.14. 最小 K 个数: lcci/17.14.md + - 17.15. 最长单词: lcci/17.15.md + - 17.16. 按摩师: lcci/17.16.md + - 17.17. 多次搜索: lcci/17.17.md + - 17.18. 最短超串: lcci/17.18.md + - 17.19. 消失的两个数字: lcci/17.19.md + - 17.20. 连续中值: lcci/17.20.md + - 17.21. 直方图的水量: lcci/17.21.md + - 17.22. 单词转换: lcci/17.22.md + - 17.23. 最大黑方阵: lcci/17.23.md + - 17.24. 最大子矩阵: lcci/17.24.md + - 17.25. 单词矩阵: lcci/17.25.md + - 17.26. 稀疏相似度: lcci/17.26.md diff --git a/requirements.txt b/requirements.txt index ef7a0bc088e95..d7857f1f69916 100644 --- a/requirements.txt +++ b/requirements.txt @@ -2,3 +2,6 @@ black==23.3.0 Requests==2.31.0 sortedcontainers==2.4.0 urllib3==1.26.18 +mkdocs-git-committers-plugin-2==2.2.3 +mkdocs-material==9.5.4 +jieba==0.42.1 \ No newline at end of file