leetcode

= LeetCode ifdef::env-github[] :tip-caption: 💡 :note-caption: ℹ️ :important-caption: ❗ :caution-caption: 🔥 :warning-caption: ⚠️ endif::[] :leetcode_base_url: https://leetcode.com/problems :source_base_url: link:./src/main/java/com/diguage/algo/leetcode :doc_base_url: link:./docs

== 友情支持

如果觉得对您有所帮助，看在D瓜哥码这么多字的辛苦上，请友情支持一下，D瓜哥感激不尽，😜

[cols="2*^",frame=none] |=== | image:docs/images/alipay.png[title="支付宝", alt="支付宝", width="90%"] | image:docs/images/wxpay.jpg[title="微信", alt="微信", width="90%"] |===

有些打赏的朋友希望可以加个好友，欢迎关注D瓜哥的微信公众号，这样就可以通过公众号的回复直接给我发信息。

image::docs/images/wx-jikerizhi.png[align="center",width=98%]

TIP: 公众号的微信号是: jikerizhi。因为众所周知的原因，有时图片加载不出来。如果图片加载不出来可以直接通过搜索微信号来查找我的公众号。

== LeetCode Problems

[cols="8,38,8,9,10,27",options="header"] |=== |序号 |标题 |代码 |题解 |难度 |备注

|{counter:codes} |{leetcode_base_url}/two-sum/[1. Two Sum^] |{source_base_url}/_0001_TwoSum.java[Java] |{doc_base_url}/0001-two-sum.adoc[题解] |Easy |

|{counter:codes} |{leetcode_base_url}/add-two-numbers/[2. Add Two Numbers^] |{source_base_url}/_0002_AddTwoNumbers.java[Java] |{doc_base_url}/0002-add-two-numbers.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/longest-substring-without-repeating-characters/[3. Longest Substring Without Repeating Characters^] |{source_base_url}/_0003_LongestSubstringWithoutRepeatingCharacters.java[Java] |{doc_base_url}/0003-longest-substring-without-repeating-characters.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/median-of-two-sorted-arrays/[4. Median of Two Sorted Arrays^] |{source_base_url}/_0004_MedianOfTwoSortedArrays.java[Java] |{doc_base_url}/0004-median-of-two-sorted-arrays.adoc[题解] |Hard |

|{counter:codes} |{leetcode_base_url}/longest-palindromic-substring/[5. Longest Palindromic Substring^] |{source_base_url}/_0005_LongestPalindromicSubstring.java[Java] |{doc_base_url}/0005-longest-palindromic-substring.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/zigzag-conversion/[6. ZigZag Conversion^] |{source_base_url}/_0006_ZigZagConversion.java[Java] |{doc_base_url}/0006-zigzag-conversion.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/reverse-integer/[7. Reverse Integer^] |{source_base_url}/_0007_ReverseInteger.java[Java] |{doc_base_url}/0007-reverse-integer.adoc[题解] |Easy |

|{counter:codes} |{leetcode_base_url}/string-to-integer-atoi/[8. String to Integer (atoi)^] |{source_base_url}/_0008_StringToIntegerAtoi.java[Java] |{doc_base_url}/0008-string-to-integer-atoi.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/palindrome-number/[9. Palindrome Number^] |{source_base_url}/_0009_PalindromeNumber.java[Java] |{doc_base_url}/0009-palindrome-number.adoc[题解] |Easy |

//|{counter:codes} //|{leetcode_base_url}/regular-expression-matching/[10. Regular Expression Matching^] //|{source_base_url}/_0010_RegularExpressionMatching.java[Java] //|{doc_base_url}/0010-regular-expression-matching.adoc[题解] //|Hard //|

|{counter:codes} |{leetcode_base_url}/container-with-most-water/[11. Container With Most Water^] |{source_base_url}/_0011_ContainerWithMostWater.java[Java] |{doc_base_url}/0011-container-with-most-water.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/integer-to-roman/[12. Integer to Roman^] |{source_base_url}/_0012_IntegerToRoman.java[Java] |{doc_base_url}/0012-integer-to-roman.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/roman-to-integer/[13. Roman to Integer^] |{source_base_url}/_0013_RomanToInteger.java[Java] |{doc_base_url}/0013-roman-to-integer.adoc[题解] |Easy |

|{counter:codes} |{leetcode_base_url}/longest-common-prefix/[14. Longest Common Prefix^] |{source_base_url}/_0014_LongestCommonPrefix.java[Java] |{doc_base_url}/0014-longest-common-prefix.adoc[题解] |Easy |

|{counter:codes} |{leetcode_base_url}/3sum/[15. 3Sum^] |{source_base_url}/_0015_3Sum.java[Java] |{doc_base_url}/0015-3sum.adoc[题解] |Medium |双指针

|{counter:codes} |{leetcode_base_url}/3sum-closest/[16. 3Sum Closest^] |{source_base_url}/_0016_3SumClosest.java[Java] |{doc_base_url}/0016-3sum-closest.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/letter-combinations-of-a-phone-number/[17. Letter Combinations of a Phone Number^] |{source_base_url}/_0017_LetterCombinationsOfAPhoneNumber.java[Java] |{doc_base_url}/0017-letter-combinations-of-a-phone-number.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/4sum/[18. 4Sum^] |{source_base_url}/_0018_4Sum.java[Java] |{doc_base_url}/0018-4sum.adoc[题解] |Medium |双指针

|{counter:codes} |{leetcode_base_url}/remove-nth-node-from-end-of-list/[19. Remove Nth Node From End of List^] |{source_base_url}/_0019_RemoveNthNodeFromEndOfList.java[Java] |{doc_base_url}/0019-remove-nth-node-from-end-of-list.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/valid-parentheses/[20. Valid Parentheses^] |{source_base_url}/_0020_ValidParentheses.java[Java] |{doc_base_url}/0020-valid-parentheses.adoc[题解] |Easy |

|{counter:codes} |{leetcode_base_url}/merge-two-sorted-lists/[21. Merge Two Sorted Lists^] |{source_base_url}/_0021_MergeTwoSortedLists.java[Java] |{doc_base_url}/0021-merge-two-sorted-lists.adoc[题解] |Easy |

|{counter:codes} |{leetcode_base_url}/generate-parentheses/[22. Generate Parentheses^] |{source_base_url}/_0022_GenerateParentheses.java[Java] |{doc_base_url}/0022-generate-parentheses.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/merge-k-sorted-lists/[23. Merge k Sorted Lists^] |{source_base_url}/_0023_MergeKSortedLists.java[Java] |{doc_base_url}/0023-merge-k-sorted-lists.adoc[题解] |Hard |

|{counter:codes} |{leetcode_base_url}/swap-nodes-in-pairs/[24. Swap Nodes in Pairs^] |{source_base_url}/_0024_SwapNodesInPairs.java[Java] |{doc_base_url}/0024-swap-nodes-in-pairs.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/reverse-nodes-in-k-group/[25. Reverse Nodes in k-Group^] //|{source_base_url}/_0025_ReverseNodesInKGroup.java[Java] //|{doc_base_url}/0025-reverse-nodes-in-k-group.adoc[题解] //|Hard //|

|{counter:codes} |{leetcode_base_url}/remove-duplicates-from-sorted-array/[26. Remove Duplicates from Sorted Array^] |{source_base_url}/_0026_RemoveDuplicatesFromSortedArray.java[Java] |{doc_base_url}/0026-remove-duplicates-from-sorted-array.adoc[题解] |Easy |

|{counter:codes} |{leetcode_base_url}/remove-element/[27. Remove Element^] |{source_base_url}/_0027_RemoveElement.java[Java] |{doc_base_url}/0027-remove-element.adoc[题解] |Easy |

|{counter:codes} |{leetcode_base_url}/implement-strstr/[28. Implement strStr()^] |{source_base_url}/_0028_ImplementStrStr.java[Java] |{doc_base_url}/0028-implement-strstr.adoc[题解] |Easy |

|{counter:codes} |{leetcode_base_url}/divide-two-integers/[29. Divide Two Integers^] |{source_base_url}/_0029_DivideTwoIntegers.java[Java] |{doc_base_url}/0029-divide-two-integers.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/substring-with-concatenation-of-all-words/[30. Substring with Concatenation of All Words^] //|{source_base_url}/_0030_SubstringWithConcatenationOfAllWords.java[Java] //|{doc_base_url}/0030-substring-with-concatenation-of-all-words.adoc[题解] //|Hard //|

|{counter:codes} |{leetcode_base_url}/next-permutation/[31. Next Permutation^] |{source_base_url}/_0031_NextPermutation.java[Java] |{doc_base_url}/0031-next-permutation.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/longest-valid-parentheses/[32. Longest Valid Parentheses^] //|{source_base_url}/_0032_LongestValidParentheses.java[Java] //|{doc_base_url}/0032-longest-valid-parentheses.adoc[题解] //|Hard //|

|{counter:codes} |{leetcode_base_url}/search-in-rotated-sorted-array/[33. Search in Rotated Sorted Array^] |{source_base_url}/_0033_SearchInRotatedSortedArray.java[Java] |{doc_base_url}/0033-search-in-rotated-sorted-array.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/find-first-and-last-position-of-element-in-sorted-array/[34. Find First and Last Position of Element in Sorted Array^] |{source_base_url}/_0034_FindFirstAndLastPositionOfElementInSortedArray.java[Java] |{doc_base_url}/0034-find-first-and-last-position-of-element-in-sorted-array.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/search-insert-position/[35. Search Insert Position^] |{source_base_url}/_0035_SearchInsertPosition.java[Java] |{doc_base_url}/0035-search-insert-position.adoc[题解] |Easy |

|{counter:codes} |{leetcode_base_url}/valid-sudoku/[36. Valid Sudoku^] |{source_base_url}/_0036_ValidSudoku.java[Java] |{doc_base_url}/0036-valid-sudoku.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/sudoku-solver/[37. Sudoku Solver^] |{source_base_url}/_0037_SudokuSolver.java[Java] |{doc_base_url}/0037-sudoku-solver.adoc[题解] |Hard |

|{counter:codes} |{leetcode_base_url}/count-and-say/[38. Count and Say^] |{source_base_url}/_0038_CountAndSay.java[Java] |{doc_base_url}/0038-count-and-say.adoc[题解] |Easy |

|{counter:codes} |{leetcode_base_url}/combination-sum/[39. Combination Sum^] |{source_base_url}/_0039_CombinationSum.java[Java] |{doc_base_url}/0039-combination-sum.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/combination-sum-ii/[40. Combination Sum II^] |{source_base_url}/_0040_CombinationSumII.java[Java] |{doc_base_url}/0040-combination-sum-ii.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/first-missing-positive/[41. First Missing Positive^] |{source_base_url}/_0041_FirstMissingPositive.java[Java] |{doc_base_url}/0041-first-missing-positive.adoc[题解] |Hard |

|{counter:codes} |{leetcode_base_url}/trapping-rain-water/[42. Trapping Rain Water^] |{source_base_url}/_0042_TrappingRainWater.java[Java] |{doc_base_url}/0042-trapping-rain-water.adoc[题解] |Hard |单调栈

|{counter:codes} |{leetcode_base_url}/multiply-strings/[43. Multiply Strings^] |{source_base_url}/_0043_MultiplyStrings.java[Java] |{doc_base_url}/0043-multiply-strings.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/wildcard-matching/[44. Wildcard Matching^] //|{source_base_url}/_0044_WildcardMatching.java[Java] //|{doc_base_url}/0044-wildcard-matching.adoc[题解] //|Hard //|

|{counter:codes} |{leetcode_base_url}/jump-game-ii/[45. Jump Game II^] |{source_base_url}/_0045_JumpGameII.java[Java] |{doc_base_url}/0045-jump-game-ii.adoc[题解] |Hard |

|{counter:codes} |{leetcode_base_url}/permutations/[46. Permutations^] |{source_base_url}/_0046_Permutations.java[Java] |{doc_base_url}/0046-permutations.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/permutations-ii/[47. Permutations II^] |{source_base_url}/_0047_PermutationsII.java[Java] |{doc_base_url}/0047-permutations-ii.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/rotate-image/[48. Rotate Image^] |{source_base_url}/_0048_RotateImage.java[Java] |{doc_base_url}/0048-rotate-image.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/group-anagrams/[49. Group Anagrams^] |{source_base_url}/_0049_GroupAnagrams.java[Java] |{doc_base_url}/0049-group-anagrams.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/powx-n/[50. Pow(x, n)^] |{source_base_url}/_0050_PowXN.java[Java] |{doc_base_url}/0050-powx-n.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/n-queens/[51. N-Queens^] |{source_base_url}/_0051_NQueens.java[Java] |{doc_base_url}/0051-n-queens.adoc[题解] |Hard |

|{counter:codes} |{leetcode_base_url}/n-queens-ii/[52. N-Queens II^] |{source_base_url}/_0052_NQueensII.java[Java] |{doc_base_url}/0052-n-queens-ii.adoc[题解] |Hard |

|{counter:codes} |{leetcode_base_url}/maximum-subarray/[53. Maximum Subarray^] |{source_base_url}/_0053_MaximumSubarray.java[Java] |{doc_base_url}/0053-maximum-subarray.adoc[题解] |Easy |

|{counter:codes} |{leetcode_base_url}/spiral-matrix/[54. Spiral Matrix^] |{source_base_url}/_0054_SpiralMatrix.java[Java] |{doc_base_url}/0054-spiral-matrix.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/jump-game/[55. Jump Game^] |{source_base_url}/_0055_JumpGame.java[Java] |{doc_base_url}/0055-jump-game.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/merge-intervals/[56. Merge Intervals^] |{source_base_url}/_0056_MergeIntervals.java[Java] |{doc_base_url}/0056-merge-intervals.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/insert-interval/[57. Insert Interval^] |{source_base_url}/_0057_InsertInterval.java[Java] |{doc_base_url}/0057-insert-interval.adoc[题解] |Hard |

|{counter:codes} |{leetcode_base_url}/length-of-last-word/[58. Length of Last Word^] |{source_base_url}/_0058_LengthOfLastWord.java[Java] |{doc_base_url}/0058-length-of-last-word.adoc[题解] |Easy |

|{counter:codes} |{leetcode_base_url}/spiral-matrix-ii/[59. Spiral Matrix II^] |{source_base_url}/_0059_SpiralMatrixII.java[Java] |{doc_base_url}/0059-spiral-matrix-ii.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/permutation-sequence/[60. Permutation Sequence^] |{source_base_url}/_0060_PermutationSequence.java[Java] |{doc_base_url}/0060-permutation-sequence.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/rotate-list/[61. Rotate List^] |{source_base_url}/_0061_RotateList.java[Java] |{doc_base_url}/0061-rotate-list.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/unique-paths/[62. Unique Paths^] |{source_base_url}/_0062_UniquePaths.java[Java] |{doc_base_url}/0062-unique-paths.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/unique-paths-ii/[63. Unique Paths II^] |{source_base_url}/_0063_UniquePathsII.java[Java] |{doc_base_url}/0063-unique-paths-ii.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/minimum-path-sum/[64. Minimum Path Sum^] |{source_base_url}/_0064_MinimumPathSum.java[Java] |{doc_base_url}/0064-minimum-path-sum.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/valid-number/[65. Valid Number^] //|{source_base_url}/_0065_ValidNumber.java[Java] //|{doc_base_url}/0065-valid-number.adoc[题解] //|Hard //|

|{counter:codes} |{leetcode_base_url}/plus-one/[66. Plus One^] |{source_base_url}/_0066_PlusOne.java[Java] |{doc_base_url}/0066-plus-one.adoc[题解] |Easy |

|{counter:codes} |{leetcode_base_url}/add-binary/[67. Add Binary^] |{source_base_url}/_0067_AddBinary.java[Java] |{doc_base_url}/0067-add-binary.adoc[题解] |Easy |

//|{counter:codes} //|{leetcode_base_url}/text-justification/[68. Text Justification^] //|{source_base_url}/_0068_TextJustification.java[Java] //|{doc_base_url}/0068-text-justification.adoc[题解] //|Hard //|

|{counter:codes} |{leetcode_base_url}/sqrtx/[69. Sqrt(x)^] |{source_base_url}/_0069_SqrtX.java[Java] |{doc_base_url}/0069-sqrtx.adoc[题解] |Easy |

|{counter:codes} |{leetcode_base_url}/climbing-stairs/[70. Climbing Stairs^] |{source_base_url}/_0070_ClimbingStairs.java[Java] |{doc_base_url}/0070-climbing-stairs.adoc[题解] |Easy |

|{counter:codes} |{leetcode_base_url}/simplify-path/[71. Simplify Path^] |{source_base_url}/_0071_SimplifyPath.java[Java] |{doc_base_url}/0071-simplify-path.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/edit-distance/[72. Edit Distance^] |{source_base_url}/_0072_EditDistance.java[Java] |{doc_base_url}/0072-edit-distance.adoc[题解] |Hard |

|{counter:codes} |{leetcode_base_url}/set-matrix-zeroes/[73. Set Matrix Zeroes^] |{source_base_url}/_0073_SetMatrixZeroes.java[Java] |{doc_base_url}/0073-set-matrix-zeroes.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/search-a-2d-matrix/[74. Search a 2D Matrix^] //|{source_base_url}/_0074_SearchA2DMatrix.java[Java] //|{doc_base_url}/0074-search-a-2d-matrix.adoc[题解] //|Medium //|

|{counter:codes} |{leetcode_base_url}/sort-colors/[75. Sort Colors^] |{source_base_url}/_0075_SortColors.java[Java] |{doc_base_url}/0075-sort-colors.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/minimum-window-substring/[76. Minimum Window Substring^] |{source_base_url}/_0076_MinimumWindowSubstring.java[Java] |{doc_base_url}/0076-minimum-window-substring.adoc[题解] |Hard |

|{counter:codes} |{leetcode_base_url}/combinations/[77. Combinations^] |{source_base_url}/_0077_Combinations.java[Java] |{doc_base_url}/0077-combinations.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/subsets/[78. Subsets^] |{source_base_url}/_0078_Subsets.java[Java] |{doc_base_url}/0078-subsets.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/word-search/[79. Word Search^] |{source_base_url}/_0079_WordSearch.java[Java] |{doc_base_url}/0079-word-search.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/remove-duplicates-from-sorted-array-ii/[80. Remove Duplicates from Sorted Array II^] |{source_base_url}/_0080_RemoveDuplicatesFromSortedArrayII.java[Java] |{doc_base_url}/0080-remove-duplicates-from-sorted-array-ii.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/search-in-rotated-sorted-array-ii/[81. Search in Rotated Sorted Array II^] |{source_base_url}/_0081_SearchInRotatedSortedArrayII.java[Java] |{doc_base_url}/0081-search-in-rotated-sorted-array-ii.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/remove-duplicates-from-sorted-list-ii/[82. Remove Duplicates from Sorted List II^] |{source_base_url}/_0082_RemoveDuplicatesFromSortedListII.java[Java] |{doc_base_url}/0082-remove-duplicates-from-sorted-list-ii.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/remove-duplicates-from-sorted-list/[83. Remove Duplicates from Sorted List^] |{source_base_url}/_0083_RemoveDuplicatesFromSortedList.java[Java] |{doc_base_url}/0083-remove-duplicates-from-sorted-list.adoc[题解] |Easy |

//|{counter:codes} //|{leetcode_base_url}/largest-rectangle-in-histogram/[84. Largest Rectangle in Histogram^] //|{source_base_url}/_0084_LargestRectangleInHistogram.java[Java] //|{doc_base_url}/0084-largest-rectangle-in-histogram.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/maximal-rectangle/[85. Maximal Rectangle^] //|{source_base_url}/_0085_MaximalRectangle.java[Java] //|{doc_base_url}/0085-maximal-rectangle.adoc[题解] //|Hard //|

|{counter:codes} |{leetcode_base_url}/partition-list/[86. Partition List^] |{source_base_url}/_0086_PartitionList.java[Java] |{doc_base_url}/0086-partition-list.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/scramble-string/[87. Scramble String^] //|{source_base_url}/_0087_ScrambleString.java[Java] //|{doc_base_url}/0087-scramble-string.adoc[题解] //|Hard //|

|{counter:codes} |{leetcode_base_url}/merge-sorted-array/[88. Merge Sorted Array^] |{source_base_url}/_0088_MergeSortedArray.java[Java] |{doc_base_url}/0088-merge-sorted-array.adoc[题解] |Easy |

|{counter:codes} |{leetcode_base_url}/gray-code/[89. Gray Code^] |{source_base_url}/_0089_GrayCode.java[Java] |{doc_base_url}/0089-gray-code.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/subsets-ii/[90. Subsets II^] |{source_base_url}/_0090_SubsetsII.java[Java] |{doc_base_url}/0090-subsets-ii.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/decode-ways/[91. Decode Ways^] |{source_base_url}/_0091_DecodeWays.java[Java] |{doc_base_url}/0091-decode-ways.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/reverse-linked-list-ii/[92. Reverse Linked List II^] |{source_base_url}/_0092_ReverseLinkedListII.java[Java] |{doc_base_url}/0092-reverse-linked-list-ii.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/restore-ip-addresses/[93. Restore IP Addresses^] |{source_base_url}/_0093_RestoreIPAddresses.java[Java] |{doc_base_url}/0093-restore-ip-addresses.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/binary-tree-inorder-traversal/[94. Binary Tree Inorder Traversal^] |{source_base_url}/_0094_BinaryTreeInorderTraversal.java[Java] |{doc_base_url}/0094-binary-tree-inorder-traversal.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/unique-binary-search-trees-ii/[95. Unique Binary Search Trees II^] |{source_base_url}/_0095_UniqueBinarySearchTreesII.java[Java] |{doc_base_url}/0095-unique-binary-search-trees-ii.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/unique-binary-search-trees/[96. Unique Binary Search Trees^] |{source_base_url}/_0096_UniqueBinarySearchTrees.java[Java] |{doc_base_url}/0096-unique-binary-search-trees.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/interleaving-string/[97. Interleaving String^] //|{source_base_url}/_0097_InterleavingString.java[Java] //|{doc_base_url}/0097-interleaving-string.adoc[题解] //|Hard //|

|{counter:codes} |{leetcode_base_url}/validate-binary-search-tree/[98. Validate Binary Search Tree^] |{source_base_url}/_0098_ValidateBinarySearchTree.java[Java] |{doc_base_url}/0098-validate-binary-search-tree.adoc[题解] |Medium |树形DP套路或中序遍历

|{counter:codes} |{leetcode_base_url}/recover-binary-search-tree/[99. Recover Binary Search Tree^] |{source_base_url}/_0099_RecoverBinarySearchTree.java[Java] |{doc_base_url}/0099-recover-binary-search-tree.adoc[题解] |Medium |Morris遍历

|{counter:codes} |{leetcode_base_url}/same-tree/[100. Same Tree^] |{source_base_url}/_0100_SameTree.java[Java] |{doc_base_url}/0100-same-tree.adoc[题解] |Easy |

|{counter:codes} |{leetcode_base_url}/symmetric-tree/[101. Symmetric Tree^] |{source_base_url}/_0101_SymmetricTree.java[Java] |{doc_base_url}/0101-symmetric-tree.adoc[题解] |Easy |

|{counter:codes} |{leetcode_base_url}/binary-tree-level-order-traversal/[102. Binary Tree Level Order Traversal^] |{source_base_url}/_0102_BinaryTreeLevelOrderTraversal.java[Java] |{doc_base_url}/0102-binary-tree-level-order-traversal.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/binary-tree-zigzag-level-order-traversal/[103. Binary Tree Zigzag Level Order Traversal^] |{source_base_url}/_0103_BinaryTreeZigzagLevelOrderTraversal.java[Java] |{doc_base_url}/0103-binary-tree-zigzag-level-order-traversal.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/maximum-depth-of-binary-tree/[104. Maximum Depth of Binary Tree^] |{source_base_url}/_0104_MaximumDepthOfBinaryTree.java[Java] |{doc_base_url}/0104-maximum-depth-of-binary-tree.adoc[题解] |Easy |

|{counter:codes} |{leetcode_base_url}/construct-binary-tree-from-preorder-and-inorder-traversal/[105. Construct Binary Tree from Preorder and Inorder Traversal^] |{source_base_url}/_0105_ConstructBinaryTreeFromPreorderAndInorderTraversal.java[Java] |{doc_base_url}/0105-construct-binary-tree-from-preorder-and-inorder-traversal.adoc[题解] |Medium |迭代如何实现？

|{counter:codes} |{leetcode_base_url}/construct-binary-tree-from-inorder-and-postorder-traversal/[106. Construct Binary Tree from Inorder and Postorder Traversal^] |{source_base_url}/_0106_ConstructBinaryTreeFromInorderAndPostorderTraversal.java[Java] |{doc_base_url}/0106-construct-binary-tree-from-inorder-and-postorder-traversal.adoc[题解] |Medium |迭代如何实现？

|{counter:codes} |{leetcode_base_url}/binary-tree-level-order-traversal-ii/[107. Binary Tree Level Order Traversal II^] |{source_base_url}/_0107_BinaryTreeLevelOrderTraversalII.java[Java] |{doc_base_url}/0107-binary-tree-level-order-traversal-ii.adoc[题解] |Easy |

|{counter:codes} |{leetcode_base_url}/convert-sorted-array-to-binary-search-tree/[108. Convert Sorted Array to Binary Search Tree^] |{source_base_url}/_0108_ConvertSortedArrayToBinarySearchTree.java[Java] |{doc_base_url}/0108-convert-sorted-array-to-binary-search-tree.adoc[题解] |Easy |

|{counter:codes} |{leetcode_base_url}/convert-sorted-list-to-binary-search-tree/[109. Convert Sorted List to Binary Search Tree^] |{source_base_url}/_0109_ConvertSortedListToBinarySearchTree.java[Java] |{doc_base_url}/0109-convert-sorted-list-to-binary-search-tree.adoc[题解] |Medium |分治+中序遍历

|{counter:codes} |{leetcode_base_url}/balanced-binary-tree/[110. Balanced Binary Tree^] |{source_base_url}/_0110_BalancedBinaryTree.java[Java] |{doc_base_url}/0110-balanced-binary-tree.adoc[题解] |Easy |

|{counter:codes} |{leetcode_base_url}/minimum-depth-of-binary-tree/[111. Minimum Depth of Binary Tree^] |{source_base_url}/_0111_MinimumDepthOfBinaryTree.java[Java] |{doc_base_url}/0111-minimum-depth-of-binary-tree.adoc[题解] |Easy |Morris解法需要深入研究

|{counter:codes} |{leetcode_base_url}/path-sum/[112. Path Sum^] |{source_base_url}/_0112_PathSum.java[Java] |{doc_base_url}/0112-path-sum.adoc[题解] |Easy |

|{counter:codes} |{leetcode_base_url}/path-sum-ii/[113. Path Sum II^] |{source_base_url}/_0113_PathSumII.java[Java] |{doc_base_url}/0113-path-sum-ii.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/flatten-binary-tree-to-linked-list/[114. Flatten Binary Tree to Linked List^] |{source_base_url}/_0114_FlattenBinaryTreeToLinkedList.java[Java] |{doc_base_url}/0114-flatten-binary-tree-to-linked-list.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/distinct-subsequences/[115. Distinct Subsequences^] //|{source_base_url}/_0115_DistinctSubsequences.java[Java] //|{doc_base_url}/0115-distinct-subsequences.adoc[题解] //|Hard //|

|{counter:codes} |{leetcode_base_url}/populating-next-right-pointers-in-each-node/[116. Populating Next Right Pointers in Each Node^] |{source_base_url}/_0116_PopulatingNextRightPointersInEachNode.java[Java] |{doc_base_url}/0116-populating-next-right-pointers-in-each-node.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/populating-next-right-pointers-in-each-node-ii/[117. Populating Next Right Pointers in Each Node II^] |{source_base_url}/_0117_PopulatingNextRightPointersInEachNodeII.java[Java] |{doc_base_url}/0117-populating-next-right-pointers-in-each-node-ii.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/pascals-triangle/[118. Pascal's Triangle^] |{source_base_url}/_0118_PascalSTriangle.java[Java] |{doc_base_url}/0118-pascals-triangle.adoc[题解] |Easy |

|{counter:codes} |{leetcode_base_url}/pascals-triangle-ii/[119. Pascal's Triangle II^] |{source_base_url}/_0119_PascalSTriangleII.java[Java] |{doc_base_url}/0119-pascals-triangle-ii.adoc[题解] |Easy |

|{counter:codes} |{leetcode_base_url}/triangle/[120. Triangle^] |{source_base_url}/_0120_Triangle.java[Java] |{doc_base_url}/0120-triangle.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/best-time-to-buy-and-sell-stock/[121. Best Time to Buy and Sell Stock^] |{source_base_url}/_0121_BestTimeToBuyAndSellStock.java[Java] |{doc_base_url}/0121-best-time-to-buy-and-sell-stock.adoc[题解] |Easy |

|{counter:codes} |{leetcode_base_url}/best-time-to-buy-and-sell-stock-ii/[122. Best Time to Buy and Sell Stock II^] |{source_base_url}/_0122_BestTimeToBuyAndSellStockII.java[Java] |{doc_base_url}/0122-best-time-to-buy-and-sell-stock-ii.adoc[题解] |Easy |

|{counter:codes} |{leetcode_base_url}/best-time-to-buy-and-sell-stock-iii/[123. Best Time to Buy and Sell Stock III^] |{source_base_url}/_0123_BestTimeToBuyAndSellStockIII.java[Java] |{doc_base_url}/0123-best-time-to-buy-and-sell-stock-iii.adoc[题解] |Hard |

//|{counter:codes} //|{leetcode_base_url}/binary-tree-maximum-path-sum/[124. Binary Tree Maximum Path Sum^] //|{source_base_url}/_0124_BinaryTreeMaximumPathSum.java[Java] //|{doc_base_url}/0124-binary-tree-maximum-path-sum.adoc[题解] //|Hard //|

|{counter:codes} |{leetcode_base_url}/valid-palindrome/[125. Valid Palindrome^] |{source_base_url}/_0125_ValidPalindrome.java[Java] |{doc_base_url}/0125-valid-palindrome.adoc[题解] |Easy |

//|{counter:codes} //|{leetcode_base_url}/word-ladder-ii/[126. Word Ladder II^] //|{source_base_url}/_0126_WordLadderII.java[Java] //|{doc_base_url}/0126-word-ladder-ii.adoc[题解] //|Hard //|

|{counter:codes} |{leetcode_base_url}/word-ladder/[127. Word Ladder^] |{source_base_url}/_0127_WordLadder.java[Java] |{doc_base_url}/0127-word-ladder.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/longest-consecutive-sequence/[128. Longest Consecutive Sequence^] //|{source_base_url}/_0128_LongestConsecutiveSequence.java[Java] //|{doc_base_url}/0128-longest-consecutive-sequence.adoc[题解] //|Hard //|

|{counter:codes} |{leetcode_base_url}/sum-root-to-leaf-numbers/[129. Sum Root to Leaf Numbers^] |{source_base_url}/_0129_SumRootToLeafNumbers.java[Java] |{doc_base_url}/0129-sum-root-to-leaf-numbers.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/surrounded-regions/[130. Surrounded Regions^] |{source_base_url}/_0130_SurroundedRegions.java[Java] |{doc_base_url}/0130-surrounded-regions.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/palindrome-partitioning/[131. Palindrome Partitioning^] |{source_base_url}/_0131_PalindromePartitioning.java[Java] |{doc_base_url}/0131-palindrome-partitioning.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/palindrome-partitioning-ii/[132. Palindrome Partitioning II^] //|{source_base_url}/_0132_PalindromePartitioningII.java[Java] //|{doc_base_url}/0132-palindrome-partitioning-ii.adoc[题解] //|Hard //|

|{counter:codes} |{leetcode_base_url}/clone-graph/[133. Clone Graph^] |{source_base_url}/_0133_CloneGraph.java[Java] |{doc_base_url}/0133-clone-graph.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/gas-station/[134. Gas Station^] |{source_base_url}/_0134_GasStation.java[Java] |{doc_base_url}/0134-gas-station.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/candy/[135. Candy^] |{source_base_url}/_0135_Candy.java[Java] |{doc_base_url}/0135-candy.adoc[题解] |Hard |

|{counter:codes} |{leetcode_base_url}/single-number/[136. Single Number^] |{source_base_url}/_0136_SingleNumber.java[Java] |{doc_base_url}/0136-single-number.adoc[题解] |Easy |

|{counter:codes} |{leetcode_base_url}/single-number-ii/[137. Single Number II^] |{source_base_url}/_0137_SingleNumberII.java[Java] |{doc_base_url}/0137-single-number-ii.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/copy-list-with-random-pointer/[138. Copy List with Random Pointer^] |{source_base_url}/_0138_CopyListWithRandomPointer.java[Java] |{doc_base_url}/0138-copy-list-with-random-pointer.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/word-break/[139. Word Break^] |{source_base_url}/_0139_WordBreak.java[Java] |{doc_base_url}/0139-word-break.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/word-break-ii/[140. Word Break II^] //|{source_base_url}/_0140_WordBreakII.java[Java] //|{doc_base_url}/0140-word-break-ii.adoc[题解] //|Hard //|

|{counter:codes} |{leetcode_base_url}/linked-list-cycle/[141. Linked List Cycle^] |{source_base_url}/_0141_LinkedListCycle.java[Java] |{doc_base_url}/0141-linked-list-cycle.adoc[题解] |Easy |

|{counter:codes} |{leetcode_base_url}/linked-list-cycle-ii/[142. Linked List Cycle II^] |{source_base_url}/_0142_LinkedListCycleII.java[Java] |{doc_base_url}/0142-linked-list-cycle-ii.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/reorder-list/[143. Reorder List^] //|{source_base_url}/_0143_ReorderList.java[Java] //|{doc_base_url}/0143-reorder-list.adoc[题解] //|Medium //|

|{counter:codes} |{leetcode_base_url}/binary-tree-preorder-traversal/[144. Binary Tree Preorder Traversal^] |{source_base_url}/_0144_BinaryTreePreorderTraversal.java[Java] |{doc_base_url}/0144-binary-tree-preorder-traversal.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/binary-tree-postorder-traversal/[145. Binary Tree Postorder Traversal^] |{source_base_url}/_0145_BinaryTreePostorderTraversal.java[Java] |{doc_base_url}/0145-binary-tree-postorder-traversal.adoc[题解] |Easy |强化迭代

|{counter:codes} |{leetcode_base_url}/lru-cache/[146. LRU Cache^] |{source_base_url}/_0146_LRUCache.java[Java] |{doc_base_url}/0146-lru-cache.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/insertion-sort-list/[147. Insertion Sort List^] //|{source_base_url}/_0147_InsertionSortList.java[Java] //|{doc_base_url}/0147-insertion-sort-list.adoc[题解] //|Medium //|

|{counter:codes} |{leetcode_base_url}/sort-list/[148. Sort List^] |{source_base_url}/_0148_SortList.java[Java] |{doc_base_url}/0148-sort-list.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/max-points-on-a-line/[149. Max Points on a Line^] //|{source_base_url}/_0149_MaxPointsOnALine.java[Java] //|{doc_base_url}/0149-max-points-on-a-line.adoc[题解] //|Hard //|

|{counter:codes} |{leetcode_base_url}/evaluate-reverse-polish-notation/[150. Evaluate Reverse Polish Notation^] |{source_base_url}/_0150_EvaluateReversePolishNotation.java[Java] |{doc_base_url}/0150-evaluate-reverse-polish-notation.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/reverse-words-in-a-string/[151. Reverse Words in a String^] |{source_base_url}/_0151_ReverseWordsInAString.java[Java] |{doc_base_url}/0151-reverse-words-in-a-string.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/maximum-product-subarray/[152. Maximum Product Subarray^] |{source_base_url}/_0152_MaximumProductSubarray.java[Java] |{doc_base_url}/0152-maximum-product-subarray.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/find-minimum-in-rotated-sorted-array/[153. Find Minimum in Rotated Sorted Array^] |{source_base_url}/_0153_FindMinimumInRotatedSortedArray.java[Java] |{doc_base_url}/0153-find-minimum-in-rotated-sorted-array.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/find-minimum-in-rotated-sorted-array-ii/[154. Find Minimum in Rotated Sorted Array II^] |{source_base_url}/_0154_FindMinimumInRotatedSortedArrayII.java[Java] |{doc_base_url}/0154-find-minimum-in-rotated-sorted-array-ii.adoc[题解] |Hard |

|{counter:codes} |{leetcode_base_url}/min-stack/[155. Min Stack^] |{source_base_url}/_0155_MinStack.java[Java] |{doc_base_url}/0155-min-stack.adoc[题解] |Easy |

//|{counter:codes} //|{leetcode_base_url}/binary-tree-upside-down/[156. Binary Tree Upside Down^] //|{source_base_url}/_0156_BinaryTreeUpsideDown.java[Java] //|{doc_base_url}/0156-binary-tree-upside-down.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/read-n-characters-given-read4/[157. Read N Characters Given Read4^] //|{source_base_url}/_0157_ReadNCharactersGivenRead4.java[Java] //|{doc_base_url}/0157-read-n-characters-given-read4.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/read-n-characters-given-read4-ii-call-multiple-times/[158. Read N Characters Given Read4 II - Call multiple times^] //|{source_base_url}/_0158_ReadNCharactersGivenRead4IICallMultipleTimes.java[Java] //|{doc_base_url}/0158-read-n-characters-given-read4-ii-call-multiple-times.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/longest-substring-with-at-most-two-distinct-characters/[159. Longest Substring with At Most Two Distinct Characters^] //|{source_base_url}/_0159_LongestSubstringWithAtMostTwoDistinctCharacters.java[Java] //|{doc_base_url}/0159-longest-substring-with-at-most-two-distinct-characters.adoc[题解] //|Medium //|

|{counter:codes} |{leetcode_base_url}/intersection-of-two-linked-lists/[160. Intersection of Two Linked Lists^] |{source_base_url}/_0160_IntersectionOfTwoLinkedLists.java[Java] |{doc_base_url}/0160-intersection-of-two-linked-lists.adoc[题解] |Easy |

//|{counter:codes} //|{leetcode_base_url}/one-edit-distance/[161. One Edit Distance^] //|{source_base_url}/_0161_OneEditDistance.java[Java] //|{doc_base_url}/0161-one-edit-distance.adoc[题解] //|Medium //|

|{counter:codes} |{leetcode_base_url}/find-peak-element/[162. Find Peak Element^] |{source_base_url}/_0162_FindPeakElement.java[Java] |{doc_base_url}/0162-find-peak-element.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/missing-ranges/[163. Missing Ranges^] //|{source_base_url}/_0163_MissingRanges.java[Java] //|{doc_base_url}/0163-missing-ranges.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/maximum-gap/[164. Maximum Gap^] //|{source_base_url}/_0164_MaximumGap.java[Java] //|{doc_base_url}/0164-maximum-gap.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/compare-version-numbers/[165. Compare Version Numbers^] //|{source_base_url}/_0165_CompareVersionNumbers.java[Java] //|{doc_base_url}/0165-compare-version-numbers.adoc[题解] //|Medium //|

|{counter:codes} |{leetcode_base_url}/fraction-to-recurring-decimal/[166. Fraction to Recurring Decimal^] |{source_base_url}/_0166_FractionToRecurringDecimal.java[Java] |{doc_base_url}/0166-fraction-to-recurring-decimal.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/two-sum-ii-input-array-is-sorted/[167. Two Sum II - Input array is sorted^] |{source_base_url}/_0167_TwoSumIIInputArrayIsSorted.java[Java] |{doc_base_url}/0167-two-sum-ii-input-array-is-sorted.adoc[题解] |Easy |

//|{counter:codes} //|{leetcode_base_url}/excel-sheet-column-title/[168. Excel Sheet Column Title^] //|{source_base_url}/_0168_ExcelSheetColumnTitle.java[Java] //|{doc_base_url}/0168-excel-sheet-column-title.adoc[题解] //|Easy //|

|{counter:codes} |{leetcode_base_url}/majority-element/[169. Majority Element^] |{source_base_url}/_0169_MajorityElement.java[Java] |{doc_base_url}/0169-majority-element.adoc[题解] |Easy |

//|{counter:codes} //|{leetcode_base_url}/two-sum-iii-data-structure-design/[170. Two Sum III - Data structure design^] //|{source_base_url}/_0170_TwoSumIIIDataStructureDesign.java[Java] //|{doc_base_url}/0170-two-sum-iii-data-structure-design.adoc[题解] //|Easy //|

|{counter:codes} |{leetcode_base_url}/excel-sheet-column-number/[171. Excel Sheet Column Number^] |{source_base_url}/_0171_ExcelSheetColumnNumber.java[Java] |{doc_base_url}/0171-excel-sheet-column-number.adoc[题解] |Easy |

|{counter:codes} |{leetcode_base_url}/factorial-trailing-zeroes/[172. Factorial Trailing Zeroes^] |{source_base_url}/_0172_FactorialTrailingZeroes.java[Java] |{doc_base_url}/0172-factorial-trailing-zeroes.adoc[题解] |Easy |

//|{counter:codes} //|{leetcode_base_url}/binary-search-tree-iterator/[173. Binary Search Tree Iterator^] //|{source_base_url}/_0173_BinarySearchTreeIterator.java[Java] //|{doc_base_url}/0173-binary-search-tree-iterator.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/dungeon-game/[174. Dungeon Game^] //|{source_base_url}/_0174_DungeonGame.java[Java] //|{doc_base_url}/0174-dungeon-game.adoc[题解] //|Hard //|

|{counter:codes} |{leetcode_base_url}/combine-two-tables/[175. Combine Two Tables^] |{source_base_url}/_0175_CombineTwoTables.sql[SQL] |{doc_base_url}/0175-combine-two-tables.adoc[题解] |Easy |

|{counter:codes} |{leetcode_base_url}/second-highest-salary/[176. Second Highest Salary^] |{source_base_url}/_0176_SecondHighestSalary.sql[SQL] |{doc_base_url}/0176-second-highest-salary.adoc[题解] |Easy |

//|{counter:codes} //|{leetcode_base_url}/nth-highest-salary/[177. Nth Highest Salary^] //|{source_base_url}/_0177_NthHighestSalary.java[Java] //|{doc_base_url}/0177-nth-highest-salary.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/rank-scores/[178. Rank Scores^] //|{source_base_url}/_0178_RankScores.java[Java] //|{doc_base_url}/0178-rank-scores.adoc[题解] //|Medium //|

|{counter:codes} |{leetcode_base_url}/largest-number/[179. Largest Number^] |{source_base_url}/_0179_LargestNumber.java[Java] |{doc_base_url}/0179-largest-number.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/consecutive-numbers/[180. Consecutive Numbers^] //|{source_base_url}/_0180_ConsecutiveNumbers.java[Java] //|{doc_base_url}/0180-consecutive-numbers.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/employees-earning-more-than-their-managers/[181. Employees Earning More Than Their Managers^] //|{source_base_url}/_0181_EmployeesEarningMoreThanTheirManagers.java[Java] //|{doc_base_url}/0181-employees-earning-more-than-their-managers.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/duplicate-emails/[182. Duplicate Emails^] //|{source_base_url}/_0182_DuplicateEmails.java[Java] //|{doc_base_url}/0182-duplicate-emails.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/customers-who-never-order/[183. Customers Who Never Order^] //|{source_base_url}/_0183_CustomersWhoNeverOrder.java[Java] //|{doc_base_url}/0183-customers-who-never-order.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/department-highest-salary/[184. Department Highest Salary^] //|{source_base_url}/_0184_DepartmentHighestSalary.java[Java] //|{doc_base_url}/0184-department-highest-salary.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/department-top-three-salaries/[185. Department Top Three Salaries^] //|{source_base_url}/_0185_DepartmentTopThreeSalaries.java[Java] //|{doc_base_url}/0185-department-top-three-salaries.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/reverse-words-in-a-string-ii/[186. Reverse Words in a String II^] //|{source_base_url}/_0186_ReverseWordsInAStringII.java[Java] //|{doc_base_url}/0186-reverse-words-in-a-string-ii.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/repeated-dna-sequences/[187. Repeated DNA Sequences^] //|{source_base_url}/_0187_RepeatedDNASequences.java[Java] //|{doc_base_url}/0187-repeated-dna-sequences.adoc[题解] //|Medium //|

|{counter:codes} |{leetcode_base_url}/best-time-to-buy-and-sell-stock-iv/[188. Best Time to Buy and Sell Stock IV^] |{source_base_url}/_0188_BestTimeToBuyAndSellStockIV.java[Java] |{doc_base_url}/0188-best-time-to-buy-and-sell-stock-iv.adoc[题解] |Hard |

|{counter:codes} |{leetcode_base_url}/rotate-array/[189. Rotate Array^] |{source_base_url}/_0189_RotateArray.java[Java] |{doc_base_url}/0189-rotate-array.adoc[题解] |Easy |

|{counter:codes} |{leetcode_base_url}/reverse-bits/[190. Reverse Bits^] |{source_base_url}/_0190_ReverseBits.java[Java] |{doc_base_url}/0190-reverse-bits.adoc[题解] |Easy |

|{counter:codes} |{leetcode_base_url}/number-of-1-bits/[191. Number of 1 Bits^] |{source_base_url}/_0191_NumberOf1Bits.java[Java] |{doc_base_url}/0191-number-of-1-bits.adoc[题解] |Easy |

//|{counter:codes} //|{leetcode_base_url}/word-frequency/[192. Word Frequency^] //|{source_base_url}/_0192_WordFrequency.java[Java] //|{doc_base_url}/0192-word-frequency.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/valid-phone-numbers/[193. Valid Phone Numbers^] //|{source_base_url}/_0193_ValidPhoneNumbers.java[Java] //|{doc_base_url}/0193-valid-phone-numbers.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/transpose-file/[194. Transpose File^] //|{source_base_url}/_0194_TransposeFile.java[Java] //|{doc_base_url}/0194-transpose-file.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/tenth-line/[195. Tenth Line^] //|{source_base_url}/_0195_TenthLine.java[Java] //|{doc_base_url}/0195-tenth-line.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/delete-duplicate-emails/[196. Delete Duplicate Emails^] //|{source_base_url}/_0196_DeleteDuplicateEmails.java[Java] //|{doc_base_url}/0196-delete-duplicate-emails.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/rising-temperature/[197. Rising Temperature^] //|{source_base_url}/_0197_RisingTemperature.java[Java] //|{doc_base_url}/0197-rising-temperature.adoc[题解] //|Easy //|

|{counter:codes} |{leetcode_base_url}/house-robber/[198. House Robber^] |{source_base_url}/_0198_HouseRobber.java[Java] |{doc_base_url}/0198-house-robber.adoc[题解] |Easy |

|{counter:codes} |{leetcode_base_url}/binary-tree-right-side-view/[199. Binary Tree Right Side View^] |{source_base_url}/_0199_BinaryTreeRightSideView.java[Java] |{doc_base_url}/0199-binary-tree-right-side-view.adoc[题解] |Medium |递归+DFS解法有意思

|{counter:codes} |{leetcode_base_url}/number-of-islands/[200. Number of Islands^] |{source_base_url}/_0200_NumberOfIslands.java[Java] |{doc_base_url}/0200-number-of-islands.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/bitwise-and-of-numbers-range/[201. Bitwise AND of Numbers Range^] //|{source_base_url}/_0201_BitwiseANDOfNumbersRange.java[Java] //|{doc_base_url}/0201-bitwise-and-of-numbers-range.adoc[题解] //|Medium //|

|{counter:codes} |{leetcode_base_url}/happy-number/[202. Happy Number^] |{source_base_url}/_0202_HappyNumber.java[Java] |{doc_base_url}/0202-happy-number.adoc[题解] |Easy |

//|{counter:codes} //|{leetcode_base_url}/remove-linked-list-elements/[203. Remove Linked List Elements^] //|{source_base_url}/_0203_RemoveLinkedListElements.java[Java] //|{doc_base_url}/0203-remove-linked-list-elements.adoc[题解] //|Easy //|

|{counter:codes} |{leetcode_base_url}/count-primes/[204. Count Primes^] |{source_base_url}/_0204_CountPrimes.java[Java] |{doc_base_url}/0204-count-primes.adoc[题解] |Easy |

|{counter:codes} |{leetcode_base_url}/isomorphic-strings/[205. Isomorphic Strings^] |{source_base_url}/_0205_IsomorphicStrings.java[Java] |{doc_base_url}/0205-isomorphic-strings.adoc[题解] |Easy |

|{counter:codes} |{leetcode_base_url}/reverse-linked-list/[206. Reverse Linked List^] |{source_base_url}/_0206_ReverseLinkedList.java[Java] |{doc_base_url}/0206-reverse-linked-list.adoc[题解] |Easy |

|{counter:codes} |{leetcode_base_url}/course-schedule/[207. Course Schedule^] |{source_base_url}/_0207_CourseSchedule.java[Java] |{doc_base_url}/0207-course-schedule.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/implement-trie-prefix-tree/[208. Implement Trie (Prefix Tree)^] |{source_base_url}/_0208_ImplementTriePrefixTree.java[Java] |{doc_base_url}/0208-implement-trie-prefix-tree.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/minimum-size-subarray-sum/[209. Minimum Size Subarray Sum^] //|{source_base_url}/_0209_MinimumSizeSubarraySum.java[Java] //|{doc_base_url}/0209-minimum-size-subarray-sum.adoc[题解] //|Medium //|

|{counter:codes} |{leetcode_base_url}/course-schedule-ii/[210. Course Schedule II^] |{source_base_url}/_0210_CourseScheduleII.java[Java] |{doc_base_url}/0210-course-schedule-ii.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/add-and-search-word-data-structure-design/[211. Add and Search Word - Data structure design^] //|{source_base_url}/_0211_AddAndSearchWordDataStructureDesign.java[Java] //|{doc_base_url}/0211-add-and-search-word-data-structure-design.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/word-search-ii/[212. Word Search II^] //|{source_base_url}/_0212_WordSearchII.java[Java] //|{doc_base_url}/0212-word-search-ii.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/house-robber-ii/[213. House Robber II^] //|{source_base_url}/_0213_HouseRobberII.java[Java] //|{doc_base_url}/0213-house-robber-ii.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/shortest-palindrome/[214. Shortest Palindrome^] //|{source_base_url}/_0214_ShortestPalindrome.java[Java] //|{doc_base_url}/0214-shortest-palindrome.adoc[题解] //|Hard //|

|{counter:codes} |{leetcode_base_url}/kth-largest-element-in-an-array/[215. Kth Largest Element in an Array^] |{source_base_url}/_0215_KthLargestElementInAnArray.java[Java] |{doc_base_url}/0215-kth-largest-element-in-an-array.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/combination-sum-iii/[216. Combination Sum III^] //|{source_base_url}/_0216_CombinationSumIII.java[Java] //|{doc_base_url}/0216-combination-sum-iii.adoc[题解] //|Medium //|

|{counter:codes} |{leetcode_base_url}/contains-duplicate/[217. Contains Duplicate^] |{source_base_url}/_0217_ContainsDuplicate.java[Java] |{doc_base_url}/0217-contains-duplicate.adoc[题解] |Easy |

//|{counter:codes} //|{leetcode_base_url}/the-skyline-problem/[218. The Skyline Problem^] //|{source_base_url}/_0218_TheSkylineProblem.java[Java] //|{doc_base_url}/0218-the-skyline-problem.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/contains-duplicate-ii/[219. Contains Duplicate II^] //|{source_base_url}/_0219_ContainsDuplicateII.java[Java] //|{doc_base_url}/0219-contains-duplicate-ii.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/contains-duplicate-iii/[220. Contains Duplicate III^] //|{source_base_url}/_0220_ContainsDuplicateIII.java[Java] //|{doc_base_url}/0220-contains-duplicate-iii.adoc[题解] //|Medium //|

|{counter:codes} |{leetcode_base_url}/maximal-square/[221. Maximal Square^] |{source_base_url}/_0221_MaximalSquare.java[Java] |{doc_base_url}/0221-maximal-square.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/count-complete-tree-nodes/[222. Count Complete Tree Nodes^] |{source_base_url}/_0222_CountCompleteTreeNodes.java[Java] |{doc_base_url}/0222-count-complete-tree-nodes.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/rectangle-area/[223. Rectangle Area^] //|{source_base_url}/_0223_RectangleArea.java[Java] //|{doc_base_url}/0223-rectangle-area.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/basic-calculator/[224. Basic Calculator^] //|{source_base_url}/_0224_BasicCalculator.java[Java] //|{doc_base_url}/0224-basic-calculator.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/implement-stack-using-queues/[225. Implement Stack using Queues^] //|{source_base_url}/_0225_ImplementStackUsingQueues.java[Java] //|{doc_base_url}/0225-implement-stack-using-queues.adoc[题解] //|Easy //|

|{counter:codes} |{leetcode_base_url}/invert-binary-tree/[226. Invert Binary Tree^] |{source_base_url}/_0226_InvertBinaryTree.java[Java] |{doc_base_url}/0226-invert-binary-tree.adoc[题解] |Easy |

|{counter:codes} |{leetcode_base_url}/basic-calculator-ii/[227. Basic Calculator II^] |{source_base_url}/_0227_BasicCalculatorIi.java[Java] |{doc_base_url}/0227-basic-calculator-ii.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/summary-ranges/[228. Summary Ranges^] //|{source_base_url}/_0228_SummaryRanges.java[Java] //|{doc_base_url}/0228-summary-ranges.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/majority-element-ii/[229. Majority Element II^] //|{source_base_url}/_0229_MajorityElementII.java[Java] //|{doc_base_url}/0229-majority-element-ii.adoc[题解] //|Medium //|

|{counter:codes} |{leetcode_base_url}/kth-smallest-element-in-a-bst/[230. Kth Smallest Element in a BST^] |{source_base_url}/_0230_KthSmallestElementInABst.java[Java] |{doc_base_url}/0230-kth-smallest-element-in-a-bst.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/power-of-two/[231. Power of Two^] |{source_base_url}/_0231_PowerOfTwo.java[Java] |{doc_base_url}/0231-power-of-two.adoc[题解] |Easy |

|{counter:codes} |{leetcode_base_url}/implement-queue-using-stacks/[232. Implement Queue using Stacks^] |{source_base_url}/_0232_ImplementQueueUsingStacks.java[Java] |{doc_base_url}/0232-implement-queue-using-stacks.adoc[题解] |Easy |

//|{counter:codes} //|{leetcode_base_url}/number-of-digit-one/[233. Number of Digit One^] //|{source_base_url}/_0233_NumberOfDigitOne.java[Java] //|{doc_base_url}/0233-number-of-digit-one.adoc[题解] //|Hard //|

|{counter:codes} |{leetcode_base_url}/palindrome-linked-list/[234. Palindrome Linked List^] |{source_base_url}/_0234_PalindromeLinkedList.java[Java] |{doc_base_url}/0234-palindrome-linked-list.adoc[题解] |Easy |

|{counter:codes} |{leetcode_base_url}/lowest-common-ancestor-of-a-binary-search-tree/[235. Lowest Common Ancestor of a Binary Search Tree^] |{source_base_url}/_0235_LowestCommonAncestorOfABinarySearchTree.java[Java] |{doc_base_url}/0235-lowest-common-ancestor-of-a-binary-search-tree.adoc[题解] |Easy |二叉搜索树左大右小的特性

|{counter:codes} |{leetcode_base_url}/lowest-common-ancestor-of-a-binary-tree/[236. Lowest Common Ancestor of a Binary Tree^] |{source_base_url}/_0236_LowestCommonAncestorOfABinaryTree.java[Java] |{doc_base_url}/0236-lowest-common-ancestor-of-a-binary-tree.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/delete-node-in-a-linked-list/[237. Delete Node in a Linked List^] |{source_base_url}/_0237_DeleteNodeInALinkedList.java[Java] |{doc_base_url}/0237-delete-node-in-a-linked-list.adoc[题解] |Easy |

|{counter:codes} |{leetcode_base_url}/product-of-array-except-self/[238. Product of Array Except Self^] |{source_base_url}/_0238_ProductOfArrayExceptSelf.java[Java] |{doc_base_url}/0238-product-of-array-except-self.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/sliding-window-maximum/[239. Sliding Window Maximum^] |{source_base_url}/_0239_SlidingWindowMaximum.java[Java] |{doc_base_url}/0239-sliding-window-maximum.adoc[题解] |Hard |

|{counter:codes} |{leetcode_base_url}/search-a-2d-matrix-ii/[240. Search a 2D Matrix II^] |{source_base_url}/_0240_SearchA2DMatrixII.java[Java] |{doc_base_url}/0240-search-a-2d-matrix-ii.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/different-ways-to-add-parentheses/[241. Different Ways to Add Parentheses^] //|{source_base_url}/_0241_DifferentWaysToAddParentheses.java[Java] //|{doc_base_url}/0241-different-ways-to-add-parentheses.adoc[题解] //|Medium //|

|{counter:codes} |{leetcode_base_url}/valid-anagram/[242. Valid Anagram^] |{source_base_url}/_0242_ValidAnagram.java[Java] |{doc_base_url}/0242-valid-anagram.adoc[题解] |Easy |

//|{counter:codes} //|{leetcode_base_url}/shortest-word-distance/[243. Shortest Word Distance^] //|{source_base_url}/_0243_ShortestWordDistance.java[Java] //|{doc_base_url}/0243-shortest-word-distance.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/shortest-word-distance-ii/[244. Shortest Word Distance II^] //|{source_base_url}/_0244_ShortestWordDistanceII.java[Java] //|{doc_base_url}/0244-shortest-word-distance-ii.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/shortest-word-distance-iii/[245. Shortest Word Distance III^] //|{source_base_url}/_0245_ShortestWordDistanceIII.java[Java] //|{doc_base_url}/0245-shortest-word-distance-iii.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/strobogrammatic-number/[246. Strobogrammatic Number^] //|{source_base_url}/_0246_StrobogrammaticNumber.java[Java] //|{doc_base_url}/0246-strobogrammatic-number.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/strobogrammatic-number-ii/[247. Strobogrammatic Number II^] //|{source_base_url}/_0247_StrobogrammaticNumberII.java[Java] //|{doc_base_url}/0247-strobogrammatic-number-ii.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/strobogrammatic-number-iii/[248. Strobogrammatic Number III^] //|{source_base_url}/_0248_StrobogrammaticNumberIII.java[Java] //|{doc_base_url}/0248-strobogrammatic-number-iii.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/group-shifted-strings/[249. Group Shifted Strings^] //|{source_base_url}/_0249_GroupShiftedStrings.java[Java] //|{doc_base_url}/0249-group-shifted-strings.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/count-univalue-subtrees/[250. Count Univalue Subtrees^] //|{source_base_url}/_0250_CountUnivalueSubtrees.java[Java] //|{doc_base_url}/0250-count-univalue-subtrees.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/flatten-2d-vector/[251. Flatten 2D Vector^] //|{source_base_url}/_0251_Flatten2DVector.java[Java] //|{doc_base_url}/0251-flatten-2d-vector.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/meeting-rooms/[252. Meeting Rooms^] //|{source_base_url}/_0252_MeetingRooms.java[Java] //|{doc_base_url}/0252-meeting-rooms.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/meeting-rooms-ii/[253. Meeting Rooms II^] //|{source_base_url}/_0253_MeetingRoomsII.java[Java] //|{doc_base_url}/0253-meeting-rooms-ii.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/factor-combinations/[254. Factor Combinations^] //|{source_base_url}/_0254_FactorCombinations.java[Java] //|{doc_base_url}/0254-factor-combinations.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/verify-preorder-sequence-in-binary-search-tree/[255. Verify Preorder Sequence in Binary Search Tree^] //|{source_base_url}/_0255_VerifyPreorderSequenceInBinarySearchTree.java[Java] //|{doc_base_url}/0255-verify-preorder-sequence-in-binary-search-tree.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/paint-house/[256. Paint House^] //|{source_base_url}/_0256_PaintHouse.java[Java] //|{doc_base_url}/0256-paint-house.adoc[题解] //|Easy //|

|{counter:codes} |{leetcode_base_url}/binary-tree-paths/[257. Binary Tree Paths^] |{source_base_url}/_0257_BinaryTreePaths.java[Java] |{doc_base_url}/0257-binary-tree-paths.adoc[题解] |Easy |

//|{counter:codes} //|{leetcode_base_url}/add-digits/[258. Add Digits^] //|{source_base_url}/_0258_AddDigits.java[Java] //|{doc_base_url}/0258-add-digits.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/3sum-smaller/[259. 3Sum Smaller^] //|{source_base_url}/_0259_3SumSmaller.java[Java] //|{doc_base_url}/0259-3sum-smaller.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/single-number-iii/[260. Single Number III^] //|{source_base_url}/_0260_SingleNumberIII.java[Java] //|{doc_base_url}/0260-single-number-iii.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/graph-valid-tree/[261. Graph Valid Tree^] //|{source_base_url}/_0261_GraphValidTree.java[Java] //|{doc_base_url}/0261-graph-valid-tree.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/trips-and-users/[262. Trips and Users^] //|{source_base_url}/_0262_TripsAndUsers.java[Java] //|{doc_base_url}/0262-trips-and-users.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/ugly-number/[263. Ugly Number^] //|{source_base_url}/_0263_UglyNumber.java[Java] //|{doc_base_url}/0263-ugly-number.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/ugly-number-ii/[264. Ugly Number II^] //|{source_base_url}/_0264_UglyNumberII.java[Java] //|{doc_base_url}/0264-ugly-number-ii.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/paint-house-ii/[265. Paint House II^] //|{source_base_url}/_0265_PaintHouseII.java[Java] //|{doc_base_url}/0265-paint-house-ii.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/palindrome-permutation/[266. Palindrome Permutation^] //|{source_base_url}/_0266_PalindromePermutation.java[Java] //|{doc_base_url}/0266-palindrome-permutation.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/palindrome-permutation-ii/[267. Palindrome Permutation II^] //|{source_base_url}/_0267_PalindromePermutationII.java[Java] //|{doc_base_url}/0267-palindrome-permutation-ii.adoc[题解] //|Medium //|

|{counter:codes} |{leetcode_base_url}/missing-number/[268. Missing Number^] |{source_base_url}/_0268_MissingNumber.java[Java] |{doc_base_url}/0268-missing-number.adoc[题解] |Easy |

//|{counter:codes} //|{leetcode_base_url}/alien-dictionary/[269. Alien Dictionary^] //|{source_base_url}/_0269_AlienDictionary.java[Java] //|{doc_base_url}/0269-alien-dictionary.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/closest-binary-search-tree-value/[270. Closest Binary Search Tree Value^] //|{source_base_url}/_0270_ClosestBinarySearchTreeValue.java[Java] //|{doc_base_url}/0270-closest-binary-search-tree-value.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/encode-and-decode-strings/[271. Encode and Decode Strings^] //|{source_base_url}/_0271_EncodeAndDecodeStrings.java[Java] //|{doc_base_url}/0271-encode-and-decode-strings.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/closest-binary-search-tree-value-ii/[272. Closest Binary Search Tree Value II^] //|{source_base_url}/_0272_ClosestBinarySearchTreeValueII.java[Java] //|{doc_base_url}/0272-closest-binary-search-tree-value-ii.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/integer-to-english-words/[273. Integer to English Words^] //|{source_base_url}/_0273_IntegerToEnglishWords.java[Java] //|{doc_base_url}/0273-integer-to-english-words.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/h-index/[274. H-Index^] //|{source_base_url}/_0274_HIndex.java[Java] //|{doc_base_url}/0274-h-index.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/h-index-ii/[275. H-Index II^] //|{source_base_url}/_0275_HIndexII.java[Java] //|{doc_base_url}/0275-h-index-ii.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/paint-fence/[276. Paint Fence^] //|{source_base_url}/_0276_PaintFence.java[Java] //|{doc_base_url}/0276-paint-fence.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/find-the-celebrity/[277. Find the Celebrity^] //|{source_base_url}/_0277_FindTheCelebrity.java[Java] //|{doc_base_url}/0277-find-the-celebrity.adoc[题解] //|Medium //|

|{counter:codes} |{leetcode_base_url}/first-bad-version/[278. First Bad Version^] |{source_base_url}/_0278_FirstBadVersion.java[Java] |{doc_base_url}/0278-first-bad-version.adoc[题解] |Easy |

|{counter:codes} |{leetcode_base_url}/perfect-squares/[279. Perfect Squares^] |{source_base_url}/_0279_PerfectSquares.java[Java] |{doc_base_url}/0279-perfect-squares.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/wiggle-sort/[280. Wiggle Sort^] //|{source_base_url}/_0280_WiggleSort.java[Java] //|{doc_base_url}/0280-wiggle-sort.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/zigzag-iterator/[281. Zigzag Iterator^] //|{source_base_url}/_0281_ZigzagIterator.java[Java] //|{doc_base_url}/0281-zigzag-iterator.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/expression-add-operators/[282. Expression Add Operators^] //|{source_base_url}/_0282_ExpressionAddOperators.java[Java] //|{doc_base_url}/0282-expression-add-operators.adoc[题解] //|Hard //|

|{counter:codes} |{leetcode_base_url}/move-zeroes/[283. Move Zeroes^] |{source_base_url}/_0283_MoveZeroes.java[Java] |{doc_base_url}/0283-move-zeroes.adoc[题解] |Easy |

//|{counter:codes} //|{leetcode_base_url}/peeking-iterator/[284. Peeking Iterator^] //|{source_base_url}/_0284_PeekingIterator.java[Java] //|{doc_base_url}/0284-peeking-iterator.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/inorder-successor-in-bst/[285. Inorder Successor in BST^] //|{source_base_url}/_0285_InorderSuccessorInBST.java[Java] //|{doc_base_url}/0285-inorder-successor-in-bst.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/walls-and-gates/[286. Walls and Gates^] //|{source_base_url}/_0286_WallsAndGates.java[Java] //|{doc_base_url}/0286-walls-and-gates.adoc[题解] //|Medium //|

|{counter:codes} |{leetcode_base_url}/find-the-duplicate-number/[287. Find the Duplicate Number^] |{source_base_url}/_0287_FindTheDuplicateNumber.java[Java] |{doc_base_url}/0287-find-the-duplicate-number.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/unique-word-abbreviation/[288. Unique Word Abbreviation^] //|{source_base_url}/_0288_UniqueWordAbbreviation.java[Java] //|{doc_base_url}/0288-unique-word-abbreviation.adoc[题解] //|Medium //|

|{counter:codes} |{leetcode_base_url}/game-of-life/[289. Game of Life^] |{source_base_url}/_0289_GameOfLife.java[Java] |{doc_base_url}/0289-game-of-life.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/word-pattern/[290. Word Pattern^] //|{source_base_url}/_0290_WordPattern.java[Java] //|{doc_base_url}/0290-word-pattern.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/word-pattern-ii/[291. Word Pattern II^] //|{source_base_url}/_0291_WordPatternII.java[Java] //|{doc_base_url}/0291-word-pattern-ii.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/nim-game/[292. Nim Game^] //|{source_base_url}/_0292_NimGame.java[Java] //|{doc_base_url}/0292-nim-game.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/flip-game/[293. Flip Game^] //|{source_base_url}/_0293_FlipGame.java[Java] //|{doc_base_url}/0293-flip-game.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/flip-game-ii/[294. Flip Game II^] //|{source_base_url}/_0294_FlipGameII.java[Java] //|{doc_base_url}/0294-flip-game-ii.adoc[题解] //|Medium //|

|{counter:codes} |{leetcode_base_url}/find-median-from-data-stream/[295. Find Median from Data Stream^] |{source_base_url}/_0295_FindMedianFromDataStream.java[Java] |{doc_base_url}/0295-find-median-from-data-stream.adoc[题解] |Hard |

//|{counter:codes} //|{leetcode_base_url}/best-meeting-point/[296. Best Meeting Point^] //|{source_base_url}/_0296_BestMeetingPoint.java[Java] //|{doc_base_url}/0296-best-meeting-point.adoc[题解] //|Hard //|

|{counter:codes} |{leetcode_base_url}/serialize-and-deserialize-binary-tree/[297. Serialize and Deserialize Binary Tree^] |{source_base_url}/_0297_SerializeAndDeserializeBinaryTree.java[Java] |{doc_base_url}/0297-serialize-and-deserialize-binary-tree.adoc[题解] |Hard |注意思维误区！

//|{counter:codes} //|{leetcode_base_url}/binary-tree-longest-consecutive-sequence/[298. Binary Tree Longest Consecutive Sequence^] //|{source_base_url}/_0298_BinaryTreeLongestConsecutiveSequence.java[Java] //|{doc_base_url}/0298-binary-tree-longest-consecutive-sequence.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/bulls-and-cows/[299. Bulls and Cows^] //|{source_base_url}/_0299_BullsAndCows.java[Java] //|{doc_base_url}/0299-bulls-and-cows.adoc[题解] //|Easy //|

|{counter:codes} |{leetcode_base_url}/longest-increasing-subsequence/[300. Longest Increasing Subsequence^] |{source_base_url}/_0300_LongestIncreasingSubsequence.java[Java] |{doc_base_url}/0300-longest-increasing-subsequence.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/remove-invalid-parentheses/[301. Remove Invalid Parentheses^] //|{source_base_url}/_0301_RemoveInvalidParentheses.java[Java] //|{doc_base_url}/0301-remove-invalid-parentheses.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/smallest-rectangle-enclosing-black-pixels/[302. Smallest Rectangle Enclosing Black Pixels^] //|{source_base_url}/_0302_SmallestRectangleEnclosingBlackPixels.java[Java] //|{doc_base_url}/0302-smallest-rectangle-enclosing-black-pixels.adoc[题解] //|Hard //|

|{counter:codes} |{leetcode_base_url}/range-sum-query-immutable/[303. Range Sum Query - Immutable^] |{source_base_url}/_0303_RangeSumQueryImmutable.java[Java] |{doc_base_url}/0303-range-sum-query-immutable.adoc[题解] |Easy |

|{counter:codes} |{leetcode_base_url}/range-sum-query-2d-immutable/[304. Range Sum Query 2D - Immutable^] |{source_base_url}/_0304_RangeSumQuery2DImmutable.java[Java] |{doc_base_url}/0304-range-sum-query-2d-immutable.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/number-of-islands-ii/[305. Number of Islands II^] //|{source_base_url}/_0305_NumberOfIslandsII.java[Java] //|{doc_base_url}/0305-number-of-islands-ii.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/additive-number/[306. Additive Number^] //|{source_base_url}/_0306_AdditiveNumber.java[Java] //|{doc_base_url}/0306-additive-number.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/range-sum-query-mutable/[307. Range Sum Query - Mutable^] //|{source_base_url}/_0307_RangeSumQueryMutable.java[Java] //|{doc_base_url}/0307-range-sum-query-mutable.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/range-sum-query-2d-mutable/[308. Range Sum Query 2D - Mutable^] //|{source_base_url}/_0308_RangeSumQuery2DMutable.java[Java] //|{doc_base_url}/0308-range-sum-query-2d-mutable.adoc[题解] //|Hard //|

|{counter:codes} |{leetcode_base_url}/best-time-to-buy-and-sell-stock-with-cooldown/[309. Best Time to Buy and Sell Stock with Cooldown^] |{source_base_url}/_0309_BestTimeToBuyAndSellStockWithCooldown.java[Java] |{doc_base_url}/0309-best-time-to-buy-and-sell-stock-with-cooldown.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/minimum-height-trees/[310. Minimum Height Trees^] //|{source_base_url}/_0310_MinimumHeightTrees.java[Java] //|{doc_base_url}/0310-minimum-height-trees.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/sparse-matrix-multiplication/[311. Sparse Matrix Multiplication^] //|{source_base_url}/_0311_SparseMatrixMultiplication.java[Java] //|{doc_base_url}/0311-sparse-matrix-multiplication.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/burst-balloons/[312. Burst Balloons^] //|{source_base_url}/_0312_BurstBalloons.java[Java] //|{doc_base_url}/0312-burst-balloons.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/super-ugly-number/[313. Super Ugly Number^] //|{source_base_url}/_0313_SuperUglyNumber.java[Java] //|{doc_base_url}/0313-super-ugly-number.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/binary-tree-vertical-order-traversal/[314. Binary Tree Vertical Order Traversal^] //|{source_base_url}/_0314_BinaryTreeVerticalOrderTraversal.java[Java] //|{doc_base_url}/0314-binary-tree-vertical-order-traversal.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/count-of-smaller-numbers-after-self/[315. Count of Smaller Numbers After Self^] //|{source_base_url}/_0315_CountOfSmallerNumbersAfterSelf.java[Java] //|{doc_base_url}/0315-count-of-smaller-numbers-after-self.adoc[题解] //|Hard //|

|{counter:codes} |{leetcode_base_url}/remove-duplicate-letters/[316. Remove Duplicate Letters^] |{source_base_url}/_0316_RemoveDuplicateLetters.java[Java] |{doc_base_url}/0316-remove-duplicate-letters.adoc[题解] |Hard |

//|{counter:codes} //|{leetcode_base_url}/shortest-distance-from-all-buildings/[317. Shortest Distance from All Buildings^] //|{source_base_url}/_0317_ShortestDistanceFromAllBuildings.java[Java] //|{doc_base_url}/0317-shortest-distance-from-all-buildings.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/maximum-product-of-word-lengths/[318. Maximum Product of Word Lengths^] //|{source_base_url}/_0318_MaximumProductOfWordLengths.java[Java] //|{doc_base_url}/0318-maximum-product-of-word-lengths.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/bulb-switcher/[319. Bulb Switcher^] //|{source_base_url}/_0319_BulbSwitcher.java[Java] //|{doc_base_url}/0319-bulb-switcher.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/generalized-abbreviation/[320. Generalized Abbreviation^] //|{source_base_url}/_0320_GeneralizedAbbreviation.java[Java] //|{doc_base_url}/0320-generalized-abbreviation.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/create-maximum-number/[321. Create Maximum Number^] //|{source_base_url}/_0321_CreateMaximumNumber.java[Java] //|{doc_base_url}/0321-create-maximum-number.adoc[题解] //|Hard //|

|{counter:codes} |{leetcode_base_url}/coin-change/[322. Coin Change^] |{source_base_url}/_0322_CoinChange.java[Java] |{doc_base_url}/0322-coin-change.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/number-of-connected-components-in-an-undirected-graph/[323. Number of Connected Components in an Undirected Graph^] //|{source_base_url}/_0323_NumberOfConnectedComponentsInAnUndirectedGraph.java[Java] //|{doc_base_url}/0323-number-of-connected-components-in-an-undirected-graph.adoc[题解] //|Medium //|

|{counter:codes} |{leetcode_base_url}/wiggle-sort-ii/[324. Wiggle Sort II^] |{source_base_url}/_0324_WiggleSortII.java[Java] |{doc_base_url}/0324-wiggle-sort-ii.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/maximum-size-subarray-sum-equals-k/[325. Maximum Size Subarray Sum Equals k^] //|{source_base_url}/_0325_MaximumSizeSubarraySumEqualsK.java[Java] //|{doc_base_url}/0325-maximum-size-subarray-sum-equals-k.adoc[题解] //|Medium //|

|{counter:codes} |{leetcode_base_url}/power-of-three/[326. Power of Three^] |{source_base_url}/_0326_PowerOfThree.java[Java] |{doc_base_url}/0326-power-of-three.adoc[题解] |Easy |

//|{counter:codes} //|{leetcode_base_url}/count-of-range-sum/[327. Count of Range Sum^] //|{source_base_url}/_0327_CountOfRangeSum.java[Java] //|{doc_base_url}/0327-count-of-range-sum.adoc[题解] //|Hard //|

|{counter:codes} |{leetcode_base_url}/odd-even-linked-list/[328. Odd Even Linked List^] |{source_base_url}/_0328_OddEvenLinkedList.java[Java] |{doc_base_url}/0328-odd-even-linked-list.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/longest-increasing-path-in-a-matrix/[329. Longest Increasing Path in a Matrix^] //|{source_base_url}/_0329_LongestIncreasingPathInAMatrix.java[Java] //|{doc_base_url}/0329-longest-increasing-path-in-a-matrix.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/patching-array/[330. Patching Array^] //|{source_base_url}/_0330_PatchingArray.java[Java] //|{doc_base_url}/0330-patching-array.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/verify-preorder-serialization-of-a-binary-tree/[331. Verify Preorder Serialization of a Binary Tree^] //|{source_base_url}/_0331_VerifyPreorderSerializationOfABinaryTree.java[Java] //|{doc_base_url}/0331-verify-preorder-serialization-of-a-binary-tree.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/reconstruct-itinerary/[332. Reconstruct Itinerary^] //|{source_base_url}/_0332_ReconstructItinerary.java[Java] //|{doc_base_url}/0332-reconstruct-itinerary.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/largest-bst-subtree/[333. Largest BST Subtree^] //|{source_base_url}/_0333_LargestBSTSubtree.java[Java] //|{doc_base_url}/0333-largest-bst-subtree.adoc[题解] //|Medium //|

|{counter:codes} |{leetcode_base_url}/increasing-triplet-subsequence/[334. Increasing Triplet Subsequence^] |{source_base_url}/_0334_IncreasingTripletSubsequence.java[Java] |{doc_base_url}/0334-increasing-triplet-subsequence.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/self-crossing/[335. Self Crossing^] //|{source_base_url}/_0335_SelfCrossing.java[Java] //|{doc_base_url}/0335-self-crossing.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/palindrome-pairs/[336. Palindrome Pairs^] //|{source_base_url}/_0336_PalindromePairs.java[Java] //|{doc_base_url}/0336-palindrome-pairs.adoc[题解] //|Hard //|

|{counter:codes} |{leetcode_base_url}/house-robber-iii/[337. House Robber III^] |{source_base_url}/_0337_HouseRobberIII.java[Java] |{doc_base_url}/0337-house-robber-iii.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/counting-bits/[338. Counting Bits^] |{source_base_url}/_0338_CountingBits.java[Java] |{doc_base_url}/0338-counting-bits.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/nested-list-weight-sum/[339. Nested List Weight Sum^] //|{source_base_url}/_0339_NestedListWeightSum.java[Java] //|{doc_base_url}/0339-nested-list-weight-sum.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/longest-substring-with-at-most-k-distinct-characters/[340. Longest Substring with At Most K Distinct Characters^] //|{source_base_url}/_0340_LongestSubstringWithAtMostKDistinctCharacters.java[Java] //|{doc_base_url}/0340-longest-substring-with-at-most-k-distinct-characters.adoc[题解] //|Hard //|

|{counter:codes} |{leetcode_base_url}/flatten-nested-list-iterator/[341. Flatten Nested List Iterator^] |{source_base_url}/_0341_FlattenNestedListIterator.java[Java] |{doc_base_url}/0341-flatten-nested-list-iterator.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/power-of-four/[342. Power of Four^] //|{source_base_url}/_0342_PowerOfFour.java[Java] //|{doc_base_url}/0342-power-of-four.adoc[题解] //|Easy //|

|{counter:codes} |{leetcode_base_url}/integer-break/[343. Integer Break^] |{source_base_url}/_0343_IntegerBreak.java[Java] |{doc_base_url}/0343-integer-break.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/reverse-string/[344. Reverse String^] |{source_base_url}/_0344_ReverseString.java[Java] |{doc_base_url}/0344-reverse-string.adoc[题解] |Easy |

//|{counter:codes} //|{leetcode_base_url}/reverse-vowels-of-a-string/[345. Reverse Vowels of a String^] //|{source_base_url}/_0345_ReverseVowelsOfAString.java[Java] //|{doc_base_url}/0345-reverse-vowels-of-a-string.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/moving-average-from-data-stream/[346. Moving Average from Data Stream^] //|{source_base_url}/_0346_MovingAverageFromDataStream.java[Java] //|{doc_base_url}/0346-moving-average-from-data-stream.adoc[题解] //|Easy //|

|{counter:codes} |{leetcode_base_url}/top-k-frequent-elements/[347. Top K Frequent Elements^] |{source_base_url}/_0347_TopKFrequentElements.java[Java] |{doc_base_url}/0347-top-k-frequent-elements.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/design-tic-tac-toe/[348. Design Tic-Tac-Toe^] //|{source_base_url}/_0348_DesignTicTacToe.java[Java] //|{doc_base_url}/0348-design-tic-tac-toe.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/intersection-of-two-arrays/[349. Intersection of Two Arrays^] //|{source_base_url}/_0349_IntersectionOfTwoArrays.java[Java] //|{doc_base_url}/0349-intersection-of-two-arrays.adoc[题解] //|Easy //|

|{counter:codes} |{leetcode_base_url}/intersection-of-two-arrays-ii/[350. Intersection of Two Arrays II^] |{source_base_url}/_0350_IntersectionOfTwoArraysIi.java[Java] |{doc_base_url}/0350-intersection-of-two-arrays-ii.adoc[题解] |Easy |

//|{counter:codes} //|{leetcode_base_url}/android-unlock-patterns/[351. Android Unlock Patterns^] //|{source_base_url}/_0351_AndroidUnlockPatterns.java[Java] //|{doc_base_url}/0351-android-unlock-patterns.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/data-stream-as-disjoint-intervals/[352. Data Stream as Disjoint Intervals^] //|{source_base_url}/_0352_DataStreamAsDisjointIntervals.java[Java] //|{doc_base_url}/0352-data-stream-as-disjoint-intervals.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/design-snake-game/[353. Design Snake Game^] //|{source_base_url}/_0353_DesignSnakeGame.java[Java] //|{doc_base_url}/0353-design-snake-game.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/russian-doll-envelopes/[354. Russian Doll Envelopes^] //|{source_base_url}/_0354_RussianDollEnvelopes.java[Java] //|{doc_base_url}/0354-russian-doll-envelopes.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/design-twitter/[355. Design Twitter^] //|{source_base_url}/_0355_DesignTwitter.java[Java] //|{doc_base_url}/0355-design-twitter.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/line-reflection/[356. Line Reflection^] //|{source_base_url}/_0356_LineReflection.java[Java] //|{doc_base_url}/0356-line-reflection.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/count-numbers-with-unique-digits/[357. Count Numbers with Unique Digits^] //|{source_base_url}/_0357_CountNumbersWithUniqueDigits.java[Java] //|{doc_base_url}/0357-count-numbers-with-unique-digits.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/rearrange-string-k-distance-apart/[358. Rearrange String k Distance Apart^] //|{source_base_url}/_0358_RearrangeStringKDistanceApart.java[Java] //|{doc_base_url}/0358-rearrange-string-k-distance-apart.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/logger-rate-limiter/[359. Logger Rate Limiter^] //|{source_base_url}/_0359_LoggerRateLimiter.java[Java] //|{doc_base_url}/0359-logger-rate-limiter.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/sort-transformed-array/[360. Sort Transformed Array^] //|{source_base_url}/_0360_SortTransformedArray.java[Java] //|{doc_base_url}/0360-sort-transformed-array.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/bomb-enemy/[361. Bomb Enemy^] //|{source_base_url}/_0361_BombEnemy.java[Java] //|{doc_base_url}/0361-bomb-enemy.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/design-hit-counter/[362. Design Hit Counter^] //|{source_base_url}/_0362_DesignHitCounter.java[Java] //|{doc_base_url}/0362-design-hit-counter.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/max-sum-of-rectangle-no-larger-than-k/[363. Max Sum of Rectangle No Larger Than K^] //|{source_base_url}/_0363_MaxSumOfRectangleNoLargerThanK.java[Java] //|{doc_base_url}/0363-max-sum-of-rectangle-no-larger-than-k.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/nested-list-weight-sum-ii/[364. Nested List Weight Sum II^] //|{source_base_url}/_0364_NestedListWeightSumII.java[Java] //|{doc_base_url}/0364-nested-list-weight-sum-ii.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/water-and-jug-problem/[365. Water and Jug Problem^] //|{source_base_url}/_0365_WaterAndJugProblem.java[Java] //|{doc_base_url}/0365-water-and-jug-problem.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/find-leaves-of-binary-tree/[366. Find Leaves of Binary Tree^] //|{source_base_url}/_0366_FindLeavesOfBinaryTree.java[Java] //|{doc_base_url}/0366-find-leaves-of-binary-tree.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/valid-perfect-square/[367. Valid Perfect Square^] //|{source_base_url}/_0367_ValidPerfectSquare.java[Java] //|{doc_base_url}/0367-valid-perfect-square.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/largest-divisible-subset/[368. Largest Divisible Subset^] //|{source_base_url}/_0368_LargestDivisibleSubset.java[Java] //|{doc_base_url}/0368-largest-divisible-subset.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/plus-one-linked-list/[369. Plus One Linked List^] //|{source_base_url}/_0369_PlusOneLinkedList.java[Java] //|{doc_base_url}/0369-plus-one-linked-list.adoc[题解] //|Medium //|

|{counter:codes} |{leetcode_base_url}/range-addition/[370. Range Addition^] |{source_base_url}/_0370_RangeAddition.java[Java] |{doc_base_url}/0370-range-addition.adoc[题解] |Medium |Plus专题

|{counter:codes} |{leetcode_base_url}/sum-of-two-integers/[371. Sum of Two Integers^] |{source_base_url}/_0371_SumOfTwoIntegers.java[Java] |{doc_base_url}/0371-sum-of-two-integers.adoc[题解] |Easy |

//|{counter:codes} //|{leetcode_base_url}/super-pow/[372. Super Pow^] //|{source_base_url}/_0372_SuperPow.java[Java] //|{doc_base_url}/0372-super-pow.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/find-k-pairs-with-smallest-sums/[373. Find K Pairs with Smallest Sums^] //|{source_base_url}/_0373_FindKPairsWithSmallestSums.java[Java] //|{doc_base_url}/0373-find-k-pairs-with-smallest-sums.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/guess-number-higher-or-lower/[374. Guess Number Higher or Lower^] //|{source_base_url}/_0374_GuessNumberHigherOrLower.java[Java] //|{doc_base_url}/0374-guess-number-higher-or-lower.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/guess-number-higher-or-lower-ii/[375. Guess Number Higher or Lower II^] //|{source_base_url}/_0375_GuessNumberHigherOrLowerII.java[Java] //|{doc_base_url}/0375-guess-number-higher-or-lower-ii.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/wiggle-subsequence/[376. Wiggle Subsequence^] //|{source_base_url}/_0376_WiggleSubsequence.java[Java] //|{doc_base_url}/0376-wiggle-subsequence.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/combination-sum-iv/[377. Combination Sum IV^] //|{source_base_url}/_0377_CombinationSumIV.java[Java] //|{doc_base_url}/0377-combination-sum-iv.adoc[题解] //|Medium //|

|{counter:codes} |{leetcode_base_url}/kth-smallest-element-in-a-sorted-matrix/[378. Kth Smallest Element in a Sorted Matrix^] |{source_base_url}/_0378_KthSmallestElementInASortedMatrix.java[Java] |{doc_base_url}/0378-kth-smallest-element-in-a-sorted-matrix.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/design-phone-directory/[379. Design Phone Directory^] //|{source_base_url}/_0379_DesignPhoneDirectory.java[Java] //|{doc_base_url}/0379-design-phone-directory.adoc[题解] //|Medium //|

|{counter:codes} |{leetcode_base_url}/insert-delete-getrandom-o1/[380. Insert Delete GetRandom O(1)^] |{source_base_url}/_0380_InsertDeleteGetRandomO1.java[Java] |{doc_base_url}/0380-insert-delete-getrandom-o1.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/insert-delete-getrandom-o1-duplicates-allowed/[381. Insert Delete GetRandom O(1) - Duplicates allowed^] //|{source_base_url}/_0381_InsertDeleteGetRandomO1DuplicatesAllowed.java[Java] //|{doc_base_url}/0381-insert-delete-getrandom-o1-duplicates-allowed.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/linked-list-random-node/[382. Linked List Random Node^] //|{source_base_url}/_0382_LinkedListRandomNode.java[Java] //|{doc_base_url}/0382-linked-list-random-node.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/ransom-note/[383. Ransom Note^] //|{source_base_url}/_0383_RansomNote.java[Java] //|{doc_base_url}/0383-ransom-note.adoc[题解] //|Easy //|

|{counter:codes} |{leetcode_base_url}/shuffle-an-array/[384. Shuffle an Array^] |{source_base_url}/_0384_ShuffleAnArray.java[Java] |{doc_base_url}/0384-shuffle-an-array.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/mini-parser/[385. Mini Parser^] //|{source_base_url}/_0385_MiniParser.java[Java] //|{doc_base_url}/0385-mini-parser.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/lexicographical-numbers/[386. Lexicographical Numbers^] //|{source_base_url}/_0386_LexicographicalNumbers.java[Java] //|{doc_base_url}/0386-lexicographical-numbers.adoc[题解] //|Medium //|

|{counter:codes} |{leetcode_base_url}/first-unique-character-in-a-string/[387. First Unique Character in a String^] |{source_base_url}/_0387_FirstUniqueCharacterInAString.java[Java] |{doc_base_url}/0387-first-unique-character-in-a-string.adoc[题解] |Easy |

//|{counter:codes} //|{leetcode_base_url}/longest-absolute-file-path/[388. Longest Absolute File Path^] //|{source_base_url}/_0388_LongestAbsoluteFilePath.java[Java] //|{doc_base_url}/0388-longest-absolute-file-path.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/find-the-difference/[389. Find the Difference^] //|{source_base_url}/_0389_FindTheDifference.java[Java] //|{doc_base_url}/0389-find-the-difference.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/elimination-game/[390. Elimination Game^] //|{source_base_url}/_0390_EliminationGame.java[Java] //|{doc_base_url}/0390-elimination-game.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/perfect-rectangle/[391. Perfect Rectangle^] //|{source_base_url}/_0391_PerfectRectangle.java[Java] //|{doc_base_url}/0391-perfect-rectangle.adoc[题解] //|Hard //|

|{counter:codes} |{leetcode_base_url}/is-subsequence/[392. Is Subsequence^] |{source_base_url}/_0392_IsSubsequence.java[Java] |{doc_base_url}/0392-is-subsequence.adoc[题解] |Easy |

//|{counter:codes} //|{leetcode_base_url}/utf-8-validation/[393. UTF-8 Validation^] //|{source_base_url}/_0393_UTF8Validation.java[Java] //|{doc_base_url}/0393-utf-8-validation.adoc[题解] //|Medium //|

|{counter:codes} |{leetcode_base_url}/decode-string/[394. Decode String^] |{source_base_url}/_0394_DecodeString.java[Java] |{doc_base_url}/0394-decode-string.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/longest-substring-with-at-least-k-repeating-characters/[395. Longest Substring with At Least K Repeating Characters^] |{source_base_url}/_0395_LongestSubstringWithAtLeastKRepeatingCharacters.java[Java] |{doc_base_url}/0395-longest-substring-with-at-least-k-repeating-characters.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/rotate-function/[396. Rotate Function^] //|{source_base_url}/_0396_RotateFunction.java[Java] //|{doc_base_url}/0396-rotate-function.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/integer-replacement/[397. Integer Replacement^] //|{source_base_url}/_0397_IntegerReplacement.java[Java] //|{doc_base_url}/0397-integer-replacement.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/random-pick-index/[398. Random Pick Index^] //|{source_base_url}/_0398_RandomPickIndex.java[Java] //|{doc_base_url}/0398-random-pick-index.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/evaluate-division/[399. Evaluate Division^] //|{source_base_url}/_0399_EvaluateDivision.java[Java] //|{doc_base_url}/0399-evaluate-division.adoc[题解] //|Medium //|

|{counter:codes} |{leetcode_base_url}/nth-digit/[400. Nth Digit^] |{source_base_url}/_0400_NthDigit.java[Java] |{doc_base_url}/0400-nth-digit.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/binary-watch/[401. Binary Watch^] //|{source_base_url}/_0401_BinaryWatch.java[Java] //|{doc_base_url}/0401-binary-watch.adoc[题解] //|Easy //|

|{counter:codes} |{leetcode_base_url}/remove-k-digits/[402. Remove K Digits^] |{source_base_url}/_0402_RemoveKDigits.java[Java] |{doc_base_url}/0402-remove-k-digits.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/frog-jump/[403. Frog Jump^] //|{source_base_url}/_0403_FrogJump.java[Java] //|{doc_base_url}/0403-frog-jump.adoc[题解] //|Hard //|

|{counter:codes} |{leetcode_base_url}/sum-of-left-leaves/[404. Sum of Left Leaves^] |{source_base_url}/_0404_SumOfLeftLeaves.java[Java] |{doc_base_url}/0404-sum-of-left-leaves.adoc[题解] |Easy |

//|{counter:codes} //|{leetcode_base_url}/convert-a-number-to-hexadecimal/[405. Convert a Number to Hexadecimal^] //|{source_base_url}/_0405_ConvertANumberToHexadecimal.java[Java] //|{doc_base_url}/0405-convert-a-number-to-hexadecimal.adoc[题解] //|Easy //|

|{counter:codes} |{leetcode_base_url}/queue-reconstruction-by-height/[406. Queue Reconstruction by Height^] |{source_base_url}/_0406_QueueReconstructionByHeight.java[Java] |{doc_base_url}/0406-queue-reconstruction-by-height.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/trapping-rain-water-ii/[407. Trapping Rain Water II^] //|{source_base_url}/_0407_TrappingRainWaterII.java[Java] //|{doc_base_url}/0407-trapping-rain-water-ii.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/valid-word-abbreviation/[408. Valid Word Abbreviation^] //|{source_base_url}/_0408_ValidWordAbbreviation.java[Java] //|{doc_base_url}/0408-valid-word-abbreviation.adoc[题解] //|Easy //|

|{counter:codes} |{leetcode_base_url}/longest-palindrome/[409. Longest Palindrome^] |{source_base_url}/_0409_LongestPalindrome.java[Java] |{doc_base_url}/0409-longest-palindrome.adoc[题解] |Easy |

//|{counter:codes} //|{leetcode_base_url}/split-array-largest-sum/[410. Split Array Largest Sum^] //|{source_base_url}/_0410_SplitArrayLargestSum.java[Java] //|{doc_base_url}/0410-split-array-largest-sum.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/minimum-unique-word-abbreviation/[411. Minimum Unique Word Abbreviation^] //|{source_base_url}/_0411_MinimumUniqueWordAbbreviation.java[Java] //|{doc_base_url}/0411-minimum-unique-word-abbreviation.adoc[题解] //|Hard //|

|{counter:codes} |{leetcode_base_url}/fizz-buzz/[412. Fizz Buzz^] |{source_base_url}/_0412_FizzBuzz.java[Java] |{doc_base_url}/0412-fizz-buzz.adoc[题解] |Easy |

//|{counter:codes} //|{leetcode_base_url}/arithmetic-slices/[413. Arithmetic Slices^] //|{source_base_url}/_0413_ArithmeticSlices.java[Java] //|{doc_base_url}/0413-arithmetic-slices.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/third-maximum-number/[414. Third Maximum Number^] //|{source_base_url}/_0414_ThirdMaximumNumber.java[Java] //|{doc_base_url}/0414-third-maximum-number.adoc[题解] //|Easy //|

|{counter:codes} |{leetcode_base_url}/add-strings/[415. Add Strings^] |{source_base_url}/_0415_AddStrings.java[Java] |{doc_base_url}/0415-add-strings.adoc[题解] |Easy |

|{counter:codes} |{leetcode_base_url}/partition-equal-subset-sum/[416. Partition Equal Subset Sum^] |{source_base_url}/_0416_PartitionEqualSubsetSum.java[Java] |{doc_base_url}/0416-partition-equal-subset-sum.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/pacific-atlantic-water-flow/[417. Pacific Atlantic Water Flow^] //|{source_base_url}/_0417_PacificAtlanticWaterFlow.java[Java] //|{doc_base_url}/0417-pacific-atlantic-water-flow.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/sentence-screen-fitting/[418. Sentence Screen Fitting^] //|{source_base_url}/_0418_SentenceScreenFitting.java[Java] //|{doc_base_url}/0418-sentence-screen-fitting.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/battleships-in-a-board/[419. Battleships in a Board^] //|{source_base_url}/_0419_BattleshipsInABoard.java[Java] //|{doc_base_url}/0419-battleships-in-a-board.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/strong-password-checker/[420. Strong Password Checker^] //|{source_base_url}/_0420_StrongPasswordChecker.java[Java] //|{doc_base_url}/0420-strong-password-checker.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/maximum-xor-of-two-numbers-in-an-array/[421. Maximum XOR of Two Numbers in an Array^] //|{source_base_url}/_0421_MaximumXOROfTwoNumbersInAnArray.java[Java] //|{doc_base_url}/0421-maximum-xor-of-two-numbers-in-an-array.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/valid-word-square/[422. Valid Word Square^] //|{source_base_url}/_0422_ValidWordSquare.java[Java] //|{doc_base_url}/0422-valid-word-square.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/reconstruct-original-digits-from-english/[423. Reconstruct Original Digits from English^] //|{source_base_url}/_0423_ReconstructOriginalDigitsFromEnglish.java[Java] //|{doc_base_url}/0423-reconstruct-original-digits-from-english.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/longest-repeating-character-replacement/[424. Longest Repeating Character Replacement^] //|{source_base_url}/_0424_LongestRepeatingCharacterReplacement.java[Java] //|{doc_base_url}/0424-longest-repeating-character-replacement.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/word-squares/[425. Word Squares^] //|{source_base_url}/_0425_WordSquares.java[Java] //|{doc_base_url}/0425-word-squares.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/convert-binary-search-tree-to-sorted-doubly-linked-list/[426. Convert Binary Search Tree to Sorted Doubly Linked List^] //|{source_base_url}/_0426_ConvertBinarySearchTreeToSortedDoublyLinkedList.java[Java] //|{doc_base_url}/0426-convert-binary-search-tree-to-sorted-doubly-linked-list.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/construct-quad-tree/[427. Construct Quad Tree^] //|{source_base_url}/_0427_ConstructQuadTree.java[Java] //|{doc_base_url}/0427-construct-quad-tree.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/serialize-and-deserialize-n-ary-tree/[428. Serialize and Deserialize N-ary Tree^] //|{source_base_url}/_0428_SerializeAndDeserializeNAryTree.java[Java] //|{doc_base_url}/0428-serialize-and-deserialize-n-ary-tree.adoc[题解] //|Hard //|

|{counter:codes} |{leetcode_base_url}/n-ary-tree-level-order-traversal/[429. N-ary Tree Level Order Traversal^] |{source_base_url}/_0429_NAryTreeLevelOrderTraversal.java[Java] |{doc_base_url}/0429-n-ary-tree-level-order-traversal.adoc[题解] |Medium |广度优先

//|{counter:codes} //|{leetcode_base_url}/flatten-a-multilevel-doubly-linked-list/[430. Flatten a Multilevel Doubly Linked List^] //|{source_base_url}/_0430_FlattenAMultilevelDoublyLinkedList.java[Java] //|{doc_base_url}/0430-flatten-a-multilevel-doubly-linked-list.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/encode-n-ary-tree-to-binary-tree/[431. Encode N-ary Tree to Binary Tree^] //|{source_base_url}/_0431_EncodeNAryTreeToBinaryTree.java[Java] //|{doc_base_url}/0431-encode-n-ary-tree-to-binary-tree.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/all-oone-data-structure/[432. All O`one Data Structure^] //|{source_base_url}/_0432_AllOOneDataStructure.java[Java] //|{doc_base_url}/0432-all-oone-data-structure.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/minimum-genetic-mutation/[433. Minimum Genetic Mutation^] //|{source_base_url}/_0433_MinimumGeneticMutation.java[Java] //|{doc_base_url}/0433-minimum-genetic-mutation.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/number-of-segments-in-a-string/[434. Number of Segments in a String^] //|{source_base_url}/_0434_NumberOfSegmentsInAString.java[Java] //|{doc_base_url}/0434-number-of-segments-in-a-string.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/non-overlapping-intervals/[435. Non-overlapping Intervals^] //|{source_base_url}/_0435_NonOverlappingIntervals.java[Java] //|{doc_base_url}/0435-non-overlapping-intervals.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/find-right-interval/[436. Find Right Interval^] //|{source_base_url}/_0436_FindRightInterval.java[Java] //|{doc_base_url}/0436-find-right-interval.adoc[题解] //|Medium //|

|{counter:codes} |{leetcode_base_url}/path-sum-iii/[437. Path Sum III^] |{source_base_url}/_0437_PathSumIII.java[Java] |{doc_base_url}/0437-path-sum-iii.adoc[题解] |Medium |前缀和解法还需要多思考！

|{counter:codes} |{leetcode_base_url}/find-all-anagrams-in-a-string/[438. Find All Anagrams in a String^] |{source_base_url}/_0438_FindAllAnagramsInAString.java[Java] |{doc_base_url}/0438-find-all-anagrams-in-a-string.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/ternary-expression-parser/[439. Ternary Expression Parser^] //|{source_base_url}/_0439_TernaryExpressionParser.java[Java] //|{doc_base_url}/0439-ternary-expression-parser.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/k-th-smallest-in-lexicographical-order/[440. K-th Smallest in Lexicographical Order^] //|{source_base_url}/_0440_KThSmallestInLexicographicalOrder.java[Java] //|{doc_base_url}/0440-k-th-smallest-in-lexicographical-order.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/arranging-coins/[441. Arranging Coins^] //|{source_base_url}/_0441_ArrangingCoins.java[Java] //|{doc_base_url}/0441-arranging-coins.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/find-all-duplicates-in-an-array/[442. Find All Duplicates in an Array^] //|{source_base_url}/_0442_FindAllDuplicatesInAnArray.java[Java] //|{doc_base_url}/0442-find-all-duplicates-in-an-array.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/string-compression/[443. String Compression^] //|{source_base_url}/_0443_StringCompression.java[Java] //|{doc_base_url}/0443-string-compression.adoc[题解] //|Easy //|

// |{counter:codes} // |{leetcode_base_url}/sequence-reconstruction/[444. Sequence Reconstruction^] // |{source_base_url}/_0444_SequenceReconstruction.java[Java] // |{doc_base_url}/0444-sequence-reconstruction.adoc[题解] // |Medium // |

//|{counter:codes} //|{leetcode_base_url}/add-two-numbers-ii/[445. Add Two Numbers II^] //|{source_base_url}/_0445_AddTwoNumbersII.java[Java] //|{doc_base_url}/0445-add-two-numbers-ii.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/arithmetic-slices-ii-subsequence/[446. Arithmetic Slices II - Subsequence^] //|{source_base_url}/_0446_ArithmeticSlicesIISubsequence.java[Java] //|{doc_base_url}/0446-arithmetic-slices-ii-subsequence.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/number-of-boomerangs/[447. Number of Boomerangs^] //|{source_base_url}/_0447_NumberOfBoomerangs.java[Java] //|{doc_base_url}/0447-number-of-boomerangs.adoc[题解] //|Easy //|

|{counter:codes} |{leetcode_base_url}/find-all-numbers-disappeared-in-an-array/[448. Find All Numbers Disappeared in an Array^] |{source_base_url}/_0448_FindAllNumbersDisappearedInAnArray.java[Java] |{doc_base_url}/0448-find-all-numbers-disappeared-in-an-array.adoc[题解] |Easy |

//|{counter:codes} //|{leetcode_base_url}/serialize-and-deserialize-bst/[449. Serialize and Deserialize BST^] //|{source_base_url}/_0449_SerializeAndDeserializeBST.java[Java] //|{doc_base_url}/0449-serialize-and-deserialize-bst.adoc[题解] //|Medium //|

|{counter:codes} |{leetcode_base_url}/delete-node-in-a-bst/[450. Delete Node in a BST^] |{source_base_url}/_0450_DeleteNodeInABST.java[Java] |{doc_base_url}/0450-delete-node-in-a-bst.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/sort-characters-by-frequency/[451. Sort Characters By Frequency^] //|{source_base_url}/_0451_SortCharactersByFrequency.java[Java] //|{doc_base_url}/0451-sort-characters-by-frequency.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/minimum-number-of-arrows-to-burst-balloons/[452. Minimum Number of Arrows to Burst Balloons^] //|{source_base_url}/_0452_MinimumNumberOfArrowsToBurstBalloons.java[Java] //|{doc_base_url}/0452-minimum-number-of-arrows-to-burst-balloons.adoc[题解] //|Medium //|

|{counter:codes} |{leetcode_base_url}/minimum-moves-to-equal-array-elements/[453. Minimum Moves to Equal Array Elements^] |{source_base_url}/_0453_MinimumMovesToEqualArrayElements.java[Java] |{doc_base_url}/0453-minimum-moves-to-equal-array-elements.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/4sum-ii/[454. 4Sum II^] |{source_base_url}/_0454_4SumII.java[Java] |{doc_base_url}/0454-4sum-ii.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/assign-cookies/[455. Assign Cookies^] //|{source_base_url}/_0455_AssignCookies.java[Java] //|{doc_base_url}/0455-assign-cookies.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/132-pattern/[456. 132 Pattern^] //|{source_base_url}/_0456_132Pattern.java[Java] //|{doc_base_url}/0456-132-pattern.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/circular-array-loop/[457. Circular Array Loop^] //|{source_base_url}/_0457_CircularArrayLoop.java[Java] //|{doc_base_url}/0457-circular-array-loop.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/poor-pigs/[458. Poor Pigs^] //|{source_base_url}/_0458_PoorPigs.java[Java] //|{doc_base_url}/0458-poor-pigs.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/repeated-substring-pattern/[459. Repeated Substring Pattern^] //|{source_base_url}/_0459_RepeatedSubstringPattern.java[Java] //|{doc_base_url}/0459-repeated-substring-pattern.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/lfu-cache/[460. LFU Cache^] //|{source_base_url}/_0460_LFUCache.java[Java] //|{doc_base_url}/0460-lfu-cache.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/hamming-distance/[461. Hamming Distance^] //|{source_base_url}/_0461_HammingDistance.java[Java] //|{doc_base_url}/0461-hamming-distance.adoc[题解] //|Easy //|

|{counter:codes} |{leetcode_base_url}/minimum-moves-to-equal-array-elements-ii/[462. Minimum Moves to Equal Array Elements II^] |{source_base_url}/_0462_MinimumMovesToEqualArrayElementsII.java[Java] |{doc_base_url}/0462-minimum-moves-to-equal-array-elements-ii.adoc[题解] |Medium |快速选择

//|{counter:codes} //|{leetcode_base_url}/island-perimeter/[463. Island Perimeter^] //|{source_base_url}/_0463_IslandPerimeter.java[Java] //|{doc_base_url}/0463-island-perimeter.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/can-i-win/[464. Can I Win^] //|{source_base_url}/_0464_CanIWin.java[Java] //|{doc_base_url}/0464-can-i-win.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/optimal-account-balancing/[465. Optimal Account Balancing^] //|{source_base_url}/_0465_OptimalAccountBalancing.java[Java] //|{doc_base_url}/0465-optimal-account-balancing.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/count-the-repetitions/[466. Count The Repetitions^] //|{source_base_url}/_0466_CountTheRepetitions.java[Java] //|{doc_base_url}/0466-count-the-repetitions.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/unique-substrings-in-wraparound-string/[467. Unique Substrings in Wraparound String^] //|{source_base_url}/_0467_UniqueSubstringsInWraparoundString.java[Java] //|{doc_base_url}/0467-unique-substrings-in-wraparound-string.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/validate-ip-address/[468. Validate IP Address^] //|{source_base_url}/_0468_ValidateIPAddress.java[Java] //|{doc_base_url}/0468-validate-ip-address.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/convex-polygon/[469. Convex Polygon^] //|{source_base_url}/_0469_ConvexPolygon.java[Java] //|{doc_base_url}/0469-convex-polygon.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/implement-rand10-using-rand7/[470. Implement Rand10() Using Rand7()^] //|{source_base_url}/_0470_ImplementRand10UsingRand7.java[Java] //|{doc_base_url}/0470-implement-rand10-using-rand7.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/encode-string-with-shortest-length/[471. Encode String with Shortest Length^] //|{source_base_url}/_0471_EncodeStringWithShortestLength.java[Java] //|{doc_base_url}/0471-encode-string-with-shortest-length.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/concatenated-words/[472. Concatenated Words^] //|{source_base_url}/_0472_ConcatenatedWords.java[Java] //|{doc_base_url}/0472-concatenated-words.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/matchsticks-to-square/[473. Matchsticks to Square^] //|{source_base_url}/_0473_MatchsticksToSquare.java[Java] //|{doc_base_url}/0473-matchsticks-to-square.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/ones-and-zeroes/[474. Ones and Zeroes^] //|{source_base_url}/_0474_OnesAndZeroes.java[Java] //|{doc_base_url}/0474-ones-and-zeroes.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/heaters/[475. Heaters^] //|{source_base_url}/_0475_Heaters.java[Java] //|{doc_base_url}/0475-heaters.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/number-complement/[476. Number Complement^] //|{source_base_url}/_0476_NumberComplement.java[Java] //|{doc_base_url}/0476-number-complement.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/total-hamming-distance/[477. Total Hamming Distance^] //|{source_base_url}/_0477_TotalHammingDistance.java[Java] //|{doc_base_url}/0477-total-hamming-distance.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/generate-random-point-in-a-circle/[478. Generate Random Point in a Circle^] //|{source_base_url}/_0478_GenerateRandomPointInACircle.java[Java] //|{doc_base_url}/0478-generate-random-point-in-a-circle.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/largest-palindrome-product/[479. Largest Palindrome Product^] //|{source_base_url}/_0479_LargestPalindromeProduct.java[Java] //|{doc_base_url}/0479-largest-palindrome-product.adoc[题解] //|Hard //|

|{counter:codes} |{leetcode_base_url}/sliding-window-median/[480. Sliding Window Median^] |{source_base_url}/_0480_SlidingWindowMedian.java[Java] |{doc_base_url}/0480-sliding-window-median.adoc[题解] |Hard |

//|{counter:codes} //|{leetcode_base_url}/magical-string/[481. Magical String^] //|{source_base_url}/_0481_MagicalString.java[Java] //|{doc_base_url}/0481-magical-string.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/license-key-formatting/[482. License Key Formatting^] //|{source_base_url}/_0482_LicenseKeyFormatting.java[Java] //|{doc_base_url}/0482-license-key-formatting.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/smallest-good-base/[483. Smallest Good Base^] //|{source_base_url}/_0483_SmallestGoodBase.java[Java] //|{doc_base_url}/0483-smallest-good-base.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/find-permutation/[484. Find Permutation^] //|{source_base_url}/_0484_FindPermutation.java[Java] //|{doc_base_url}/0484-find-permutation.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/max-consecutive-ones/[485. Max Consecutive Ones^] //|{source_base_url}/_0485_MaxConsecutiveOnes.java[Java] //|{doc_base_url}/0485-max-consecutive-ones.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/predict-the-winner/[486. Predict the Winner^] //|{source_base_url}/_0486_PredictTheWinner.java[Java] //|{doc_base_url}/0486-predict-the-winner.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/max-consecutive-ones-ii/[487. Max Consecutive Ones II^] //|{source_base_url}/_0487_MaxConsecutiveOnesII.java[Java] //|{doc_base_url}/0487-max-consecutive-ones-ii.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/zuma-game/[488. Zuma Game^] //|{source_base_url}/_0488_ZumaGame.java[Java] //|{doc_base_url}/0488-zuma-game.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/robot-room-cleaner/[489. Robot Room Cleaner^] //|{source_base_url}/_0489_RobotRoomCleaner.java[Java] //|{doc_base_url}/0489-robot-room-cleaner.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/the-maze/[490. The Maze^] //|{source_base_url}/_0490_TheMaze.java[Java] //|{doc_base_url}/0490-the-maze.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/increasing-subsequences/[491. Increasing Subsequences^] //|{source_base_url}/_0491_IncreasingSubsequences.java[Java] //|{doc_base_url}/0491-increasing-subsequences.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/construct-the-rectangle/[492. Construct the Rectangle^] //|{source_base_url}/_0492_ConstructTheRectangle.java[Java] //|{doc_base_url}/0492-construct-the-rectangle.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/reverse-pairs/[493. Reverse Pairs^] //|{source_base_url}/_0493_ReversePairs.java[Java] //|{doc_base_url}/0493-reverse-pairs.adoc[题解] //|Hard //|

|{counter:codes} |{leetcode_base_url}/target-sum/[494. Target Sum^] |{source_base_url}/_0494_TargetSum.java[Java] |{doc_base_url}/0494-target-sum.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/teemo-attacking/[495. Teemo Attacking^] //|{source_base_url}/_0495_TeemoAttacking.java[Java] //|{doc_base_url}/0495-teemo-attacking.adoc[题解] //|Medium //|

|{counter:codes} |{leetcode_base_url}/next-greater-element-i/[496. Next Greater Element I^] |{source_base_url}/_0496_NextGreaterElementI.java[Java] |{doc_base_url}/0496-next-greater-element-i.adoc[题解] |Easy |

//|{counter:codes} //|{leetcode_base_url}/random-point-in-non-overlapping-rectangles/[497. Random Point in Non-overlapping Rectangles^] //|{source_base_url}/_0497_RandomPointInNonOverlappingRectangles.java[Java] //|{doc_base_url}/0497-random-point-in-non-overlapping-rectangles.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/diagonal-traverse/[498. Diagonal Traverse^] //|{source_base_url}/_0498_DiagonalTraverse.java[Java] //|{doc_base_url}/0498-diagonal-traverse.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/the-maze-iii/[499. The Maze III^] //|{source_base_url}/_0499_TheMazeIII.java[Java] //|{doc_base_url}/0499-the-maze-iii.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/keyboard-row/[500. Keyboard Row^] //|{source_base_url}/_0500_KeyboardRow.java[Java] //|{doc_base_url}/0500-keyboard-row.adoc[题解] //|Easy //|

|{counter:codes} |{leetcode_base_url}/find-mode-in-binary-search-tree/[501. Find Mode in Binary Search Tree^] |{source_base_url}/_0501_FindModeInBinarySearchTree.java[Java] |{doc_base_url}/0501-find-mode-in-binary-search-tree.adoc[题解] |Easy |

//|{counter:codes} //|{leetcode_base_url}/ipo/[502. IPO^] //|{source_base_url}/_0502_IPO.java[Java] //|{doc_base_url}/0502-ipo.adoc[题解] //|Hard //|

|{counter:codes} |{leetcode_base_url}/next-greater-element-ii/[503. Next Greater Element II^] |{source_base_url}/_0503_NextGreaterElementII.java[Java] |{doc_base_url}/0503-next-greater-element-ii.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/base-7/[504. Base 7^] //|{source_base_url}/_0504_Base7.java[Java] //|{doc_base_url}/0504-base-7.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/the-maze-ii/[505. The Maze II^] //|{source_base_url}/_0505_TheMazeII.java[Java] //|{doc_base_url}/0505-the-maze-ii.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/relative-ranks/[506. Relative Ranks^] //|{source_base_url}/_0506_RelativeRanks.java[Java] //|{doc_base_url}/0506-relative-ranks.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/perfect-number/[507. Perfect Number^] //|{source_base_url}/_0507_PerfectNumber.java[Java] //|{doc_base_url}/0507-perfect-number.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/most-frequent-subtree-sum/[508. Most Frequent Subtree Sum^] //|{source_base_url}/_0508_MostFrequentSubtreeSum.java[Java] //|{doc_base_url}/0508-most-frequent-subtree-sum.adoc[题解] //|Medium //|

|{counter:codes} |{leetcode_base_url}/fibonacci-number/[509. Fibonacci Number^] |{source_base_url}/_0509_FibonacciNumber.java[Java] |{doc_base_url}/0509-fibonacci-number.adoc[题解] |Easy |

//|{counter:codes} //|{leetcode_base_url}/inorder-successor-in-bst-ii/[510. Inorder Successor in BST II^] //|{source_base_url}/_0510_InorderSuccessorInBSTII.java[Java] //|{doc_base_url}/0510-inorder-successor-in-bst-ii.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/game-play-analysis-i/[511. Game Play Analysis I^] //|{source_base_url}/_0511_GamePlayAnalysisI.java[Java] //|{doc_base_url}/0511-game-play-analysis-i.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/game-play-analysis-ii/[512. Game Play Analysis II^] //|{source_base_url}/_0512_GamePlayAnalysisII.java[Java] //|{doc_base_url}/0512-game-play-analysis-ii.adoc[题解] //|Easy //|

|{counter:codes} |{leetcode_base_url}/find-bottom-left-tree-value/[513. Find Bottom Left Tree Value^] |{source_base_url}/_0513_FindBottomLeftTreeValue.java[Java] |{doc_base_url}/0513-find-bottom-left-tree-value.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/freedom-trail/[514. Freedom Trail^] //|{source_base_url}/_0514_FreedomTrail.java[Java] //|{doc_base_url}/0514-freedom-trail.adoc[题解] //|Hard //|

|{counter:codes} |{leetcode_base_url}/find-largest-value-in-each-tree-row/[515. Find Largest Value in Each Tree Row^] |{source_base_url}/_0515_FindLargestValueInEachTreeRow.java[Java] |{doc_base_url}/0515-find-largest-value-in-each-tree-row.adoc[题解] |Medium |层序遍历

//|{counter:codes} //|{leetcode_base_url}/longest-palindromic-subsequence/[516. Longest Palindromic Subsequence^] //|{source_base_url}/_0516_LongestPalindromicSubsequence.java[Java] //|{doc_base_url}/0516-longest-palindromic-subsequence.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/super-washing-machines/[517. Super Washing Machines^] //|{source_base_url}/_0517_SuperWashingMachines.java[Java] //|{doc_base_url}/0517-super-washing-machines.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/coin-change-2/[518. Coin Change 2^] //|{source_base_url}/_0518_CoinChange2.java[Java] //|{doc_base_url}/0518-coin-change-2.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/random-flip-matrix/[519. Random Flip Matrix^] //|{source_base_url}/_0519_RandomFlipMatrix.java[Java] //|{doc_base_url}/0519-random-flip-matrix.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/detect-capital/[520. Detect Capital^] //|{source_base_url}/_0520_DetectCapital.java[Java] //|{doc_base_url}/0520-detect-capital.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/longest-uncommon-subsequence-i/[521. Longest Uncommon Subsequence I ^] //|{source_base_url}/_0521_LongestUncommonSubsequenceI.java[Java] //|{doc_base_url}/0521-longest-uncommon-subsequence-i.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/longest-uncommon-subsequence-ii/[522. Longest Uncommon Subsequence II^] //|{source_base_url}/_0522_LongestUncommonSubsequenceII.java[Java] //|{doc_base_url}/0522-longest-uncommon-subsequence-ii.adoc[题解] //|Medium //|

|{counter:codes} |{leetcode_base_url}/continuous-subarray-sum/[523. Continuous Subarray Sum^] |{source_base_url}/_0523_ContinuousSubarraySum.java[Java] |{doc_base_url}/0523-continuous-subarray-sum.adoc[题解] |Medium |前缀和

//|{counter:codes} //|{leetcode_base_url}/longest-word-in-dictionary-through-deleting/[524. Longest Word in Dictionary through Deleting^] //|{source_base_url}/_0524_LongestWordInDictionaryThroughDeleting.java[Java] //|{doc_base_url}/0524-longest-word-in-dictionary-through-deleting.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/contiguous-array/[525. Contiguous Array^] //|{source_base_url}/_0525_ContiguousArray.java[Java] //|{doc_base_url}/0525-contiguous-array.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/beautiful-arrangement/[526. Beautiful Arrangement^] //|{source_base_url}/_0526_BeautifulArrangement.java[Java] //|{doc_base_url}/0526-beautiful-arrangement.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/word-abbreviation/[527. Word Abbreviation^] //|{source_base_url}/_0527_WordAbbreviation.java[Java] //|{doc_base_url}/0527-word-abbreviation.adoc[题解] //|Hard //|

|{counter:codes} |{leetcode_base_url}/random-pick-with-weight/[528. Random Pick with Weight^] |{source_base_url}/_0528_RandomPickWithWeight.java[Java] |{doc_base_url}/0528-random-pick-with-weight.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/minesweeper/[529. Minesweeper^] //|{source_base_url}/_0529_Minesweeper.java[Java] //|{doc_base_url}/0529-minesweeper.adoc[题解] //|Medium //|

|{counter:codes} |{leetcode_base_url}/minimum-absolute-difference-in-bst/[530. Minimum Absolute Difference in BST^] |{source_base_url}/_0530_MinimumAbsoluteDifferenceInBST.java[Java] |{doc_base_url}/0530-minimum-absolute-difference-in-bst.adoc[题解] |Easy |

//|{counter:codes} //|{leetcode_base_url}/lonely-pixel-i/[531. Lonely Pixel I^] //|{source_base_url}/_0531_LonelyPixelI.java[Java] //|{doc_base_url}/0531-lonely-pixel-i.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/k-diff-pairs-in-an-array/[532. K-diff Pairs in an Array^] //|{source_base_url}/_0532_KDiffPairsInAnArray.java[Java] //|{doc_base_url}/0532-k-diff-pairs-in-an-array.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/lonely-pixel-ii/[533. Lonely Pixel II^] //|{source_base_url}/_0533_LonelyPixelII.java[Java] //|{doc_base_url}/0533-lonely-pixel-ii.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/game-play-analysis-iii/[534. Game Play Analysis III^] //|{source_base_url}/_0534_GamePlayAnalysisIII.java[Java] //|{doc_base_url}/0534-game-play-analysis-iii.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/encode-and-decode-tinyurl/[535. Encode and Decode TinyURL^] //|{source_base_url}/_0535_EncodeAndDecodeTinyURL.java[Java] //|{doc_base_url}/0535-encode-and-decode-tinyurl.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/construct-binary-tree-from-string/[536. Construct Binary Tree from String^] //|{source_base_url}/_0536_ConstructBinaryTreeFromString.java[Java] //|{doc_base_url}/0536-construct-binary-tree-from-string.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/complex-number-multiplication/[537. Complex Number Multiplication^] //|{source_base_url}/_0537_ComplexNumberMultiplication.java[Java] //|{doc_base_url}/0537-complex-number-multiplication.adoc[题解] //|Medium //|

|{counter:codes} |{leetcode_base_url}/convert-bst-to-greater-tree/[538. Convert BST to Greater Tree^] |{source_base_url}/_0538_ConvertBSTToGreaterTree.java[Java] |{doc_base_url}/0538-convert-bst-to-greater-tree.adoc[题解] |Easy |

//|{counter:codes} //|{leetcode_base_url}/minimum-time-difference/[539. Minimum Time Difference^] //|{source_base_url}/_0539_MinimumTimeDifference.java[Java] //|{doc_base_url}/0539-minimum-time-difference.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/single-element-in-a-sorted-array/[540. Single Element in a Sorted Array^] //|{source_base_url}/_0540_SingleElementInASortedArray.java[Java] //|{doc_base_url}/0540-single-element-in-a-sorted-array.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/reverse-string-ii/[541. Reverse String II^] //|{source_base_url}/_0541_ReverseStringII.java[Java] //|{doc_base_url}/0541-reverse-string-ii.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/01-matrix/[542. 01 Matrix^] //|{source_base_url}/_0542_01Matrix.java[Java] //|{doc_base_url}/0542-01-matrix.adoc[题解] //|Medium //|

|{counter:codes} |{leetcode_base_url}/diameter-of-binary-tree/[543. Diameter of Binary Tree^] |{source_base_url}/_0543_DiameterOfBinaryTree.java[Java] |{doc_base_url}/0543-diameter-of-binary-tree.adoc[题解] |Easy |

//|{counter:codes} //|{leetcode_base_url}/output-contest-matches/[544. Output Contest Matches^] //|{source_base_url}/_0544_OutputContestMatches.java[Java] //|{doc_base_url}/0544-output-contest-matches.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/boundary-of-binary-tree/[545. Boundary of Binary Tree^] //|{source_base_url}/_0545_BoundaryOfBinaryTree.java[Java] //|{doc_base_url}/0545-boundary-of-binary-tree.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/remove-boxes/[546. Remove Boxes^] //|{source_base_url}/_0546_RemoveBoxes.java[Java] //|{doc_base_url}/0546-remove-boxes.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/friend-circles/[547. Friend Circles^] //|{source_base_url}/_0547_FriendCircles.java[Java] //|{doc_base_url}/0547-friend-circles.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/split-array-with-equal-sum/[548. Split Array with Equal Sum^] //|{source_base_url}/_0548_SplitArrayWithEqualSum.java[Java] //|{doc_base_url}/0548-split-array-with-equal-sum.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/binary-tree-longest-consecutive-sequence-ii/[549. Binary Tree Longest Consecutive Sequence II^] //|{source_base_url}/_0549_BinaryTreeLongestConsecutiveSequenceII.java[Java] //|{doc_base_url}/0549-binary-tree-longest-consecutive-sequence-ii.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/game-play-analysis-iv/[550. Game Play Analysis IV^] //|{source_base_url}/_0550_GamePlayAnalysisIV.java[Java] //|{doc_base_url}/0550-game-play-analysis-iv.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/student-attendance-record-i/[551. Student Attendance Record I^] //|{source_base_url}/_0551_StudentAttendanceRecordI.java[Java] //|{doc_base_url}/0551-student-attendance-record-i.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/student-attendance-record-ii/[552. Student Attendance Record II^] //|{source_base_url}/_0552_StudentAttendanceRecordII.java[Java] //|{doc_base_url}/0552-student-attendance-record-ii.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/optimal-division/[553. Optimal Division^] //|{source_base_url}/_0553_OptimalDivision.java[Java] //|{doc_base_url}/0553-optimal-division.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/brick-wall/[554. Brick Wall^] //|{source_base_url}/_0554_BrickWall.java[Java] //|{doc_base_url}/0554-brick-wall.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/split-concatenated-strings/[555. Split Concatenated Strings^] //|{source_base_url}/_0555_SplitConcatenatedStrings.java[Java] //|{doc_base_url}/0555-split-concatenated-strings.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/next-greater-element-iii/[556. Next Greater Element III^] //|{source_base_url}/_0556_NextGreaterElementIII.java[Java] //|{doc_base_url}/0556-next-greater-element-iii.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/reverse-words-in-a-string-iii/[557. Reverse Words in a String III^] //|{source_base_url}/_0557_ReverseWordsInAStringIII.java[Java] //|{doc_base_url}/0557-reverse-words-in-a-string-iii.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/quad-tree-intersection/[558. Quad Tree Intersection^] //|{source_base_url}/_0558_QuadTreeIntersection.java[Java] //|{doc_base_url}/0558-quad-tree-intersection.adoc[题解] //|Easy //|

|{counter:codes} |{leetcode_base_url}/maximum-depth-of-n-ary-tree/[559. Maximum Depth of N-ary Tree^] |{source_base_url}/_0559_MaximumDepthOfNAryTree.java[Java] |{doc_base_url}/0559-maximum-depth-of-n-ary-tree.adoc[题解] |Easy |

|{counter:codes} |{leetcode_base_url}/subarray-sum-equals-k/[560. Subarray Sum Equals K^] |{source_base_url}/_0560_SubarraySumEqualsK.java[Java] |{doc_base_url}/0560-subarray-sum-equals-k.adoc[题解] |Medium |前缀和

//|{counter:codes} //|{leetcode_base_url}/array-partition-i/[561. Array Partition I^] //|{source_base_url}/_0561_ArrayPartitionI.java[Java] //|{doc_base_url}/0561-array-partition-i.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/longest-line-of-consecutive-one-in-matrix/[562. Longest Line of Consecutive One in Matrix^] //|{source_base_url}/_0562_LongestLineOfConsecutiveOneInMatrix.java[Java] //|{doc_base_url}/0562-longest-line-of-consecutive-one-in-matrix.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/binary-tree-tilt/[563. Binary Tree Tilt^] //|{source_base_url}/_0563_BinaryTreeTilt.java[Java] //|{doc_base_url}/0563-binary-tree-tilt.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/find-the-closest-palindrome/[564. Find the Closest Palindrome^] //|{source_base_url}/_0564_FindTheClosestPalindrome.java[Java] //|{doc_base_url}/0564-find-the-closest-palindrome.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/array-nesting/[565. Array Nesting^] //|{source_base_url}/_0565_ArrayNesting.java[Java] //|{doc_base_url}/0565-array-nesting.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/reshape-the-matrix/[566. Reshape the Matrix^] //|{source_base_url}/_0566_ReshapeTheMatrix.java[Java] //|{doc_base_url}/0566-reshape-the-matrix.adoc[题解] //|Easy //|

|{counter:codes} |{leetcode_base_url}/permutation-in-string/[567. Permutation in String^] |{source_base_url}/_0567_PermutationInString.java[Java] |{doc_base_url}/0567-permutation-in-string.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/maximum-vacation-days/[568. Maximum Vacation Days^] //|{source_base_url}/_0568_MaximumVacationDays.java[Java] //|{doc_base_url}/0568-maximum-vacation-days.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/median-employee-salary/[569. Median Employee Salary^] //|{source_base_url}/_0569_MedianEmployeeSalary.java[Java] //|{doc_base_url}/0569-median-employee-salary.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/managers-with-at-least-5-direct-reports/[570. Managers with at Least 5 Direct Reports^] //|{source_base_url}/_0570_ManagersWithAtLeast5DirectReports.java[Java] //|{doc_base_url}/0570-managers-with-at-least-5-direct-reports.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/find-median-given-frequency-of-numbers/[571. Find Median Given Frequency of Numbers^] //|{source_base_url}/_0571_FindMedianGivenFrequencyOfNumbers.java[Java] //|{doc_base_url}/0571-find-median-given-frequency-of-numbers.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/subtree-of-another-tree/[572. Subtree of Another Tree^] //|{source_base_url}/_0572_SubtreeOfAnotherTree.java[Java] //|{doc_base_url}/0572-subtree-of-another-tree.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/squirrel-simulation/[573. Squirrel Simulation^] //|{source_base_url}/_0573_SquirrelSimulation.java[Java] //|{doc_base_url}/0573-squirrel-simulation.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/winning-candidate/[574. Winning Candidate^] //|{source_base_url}/_0574_WinningCandidate.java[Java] //|{doc_base_url}/0574-winning-candidate.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/distribute-candies/[575. Distribute Candies^] //|{source_base_url}/_0575_DistributeCandies.java[Java] //|{doc_base_url}/0575-distribute-candies.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/out-of-boundary-paths/[576. Out of Boundary Paths^] //|{source_base_url}/_0576_OutOfBoundaryPaths.java[Java] //|{doc_base_url}/0576-out-of-boundary-paths.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/employee-bonus/[577. Employee Bonus^] //|{source_base_url}/_0577_EmployeeBonus.java[Java] //|{doc_base_url}/0577-employee-bonus.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/get-highest-answer-rate-question/[578. Get Highest Answer Rate Question^] //|{source_base_url}/_0578_GetHighestAnswerRateQuestion.java[Java] //|{doc_base_url}/0578-get-highest-answer-rate-question.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/find-cumulative-salary-of-an-employee/[579. Find Cumulative Salary of an Employee^] //|{source_base_url}/_0579_FindCumulativeSalaryOfAnEmployee.java[Java] //|{doc_base_url}/0579-find-cumulative-salary-of-an-employee.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/count-student-number-in-departments/[580. Count Student Number in Departments^] //|{source_base_url}/_0580_CountStudentNumberInDepartments.java[Java] //|{doc_base_url}/0580-count-student-number-in-departments.adoc[题解] //|Medium //|

|{counter:codes} |{leetcode_base_url}/shortest-unsorted-continuous-subarray/[581. Shortest Unsorted Continuous Subarray^] |{source_base_url}/_0581_ShortestUnsortedContinuousSubarray.java[Java] |{doc_base_url}/0581-shortest-unsorted-continuous-subarray.adoc[题解] |Easy |

//|{counter:codes} //|{leetcode_base_url}/kill-process/[582. Kill Process^] //|{source_base_url}/_0582_KillProcess.java[Java] //|{doc_base_url}/0582-kill-process.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/delete-operation-for-two-strings/[583. Delete Operation for Two Strings^] //|{source_base_url}/_0583_DeleteOperationForTwoStrings.java[Java] //|{doc_base_url}/0583-delete-operation-for-two-strings.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/find-customer-referee/[584. Find Customer Referee^] //|{source_base_url}/_0584_FindCustomerReferee.java[Java] //|{doc_base_url}/0584-find-customer-referee.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/investments-in-2016/[585. Investments in 2016^] //|{source_base_url}/_0585_InvestmentsIn2016.java[Java] //|{doc_base_url}/0585-investments-in-2016.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/customer-placing-the-largest-number-of-orders/[586. Customer Placing the Largest Number of Orders^] //|{source_base_url}/_0586_CustomerPlacingTheLargestNumberOfOrders.java[Java] //|{doc_base_url}/0586-customer-placing-the-largest-number-of-orders.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/erect-the-fence/[587. Erect the Fence^] //|{source_base_url}/_0587_ErectTheFence.java[Java] //|{doc_base_url}/0587-erect-the-fence.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/design-in-memory-file-system/[588. Design In-Memory File System^] //|{source_base_url}/_0588_DesignInMemoryFileSystem.java[Java] //|{doc_base_url}/0588-design-in-memory-file-system.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/n-ary-tree-preorder-traversal/[589. N-ary Tree Preorder Traversal^] //|{source_base_url}/_0589_NAryTreePreorderTraversal.java[Java] //|{doc_base_url}/0589-n-ary-tree-preorder-traversal.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/n-ary-tree-postorder-traversal/[590. N-ary Tree Postorder Traversal^] //|{source_base_url}/_0590_NAryTreePostorderTraversal.java[Java] //|{doc_base_url}/0590-n-ary-tree-postorder-traversal.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/tag-validator/[591. Tag Validator^] //|{source_base_url}/_0591_TagValidator.java[Java] //|{doc_base_url}/0591-tag-validator.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/fraction-addition-and-subtraction/[592. Fraction Addition and Subtraction^] //|{source_base_url}/_0592_FractionAdditionAndSubtraction.java[Java] //|{doc_base_url}/0592-fraction-addition-and-subtraction.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/valid-square/[593. Valid Square^] //|{source_base_url}/_0593_ValidSquare.java[Java] //|{doc_base_url}/0593-valid-square.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/longest-harmonious-subsequence/[594. Longest Harmonious Subsequence^] //|{source_base_url}/_0594_LongestHarmoniousSubsequence.java[Java] //|{doc_base_url}/0594-longest-harmonious-subsequence.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/big-countries/[595. Big Countries^] //|{source_base_url}/_0595_BigCountries.java[Java] //|{doc_base_url}/0595-big-countries.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/classes-more-than-5-students/[596. Classes More Than 5 Students^] //|{source_base_url}/_0596_ClassesMoreThan5Students.java[Java] //|{doc_base_url}/0596-classes-more-than-5-students.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/friend-requests-i-overall-acceptance-rate/[597. Friend Requests I: Overall Acceptance Rate^] //|{source_base_url}/_0597_FriendRequestsIOverallAcceptanceRate.java[Java] //|{doc_base_url}/0597-friend-requests-i-overall-acceptance-rate.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/range-addition-ii/[598. Range Addition II^] //|{source_base_url}/_0598_RangeAdditionII.java[Java] //|{doc_base_url}/0598-range-addition-ii.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/minimum-index-sum-of-two-lists/[599. Minimum Index Sum of Two Lists^] //|{source_base_url}/_0599_MinimumIndexSumOfTwoLists.java[Java] //|{doc_base_url}/0599-minimum-index-sum-of-two-lists.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/non-negative-integers-without-consecutive-ones/[600. Non-negative Integers without Consecutive Ones^] //|{source_base_url}/_0600_NonNegativeIntegersWithoutConsecutiveOnes.java[Java] //|{doc_base_url}/0600-non-negative-integers-without-consecutive-ones.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/human-traffic-of-stadium/[601. Human Traffic of Stadium^] //|{source_base_url}/_0601_HumanTrafficOfStadium.java[Java] //|{doc_base_url}/0601-human-traffic-of-stadium.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/friend-requests-ii-who-has-the-most-friends/[602. Friend Requests II: Who Has the Most Friends^] //|{source_base_url}/_0602_FriendRequestsIIWhoHasTheMostFriends.java[Java] //|{doc_base_url}/0602-friend-requests-ii-who-has-the-most-friends.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/consecutive-available-seats/[603. Consecutive Available Seats^] //|{source_base_url}/_0603_ConsecutiveAvailableSeats.java[Java] //|{doc_base_url}/0603-consecutive-available-seats.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/design-compressed-string-iterator/[604. Design Compressed String Iterator^] //|{source_base_url}/_0604_DesignCompressedStringIterator.java[Java] //|{doc_base_url}/0604-design-compressed-string-iterator.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/can-place-flowers/[605. Can Place Flowers^] //|{source_base_url}/_0605_CanPlaceFlowers.java[Java] //|{doc_base_url}/0605-can-place-flowers.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/construct-string-from-binary-tree/[606. Construct String from Binary Tree^] //|{source_base_url}/_0606_ConstructStringFromBinaryTree.java[Java] //|{doc_base_url}/0606-construct-string-from-binary-tree.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/sales-person/[607. Sales Person^] //|{source_base_url}/_0607_SalesPerson.java[Java] //|{doc_base_url}/0607-sales-person.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/tree-node/[608. Tree Node^] //|{source_base_url}/_0608_TreeNode.java[Java] //|{doc_base_url}/0608-tree-node.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/find-duplicate-file-in-system/[609. Find Duplicate File in System^] //|{source_base_url}/_0609_FindDuplicateFileInSystem.java[Java] //|{doc_base_url}/0609-find-duplicate-file-in-system.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/triangle-judgement/[610. Triangle Judgement^] //|{source_base_url}/_0610_TriangleJudgement.java[Java] //|{doc_base_url}/0610-triangle-judgement.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/valid-triangle-number/[611. Valid Triangle Number^] //|{source_base_url}/_0611_ValidTriangleNumber.java[Java] //|{doc_base_url}/0611-valid-triangle-number.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/shortest-distance-in-a-plane/[612. Shortest Distance in a Plane^] //|{source_base_url}/_0612_ShortestDistanceInAPlane.java[Java] //|{doc_base_url}/0612-shortest-distance-in-a-plane.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/shortest-distance-in-a-line/[613. Shortest Distance in a Line^] //|{source_base_url}/_0613_ShortestDistanceInALine.java[Java] //|{doc_base_url}/0613-shortest-distance-in-a-line.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/second-degree-follower/[614. Second Degree Follower^] //|{source_base_url}/_0614_SecondDegreeFollower.java[Java] //|{doc_base_url}/0614-second-degree-follower.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/average-salary-departments-vs-company/[615. Average Salary: Departments VS Company^] //|{source_base_url}/_0615_AverageSalaryDepartmentsVSCompany.java[Java] //|{doc_base_url}/0615-average-salary-departments-vs-company.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/add-bold-tag-in-string/[616. Add Bold Tag in String^] //|{source_base_url}/_0616_AddBoldTagInString.java[Java] //|{doc_base_url}/0616-add-bold-tag-in-string.adoc[题解] //|Medium //|

|{counter:codes} |{leetcode_base_url}/merge-two-binary-trees/[617. Merge Two Binary Trees^] |{source_base_url}/_0617_MergeTwoBinaryTrees.java[Java] |{doc_base_url}/0617-merge-two-binary-trees.adoc[题解] |Easy |

//|{counter:codes} //|{leetcode_base_url}/students-report-by-geography/[618. Students Report By Geography^] //|{source_base_url}/_0618_StudentsReportByGeography.java[Java] //|{doc_base_url}/0618-students-report-by-geography.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/biggest-single-number/[619. Biggest Single Number^] //|{source_base_url}/_0619_BiggestSingleNumber.java[Java] //|{doc_base_url}/0619-biggest-single-number.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/not-boring-movies/[620. Not Boring Movies^] //|{source_base_url}/_0620_NotBoringMovies.java[Java] //|{doc_base_url}/0620-not-boring-movies.adoc[题解] //|Easy //|

|{counter:codes} |{leetcode_base_url}/task-scheduler/[621. Task Scheduler^] |{source_base_url}/_0621_TaskScheduler.java[Java] |{doc_base_url}/0621-task-scheduler.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/design-circular-queue/[622. Design Circular Queue^] //|{source_base_url}/_0622_DesignCircularQueue.java[Java] //|{doc_base_url}/0622-design-circular-queue.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/add-one-row-to-tree/[623. Add One Row to Tree^] //|{source_base_url}/_0623_AddOneRowToTree.java[Java] //|{doc_base_url}/0623-add-one-row-to-tree.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/maximum-distance-in-arrays/[624. Maximum Distance in Arrays^] //|{source_base_url}/_0624_MaximumDistanceInArrays.java[Java] //|{doc_base_url}/0624-maximum-distance-in-arrays.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/minimum-factorization/[625. Minimum Factorization^] //|{source_base_url}/_0625_MinimumFactorization.java[Java] //|{doc_base_url}/0625-minimum-factorization.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/exchange-seats/[626. Exchange Seats^] //|{source_base_url}/_0626_ExchangeSeats.java[Java] //|{doc_base_url}/0626-exchange-seats.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/swap-salary/[627. Swap Salary^] //|{source_base_url}/_0627_SwapSalary.java[Java] //|{doc_base_url}/0627-swap-salary.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/maximum-product-of-three-numbers/[628. Maximum Product of Three Numbers^] //|{source_base_url}/_0628_MaximumProductOfThreeNumbers.java[Java] //|{doc_base_url}/0628-maximum-product-of-three-numbers.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/k-inverse-pairs-array/[629. K Inverse Pairs Array^] //|{source_base_url}/_0629_KInversePairsArray.java[Java] //|{doc_base_url}/0629-k-inverse-pairs-array.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/course-schedule-iii/[630. Course Schedule III^] //|{source_base_url}/_0630_CourseScheduleIII.java[Java] //|{doc_base_url}/0630-course-schedule-iii.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/design-excel-sum-formula/[631. Design Excel Sum Formula^] //|{source_base_url}/_0631_DesignExcelSumFormula.java[Java] //|{doc_base_url}/0631-design-excel-sum-formula.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/smallest-range-covering-elements-from-k-lists/[632. Smallest Range Covering Elements from K Lists^] //|{source_base_url}/_0632_SmallestRangeCoveringElementsFromKLists.java[Java] //|{doc_base_url}/0632-smallest-range-covering-elements-from-k-lists.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/sum-of-square-numbers/[633. Sum of Square Numbers^] //|{source_base_url}/_0633_SumOfSquareNumbers.java[Java] //|{doc_base_url}/0633-sum-of-square-numbers.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/find-the-derangement-of-an-array/[634. Find the Derangement of An Array^] //|{source_base_url}/_0634_FindTheDerangementOfAnArray.java[Java] //|{doc_base_url}/0634-find-the-derangement-of-an-array.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/design-log-storage-system/[635. Design Log Storage System^] //|{source_base_url}/_0635_DesignLogStorageSystem.java[Java] //|{doc_base_url}/0635-design-log-storage-system.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/exclusive-time-of-functions/[636. Exclusive Time of Functions^] //|{source_base_url}/_0636_ExclusiveTimeOfFunctions.java[Java] //|{doc_base_url}/0636-exclusive-time-of-functions.adoc[题解] //|Medium //|

|{counter:codes} |{leetcode_base_url}/average-of-levels-in-binary-tree/[637. Average of Levels in Binary Tree^] |{source_base_url}/_0637_AverageOfLevelsInBinaryTree.java[Java] |{doc_base_url}/0637-average-of-levels-in-binary-tree.adoc[题解] |Easy |

//|{counter:codes} //|{leetcode_base_url}/shopping-offers/[638. Shopping Offers^] //|{source_base_url}/_0638_ShoppingOffers.java[Java] //|{doc_base_url}/0638-shopping-offers.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/decode-ways-ii/[639. Decode Ways II^] //|{source_base_url}/_0639_DecodeWaysII.java[Java] //|{doc_base_url}/0639-decode-ways-ii.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/solve-the-equation/[640. Solve the Equation^] //|{source_base_url}/_0640_SolveTheEquation.java[Java] //|{doc_base_url}/0640-solve-the-equation.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/design-circular-deque/[641. Design Circular Deque^] //|{source_base_url}/_0641_DesignCircularDeque.java[Java] //|{doc_base_url}/0641-design-circular-deque.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/design-search-autocomplete-system/[642. Design Search Autocomplete System^] //|{source_base_url}/_0642_DesignSearchAutocompleteSystem.java[Java] //|{doc_base_url}/0642-design-search-autocomplete-system.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/maximum-average-subarray-i/[643. Maximum Average Subarray I^] //|{source_base_url}/_0643_MaximumAverageSubarrayI.java[Java] //|{doc_base_url}/0643-maximum-average-subarray-i.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/maximum-average-subarray-ii/[644. Maximum Average Subarray II^] //|{source_base_url}/_0644_MaximumAverageSubarrayII.java[Java] //|{doc_base_url}/0644-maximum-average-subarray-ii.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/set-mismatch/[645. Set Mismatch^] //|{source_base_url}/_0645_SetMismatch.java[Java] //|{doc_base_url}/0645-set-mismatch.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/maximum-length-of-pair-chain/[646. Maximum Length of Pair Chain^] //|{source_base_url}/_0646_MaximumLengthOfPairChain.java[Java] //|{doc_base_url}/0646-maximum-length-of-pair-chain.adoc[题解] //|Medium //|

|{counter:codes} |{leetcode_base_url}/palindromic-substrings/[647. Palindromic Substrings^] |{source_base_url}/_0647_PalindromicSubstrings.java[Java] |{doc_base_url}/0647-palindromic-substrings.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/replace-words/[648. Replace Words^] //|{source_base_url}/_0648_ReplaceWords.java[Java] //|{doc_base_url}/0648-replace-words.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/dota2-senate/[649. Dota2 Senate^] //|{source_base_url}/_0649_Dota2Senate.java[Java] //|{doc_base_url}/0649-dota2-senate.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/2-keys-keyboard/[650. 2 Keys Keyboard^] //|{source_base_url}/_0650_2KeysKeyboard.java[Java] //|{doc_base_url}/0650-2-keys-keyboard.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/4-keys-keyboard/[651. 4 Keys Keyboard^] //|{source_base_url}/_0651_4KeysKeyboard.java[Java] //|{doc_base_url}/0651-4-keys-keyboard.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/find-duplicate-subtrees/[652. Find Duplicate Subtrees^] //|{source_base_url}/_0652_FindDuplicateSubtrees.java[Java] //|{doc_base_url}/0652-find-duplicate-subtrees.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/two-sum-iv-input-is-a-bst/[653. Two Sum IV - Input is a BST^] //|{source_base_url}/_0653_TwoSumIVInputIsABST.java[Java] //|{doc_base_url}/0653-two-sum-iv-input-is-a-bst.adoc[题解] //|Easy //|

|{counter:codes} |{leetcode_base_url}/maximum-binary-tree/[654. Maximum Binary Tree^] |{source_base_url}/_0654_MaximumBinaryTree.java[Java] |{doc_base_url}/0654-maximum-binary-tree.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/print-binary-tree/[655. Print Binary Tree^] //|{source_base_url}/_0655_PrintBinaryTree.java[Java] //|{doc_base_url}/0655-print-binary-tree.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/coin-path/[656. Coin Path^] //|{source_base_url}/_0656_CoinPath.java[Java] //|{doc_base_url}/0656-coin-path.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/robot-return-to-origin/[657. Robot Return to Origin^] //|{source_base_url}/_0657_RobotReturnToOrigin.java[Java] //|{doc_base_url}/0657-robot-return-to-origin.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/find-k-closest-elements/[658. Find K Closest Elements^] //|{source_base_url}/_0658_FindKClosestElements.java[Java] //|{doc_base_url}/0658-find-k-closest-elements.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/split-array-into-consecutive-subsequences/[659. Split Array into Consecutive Subsequences^] //|{source_base_url}/_0659_SplitArrayIntoConsecutiveSubsequences.java[Java] //|{doc_base_url}/0659-split-array-into-consecutive-subsequences.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/remove-9/[660. Remove 9^] //|{source_base_url}/_0660_Remove9.java[Java] //|{doc_base_url}/0660-remove-9.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/image-smoother/[661. Image Smoother^] //|{source_base_url}/_0661_ImageSmoother.java[Java] //|{doc_base_url}/0661-image-smoother.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/maximum-width-of-binary-tree/[662. Maximum Width of Binary Tree^] //|{source_base_url}/_0662_MaximumWidthOfBinaryTree.java[Java] //|{doc_base_url}/0662-maximum-width-of-binary-tree.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/equal-tree-partition/[663. Equal Tree Partition^] //|{source_base_url}/_0663_EqualTreePartition.java[Java] //|{doc_base_url}/0663-equal-tree-partition.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/strange-printer/[664. Strange Printer^] //|{source_base_url}/_0664_StrangePrinter.java[Java] //|{doc_base_url}/0664-strange-printer.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/non-decreasing-array/[665. Non-decreasing Array^] //|{source_base_url}/_0665_NonDecreasingArray.java[Java] //|{doc_base_url}/0665-non-decreasing-array.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/path-sum-iv/[666. Path Sum IV^] //|{source_base_url}/_0666_PathSumIV.java[Java] //|{doc_base_url}/0666-path-sum-iv.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/beautiful-arrangement-ii/[667. Beautiful Arrangement II^] //|{source_base_url}/_0667_BeautifulArrangementII.java[Java] //|{doc_base_url}/0667-beautiful-arrangement-ii.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/kth-smallest-number-in-multiplication-table/[668. Kth Smallest Number in Multiplication Table^] //|{source_base_url}/_0668_KthSmallestNumberInMultiplicationTable.java[Java] //|{doc_base_url}/0668-kth-smallest-number-in-multiplication-table.adoc[题解] //|Hard //|

|{counter:codes} |{leetcode_base_url}/trim-a-binary-search-tree/[669. Trim a Binary Search Tree^] |{source_base_url}/_0669_TrimABinarySearchTree.java[Java] |{doc_base_url}/0669-trim-a-binary-search-tree.adoc[题解] |Easy |

//|{counter:codes} //|{leetcode_base_url}/maximum-swap/[670. Maximum Swap^] //|{source_base_url}/_0670_MaximumSwap.java[Java] //|{doc_base_url}/0670-maximum-swap.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/second-minimum-node-in-a-binary-tree/[671. Second Minimum Node In a Binary Tree^] //|{source_base_url}/_0671_SecondMinimumNodeInABinaryTree.java[Java] //|{doc_base_url}/0671-second-minimum-node-in-a-binary-tree.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/bulb-switcher-ii/[672. Bulb Switcher II^] //|{source_base_url}/_0672_BulbSwitcherII.java[Java] //|{doc_base_url}/0672-bulb-switcher-ii.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/number-of-longest-increasing-subsequence/[673. Number of Longest Increasing Subsequence^] //|{source_base_url}/_0673_NumberOfLongestIncreasingSubsequence.java[Java] //|{doc_base_url}/0673-number-of-longest-increasing-subsequence.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/longest-continuous-increasing-subsequence/[674. Longest Continuous Increasing Subsequence^] //|{source_base_url}/_0674_LongestContinuousIncreasingSubsequence.java[Java] //|{doc_base_url}/0674-longest-continuous-increasing-subsequence.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/cut-off-trees-for-golf-event/[675. Cut Off Trees for Golf Event^] //|{source_base_url}/_0675_CutOffTreesForGolfEvent.java[Java] //|{doc_base_url}/0675-cut-off-trees-for-golf-event.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/implement-magic-dictionary/[676. Implement Magic Dictionary^] //|{source_base_url}/_0676_ImplementMagicDictionary.java[Java] //|{doc_base_url}/0676-implement-magic-dictionary.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/map-sum-pairs/[677. Map Sum Pairs^] //|{source_base_url}/_0677_MapSumPairs.java[Java] //|{doc_base_url}/0677-map-sum-pairs.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/valid-parenthesis-string/[678. Valid Parenthesis String^] //|{source_base_url}/_0678_ValidParenthesisString.java[Java] //|{doc_base_url}/0678-valid-parenthesis-string.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/24-game/[679. 24 Game^] //|{source_base_url}/_0679_24Game.java[Java] //|{doc_base_url}/0679-24-game.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/valid-palindrome-ii/[680. Valid Palindrome II^] //|{source_base_url}/_0680_ValidPalindromeII.java[Java] //|{doc_base_url}/0680-valid-palindrome-ii.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/next-closest-time/[681. Next Closest Time^] //|{source_base_url}/_0681_NextClosestTime.java[Java] //|{doc_base_url}/0681-next-closest-time.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/baseball-game/[682. Baseball Game^] //|{source_base_url}/_0682_BaseballGame.java[Java] //|{doc_base_url}/0682-baseball-game.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/k-empty-slots/[683. K Empty Slots^] //|{source_base_url}/_0683_KEmptySlots.java[Java] //|{doc_base_url}/0683-k-empty-slots.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/redundant-connection/[684. Redundant Connection^] //|{source_base_url}/_0684_RedundantConnection.java[Java] //|{doc_base_url}/0684-redundant-connection.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/redundant-connection-ii/[685. Redundant Connection II^] //|{source_base_url}/_0685_RedundantConnectionII.java[Java] //|{doc_base_url}/0685-redundant-connection-ii.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/repeated-string-match/[686. Repeated String Match^] //|{source_base_url}/_0686_RepeatedStringMatch.java[Java] //|{doc_base_url}/0686-repeated-string-match.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/longest-univalue-path/[687. Longest Univalue Path^] //|{source_base_url}/_0687_LongestUnivaluePath.java[Java] //|{doc_base_url}/0687-longest-univalue-path.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/knight-probability-in-chessboard/[688. Knight Probability in Chessboard^] //|{source_base_url}/_0688_KnightProbabilityInChessboard.java[Java] //|{doc_base_url}/0688-knight-probability-in-chessboard.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/maximum-sum-of-3-non-overlapping-subarrays/[689. Maximum Sum of 3 Non-Overlapping Subarrays^] //|{source_base_url}/_0689_MaximumSumOf3NonOverlappingSubarrays.java[Java] //|{doc_base_url}/0689-maximum-sum-of-3-non-overlapping-subarrays.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/employee-importance/[690. Employee Importance^] //|{source_base_url}/_0690_EmployeeImportance.java[Java] //|{doc_base_url}/0690-employee-importance.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/stickers-to-spell-word/[691. Stickers to Spell Word^] //|{source_base_url}/_0691_StickersToSpellWord.java[Java] //|{doc_base_url}/0691-stickers-to-spell-word.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/top-k-frequent-words/[692. Top K Frequent Words^] //|{source_base_url}/_0692_TopKFrequentWords.java[Java] //|{doc_base_url}/0692-top-k-frequent-words.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/binary-number-with-alternating-bits/[693. Binary Number with Alternating Bits^] //|{source_base_url}/_0693_BinaryNumberWithAlternatingBits.java[Java] //|{doc_base_url}/0693-binary-number-with-alternating-bits.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/number-of-distinct-islands/[694. Number of Distinct Islands^] //|{source_base_url}/_0694_NumberOfDistinctIslands.java[Java] //|{doc_base_url}/0694-number-of-distinct-islands.adoc[题解] //|Medium //|

|{counter:codes} |{leetcode_base_url}/max-area-of-island/[695. Max Area of Island^] |{source_base_url}/_0695_MaxAreaOfIsland.java[Java] |{doc_base_url}/0695-max-area-of-island.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/count-binary-substrings/[696. Count Binary Substrings^] //|{source_base_url}/_0696_CountBinarySubstrings.java[Java] //|{doc_base_url}/0696-count-binary-substrings.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/degree-of-an-array/[697. Degree of an Array^] //|{source_base_url}/_0697_DegreeOfAnArray.java[Java] //|{doc_base_url}/0697-degree-of-an-array.adoc[题解] //|Easy //|

|{counter:codes} |{leetcode_base_url}/partition-to-k-equal-sum-subsets/[698. Partition to K Equal Sum Subsets^] |{source_base_url}/_0698_PartitionToKEqualSumSubsets.java[Java] |{doc_base_url}/0698-partition-to-k-equal-sum-subsets.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/falling-squares/[699. Falling Squares^] //|{source_base_url}/_0699_FallingSquares.java[Java] //|{doc_base_url}/0699-falling-squares.adoc[题解] //|Hard //|

|{counter:codes} |{leetcode_base_url}/search-in-a-binary-search-tree/[700. Search in a Binary Search Tree^] |{source_base_url}/_0700_SearchInABinarySearchTree.java[Java] |{doc_base_url}/0700-search-in-a-binary-search-tree.adoc[题解] |Easy |

|{counter:codes} |{leetcode_base_url}/insert-into-a-binary-search-tree/[701. Insert into a Binary Search Tree^] |{source_base_url}/_0701_InsertIntoABinarySearchTree.java[Java] |{doc_base_url}/0701-insert-into-a-binary-search-tree.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/search-in-a-sorted-array-of-unknown-size/[702. Search in a Sorted Array of Unknown Size^] //|{source_base_url}/_0702_SearchInASortedArrayOfUnknownSize.java[Java] //|{doc_base_url}/0702-search-in-a-sorted-array-of-unknown-size.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/kth-largest-element-in-a-stream/[703. Kth Largest Element in a Stream^] //|{source_base_url}/_0703_KthLargestElementInAStream.java[Java] //|{doc_base_url}/0703-kth-largest-element-in-a-stream.adoc[题解] //|Easy //|

|{counter:codes} |{leetcode_base_url}/binary-search/[704. Binary Search^] |{source_base_url}/_0704_BinarySearch.java[Java] |{doc_base_url}/0704-binary-search.adoc[题解] |Easy |

//|{counter:codes} //|{leetcode_base_url}/design-hashset/[705. Design HashSet^] //|{source_base_url}/_0705_DesignHashSet.java[Java] //|{doc_base_url}/0705-design-hashset.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/design-hashmap/[706. Design HashMap^] //|{source_base_url}/_0706_DesignHashMap.java[Java] //|{doc_base_url}/0706-design-hashmap.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/design-linked-list/[707. Design Linked List^] //|{source_base_url}/_0707_DesignLinkedList.java[Java] //|{doc_base_url}/0707-design-linked-list.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/insert-into-a-sorted-circular-linked-list/[708. Insert into a Sorted Circular Linked List^] //|{source_base_url}/_0708_InsertIntoASortedCircularLinkedList.java[Java] //|{doc_base_url}/0708-insert-into-a-sorted-circular-linked-list.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/to-lower-case/[709. To Lower Case^] //|{source_base_url}/_0709_ToLowerCase.java[Java] //|{doc_base_url}/0709-to-lower-case.adoc[题解] //|Easy //|

|{counter:codes} |{leetcode_base_url}/random-pick-with-blacklist/[710. Random Pick with Blacklist^] |{source_base_url}/_0710_RandomPickWithBlacklist.java[Java] |{doc_base_url}/0710-random-pick-with-blacklist.adoc[题解] |Hard |

//|{counter:codes} //|{leetcode_base_url}/number-of-distinct-islands-ii/[711. Number of Distinct Islands II^] //|{source_base_url}/_0711_NumberOfDistinctIslandsII.java[Java] //|{doc_base_url}/0711-number-of-distinct-islands-ii.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/minimum-ascii-delete-sum-for-two-strings/[712. Minimum ASCII Delete Sum for Two Strings^] //|{source_base_url}/_0712_MinimumASCIIDeleteSumForTwoStrings.java[Java] //|{doc_base_url}/0712-minimum-ascii-delete-sum-for-two-strings.adoc[题解] //|Medium //|

|{counter:codes} |{leetcode_base_url}/subarray-product-less-than-k/[713. Subarray Product Less Than K^] |{source_base_url}/_0713_SubarrayProductLessThanK.java[Java] |{doc_base_url}/0713-subarray-product-less-than-k.adoc[题解] |Medium |滑动窗口

|{counter:codes} |{leetcode_base_url}/best-time-to-buy-and-sell-stock-with-transaction-fee/[714. Best Time to Buy and Sell Stock with Transaction Fee^] |{source_base_url}/_0714_BestTimeToBuyAndSellStockWithTransactionFee.java[Java] |{doc_base_url}/0714-best-time-to-buy-and-sell-stock-with-transaction-fee.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/range-module/[715. Range Module^] //|{source_base_url}/_0715_RangeModule.java[Java] //|{doc_base_url}/0715-range-module.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/max-stack/[716. Max Stack^] //|{source_base_url}/_0716_MaxStack.java[Java] //|{doc_base_url}/0716-max-stack.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/1-bit-and-2-bit-characters/[717. 1-bit and 2-bit Characters^] //|{source_base_url}/_0717_1BitAnd2BitCharacters.java[Java] //|{doc_base_url}/0717-1-bit-and-2-bit-characters.adoc[题解] //|Easy //|

|{counter:codes} |{leetcode_base_url}/maximum-length-of-repeated-subarray/[718. Maximum Length of Repeated Subarray^] |{source_base_url}/_0718_MaximumLengthOfRepeatedSubarray.java[Java] |{doc_base_url}/0718-maximum-length-of-repeated-subarray.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/find-k-th-smallest-pair-distance/[719. Find K-th Smallest Pair Distance^] //|{source_base_url}/_0719_FindKThSmallestPairDistance.java[Java] //|{doc_base_url}/0719-find-k-th-smallest-pair-distance.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/longest-word-in-dictionary/[720. Longest Word in Dictionary^] //|{source_base_url}/_0720_LongestWordInDictionary.java[Java] //|{doc_base_url}/0720-longest-word-in-dictionary.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/accounts-merge/[721. Accounts Merge^] //|{source_base_url}/_0721_AccountsMerge.java[Java] //|{doc_base_url}/0721-accounts-merge.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/remove-comments/[722. Remove Comments^] //|{source_base_url}/_0722_RemoveComments.java[Java] //|{doc_base_url}/0722-remove-comments.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/candy-crush/[723. Candy Crush^] //|{source_base_url}/_0723_CandyCrush.java[Java] //|{doc_base_url}/0723-candy-crush.adoc[题解] //|Medium //|

|{counter:codes} |{leetcode_base_url}/find-pivot-index/[724. Find Pivot Index^] |{source_base_url}/_0724_FindPivotIndex.java[Java] |{doc_base_url}/0724-find-pivot-index.adoc[题解] |Easy |

//|{counter:codes} //|{leetcode_base_url}/split-linked-list-in-parts/[725. Split Linked List in Parts^] //|{source_base_url}/_0725_SplitLinkedListInParts.java[Java] //|{doc_base_url}/0725-split-linked-list-in-parts.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/number-of-atoms/[726. Number of Atoms^] //|{source_base_url}/_0726_NumberOfAtoms.java[Java] //|{doc_base_url}/0726-number-of-atoms.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/minimum-window-subsequence/[727. Minimum Window Subsequence^] //|{source_base_url}/_0727_MinimumWindowSubsequence.java[Java] //|{doc_base_url}/0727-minimum-window-subsequence.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/self-dividing-numbers/[728. Self Dividing Numbers^] //|{source_base_url}/_0728_SelfDividingNumbers.java[Java] //|{doc_base_url}/0728-self-dividing-numbers.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/my-calendar-i/[729. My Calendar I^] //|{source_base_url}/_0729_MyCalendarI.java[Java] //|{doc_base_url}/0729-my-calendar-i.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/count-different-palindromic-subsequences/[730. Count Different Palindromic Subsequences^] //|{source_base_url}/_0730_CountDifferentPalindromicSubsequences.java[Java] //|{doc_base_url}/0730-count-different-palindromic-subsequences.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/my-calendar-ii/[731. My Calendar II^] //|{source_base_url}/_0731_MyCalendarII.java[Java] //|{doc_base_url}/0731-my-calendar-ii.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/my-calendar-iii/[732. My Calendar III^] //|{source_base_url}/_0732_MyCalendarIII.java[Java] //|{doc_base_url}/0732-my-calendar-iii.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/flood-fill/[733. Flood Fill^] //|{source_base_url}/_0733_FloodFill.java[Java] //|{doc_base_url}/0733-flood-fill.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/sentence-similarity/[734. Sentence Similarity^] //|{source_base_url}/_0734_SentenceSimilarity.java[Java] //|{doc_base_url}/0734-sentence-similarity.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/asteroid-collision/[735. Asteroid Collision^] //|{source_base_url}/_0735_AsteroidCollision.java[Java] //|{doc_base_url}/0735-asteroid-collision.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/parse-lisp-expression/[736. Parse Lisp Expression^] //|{source_base_url}/_0736_ParseLispExpression.java[Java] //|{doc_base_url}/0736-parse-lisp-expression.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/sentence-similarity-ii/[737. Sentence Similarity II^] //|{source_base_url}/_0737_SentenceSimilarityII.java[Java] //|{doc_base_url}/0737-sentence-similarity-ii.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/monotone-increasing-digits/[738. Monotone Increasing Digits^] //|{source_base_url}/_0738_MonotoneIncreasingDigits.java[Java] //|{doc_base_url}/0738-monotone-increasing-digits.adoc[题解] //|Medium //|

|{counter:codes} |{leetcode_base_url}/daily-temperatures/[739. Daily Temperatures^] |{source_base_url}/_0739_DailyTemperatures.java[Java] |{doc_base_url}/0739-daily-temperatures.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/delete-and-earn/[740. Delete and Earn^] //|{source_base_url}/_0740_DeleteAndEarn.java[Java] //|{doc_base_url}/0740-delete-and-earn.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/cherry-pickup/[741. Cherry Pickup^] //|{source_base_url}/_0741_CherryPickup.java[Java] //|{doc_base_url}/0741-cherry-pickup.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/closest-leaf-in-a-binary-tree/[742. Closest Leaf in a Binary Tree^] //|{source_base_url}/_0742_ClosestLeafInABinaryTree.java[Java] //|{doc_base_url}/0742-closest-leaf-in-a-binary-tree.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/network-delay-time/[743. Network Delay Time^] //|{source_base_url}/_0743_NetworkDelayTime.java[Java] //|{doc_base_url}/0743-network-delay-time.adoc[题解] //|Medium //|

|{counter:codes} |{leetcode_base_url}/find-smallest-letter-greater-than-target/[744. Find Smallest Letter Greater Than Target^] |{source_base_url}/_0744_FindSmallestLetterGreaterThanTarget.java[Java] |{doc_base_url}/0744-find-smallest-letter-greater-than-target.adoc[题解] |Easy |

//|{counter:codes} //|{leetcode_base_url}/prefix-and-suffix-search/[745. Prefix and Suffix Search^] //|{source_base_url}/_0745_PrefixAndSuffixSearch.java[Java] //|{doc_base_url}/0745-prefix-and-suffix-search.adoc[题解] //|Hard //|

|{counter:codes} |{leetcode_base_url}/min-cost-climbing-stairs/[746. Min Cost Climbing Stairs^] |{source_base_url}/_0746_MinCostClimbingStairs.java[Java] |{doc_base_url}/0746-min-cost-climbing-stairs.adoc[题解] |Easy |

//|{counter:codes} //|{leetcode_base_url}/largest-number-at-least-twice-of-others/[747. Largest Number At Least Twice of Others^] //|{source_base_url}/_0747_LargestNumberAtLeastTwiceOfOthers.java[Java] //|{doc_base_url}/0747-largest-number-at-least-twice-of-others.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/shortest-completing-word/[748. Shortest Completing Word^] //|{source_base_url}/_0748_ShortestCompletingWord.java[Java] //|{doc_base_url}/0748-shortest-completing-word.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/contain-virus/[749. Contain Virus^] //|{source_base_url}/_0749_ContainVirus.java[Java] //|{doc_base_url}/0749-contain-virus.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/number-of-corner-rectangles/[750. Number Of Corner Rectangles^] //|{source_base_url}/_0750_NumberOfCornerRectangles.java[Java] //|{doc_base_url}/0750-number-of-corner-rectangles.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/ip-to-cidr/[751. IP to CIDR^] //|{source_base_url}/_0751_IPToCIDR.java[Java] //|{doc_base_url}/0751-ip-to-cidr.adoc[题解] //|Easy //|

|{counter:codes} |{leetcode_base_url}/open-the-lock/[752. Open the Lock^] |{source_base_url}/_0752_OpenTheLock.java[Java] |{doc_base_url}/0752-open-the-lock.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/cracking-the-safe/[753. Cracking the Safe^] //|{source_base_url}/_0753_CrackingTheSafe.java[Java] //|{doc_base_url}/0753-cracking-the-safe.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/reach-a-number/[754. Reach a Number^] //|{source_base_url}/_0754_ReachANumber.java[Java] //|{doc_base_url}/0754-reach-a-number.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/pour-water/[755. Pour Water^] //|{source_base_url}/_0755_PourWater.java[Java] //|{doc_base_url}/0755-pour-water.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/pyramid-transition-matrix/[756. Pyramid Transition Matrix^] //|{source_base_url}/_0756_PyramidTransitionMatrix.java[Java] //|{doc_base_url}/0756-pyramid-transition-matrix.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/set-intersection-size-at-least-two/[757. Set Intersection Size At Least Two^] //|{source_base_url}/_0757_SetIntersectionSizeAtLeastTwo.java[Java] //|{doc_base_url}/0757-set-intersection-size-at-least-two.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/bold-words-in-string/[758. Bold Words in String^] //|{source_base_url}/_0758_BoldWordsInString.java[Java] //|{doc_base_url}/0758-bold-words-in-string.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/employee-free-time/[759. Employee Free Time^] //|{source_base_url}/_0759_EmployeeFreeTime.java[Java] //|{doc_base_url}/0759-employee-free-time.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/find-anagram-mappings/[760. Find Anagram Mappings^] //|{source_base_url}/_0760_FindAnagramMappings.java[Java] //|{doc_base_url}/0760-find-anagram-mappings.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/special-binary-string/[761. Special Binary String^] //|{source_base_url}/_0761_SpecialBinaryString.java[Java] //|{doc_base_url}/0761-special-binary-string.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/prime-number-of-set-bits-in-binary-representation/[762. Prime Number of Set Bits in Binary Representation^] //|{source_base_url}/_0762_PrimeNumberOfSetBitsInBinaryRepresentation.java[Java] //|{doc_base_url}/0762-prime-number-of-set-bits-in-binary-representation.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/partition-labels/[763. Partition Labels^] //|{source_base_url}/_0763_PartitionLabels.java[Java] //|{doc_base_url}/0763-partition-labels.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/largest-plus-sign/[764. Largest Plus Sign^] //|{source_base_url}/_0764_LargestPlusSign.java[Java] //|{doc_base_url}/0764-largest-plus-sign.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/couples-holding-hands/[765. Couples Holding Hands^] //|{source_base_url}/_0765_CouplesHoldingHands.java[Java] //|{doc_base_url}/0765-couples-holding-hands.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/toeplitz-matrix/[766. Toeplitz Matrix^] //|{source_base_url}/_0766_ToeplitzMatrix.java[Java] //|{doc_base_url}/0766-toeplitz-matrix.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/reorganize-string/[767. Reorganize String^] //|{source_base_url}/_0767_ReorganizeString.java[Java] //|{doc_base_url}/0767-reorganize-string.adoc[题解] //|Medium //|

|{counter:codes} |{leetcode_base_url}/max-chunks-to-make-sorted-ii/[768. Max Chunks To Make Sorted II^] |{source_base_url}/_0768_MaxChunksToMakeSortedII.java[Java] |{doc_base_url}/0768-max-chunks-to-make-sorted-ii.adoc[题解] |Hard |

//|{counter:codes} //|{leetcode_base_url}/max-chunks-to-make-sorted/[769. Max Chunks To Make Sorted^] //|{source_base_url}/_0769_MaxChunksToMakeSorted.java[Java] //|{doc_base_url}/0769-max-chunks-to-make-sorted.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/basic-calculator-iv/[770. Basic Calculator IV^] //|{source_base_url}/_0770_BasicCalculatorIV.java[Java] //|{doc_base_url}/0770-basic-calculator-iv.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/jewels-and-stones/[771. Jewels and Stones^] //|{source_base_url}/_0771_JewelsAndStones.java[Java] //|{doc_base_url}/0771-jewels-and-stones.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/basic-calculator-iii/[772. Basic Calculator III^] //|{source_base_url}/_0772_BasicCalculatorIII.java[Java] //|{doc_base_url}/0772-basic-calculator-iii.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/sliding-puzzle/[773. Sliding Puzzle^] //|{source_base_url}/_0773_SlidingPuzzle.java[Java] //|{doc_base_url}/0773-sliding-puzzle.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/minimize-max-distance-to-gas-station/[774. Minimize Max Distance to Gas Station^] //|{source_base_url}/_0774_MinimizeMaxDistanceToGasStation.java[Java] //|{doc_base_url}/0774-minimize-max-distance-to-gas-station.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/global-and-local-inversions/[775. Global and Local Inversions^] //|{source_base_url}/_0775_GlobalAndLocalInversions.java[Java] //|{doc_base_url}/0775-global-and-local-inversions.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/split-bst/[776. Split BST^] //|{source_base_url}/_0776_SplitBST.java[Java] //|{doc_base_url}/0776-split-bst.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/swap-adjacent-in-lr-string/[777. Swap Adjacent in LR String^] //|{source_base_url}/_0777_SwapAdjacentInLRString.java[Java] //|{doc_base_url}/0777-swap-adjacent-in-lr-string.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/swim-in-rising-water/[778. Swim in Rising Water^] //|{source_base_url}/_0778_SwimInRisingWater.java[Java] //|{doc_base_url}/0778-swim-in-rising-water.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/k-th-symbol-in-grammar/[779. K-th Symbol in Grammar^] //|{source_base_url}/_0779_KThSymbolInGrammar.java[Java] //|{doc_base_url}/0779-k-th-symbol-in-grammar.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/reaching-points/[780. Reaching Points^] //|{source_base_url}/_0780_ReachingPoints.java[Java] //|{doc_base_url}/0780-reaching-points.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/rabbits-in-forest/[781. Rabbits in Forest^] //|{source_base_url}/_0781_RabbitsInForest.java[Java] //|{doc_base_url}/0781-rabbits-in-forest.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/transform-to-chessboard/[782. Transform to Chessboard^] //|{source_base_url}/_0782_TransformToChessboard.java[Java] //|{doc_base_url}/0782-transform-to-chessboard.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/minimum-distance-between-bst-nodes/[783. Minimum Distance Between BST Nodes^] //|{source_base_url}/_0783_MinimumDistanceBetweenBSTNodes.java[Java] //|{doc_base_url}/0783-minimum-distance-between-bst-nodes.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/letter-case-permutation/[784. Letter Case Permutation^] //|{source_base_url}/_0784_LetterCasePermutation.java[Java] //|{doc_base_url}/0784-letter-case-permutation.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/is-graph-bipartite/[785. Is Graph Bipartite?^] //|{source_base_url}/_0785_IsGraphBipartite.java[Java] //|{doc_base_url}/0785-is-graph-bipartite.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/k-th-smallest-prime-fraction/[786. K-th Smallest Prime Fraction^] //|{source_base_url}/_0786_KThSmallestPrimeFraction.java[Java] //|{doc_base_url}/0786-k-th-smallest-prime-fraction.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/cheapest-flights-within-k-stops/[787. Cheapest Flights Within K Stops^] //|{source_base_url}/_0787_CheapestFlightsWithinKStops.java[Java] //|{doc_base_url}/0787-cheapest-flights-within-k-stops.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/rotated-digits/[788. Rotated Digits^] //|{source_base_url}/_0788_RotatedDigits.java[Java] //|{doc_base_url}/0788-rotated-digits.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/escape-the-ghosts/[789. Escape The Ghosts^] //|{source_base_url}/_0789_EscapeTheGhosts.java[Java] //|{doc_base_url}/0789-escape-the-ghosts.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/domino-and-tromino-tiling/[790. Domino and Tromino Tiling^] //|{source_base_url}/_0790_DominoAndTrominoTiling.java[Java] //|{doc_base_url}/0790-domino-and-tromino-tiling.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/custom-sort-string/[791. Custom Sort String^] //|{source_base_url}/_0791_CustomSortString.java[Java] //|{doc_base_url}/0791-custom-sort-string.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/number-of-matching-subsequences/[792. Number of Matching Subsequences^] //|{source_base_url}/_0792_NumberOfMatchingSubsequences.java[Java] //|{doc_base_url}/0792-number-of-matching-subsequences.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/preimage-size-of-factorial-zeroes-function/[793. Preimage Size of Factorial Zeroes Function^] //|{source_base_url}/_0793_PreimageSizeOfFactorialZeroesFunction.java[Java] //|{doc_base_url}/0793-preimage-size-of-factorial-zeroes-function.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/valid-tic-tac-toe-state/[794. Valid Tic-Tac-Toe State^] //|{source_base_url}/_0794_ValidTicTacToeState.java[Java] //|{doc_base_url}/0794-valid-tic-tac-toe-state.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/number-of-subarrays-with-bounded-maximum/[795. Number of Subarrays with Bounded Maximum^] //|{source_base_url}/_0795_NumberOfSubarraysWithBoundedMaximum.java[Java] //|{doc_base_url}/0795-number-of-subarrays-with-bounded-maximum.adoc[题解] //|Medium //|

|{counter:codes} |{leetcode_base_url}/rotate-string/[796. Rotate String^] |{source_base_url}/_0796_RotateString.java[Java] |{doc_base_url}/0796-rotate-string.adoc[题解] |Easy |

//|{counter:codes} //|{leetcode_base_url}/all-paths-from-source-to-target/[797. All Paths From Source to Target^] //|{source_base_url}/_0797_AllPathsFromSourceToTarget.java[Java] //|{doc_base_url}/0797-all-paths-from-source-to-target.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/smallest-rotation-with-highest-score/[798. Smallest Rotation with Highest Score^] //|{source_base_url}/_0798_SmallestRotationWithHighestScore.java[Java] //|{doc_base_url}/0798-smallest-rotation-with-highest-score.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/champagne-tower/[799. Champagne Tower^] //|{source_base_url}/_0799_ChampagneTower.java[Java] //|{doc_base_url}/0799-champagne-tower.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/similar-rgb-color/[800. Similar RGB Color^] //|{source_base_url}/_0800_SimilarRGBColor.java[Java] //|{doc_base_url}/0800-similar-rgb-color.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/minimum-swaps-to-make-sequences-increasing/[801. Minimum Swaps To Make Sequences Increasing^] //|{source_base_url}/_0801_MinimumSwapsToMakeSequencesIncreasing.java[Java] //|{doc_base_url}/0801-minimum-swaps-to-make-sequences-increasing.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/find-eventual-safe-states/[802. Find Eventual Safe States^] //|{source_base_url}/_0802_FindEventualSafeStates.java[Java] //|{doc_base_url}/0802-find-eventual-safe-states.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/bricks-falling-when-hit/[803. Bricks Falling When Hit^] //|{source_base_url}/_0803_BricksFallingWhenHit.java[Java] //|{doc_base_url}/0803-bricks-falling-when-hit.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/unique-morse-code-words/[804. Unique Morse Code Words^] //|{source_base_url}/_0804_UniqueMorseCodeWords.java[Java] //|{doc_base_url}/0804-unique-morse-code-words.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/split-array-with-same-average/[805. Split Array With Same Average^] //|{source_base_url}/_0805_SplitArrayWithSameAverage.java[Java] //|{doc_base_url}/0805-split-array-with-same-average.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/number-of-lines-to-write-string/[806. Number of Lines To Write String^] //|{source_base_url}/_0806_NumberOfLinesToWriteString.java[Java] //|{doc_base_url}/0806-number-of-lines-to-write-string.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/max-increase-to-keep-city-skyline/[807. Max Increase to Keep City Skyline^] //|{source_base_url}/_0807_MaxIncreaseToKeepCitySkyline.java[Java] //|{doc_base_url}/0807-max-increase-to-keep-city-skyline.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/soup-servings/[808. Soup Servings^] //|{source_base_url}/_0808_SoupServings.java[Java] //|{doc_base_url}/0808-soup-servings.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/expressive-words/[809. Expressive Words^] //|{source_base_url}/_0809_ExpressiveWords.java[Java] //|{doc_base_url}/0809-expressive-words.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/chalkboard-xor-game/[810. Chalkboard XOR Game^] //|{source_base_url}/_0810_ChalkboardXORGame.java[Java] //|{doc_base_url}/0810-chalkboard-xor-game.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/subdomain-visit-count/[811. Subdomain Visit Count^] //|{source_base_url}/_0811_SubdomainVisitCount.java[Java] //|{doc_base_url}/0811-subdomain-visit-count.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/largest-triangle-area/[812. Largest Triangle Area^] //|{source_base_url}/_0812_LargestTriangleArea.java[Java] //|{doc_base_url}/0812-largest-triangle-area.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/largest-sum-of-averages/[813. Largest Sum of Averages^] //|{source_base_url}/_0813_LargestSumOfAverages.java[Java] //|{doc_base_url}/0813-largest-sum-of-averages.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/binary-tree-pruning/[814. Binary Tree Pruning^] //|{source_base_url}/_0814_BinaryTreePruning.java[Java] //|{doc_base_url}/0814-binary-tree-pruning.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/bus-routes/[815. Bus Routes^] //|{source_base_url}/_0815_BusRoutes.java[Java] //|{doc_base_url}/0815-bus-routes.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/ambiguous-coordinates/[816. Ambiguous Coordinates^] //|{source_base_url}/_0816_AmbiguousCoordinates.java[Java] //|{doc_base_url}/0816-ambiguous-coordinates.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/linked-list-components/[817. Linked List Components^] //|{source_base_url}/_0817_LinkedListComponents.java[Java] //|{doc_base_url}/0817-linked-list-components.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/race-car/[818. Race Car^] //|{source_base_url}/_0818_RaceCar.java[Java] //|{doc_base_url}/0818-race-car.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/most-common-word/[819. Most Common Word^] //|{source_base_url}/_0819_MostCommonWord.java[Java] //|{doc_base_url}/0819-most-common-word.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/short-encoding-of-words/[820. Short Encoding of Words^] //|{source_base_url}/_0820_ShortEncodingOfWords.java[Java] //|{doc_base_url}/0820-short-encoding-of-words.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/shortest-distance-to-a-character/[821. Shortest Distance to a Character^] //|{source_base_url}/_0821_ShortestDistanceToACharacter.java[Java] //|{doc_base_url}/0821-shortest-distance-to-a-character.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/card-flipping-game/[822. Card Flipping Game^] //|{source_base_url}/_0822_CardFlippingGame.java[Java] //|{doc_base_url}/0822-card-flipping-game.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/binary-trees-with-factors/[823. Binary Trees With Factors^] //|{source_base_url}/_0823_BinaryTreesWithFactors.java[Java] //|{doc_base_url}/0823-binary-trees-with-factors.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/goat-latin/[824. Goat Latin^] //|{source_base_url}/_0824_GoatLatin.java[Java] //|{doc_base_url}/0824-goat-latin.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/friends-of-appropriate-ages/[825. Friends Of Appropriate Ages^] //|{source_base_url}/_0825_FriendsOfAppropriateAges.java[Java] //|{doc_base_url}/0825-friends-of-appropriate-ages.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/most-profit-assigning-work/[826. Most Profit Assigning Work^] //|{source_base_url}/_0826_MostProfitAssigningWork.java[Java] //|{doc_base_url}/0826-most-profit-assigning-work.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/making-a-large-island/[827. Making A Large Island^] //|{source_base_url}/_0827_MakingALargeIsland.java[Java] //|{doc_base_url}/0827-making-a-large-island.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/unique-letter-string/[828. Unique Letter String^] //|{source_base_url}/_0828_UniqueLetterString.java[Java] //|{doc_base_url}/0828-unique-letter-string.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/consecutive-numbers-sum/[829. Consecutive Numbers Sum^] //|{source_base_url}/_0829_ConsecutiveNumbersSum.java[Java] //|{doc_base_url}/0829-consecutive-numbers-sum.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/positions-of-large-groups/[830. Positions of Large Groups^] //|{source_base_url}/_0830_PositionsOfLargeGroups.java[Java] //|{doc_base_url}/0830-positions-of-large-groups.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/masking-personal-information/[831. Masking Personal Information^] //|{source_base_url}/_0831_MaskingPersonalInformation.java[Java] //|{doc_base_url}/0831-masking-personal-information.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/flipping-an-image/[832. Flipping an Image^] //|{source_base_url}/_0832_FlippingAnImage.java[Java] //|{doc_base_url}/0832-flipping-an-image.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/find-and-replace-in-string/[833. Find And Replace in String^] //|{source_base_url}/_0833_FindAndReplaceInString.java[Java] //|{doc_base_url}/0833-find-and-replace-in-string.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/sum-of-distances-in-tree/[834. Sum of Distances in Tree^] //|{source_base_url}/_0834_SumOfDistancesInTree.java[Java] //|{doc_base_url}/0834-sum-of-distances-in-tree.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/image-overlap/[835. Image Overlap^] //|{source_base_url}/_0835_ImageOverlap.java[Java] //|{doc_base_url}/0835-image-overlap.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/rectangle-overlap/[836. Rectangle Overlap^] //|{source_base_url}/_0836_RectangleOverlap.java[Java] //|{doc_base_url}/0836-rectangle-overlap.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/new-21-game/[837. New 21 Game^] //|{source_base_url}/_0837_New21Game.java[Java] //|{doc_base_url}/0837-new-21-game.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/push-dominoes/[838. Push Dominoes^] //|{source_base_url}/_0838_PushDominoes.java[Java] //|{doc_base_url}/0838-push-dominoes.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/similar-string-groups/[839. Similar String Groups^] //|{source_base_url}/_0839_SimilarStringGroups.java[Java] //|{doc_base_url}/0839-similar-string-groups.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/magic-squares-in-grid/[840. Magic Squares In Grid^] //|{source_base_url}/_0840_MagicSquaresInGrid.java[Java] //|{doc_base_url}/0840-magic-squares-in-grid.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/keys-and-rooms/[841. Keys and Rooms^] //|{source_base_url}/_0841_KeysAndRooms.java[Java] //|{doc_base_url}/0841-keys-and-rooms.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/split-array-into-fibonacci-sequence/[842. Split Array into Fibonacci Sequence^] //|{source_base_url}/_0842_SplitArrayIntoFibonacciSequence.java[Java] //|{doc_base_url}/0842-split-array-into-fibonacci-sequence.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/guess-the-word/[843. Guess the Word^] //|{source_base_url}/_0843_GuessTheWord.java[Java] //|{doc_base_url}/0843-guess-the-word.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/backspace-string-compare/[844. Backspace String Compare^] //|{source_base_url}/_0844_BackspaceStringCompare.java[Java] //|{doc_base_url}/0844-backspace-string-compare.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/longest-mountain-in-array/[845. Longest Mountain in Array^] //|{source_base_url}/_0845_LongestMountainInArray.java[Java] //|{doc_base_url}/0845-longest-mountain-in-array.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/hand-of-straights/[846. Hand of Straights^] //|{source_base_url}/_0846_HandOfStraights.java[Java] //|{doc_base_url}/0846-hand-of-straights.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/shortest-path-visiting-all-nodes/[847. Shortest Path Visiting All Nodes^] //|{source_base_url}/_0847_ShortestPathVisitingAllNodes.java[Java] //|{doc_base_url}/0847-shortest-path-visiting-all-nodes.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/shifting-letters/[848. Shifting Letters^] //|{source_base_url}/_0848_ShiftingLetters.java[Java] //|{doc_base_url}/0848-shifting-letters.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/maximize-distance-to-closest-person/[849. Maximize Distance to Closest Person^] //|{source_base_url}/_0849_MaximizeDistanceToClosestPerson.java[Java] //|{doc_base_url}/0849-maximize-distance-to-closest-person.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/rectangle-area-ii/[850. Rectangle Area II^] //|{source_base_url}/_0850_RectangleAreaII.java[Java] //|{doc_base_url}/0850-rectangle-area-ii.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/loud-and-rich/[851. Loud and Rich^] //|{source_base_url}/_0851_LoudAndRich.java[Java] //|{doc_base_url}/0851-loud-and-rich.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/peak-index-in-a-mountain-array/[852. Peak Index in a Mountain Array^] //|{source_base_url}/_0852_PeakIndexInAMountainArray.java[Java] //|{doc_base_url}/0852-peak-index-in-a-mountain-array.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/car-fleet/[853. Car Fleet^] //|{source_base_url}/_0853_CarFleet.java[Java] //|{doc_base_url}/0853-car-fleet.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/k-similar-strings/[854. K-Similar Strings^] //|{source_base_url}/_0854_KSimilarStrings.java[Java] //|{doc_base_url}/0854-k-similar-strings.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/exam-room/[855. Exam Room^] //|{source_base_url}/_0855_ExamRoom.java[Java] //|{doc_base_url}/0855-exam-room.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/score-of-parentheses/[856. Score of Parentheses^] //|{source_base_url}/_0856_ScoreOfParentheses.java[Java] //|{doc_base_url}/0856-score-of-parentheses.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/minimum-cost-to-hire-k-workers/[857. Minimum Cost to Hire K Workers^] //|{source_base_url}/_0857_MinimumCostToHireKWorkers.java[Java] //|{doc_base_url}/0857-minimum-cost-to-hire-k-workers.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/mirror-reflection/[858. Mirror Reflection^] //|{source_base_url}/_0858_MirrorReflection.java[Java] //|{doc_base_url}/0858-mirror-reflection.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/buddy-strings/[859. Buddy Strings^] //|{source_base_url}/_0859_BuddyStrings.java[Java] //|{doc_base_url}/0859-buddy-strings.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/lemonade-change/[860. Lemonade Change^] //|{source_base_url}/_0860_LemonadeChange.java[Java] //|{doc_base_url}/0860-lemonade-change.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/score-after-flipping-matrix/[861. Score After Flipping Matrix^] //|{source_base_url}/_0861_ScoreAfterFlippingMatrix.java[Java] //|{doc_base_url}/0861-score-after-flipping-matrix.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/shortest-subarray-with-sum-at-least-k/[862. Shortest Subarray with Sum at Least K^] //|{source_base_url}/_0862_ShortestSubarrayWithSumAtLeastK.java[Java] //|{doc_base_url}/0862-shortest-subarray-with-sum-at-least-k.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/all-nodes-distance-k-in-binary-tree/[863. All Nodes Distance K in Binary Tree^] //|{source_base_url}/_0863_AllNodesDistanceKInBinaryTree.java[Java] //|{doc_base_url}/0863-all-nodes-distance-k-in-binary-tree.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/shortest-path-to-get-all-keys/[864. Shortest Path to Get All Keys^] //|{source_base_url}/_0864_ShortestPathToGetAllKeys.java[Java] //|{doc_base_url}/0864-shortest-path-to-get-all-keys.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/smallest-subtree-with-all-the-deepest-nodes/[865. Smallest Subtree with all the Deepest Nodes^] //|{source_base_url}/_0865_SmallestSubtreeWithAllTheDeepestNodes.java[Java] //|{doc_base_url}/0865-smallest-subtree-with-all-the-deepest-nodes.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/prime-palindrome/[866. Prime Palindrome^] //|{source_base_url}/_0866_PrimePalindrome.java[Java] //|{doc_base_url}/0866-prime-palindrome.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/transpose-matrix/[867. Transpose Matrix^] //|{source_base_url}/_0867_TransposeMatrix.java[Java] //|{doc_base_url}/0867-transpose-matrix.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/binary-gap/[868. Binary Gap^] //|{source_base_url}/_0868_BinaryGap.java[Java] //|{doc_base_url}/0868-binary-gap.adoc[题解] //|Easy //|

|{counter:codes} |{leetcode_base_url}/reordered-power-of-2/[869. Reordered Power of 2^] |{source_base_url}/_0869_ReorderedPowerOf2.java[Java] |{doc_base_url}/0869-reordered-power-of-2.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/advantage-shuffle/[870. Advantage Shuffle^] |{source_base_url}/_0870_AdvantageShuffle.java[Java] |{doc_base_url}/0870-advantage-shuffle.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/minimum-number-of-refueling-stops/[871. Minimum Number of Refueling Stops^] //|{source_base_url}/_0871_MinimumNumberOfRefuelingStops.java[Java] //|{doc_base_url}/0871-minimum-number-of-refueling-stops.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/leaf-similar-trees/[872. Leaf-Similar Trees^] //|{source_base_url}/_0872_LeafSimilarTrees.java[Java] //|{doc_base_url}/0872-leaf-similar-trees.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/length-of-longest-fibonacci-subsequence/[873. Length of Longest Fibonacci Subsequence^] //|{source_base_url}/_0873_LengthOfLongestFibonacciSubsequence.java[Java] //|{doc_base_url}/0873-length-of-longest-fibonacci-subsequence.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/walking-robot-simulation/[874. Walking Robot Simulation^] //|{source_base_url}/_0874_WalkingRobotSimulation.java[Java] //|{doc_base_url}/0874-walking-robot-simulation.adoc[题解] //|Easy //|

|{counter:codes} |{leetcode_base_url}/koko-eating-bananas/[875. Koko Eating Bananas^] |{source_base_url}/_0875_KokoEatingBananas.java[Java] |{doc_base_url}/0875-koko-eating-bananas.adoc[题解] |Medium |二分查找

|{counter:codes} |{leetcode_base_url}/middle-of-the-linked-list/[876. Middle of the Linked List^] |{source_base_url}/_0876_MiddleOfTheLinkedList.java[Java] |{doc_base_url}/0876-middle-of-the-linked-list.adoc[题解] |Easy |

//|{counter:codes} //|{leetcode_base_url}/stone-game/[877. Stone Game^] //|{source_base_url}/_0877_StoneGame.java[Java] //|{doc_base_url}/0877-stone-game.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/nth-magical-number/[878. Nth Magical Number^] //|{source_base_url}/_0878_NthMagicalNumber.java[Java] //|{doc_base_url}/0878-nth-magical-number.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/profitable-schemes/[879. Profitable Schemes^] //|{source_base_url}/_0879_ProfitableSchemes.java[Java] //|{doc_base_url}/0879-profitable-schemes.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/decoded-string-at-index/[880. Decoded String at Index^] //|{source_base_url}/_0880_DecodedStringAtIndex.java[Java] //|{doc_base_url}/0880-decoded-string-at-index.adoc[题解] //|Medium //|

|{counter:codes} |{leetcode_base_url}/boats-to-save-people/[881. Boats to Save People^] |{source_base_url}/_0881_BoatsToSavePeople.java[Java] |{doc_base_url}/0881-boats-to-save-people.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/reachable-nodes-in-subdivided-graph/[882. Reachable Nodes In Subdivided Graph^] //|{source_base_url}/_0882_ReachableNodesInSubdividedGraph.java[Java] //|{doc_base_url}/0882-reachable-nodes-in-subdivided-graph.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/projection-area-of-3d-shapes/[883. Projection Area of 3D Shapes^] //|{source_base_url}/_0883_ProjectionAreaOf3DShapes.java[Java] //|{doc_base_url}/0883-projection-area-of-3d-shapes.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/uncommon-words-from-two-sentences/[884. Uncommon Words from Two Sentences^] //|{source_base_url}/_0884_UncommonWordsFromTwoSentences.java[Java] //|{doc_base_url}/0884-uncommon-words-from-two-sentences.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/spiral-matrix-iii/[885. Spiral Matrix III^] //|{source_base_url}/_0885_SpiralMatrixIII.java[Java] //|{doc_base_url}/0885-spiral-matrix-iii.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/possible-bipartition/[886. Possible Bipartition^] //|{source_base_url}/_0886_PossibleBipartition.java[Java] //|{doc_base_url}/0886-possible-bipartition.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/super-egg-drop/[887. Super Egg Drop^] //|{source_base_url}/_0887_SuperEggDrop.java[Java] //|{doc_base_url}/0887-super-egg-drop.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/fair-candy-swap/[888. Fair Candy Swap^] //|{source_base_url}/_0888_FairCandySwap.java[Java] //|{doc_base_url}/0888-fair-candy-swap.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/construct-binary-tree-from-preorder-and-postorder-traversal/[889. Construct Binary Tree from Preorder and Postorder Traversal^] //|{source_base_url}/_0889_ConstructBinaryTreeFromPreorderAndPostorderTraversal.java[Java] //|{doc_base_url}/0889-construct-binary-tree-from-preorder-and-postorder-traversal.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/find-and-replace-pattern/[890. Find and Replace Pattern^] //|{source_base_url}/_0890_FindAndReplacePattern.java[Java] //|{doc_base_url}/0890-find-and-replace-pattern.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/sum-of-subsequence-widths/[891. Sum of Subsequence Widths^] //|{source_base_url}/_0891_SumOfSubsequenceWidths.java[Java] //|{doc_base_url}/0891-sum-of-subsequence-widths.adoc[题解] //|Hard //|

|{counter:codes} |{leetcode_base_url}/surface-area-of-3d-shapes/[892. Surface Area of 3D Shapes^] |{source_base_url}/_0892_SurfaceAreaOf3DShapes.java[Java] |{doc_base_url}/0892-surface-area-of-3d-shapes.adoc[题解] |Easy |

//|{counter:codes} //|{leetcode_base_url}/groups-of-special-equivalent-strings/[893. Groups of Special-Equivalent Strings^] //|{source_base_url}/_0893_GroupsOfSpecialEquivalentStrings.java[Java] //|{doc_base_url}/0893-groups-of-special-equivalent-strings.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/all-possible-full-binary-trees/[894. All Possible Full Binary Trees^] //|{source_base_url}/_0894_AllPossibleFullBinaryTrees.java[Java] //|{doc_base_url}/0894-all-possible-full-binary-trees.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/maximum-frequency-stack/[895. Maximum Frequency Stack^] //|{source_base_url}/_0895_MaximumFrequencyStack.java[Java] //|{doc_base_url}/0895-maximum-frequency-stack.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/monotonic-array/[896. Monotonic Array^] //|{source_base_url}/_0896_MonotonicArray.java[Java] //|{doc_base_url}/0896-monotonic-array.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/increasing-order-search-tree/[897. Increasing Order Search Tree^] //|{source_base_url}/_0897_IncreasingOrderSearchTree.java[Java] //|{doc_base_url}/0897-increasing-order-search-tree.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/bitwise-ors-of-subarrays/[898. Bitwise ORs of Subarrays^] //|{source_base_url}/_0898_BitwiseORsOfSubarrays.java[Java] //|{doc_base_url}/0898-bitwise-ors-of-subarrays.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/orderly-queue/[899. Orderly Queue^] //|{source_base_url}/_0899_OrderlyQueue.java[Java] //|{doc_base_url}/0899-orderly-queue.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/rle-iterator/[900. RLE Iterator^] //|{source_base_url}/_0900_RLEIterator.java[Java] //|{doc_base_url}/0900-rle-iterator.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/online-stock-span/[901. Online Stock Span^] //|{source_base_url}/_0901_OnlineStockSpan.java[Java] //|{doc_base_url}/0901-online-stock-span.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/numbers-at-most-n-given-digit-set/[902. Numbers At Most N Given Digit Set^] //|{source_base_url}/_0902_NumbersAtMostNGivenDigitSet.java[Java] //|{doc_base_url}/0902-numbers-at-most-n-given-digit-set.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/valid-permutations-for-di-sequence/[903. Valid Permutations for DI Sequence^] //|{source_base_url}/_0903_ValidPermutationsForDISequence.java[Java] //|{doc_base_url}/0903-valid-permutations-for-di-sequence.adoc[题解] //|Hard //|

|{counter:codes} |{leetcode_base_url}/fruit-into-baskets/[904. Fruit Into Baskets^] |{source_base_url}/_0904_FruitIntoBaskets.java[Java] |{doc_base_url}/0904-fruit-into-baskets.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/sort-array-by-parity/[905. Sort Array By Parity^] //|{source_base_url}/_0905_SortArrayByParity.java[Java] //|{doc_base_url}/0905-sort-array-by-parity.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/super-palindromes/[906. Super Palindromes^] //|{source_base_url}/_0906_SuperPalindromes.java[Java] //|{doc_base_url}/0906-super-palindromes.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/sum-of-subarray-minimums/[907. Sum of Subarray Minimums^] //|{source_base_url}/_0907_SumOfSubarrayMinimums.java[Java] //|{doc_base_url}/0907-sum-of-subarray-minimums.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/smallest-range-i/[908. Smallest Range I^] //|{source_base_url}/_0908_SmallestRangeI.java[Java] //|{doc_base_url}/0908-smallest-range-i.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/snakes-and-ladders/[909. Snakes and Ladders^] //|{source_base_url}/_0909_SnakesAndLadders.java[Java] //|{doc_base_url}/0909-snakes-and-ladders.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/smallest-range-ii/[910. Smallest Range II^] //|{source_base_url}/_0910_SmallestRangeII.java[Java] //|{doc_base_url}/0910-smallest-range-ii.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/online-election/[911. Online Election^] //|{source_base_url}/_0911_OnlineElection.java[Java] //|{doc_base_url}/0911-online-election.adoc[题解] //|Medium //|

|{counter:codes} |{leetcode_base_url}/sort-an-array/[912. Sort an Array^] |{source_base_url}/_0912_SortAnArray.java[Java] |{doc_base_url}/0912-sort-an-array.adoc[题解] |Medium |归并，快排

//|{counter:codes} //|{leetcode_base_url}/cat-and-mouse/[913. Cat and Mouse^] //|{source_base_url}/_0913_CatAndMouse.java[Java] //|{doc_base_url}/0913-cat-and-mouse.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/x-of-a-kind-in-a-deck-of-cards/[914. X of a Kind in a Deck of Cards^] //|{source_base_url}/_0914_XOfAKindInADeckOfCards.java[Java] //|{doc_base_url}/0914-x-of-a-kind-in-a-deck-of-cards.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/partition-array-into-disjoint-intervals/[915. Partition Array into Disjoint Intervals^] //|{source_base_url}/_0915_PartitionArrayIntoDisjointIntervals.java[Java] //|{doc_base_url}/0915-partition-array-into-disjoint-intervals.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/word-subsets/[916. Word Subsets^] //|{source_base_url}/_0916_WordSubsets.java[Java] //|{doc_base_url}/0916-word-subsets.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/reverse-only-letters/[917. Reverse Only Letters^] //|{source_base_url}/_0917_ReverseOnlyLetters.java[Java] //|{doc_base_url}/0917-reverse-only-letters.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/maximum-sum-circular-subarray/[918. Maximum Sum Circular Subarray^] //|{source_base_url}/_0918_MaximumSumCircularSubarray.java[Java] //|{doc_base_url}/0918-maximum-sum-circular-subarray.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/complete-binary-tree-inserter/[919. Complete Binary Tree Inserter^] //|{source_base_url}/_0919_CompleteBinaryTreeInserter.java[Java] //|{doc_base_url}/0919-complete-binary-tree-inserter.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/number-of-music-playlists/[920. Number of Music Playlists^] //|{source_base_url}/_0920_NumberOfMusicPlaylists.java[Java] //|{doc_base_url}/0920-number-of-music-playlists.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/minimum-add-to-make-parentheses-valid/[921. Minimum Add to Make Parentheses Valid^] //|{source_base_url}/_0921_MinimumAddToMakeParenthesesValid.java[Java] //|{doc_base_url}/0921-minimum-add-to-make-parentheses-valid.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/sort-array-by-parity-ii/[922. Sort Array By Parity II^] //|{source_base_url}/_0922_SortArrayByParityII.java[Java] //|{doc_base_url}/0922-sort-array-by-parity-ii.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/3sum-with-multiplicity/[923. 3Sum With Multiplicity^] //|{source_base_url}/_0923_3SumWithMultiplicity.java[Java] //|{doc_base_url}/0923-3sum-with-multiplicity.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/minimize-malware-spread/[924. Minimize Malware Spread^] //|{source_base_url}/_0924_MinimizeMalwareSpread.java[Java] //|{doc_base_url}/0924-minimize-malware-spread.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/long-pressed-name/[925. Long Pressed Name^] //|{source_base_url}/_0925_LongPressedName.java[Java] //|{doc_base_url}/0925-long-pressed-name.adoc[题解] //|Easy //|

|{counter:codes} |{leetcode_base_url}/flip-string-to-monotone-increasing/[926. Flip String to Monotone Increasing^] |{source_base_url}/_0926_FlipStringToMonotoneIncreasing.java[Java] |{doc_base_url}/0926-flip-string-to-monotone-increasing.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/three-equal-parts/[927. Three Equal Parts^] //|{source_base_url}/_0927_ThreeEqualParts.java[Java] //|{doc_base_url}/0927-three-equal-parts.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/minimize-malware-spread-ii/[928. Minimize Malware Spread II^] //|{source_base_url}/_0928_MinimizeMalwareSpreadII.java[Java] //|{doc_base_url}/0928-minimize-malware-spread-ii.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/unique-email-addresses/[929. Unique Email Addresses^] //|{source_base_url}/_0929_UniqueEmailAddresses.java[Java] //|{doc_base_url}/0929-unique-email-addresses.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/binary-subarrays-with-sum/[930. Binary Subarrays With Sum^] //|{source_base_url}/_0930_BinarySubarraysWithSum.java[Java] //|{doc_base_url}/0930-binary-subarrays-with-sum.adoc[题解] //|Medium //|

|{counter:codes} |{leetcode_base_url}/minimum-falling-path-sum/[931. Minimum Falling Path Sum^] |{source_base_url}/_0931_MinimumFallingPathSum.java[Java] |{doc_base_url}/0931-minimum-falling-path-sum.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/beautiful-array/[932. Beautiful Array^] //|{source_base_url}/_0932_BeautifulArray.java[Java] //|{doc_base_url}/0932-beautiful-array.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/number-of-recent-calls/[933. Number of Recent Calls^] //|{source_base_url}/_0933_NumberOfRecentCalls.java[Java] //|{doc_base_url}/0933-number-of-recent-calls.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/shortest-bridge/[934. Shortest Bridge^] //|{source_base_url}/_0934_ShortestBridge.java[Java] //|{doc_base_url}/0934-shortest-bridge.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/knight-dialer/[935. Knight Dialer^] //|{source_base_url}/_0935_KnightDialer.java[Java] //|{doc_base_url}/0935-knight-dialer.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/stamping-the-sequence/[936. Stamping The Sequence^] //|{source_base_url}/_0936_StampingTheSequence.java[Java] //|{doc_base_url}/0936-stamping-the-sequence.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/reorder-data-in-log-files/[937. Reorder Data in Log Files^] //|{source_base_url}/_0937_ReorderDataInLogFiles.java[Java] //|{doc_base_url}/0937-reorder-data-in-log-files.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/range-sum-of-bst/[938. Range Sum of BST^] //|{source_base_url}/_0938_RangeSumOfBST.java[Java] //|{doc_base_url}/0938-range-sum-of-bst.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/minimum-area-rectangle/[939. Minimum Area Rectangle^] //|{source_base_url}/_0939_MinimumAreaRectangle.java[Java] //|{doc_base_url}/0939-minimum-area-rectangle.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/distinct-subsequences-ii/[940. Distinct Subsequences II^] //|{source_base_url}/_0940_DistinctSubsequencesII.java[Java] //|{doc_base_url}/0940-distinct-subsequences-ii.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/valid-mountain-array/[941. Valid Mountain Array^] //|{source_base_url}/_0941_ValidMountainArray.java[Java] //|{doc_base_url}/0941-valid-mountain-array.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/di-string-match/[942. DI String Match^] //|{source_base_url}/_0942_DIStringMatch.java[Java] //|{doc_base_url}/0942-di-string-match.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/find-the-shortest-superstring/[943. Find the Shortest Superstring^] //|{source_base_url}/_0943_FindTheShortestSuperstring.java[Java] //|{doc_base_url}/0943-find-the-shortest-superstring.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/delete-columns-to-make-sorted/[944. Delete Columns to Make Sorted^] //|{source_base_url}/_0944_DeleteColumnsToMakeSorted.java[Java] //|{doc_base_url}/0944-delete-columns-to-make-sorted.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/minimum-increment-to-make-array-unique/[945. Minimum Increment to Make Array Unique^] //|{source_base_url}/_0945_MinimumIncrementToMakeArrayUnique.java[Java] //|{doc_base_url}/0945-minimum-increment-to-make-array-unique.adoc[题解] //|Medium //|

|{counter:codes} |{leetcode_base_url}/validate-stack-sequences/[946. Validate Stack Sequences^] |{source_base_url}/_0946_ValidateStackSequences.java[Java] |{doc_base_url}/0946-validate-stack-sequences.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/most-stones-removed-with-same-row-or-column/[947. Most Stones Removed with Same Row or Column^] //|{source_base_url}/_0947_MostStonesRemovedWithSameRowOrColumn.java[Java] //|{doc_base_url}/0947-most-stones-removed-with-same-row-or-column.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/bag-of-tokens/[948. Bag of Tokens^] //|{source_base_url}/_0948_BagOfTokens.java[Java] //|{doc_base_url}/0948-bag-of-tokens.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/largest-time-for-given-digits/[949. Largest Time for Given Digits^] //|{source_base_url}/_0949_LargestTimeForGivenDigits.java[Java] //|{doc_base_url}/0949-largest-time-for-given-digits.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/reveal-cards-in-increasing-order/[950. Reveal Cards In Increasing Order^] //|{source_base_url}/_0950_RevealCardsInIncreasingOrder.java[Java] //|{doc_base_url}/0950-reveal-cards-in-increasing-order.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/flip-equivalent-binary-trees/[951. Flip Equivalent Binary Trees^] //|{source_base_url}/_0951_FlipEquivalentBinaryTrees.java[Java] //|{doc_base_url}/0951-flip-equivalent-binary-trees.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/largest-component-size-by-common-factor/[952. Largest Component Size by Common Factor^] //|{source_base_url}/_0952_LargestComponentSizeByCommonFactor.java[Java] //|{doc_base_url}/0952-largest-component-size-by-common-factor.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/verifying-an-alien-dictionary/[953. Verifying an Alien Dictionary^] //|{source_base_url}/_0953_VerifyingAnAlienDictionary.java[Java] //|{doc_base_url}/0953-verifying-an-alien-dictionary.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/array-of-doubled-pairs/[954. Array of Doubled Pairs^] //|{source_base_url}/_0954_ArrayOfDoubledPairs.java[Java] //|{doc_base_url}/0954-array-of-doubled-pairs.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/delete-columns-to-make-sorted-ii/[955. Delete Columns to Make Sorted II^] //|{source_base_url}/_0955_DeleteColumnsToMakeSortedII.java[Java] //|{doc_base_url}/0955-delete-columns-to-make-sorted-ii.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/tallest-billboard/[956. Tallest Billboard^] //|{source_base_url}/_0956_TallestBillboard.java[Java] //|{doc_base_url}/0956-tallest-billboard.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/prison-cells-after-n-days/[957. Prison Cells After N Days^] //|{source_base_url}/_0957_PrisonCellsAfterNDays.java[Java] //|{doc_base_url}/0957-prison-cells-after-n-days.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/check-completeness-of-a-binary-tree/[958. Check Completeness of a Binary Tree^] //|{source_base_url}/_0958_CheckCompletenessOfABinaryTree.java[Java] //|{doc_base_url}/0958-check-completeness-of-a-binary-tree.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/regions-cut-by-slashes/[959. Regions Cut By Slashes^] //|{source_base_url}/_0959_RegionsCutBySlashes.java[Java] //|{doc_base_url}/0959-regions-cut-by-slashes.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/delete-columns-to-make-sorted-iii/[960. Delete Columns to Make Sorted III^] //|{source_base_url}/_0960_DeleteColumnsToMakeSortedIII.java[Java] //|{doc_base_url}/0960-delete-columns-to-make-sorted-iii.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/n-repeated-element-in-size-2n-array/[961. N-Repeated Element in Size 2N Array^] //|{source_base_url}/_0961_NRepeatedElementInSize2NArray.java[Java] //|{doc_base_url}/0961-n-repeated-element-in-size-2n-array.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/maximum-width-ramp/[962. Maximum Width Ramp^] //|{source_base_url}/_0962_MaximumWidthRamp.java[Java] //|{doc_base_url}/0962-maximum-width-ramp.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/minimum-area-rectangle-ii/[963. Minimum Area Rectangle II^] //|{source_base_url}/_0963_MinimumAreaRectangleII.java[Java] //|{doc_base_url}/0963-minimum-area-rectangle-ii.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/least-operators-to-express-number/[964. Least Operators to Express Number^] //|{source_base_url}/_0964_LeastOperatorsToExpressNumber.java[Java] //|{doc_base_url}/0964-least-operators-to-express-number.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/univalued-binary-tree/[965. Univalued Binary Tree^] //|{source_base_url}/_0965_UnivaluedBinaryTree.java[Java] //|{doc_base_url}/0965-univalued-binary-tree.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/vowel-spellchecker/[966. Vowel Spellchecker^] //|{source_base_url}/_0966_VowelSpellchecker.java[Java] //|{doc_base_url}/0966-vowel-spellchecker.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/numbers-with-same-consecutive-differences/[967. Numbers With Same Consecutive Differences^] //|{source_base_url}/_0967_NumbersWithSameConsecutiveDifferences.java[Java] //|{doc_base_url}/0967-numbers-with-same-consecutive-differences.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/binary-tree-cameras/[968. Binary Tree Cameras^] //|{source_base_url}/_0968_BinaryTreeCameras.java[Java] //|{doc_base_url}/0968-binary-tree-cameras.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/pancake-sorting/[969. Pancake Sorting^] //|{source_base_url}/_0969_PancakeSorting.java[Java] //|{doc_base_url}/0969-pancake-sorting.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/powerful-integers/[970. Powerful Integers^] //|{source_base_url}/_0970_PowerfulIntegers.java[Java] //|{doc_base_url}/0970-powerful-integers.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/flip-binary-tree-to-match-preorder-traversal/[971. Flip Binary Tree To Match Preorder Traversal^] //|{source_base_url}/_0971_FlipBinaryTreeToMatchPreorderTraversal.java[Java] //|{doc_base_url}/0971-flip-binary-tree-to-match-preorder-traversal.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/equal-rational-numbers/[972. Equal Rational Numbers^] //|{source_base_url}/_0972_EqualRationalNumbers.java[Java] //|{doc_base_url}/0972-equal-rational-numbers.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/k-closest-points-to-origin/[973. K Closest Points to Origin^] //|{source_base_url}/_0973_KClosestPointsToOrigin.java[Java] //|{doc_base_url}/0973-k-closest-points-to-origin.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/subarray-sums-divisible-by-k/[974. Subarray Sums Divisible by K^] //|{source_base_url}/_0974_SubarraySumsDivisibleByK.java[Java] //|{doc_base_url}/0974-subarray-sums-divisible-by-k.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/odd-even-jump/[975. Odd Even Jump^] //|{source_base_url}/_0975_OddEvenJump.java[Java] //|{doc_base_url}/0975-odd-even-jump.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/largest-perimeter-triangle/[976. Largest Perimeter Triangle^] //|{source_base_url}/_0976_LargestPerimeterTriangle.java[Java] //|{doc_base_url}/0976-largest-perimeter-triangle.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/squares-of-a-sorted-array/[977. Squares of a Sorted Array^] //|{source_base_url}/_0977_SquaresOfASortedArray.java[Java] //|{doc_base_url}/0977-squares-of-a-sorted-array.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/longest-turbulent-subarray/[978. Longest Turbulent Subarray^] //|{source_base_url}/_0978_LongestTurbulentSubarray.java[Java] //|{doc_base_url}/0978-longest-turbulent-subarray.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/distribute-coins-in-binary-tree/[979. Distribute Coins in Binary Tree^] //|{source_base_url}/_0979_DistributeCoinsInBinaryTree.java[Java] //|{doc_base_url}/0979-distribute-coins-in-binary-tree.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/unique-paths-iii/[980. Unique Paths III^] //|{source_base_url}/_0980_UniquePathsIII.java[Java] //|{doc_base_url}/0980-unique-paths-iii.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/time-based-key-value-store/[981. Time Based Key-Value Store^] //|{source_base_url}/_0981_TimeBasedKeyValueStore.java[Java] //|{doc_base_url}/0981-time-based-key-value-store.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/triples-with-bitwise-and-equal-to-zero/[982. Triples with Bitwise AND Equal To Zero^] //|{source_base_url}/_0982_TriplesWithBitwiseANDEqualToZero.java[Java] //|{doc_base_url}/0982-triples-with-bitwise-and-equal-to-zero.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/minimum-cost-for-tickets/[983. Minimum Cost For Tickets^] //|{source_base_url}/_0983_MinimumCostForTickets.java[Java] //|{doc_base_url}/0983-minimum-cost-for-tickets.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/string-without-aaa-or-bbb/[984. String Without AAA or BBB^] //|{source_base_url}/_0984_StringWithoutAAAOrBBB.java[Java] //|{doc_base_url}/0984-string-without-aaa-or-bbb.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/sum-of-even-numbers-after-queries/[985. Sum of Even Numbers After Queries^] //|{source_base_url}/_0985_SumOfEvenNumbersAfterQueries.java[Java] //|{doc_base_url}/0985-sum-of-even-numbers-after-queries.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/interval-list-intersections/[986. Interval List Intersections^] //|{source_base_url}/_0986_IntervalListIntersections.java[Java] //|{doc_base_url}/0986-interval-list-intersections.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/vertical-order-traversal-of-a-binary-tree/[987. Vertical Order Traversal of a Binary Tree^] //|{source_base_url}/_0987_VerticalOrderTraversalOfABinaryTree.java[Java] //|{doc_base_url}/0987-vertical-order-traversal-of-a-binary-tree.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/smallest-string-starting-from-leaf/[988. Smallest String Starting From Leaf^] //|{source_base_url}/_0988_SmallestStringStartingFromLeaf.java[Java] //|{doc_base_url}/0988-smallest-string-starting-from-leaf.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/add-to-array-form-of-integer/[989. Add to Array-Form of Integer^] //|{source_base_url}/_0989_AddToArrayFormOfInteger.java[Java] //|{doc_base_url}/0989-add-to-array-form-of-integer.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/satisfiability-of-equality-equations/[990. Satisfiability of Equality Equations^] //|{source_base_url}/_0990_SatisfiabilityOfEqualityEquations.java[Java] //|{doc_base_url}/0990-satisfiability-of-equality-equations.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/broken-calculator/[991. Broken Calculator^] //|{source_base_url}/_0991_BrokenCalculator.java[Java] //|{doc_base_url}/0991-broken-calculator.adoc[题解] //|Medium //|

|{counter:codes} |{leetcode_base_url}/subarrays-with-k-different-integers/[992. Subarrays with K Different Integers^] |{source_base_url}/_0992_SubarraysWithKDifferentIntegers.java[Java] |{doc_base_url}/0992-subarrays-with-k-different-integers.adoc[题解] |Hard |

//|{counter:codes} //|{leetcode_base_url}/cousins-in-binary-tree/[993. Cousins in Binary Tree^] //|{source_base_url}/_0993_CousinsInBinaryTree.java[Java] //|{doc_base_url}/0993-cousins-in-binary-tree.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/rotting-oranges/[994. Rotting Oranges^] //|{source_base_url}/_0994_RottingOranges.java[Java] //|{doc_base_url}/0994-rotting-oranges.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/minimum-number-of-k-consecutive-bit-flips/[995. Minimum Number of K Consecutive Bit Flips^] //|{source_base_url}/_0995_MinimumNumberOfKConsecutiveBitFlips.java[Java] //|{doc_base_url}/0995-minimum-number-of-k-consecutive-bit-flips.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/number-of-squareful-arrays/[996. Number of Squareful Arrays^] //|{source_base_url}/_0996_NumberOfSquarefulArrays.java[Java] //|{doc_base_url}/0996-number-of-squareful-arrays.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/find-the-town-judge/[997. Find the Town Judge^] //|{source_base_url}/_0997_FindTheTownJudge.java[Java] //|{doc_base_url}/0997-find-the-town-judge.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/maximum-binary-tree-ii/[998. Maximum Binary Tree II^] //|{source_base_url}/_0998_MaximumBinaryTreeII.java[Java] //|{doc_base_url}/0998-maximum-binary-tree-ii.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/available-captures-for-rook/[999. Available Captures for Rook^] //|{source_base_url}/_0999_AvailableCapturesForRook.java[Java] //|{doc_base_url}/0999-available-captures-for-rook.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/minimum-cost-to-merge-stones/[1000. Minimum Cost to Merge Stones^] //|{source_base_url}/_1000_MinimumCostToMergeStones.java[Java] //|{doc_base_url}/1000-minimum-cost-to-merge-stones.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/grid-illumination/[1001. Grid Illumination^] //|{source_base_url}/_1001_GridIllumination.java[Java] //|{doc_base_url}/1001-grid-illumination.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/find-common-characters/[1002. Find Common Characters^] //|{source_base_url}/_1002_FindCommonCharacters.java[Java] //|{doc_base_url}/1002-find-common-characters.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/check-if-word-is-valid-after-substitutions/[1003. Check If Word Is Valid After Substitutions^] //|{source_base_url}/_1003_CheckIfWordIsValidAfterSubstitutions.java[Java] //|{doc_base_url}/1003-check-if-word-is-valid-after-substitutions.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/max-consecutive-ones-iii/[1004. Max Consecutive Ones III^] //|{source_base_url}/_1004_MaxConsecutiveOnesIII.java[Java] //|{doc_base_url}/1004-max-consecutive-ones-iii.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/maximize-sum-of-array-after-k-negations/[1005. Maximize Sum Of Array After K Negations^] //|{source_base_url}/_1005_MaximizeSumOfArrayAfterKNegations.java[Java] //|{doc_base_url}/1005-maximize-sum-of-array-after-k-negations.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/clumsy-factorial/[1006. Clumsy Factorial^] //|{source_base_url}/_1006_ClumsyFactorial.java[Java] //|{doc_base_url}/1006-clumsy-factorial.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/minimum-domino-rotations-for-equal-row/[1007. Minimum Domino Rotations For Equal Row^] //|{source_base_url}/_1007_MinimumDominoRotationsForEqualRow.java[Java] //|{doc_base_url}/1007-minimum-domino-rotations-for-equal-row.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/construct-binary-search-tree-from-preorder-traversal/[1008. Construct Binary Search Tree from Preorder Traversal^] //|{source_base_url}/_1008_ConstructBinarySearchTreeFromPreorderTraversal.java[Java] //|{doc_base_url}/1008-construct-binary-search-tree-from-preorder-traversal.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/complement-of-base-10-integer/[1009. Complement of Base 10 Integer^] //|{source_base_url}/_1009_ComplementOfBase10Integer.java[Java] //|{doc_base_url}/1009-complement-of-base-10-integer.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/pairs-of-songs-with-total-durations-divisible-by-60/[1010. Pairs of Songs With Total Durations Divisible by 60^] //|{source_base_url}/_1010_PairsOfSongsWithTotalDurationsDivisibleBy60.java[Java] //|{doc_base_url}/1010-pairs-of-songs-with-total-durations-divisible-by-60.adoc[题解] //|Easy //|

|{counter:codes} |{leetcode_base_url}/capacity-to-ship-packages-within-d-days/[1011. Capacity To Ship Packages Within D Days^] |{source_base_url}/_1011_CapacityToShipPackagesWithinDDays.java[Java] |{doc_base_url}/1011-capacity-to-ship-packages-within-d-days.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/numbers-with-repeated-digits/[1012. Numbers With Repeated Digits^] //|{source_base_url}/_1012_NumbersWithRepeatedDigits.java[Java] //|{doc_base_url}/1012-numbers-with-repeated-digits.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/partition-array-into-three-parts-with-equal-sum/[1013. Partition Array Into Three Parts With Equal Sum^] //|{source_base_url}/_1013_PartitionArrayIntoThreePartsWithEqualSum.java[Java] //|{doc_base_url}/1013-partition-array-into-three-parts-with-equal-sum.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/best-sightseeing-pair/[1014. Best Sightseeing Pair^] //|{source_base_url}/_1014_BestSightseeingPair.java[Java] //|{doc_base_url}/1014-best-sightseeing-pair.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/smallest-integer-divisible-by-k/[1015. Smallest Integer Divisible by K^] //|{source_base_url}/_1015_SmallestIntegerDivisibleByK.java[Java] //|{doc_base_url}/1015-smallest-integer-divisible-by-k.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/binary-string-with-substrings-representing-1-to-n/[1016. Binary String With Substrings Representing 1 To N^] //|{source_base_url}/_1016_BinaryStringWithSubstringsRepresenting1ToN.java[Java] //|{doc_base_url}/1016-binary-string-with-substrings-representing-1-to-n.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/convert-to-base-2/[1017. Convert to Base -2^] //|{source_base_url}/_1017_ConvertToBase2.java[Java] //|{doc_base_url}/1017-convert-to-base-2.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/binary-prefix-divisible-by-5/[1018. Binary Prefix Divisible By 5^] //|{source_base_url}/_1018_BinaryPrefixDivisibleBy5.java[Java] //|{doc_base_url}/1018-binary-prefix-divisible-by-5.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/next-greater-node-in-linked-list/[1019. Next Greater Node In Linked List^] //|{source_base_url}/_1019_NextGreaterNodeInLinkedList.java[Java] //|{doc_base_url}/1019-next-greater-node-in-linked-list.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/number-of-enclaves/[1020. Number of Enclaves^] //|{source_base_url}/_1020_NumberOfEnclaves.java[Java] //|{doc_base_url}/1020-number-of-enclaves.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/remove-outermost-parentheses/[1021. Remove Outermost Parentheses^] //|{source_base_url}/_1021_RemoveOutermostParentheses.java[Java] //|{doc_base_url}/1021-remove-outermost-parentheses.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/sum-of-root-to-leaf-binary-numbers/[1022. Sum of Root To Leaf Binary Numbers^] //|{source_base_url}/_1022_SumOfRootToLeafBinaryNumbers.java[Java] //|{doc_base_url}/1022-sum-of-root-to-leaf-binary-numbers.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/camelcase-matching/[1023. Camelcase Matching^] //|{source_base_url}/_1023_CamelcaseMatching.java[Java] //|{doc_base_url}/1023-camelcase-matching.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/video-stitching/[1024. Video Stitching^] //|{source_base_url}/_1024_VideoStitching.java[Java] //|{doc_base_url}/1024-video-stitching.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/divisor-game/[1025. Divisor Game^] //|{source_base_url}/_1025_DivisorGame.java[Java] //|{doc_base_url}/1025-divisor-game.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/maximum-difference-between-node-and-ancestor/[1026. Maximum Difference Between Node and Ancestor^] //|{source_base_url}/_1026_MaximumDifferenceBetweenNodeAndAncestor.java[Java] //|{doc_base_url}/1026-maximum-difference-between-node-and-ancestor.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/longest-arithmetic-sequence/[1027. Longest Arithmetic Sequence^] //|{source_base_url}/_1027_LongestArithmeticSequence.java[Java] //|{doc_base_url}/1027-longest-arithmetic-sequence.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/recover-a-tree-from-preorder-traversal/[1028. Recover a Tree From Preorder Traversal^] //|{source_base_url}/_1028_RecoverATreeFromPreorderTraversal.java[Java] //|{doc_base_url}/1028-recover-a-tree-from-preorder-traversal.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/two-city-scheduling/[1029. Two City Scheduling^] //|{source_base_url}/_1029_TwoCityScheduling.java[Java] //|{doc_base_url}/1029-two-city-scheduling.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/matrix-cells-in-distance-order/[1030. Matrix Cells in Distance Order^] //|{source_base_url}/_1030_MatrixCellsInDistanceOrder.java[Java] //|{doc_base_url}/1030-matrix-cells-in-distance-order.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/maximum-sum-of-two-non-overlapping-subarrays/[1031. Maximum Sum of Two Non-Overlapping Subarrays^] //|{source_base_url}/_1031_MaximumSumOfTwoNonOverlappingSubarrays.java[Java] //|{doc_base_url}/1031-maximum-sum-of-two-non-overlapping-subarrays.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/stream-of-characters/[1032. Stream of Characters^] //|{source_base_url}/_1032_StreamOfCharacters.java[Java] //|{doc_base_url}/1032-stream-of-characters.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/moving-stones-until-consecutive/[1033. Moving Stones Until Consecutive^] //|{source_base_url}/_1033_MovingStonesUntilConsecutive.java[Java] //|{doc_base_url}/1033-moving-stones-until-consecutive.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/coloring-a-border/[1034. Coloring A Border^] //|{source_base_url}/_1034_ColoringABorder.java[Java] //|{doc_base_url}/1034-coloring-a-border.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/uncrossed-lines/[1035. Uncrossed Lines^] //|{source_base_url}/_1035_UncrossedLines.java[Java] //|{doc_base_url}/1035-uncrossed-lines.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/escape-a-large-maze/[1036. Escape a Large Maze^] //|{source_base_url}/_1036_EscapeALargeMaze.java[Java] //|{doc_base_url}/1036-escape-a-large-maze.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/valid-boomerang/[1037. Valid Boomerang^] //|{source_base_url}/_1037_ValidBoomerang.java[Java] //|{doc_base_url}/1037-valid-boomerang.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/binary-search-tree-to-greater-sum-tree/[1038. Binary Search Tree to Greater Sum Tree^] //|{source_base_url}/_1038_BinarySearchTreeToGreaterSumTree.java[Java] //|{doc_base_url}/1038-binary-search-tree-to-greater-sum-tree.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/minimum-score-triangulation-of-polygon/[1039. Minimum Score Triangulation of Polygon^] //|{source_base_url}/_1039_MinimumScoreTriangulationOfPolygon.java[Java] //|{doc_base_url}/1039-minimum-score-triangulation-of-polygon.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/moving-stones-until-consecutive-ii/[1040. Moving Stones Until Consecutive II^] //|{source_base_url}/_1040_MovingStonesUntilConsecutiveII.java[Java] //|{doc_base_url}/1040-moving-stones-until-consecutive-ii.adoc[题解] //|Medium //|

|{counter:codes} |{leetcode_base_url}/robot-bounded-in-circle/[1041. Robot Bounded In Circle^] |{source_base_url}/_1041_RobotBoundedInCircle.java[Java] |{doc_base_url}/1041-robot-bounded-in-circle.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/flower-planting-with-no-adjacent/[1042. Flower Planting With No Adjacent^] //|{source_base_url}/_1042_FlowerPlantingWithNoAdjacent.java[Java] //|{doc_base_url}/1042-flower-planting-with-no-adjacent.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/partition-array-for-maximum-sum/[1043. Partition Array for Maximum Sum^] //|{source_base_url}/_1043_PartitionArrayForMaximumSum.java[Java] //|{doc_base_url}/1043-partition-array-for-maximum-sum.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/longest-duplicate-substring/[1044. Longest Duplicate Substring^] //|{source_base_url}/_1044_LongestDuplicateSubstring.java[Java] //|{doc_base_url}/1044-longest-duplicate-substring.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/customers-who-bought-all-products/[1045. Customers Who Bought All Products^] //|{source_base_url}/_1045_CustomersWhoBoughtAllProducts.java[Java] //|{doc_base_url}/1045-customers-who-bought-all-products.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/last-stone-weight/[1046. Last Stone Weight^] //|{source_base_url}/_1046_LastStoneWeight.java[Java] //|{doc_base_url}/1046-last-stone-weight.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/remove-all-adjacent-duplicates-in-string/[1047. Remove All Adjacent Duplicates In String^] //|{source_base_url}/_1047_RemoveAllAdjacentDuplicatesInString.java[Java] //|{doc_base_url}/1047-remove-all-adjacent-duplicates-in-string.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/longest-string-chain/[1048. Longest String Chain^] //|{source_base_url}/_1048_LongestStringChain.java[Java] //|{doc_base_url}/1048-longest-string-chain.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/last-stone-weight-ii/[1049. Last Stone Weight II^] //|{source_base_url}/_1049_LastStoneWeightII.java[Java] //|{doc_base_url}/1049-last-stone-weight-ii.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/actors-and-directors-who-cooperated-at-least-three-times/[1050. Actors and Directors Who Cooperated At Least Three Times^] //|{source_base_url}/_1050_ActorsAndDirectorsWhoCooperatedAtLeastThreeTimes.java[Java] //|{doc_base_url}/1050-actors-and-directors-who-cooperated-at-least-three-times.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/height-checker/[1051. Height Checker^] //|{source_base_url}/_1051_HeightChecker.java[Java] //|{doc_base_url}/1051-height-checker.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/grumpy-bookstore-owner/[1052. Grumpy Bookstore Owner^] //|{source_base_url}/_1052_GrumpyBookstoreOwner.java[Java] //|{doc_base_url}/1052-grumpy-bookstore-owner.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/previous-permutation-with-one-swap/[1053. Previous Permutation With One Swap^] //|{source_base_url}/_1053_PreviousPermutationWithOneSwap.java[Java] //|{doc_base_url}/1053-previous-permutation-with-one-swap.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/distant-barcodes/[1054. Distant Barcodes^] //|{source_base_url}/_1054_DistantBarcodes.java[Java] //|{doc_base_url}/1054-distant-barcodes.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/shortest-way-to-form-string/[1055. Shortest Way to Form String^] //|{source_base_url}/_1055_ShortestWayToFormString.java[Java] //|{doc_base_url}/1055-shortest-way-to-form-string.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/confusing-number/[1056. Confusing Number^] //|{source_base_url}/_1056_ConfusingNumber.java[Java] //|{doc_base_url}/1056-confusing-number.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/campus-bikes/[1057. Campus Bikes^] //|{source_base_url}/_1057_CampusBikes.java[Java] //|{doc_base_url}/1057-campus-bikes.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/minimize-rounding-error-to-meet-target/[1058. Minimize Rounding Error to Meet Target^] //|{source_base_url}/_1058_MinimizeRoundingErrorToMeetTarget.java[Java] //|{doc_base_url}/1058-minimize-rounding-error-to-meet-target.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/all-paths-from-source-lead-to-destination/[1059. All Paths from Source Lead to Destination^] //|{source_base_url}/_1059_AllPathsFromSourceLeadToDestination.java[Java] //|{doc_base_url}/1059-all-paths-from-source-lead-to-destination.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/missing-element-in-sorted-array/[1060. Missing Element in Sorted Array^] //|{source_base_url}/_1060_MissingElementInSortedArray.java[Java] //|{doc_base_url}/1060-missing-element-in-sorted-array.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/lexicographically-smallest-equivalent-string/[1061. Lexicographically Smallest Equivalent String^] //|{source_base_url}/_1061_LexicographicallySmallestEquivalentString.java[Java] //|{doc_base_url}/1061-lexicographically-smallest-equivalent-string.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/longest-repeating-substring/[1062. Longest Repeating Substring^] //|{source_base_url}/_1062_LongestRepeatingSubstring.java[Java] //|{doc_base_url}/1062-longest-repeating-substring.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/number-of-valid-subarrays/[1063. Number of Valid Subarrays^] //|{source_base_url}/_1063_NumberOfValidSubarrays.java[Java] //|{doc_base_url}/1063-number-of-valid-subarrays.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/fixed-point/[1064. Fixed Point^] //|{source_base_url}/_1064_FixedPoint.java[Java] //|{doc_base_url}/1064-fixed-point.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/index-pairs-of-a-string/[1065. Index Pairs of a String^] //|{source_base_url}/_1065_IndexPairsOfAString.java[Java] //|{doc_base_url}/1065-index-pairs-of-a-string.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/campus-bikes-ii/[1066. Campus Bikes II^] //|{source_base_url}/_1066_CampusBikesII.java[Java] //|{doc_base_url}/1066-campus-bikes-ii.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/digit-count-in-range/[1067. Digit Count in Range^] //|{source_base_url}/_1067_DigitCountInRange.java[Java] //|{doc_base_url}/1067-digit-count-in-range.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/product-sales-analysis-i/[1068. Product Sales Analysis I^] //|{source_base_url}/_1068_ProductSalesAnalysisI.java[Java] //|{doc_base_url}/1068-product-sales-analysis-i.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/product-sales-analysis-ii/[1069. Product Sales Analysis II^] //|{source_base_url}/_1069_ProductSalesAnalysisII.java[Java] //|{doc_base_url}/1069-product-sales-analysis-ii.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/product-sales-analysis-iii/[1070. Product Sales Analysis III^] //|{source_base_url}/_1070_ProductSalesAnalysisIII.java[Java] //|{doc_base_url}/1070-product-sales-analysis-iii.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/greatest-common-divisor-of-strings/[1071. Greatest Common Divisor of Strings^] //|{source_base_url}/_1071_GreatestCommonDivisorOfStrings.java[Java] //|{doc_base_url}/1071-greatest-common-divisor-of-strings.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/flip-columns-for-maximum-number-of-equal-rows/[1072. Flip Columns For Maximum Number of Equal Rows^] //|{source_base_url}/_1072_FlipColumnsForMaximumNumberOfEqualRows.java[Java] //|{doc_base_url}/1072-flip-columns-for-maximum-number-of-equal-rows.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/adding-two-negabinary-numbers/[1073. Adding Two Negabinary Numbers^] //|{source_base_url}/_1073_AddingTwoNegabinaryNumbers.java[Java] //|{doc_base_url}/1073-adding-two-negabinary-numbers.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/number-of-submatrices-that-sum-to-target/[1074. Number of Submatrices That Sum to Target^] //|{source_base_url}/_1074_NumberOfSubmatricesThatSumToTarget.java[Java] //|{doc_base_url}/1074-number-of-submatrices-that-sum-to-target.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/project-employees-i/[1075. Project Employees I^] //|{source_base_url}/_1075_ProjectEmployeesI.java[Java] //|{doc_base_url}/1075-project-employees-i.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/project-employees-ii/[1076. Project Employees II^] //|{source_base_url}/_1076_ProjectEmployeesII.java[Java] //|{doc_base_url}/1076-project-employees-ii.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/project-employees-iii/[1077. Project Employees III^] //|{source_base_url}/_1077_ProjectEmployeesIII.java[Java] //|{doc_base_url}/1077-project-employees-iii.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/occurrences-after-bigram/[1078. Occurrences After Bigram^] //|{source_base_url}/_1078_OccurrencesAfterBigram.java[Java] //|{doc_base_url}/1078-occurrences-after-bigram.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/letter-tile-possibilities/[1079. Letter Tile Possibilities^] //|{source_base_url}/_1079_LetterTilePossibilities.java[Java] //|{doc_base_url}/1079-letter-tile-possibilities.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/insufficient-nodes-in-root-to-leaf-paths/[1080. Insufficient Nodes in Root to Leaf Paths^] //|{source_base_url}/_1080_InsufficientNodesInRootToLeafPaths.java[Java] //|{doc_base_url}/1080-insufficient-nodes-in-root-to-leaf-paths.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/smallest-subsequence-of-distinct-characters/[1081. Smallest Subsequence of Distinct Characters^] //|{source_base_url}/_1081_SmallestSubsequenceOfDistinctCharacters.java[Java] //|{doc_base_url}/1081-smallest-subsequence-of-distinct-characters.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/sales-analysis-i/[1082. Sales Analysis I^] //|{source_base_url}/_1082_SalesAnalysisI.java[Java] //|{doc_base_url}/1082-sales-analysis-i.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/sales-analysis-ii/[1083. Sales Analysis II^] //|{source_base_url}/_1083_SalesAnalysisII.java[Java] //|{doc_base_url}/1083-sales-analysis-ii.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/sales-analysis-iii/[1084. Sales Analysis III^] //|{source_base_url}/_1084_SalesAnalysisIII.java[Java] //|{doc_base_url}/1084-sales-analysis-iii.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/sum-of-digits-in-the-minimum-number/[1085. Sum of Digits in the Minimum Number^] //|{source_base_url}/_1085_SumOfDigitsInTheMinimumNumber.java[Java] //|{doc_base_url}/1085-sum-of-digits-in-the-minimum-number.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/high-five/[1086. High Five^] //|{source_base_url}/_1086_HighFive.java[Java] //|{doc_base_url}/1086-high-five.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/brace-expansion/[1087. Brace Expansion^] //|{source_base_url}/_1087_BraceExpansion.java[Java] //|{doc_base_url}/1087-brace-expansion.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/confusing-number-ii/[1088. Confusing Number II^] //|{source_base_url}/_1088_ConfusingNumberII.java[Java] //|{doc_base_url}/1088-confusing-number-ii.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/duplicate-zeros/[1089. Duplicate Zeros^] //|{source_base_url}/_1089_DuplicateZeros.java[Java] //|{doc_base_url}/1089-duplicate-zeros.adoc[题解] //|Easy //|

|{counter:codes} |{leetcode_base_url}/largest-values-from-labels/[1090. Largest Values From Labels^] |{source_base_url}/_1090_LargestValuesFromLabels.java[Java] |{doc_base_url}/1090-largest-values-from-labels.adoc[题解] |Medium |排序规则跟 179、870 题类似：保存下标，使用其他数组的值对下标数组进行排序。

//|{counter:codes} //|{leetcode_base_url}/shortest-path-in-binary-matrix/[1091. Shortest Path in Binary Matrix^] //|{source_base_url}/_1091_ShortestPathInBinaryMatrix.java[Java] //|{doc_base_url}/1091-shortest-path-in-binary-matrix.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/shortest-common-supersequence/[1092. Shortest Common Supersequence ^] //|{source_base_url}/_1092_ShortestCommonSupersequence.java[Java] //|{doc_base_url}/1092-shortest-common-supersequence.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/statistics-from-a-large-sample/[1093. Statistics from a Large Sample^] //|{source_base_url}/_1093_StatisticsFromALargeSample.java[Java] //|{doc_base_url}/1093-statistics-from-a-large-sample.adoc[题解] //|Medium //|

|{counter:codes} |{leetcode_base_url}/car-pooling/[1094. Car Pooling^] |{source_base_url}/_1094_CarPooling.java[Java] |{doc_base_url}/1094-car-pooling.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/find-in-mountain-array/[1095. Find in Mountain Array^] //|{source_base_url}/_1095_FindInMountainArray.java[Java] //|{doc_base_url}/1095-find-in-mountain-array.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/brace-expansion-ii/[1096. Brace Expansion II^] //|{source_base_url}/_1096_BraceExpansionII.java[Java] //|{doc_base_url}/1096-brace-expansion-ii.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/game-play-analysis-v/[1097. Game Play Analysis V^] //|{source_base_url}/_1097_GamePlayAnalysisV.java[Java] //|{doc_base_url}/1097-game-play-analysis-v.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/unpopular-books/[1098. Unpopular Books^] //|{source_base_url}/_1098_UnpopularBooks.java[Java] //|{doc_base_url}/1098-unpopular-books.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/two-sum-less-than-k/[1099. Two Sum Less Than K^] //|{source_base_url}/_1099_TwoSumLessThanK.java[Java] //|{doc_base_url}/1099-two-sum-less-than-k.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/find-k-length-substrings-with-no-repeated-characters/[1100. Find K-Length Substrings With No Repeated Characters^] //|{source_base_url}/_1100_FindKLengthSubstringsWithNoRepeatedCharacters.java[Java] //|{doc_base_url}/1100-find-k-length-substrings-with-no-repeated-characters.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/the-earliest-moment-when-everyone-become-friends/[1101. The Earliest Moment When Everyone Become Friends^] //|{source_base_url}/_1101_TheEarliestMomentWhenEveryoneBecomeFriends.java[Java] //|{doc_base_url}/1101-the-earliest-moment-when-everyone-become-friends.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/path-with-maximum-minimum-value/[1102. Path With Maximum Minimum Value^] //|{source_base_url}/_1102_PathWithMaximumMinimumValue.java[Java] //|{doc_base_url}/1102-path-with-maximum-minimum-value.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/distribute-candies-to-people/[1103. Distribute Candies to People^] //|{source_base_url}/_1103_DistributeCandiesToPeople.java[Java] //|{doc_base_url}/1103-distribute-candies-to-people.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/path-in-zigzag-labelled-binary-tree/[1104. Path In Zigzag Labelled Binary Tree^] //|{source_base_url}/_1104_PathInZigzagLabelledBinaryTree.java[Java] //|{doc_base_url}/1104-path-in-zigzag-labelled-binary-tree.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/filling-bookcase-shelves/[1105. Filling Bookcase Shelves^] //|{source_base_url}/_1105_FillingBookcaseShelves.java[Java] //|{doc_base_url}/1105-filling-bookcase-shelves.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/parsing-a-boolean-expression/[1106. Parsing A Boolean Expression^] //|{source_base_url}/_1106_ParsingABooleanExpression.java[Java] //|{doc_base_url}/1106-parsing-a-boolean-expression.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/new-users-daily-count/[1107. New Users Daily Count^] //|{source_base_url}/_1107_NewUsersDailyCount.java[Java] //|{doc_base_url}/1107-new-users-daily-count.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/defanging-an-ip-address/[1108. Defanging an IP Address^] //|{source_base_url}/_1108_DefangingAnIPAddress.java[Java] //|{doc_base_url}/1108-defanging-an-ip-address.adoc[题解] //|Easy //|

|{counter:codes} |{leetcode_base_url}/corporate-flight-bookings/[1109. Corporate Flight Bookings^] |{source_base_url}/_1109_CorporateFlightBookings.java[Java] |{doc_base_url}/1109-corporate-flight-bookings.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/delete-nodes-and-return-forest/[1110. Delete Nodes And Return Forest^] |{source_base_url}/_1110_DeleteNodesAndReturnForest.java[Java] |{doc_base_url}/1110-delete-nodes-and-return-forest.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/maximum-nesting-depth-of-two-valid-parentheses-strings/[1111. Maximum Nesting Depth of Two Valid Parentheses Strings^] //|{source_base_url}/_1111_MaximumNestingDepthOfTwoValidParenthesesStrings.java[Java] //|{doc_base_url}/1111-maximum-nesting-depth-of-two-valid-parentheses-strings.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/highest-grade-for-each-student/[1112. Highest Grade For Each Student^] //|{source_base_url}/_1112_HighestGradeForEachStudent.java[Java] //|{doc_base_url}/1112-highest-grade-for-each-student.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/reported-posts/[1113. Reported Posts^] //|{source_base_url}/_1113_ReportedPosts.java[Java] //|{doc_base_url}/1113-reported-posts.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/print-in-order/[1114. Print in Order^] //|{source_base_url}/_1114_PrintInOrder.java[Java] //|{doc_base_url}/1114-print-in-order.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/print-foobar-alternately/[1115. Print FooBar Alternately^] //|{source_base_url}/_1115_PrintFooBarAlternately.java[Java] //|{doc_base_url}/1115-print-foobar-alternately.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/print-zero-even-odd/[1116. Print Zero Even Odd^] //|{source_base_url}/_1116_PrintZeroEvenOdd.java[Java] //|{doc_base_url}/1116-print-zero-even-odd.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/building-h2o/[1117. Building H2O^] //|{source_base_url}/_1117_BuildingH2O.java[Java] //|{doc_base_url}/1117-building-h2o.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/number-of-days-in-a-month/[1118. Number of Days in a Month^] //|{source_base_url}/_1118_NumberOfDaysInAMonth.java[Java] //|{doc_base_url}/1118-number-of-days-in-a-month.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/remove-vowels-from-a-string/[1119. Remove Vowels from a String^] //|{source_base_url}/_1119_RemoveVowelsFromAString.java[Java] //|{doc_base_url}/1119-remove-vowels-from-a-string.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/maximum-average-subtree/[1120. Maximum Average Subtree^] //|{source_base_url}/_1120_MaximumAverageSubtree.java[Java] //|{doc_base_url}/1120-maximum-average-subtree.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/divide-array-into-increasing-sequences/[1121. Divide Array Into Increasing Sequences^] //|{source_base_url}/_1121_DivideArrayIntoIncreasingSequences.java[Java] //|{doc_base_url}/1121-divide-array-into-increasing-sequences.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/relative-sort-array/[1122. Relative Sort Array^] //|{source_base_url}/_1122_RelativeSortArray.java[Java] //|{doc_base_url}/1122-relative-sort-array.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/lowest-common-ancestor-of-deepest-leaves/[1123. Lowest Common Ancestor of Deepest Leaves^] //|{source_base_url}/_1123_LowestCommonAncestorOfDeepestLeaves.java[Java] //|{doc_base_url}/1123-lowest-common-ancestor-of-deepest-leaves.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/longest-well-performing-interval/[1124. Longest Well-Performing Interval^] //|{source_base_url}/_1124_LongestWellPerformingInterval.java[Java] //|{doc_base_url}/1124-longest-well-performing-interval.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/smallest-sufficient-team/[1125. Smallest Sufficient Team^] //|{source_base_url}/_1125_SmallestSufficientTeam.java[Java] //|{doc_base_url}/1125-smallest-sufficient-team.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/active-businesses/[1126. Active Businesses^] //|{source_base_url}/_1126_ActiveBusinesses.java[Java] //|{doc_base_url}/1126-active-businesses.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/user-purchase-platform/[1127. User Purchase Platform^] //|{source_base_url}/_1127_UserPurchasePlatform.java[Java] //|{doc_base_url}/1127-user-purchase-platform.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/number-of-equivalent-domino-pairs/[1128. Number of Equivalent Domino Pairs^] //|{source_base_url}/_1128_NumberOfEquivalentDominoPairs.java[Java] //|{doc_base_url}/1128-number-of-equivalent-domino-pairs.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/shortest-path-with-alternating-colors/[1129. Shortest Path with Alternating Colors^] //|{source_base_url}/_1129_ShortestPathWithAlternatingColors.java[Java] //|{doc_base_url}/1129-shortest-path-with-alternating-colors.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/minimum-cost-tree-from-leaf-values/[1130. Minimum Cost Tree From Leaf Values^] //|{source_base_url}/_1130_MinimumCostTreeFromLeafValues.java[Java] //|{doc_base_url}/1130-minimum-cost-tree-from-leaf-values.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/maximum-of-absolute-value-expression/[1131. Maximum of Absolute Value Expression^] //|{source_base_url}/_1131_MaximumOfAbsoluteValueExpression.java[Java] //|{doc_base_url}/1131-maximum-of-absolute-value-expression.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/reported-posts-ii/[1132. Reported Posts II^] //|{source_base_url}/_1132_ReportedPostsII.java[Java] //|{doc_base_url}/1132-reported-posts-ii.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/largest-unique-number/[1133. Largest Unique Number^] //|{source_base_url}/_1133_LargestUniqueNumber.java[Java] //|{doc_base_url}/1133-largest-unique-number.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/armstrong-number/[1134. Armstrong Number^] //|{source_base_url}/_1134_ArmstrongNumber.java[Java] //|{doc_base_url}/1134-armstrong-number.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/connecting-cities-with-minimum-cost/[1135. Connecting Cities With Minimum Cost^] //|{source_base_url}/_1135_ConnectingCitiesWithMinimumCost.java[Java] //|{doc_base_url}/1135-connecting-cities-with-minimum-cost.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/parallel-courses/[1136. Parallel Courses^] //|{source_base_url}/_1136_ParallelCourses.java[Java] //|{doc_base_url}/1136-parallel-courses.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/n-th-tribonacci-number/[1137. N-th Tribonacci Number^] //|{source_base_url}/_1137_NThTribonacciNumber.java[Java] //|{doc_base_url}/1137-n-th-tribonacci-number.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/alphabet-board-path/[1138. Alphabet Board Path^] //|{source_base_url}/_1138_AlphabetBoardPath.java[Java] //|{doc_base_url}/1138-alphabet-board-path.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/largest-1-bordered-square/[1139. Largest 1-Bordered Square^] //|{source_base_url}/_1139_Largest1BorderedSquare.java[Java] //|{doc_base_url}/1139-largest-1-bordered-square.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/stone-game-ii/[1140. Stone Game II^] //|{source_base_url}/_1140_StoneGameII.java[Java] //|{doc_base_url}/1140-stone-game-ii.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/user-activity-for-the-past-30-days-i/[1141. User Activity for the Past 30 Days I^] //|{source_base_url}/_1141_UserActivityForThePast30DaysI.java[Java] //|{doc_base_url}/1141-user-activity-for-the-past-30-days-i.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/user-activity-for-the-past-30-days-ii/[1142. User Activity for the Past 30 Days II^] //|{source_base_url}/_1142_UserActivityForThePast30DaysII.java[Java] //|{doc_base_url}/1142-user-activity-for-the-past-30-days-ii.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/longest-common-subsequence/[1143. Longest Common Subsequence^] //|{source_base_url}/_1143_LongestCommonSubsequence.java[Java] //|{doc_base_url}/1143-longest-common-subsequence.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/decrease-elements-to-make-array-zigzag/[1144. Decrease Elements To Make Array Zigzag^] //|{source_base_url}/_1144_DecreaseElementsToMakeArrayZigzag.java[Java] //|{doc_base_url}/1144-decrease-elements-to-make-array-zigzag.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/binary-tree-coloring-game/[1145. Binary Tree Coloring Game^] //|{source_base_url}/_1145_BinaryTreeColoringGame.java[Java] //|{doc_base_url}/1145-binary-tree-coloring-game.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/snapshot-array/[1146. Snapshot Array^] //|{source_base_url}/_1146_SnapshotArray.java[Java] //|{doc_base_url}/1146-snapshot-array.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/longest-chunked-palindrome-decomposition/[1147. Longest Chunked Palindrome Decomposition^] //|{source_base_url}/_1147_LongestChunkedPalindromeDecomposition.java[Java] //|{doc_base_url}/1147-longest-chunked-palindrome-decomposition.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/article-views-i/[1148. Article Views I^] //|{source_base_url}/_1148_ArticleViewsI.java[Java] //|{doc_base_url}/1148-article-views-i.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/article-views-ii/[1149. Article Views II^] //|{source_base_url}/_1149_ArticleViewsII.java[Java] //|{doc_base_url}/1149-article-views-ii.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/check-if-a-number-is-majority-element-in-a-sorted-array/[1150. Check If a Number Is Majority Element in a Sorted Array^] //|{source_base_url}/_1150_CheckIfANumberIsMajorityElementInASortedArray.java[Java] //|{doc_base_url}/1150-check-if-a-number-is-majority-element-in-a-sorted-array.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/minimum-swaps-to-group-all-1s-together/[1151. Minimum Swaps to Group All 1's Together^] //|{source_base_url}/_1151_MinimumSwapsToGroupAll1STogether.java[Java] //|{doc_base_url}/1151-minimum-swaps-to-group-all-1s-together.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/analyze-user-website-visit-pattern/[1152. Analyze User Website Visit Pattern^] //|{source_base_url}/_1152_AnalyzeUserWebsiteVisitPattern.java[Java] //|{doc_base_url}/1152-analyze-user-website-visit-pattern.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/string-transforms-into-another-string/[1153. String Transforms Into Another String^] //|{source_base_url}/_1153_StringTransformsIntoAnotherString.java[Java] //|{doc_base_url}/1153-string-transforms-into-another-string.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/day-of-the-year/[1154. Day of the Year^] //|{source_base_url}/_1154_DayOfTheYear.java[Java] //|{doc_base_url}/1154-day-of-the-year.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/number-of-dice-rolls-with-target-sum/[1155. Number of Dice Rolls With Target Sum^] //|{source_base_url}/_1155_NumberOfDiceRollsWithTargetSum.java[Java] //|{doc_base_url}/1155-number-of-dice-rolls-with-target-sum.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/swap-for-longest-repeated-character-substring/[1156. Swap For Longest Repeated Character Substring^] //|{source_base_url}/_1156_SwapForLongestRepeatedCharacterSubstring.java[Java] //|{doc_base_url}/1156-swap-for-longest-repeated-character-substring.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/online-majority-element-in-subarray/[1157. Online Majority Element In Subarray^] //|{source_base_url}/_1157_OnlineMajorityElementInSubarray.java[Java] //|{doc_base_url}/1157-online-majority-element-in-subarray.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/market-analysis-i/[1158. Market Analysis I^] //|{source_base_url}/_1158_MarketAnalysisI.java[Java] //|{doc_base_url}/1158-market-analysis-i.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/market-analysis-ii/[1159. Market Analysis II^] //|{source_base_url}/_1159_MarketAnalysisII.java[Java] //|{doc_base_url}/1159-market-analysis-ii.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/find-words-that-can-be-formed-by-characters/[1160. Find Words That Can Be Formed by Characters^] //|{source_base_url}/_1160_FindWordsThatCanBeFormedByCharacters.java[Java] //|{doc_base_url}/1160-find-words-that-can-be-formed-by-characters.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/maximum-level-sum-of-a-binary-tree/[1161. Maximum Level Sum of a Binary Tree^] //|{source_base_url}/_1161_MaximumLevelSumOfABinaryTree.java[Java] //|{doc_base_url}/1161-maximum-level-sum-of-a-binary-tree.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/as-far-from-land-as-possible/[1162. As Far from Land as Possible^] //|{source_base_url}/_1162_AsFarFromLandAsPossible.java[Java] //|{doc_base_url}/1162-as-far-from-land-as-possible.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/last-substring-in-lexicographical-order/[1163. Last Substring in Lexicographical Order^] //|{source_base_url}/_1163_LastSubstringInLexicographicalOrder.java[Java] //|{doc_base_url}/1163-last-substring-in-lexicographical-order.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/product-price-at-a-given-date/[1164. Product Price at a Given Date^] //|{source_base_url}/_1164_ProductPriceAtAGivenDate.java[Java] //|{doc_base_url}/1164-product-price-at-a-given-date.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/single-row-keyboard/[1165. Single-Row Keyboard^] //|{source_base_url}/_1165_SingleRowKeyboard.java[Java] //|{doc_base_url}/1165-single-row-keyboard.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/design-file-system/[1166. Design File System^] //|{source_base_url}/_1166_DesignFileSystem.java[Java] //|{doc_base_url}/1166-design-file-system.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/minimum-cost-to-connect-sticks/[1167. Minimum Cost to Connect Sticks^] //|{source_base_url}/_1167_MinimumCostToConnectSticks.java[Java] //|{doc_base_url}/1167-minimum-cost-to-connect-sticks.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/optimize-water-distribution-in-a-village/[1168. Optimize Water Distribution in a Village^] //|{source_base_url}/_1168_OptimizeWaterDistributionInAVillage.java[Java] //|{doc_base_url}/1168-optimize-water-distribution-in-a-village.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/invalid-transactions/[1169. Invalid Transactions^] //|{source_base_url}/_1169_InvalidTransactions.java[Java] //|{doc_base_url}/1169-invalid-transactions.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/compare-strings-by-frequency-of-the-smallest-character/[1170. Compare Strings by Frequency of the Smallest Character^] //|{source_base_url}/_1170_CompareStringsByFrequencyOfTheSmallestCharacter.java[Java] //|{doc_base_url}/1170-compare-strings-by-frequency-of-the-smallest-character.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/remove-zero-sum-consecutive-nodes-from-linked-list/[1171. Remove Zero Sum Consecutive Nodes from Linked List^] //|{source_base_url}/_1171_RemoveZeroSumConsecutiveNodesFromLinkedList.java[Java] //|{doc_base_url}/1171-remove-zero-sum-consecutive-nodes-from-linked-list.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/dinner-plate-stacks/[1172. Dinner Plate Stacks^] //|{source_base_url}/_1172_DinnerPlateStacks.java[Java] //|{doc_base_url}/1172-dinner-plate-stacks.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/immediate-food-delivery-i/[1173. Immediate Food Delivery I^] //|{source_base_url}/_1173_ImmediateFoodDeliveryI.java[Java] //|{doc_base_url}/1173-immediate-food-delivery-i.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/immediate-food-delivery-ii/[1174. Immediate Food Delivery II^] //|{source_base_url}/_1174_ImmediateFoodDeliveryII.java[Java] //|{doc_base_url}/1174-immediate-food-delivery-ii.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/prime-arrangements/[1175. Prime Arrangements^] //|{source_base_url}/_1175_PrimeArrangements.java[Java] //|{doc_base_url}/1175-prime-arrangements.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/diet-plan-performance/[1176. Diet Plan Performance^] //|{source_base_url}/_1176_DietPlanPerformance.java[Java] //|{doc_base_url}/1176-diet-plan-performance.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/can-make-palindrome-from-substring/[1177. Can Make Palindrome from Substring^] //|{source_base_url}/_1177_CanMakePalindromeFromSubstring.java[Java] //|{doc_base_url}/1177-can-make-palindrome-from-substring.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/number-of-valid-words-for-each-puzzle/[1178. Number of Valid Words for Each Puzzle^] //|{source_base_url}/_1178_NumberOfValidWordsForEachPuzzle.java[Java] //|{doc_base_url}/1178-number-of-valid-words-for-each-puzzle.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/reformat-department-table/[1179. Reformat Department Table^] //|{source_base_url}/_1179_ReformatDepartmentTable.java[Java] //|{doc_base_url}/1179-reformat-department-table.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/count-substrings-with-only-one-distinct-letter/[1180. Count Substrings with Only One Distinct Letter^] //|{source_base_url}/_1180_CountSubstringsWithOnlyOneDistinctLetter.java[Java] //|{doc_base_url}/1180-count-substrings-with-only-one-distinct-letter.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/before-and-after-puzzle/[1181. Before and After Puzzle^] //|{source_base_url}/_1181_BeforeAndAfterPuzzle.java[Java] //|{doc_base_url}/1181-before-and-after-puzzle.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/shortest-distance-to-target-color/[1182. Shortest Distance to Target Color^] //|{source_base_url}/_1182_ShortestDistanceToTargetColor.java[Java] //|{doc_base_url}/1182-shortest-distance-to-target-color.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/maximum-number-of-ones/[1183. Maximum Number of Ones^] //|{source_base_url}/_1183_MaximumNumberOfOnes.java[Java] //|{doc_base_url}/1183-maximum-number-of-ones.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/distance-between-bus-stops/[1184. Distance Between Bus Stops^] //|{source_base_url}/_1184_DistanceBetweenBusStops.java[Java] //|{doc_base_url}/1184-distance-between-bus-stops.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/day-of-the-week/[1185. Day of the Week^] //|{source_base_url}/_1185_DayOfTheWeek.java[Java] //|{doc_base_url}/1185-day-of-the-week.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/maximum-subarray-sum-with-one-deletion/[1186. Maximum Subarray Sum with One Deletion^] //|{source_base_url}/_1186_MaximumSubarraySumWithOneDeletion.java[Java] //|{doc_base_url}/1186-maximum-subarray-sum-with-one-deletion.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/make-array-strictly-increasing/[1187. Make Array Strictly Increasing^] //|{source_base_url}/_1187_MakeArrayStrictlyIncreasing.java[Java] //|{doc_base_url}/1187-make-array-strictly-increasing.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/design-bounded-blocking-queue/[1188. Design Bounded Blocking Queue^] //|{source_base_url}/_1188_DesignBoundedBlockingQueue.java[Java] //|{doc_base_url}/1188-design-bounded-blocking-queue.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/maximum-number-of-balloons/[1189. Maximum Number of Balloons^] //|{source_base_url}/_1189_MaximumNumberOfBalloons.java[Java] //|{doc_base_url}/1189-maximum-number-of-balloons.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/reverse-substrings-between-each-pair-of-parentheses/[1190. Reverse Substrings Between Each Pair of Parentheses^] //|{source_base_url}/_1190_ReverseSubstringsBetweenEachPairOfParentheses.java[Java] //|{doc_base_url}/1190-reverse-substrings-between-each-pair-of-parentheses.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/k-concatenation-maximum-sum/[1191. K-Concatenation Maximum Sum^] //|{source_base_url}/_1191_KConcatenationMaximumSum.java[Java] //|{doc_base_url}/1191-k-concatenation-maximum-sum.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/critical-connections-in-a-network/[1192. Critical Connections in a Network^] //|{source_base_url}/_1192_CriticalConnectionsInANetwork.java[Java] //|{doc_base_url}/1192-critical-connections-in-a-network.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/monthly-transactions-i/[1193. Monthly Transactions I^] //|{source_base_url}/_1193_MonthlyTransactionsI.java[Java] //|{doc_base_url}/1193-monthly-transactions-i.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/tournament-winners/[1194. Tournament Winners^] //|{source_base_url}/_1194_TournamentWinners.java[Java] //|{doc_base_url}/1194-tournament-winners.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/fizz-buzz-multithreaded/[1195. Fizz Buzz Multithreaded^] //|{source_base_url}/_1195_FizzBuzzMultithreaded.java[Java] //|{doc_base_url}/1195-fizz-buzz-multithreaded.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/how-many-apples-can-you-put-into-the-basket/[1196. How Many Apples Can You Put into the Basket^] //|{source_base_url}/_1196_HowManyApplesCanYouPutIntoTheBasket.java[Java] //|{doc_base_url}/1196-how-many-apples-can-you-put-into-the-basket.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/minimum-knight-moves/[1197. Minimum Knight Moves^] //|{source_base_url}/_1197_MinimumKnightMoves.java[Java] //|{doc_base_url}/1197-minimum-knight-moves.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/find-smallest-common-element-in-all-rows/[1198. Find Smallest Common Element in All Rows^] //|{source_base_url}/_1198_FindSmallestCommonElementInAllRows.java[Java] //|{doc_base_url}/1198-find-smallest-common-element-in-all-rows.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/minimum-time-to-build-blocks/[1199. Minimum Time to Build Blocks^] //|{source_base_url}/_1199_MinimumTimeToBuildBlocks.java[Java] //|{doc_base_url}/1199-minimum-time-to-build-blocks.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/minimum-absolute-difference/[1200. Minimum Absolute Difference^] //|{source_base_url}/_1200_MinimumAbsoluteDifference.java[Java] //|{doc_base_url}/1200-minimum-absolute-difference.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/ugly-number-iii/[1201. Ugly Number III^] //|{source_base_url}/_1201_UglyNumberIII.java[Java] //|{doc_base_url}/1201-ugly-number-iii.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/smallest-string-with-swaps/[1202. Smallest String With Swaps^] //|{source_base_url}/_1202_SmallestStringWithSwaps.java[Java] //|{doc_base_url}/1202-smallest-string-with-swaps.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/sort-items-by-groups-respecting-dependencies/[1203. Sort Items by Groups Respecting Dependencies^] //|{source_base_url}/_1203_SortItemsByGroupsRespectingDependencies.java[Java] //|{doc_base_url}/1203-sort-items-by-groups-respecting-dependencies.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/last-person-to-fit-in-the-elevator/[1204. Last Person to Fit in the Elevator^] //|{source_base_url}/_1204_LastPersonToFitInTheElevator.java[Java] //|{doc_base_url}/1204-last-person-to-fit-in-the-elevator.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/monthly-transactions-ii/[1205. Monthly Transactions II^] //|{source_base_url}/_1205_MonthlyTransactionsII.java[Java] //|{doc_base_url}/1205-monthly-transactions-ii.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/design-skiplist/[1206. Design Skiplist^] //|{source_base_url}/_1206_DesignSkiplist.java[Java] //|{doc_base_url}/1206-design-skiplist.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/unique-number-of-occurrences/[1207. Unique Number of Occurrences^] //|{source_base_url}/_1207_UniqueNumberOfOccurrences.java[Java] //|{doc_base_url}/1207-unique-number-of-occurrences.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/get-equal-substrings-within-budget/[1208. Get Equal Substrings Within Budget^] //|{source_base_url}/_1208_GetEqualSubstringsWithinBudget.java[Java] //|{doc_base_url}/1208-get-equal-substrings-within-budget.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/remove-all-adjacent-duplicates-in-string-ii/[1209. Remove All Adjacent Duplicates in String II^] //|{source_base_url}/_1209_RemoveAllAdjacentDuplicatesInStringII.java[Java] //|{doc_base_url}/1209-remove-all-adjacent-duplicates-in-string-ii.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/minimum-moves-to-reach-target-with-rotations/[1210. Minimum Moves to Reach Target with Rotations^] //|{source_base_url}/_1210_MinimumMovesToReachTargetWithRotations.java[Java] //|{doc_base_url}/1210-minimum-moves-to-reach-target-with-rotations.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/queries-quality-and-percentage/[1211. Queries Quality and Percentage^] //|{source_base_url}/_1211_QueriesQualityAndPercentage.java[Java] //|{doc_base_url}/1211-queries-quality-and-percentage.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/team-scores-in-football-tournament/[1212. Team Scores in Football Tournament^] //|{source_base_url}/_1212_TeamScoresInFootballTournament.java[Java] //|{doc_base_url}/1212-team-scores-in-football-tournament.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/intersection-of-three-sorted-arrays/[1213. Intersection of Three Sorted Arrays^] //|{source_base_url}/_1213_IntersectionOfThreeSortedArrays.java[Java] //|{doc_base_url}/1213-intersection-of-three-sorted-arrays.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/two-sum-bsts/[1214. Two Sum BSTs^] //|{source_base_url}/_1214_TwoSumBSTs.java[Java] //|{doc_base_url}/1214-two-sum-bsts.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/stepping-numbers/[1215. Stepping Numbers^] //|{source_base_url}/_1215_SteppingNumbers.java[Java] //|{doc_base_url}/1215-stepping-numbers.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/valid-palindrome-iii/[1216. Valid Palindrome III^] //|{source_base_url}/_1216_ValidPalindromeIII.java[Java] //|{doc_base_url}/1216-valid-palindrome-iii.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/play-with-chips/[1217. Play with Chips^] //|{source_base_url}/_1217_PlayWithChips.java[Java] //|{doc_base_url}/1217-play-with-chips.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/longest-arithmetic-subsequence-of-given-difference/[1218. Longest Arithmetic Subsequence of Given Difference^] //|{source_base_url}/_1218_LongestArithmeticSubsequenceOfGivenDifference.java[Java] //|{doc_base_url}/1218-longest-arithmetic-subsequence-of-given-difference.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/path-with-maximum-gold/[1219. Path with Maximum Gold^] //|{source_base_url}/_1219_PathWithMaximumGold.java[Java] //|{doc_base_url}/1219-path-with-maximum-gold.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/count-vowels-permutation/[1220. Count Vowels Permutation^] //|{source_base_url}/_1220_CountVowelsPermutation.java[Java] //|{doc_base_url}/1220-count-vowels-permutation.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/split-a-string-in-balanced-strings/[1221. Split a String in Balanced Strings^] //|{source_base_url}/_1221_SplitAStringInBalancedStrings.java[Java] //|{doc_base_url}/1221-split-a-string-in-balanced-strings.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/queens-that-can-attack-the-king/[1222. Queens That Can Attack the King^] //|{source_base_url}/_1222_QueensThatCanAttackTheKing.java[Java] //|{doc_base_url}/1222-queens-that-can-attack-the-king.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/dice-roll-simulation/[1223. Dice Roll Simulation^] //|{source_base_url}/_1223_DiceRollSimulation.java[Java] //|{doc_base_url}/1223-dice-roll-simulation.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/maximum-equal-frequency/[1224. Maximum Equal Frequency^] //|{source_base_url}/_1224_MaximumEqualFrequency.java[Java] //|{doc_base_url}/1224-maximum-equal-frequency.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/report-contiguous-dates/[1225. Report Contiguous Dates^] //|{source_base_url}/_1225_ReportContiguousDates.java[Java] //|{doc_base_url}/1225-report-contiguous-dates.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/the-dining-philosophers/[1226. The Dining Philosophers^] //|{source_base_url}/_1226_TheDiningPhilosophers.java[Java] //|{doc_base_url}/1226-the-dining-philosophers.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/airplane-seat-assignment-probability/[1227. Airplane Seat Assignment Probability^] //|{source_base_url}/_1227_AirplaneSeatAssignmentProbability.java[Java] //|{doc_base_url}/1227-airplane-seat-assignment-probability.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/missing-number-in-arithmetic-progression/[1228. Missing Number In Arithmetic Progression^] //|{source_base_url}/_1228_MissingNumberInArithmeticProgression.java[Java] //|{doc_base_url}/1228-missing-number-in-arithmetic-progression.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/meeting-scheduler/[1229. Meeting Scheduler^] //|{source_base_url}/_1229_MeetingScheduler.java[Java] //|{doc_base_url}/1229-meeting-scheduler.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/toss-strange-coins/[1230. Toss Strange Coins^] //|{source_base_url}/_1230_TossStrangeCoins.java[Java] //|{doc_base_url}/1230-toss-strange-coins.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/divide-chocolate/[1231. Divide Chocolate^] //|{source_base_url}/_1231_DivideChocolate.java[Java] //|{doc_base_url}/1231-divide-chocolate.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/check-if-it-is-a-straight-line/[1232. Check If It Is a Straight Line^] //|{source_base_url}/_1232_CheckIfItIsAStraightLine.java[Java] //|{doc_base_url}/1232-check-if-it-is-a-straight-line.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/remove-sub-folders-from-the-filesystem/[1233. Remove Sub-Folders from the Filesystem^] //|{source_base_url}/_1233_RemoveSubFoldersFromTheFilesystem.java[Java] //|{doc_base_url}/1233-remove-sub-folders-from-the-filesystem.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/replace-the-substring-for-balanced-string/[1234. Replace the Substring for Balanced String^] //|{source_base_url}/_1234_ReplaceTheSubstringForBalancedString.java[Java] //|{doc_base_url}/1234-replace-the-substring-for-balanced-string.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/maximum-profit-in-job-scheduling/[1235. Maximum Profit in Job Scheduling^] //|{source_base_url}/_1235_MaximumProfitInJobScheduling.java[Java] //|{doc_base_url}/1235-maximum-profit-in-job-scheduling.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/web-crawler/[1236. Web Crawler^] //|{source_base_url}/_1236_WebCrawler.java[Java] //|{doc_base_url}/1236-web-crawler.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/find-positive-integer-solution-for-a-given-equation/[1237. Find Positive Integer Solution for a Given Equation^] //|{source_base_url}/_1237_FindPositiveIntegerSolutionForAGivenEquation.java[Java] //|{doc_base_url}/1237-find-positive-integer-solution-for-a-given-equation.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/circular-permutation-in-binary-representation/[1238. Circular Permutation in Binary Representation^] //|{source_base_url}/_1238_CircularPermutationInBinaryRepresentation.java[Java] //|{doc_base_url}/1238-circular-permutation-in-binary-representation.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/maximum-length-of-a-concatenated-string-with-unique-characters/[1239. Maximum Length of a Concatenated String with Unique Characters^] //|{source_base_url}/_1239_MaximumLengthOfAConcatenatedStringWithUniqueCharacters.java[Java] //|{doc_base_url}/1239-maximum-length-of-a-concatenated-string-with-unique-characters.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/tiling-a-rectangle-with-the-fewest-squares/[1240. Tiling a Rectangle with the Fewest Squares^] //|{source_base_url}/_1240_TilingARectangleWithTheFewestSquares.java[Java] //|{doc_base_url}/1240-tiling-a-rectangle-with-the-fewest-squares.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/number-of-comments-per-post/[1241. Number of Comments per Post^] //|{source_base_url}/_1241_NumberOfCommentsPerPost.java[Java] //|{doc_base_url}/1241-number-of-comments-per-post.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/web-crawler-multithreaded/[1242. Web Crawler Multithreaded^] //|{source_base_url}/_1242_WebCrawlerMultithreaded.java[Java] //|{doc_base_url}/1242-web-crawler-multithreaded.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/array-transformation/[1243. Array Transformation^] //|{source_base_url}/_1243_ArrayTransformation.java[Java] //|{doc_base_url}/1243-array-transformation.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/design-a-leaderboard/[1244. Design A Leaderboard^] //|{source_base_url}/_1244_DesignALeaderboard.java[Java] //|{doc_base_url}/1244-design-a-leaderboard.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/tree-diameter/[1245. Tree Diameter^] //|{source_base_url}/_1245_TreeDiameter.java[Java] //|{doc_base_url}/1245-tree-diameter.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/palindrome-removal/[1246. Palindrome Removal^] //|{source_base_url}/_1246_PalindromeRemoval.java[Java] //|{doc_base_url}/1246-palindrome-removal.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/minimum-swaps-to-make-strings-equal/[1247. Minimum Swaps to Make Strings Equal^] //|{source_base_url}/_1247_MinimumSwapsToMakeStringsEqual.java[Java] //|{doc_base_url}/1247-minimum-swaps-to-make-strings-equal.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/count-number-of-nice-subarrays/[1248. Count Number of Nice Subarrays^] //|{source_base_url}/_1248_CountNumberOfNiceSubarrays.java[Java] //|{doc_base_url}/1248-count-number-of-nice-subarrays.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/minimum-remove-to-make-valid-parentheses/[1249. Minimum Remove to Make Valid Parentheses^] //|{source_base_url}/_1249_MinimumRemoveToMakeValidParentheses.java[Java] //|{doc_base_url}/1249-minimum-remove-to-make-valid-parentheses.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/check-if-it-is-a-good-array/[1250. Check If It Is a Good Array^] //|{source_base_url}/_1250_CheckIfItIsAGoodArray.java[Java] //|{doc_base_url}/1250-check-if-it-is-a-good-array.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/average-selling-price/[1251. Average Selling Price^] //|{source_base_url}/_1251_AverageSellingPrice.java[Java] //|{doc_base_url}/1251-average-selling-price.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/cells-with-odd-values-in-a-matrix/[1252. Cells with Odd Values in a Matrix^] //|{source_base_url}/_1252_CellsWithOddValuesInAMatrix.java[Java] //|{doc_base_url}/1252-cells-with-odd-values-in-a-matrix.adoc[题解] //|Easy //|

|{counter:codes} |{leetcode_base_url}/reconstruct-a-2-row-binary-matrix/[1253. Reconstruct a 2-Row Binary Matrix^] |{source_base_url}/_1253_ReconstructA2RowBinaryMatrix.java[Java] |{doc_base_url}/1253-reconstruct-a-2-row-binary-matrix.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/number-of-closed-islands/[1254. Number of Closed Islands^] //|{source_base_url}/_1254_NumberOfClosedIslands.java[Java] //|{doc_base_url}/1254-number-of-closed-islands.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/maximum-score-words-formed-by-letters/[1255. Maximum Score Words Formed by Letters^] //|{source_base_url}/_1255_MaximumScoreWordsFormedByLetters.java[Java] //|{doc_base_url}/1255-maximum-score-words-formed-by-letters.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/encode-number/[1256. Encode Number^] //|{source_base_url}/_1256_EncodeNumber.java[Java] //|{doc_base_url}/1256-encode-number.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/smallest-common-region/[1257. Smallest Common Region^] //|{source_base_url}/_1257_SmallestCommonRegion.java[Java] //|{doc_base_url}/1257-smallest-common-region.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/synonymous-sentences/[1258. Synonymous Sentences^] //|{source_base_url}/_1258_SynonymousSentences.java[Java] //|{doc_base_url}/1258-synonymous-sentences.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/handshakes-that-dont-cross/[1259. Handshakes That Don't Cross^] //|{source_base_url}/_1259_HandshakesThatDonTCross.java[Java] //|{doc_base_url}/1259-handshakes-that-dont-cross.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/shift-2d-grid/[1260. Shift 2D Grid^] //|{source_base_url}/_1260_Shift2DGrid.java[Java] //|{doc_base_url}/1260-shift-2d-grid.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/find-elements-in-a-contaminated-binary-tree/[1261. Find Elements in a Contaminated Binary Tree^] //|{source_base_url}/_1261_FindElementsInAContaminatedBinaryTree.java[Java] //|{doc_base_url}/1261-find-elements-in-a-contaminated-binary-tree.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/greatest-sum-divisible-by-three/[1262. Greatest Sum Divisible by Three^] //|{source_base_url}/_1262_GreatestSumDivisibleByThree.java[Java] //|{doc_base_url}/1262-greatest-sum-divisible-by-three.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/minimum-moves-to-move-a-box-to-their-target-location/[1263. Minimum Moves to Move a Box to Their Target Location^] //|{source_base_url}/_1263_MinimumMovesToMoveABoxToTheirTargetLocation.java[Java] //|{doc_base_url}/1263-minimum-moves-to-move-a-box-to-their-target-location.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/page-recommendations/[1264. Page Recommendations^] //|{source_base_url}/_1264_PageRecommendations.java[Java] //|{doc_base_url}/1264-page-recommendations.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/print-immutable-linked-list-in-reverse/[1265. Print Immutable Linked List in Reverse^] //|{source_base_url}/_1265_PrintImmutableLinkedListInReverse.java[Java] //|{doc_base_url}/1265-print-immutable-linked-list-in-reverse.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/minimum-time-visiting-all-points/[1266. Minimum Time Visiting All Points^] //|{source_base_url}/_1266_MinimumTimeVisitingAllPoints.java[Java] //|{doc_base_url}/1266-minimum-time-visiting-all-points.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/count-servers-that-communicate/[1267. Count Servers that Communicate^] //|{source_base_url}/_1267_CountServersThatCommunicate.java[Java] //|{doc_base_url}/1267-count-servers-that-communicate.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/search-suggestions-system/[1268. Search Suggestions System^] //|{source_base_url}/_1268_SearchSuggestionsSystem.java[Java] //|{doc_base_url}/1268-search-suggestions-system.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/number-of-ways-to-stay-in-the-same-place-after-some-steps/[1269. Number of Ways to Stay in the Same Place After Some Steps^] //|{source_base_url}/_1269_NumberOfWaysToStayInTheSamePlaceAfterSomeSteps.java[Java] //|{doc_base_url}/1269-number-of-ways-to-stay-in-the-same-place-after-some-steps.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/all-people-report-to-the-given-manager/[1270. All People Report to the Given Manager^] //|{source_base_url}/_1270_AllPeopleReportToTheGivenManager.java[Java] //|{doc_base_url}/1270-all-people-report-to-the-given-manager.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/hexspeak/[1271. Hexspeak^] //|{source_base_url}/_1271_Hexspeak.java[Java] //|{doc_base_url}/1271-hexspeak.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/remove-interval/[1272. Remove Interval^] //|{source_base_url}/_1272_RemoveInterval.java[Java] //|{doc_base_url}/1272-remove-interval.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/delete-tree-nodes/[1273. Delete Tree Nodes^] //|{source_base_url}/_1273_DeleteTreeNodes.java[Java] //|{doc_base_url}/1273-delete-tree-nodes.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/number-of-ships-in-a-rectangle/[1274. Number of Ships in a Rectangle^] //|{source_base_url}/_1274_NumberOfShipsInARectangle.java[Java] //|{doc_base_url}/1274-number-of-ships-in-a-rectangle.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/find-winner-on-a-tic-tac-toe-game/[1275. Find Winner on a Tic Tac Toe Game^] //|{source_base_url}/_1275_FindWinnerOnATicTacToeGame.java[Java] //|{doc_base_url}/1275-find-winner-on-a-tic-tac-toe-game.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/number-of-burgers-with-no-waste-of-ingredients/[1276. Number of Burgers with No Waste of Ingredients^] //|{source_base_url}/_1276_NumberOfBurgersWithNoWasteOfIngredients.java[Java] //|{doc_base_url}/1276-number-of-burgers-with-no-waste-of-ingredients.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/count-square-submatrices-with-all-ones/[1277. Count Square Submatrices with All Ones^] //|{source_base_url}/_1277_CountSquareSubmatricesWithAllOnes.java[Java] //|{doc_base_url}/1277-count-square-submatrices-with-all-ones.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/palindrome-partitioning-iii/[1278. Palindrome Partitioning III^] //|{source_base_url}/_1278_PalindromePartitioningIII.java[Java] //|{doc_base_url}/1278-palindrome-partitioning-iii.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/traffic-light-controlled-intersection/[1279. Traffic Light Controlled Intersection^] //|{source_base_url}/_1279_TrafficLightControlledIntersection.java[Java] //|{doc_base_url}/1279-traffic-light-controlled-intersection.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/students-and-examinations/[1280. Students and Examinations^] //|{source_base_url}/_1280_StudentsAndExaminations.java[Java] //|{doc_base_url}/1280-students-and-examinations.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/subtract-the-product-and-sum-of-digits-of-an-integer/[1281. Subtract the Product and Sum of Digits of an Integer^] //|{source_base_url}/_1281_SubtractTheProductAndSumOfDigitsOfAnInteger.java[Java] //|{doc_base_url}/1281-subtract-the-product-and-sum-of-digits-of-an-integer.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/group-the-people-given-the-group-size-they-belong-to/[1282. Group the People Given the Group Size They Belong To^] //|{source_base_url}/_1282_GroupThePeopleGivenTheGroupSizeTheyBelongTo.java[Java] //|{doc_base_url}/1282-group-the-people-given-the-group-size-they-belong-to.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/find-the-smallest-divisor-given-a-threshold/[1283. Find the Smallest Divisor Given a Threshold^] //|{source_base_url}/_1283_FindTheSmallestDivisorGivenAThreshold.java[Java] //|{doc_base_url}/1283-find-the-smallest-divisor-given-a-threshold.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix/[1284. Minimum Number of Flips to Convert Binary Matrix to Zero Matrix^] //|{source_base_url}/_1284_MinimumNumberOfFlipsToConvertBinaryMatrixToZeroMatrix.java[Java] //|{doc_base_url}/1284-minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/find-the-start-and-end-number-of-continuous-ranges/[1285. Find the Start and End Number of Continuous Ranges^] //|{source_base_url}/_1285_FindTheStartAndEndNumberOfContinuousRanges.java[Java] //|{doc_base_url}/1285-find-the-start-and-end-number-of-continuous-ranges.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/iterator-for-combination/[1286. Iterator for Combination^] //|{source_base_url}/_1286_IteratorForCombination.java[Java] //|{doc_base_url}/1286-iterator-for-combination.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/element-appearing-more-than-25-in-sorted-array/[1287. Element Appearing More Than 25% In Sorted Array^] //|{source_base_url}/_1287_ElementAppearingMoreThan25InSortedArray.java[Java] //|{doc_base_url}/1287-element-appearing-more-than-25-in-sorted-array.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/remove-covered-intervals/[1288. Remove Covered Intervals^] //|{source_base_url}/_1288_RemoveCoveredIntervals.java[Java] //|{doc_base_url}/1288-remove-covered-intervals.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/minimum-falling-path-sum-ii/[1289. Minimum Falling Path Sum II^] //|{source_base_url}/_1289_MinimumFallingPathSumII.java[Java] //|{doc_base_url}/1289-minimum-falling-path-sum-ii.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/convert-binary-number-in-a-linked-list-to-integer/[1290. Convert Binary Number in a Linked List to Integer^] //|{source_base_url}/_1290_ConvertBinaryNumberInALinkedListToInteger.java[Java] //|{doc_base_url}/1290-convert-binary-number-in-a-linked-list-to-integer.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/sequential-digits/[1291. Sequential Digits^] //|{source_base_url}/_1291_SequentialDigits.java[Java] //|{doc_base_url}/1291-sequential-digits.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold/[1292. Maximum Side Length of a Square with Sum Less than or Equal to Threshold^] //|{source_base_url}/_1292_MaximumSideLengthOfASquareWithSumLessThanOrEqualToThreshold.java[Java] //|{doc_base_url}/1292-maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/shortest-path-in-a-grid-with-obstacles-elimination/[1293. Shortest Path in a Grid with Obstacles Elimination^] //|{source_base_url}/_1293_ShortestPathInAGridWithObstaclesElimination.java[Java] //|{doc_base_url}/1293-shortest-path-in-a-grid-with-obstacles-elimination.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/weather-type-in-each-country/[1294. Weather Type in Each Country^] //|{source_base_url}/_1294_WeatherTypeInEachCountry.java[Java] //|{doc_base_url}/1294-weather-type-in-each-country.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/find-numbers-with-even-number-of-digits/[1295. Find Numbers with Even Number of Digits^] //|{source_base_url}/_1295_FindNumbersWithEvenNumberOfDigits.java[Java] //|{doc_base_url}/1295-find-numbers-with-even-number-of-digits.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/divide-array-in-sets-of-k-consecutive-numbers/[1296. Divide Array in Sets of K Consecutive Numbers^] //|{source_base_url}/_1296_DivideArrayInSetsOfKConsecutiveNumbers.java[Java] //|{doc_base_url}/1296-divide-array-in-sets-of-k-consecutive-numbers.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/maximum-number-of-occurrences-of-a-substring/[1297. Maximum Number of Occurrences of a Substring^] //|{source_base_url}/_1297_MaximumNumberOfOccurrencesOfASubstring.java[Java] //|{doc_base_url}/1297-maximum-number-of-occurrences-of-a-substring.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/maximum-candies-you-can-get-from-boxes/[1298. Maximum Candies You Can Get from Boxes^] //|{source_base_url}/_1298_MaximumCandiesYouCanGetFromBoxes.java[Java] //|{doc_base_url}/1298-maximum-candies-you-can-get-from-boxes.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/replace-elements-with-greatest-element-on-right-side/[1299. Replace Elements with Greatest Element on Right Side^] //|{source_base_url}/_1299_ReplaceElementsWithGreatestElementOnRightSide.java[Java] //|{doc_base_url}/1299-replace-elements-with-greatest-element-on-right-side.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/sum-of-mutated-array-closest-to-target/[1300. Sum of Mutated Array Closest to Target^] //|{source_base_url}/_1300_SumOfMutatedArrayClosestToTarget.java[Java] //|{doc_base_url}/1300-sum-of-mutated-array-closest-to-target.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/number-of-paths-with-max-score/[1301. Number of Paths with Max Score^] //|{source_base_url}/_1301_NumberOfPathsWithMaxScore.java[Java] //|{doc_base_url}/1301-number-of-paths-with-max-score.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/deepest-leaves-sum/[1302. Deepest Leaves Sum^] //|{source_base_url}/_1302_DeepestLeavesSum.java[Java] //|{doc_base_url}/1302-deepest-leaves-sum.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/find-the-team-size/[1303. Find the Team Size^] //|{source_base_url}/_1303_FindTheTeamSize.java[Java] //|{doc_base_url}/1303-find-the-team-size.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/find-n-unique-integers-sum-up-to-zero/[1304. Find N Unique Integers Sum up to Zero^] //|{source_base_url}/_1304_FindNUniqueIntegersSumUpToZero.java[Java] //|{doc_base_url}/1304-find-n-unique-integers-sum-up-to-zero.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/all-elements-in-two-binary-search-trees/[1305. All Elements in Two Binary Search Trees^] //|{source_base_url}/_1305_AllElementsInTwoBinarySearchTrees.java[Java] //|{doc_base_url}/1305-all-elements-in-two-binary-search-trees.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/jump-game-iii/[1306. Jump Game III^] //|{source_base_url}/_1306_JumpGameIII.java[Java] //|{doc_base_url}/1306-jump-game-iii.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/verbal-arithmetic-puzzle/[1307. Verbal Arithmetic Puzzle^] //|{source_base_url}/_1307_VerbalArithmeticPuzzle.java[Java] //|{doc_base_url}/1307-verbal-arithmetic-puzzle.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/running-total-for-different-genders/[1308. Running Total for Different Genders^] //|{source_base_url}/_1308_RunningTotalForDifferentGenders.java[Java] //|{doc_base_url}/1308-running-total-for-different-genders.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/decrypt-string-from-alphabet-to-integer-mapping/[1309. Decrypt String from Alphabet to Integer Mapping^] //|{source_base_url}/_1309_DecryptStringFromAlphabetToIntegerMapping.java[Java] //|{doc_base_url}/1309-decrypt-string-from-alphabet-to-integer-mapping.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/xor-queries-of-a-subarray/[1310. XOR Queries of a Subarray^] //|{source_base_url}/_1310_XORQueriesOfASubarray.java[Java] //|{doc_base_url}/1310-xor-queries-of-a-subarray.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/get-watched-videos-by-your-friends/[1311. Get Watched Videos by Your Friends^] //|{source_base_url}/_1311_GetWatchedVideosByYourFriends.java[Java] //|{doc_base_url}/1311-get-watched-videos-by-your-friends.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/minimum-insertion-steps-to-make-a-string-palindrome/[1312. Minimum Insertion Steps to Make a String Palindrome^] //|{source_base_url}/_1312_MinimumInsertionStepsToMakeAStringPalindrome.java[Java] //|{doc_base_url}/1312-minimum-insertion-steps-to-make-a-string-palindrome.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/decompress-run-length-encoded-list/[1313. Decompress Run-Length Encoded List^] //|{source_base_url}/_1313_DecompressRunLengthEncodedList.java[Java] //|{doc_base_url}/1313-decompress-run-length-encoded-list.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/matrix-block-sum/[1314. Matrix Block Sum^] //|{source_base_url}/_1314_MatrixBlockSum.java[Java] //|{doc_base_url}/1314-matrix-block-sum.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/sum-of-nodes-with-even-valued-grandparent/[1315. Sum of Nodes with Even-Valued Grandparent^] //|{source_base_url}/_1315_SumOfNodesWithEvenValuedGrandparent.java[Java] //|{doc_base_url}/1315-sum-of-nodes-with-even-valued-grandparent.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/distinct-echo-substrings/[1316. Distinct Echo Substrings^] //|{source_base_url}/_1316_DistinctEchoSubstrings.java[Java] //|{doc_base_url}/1316-distinct-echo-substrings.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/convert-integer-to-the-sum-of-two-no-zero-integers/[1317. Convert Integer to the Sum of Two No-Zero Integers^] //|{source_base_url}/_1317_ConvertIntegerToTheSumOfTwoNoZeroIntegers.java[Java] //|{doc_base_url}/1317-convert-integer-to-the-sum-of-two-no-zero-integers.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/minimum-flips-to-make-a-or-b-equal-to-c/[1318. Minimum Flips to Make a OR b Equal to c^] //|{source_base_url}/_1318_MinimumFlipsToMakeAORBEqualToC.java[Java] //|{doc_base_url}/1318-minimum-flips-to-make-a-or-b-equal-to-c.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/number-of-operations-to-make-network-connected/[1319. Number of Operations to Make Network Connected^] //|{source_base_url}/_1319_NumberOfOperationsToMakeNetworkConnected.java[Java] //|{doc_base_url}/1319-number-of-operations-to-make-network-connected.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/minimum-distance-to-type-a-word-using-two-fingers/[1320. Minimum Distance to Type a Word Using Two Fingers^] //|{source_base_url}/_1320_MinimumDistanceToTypeAWordUsingTwoFingers.java[Java] //|{doc_base_url}/1320-minimum-distance-to-type-a-word-using-two-fingers.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/restaurant-growth/[1321. Restaurant Growth^] //|{source_base_url}/_1321_RestaurantGrowth.java[Java] //|{doc_base_url}/1321-restaurant-growth.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/ads-performance/[1322. Ads Performance^] //|{source_base_url}/_1322_AdsPerformance.java[Java] //|{doc_base_url}/1322-ads-performance.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/maximum-69-number/[1323. Maximum 69 Number^] //|{source_base_url}/_1323_Maximum69Number.java[Java] //|{doc_base_url}/1323-maximum-69-number.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/print-words-vertically/[1324. Print Words Vertically^] //|{source_base_url}/_1324_PrintWordsVertically.java[Java] //|{doc_base_url}/1324-print-words-vertically.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/delete-leaves-with-a-given-value/[1325. Delete Leaves With a Given Value^] //|{source_base_url}/_1325_DeleteLeavesWithAGivenValue.java[Java] //|{doc_base_url}/1325-delete-leaves-with-a-given-value.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/minimum-number-of-taps-to-open-to-water-a-garden/[1326. Minimum Number of Taps to Open to Water a Garden^] //|{source_base_url}/_1326_MinimumNumberOfTapsToOpenToWaterAGarden.java[Java] //|{doc_base_url}/1326-minimum-number-of-taps-to-open-to-water-a-garden.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/list-the-products-ordered-in-a-period/[1327. List the Products Ordered in a Period^] //|{source_base_url}/_1327_ListTheProductsOrderedInAPeriod.java[Java] //|{doc_base_url}/1327-list-the-products-ordered-in-a-period.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/break-a-palindrome/[1328. Break a Palindrome^] //|{source_base_url}/_1328_BreakAPalindrome.java[Java] //|{doc_base_url}/1328-break-a-palindrome.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/sort-the-matrix-diagonally/[1329. Sort the Matrix Diagonally^] //|{source_base_url}/_1329_SortTheMatrixDiagonally.java[Java] //|{doc_base_url}/1329-sort-the-matrix-diagonally.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/reverse-subarray-to-maximize-array-value/[1330. Reverse Subarray To Maximize Array Value^] //|{source_base_url}/_1330_ReverseSubarrayToMaximizeArrayValue.java[Java] //|{doc_base_url}/1330-reverse-subarray-to-maximize-array-value.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/rank-transform-of-an-array/[1331. Rank Transform of an Array^] //|{source_base_url}/_1331_RankTransformOfAnArray.java[Java] //|{doc_base_url}/1331-rank-transform-of-an-array.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/remove-palindromic-subsequences/[1332. Remove Palindromic Subsequences^] //|{source_base_url}/_1332_RemovePalindromicSubsequences.java[Java] //|{doc_base_url}/1332-remove-palindromic-subsequences.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/filter-restaurants-by-vegan-friendly-price-and-distance/[1333. Filter Restaurants by Vegan-Friendly, Price and Distance^] //|{source_base_url}/_1333_FilterRestaurantsByVeganFriendlyPriceAndDistance.java[Java] //|{doc_base_url}/1333-filter-restaurants-by-vegan-friendly-price-and-distance.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance/[1334. Find the City With the Smallest Number of Neighbors at a Threshold Distance^] //|{source_base_url}/_1334_FindTheCityWithTheSmallestNumberOfNeighborsAtAThresholdDistance.java[Java] //|{doc_base_url}/1334-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/minimum-difficulty-of-a-job-schedule/[1335. Minimum Difficulty of a Job Schedule^] //|{source_base_url}/_1335_MinimumDifficultyOfAJobSchedule.java[Java] //|{doc_base_url}/1335-minimum-difficulty-of-a-job-schedule.adoc[题解] //|Hard //| // //|{counter:codes} //|{leetcode_base_url}/number-of-transactions-per-visit/[1336. Number of Transactions per Visit^] //|{source_base_url}/_1336_NumberOfTransactionsPerVisit.java[Java] //|{doc_base_url}/1336-number-of-transactions-per-visit.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/the-k-weakest-rows-in-a-matrix/[1337. The K Weakest Rows in a Matrix^] //|{source_base_url}/_1337_TheKWeakestRowsInAMatrix.java[Java] //|{doc_base_url}/1337-the-k-weakest-rows-in-a-matrix.adoc[题解] //|Easy //| // //|{counter:codes} //|{leetcode_base_url}/reduce-array-size-to-the-half/[1338. Reduce Array Size to The Half^] //|{source_base_url}/_1338_ReduceArraySizeToTheHalf.java[Java] //|{doc_base_url}/1338-reduce-array-size-to-the-half.adoc[题解] //|Medium //| // //|{counter:codes} //|{leetcode_base_url}/maximum-product-of-splitted-binary-tree/[1339. Maximum Product of Splitted Binary Tree^] //|{source_base_url}/_1339_MaximumProductOfSplittedBinaryTree.java[Java] //|{doc_base_url}/1339-maximum-product-of-splitted-binary-tree.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/jump-game-v/[1340. Jump Game V^] //|{source_base_url}/_1340_JumpGameV.java[Java] //|{doc_base_url}/1340-jump-game-v.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/movie-rating/[1341. Movie Rating^] //|{source_base_url}/_1341_MovieRating.java[Java] //|{doc_base_url}/1341-movie-rating.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/number-of-steps-to-reduce-a-number-to-zero/[1342. Number of Steps to Reduce a Number to Zero^] //|{source_base_url}/_1342_NumberOfStepsToReduceANumberToZero.java[Java] //|{doc_base_url}/1342-number-of-steps-to-reduce-a-number-to-zero.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold/[1343. Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold^] //|{source_base_url}/_1343_NumberOfSubArraysOfSizeKAndAverageGreaterThanOrEqualToThreshold.java[Java] //|{doc_base_url}/1343-number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/angle-between-hands-of-a-clock/[1344. Angle Between Hands of a Clock^] //|{source_base_url}/_1344_AngleBetweenHandsOfAClock.java[Java] //|{doc_base_url}/1344-angle-between-hands-of-a-clock.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/jump-game-iv/[1345. Jump Game IV^] //|{source_base_url}/_1345_JumpGameIv.java[Java] //|{doc_base_url}/1345-jump-game-iv.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/check-if-n-and-its-double-exist/[1346. Check If N and Its Double Exist^] //|{source_base_url}/_1346_CheckIfNAndItsDoubleExist.java[Java] //|{doc_base_url}/1346-check-if-n-and-its-double-exist.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/minimum-number-of-steps-to-make-two-strings-anagram/[1347. Minimum Number of Steps to Make Two Strings Anagram^] //|{source_base_url}/_1347_MinimumNumberOfStepsToMakeTwoStringsAnagram.java[Java] //|{doc_base_url}/1347-minimum-number-of-steps-to-make-two-strings-anagram.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/tweet-counts-per-frequency/[1348. Tweet Counts Per Frequency^] //|{source_base_url}/_1348_TweetCountsPerFrequency.java[Java] //|{doc_base_url}/1348-tweet-counts-per-frequency.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-students-taking-exam/[1349. Maximum Students Taking Exam^] //|{source_base_url}/_1349_MaximumStudentsTakingExam.java[Java] //|{doc_base_url}/1349-maximum-students-taking-exam.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/students-with-invalid-departments/[1350. Students With Invalid Departments^] //|{source_base_url}/_1350_StudentsWithInvalidDepartments.java[Java] //|{doc_base_url}/1350-students-with-invalid-departments.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/count-negative-numbers-in-a-sorted-matrix/[1351. Count Negative Numbers in a Sorted Matrix^] //|{source_base_url}/_1351_CountNegativeNumbersInASortedMatrix.java[Java] //|{doc_base_url}/1351-count-negative-numbers-in-a-sorted-matrix.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/product-of-the-last-k-numbers/[1352. Product of the Last K Numbers^] //|{source_base_url}/_1352_ProductOfTheLastKNumbers.java[Java] //|{doc_base_url}/1352-product-of-the-last-k-numbers.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-number-of-events-that-can-be-attended/[1353. Maximum Number of Events That Can Be Attended^] //|{source_base_url}/_1353_MaximumNumberOfEventsThatCanBeAttended.java[Java] //|{doc_base_url}/1353-maximum-number-of-events-that-can-be-attended.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/construct-target-array-with-multiple-sums/[1354. Construct Target Array With Multiple Sums^] //|{source_base_url}/_1354_ConstructTargetArrayWithMultipleSums.java[Java] //|{doc_base_url}/1354-construct-target-array-with-multiple-sums.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/activity-participants/[1355. Activity Participants^] //|{source_base_url}/_1355_ActivityParticipants.java[Java] //|{doc_base_url}/1355-activity-participants.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/sort-integers-by-the-number-of-1-bits/[1356. Sort Integers by The Number of 1 Bits^] //|{source_base_url}/_1356_SortIntegersByTheNumberOf1Bits.java[Java] //|{doc_base_url}/1356-sort-integers-by-the-number-of-1-bits.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/apply-discount-every-n-orders/[1357. Apply Discount Every n Orders^] //|{source_base_url}/_1357_ApplyDiscountEveryNOrders.java[Java] //|{doc_base_url}/1357-apply-discount-every-n-orders.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/number-of-substrings-containing-all-three-characters/[1358. Number of Substrings Containing All Three Characters^] //|{source_base_url}/_1358_NumberOfSubstringsContainingAllThreeCharacters.java[Java] //|{doc_base_url}/1358-number-of-substrings-containing-all-three-characters.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-all-valid-pickup-and-delivery-options/[1359. Count All Valid Pickup and Delivery Options^] //|{source_base_url}/_1359_CountAllValidPickupAndDeliveryOptions.java[Java] //|{doc_base_url}/1359-count-all-valid-pickup-and-delivery-options.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/number-of-days-between-two-dates/[1360. Number of Days Between Two Dates^] //|{source_base_url}/_1360_NumberOfDaysBetweenTwoDates.java[Java] //|{doc_base_url}/1360-number-of-days-between-two-dates.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/validate-binary-tree-nodes/[1361. Validate Binary Tree Nodes^] //|{source_base_url}/_1361_ValidateBinaryTreeNodes.java[Java] //|{doc_base_url}/1361-validate-binary-tree-nodes.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/closest-divisors/[1362. Closest Divisors^] //|{source_base_url}/_1362_ClosestDivisors.java[Java] //|{doc_base_url}/1362-closest-divisors.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/largest-multiple-of-three/[1363. Largest Multiple of Three^] //|{source_base_url}/_1363_LargestMultipleOfThree.java[Java] //|{doc_base_url}/1363-largest-multiple-of-three.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/number-of-trusted-contacts-of-a-customer/[1364. Number of Trusted Contacts of a Customer^] //|{source_base_url}/_1364_NumberOfTrustedContactsOfACustomer.java[Java] //|{doc_base_url}/1364-number-of-trusted-contacts-of-a-customer.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/how-many-numbers-are-smaller-than-the-current-number/[1365. How Many Numbers Are Smaller Than the Current Number^] //|{source_base_url}/_1365_HowManyNumbersAreSmallerThanTheCurrentNumber.java[Java] //|{doc_base_url}/1365-how-many-numbers-are-smaller-than-the-current-number.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/rank-teams-by-votes/[1366. Rank Teams by Votes^] //|{source_base_url}/_1366_RankTeamsByVotes.java[Java] //|{doc_base_url}/1366-rank-teams-by-votes.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/linked-list-in-binary-tree/[1367. Linked List in Binary Tree^] //|{source_base_url}/_1367_LinkedListInBinaryTree.java[Java] //|{doc_base_url}/1367-linked-list-in-binary-tree.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-cost-to-make-at-least-one-valid-path-in-a-grid/[1368. Minimum Cost to Make at Least One Valid Path in a Grid^] //|{source_base_url}/_1368_MinimumCostToMakeAtLeastOneValidPathInAGrid.java[Java] //|{doc_base_url}/1368-minimum-cost-to-make-at-least-one-valid-path-in-a-grid.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/get-the-second-most-recent-activity/[1369. Get the Second Most Recent Activity^] //|{source_base_url}/_1369_GetTheSecondMostRecentActivity.java[Java] //|{doc_base_url}/1369-get-the-second-most-recent-activity.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/increasing-decreasing-string/[1370. Increasing Decreasing String^] //|{source_base_url}/_1370_IncreasingDecreasingString.java[Java] //|{doc_base_url}/1370-increasing-decreasing-string.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/find-the-longest-substring-containing-vowels-in-even-counts/[1371. Find the Longest Substring Containing Vowels in Even Counts^] //|{source_base_url}/_1371_FindTheLongestSubstringContainingVowelsInEvenCounts.java[Java] //|{doc_base_url}/1371-find-the-longest-substring-containing-vowels-in-even-counts.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/longest-zigzag-path-in-a-binary-tree/[1372. Longest ZigZag Path in a Binary Tree^] //|{source_base_url}/_1372_LongestZigzagPathInABinaryTree.java[Java] //|{doc_base_url}/1372-longest-zigzag-path-in-a-binary-tree.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-sum-bst-in-binary-tree/[1373. Maximum Sum BST in Binary Tree^] //|{source_base_url}/_1373_MaximumSumBstInBinaryTree.java[Java] //|{doc_base_url}/1373-maximum-sum-bst-in-binary-tree.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/generate-a-string-with-characters-that-have-odd-counts/[1374. Generate a String With Characters That Have Odd Counts^] //|{source_base_url}/_1374_GenerateAStringWithCharactersThatHaveOddCounts.java[Java] //|{doc_base_url}/1374-generate-a-string-with-characters-that-have-odd-counts.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/number-of-times-binary-string-is-prefix-aligned/[1375. Number of Times Binary String Is Prefix-Aligned^] //|{source_base_url}/_1375_NumberOfTimesBinaryStringIsPrefixAligned.java[Java] //|{doc_base_url}/1375-number-of-times-binary-string-is-prefix-aligned.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/time-needed-to-inform-all-employees/[1376. Time Needed to Inform All Employees^] //|{source_base_url}/_1376_TimeNeededToInformAllEmployees.java[Java] //|{doc_base_url}/1376-time-needed-to-inform-all-employees.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/frog-position-after-t-seconds/[1377. Frog Position After T Seconds^] //|{source_base_url}/_1377_FrogPositionAfterTSeconds.java[Java] //|{doc_base_url}/1377-frog-position-after-t-seconds.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/replace-employee-id-with-the-unique-identifier/[1378. Replace Employee ID With The Unique Identifier^] //|{source_base_url}/_1378_ReplaceEmployeeIdWithTheUniqueIdentifier.java[Java] //|{doc_base_url}/1378-replace-employee-id-with-the-unique-identifier.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree/[1379. Find a Corresponding Node of a Binary Tree in a Clone of That Tree^] //|{source_base_url}/_1379_FindACorrespondingNodeOfABinaryTreeInACloneOfThatTree.java[Java] //|{doc_base_url}/1379-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/lucky-numbers-in-a-matrix/[1380. Lucky Numbers in a Matrix^] //|{source_base_url}/_1380_LuckyNumbersInAMatrix.java[Java] //|{doc_base_url}/1380-lucky-numbers-in-a-matrix.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/design-a-stack-with-increment-operation/[1381. Design a Stack With Increment Operation^] //|{source_base_url}/_1381_DesignAStackWithIncrementOperation.java[Java] //|{doc_base_url}/1381-design-a-stack-with-increment-operation.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/balance-a-binary-search-tree/[1382. Balance a Binary Search Tree^] //|{source_base_url}/_1382_BalanceABinarySearchTree.java[Java] //|{doc_base_url}/1382-balance-a-binary-search-tree.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-performance-of-a-team/[1383. Maximum Performance of a Team^] //|{source_base_url}/_1383_MaximumPerformanceOfATeam.java[Java] //|{doc_base_url}/1383-maximum-performance-of-a-team.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/total-sales-amount-by-year/[1384. Total Sales Amount by Year^] //|{source_base_url}/_1384_TotalSalesAmountByYear.java[Java] //|{doc_base_url}/1384-total-sales-amount-by-year.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/find-the-distance-value-between-two-arrays/[1385. Find the Distance Value Between Two Arrays^] //|{source_base_url}/_1385_FindTheDistanceValueBetweenTwoArrays.java[Java] //|{doc_base_url}/1385-find-the-distance-value-between-two-arrays.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/cinema-seat-allocation/[1386. Cinema Seat Allocation^] //|{source_base_url}/_1386_CinemaSeatAllocation.java[Java] //|{doc_base_url}/1386-cinema-seat-allocation.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/sort-integers-by-the-power-value/[1387. Sort Integers by The Power Value^] //|{source_base_url}/_1387_SortIntegersByThePowerValue.java[Java] //|{doc_base_url}/1387-sort-integers-by-the-power-value.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/pizza-with-3n-slices/[1388. Pizza With 3n Slices^] //|{source_base_url}/_1388_PizzaWith3NSlices.java[Java] //|{doc_base_url}/1388-pizza-with-3n-slices.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/create-target-array-in-the-given-order/[1389. Create Target Array in the Given Order^] //|{source_base_url}/_1389_CreateTargetArrayInTheGivenOrder.java[Java] //|{doc_base_url}/1389-create-target-array-in-the-given-order.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/four-divisors/[1390. Four Divisors^] //|{source_base_url}/_1390_FourDivisors.java[Java] //|{doc_base_url}/1390-four-divisors.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/check-if-there-is-a-valid-path-in-a-grid/[1391. Check if There is a Valid Path in a Grid^] //|{source_base_url}/_1391_CheckIfThereIsAValidPathInAGrid.java[Java] //|{doc_base_url}/1391-check-if-there-is-a-valid-path-in-a-grid.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/longest-happy-prefix/[1392. Longest Happy Prefix^] //|{source_base_url}/_1392_LongestHappyPrefix.java[Java] //|{doc_base_url}/1392-longest-happy-prefix.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/capital-gainloss/[1393. Capital Gain/Loss^] //|{source_base_url}/_1393_CapitalGainLoss.java[Java] //|{doc_base_url}/1393-capital-gainloss.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-lucky-integer-in-an-array/[1394. Find Lucky Integer in an Array^] //|{source_base_url}/_1394_FindLuckyIntegerInAnArray.java[Java] //|{doc_base_url}/1394-find-lucky-integer-in-an-array.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/count-number-of-teams/[1395. Count Number of Teams^] //|{source_base_url}/_1395_CountNumberOfTeams.java[Java] //|{doc_base_url}/1395-count-number-of-teams.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/design-underground-system/[1396. Design Underground System^] //|{source_base_url}/_1396_DesignUndergroundSystem.java[Java] //|{doc_base_url}/1396-design-underground-system.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-all-good-strings/[1397. Find All Good Strings^] //|{source_base_url}/_1397_FindAllGoodStrings.java[Java] //|{doc_base_url}/1397-find-all-good-strings.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/customers-who-bought-products-a-and-b-but-not-c/[1398. Customers Who Bought Products A and B but Not C^] //|{source_base_url}/_1398_CustomersWhoBoughtProductsAAndBButNotC.java[Java] //|{doc_base_url}/1398-customers-who-bought-products-a-and-b-but-not-c.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-largest-group/[1399. Count Largest Group^] //|{source_base_url}/_1399_CountLargestGroup.java[Java] //|{doc_base_url}/1399-count-largest-group.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/construct-k-palindrome-strings/[1400. Construct K Palindrome Strings^] //|{source_base_url}/_1400_ConstructKPalindromeStrings.java[Java] //|{doc_base_url}/1400-construct-k-palindrome-strings.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/circle-and-rectangle-overlapping/[1401. Circle and Rectangle Overlapping^] //|{source_base_url}/_1401_CircleAndRectangleOverlapping.java[Java] //|{doc_base_url}/1401-circle-and-rectangle-overlapping.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/reducing-dishes/[1402. Reducing Dishes^] //|{source_base_url}/_1402_ReducingDishes.java[Java] //|{doc_base_url}/1402-reducing-dishes.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/minimum-subsequence-in-non-increasing-order/[1403. Minimum Subsequence in Non-Increasing Order^] //|{source_base_url}/_1403_MinimumSubsequenceInNonIncreasingOrder.java[Java] //|{doc_base_url}/1403-minimum-subsequence-in-non-increasing-order.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/number-of-steps-to-reduce-a-number-in-binary-representation-to-one/[1404. Number of Steps to Reduce a Number in Binary Representation to One^] //|{source_base_url}/_1404_NumberOfStepsToReduceANumberInBinaryRepresentationToOne.java[Java] //|{doc_base_url}/1404-number-of-steps-to-reduce-a-number-in-binary-representation-to-one.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/longest-happy-string/[1405. Longest Happy String^] //|{source_base_url}/_1405_LongestHappyString.java[Java] //|{doc_base_url}/1405-longest-happy-string.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/stone-game-iii/[1406. Stone Game III^] //|{source_base_url}/_1406_StoneGameIii.java[Java] //|{doc_base_url}/1406-stone-game-iii.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/top-travellers/[1407. Top Travellers^] //|{source_base_url}/_1407_TopTravellers.java[Java] //|{doc_base_url}/1407-top-travellers.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/string-matching-in-an-array/[1408. String Matching in an Array^] //|{source_base_url}/_1408_StringMatchingInAnArray.java[Java] //|{doc_base_url}/1408-string-matching-in-an-array.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/queries-on-a-permutation-with-key/[1409. Queries on a Permutation With Key^] //|{source_base_url}/_1409_QueriesOnAPermutationWithKey.java[Java] //|{doc_base_url}/1409-queries-on-a-permutation-with-key.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/html-entity-parser/[1410. HTML Entity Parser^] //|{source_base_url}/_1410_HtmlEntityParser.java[Java] //|{doc_base_url}/1410-html-entity-parser.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/number-of-ways-to-paint-n-3-grid/[1411. Number of Ways to Paint N × 3 Grid^] //|{source_base_url}/_1411_NumberOfWaysToPaintN3Grid.java[Java] //|{doc_base_url}/1411-number-of-ways-to-paint-n-3-grid.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/find-the-quiet-students-in-all-exams/[1412. Find the Quiet Students in All Exams^] //|{source_base_url}/_1412_FindTheQuietStudentsInAllExams.java[Java] //|{doc_base_url}/1412-find-the-quiet-students-in-all-exams.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/minimum-value-to-get-positive-step-by-step-sum/[1413. Minimum Value to Get Positive Step by Step Sum^] //|{source_base_url}/_1413_MinimumValueToGetPositiveStepByStepSum.java[Java] //|{doc_base_url}/1413-minimum-value-to-get-positive-step-by-step-sum.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k/[1414. Find the Minimum Number of Fibonacci Numbers Whose Sum Is K^] //|{source_base_url}/_1414_FindTheMinimumNumberOfFibonacciNumbersWhoseSumIsK.java[Java] //|{doc_base_url}/1414-find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/the-k-th-lexicographical-string-of-all-happy-strings-of-length-n/[1415. The k-th Lexicographical String of All Happy Strings of Length n^] //|{source_base_url}/_1415_TheKThLexicographicalStringOfAllHappyStringsOfLengthN.java[Java] //|{doc_base_url}/1415-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/restore-the-array/[1416. Restore The Array^] //|{source_base_url}/_1416_RestoreTheArray.java[Java] //|{doc_base_url}/1416-restore-the-array.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/reformat-the-string/[1417. Reformat The String^] //|{source_base_url}/_1417_ReformatTheString.java[Java] //|{doc_base_url}/1417-reformat-the-string.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/display-table-of-food-orders-in-a-restaurant/[1418. Display Table of Food Orders in a Restaurant^] //|{source_base_url}/_1418_DisplayTableOfFoodOrdersInARestaurant.java[Java] //|{doc_base_url}/1418-display-table-of-food-orders-in-a-restaurant.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-number-of-frogs-croaking/[1419. Minimum Number of Frogs Croaking^] //|{source_base_url}/_1419_MinimumNumberOfFrogsCroaking.java[Java] //|{doc_base_url}/1419-minimum-number-of-frogs-croaking.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/build-array-where-you-can-find-the-maximum-exactly-k-comparisons/[1420. Build Array Where You Can Find The Maximum Exactly K Comparisons^] //|{source_base_url}/_1420_BuildArrayWhereYouCanFindTheMaximumExactlyKComparisons.java[Java] //|{doc_base_url}/1420-build-array-where-you-can-find-the-maximum-exactly-k-comparisons.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/npv-queries/[1421. NPV Queries^] //|{source_base_url}/_1421_NpvQueries.java[Java] //|{doc_base_url}/1421-npv-queries.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/maximum-score-after-splitting-a-string/[1422. Maximum Score After Splitting a String^] //|{source_base_url}/_1422_MaximumScoreAfterSplittingAString.java[Java] //|{doc_base_url}/1422-maximum-score-after-splitting-a-string.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/maximum-points-you-can-obtain-from-cards/[1423. Maximum Points You Can Obtain from Cards^] //|{source_base_url}/_1423_MaximumPointsYouCanObtainFromCards.java[Java] //|{doc_base_url}/1423-maximum-points-you-can-obtain-from-cards.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/diagonal-traverse-ii/[1424. Diagonal Traverse II^] //|{source_base_url}/_1424_DiagonalTraverseIi.java[Java] //|{doc_base_url}/1424-diagonal-traverse-ii.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/constrained-subsequence-sum/[1425. Constrained Subsequence Sum^] //|{source_base_url}/_1425_ConstrainedSubsequenceSum.java[Java] //|{doc_base_url}/1425-constrained-subsequence-sum.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/counting-elements/[1426. Counting Elements^] //|{source_base_url}/_1426_CountingElements.java[Java] //|{doc_base_url}/1426-counting-elements.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/perform-string-shifts/[1427. Perform String Shifts^] //|{source_base_url}/_1427_PerformStringShifts.java[Java] //|{doc_base_url}/1427-perform-string-shifts.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/leftmost-column-with-at-least-a-one/[1428. Leftmost Column with at Least a One^] //|{source_base_url}/_1428_LeftmostColumnWithAtLeastAOne.java[Java] //|{doc_base_url}/1428-leftmost-column-with-at-least-a-one.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/first-unique-number/[1429. First Unique Number^] //|{source_base_url}/_1429_FirstUniqueNumber.java[Java] //|{doc_base_url}/1429-first-unique-number.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree/[1430. Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree^] //|{source_base_url}/_1430_CheckIfAStringIsAValidSequenceFromRootToLeavesPathInABinaryTree.java[Java] //|{doc_base_url}/1430-check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/kids-with-the-greatest-number-of-candies/[1431. Kids With the Greatest Number of Candies^] //|{source_base_url}/_1431_KidsWithTheGreatestNumberOfCandies.java[Java] //|{doc_base_url}/1431-kids-with-the-greatest-number-of-candies.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/max-difference-you-can-get-from-changing-an-integer/[1432. Max Difference You Can Get From Changing an Integer^] //|{source_base_url}/_1432_MaxDifferenceYouCanGetFromChangingAnInteger.java[Java] //|{doc_base_url}/1432-max-difference-you-can-get-from-changing-an-integer.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/check-if-a-string-can-break-another-string/[1433. Check If a String Can Break Another String^] //|{source_base_url}/_1433_CheckIfAStringCanBreakAnotherString.java[Java] //|{doc_base_url}/1433-check-if-a-string-can-break-another-string.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/number-of-ways-to-wear-different-hats-to-each-other/[1434. Number of Ways to Wear Different Hats to Each Other^] //|{source_base_url}/_1434_NumberOfWaysToWearDifferentHatsToEachOther.java[Java] //|{doc_base_url}/1434-number-of-ways-to-wear-different-hats-to-each-other.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/create-a-session-bar-chart/[1435. Create a Session Bar Chart^] //|{source_base_url}/_1435_CreateASessionBarChart.java[Java] //|{doc_base_url}/1435-create-a-session-bar-chart.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/destination-city/[1436. Destination City^] //|{source_base_url}/_1436_DestinationCity.java[Java] //|{doc_base_url}/1436-destination-city.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/check-if-all-1s-are-at-least-length-k-places-away/[1437. Check If All 1's Are at Least Length K Places Away^] //|{source_base_url}/_1437_CheckIfAll1SAreAtLeastLengthKPlacesAway.java[Java] //|{doc_base_url}/1437-check-if-all-1s-are-at-least-length-k-places-away.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit/[1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit^] //|{source_base_url}/_1438_LongestContinuousSubarrayWithAbsoluteDiffLessThanOrEqualToLimit.java[Java] //|{doc_base_url}/1438-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows/[1439. Find the Kth Smallest Sum of a Matrix With Sorted Rows^] //|{source_base_url}/_1439_FindTheKthSmallestSumOfAMatrixWithSortedRows.java[Java] //|{doc_base_url}/1439-find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/evaluate-boolean-expression/[1440. Evaluate Boolean Expression^] //|{source_base_url}/_1440_EvaluateBooleanExpression.java[Java] //|{doc_base_url}/1440-evaluate-boolean-expression.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/build-an-array-with-stack-operations/[1441. Build an Array With Stack Operations^] //|{source_base_url}/_1441_BuildAnArrayWithStackOperations.java[Java] //|{doc_base_url}/1441-build-an-array-with-stack-operations.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-triplets-that-can-form-two-arrays-of-equal-xor/[1442. Count Triplets That Can Form Two Arrays of Equal XOR^] //|{source_base_url}/_1442_CountTripletsThatCanFormTwoArraysOfEqualXor.java[Java] //|{doc_base_url}/1442-count-triplets-that-can-form-two-arrays-of-equal-xor.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-time-to-collect-all-apples-in-a-tree/[1443. Minimum Time to Collect All Apples in a Tree^] //|{source_base_url}/_1443_MinimumTimeToCollectAllApplesInATree.java[Java] //|{doc_base_url}/1443-minimum-time-to-collect-all-apples-in-a-tree.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/number-of-ways-of-cutting-a-pizza/[1444. Number of Ways of Cutting a Pizza^] //|{source_base_url}/_1444_NumberOfWaysOfCuttingAPizza.java[Java] //|{doc_base_url}/1444-number-of-ways-of-cutting-a-pizza.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/apples-oranges/[1445. Apples & Oranges^] //|{source_base_url}/_1445_ApplesOranges.java[Java] //|{doc_base_url}/1445-apples-oranges.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/consecutive-characters/[1446. Consecutive Characters^] //|{source_base_url}/_1446_ConsecutiveCharacters.java[Java] //|{doc_base_url}/1446-consecutive-characters.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/simplified-fractions/[1447. Simplified Fractions^] //|{source_base_url}/_1447_SimplifiedFractions.java[Java] //|{doc_base_url}/1447-simplified-fractions.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-good-nodes-in-binary-tree/[1448. Count Good Nodes in Binary Tree^] //|{source_base_url}/_1448_CountGoodNodesInBinaryTree.java[Java] //|{doc_base_url}/1448-count-good-nodes-in-binary-tree.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/form-largest-integer-with-digits-that-add-up-to-target/[1449. Form Largest Integer With Digits That Add up to Target^] //|{source_base_url}/_1449_FormLargestIntegerWithDigitsThatAddUpToTarget.java[Java] //|{doc_base_url}/1449-form-largest-integer-with-digits-that-add-up-to-target.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/number-of-students-doing-homework-at-a-given-time/[1450. Number of Students Doing Homework at a Given Time^] //|{source_base_url}/_1450_NumberOfStudentsDoingHomeworkAtAGivenTime.java[Java] //|{doc_base_url}/1450-number-of-students-doing-homework-at-a-given-time.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/rearrange-words-in-a-sentence/[1451. Rearrange Words in a Sentence^] //|{source_base_url}/_1451_RearrangeWordsInASentence.java[Java] //|{doc_base_url}/1451-rearrange-words-in-a-sentence.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list/[1452. People Whose List of Favorite Companies Is Not a Subset of Another List^] //|{source_base_url}/_1452_PeopleWhoseListOfFavoriteCompaniesIsNotASubsetOfAnotherList.java[Java] //|{doc_base_url}/1452-people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-number-of-darts-inside-of-a-circular-dartboard/[1453. Maximum Number of Darts Inside of a Circular Dartboard^] //|{source_base_url}/_1453_MaximumNumberOfDartsInsideOfACircularDartboard.java[Java] //|{doc_base_url}/1453-maximum-number-of-darts-inside-of-a-circular-dartboard.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/active-users/[1454. Active Users^] //|{source_base_url}/_1454_ActiveUsers.java[Java] //|{doc_base_url}/1454-active-users.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence/[1455. Check If a Word Occurs As a Prefix of Any Word in a Sentence^] //|{source_base_url}/_1455_CheckIfAWordOccursAsAPrefixOfAnyWordInASentence.java[Java] //|{doc_base_url}/1455-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/maximum-number-of-vowels-in-a-substring-of-given-length/[1456. Maximum Number of Vowels in a Substring of Given Length^] //|{source_base_url}/_1456_MaximumNumberOfVowelsInASubstringOfGivenLength.java[Java] //|{doc_base_url}/1456-maximum-number-of-vowels-in-a-substring-of-given-length.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/pseudo-palindromic-paths-in-a-binary-tree/[1457. Pseudo-Palindromic Paths in a Binary Tree^] //|{source_base_url}/_1457_PseudoPalindromicPathsInABinaryTree.java[Java] //|{doc_base_url}/1457-pseudo-palindromic-paths-in-a-binary-tree.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/max-dot-product-of-two-subsequences/[1458. Max Dot Product of Two Subsequences^] //|{source_base_url}/_1458_MaxDotProductOfTwoSubsequences.java[Java] //|{doc_base_url}/1458-max-dot-product-of-two-subsequences.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/rectangles-area/[1459. Rectangles Area^] //|{source_base_url}/_1459_RectanglesArea.java[Java] //|{doc_base_url}/1459-rectangles-area.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/make-two-arrays-equal-by-reversing-subarrays/[1460. Make Two Arrays Equal by Reversing Subarrays^] //|{source_base_url}/_1460_MakeTwoArraysEqualByReversingSubarrays.java[Java] //|{doc_base_url}/1460-make-two-arrays-equal-by-reversing-subarrays.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/check-if-a-string-contains-all-binary-codes-of-size-k/[1461. Check If a String Contains All Binary Codes of Size K^] //|{source_base_url}/_1461_CheckIfAStringContainsAllBinaryCodesOfSizeK.java[Java] //|{doc_base_url}/1461-check-if-a-string-contains-all-binary-codes-of-size-k.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/course-schedule-iv/[1462. Course Schedule IV^] //|{source_base_url}/_1462_CourseScheduleIv.java[Java] //|{doc_base_url}/1462-course-schedule-iv.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/cherry-pickup-ii/[1463. Cherry Pickup II^] //|{source_base_url}/_1463_CherryPickupIi.java[Java] //|{doc_base_url}/1463-cherry-pickup-ii.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/maximum-product-of-two-elements-in-an-array/[1464. Maximum Product of Two Elements in an Array^] //|{source_base_url}/_1464_MaximumProductOfTwoElementsInAnArray.java[Java] //|{doc_base_url}/1464-maximum-product-of-two-elements-in-an-array.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts/[1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts^] //|{source_base_url}/_1465_MaximumAreaOfAPieceOfCakeAfterHorizontalAndVerticalCuts.java[Java] //|{doc_base_url}/1465-maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/reorder-routes-to-make-all-paths-lead-to-the-city-zero/[1466. Reorder Routes to Make All Paths Lead to the City Zero^] //|{source_base_url}/_1466_ReorderRoutesToMakeAllPathsLeadToTheCityZero.java[Java] //|{doc_base_url}/1466-reorder-routes-to-make-all-paths-lead-to-the-city-zero.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/probability-of-a-two-boxes-having-the-same-number-of-distinct-balls/[1467. Probability of a Two Boxes Having The Same Number of Distinct Balls^] //|{source_base_url}/_1467_ProbabilityOfATwoBoxesHavingTheSameNumberOfDistinctBalls.java[Java] //|{doc_base_url}/1467-probability-of-a-two-boxes-having-the-same-number-of-distinct-balls.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/calculate-salaries/[1468. Calculate Salaries^] //|{source_base_url}/_1468_CalculateSalaries.java[Java] //|{doc_base_url}/1468-calculate-salaries.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-all-the-lonely-nodes/[1469. Find All The Lonely Nodes^] //|{source_base_url}/_1469_FindAllTheLonelyNodes.java[Java] //|{doc_base_url}/1469-find-all-the-lonely-nodes.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/shuffle-the-array/[1470. Shuffle the Array^] //|{source_base_url}/_1470_ShuffleTheArray.java[Java] //|{doc_base_url}/1470-shuffle-the-array.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/the-k-strongest-values-in-an-array/[1471. The k Strongest Values in an Array^] //|{source_base_url}/_1471_TheKStrongestValuesInAnArray.java[Java] //|{doc_base_url}/1471-the-k-strongest-values-in-an-array.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/design-browser-history/[1472. Design Browser History^] //|{source_base_url}/_1472_DesignBrowserHistory.java[Java] //|{doc_base_url}/1472-design-browser-history.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/paint-house-iii/[1473. Paint House III^] //|{source_base_url}/_1473_PaintHouseIii.java[Java] //|{doc_base_url}/1473-paint-house-iii.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/delete-n-nodes-after-m-nodes-of-a-linked-list/[1474. Delete N Nodes After M Nodes of a Linked List^] //|{source_base_url}/_1474_DeleteNNodesAfterMNodesOfALinkedList.java[Java] //|{doc_base_url}/1474-delete-n-nodes-after-m-nodes-of-a-linked-list.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/final-prices-with-a-special-discount-in-a-shop/[1475. Final Prices With a Special Discount in a Shop^] //|{source_base_url}/_1475_FinalPricesWithASpecialDiscountInAShop.java[Java] //|{doc_base_url}/1475-final-prices-with-a-special-discount-in-a-shop.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/subrectangle-queries/[1476. Subrectangle Queries^] //|{source_base_url}/_1476_SubrectangleQueries.java[Java] //|{doc_base_url}/1476-subrectangle-queries.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-two-non-overlapping-sub-arrays-each-with-target-sum/[1477. Find Two Non-overlapping Sub-arrays Each With Target Sum^] //|{source_base_url}/_1477_FindTwoNonOverlappingSubArraysEachWithTargetSum.java[Java] //|{doc_base_url}/1477-find-two-non-overlapping-sub-arrays-each-with-target-sum.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/allocate-mailboxes/[1478. Allocate Mailboxes^] //|{source_base_url}/_1478_AllocateMailboxes.java[Java] //|{doc_base_url}/1478-allocate-mailboxes.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/sales-by-day-of-the-week/[1479. Sales by Day of the Week^] //|{source_base_url}/_1479_SalesByDayOfTheWeek.java[Java] //|{doc_base_url}/1479-sales-by-day-of-the-week.adoc[题解] //|Hard //|

|{counter:codes} |{leetcode_base_url}/running-sum-of-1d-array/[1480. Running Sum of 1d Array^] |{source_base_url}/_1480_RunningSumOf1DArray.java[Java] |{doc_base_url}/1480-running-sum-of-1d-array.adoc[题解] |Easy |

//|{counter:codes} //|{leetcode_base_url}/least-number-of-unique-integers-after-k-removals/[1481. Least Number of Unique Integers after K Removals^] //|{source_base_url}/_1481_LeastNumberOfUniqueIntegersAfterKRemovals.java[Java] //|{doc_base_url}/1481-least-number-of-unique-integers-after-k-removals.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-number-of-days-to-make-m-bouquets/[1482. Minimum Number of Days to Make m Bouquets^] //|{source_base_url}/_1482_MinimumNumberOfDaysToMakeMBouquets.java[Java] //|{doc_base_url}/1482-minimum-number-of-days-to-make-m-bouquets.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/kth-ancestor-of-a-tree-node/[1483. Kth Ancestor of a Tree Node^] //|{source_base_url}/_1483_KthAncestorOfATreeNode.java[Java] //|{doc_base_url}/1483-kth-ancestor-of-a-tree-node.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/group-sold-products-by-the-date/[1484. Group Sold Products By The Date^] //|{source_base_url}/_1484_GroupSoldProductsByTheDate.java[Java] //|{doc_base_url}/1484-group-sold-products-by-the-date.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/clone-binary-tree-with-random-pointer/[1485. Clone Binary Tree With Random Pointer^] //|{source_base_url}/_1485_CloneBinaryTreeWithRandomPointer.java[Java] //|{doc_base_url}/1485-clone-binary-tree-with-random-pointer.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/xor-operation-in-an-array/[1486. XOR Operation in an Array^] //|{source_base_url}/_1486_XorOperationInAnArray.java[Java] //|{doc_base_url}/1486-xor-operation-in-an-array.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/making-file-names-unique/[1487. Making File Names Unique^] //|{source_base_url}/_1487_MakingFileNamesUnique.java[Java] //|{doc_base_url}/1487-making-file-names-unique.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/avoid-flood-in-the-city/[1488. Avoid Flood in The City^] //|{source_base_url}/_1488_AvoidFloodInTheCity.java[Java] //|{doc_base_url}/1488-avoid-flood-in-the-city.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree/[1489. Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree^] //|{source_base_url}/_1489_FindCriticalAndPseudoCriticalEdgesInMinimumSpanningTree.java[Java] //|{doc_base_url}/1489-find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/clone-n-ary-tree/[1490. Clone N-ary Tree^] //|{source_base_url}/_1490_CloneNAryTree.java[Java] //|{doc_base_url}/1490-clone-n-ary-tree.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/average-salary-excluding-the-minimum-and-maximum-salary/[1491. Average Salary Excluding the Minimum and Maximum Salary^] //|{source_base_url}/_1491_AverageSalaryExcludingTheMinimumAndMaximumSalary.java[Java] //|{doc_base_url}/1491-average-salary-excluding-the-minimum-and-maximum-salary.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/the-kth-factor-of-n/[1492. The kth Factor of n^] //|{source_base_url}/_1492_TheKthFactorOfN.java[Java] //|{doc_base_url}/1492-the-kth-factor-of-n.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/longest-subarray-of-1s-after-deleting-one-element/[1493. Longest Subarray of 1's After Deleting One Element^] //|{source_base_url}/_1493_LongestSubarrayOf1SAfterDeletingOneElement.java[Java] //|{doc_base_url}/1493-longest-subarray-of-1s-after-deleting-one-element.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/parallel-courses-ii/[1494. Parallel Courses II^] //|{source_base_url}/_1494_ParallelCoursesIi.java[Java] //|{doc_base_url}/1494-parallel-courses-ii.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/friendly-movies-streamed-last-month/[1495. Friendly Movies Streamed Last Month^] //|{source_base_url}/_1495_FriendlyMoviesStreamedLastMonth.java[Java] //|{doc_base_url}/1495-friendly-movies-streamed-last-month.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/path-crossing/[1496. Path Crossing^] //|{source_base_url}/_1496_PathCrossing.java[Java] //|{doc_base_url}/1496-path-crossing.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/check-if-array-pairs-are-divisible-by-k/[1497. Check If Array Pairs Are Divisible by k^] //|{source_base_url}/_1497_CheckIfArrayPairsAreDivisibleByK.java[Java] //|{doc_base_url}/1497-check-if-array-pairs-are-divisible-by-k.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/number-of-subsequences-that-satisfy-the-given-sum-condition/[1498. Number of Subsequences That Satisfy the Given Sum Condition^] //|{source_base_url}/_1498_NumberOfSubsequencesThatSatisfyTheGivenSumCondition.java[Java] //|{doc_base_url}/1498-number-of-subsequences-that-satisfy-the-given-sum-condition.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/max-value-of-equation/[1499. Max Value of Equation^] //|{source_base_url}/_1499_MaxValueOfEquation.java[Java] //|{doc_base_url}/1499-max-value-of-equation.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/design-a-file-sharing-system/[1500. Design a File Sharing System^] //|{source_base_url}/_1500_DesignAFileSharingSystem.java[Java] //|{doc_base_url}/1500-design-a-file-sharing-system.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/countries-you-can-safely-invest-in/[1501. Countries You Can Safely Invest In^] //|{source_base_url}/_1501_CountriesYouCanSafelyInvestIn.java[Java] //|{doc_base_url}/1501-countries-you-can-safely-invest-in.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/can-make-arithmetic-progression-from-sequence/[1502. Can Make Arithmetic Progression From Sequence^] //|{source_base_url}/_1502_CanMakeArithmeticProgressionFromSequence.java[Java] //|{doc_base_url}/1502-can-make-arithmetic-progression-from-sequence.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/last-moment-before-all-ants-fall-out-of-a-plank/[1503. Last Moment Before All Ants Fall Out of a Plank^] //|{source_base_url}/_1503_LastMomentBeforeAllAntsFallOutOfAPlank.java[Java] //|{doc_base_url}/1503-last-moment-before-all-ants-fall-out-of-a-plank.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-submatrices-with-all-ones/[1504. Count Submatrices With All Ones^] //|{source_base_url}/_1504_CountSubmatricesWithAllOnes.java[Java] //|{doc_base_url}/1504-count-submatrices-with-all-ones.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits/[1505. Minimum Possible Integer After at Most K Adjacent Swaps On Digits^] //|{source_base_url}/_1505_MinimumPossibleIntegerAfterAtMostKAdjacentSwapsOnDigits.java[Java] //|{doc_base_url}/1505-minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/find-root-of-n-ary-tree/[1506. Find Root of N-Ary Tree^] //|{source_base_url}/_1506_FindRootOfNAryTree.java[Java] //|{doc_base_url}/1506-find-root-of-n-ary-tree.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/reformat-date/[1507. Reformat Date^] //|{source_base_url}/_1507_ReformatDate.java[Java] //|{doc_base_url}/1507-reformat-date.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/range-sum-of-sorted-subarray-sums/[1508. Range Sum of Sorted Subarray Sums^] //|{source_base_url}/_1508_RangeSumOfSortedSubarraySums.java[Java] //|{doc_base_url}/1508-range-sum-of-sorted-subarray-sums.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-difference-between-largest-and-smallest-value-in-three-moves/[1509. Minimum Difference Between Largest and Smallest Value in Three Moves^] //|{source_base_url}/_1509_MinimumDifferenceBetweenLargestAndSmallestValueInThreeMoves.java[Java] //|{doc_base_url}/1509-minimum-difference-between-largest-and-smallest-value-in-three-moves.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/stone-game-iv/[1510. Stone Game IV^] //|{source_base_url}/_1510_StoneGameIv.java[Java] //|{doc_base_url}/1510-stone-game-iv.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/customer-order-frequency/[1511. Customer Order Frequency^] //|{source_base_url}/_1511_CustomerOrderFrequency.java[Java] //|{doc_base_url}/1511-customer-order-frequency.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/number-of-good-pairs/[1512. Number of Good Pairs^] //|{source_base_url}/_1512_NumberOfGoodPairs.java[Java] //|{doc_base_url}/1512-number-of-good-pairs.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/number-of-substrings-with-only-1s/[1513. Number of Substrings With Only 1s^] //|{source_base_url}/_1513_NumberOfSubstringsWithOnly1S.java[Java] //|{doc_base_url}/1513-number-of-substrings-with-only-1s.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/path-with-maximum-probability/[1514. Path with Maximum Probability^] //|{source_base_url}/_1514_PathWithMaximumProbability.java[Java] //|{doc_base_url}/1514-path-with-maximum-probability.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/best-position-for-a-service-centre/[1515. Best Position for a Service Centre^] //|{source_base_url}/_1515_BestPositionForAServiceCentre.java[Java] //|{doc_base_url}/1515-best-position-for-a-service-centre.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/move-sub-tree-of-n-ary-tree/[1516. Move Sub-Tree of N-Ary Tree^] //|{source_base_url}/_1516_MoveSubTreeOfNAryTree.java[Java] //|{doc_base_url}/1516-move-sub-tree-of-n-ary-tree.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/find-users-with-valid-e-mails/[1517. Find Users With Valid E-Mails^] //|{source_base_url}/_1517_FindUsersWithValidEMails.java[Java] //|{doc_base_url}/1517-find-users-with-valid-e-mails.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/water-bottles/[1518. Water Bottles^] //|{source_base_url}/_1518_WaterBottles.java[Java] //|{doc_base_url}/1518-water-bottles.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/number-of-nodes-in-the-sub-tree-with-the-same-label/[1519. Number of Nodes in the Sub-Tree With the Same Label^] //|{source_base_url}/_1519_NumberOfNodesInTheSubTreeWithTheSameLabel.java[Java] //|{doc_base_url}/1519-number-of-nodes-in-the-sub-tree-with-the-same-label.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-number-of-non-overlapping-substrings/[1520. Maximum Number of Non-Overlapping Substrings^] //|{source_base_url}/_1520_MaximumNumberOfNonOverlappingSubstrings.java[Java] //|{doc_base_url}/1520-maximum-number-of-non-overlapping-substrings.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/find-a-value-of-a-mysterious-function-closest-to-target/[1521. Find a Value of a Mysterious Function Closest to Target^] //|{source_base_url}/_1521_FindAValueOfAMysteriousFunctionClosestToTarget.java[Java] //|{doc_base_url}/1521-find-a-value-of-a-mysterious-function-closest-to-target.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/diameter-of-n-ary-tree/[1522. Diameter of N-Ary Tree^] //|{source_base_url}/_1522_DiameterOfNAryTree.java[Java] //|{doc_base_url}/1522-diameter-of-n-ary-tree.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-odd-numbers-in-an-interval-range/[1523. Count Odd Numbers in an Interval Range^] //|{source_base_url}/_1523_CountOddNumbersInAnIntervalRange.java[Java] //|{doc_base_url}/1523-count-odd-numbers-in-an-interval-range.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/number-of-sub-arrays-with-odd-sum/[1524. Number of Sub-arrays With Odd Sum^] //|{source_base_url}/_1524_NumberOfSubArraysWithOddSum.java[Java] //|{doc_base_url}/1524-number-of-sub-arrays-with-odd-sum.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/number-of-good-ways-to-split-a-string/[1525. Number of Good Ways to Split a String^] //|{source_base_url}/_1525_NumberOfGoodWaysToSplitAString.java[Java] //|{doc_base_url}/1525-number-of-good-ways-to-split-a-string.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-number-of-increments-on-subarrays-to-form-a-target-array/[1526. Minimum Number of Increments on Subarrays to Form a Target Array^] //|{source_base_url}/_1526_MinimumNumberOfIncrementsOnSubarraysToFormATargetArray.java[Java] //|{doc_base_url}/1526-minimum-number-of-increments-on-subarrays-to-form-a-target-array.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/patients-with-a-condition/[1527. Patients With a Condition^] //|{source_base_url}/_1527_PatientsWithACondition.java[Java] //|{doc_base_url}/1527-patients-with-a-condition.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/shuffle-string/[1528. Shuffle String^] //|{source_base_url}/_1528_ShuffleString.java[Java] //|{doc_base_url}/1528-shuffle-string.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/minimum-suffix-flips/[1529. Minimum Suffix Flips^] //|{source_base_url}/_1529_MinimumSuffixFlips.java[Java] //|{doc_base_url}/1529-minimum-suffix-flips.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/number-of-good-leaf-nodes-pairs/[1530. Number of Good Leaf Nodes Pairs^] //|{source_base_url}/_1530_NumberOfGoodLeafNodesPairs.java[Java] //|{doc_base_url}/1530-number-of-good-leaf-nodes-pairs.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/string-compression-ii/[1531. String Compression II^] //|{source_base_url}/_1531_StringCompressionIi.java[Java] //|{doc_base_url}/1531-string-compression-ii.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/the-most-recent-three-orders/[1532. The Most Recent Three Orders^] //|{source_base_url}/_1532_TheMostRecentThreeOrders.java[Java] //|{doc_base_url}/1532-the-most-recent-three-orders.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-the-index-of-the-large-integer/[1533. Find the Index of the Large Integer^] //|{source_base_url}/_1533_FindTheIndexOfTheLargeInteger.java[Java] //|{doc_base_url}/1533-find-the-index-of-the-large-integer.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-good-triplets/[1534. Count Good Triplets^] //|{source_base_url}/_1534_CountGoodTriplets.java[Java] //|{doc_base_url}/1534-count-good-triplets.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/find-the-winner-of-an-array-game/[1535. Find the Winner of an Array Game^] //|{source_base_url}/_1535_FindTheWinnerOfAnArrayGame.java[Java] //|{doc_base_url}/1535-find-the-winner-of-an-array-game.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-swaps-to-arrange-a-binary-grid/[1536. Minimum Swaps to Arrange a Binary Grid^] //|{source_base_url}/_1536_MinimumSwapsToArrangeABinaryGrid.java[Java] //|{doc_base_url}/1536-minimum-swaps-to-arrange-a-binary-grid.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/get-the-maximum-score/[1537. Get the Maximum Score^] //|{source_base_url}/_1537_GetTheMaximumScore.java[Java] //|{doc_base_url}/1537-get-the-maximum-score.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/guess-the-majority-in-a-hidden-array/[1538. Guess the Majority in a Hidden Array^] //|{source_base_url}/_1538_GuessTheMajorityInAHiddenArray.java[Java] //|{doc_base_url}/1538-guess-the-majority-in-a-hidden-array.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/kth-missing-positive-number/[1539. Kth Missing Positive Number^] //|{source_base_url}/_1539_KthMissingPositiveNumber.java[Java] //|{doc_base_url}/1539-kth-missing-positive-number.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/can-convert-string-in-k-moves/[1540. Can Convert String in K Moves^] //|{source_base_url}/_1540_CanConvertStringInKMoves.java[Java] //|{doc_base_url}/1540-can-convert-string-in-k-moves.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-insertions-to-balance-a-parentheses-string/[1541. Minimum Insertions to Balance a Parentheses String^] //|{source_base_url}/_1541_MinimumInsertionsToBalanceAParenthesesString.java[Java] //|{doc_base_url}/1541-minimum-insertions-to-balance-a-parentheses-string.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-longest-awesome-substring/[1542. Find Longest Awesome Substring^] //|{source_base_url}/_1542_FindLongestAwesomeSubstring.java[Java] //|{doc_base_url}/1542-find-longest-awesome-substring.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/fix-product-name-format/[1543. Fix Product Name Format^] //|{source_base_url}/_1543_FixProductNameFormat.java[Java] //|{doc_base_url}/1543-fix-product-name-format.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/make-the-string-great/[1544. Make The String Great^] //|{source_base_url}/_1544_MakeTheStringGreat.java[Java] //|{doc_base_url}/1544-make-the-string-great.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/find-kth-bit-in-nth-binary-string/[1545. Find Kth Bit in Nth Binary String^] //|{source_base_url}/_1545_FindKthBitInNthBinaryString.java[Java] //|{doc_base_url}/1545-find-kth-bit-in-nth-binary-string.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-number-of-non-overlapping-subarrays-with-sum-equals-target/[1546. Maximum Number of Non-Overlapping Subarrays With Sum Equals Target^] //|{source_base_url}/_1546_MaximumNumberOfNonOverlappingSubarraysWithSumEqualsTarget.java[Java] //|{doc_base_url}/1546-maximum-number-of-non-overlapping-subarrays-with-sum-equals-target.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-cost-to-cut-a-stick/[1547. Minimum Cost to Cut a Stick^] //|{source_base_url}/_1547_MinimumCostToCutAStick.java[Java] //|{doc_base_url}/1547-minimum-cost-to-cut-a-stick.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/the-most-similar-path-in-a-graph/[1548. The Most Similar Path in a Graph^] //|{source_base_url}/_1548_TheMostSimilarPathInAGraph.java[Java] //|{doc_base_url}/1548-the-most-similar-path-in-a-graph.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/the-most-recent-orders-for-each-product/[1549. The Most Recent Orders for Each Product^] //|{source_base_url}/_1549_TheMostRecentOrdersForEachProduct.java[Java] //|{doc_base_url}/1549-the-most-recent-orders-for-each-product.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/three-consecutive-odds/[1550. Three Consecutive Odds^] //|{source_base_url}/_1550_ThreeConsecutiveOdds.java[Java] //|{doc_base_url}/1550-three-consecutive-odds.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/minimum-operations-to-make-array-equal/[1551. Minimum Operations to Make Array Equal^] //|{source_base_url}/_1551_MinimumOperationsToMakeArrayEqual.java[Java] //|{doc_base_url}/1551-minimum-operations-to-make-array-equal.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/magnetic-force-between-two-balls/[1552. Magnetic Force Between Two Balls^] //|{source_base_url}/_1552_MagneticForceBetweenTwoBalls.java[Java] //|{doc_base_url}/1552-magnetic-force-between-two-balls.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-number-of-days-to-eat-n-oranges/[1553. Minimum Number of Days to Eat N Oranges^] //|{source_base_url}/_1553_MinimumNumberOfDaysToEatNOranges.java[Java] //|{doc_base_url}/1553-minimum-number-of-days-to-eat-n-oranges.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/strings-differ-by-one-character/[1554. Strings Differ by One Character^] //|{source_base_url}/_1554_StringsDifferByOneCharacter.java[Java] //|{doc_base_url}/1554-strings-differ-by-one-character.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/bank-account-summary/[1555. Bank Account Summary^] //|{source_base_url}/_1555_BankAccountSummary.java[Java] //|{doc_base_url}/1555-bank-account-summary.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/thousand-separator/[1556. Thousand Separator^] //|{source_base_url}/_1556_ThousandSeparator.java[Java] //|{doc_base_url}/1556-thousand-separator.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/minimum-number-of-vertices-to-reach-all-nodes/[1557. Minimum Number of Vertices to Reach All Nodes^] //|{source_base_url}/_1557_MinimumNumberOfVerticesToReachAllNodes.java[Java] //|{doc_base_url}/1557-minimum-number-of-vertices-to-reach-all-nodes.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-numbers-of-function-calls-to-make-target-array/[1558. Minimum Numbers of Function Calls to Make Target Array^] //|{source_base_url}/_1558_MinimumNumbersOfFunctionCallsToMakeTargetArray.java[Java] //|{doc_base_url}/1558-minimum-numbers-of-function-calls-to-make-target-array.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/detect-cycles-in-2d-grid/[1559. Detect Cycles in 2D Grid^] //|{source_base_url}/_1559_DetectCyclesIn2DGrid.java[Java] //|{doc_base_url}/1559-detect-cycles-in-2d-grid.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/most-visited-sector-in-a-circular-track/[1560. Most Visited Sector in a Circular Track^] //|{source_base_url}/_1560_MostVisitedSectorInACircularTrack.java[Java] //|{doc_base_url}/1560-most-visited-sector-in-a-circular-track.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/maximum-number-of-coins-you-can-get/[1561. Maximum Number of Coins You Can Get^] //|{source_base_url}/_1561_MaximumNumberOfCoinsYouCanGet.java[Java] //|{doc_base_url}/1561-maximum-number-of-coins-you-can-get.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-latest-group-of-size-m/[1562. Find Latest Group of Size M^] //|{source_base_url}/_1562_FindLatestGroupOfSizeM.java[Java] //|{doc_base_url}/1562-find-latest-group-of-size-m.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/stone-game-v/[1563. Stone Game V^] //|{source_base_url}/_1563_StoneGameV.java[Java] //|{doc_base_url}/1563-stone-game-v.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/put-boxes-into-the-warehouse-i/[1564. Put Boxes Into the Warehouse I^] //|{source_base_url}/_1564_PutBoxesIntoTheWarehouseI.java[Java] //|{doc_base_url}/1564-put-boxes-into-the-warehouse-i.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/unique-orders-and-customers-per-month/[1565. Unique Orders and Customers Per Month^] //|{source_base_url}/_1565_UniqueOrdersAndCustomersPerMonth.java[Java] //|{doc_base_url}/1565-unique-orders-and-customers-per-month.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/detect-pattern-of-length-m-repeated-k-or-more-times/[1566. Detect Pattern of Length M Repeated K or More Times^] //|{source_base_url}/_1566_DetectPatternOfLengthMRepeatedKOrMoreTimes.java[Java] //|{doc_base_url}/1566-detect-pattern-of-length-m-repeated-k-or-more-times.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/maximum-length-of-subarray-with-positive-product/[1567. Maximum Length of Subarray With Positive Product^] //|{source_base_url}/_1567_MaximumLengthOfSubarrayWithPositiveProduct.java[Java] //|{doc_base_url}/1567-maximum-length-of-subarray-with-positive-product.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-number-of-days-to-disconnect-island/[1568. Minimum Number of Days to Disconnect Island^] //|{source_base_url}/_1568_MinimumNumberOfDaysToDisconnectIsland.java[Java] //|{doc_base_url}/1568-minimum-number-of-days-to-disconnect-island.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/number-of-ways-to-reorder-array-to-get-same-bst/[1569. Number of Ways to Reorder Array to Get Same BST^] //|{source_base_url}/_1569_NumberOfWaysToReorderArrayToGetSameBst.java[Java] //|{doc_base_url}/1569-number-of-ways-to-reorder-array-to-get-same-bst.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/dot-product-of-two-sparse-vectors/[1570. Dot Product of Two Sparse Vectors^] //|{source_base_url}/_1570_DotProductOfTwoSparseVectors.java[Java] //|{doc_base_url}/1570-dot-product-of-two-sparse-vectors.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/warehouse-manager/[1571. Warehouse Manager^] //|{source_base_url}/_1571_WarehouseManager.java[Java] //|{doc_base_url}/1571-warehouse-manager.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/matrix-diagonal-sum/[1572. Matrix Diagonal Sum^] //|{source_base_url}/_1572_MatrixDiagonalSum.java[Java] //|{doc_base_url}/1572-matrix-diagonal-sum.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/number-of-ways-to-split-a-string/[1573. Number of Ways to Split a String^] //|{source_base_url}/_1573_NumberOfWaysToSplitAString.java[Java] //|{doc_base_url}/1573-number-of-ways-to-split-a-string.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/shortest-subarray-to-be-removed-to-make-array-sorted/[1574. Shortest Subarray to be Removed to Make Array Sorted^] //|{source_base_url}/_1574_ShortestSubarrayToBeRemovedToMakeArraySorted.java[Java] //|{doc_base_url}/1574-shortest-subarray-to-be-removed-to-make-array-sorted.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-all-possible-routes/[1575. Count All Possible Routes^] //|{source_base_url}/_1575_CountAllPossibleRoutes.java[Java] //|{doc_base_url}/1575-count-all-possible-routes.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/replace-all-s-to-avoid-consecutive-repeating-characters/[1576. Replace All ?'s to Avoid Consecutive Repeating Characters^] //|{source_base_url}/_1576_ReplaceAllSToAvoidConsecutiveRepeatingCharacters.java[Java] //|{doc_base_url}/1576-replace-all-s-to-avoid-consecutive-repeating-characters.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers/[1577. Number of Ways Where Square of Number Is Equal to Product of Two Numbers^] //|{source_base_url}/_1577_NumberOfWaysWhereSquareOfNumberIsEqualToProductOfTwoNumbers.java[Java] //|{doc_base_url}/1577-number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-time-to-make-rope-colorful/[1578. Minimum Time to Make Rope Colorful^] //|{source_base_url}/_1578_MinimumTimeToMakeRopeColorful.java[Java] //|{doc_base_url}/1578-minimum-time-to-make-rope-colorful.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/remove-max-number-of-edges-to-keep-graph-fully-traversable/[1579. Remove Max Number of Edges to Keep Graph Fully Traversable^] //|{source_base_url}/_1579_RemoveMaxNumberOfEdgesToKeepGraphFullyTraversable.java[Java] //|{doc_base_url}/1579-remove-max-number-of-edges-to-keep-graph-fully-traversable.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/put-boxes-into-the-warehouse-ii/[1580. Put Boxes Into the Warehouse II^] //|{source_base_url}/_1580_PutBoxesIntoTheWarehouseIi.java[Java] //|{doc_base_url}/1580-put-boxes-into-the-warehouse-ii.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/customer-who-visited-but-did-not-make-any-transactions/[1581. Customer Who Visited but Did Not Make Any Transactions^] //|{source_base_url}/_1581_CustomerWhoVisitedButDidNotMakeAnyTransactions.java[Java] //|{doc_base_url}/1581-customer-who-visited-but-did-not-make-any-transactions.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/special-positions-in-a-binary-matrix/[1582. Special Positions in a Binary Matrix^] //|{source_base_url}/_1582_SpecialPositionsInABinaryMatrix.java[Java] //|{doc_base_url}/1582-special-positions-in-a-binary-matrix.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/count-unhappy-friends/[1583. Count Unhappy Friends^] //|{source_base_url}/_1583_CountUnhappyFriends.java[Java] //|{doc_base_url}/1583-count-unhappy-friends.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/min-cost-to-connect-all-points/[1584. Min Cost to Connect All Points^] //|{source_base_url}/_1584_MinCostToConnectAllPoints.java[Java] //|{doc_base_url}/1584-min-cost-to-connect-all-points.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/check-if-string-is-transformable-with-substring-sort-operations/[1585. Check If String Is Transformable With Substring Sort Operations^] //|{source_base_url}/_1585_CheckIfStringIsTransformableWithSubstringSortOperations.java[Java] //|{doc_base_url}/1585-check-if-string-is-transformable-with-substring-sort-operations.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/binary-search-tree-iterator-ii/[1586. Binary Search Tree Iterator II^] //|{source_base_url}/_1586_BinarySearchTreeIteratorIi.java[Java] //|{doc_base_url}/1586-binary-search-tree-iterator-ii.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/bank-account-summary-ii/[1587. Bank Account Summary II^] //|{source_base_url}/_1587_BankAccountSummaryIi.java[Java] //|{doc_base_url}/1587-bank-account-summary-ii.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/sum-of-all-odd-length-subarrays/[1588. Sum of All Odd Length Subarrays^] //|{source_base_url}/_1588_SumOfAllOddLengthSubarrays.java[Java] //|{doc_base_url}/1588-sum-of-all-odd-length-subarrays.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/maximum-sum-obtained-of-any-permutation/[1589. Maximum Sum Obtained of Any Permutation^] //|{source_base_url}/_1589_MaximumSumObtainedOfAnyPermutation.java[Java] //|{doc_base_url}/1589-maximum-sum-obtained-of-any-permutation.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/make-sum-divisible-by-p/[1590. Make Sum Divisible by P^] //|{source_base_url}/_1590_MakeSumDivisibleByP.java[Java] //|{doc_base_url}/1590-make-sum-divisible-by-p.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/strange-printer-ii/[1591. Strange Printer II^] //|{source_base_url}/_1591_StrangePrinterIi.java[Java] //|{doc_base_url}/1591-strange-printer-ii.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/rearrange-spaces-between-words/[1592. Rearrange Spaces Between Words^] //|{source_base_url}/_1592_RearrangeSpacesBetweenWords.java[Java] //|{doc_base_url}/1592-rearrange-spaces-between-words.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/split-a-string-into-the-max-number-of-unique-substrings/[1593. Split a String Into the Max Number of Unique Substrings^] //|{source_base_url}/_1593_SplitAStringIntoTheMaxNumberOfUniqueSubstrings.java[Java] //|{doc_base_url}/1593-split-a-string-into-the-max-number-of-unique-substrings.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-non-negative-product-in-a-matrix/[1594. Maximum Non Negative Product in a Matrix^] //|{source_base_url}/_1594_MaximumNonNegativeProductInAMatrix.java[Java] //|{doc_base_url}/1594-maximum-non-negative-product-in-a-matrix.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-cost-to-connect-two-groups-of-points/[1595. Minimum Cost to Connect Two Groups of Points^] //|{source_base_url}/_1595_MinimumCostToConnectTwoGroupsOfPoints.java[Java] //|{doc_base_url}/1595-minimum-cost-to-connect-two-groups-of-points.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/the-most-frequently-ordered-products-for-each-customer/[1596. The Most Frequently Ordered Products for Each Customer^] //|{source_base_url}/_1596_TheMostFrequentlyOrderedProductsForEachCustomer.java[Java] //|{doc_base_url}/1596-the-most-frequently-ordered-products-for-each-customer.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/build-binary-expression-tree-from-infix-expression/[1597. Build Binary Expression Tree From Infix Expression^] //|{source_base_url}/_1597_BuildBinaryExpressionTreeFromInfixExpression.java[Java] //|{doc_base_url}/1597-build-binary-expression-tree-from-infix-expression.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/crawler-log-folder/[1598. Crawler Log Folder^] //|{source_base_url}/_1598_CrawlerLogFolder.java[Java] //|{doc_base_url}/1598-crawler-log-folder.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/maximum-profit-of-operating-a-centennial-wheel/[1599. Maximum Profit of Operating a Centennial Wheel^] //|{source_base_url}/_1599_MaximumProfitOfOperatingACentennialWheel.java[Java] //|{doc_base_url}/1599-maximum-profit-of-operating-a-centennial-wheel.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/throne-inheritance/[1600. Throne Inheritance^] //|{source_base_url}/_1600_ThroneInheritance.java[Java] //|{doc_base_url}/1600-throne-inheritance.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-number-of-achievable-transfer-requests/[1601. Maximum Number of Achievable Transfer Requests^] //|{source_base_url}/_1601_MaximumNumberOfAchievableTransferRequests.java[Java] //|{doc_base_url}/1601-maximum-number-of-achievable-transfer-requests.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/find-nearest-right-node-in-binary-tree/[1602. Find Nearest Right Node in Binary Tree^] //|{source_base_url}/_1602_FindNearestRightNodeInBinaryTree.java[Java] //|{doc_base_url}/1602-find-nearest-right-node-in-binary-tree.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/design-parking-system/[1603. Design Parking System^] //|{source_base_url}/_1603_DesignParkingSystem.java[Java] //|{doc_base_url}/1603-design-parking-system.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/alert-using-same-key-card-three-or-more-times-in-a-one-hour-period/[1604. Alert Using Same Key-Card Three or More Times in a One Hour Period^] //|{source_base_url}/_1604_AlertUsingSameKeyCardThreeOrMoreTimesInAOneHourPeriod.java[Java] //|{doc_base_url}/1604-alert-using-same-key-card-three-or-more-times-in-a-one-hour-period.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-valid-matrix-given-row-and-column-sums/[1605. Find Valid Matrix Given Row and Column Sums^] //|{source_base_url}/_1605_FindValidMatrixGivenRowAndColumnSums.java[Java] //|{doc_base_url}/1605-find-valid-matrix-given-row-and-column-sums.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-servers-that-handled-most-number-of-requests/[1606. Find Servers That Handled Most Number of Requests^] //|{source_base_url}/_1606_FindServersThatHandledMostNumberOfRequests.java[Java] //|{doc_base_url}/1606-find-servers-that-handled-most-number-of-requests.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/sellers-with-no-sales/[1607. Sellers With No Sales^] //|{source_base_url}/_1607_SellersWithNoSales.java[Java] //|{doc_base_url}/1607-sellers-with-no-sales.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/special-array-with-x-elements-greater-than-or-equal-x/[1608. Special Array With X Elements Greater Than or Equal X^] //|{source_base_url}/_1608_SpecialArrayWithXElementsGreaterThanOrEqualX.java[Java] //|{doc_base_url}/1608-special-array-with-x-elements-greater-than-or-equal-x.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/even-odd-tree/[1609. Even Odd Tree^] //|{source_base_url}/_1609_EvenOddTree.java[Java] //|{doc_base_url}/1609-even-odd-tree.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-number-of-visible-points/[1610. Maximum Number of Visible Points^] //|{source_base_url}/_1610_MaximumNumberOfVisiblePoints.java[Java] //|{doc_base_url}/1610-maximum-number-of-visible-points.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/minimum-one-bit-operations-to-make-integers-zero/[1611. Minimum One Bit Operations to Make Integers Zero^] //|{source_base_url}/_1611_MinimumOneBitOperationsToMakeIntegersZero.java[Java] //|{doc_base_url}/1611-minimum-one-bit-operations-to-make-integers-zero.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/check-if-two-expression-trees-are-equivalent/[1612. Check If Two Expression Trees are Equivalent^] //|{source_base_url}/_1612_CheckIfTwoExpressionTreesAreEquivalent.java[Java] //|{doc_base_url}/1612-check-if-two-expression-trees-are-equivalent.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-the-missing-ids/[1613. Find the Missing IDs^] //|{source_base_url}/_1613_FindTheMissingIds.java[Java] //|{doc_base_url}/1613-find-the-missing-ids.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-nesting-depth-of-the-parentheses/[1614. Maximum Nesting Depth of the Parentheses^] //|{source_base_url}/_1614_MaximumNestingDepthOfTheParentheses.java[Java] //|{doc_base_url}/1614-maximum-nesting-depth-of-the-parentheses.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/maximal-network-rank/[1615. Maximal Network Rank^] //|{source_base_url}/_1615_MaximalNetworkRank.java[Java] //|{doc_base_url}/1615-maximal-network-rank.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/split-two-strings-to-make-palindrome/[1616. Split Two Strings to Make Palindrome^] //|{source_base_url}/_1616_SplitTwoStringsToMakePalindrome.java[Java] //|{doc_base_url}/1616-split-two-strings-to-make-palindrome.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-subtrees-with-max-distance-between-cities/[1617. Count Subtrees With Max Distance Between Cities^] //|{source_base_url}/_1617_CountSubtreesWithMaxDistanceBetweenCities.java[Java] //|{doc_base_url}/1617-count-subtrees-with-max-distance-between-cities.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/maximum-font-to-fit-a-sentence-in-a-screen/[1618. Maximum Font to Fit a Sentence in a Screen^] //|{source_base_url}/_1618_MaximumFontToFitASentenceInAScreen.java[Java] //|{doc_base_url}/1618-maximum-font-to-fit-a-sentence-in-a-screen.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/mean-of-array-after-removing-some-elements/[1619. Mean of Array After Removing Some Elements^] //|{source_base_url}/_1619_MeanOfArrayAfterRemovingSomeElements.java[Java] //|{doc_base_url}/1619-mean-of-array-after-removing-some-elements.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/coordinate-with-maximum-network-quality/[1620. Coordinate With Maximum Network Quality^] //|{source_base_url}/_1620_CoordinateWithMaximumNetworkQuality.java[Java] //|{doc_base_url}/1620-coordinate-with-maximum-network-quality.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/number-of-sets-of-k-non-overlapping-line-segments/[1621. Number of Sets of K Non-Overlapping Line Segments^] //|{source_base_url}/_1621_NumberOfSetsOfKNonOverlappingLineSegments.java[Java] //|{doc_base_url}/1621-number-of-sets-of-k-non-overlapping-line-segments.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/fancy-sequence/[1622. Fancy Sequence^] //|{source_base_url}/_1622_FancySequence.java[Java] //|{doc_base_url}/1622-fancy-sequence.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/all-valid-triplets-that-can-represent-a-country/[1623. All Valid Triplets That Can Represent a Country^] //|{source_base_url}/_1623_AllValidTripletsThatCanRepresentACountry.java[Java] //|{doc_base_url}/1623-all-valid-triplets-that-can-represent-a-country.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/largest-substring-between-two-equal-characters/[1624. Largest Substring Between Two Equal Characters^] //|{source_base_url}/_1624_LargestSubstringBetweenTwoEqualCharacters.java[Java] //|{doc_base_url}/1624-largest-substring-between-two-equal-characters.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/lexicographically-smallest-string-after-applying-operations/[1625. Lexicographically Smallest String After Applying Operations^] //|{source_base_url}/_1625_LexicographicallySmallestStringAfterApplyingOperations.java[Java] //|{doc_base_url}/1625-lexicographically-smallest-string-after-applying-operations.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/best-team-with-no-conflicts/[1626. Best Team With No Conflicts^] //|{source_base_url}/_1626_BestTeamWithNoConflicts.java[Java] //|{doc_base_url}/1626-best-team-with-no-conflicts.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/graph-connectivity-with-threshold/[1627. Graph Connectivity With Threshold^] //|{source_base_url}/_1627_GraphConnectivityWithThreshold.java[Java] //|{doc_base_url}/1627-graph-connectivity-with-threshold.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/design-an-expression-tree-with-evaluate-function/[1628. Design an Expression Tree With Evaluate Function^] //|{source_base_url}/_1628_DesignAnExpressionTreeWithEvaluateFunction.java[Java] //|{doc_base_url}/1628-design-an-expression-tree-with-evaluate-function.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/slowest-key/[1629. Slowest Key^] //|{source_base_url}/_1629_SlowestKey.java[Java] //|{doc_base_url}/1629-slowest-key.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/arithmetic-subarrays/[1630. Arithmetic Subarrays^] //|{source_base_url}/_1630_ArithmeticSubarrays.java[Java] //|{doc_base_url}/1630-arithmetic-subarrays.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/path-with-minimum-effort/[1631. Path With Minimum Effort^] //|{source_base_url}/_1631_PathWithMinimumEffort.java[Java] //|{doc_base_url}/1631-path-with-minimum-effort.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/rank-transform-of-a-matrix/[1632. Rank Transform of a Matrix^] //|{source_base_url}/_1632_RankTransformOfAMatrix.java[Java] //|{doc_base_url}/1632-rank-transform-of-a-matrix.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/percentage-of-users-attended-a-contest/[1633. Percentage of Users Attended a Contest^] //|{source_base_url}/_1633_PercentageOfUsersAttendedAContest.java[Java] //|{doc_base_url}/1633-percentage-of-users-attended-a-contest.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/add-two-polynomials-represented-as-linked-lists/[1634. Add Two Polynomials Represented as Linked Lists^] //|{source_base_url}/_1634_AddTwoPolynomialsRepresentedAsLinkedLists.java[Java] //|{doc_base_url}/1634-add-two-polynomials-represented-as-linked-lists.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/hopper-company-queries-i/[1635. Hopper Company Queries I^] //|{source_base_url}/_1635_HopperCompanyQueriesI.java[Java] //|{doc_base_url}/1635-hopper-company-queries-i.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/sort-array-by-increasing-frequency/[1636. Sort Array by Increasing Frequency^] //|{source_base_url}/_1636_SortArrayByIncreasingFrequency.java[Java] //|{doc_base_url}/1636-sort-array-by-increasing-frequency.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/widest-vertical-area-between-two-points-containing-no-points/[1637. Widest Vertical Area Between Two Points Containing No Points^] //|{source_base_url}/_1637_WidestVerticalAreaBetweenTwoPointsContainingNoPoints.java[Java] //|{doc_base_url}/1637-widest-vertical-area-between-two-points-containing-no-points.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/count-substrings-that-differ-by-one-character/[1638. Count Substrings That Differ by One Character^] //|{source_base_url}/_1638_CountSubstringsThatDifferByOneCharacter.java[Java] //|{doc_base_url}/1638-count-substrings-that-differ-by-one-character.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/number-of-ways-to-form-a-target-string-given-a-dictionary/[1639. Number of Ways to Form a Target String Given a Dictionary^] //|{source_base_url}/_1639_NumberOfWaysToFormATargetStringGivenADictionary.java[Java] //|{doc_base_url}/1639-number-of-ways-to-form-a-target-string-given-a-dictionary.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/check-array-formation-through-concatenation/[1640. Check Array Formation Through Concatenation^] //|{source_base_url}/_1640_CheckArrayFormationThroughConcatenation.java[Java] //|{doc_base_url}/1640-check-array-formation-through-concatenation.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/count-sorted-vowel-strings/[1641. Count Sorted Vowel Strings^] //|{source_base_url}/_1641_CountSortedVowelStrings.java[Java] //|{doc_base_url}/1641-count-sorted-vowel-strings.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/furthest-building-you-can-reach/[1642. Furthest Building You Can Reach^] //|{source_base_url}/_1642_FurthestBuildingYouCanReach.java[Java] //|{doc_base_url}/1642-furthest-building-you-can-reach.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/kth-smallest-instructions/[1643. Kth Smallest Instructions^] //|{source_base_url}/_1643_KthSmallestInstructions.java[Java] //|{doc_base_url}/1643-kth-smallest-instructions.adoc[题解] //|Hard //|

|{counter:codes} |{leetcode_base_url}/lowest-common-ancestor-of-a-binary-tree-ii/[1644. Lowest Common Ancestor of a Binary Tree II^] |{source_base_url}/_1644_LowestCommonAncestorOfABinaryTreeII.java[Java] |{doc_base_url}/1644-lowest-common-ancestor-of-a-binary-tree-ii.adoc[题解] |Medium |树形DP套路，没有验证答案！

//|{counter:codes} //|{leetcode_base_url}/hopper-company-queries-ii/[1645. Hopper Company Queries II^] //|{source_base_url}/_1645_HopperCompanyQueriesIi.java[Java] //|{doc_base_url}/1645-hopper-company-queries-ii.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/get-maximum-in-generated-array/[1646. Get Maximum in Generated Array^] //|{source_base_url}/_1646_GetMaximumInGeneratedArray.java[Java] //|{doc_base_url}/1646-get-maximum-in-generated-array.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/minimum-deletions-to-make-character-frequencies-unique/[1647. Minimum Deletions to Make Character Frequencies Unique^] //|{source_base_url}/_1647_MinimumDeletionsToMakeCharacterFrequenciesUnique.java[Java] //|{doc_base_url}/1647-minimum-deletions-to-make-character-frequencies-unique.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/sell-diminishing-valued-colored-balls/[1648. Sell Diminishing-Valued Colored Balls^] //|{source_base_url}/_1648_SellDiminishingValuedColoredBalls.java[Java] //|{doc_base_url}/1648-sell-diminishing-valued-colored-balls.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/create-sorted-array-through-instructions/[1649. Create Sorted Array through Instructions^] //|{source_base_url}/_1649_CreateSortedArrayThroughInstructions.java[Java] //|{doc_base_url}/1649-create-sorted-array-through-instructions.adoc[题解] //|Hard //|

|{counter:codes} |{leetcode_base_url}/lowest-common-ancestor-of-a-binary-tree-iii/[1650. Lowest Common Ancestor of a Binary Tree III^] |{source_base_url}/_1650_LowestCommonAncestorOfABinaryTreeIII.java[Java] |{doc_base_url}/1650-lowest-common-ancestor-of-a-binary-tree-iii.adoc[题解] |Medium |链表相交

//|{counter:codes} //|{leetcode_base_url}/hopper-company-queries-iii/[1651. Hopper Company Queries III^] //|{source_base_url}/_1651_HopperCompanyQueriesIii.java[Java] //|{doc_base_url}/1651-hopper-company-queries-iii.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/defuse-the-bomb/[1652. Defuse the Bomb^] //|{source_base_url}/_1652_DefuseTheBomb.java[Java] //|{doc_base_url}/1652-defuse-the-bomb.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/minimum-deletions-to-make-string-balanced/[1653. Minimum Deletions to Make String Balanced^] //|{source_base_url}/_1653_MinimumDeletionsToMakeStringBalanced.java[Java] //|{doc_base_url}/1653-minimum-deletions-to-make-string-balanced.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-jumps-to-reach-home/[1654. Minimum Jumps to Reach Home^] //|{source_base_url}/_1654_MinimumJumpsToReachHome.java[Java] //|{doc_base_url}/1654-minimum-jumps-to-reach-home.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/distribute-repeating-integers/[1655. Distribute Repeating Integers^] //|{source_base_url}/_1655_DistributeRepeatingIntegers.java[Java] //|{doc_base_url}/1655-distribute-repeating-integers.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/design-an-ordered-stream/[1656. Design an Ordered Stream^] //|{source_base_url}/_1656_DesignAnOrderedStream.java[Java] //|{doc_base_url}/1656-design-an-ordered-stream.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/determine-if-two-strings-are-close/[1657. Determine if Two Strings Are Close^] //|{source_base_url}/_1657_DetermineIfTwoStringsAreClose.java[Java] //|{doc_base_url}/1657-determine-if-two-strings-are-close.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-operations-to-reduce-x-to-zero/[1658. Minimum Operations to Reduce X to Zero^] //|{source_base_url}/_1658_MinimumOperationsToReduceXToZero.java[Java] //|{doc_base_url}/1658-minimum-operations-to-reduce-x-to-zero.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximize-grid-happiness/[1659. Maximize Grid Happiness^] //|{source_base_url}/_1659_MaximizeGridHappiness.java[Java] //|{doc_base_url}/1659-maximize-grid-happiness.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/correct-a-binary-tree/[1660. Correct a Binary Tree^] //|{source_base_url}/_1660_CorrectABinaryTree.java[Java] //|{doc_base_url}/1660-correct-a-binary-tree.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/average-time-of-process-per-machine/[1661. Average Time of Process per Machine^] //|{source_base_url}/_1661_AverageTimeOfProcessPerMachine.java[Java] //|{doc_base_url}/1661-average-time-of-process-per-machine.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/check-if-two-string-arrays-are-equivalent/[1662. Check If Two String Arrays are Equivalent^] //|{source_base_url}/_1662_CheckIfTwoStringArraysAreEquivalent.java[Java] //|{doc_base_url}/1662-check-if-two-string-arrays-are-equivalent.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/smallest-string-with-a-given-numeric-value/[1663. Smallest String With A Given Numeric Value^] //|{source_base_url}/_1663_SmallestStringWithAGivenNumericValue.java[Java] //|{doc_base_url}/1663-smallest-string-with-a-given-numeric-value.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/ways-to-make-a-fair-array/[1664. Ways to Make a Fair Array^] //|{source_base_url}/_1664_WaysToMakeAFairArray.java[Java] //|{doc_base_url}/1664-ways-to-make-a-fair-array.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-initial-energy-to-finish-tasks/[1665. Minimum Initial Energy to Finish Tasks^] //|{source_base_url}/_1665_MinimumInitialEnergyToFinishTasks.java[Java] //|{doc_base_url}/1665-minimum-initial-energy-to-finish-tasks.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/change-the-root-of-a-binary-tree/[1666. Change the Root of a Binary Tree^] //|{source_base_url}/_1666_ChangeTheRootOfABinaryTree.java[Java] //|{doc_base_url}/1666-change-the-root-of-a-binary-tree.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/fix-names-in-a-table/[1667. Fix Names in a Table^] //|{source_base_url}/_1667_FixNamesInATable.java[Java] //|{doc_base_url}/1667-fix-names-in-a-table.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/maximum-repeating-substring/[1668. Maximum Repeating Substring^] //|{source_base_url}/_1668_MaximumRepeatingSubstring.java[Java] //|{doc_base_url}/1668-maximum-repeating-substring.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/merge-in-between-linked-lists/[1669. Merge In Between Linked Lists^] //|{source_base_url}/_1669_MergeInBetweenLinkedLists.java[Java] //|{doc_base_url}/1669-merge-in-between-linked-lists.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/design-front-middle-back-queue/[1670. Design Front Middle Back Queue^] //|{source_base_url}/_1670_DesignFrontMiddleBackQueue.java[Java] //|{doc_base_url}/1670-design-front-middle-back-queue.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-number-of-removals-to-make-mountain-array/[1671. Minimum Number of Removals to Make Mountain Array^] //|{source_base_url}/_1671_MinimumNumberOfRemovalsToMakeMountainArray.java[Java] //|{doc_base_url}/1671-minimum-number-of-removals-to-make-mountain-array.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/richest-customer-wealth/[1672. Richest Customer Wealth^] //|{source_base_url}/_1672_RichestCustomerWealth.java[Java] //|{doc_base_url}/1672-richest-customer-wealth.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/find-the-most-competitive-subsequence/[1673. Find the Most Competitive Subsequence^] //|{source_base_url}/_1673_FindTheMostCompetitiveSubsequence.java[Java] //|{doc_base_url}/1673-find-the-most-competitive-subsequence.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-moves-to-make-array-complementary/[1674. Minimum Moves to Make Array Complementary^] //|{source_base_url}/_1674_MinimumMovesToMakeArrayComplementary.java[Java] //|{doc_base_url}/1674-minimum-moves-to-make-array-complementary.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimize-deviation-in-array/[1675. Minimize Deviation in Array^] //|{source_base_url}/_1675_MinimizeDeviationInArray.java[Java] //|{doc_base_url}/1675-minimize-deviation-in-array.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/lowest-common-ancestor-of-a-binary-tree-iv/[1676. Lowest Common Ancestor of a Binary Tree IV^] //|{source_base_url}/_1676_LowestCommonAncestorOfABinaryTreeIv.java[Java] //|{doc_base_url}/1676-lowest-common-ancestor-of-a-binary-tree-iv.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/products-worth-over-invoices/[1677. Product's Worth Over Invoices^] //|{source_base_url}/_1677_ProductSWorthOverInvoices.java[Java] //|{doc_base_url}/1677-products-worth-over-invoices.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/goal-parser-interpretation/[1678. Goal Parser Interpretation^] //|{source_base_url}/_1678_GoalParserInterpretation.java[Java] //|{doc_base_url}/1678-goal-parser-interpretation.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/max-number-of-k-sum-pairs/[1679. Max Number of K-Sum Pairs^] //|{source_base_url}/_1679_MaxNumberOfKSumPairs.java[Java] //|{doc_base_url}/1679-max-number-of-k-sum-pairs.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/concatenation-of-consecutive-binary-numbers/[1680. Concatenation of Consecutive Binary Numbers^] //|{source_base_url}/_1680_ConcatenationOfConsecutiveBinaryNumbers.java[Java] //|{doc_base_url}/1680-concatenation-of-consecutive-binary-numbers.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-incompatibility/[1681. Minimum Incompatibility^] //|{source_base_url}/_1681_MinimumIncompatibility.java[Java] //|{doc_base_url}/1681-minimum-incompatibility.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/longest-palindromic-subsequence-ii/[1682. Longest Palindromic Subsequence II^] //|{source_base_url}/_1682_LongestPalindromicSubsequenceIi.java[Java] //|{doc_base_url}/1682-longest-palindromic-subsequence-ii.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/invalid-tweets/[1683. Invalid Tweets^] //|{source_base_url}/_1683_InvalidTweets.java[Java] //|{doc_base_url}/1683-invalid-tweets.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/count-the-number-of-consistent-strings/[1684. Count the Number of Consistent Strings^] //|{source_base_url}/_1684_CountTheNumberOfConsistentStrings.java[Java] //|{doc_base_url}/1684-count-the-number-of-consistent-strings.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/sum-of-absolute-differences-in-a-sorted-array/[1685. Sum of Absolute Differences in a Sorted Array^] //|{source_base_url}/_1685_SumOfAbsoluteDifferencesInASortedArray.java[Java] //|{doc_base_url}/1685-sum-of-absolute-differences-in-a-sorted-array.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/stone-game-vi/[1686. Stone Game VI^] //|{source_base_url}/_1686_StoneGameVi.java[Java] //|{doc_base_url}/1686-stone-game-vi.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/delivering-boxes-from-storage-to-ports/[1687. Delivering Boxes from Storage to Ports^] //|{source_base_url}/_1687_DeliveringBoxesFromStorageToPorts.java[Java] //|{doc_base_url}/1687-delivering-boxes-from-storage-to-ports.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/count-of-matches-in-tournament/[1688. Count of Matches in Tournament^] //|{source_base_url}/_1688_CountOfMatchesInTournament.java[Java] //|{doc_base_url}/1688-count-of-matches-in-tournament.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/partitioning-into-minimum-number-of-deci-binary-numbers/[1689. Partitioning Into Minimum Number Of Deci-Binary Numbers^] //|{source_base_url}/_1689_PartitioningIntoMinimumNumberOfDeciBinaryNumbers.java[Java] //|{doc_base_url}/1689-partitioning-into-minimum-number-of-deci-binary-numbers.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/stone-game-vii/[1690. Stone Game VII^] //|{source_base_url}/_1690_StoneGameVii.java[Java] //|{doc_base_url}/1690-stone-game-vii.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-height-by-stacking-cuboids/[1691. Maximum Height by Stacking Cuboids ^] //|{source_base_url}/_1691_MaximumHeightByStackingCuboids.java[Java] //|{doc_base_url}/1691-maximum-height-by-stacking-cuboids.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/count-ways-to-distribute-candies/[1692. Count Ways to Distribute Candies^] //|{source_base_url}/_1692_CountWaysToDistributeCandies.java[Java] //|{doc_base_url}/1692-count-ways-to-distribute-candies.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/daily-leads-and-partners/[1693. Daily Leads and Partners^] //|{source_base_url}/_1693_DailyLeadsAndPartners.java[Java] //|{doc_base_url}/1693-daily-leads-and-partners.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/reformat-phone-number/[1694. Reformat Phone Number^] //|{source_base_url}/_1694_ReformatPhoneNumber.java[Java] //|{doc_base_url}/1694-reformat-phone-number.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/maximum-erasure-value/[1695. Maximum Erasure Value^] //|{source_base_url}/_1695_MaximumErasureValue.java[Java] //|{doc_base_url}/1695-maximum-erasure-value.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/jump-game-vi/[1696. Jump Game VI^] //|{source_base_url}/_1696_JumpGameVi.java[Java] //|{doc_base_url}/1696-jump-game-vi.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/checking-existence-of-edge-length-limited-paths/[1697. Checking Existence of Edge Length Limited Paths^] //|{source_base_url}/_1697_CheckingExistenceOfEdgeLengthLimitedPaths.java[Java] //|{doc_base_url}/1697-checking-existence-of-edge-length-limited-paths.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/number-of-distinct-substrings-in-a-string/[1698. Number of Distinct Substrings in a String^] //|{source_base_url}/_1698_NumberOfDistinctSubstringsInAString.java[Java] //|{doc_base_url}/1698-number-of-distinct-substrings-in-a-string.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/number-of-calls-between-two-persons/[1699. Number of Calls Between Two Persons^] //|{source_base_url}/_1699_NumberOfCallsBetweenTwoPersons.java[Java] //|{doc_base_url}/1699-number-of-calls-between-two-persons.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/number-of-students-unable-to-eat-lunch/[1700. Number of Students Unable to Eat Lunch^] //|{source_base_url}/_1700_NumberOfStudentsUnableToEatLunch.java[Java] //|{doc_base_url}/1700-number-of-students-unable-to-eat-lunch.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/average-waiting-time/[1701. Average Waiting Time^] //|{source_base_url}/_1701_AverageWaitingTime.java[Java] //|{doc_base_url}/1701-average-waiting-time.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-binary-string-after-change/[1702. Maximum Binary String After Change^] //|{source_base_url}/_1702_MaximumBinaryStringAfterChange.java[Java] //|{doc_base_url}/1702-maximum-binary-string-after-change.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-adjacent-swaps-for-k-consecutive-ones/[1703. Minimum Adjacent Swaps for K Consecutive Ones^] //|{source_base_url}/_1703_MinimumAdjacentSwapsForKConsecutiveOnes.java[Java] //|{doc_base_url}/1703-minimum-adjacent-swaps-for-k-consecutive-ones.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/determine-if-string-halves-are-alike/[1704. Determine if String Halves Are Alike^] //|{source_base_url}/_1704_DetermineIfStringHalvesAreAlike.java[Java] //|{doc_base_url}/1704-determine-if-string-halves-are-alike.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/maximum-number-of-eaten-apples/[1705. Maximum Number of Eaten Apples^] //|{source_base_url}/_1705_MaximumNumberOfEatenApples.java[Java] //|{doc_base_url}/1705-maximum-number-of-eaten-apples.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/where-will-the-ball-fall/[1706. Where Will the Ball Fall^] //|{source_base_url}/_1706_WhereWillTheBallFall.java[Java] //|{doc_base_url}/1706-where-will-the-ball-fall.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-xor-with-an-element-from-array/[1707. Maximum XOR With an Element From Array^] //|{source_base_url}/_1707_MaximumXorWithAnElementFromArray.java[Java] //|{doc_base_url}/1707-maximum-xor-with-an-element-from-array.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/largest-subarray-length-k/[1708. Largest Subarray Length K^] //|{source_base_url}/_1708_LargestSubarrayLengthK.java[Java] //|{doc_base_url}/1708-largest-subarray-length-k.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/biggest-window-between-visits/[1709. Biggest Window Between Visits^] //|{source_base_url}/_1709_BiggestWindowBetweenVisits.java[Java] //|{doc_base_url}/1709-biggest-window-between-visits.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-units-on-a-truck/[1710. Maximum Units on a Truck^] //|{source_base_url}/_1710_MaximumUnitsOnATruck.java[Java] //|{doc_base_url}/1710-maximum-units-on-a-truck.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/count-good-meals/[1711. Count Good Meals^] //|{source_base_url}/_1711_CountGoodMeals.java[Java] //|{doc_base_url}/1711-count-good-meals.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/ways-to-split-array-into-three-subarrays/[1712. Ways to Split Array Into Three Subarrays^] //|{source_base_url}/_1712_WaysToSplitArrayIntoThreeSubarrays.java[Java] //|{doc_base_url}/1712-ways-to-split-array-into-three-subarrays.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-operations-to-make-a-subsequence/[1713. Minimum Operations to Make a Subsequence^] //|{source_base_url}/_1713_MinimumOperationsToMakeASubsequence.java[Java] //|{doc_base_url}/1713-minimum-operations-to-make-a-subsequence.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/sum-of-special-evenly-spaced-elements-in-array/[1714. Sum Of Special Evenly-Spaced Elements In Array^] //|{source_base_url}/_1714_SumOfSpecialEvenlySpacedElementsInArray.java[Java] //|{doc_base_url}/1714-sum-of-special-evenly-spaced-elements-in-array.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/count-apples-and-oranges/[1715. Count Apples and Oranges^] //|{source_base_url}/_1715_CountApplesAndOranges.java[Java] //|{doc_base_url}/1715-count-apples-and-oranges.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/calculate-money-in-leetcode-bank/[1716. Calculate Money in Leetcode Bank^] //|{source_base_url}/_1716_CalculateMoneyInLeetcodeBank.java[Java] //|{doc_base_url}/1716-calculate-money-in-leetcode-bank.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/maximum-score-from-removing-substrings/[1717. Maximum Score From Removing Substrings^] //|{source_base_url}/_1717_MaximumScoreFromRemovingSubstrings.java[Java] //|{doc_base_url}/1717-maximum-score-from-removing-substrings.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/construct-the-lexicographically-largest-valid-sequence/[1718. Construct the Lexicographically Largest Valid Sequence^] //|{source_base_url}/_1718_ConstructTheLexicographicallyLargestValidSequence.java[Java] //|{doc_base_url}/1718-construct-the-lexicographically-largest-valid-sequence.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/number-of-ways-to-reconstruct-a-tree/[1719. Number Of Ways To Reconstruct A Tree^] //|{source_base_url}/_1719_NumberOfWaysToReconstructATree.java[Java] //|{doc_base_url}/1719-number-of-ways-to-reconstruct-a-tree.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/decode-xored-array/[1720. Decode XORed Array^] //|{source_base_url}/_1720_DecodeXoredArray.java[Java] //|{doc_base_url}/1720-decode-xored-array.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/swapping-nodes-in-a-linked-list/[1721. Swapping Nodes in a Linked List^] //|{source_base_url}/_1721_SwappingNodesInALinkedList.java[Java] //|{doc_base_url}/1721-swapping-nodes-in-a-linked-list.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimize-hamming-distance-after-swap-operations/[1722. Minimize Hamming Distance After Swap Operations^] //|{source_base_url}/_1722_MinimizeHammingDistanceAfterSwapOperations.java[Java] //|{doc_base_url}/1722-minimize-hamming-distance-after-swap-operations.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-minimum-time-to-finish-all-jobs/[1723. Find Minimum Time to Finish All Jobs^] //|{source_base_url}/_1723_FindMinimumTimeToFinishAllJobs.java[Java] //|{doc_base_url}/1723-find-minimum-time-to-finish-all-jobs.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/checking-existence-of-edge-length-limited-paths-ii/[1724. Checking Existence of Edge Length Limited Paths II^] //|{source_base_url}/_1724_CheckingExistenceOfEdgeLengthLimitedPathsIi.java[Java] //|{doc_base_url}/1724-checking-existence-of-edge-length-limited-paths-ii.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/number-of-rectangles-that-can-form-the-largest-square/[1725. Number Of Rectangles That Can Form The Largest Square^] //|{source_base_url}/_1725_NumberOfRectanglesThatCanFormTheLargestSquare.java[Java] //|{doc_base_url}/1725-number-of-rectangles-that-can-form-the-largest-square.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/tuple-with-same-product/[1726. Tuple with Same Product^] //|{source_base_url}/_1726_TupleWithSameProduct.java[Java] //|{doc_base_url}/1726-tuple-with-same-product.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/largest-submatrix-with-rearrangements/[1727. Largest Submatrix With Rearrangements^] //|{source_base_url}/_1727_LargestSubmatrixWithRearrangements.java[Java] //|{doc_base_url}/1727-largest-submatrix-with-rearrangements.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/cat-and-mouse-ii/[1728. Cat and Mouse II^] //|{source_base_url}/_1728_CatAndMouseIi.java[Java] //|{doc_base_url}/1728-cat-and-mouse-ii.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/find-followers-count/[1729. Find Followers Count^] //|{source_base_url}/_1729_FindFollowersCount.java[Java] //|{doc_base_url}/1729-find-followers-count.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/shortest-path-to-get-food/[1730. Shortest Path to Get Food^] //|{source_base_url}/_1730_ShortestPathToGetFood.java[Java] //|{doc_base_url}/1730-shortest-path-to-get-food.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/the-number-of-employees-which-report-to-each-employee/[1731. The Number of Employees Which Report to Each Employee^] //|{source_base_url}/_1731_TheNumberOfEmployeesWhichReportToEachEmployee.java[Java] //|{doc_base_url}/1731-the-number-of-employees-which-report-to-each-employee.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/find-the-highest-altitude/[1732. Find the Highest Altitude^] //|{source_base_url}/_1732_FindTheHighestAltitude.java[Java] //|{doc_base_url}/1732-find-the-highest-altitude.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/minimum-number-of-people-to-teach/[1733. Minimum Number of People to Teach^] //|{source_base_url}/_1733_MinimumNumberOfPeopleToTeach.java[Java] //|{doc_base_url}/1733-minimum-number-of-people-to-teach.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/decode-xored-permutation/[1734. Decode XORed Permutation^] //|{source_base_url}/_1734_DecodeXoredPermutation.java[Java] //|{doc_base_url}/1734-decode-xored-permutation.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-ways-to-make-array-with-product/[1735. Count Ways to Make Array With Product^] //|{source_base_url}/_1735_CountWaysToMakeArrayWithProduct.java[Java] //|{doc_base_url}/1735-count-ways-to-make-array-with-product.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/latest-time-by-replacing-hidden-digits/[1736. Latest Time by Replacing Hidden Digits^] //|{source_base_url}/_1736_LatestTimeByReplacingHiddenDigits.java[Java] //|{doc_base_url}/1736-latest-time-by-replacing-hidden-digits.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/change-minimum-characters-to-satisfy-one-of-three-conditions/[1737. Change Minimum Characters to Satisfy One of Three Conditions^] //|{source_base_url}/_1737_ChangeMinimumCharactersToSatisfyOneOfThreeConditions.java[Java] //|{doc_base_url}/1737-change-minimum-characters-to-satisfy-one-of-three-conditions.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-kth-largest-xor-coordinate-value/[1738. Find Kth Largest XOR Coordinate Value^] //|{source_base_url}/_1738_FindKthLargestXorCoordinateValue.java[Java] //|{doc_base_url}/1738-find-kth-largest-xor-coordinate-value.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/building-boxes/[1739. Building Boxes^] //|{source_base_url}/_1739_BuildingBoxes.java[Java] //|{doc_base_url}/1739-building-boxes.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/find-distance-in-a-binary-tree/[1740. Find Distance in a Binary Tree^] //|{source_base_url}/_1740_FindDistanceInABinaryTree.java[Java] //|{doc_base_url}/1740-find-distance-in-a-binary-tree.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-total-time-spent-by-each-employee/[1741. Find Total Time Spent by Each Employee^] //|{source_base_url}/_1741_FindTotalTimeSpentByEachEmployee.java[Java] //|{doc_base_url}/1741-find-total-time-spent-by-each-employee.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/maximum-number-of-balls-in-a-box/[1742. Maximum Number of Balls in a Box^] //|{source_base_url}/_1742_MaximumNumberOfBallsInABox.java[Java] //|{doc_base_url}/1742-maximum-number-of-balls-in-a-box.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/restore-the-array-from-adjacent-pairs/[1743. Restore the Array From Adjacent Pairs^] //|{source_base_url}/_1743_RestoreTheArrayFromAdjacentPairs.java[Java] //|{doc_base_url}/1743-restore-the-array-from-adjacent-pairs.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/can-you-eat-your-favorite-candy-on-your-favorite-day/[1744. Can You Eat Your Favorite Candy on Your Favorite Day?^] //|{source_base_url}/_1744_CanYouEatYourFavoriteCandyOnYourFavoriteDay.java[Java] //|{doc_base_url}/1744-can-you-eat-your-favorite-candy-on-your-favorite-day.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/palindrome-partitioning-iv/[1745. Palindrome Partitioning IV^] //|{source_base_url}/_1745_PalindromePartitioningIv.java[Java] //|{doc_base_url}/1745-palindrome-partitioning-iv.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/maximum-subarray-sum-after-one-operation/[1746. Maximum Subarray Sum After One Operation^] //|{source_base_url}/_1746_MaximumSubarraySumAfterOneOperation.java[Java] //|{doc_base_url}/1746-maximum-subarray-sum-after-one-operation.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/leetflex-banned-accounts/[1747. Leetflex Banned Accounts^] //|{source_base_url}/_1747_LeetflexBannedAccounts.java[Java] //|{doc_base_url}/1747-leetflex-banned-accounts.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/sum-of-unique-elements/[1748. Sum of Unique Elements^] //|{source_base_url}/_1748_SumOfUniqueElements.java[Java] //|{doc_base_url}/1748-sum-of-unique-elements.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/maximum-absolute-sum-of-any-subarray/[1749. Maximum Absolute Sum of Any Subarray^] //|{source_base_url}/_1749_MaximumAbsoluteSumOfAnySubarray.java[Java] //|{doc_base_url}/1749-maximum-absolute-sum-of-any-subarray.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-length-of-string-after-deleting-similar-ends/[1750. Minimum Length of String After Deleting Similar Ends^] //|{source_base_url}/_1750_MinimumLengthOfStringAfterDeletingSimilarEnds.java[Java] //|{doc_base_url}/1750-minimum-length-of-string-after-deleting-similar-ends.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-number-of-events-that-can-be-attended-ii/[1751. Maximum Number of Events That Can Be Attended II^] //|{source_base_url}/_1751_MaximumNumberOfEventsThatCanBeAttendedIi.java[Java] //|{doc_base_url}/1751-maximum-number-of-events-that-can-be-attended-ii.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/check-if-array-is-sorted-and-rotated/[1752. Check if Array Is Sorted and Rotated^] //|{source_base_url}/_1752_CheckIfArrayIsSortedAndRotated.java[Java] //|{doc_base_url}/1752-check-if-array-is-sorted-and-rotated.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/maximum-score-from-removing-stones/[1753. Maximum Score From Removing Stones^] //|{source_base_url}/_1753_MaximumScoreFromRemovingStones.java[Java] //|{doc_base_url}/1753-maximum-score-from-removing-stones.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/largest-merge-of-two-strings/[1754. Largest Merge Of Two Strings^] //|{source_base_url}/_1754_LargestMergeOfTwoStrings.java[Java] //|{doc_base_url}/1754-largest-merge-of-two-strings.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/closest-subsequence-sum/[1755. Closest Subsequence Sum^] //|{source_base_url}/_1755_ClosestSubsequenceSum.java[Java] //|{doc_base_url}/1755-closest-subsequence-sum.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/design-most-recently-used-queue/[1756. Design Most Recently Used Queue^] //|{source_base_url}/_1756_DesignMostRecentlyUsedQueue.java[Java] //|{doc_base_url}/1756-design-most-recently-used-queue.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/recyclable-and-low-fat-products/[1757. Recyclable and Low Fat Products^] //|{source_base_url}/_1757_RecyclableAndLowFatProducts.java[Java] //|{doc_base_url}/1757-recyclable-and-low-fat-products.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/minimum-changes-to-make-alternating-binary-string/[1758. Minimum Changes To Make Alternating Binary String^] //|{source_base_url}/_1758_MinimumChangesToMakeAlternatingBinaryString.java[Java] //|{doc_base_url}/1758-minimum-changes-to-make-alternating-binary-string.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/count-number-of-homogenous-substrings/[1759. Count Number of Homogenous Substrings^] //|{source_base_url}/_1759_CountNumberOfHomogenousSubstrings.java[Java] //|{doc_base_url}/1759-count-number-of-homogenous-substrings.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-limit-of-balls-in-a-bag/[1760. Minimum Limit of Balls in a Bag^] //|{source_base_url}/_1760_MinimumLimitOfBallsInABag.java[Java] //|{doc_base_url}/1760-minimum-limit-of-balls-in-a-bag.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-degree-of-a-connected-trio-in-a-graph/[1761. Minimum Degree of a Connected Trio in a Graph^] //|{source_base_url}/_1761_MinimumDegreeOfAConnectedTrioInAGraph.java[Java] //|{doc_base_url}/1761-minimum-degree-of-a-connected-trio-in-a-graph.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/buildings-with-an-ocean-view/[1762. Buildings With an Ocean View^] //|{source_base_url}/_1762_BuildingsWithAnOceanView.java[Java] //|{doc_base_url}/1762-buildings-with-an-ocean-view.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/longest-nice-substring/[1763. Longest Nice Substring^] //|{source_base_url}/_1763_LongestNiceSubstring.java[Java] //|{doc_base_url}/1763-longest-nice-substring.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/form-array-by-concatenating-subarrays-of-another-array/[1764. Form Array by Concatenating Subarrays of Another Array^] //|{source_base_url}/_1764_FormArrayByConcatenatingSubarraysOfAnotherArray.java[Java] //|{doc_base_url}/1764-form-array-by-concatenating-subarrays-of-another-array.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/map-of-highest-peak/[1765. Map of Highest Peak^] //|{source_base_url}/_1765_MapOfHighestPeak.java[Java] //|{doc_base_url}/1765-map-of-highest-peak.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/tree-of-coprimes/[1766. Tree of Coprimes^] //|{source_base_url}/_1766_TreeOfCoprimes.java[Java] //|{doc_base_url}/1766-tree-of-coprimes.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/find-the-subtasks-that-did-not-execute/[1767. Find the Subtasks That Did Not Execute^] //|{source_base_url}/_1767_FindTheSubtasksThatDidNotExecute.java[Java] //|{doc_base_url}/1767-find-the-subtasks-that-did-not-execute.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/merge-strings-alternately/[1768. Merge Strings Alternately^] //|{source_base_url}/_1768_MergeStringsAlternately.java[Java] //|{doc_base_url}/1768-merge-strings-alternately.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/minimum-number-of-operations-to-move-all-balls-to-each-box/[1769. Minimum Number of Operations to Move All Balls to Each Box^] //|{source_base_url}/_1769_MinimumNumberOfOperationsToMoveAllBallsToEachBox.java[Java] //|{doc_base_url}/1769-minimum-number-of-operations-to-move-all-balls-to-each-box.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-score-from-performing-multiplication-operations/[1770. Maximum Score from Performing Multiplication Operations^] //|{source_base_url}/_1770_MaximumScoreFromPerformingMultiplicationOperations.java[Java] //|{doc_base_url}/1770-maximum-score-from-performing-multiplication-operations.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/maximize-palindrome-length-from-subsequences/[1771. Maximize Palindrome Length From Subsequences^] //|{source_base_url}/_1771_MaximizePalindromeLengthFromSubsequences.java[Java] //|{doc_base_url}/1771-maximize-palindrome-length-from-subsequences.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/sort-features-by-popularity/[1772. Sort Features by Popularity^] //|{source_base_url}/_1772_SortFeaturesByPopularity.java[Java] //|{doc_base_url}/1772-sort-features-by-popularity.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-items-matching-a-rule/[1773. Count Items Matching a Rule^] //|{source_base_url}/_1773_CountItemsMatchingARule.java[Java] //|{doc_base_url}/1773-count-items-matching-a-rule.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/closest-dessert-cost/[1774. Closest Dessert Cost^] //|{source_base_url}/_1774_ClosestDessertCost.java[Java] //|{doc_base_url}/1774-closest-dessert-cost.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/equal-sum-arrays-with-minimum-number-of-operations/[1775. Equal Sum Arrays With Minimum Number of Operations^] //|{source_base_url}/_1775_EqualSumArraysWithMinimumNumberOfOperations.java[Java] //|{doc_base_url}/1775-equal-sum-arrays-with-minimum-number-of-operations.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/car-fleet-ii/[1776. Car Fleet II^] //|{source_base_url}/_1776_CarFleetIi.java[Java] //|{doc_base_url}/1776-car-fleet-ii.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/products-price-for-each-store/[1777. Product's Price for Each Store^] //|{source_base_url}/_1777_ProductSPriceForEachStore.java[Java] //|{doc_base_url}/1777-products-price-for-each-store.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/shortest-path-in-a-hidden-grid/[1778. Shortest Path in a Hidden Grid^] //|{source_base_url}/_1778_ShortestPathInAHiddenGrid.java[Java] //|{doc_base_url}/1778-shortest-path-in-a-hidden-grid.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-nearest-point-that-has-the-same-x-or-y-coordinate/[1779. Find Nearest Point That Has the Same X or Y Coordinate^] //|{source_base_url}/_1779_FindNearestPointThatHasTheSameXOrYCoordinate.java[Java] //|{doc_base_url}/1779-find-nearest-point-that-has-the-same-x-or-y-coordinate.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/check-if-number-is-a-sum-of-powers-of-three/[1780. Check if Number is a Sum of Powers of Three^] //|{source_base_url}/_1780_CheckIfNumberIsASumOfPowersOfThree.java[Java] //|{doc_base_url}/1780-check-if-number-is-a-sum-of-powers-of-three.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/sum-of-beauty-of-all-substrings/[1781. Sum of Beauty of All Substrings^] //|{source_base_url}/_1781_SumOfBeautyOfAllSubstrings.java[Java] //|{doc_base_url}/1781-sum-of-beauty-of-all-substrings.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-pairs-of-nodes/[1782. Count Pairs Of Nodes^] //|{source_base_url}/_1782_CountPairsOfNodes.java[Java] //|{doc_base_url}/1782-count-pairs-of-nodes.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/grand-slam-titles/[1783. Grand Slam Titles^] //|{source_base_url}/_1783_GrandSlamTitles.java[Java] //|{doc_base_url}/1783-grand-slam-titles.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/check-if-binary-string-has-at-most-one-segment-of-ones/[1784. Check if Binary String Has at Most One Segment of Ones^] //|{source_base_url}/_1784_CheckIfBinaryStringHasAtMostOneSegmentOfOnes.java[Java] //|{doc_base_url}/1784-check-if-binary-string-has-at-most-one-segment-of-ones.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/minimum-elements-to-add-to-form-a-given-sum/[1785. Minimum Elements to Add to Form a Given Sum^] //|{source_base_url}/_1785_MinimumElementsToAddToFormAGivenSum.java[Java] //|{doc_base_url}/1785-minimum-elements-to-add-to-form-a-given-sum.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/number-of-restricted-paths-from-first-to-last-node/[1786. Number of Restricted Paths From First to Last Node^] //|{source_base_url}/_1786_NumberOfRestrictedPathsFromFirstToLastNode.java[Java] //|{doc_base_url}/1786-number-of-restricted-paths-from-first-to-last-node.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/make-the-xor-of-all-segments-equal-to-zero/[1787. Make the XOR of All Segments Equal to Zero^] //|{source_base_url}/_1787_MakeTheXorOfAllSegmentsEqualToZero.java[Java] //|{doc_base_url}/1787-make-the-xor-of-all-segments-equal-to-zero.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/maximize-the-beauty-of-the-garden/[1788. Maximize the Beauty of the Garden^] //|{source_base_url}/_1788_MaximizeTheBeautyOfTheGarden.java[Java] //|{doc_base_url}/1788-maximize-the-beauty-of-the-garden.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/primary-department-for-each-employee/[1789. Primary Department for Each Employee^] //|{source_base_url}/_1789_PrimaryDepartmentForEachEmployee.java[Java] //|{doc_base_url}/1789-primary-department-for-each-employee.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/check-if-one-string-swap-can-make-strings-equal/[1790. Check if One String Swap Can Make Strings Equal^] //|{source_base_url}/_1790_CheckIfOneStringSwapCanMakeStringsEqual.java[Java] //|{doc_base_url}/1790-check-if-one-string-swap-can-make-strings-equal.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/find-center-of-star-graph/[1791. Find Center of Star Graph^] //|{source_base_url}/_1791_FindCenterOfStarGraph.java[Java] //|{doc_base_url}/1791-find-center-of-star-graph.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/maximum-average-pass-ratio/[1792. Maximum Average Pass Ratio^] //|{source_base_url}/_1792_MaximumAveragePassRatio.java[Java] //|{doc_base_url}/1792-maximum-average-pass-ratio.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-score-of-a-good-subarray/[1793. Maximum Score of a Good Subarray^] //|{source_base_url}/_1793_MaximumScoreOfAGoodSubarray.java[Java] //|{doc_base_url}/1793-maximum-score-of-a-good-subarray.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/count-pairs-of-equal-substrings-with-minimum-difference/[1794. Count Pairs of Equal Substrings With Minimum Difference^] //|{source_base_url}/_1794_CountPairsOfEqualSubstringsWithMinimumDifference.java[Java] //|{doc_base_url}/1794-count-pairs-of-equal-substrings-with-minimum-difference.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/rearrange-products-table/[1795. Rearrange Products Table^] //|{source_base_url}/_1795_RearrangeProductsTable.java[Java] //|{doc_base_url}/1795-rearrange-products-table.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/second-largest-digit-in-a-string/[1796. Second Largest Digit in a String^] //|{source_base_url}/_1796_SecondLargestDigitInAString.java[Java] //|{doc_base_url}/1796-second-largest-digit-in-a-string.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/design-authentication-manager/[1797. Design Authentication Manager^] //|{source_base_url}/_1797_DesignAuthenticationManager.java[Java] //|{doc_base_url}/1797-design-authentication-manager.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-number-of-consecutive-values-you-can-make/[1798. Maximum Number of Consecutive Values You Can Make^] //|{source_base_url}/_1798_MaximumNumberOfConsecutiveValuesYouCanMake.java[Java] //|{doc_base_url}/1798-maximum-number-of-consecutive-values-you-can-make.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximize-score-after-n-operations/[1799. Maximize Score After N Operations^] //|{source_base_url}/_1799_MaximizeScoreAfterNOperations.java[Java] //|{doc_base_url}/1799-maximize-score-after-n-operations.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/maximum-ascending-subarray-sum/[1800. Maximum Ascending Subarray Sum^] //|{source_base_url}/_1800_MaximumAscendingSubarraySum.java[Java] //|{doc_base_url}/1800-maximum-ascending-subarray-sum.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/number-of-orders-in-the-backlog/[1801. Number of Orders in the Backlog^] //|{source_base_url}/_1801_NumberOfOrdersInTheBacklog.java[Java] //|{doc_base_url}/1801-number-of-orders-in-the-backlog.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-value-at-a-given-index-in-a-bounded-array/[1802. Maximum Value at a Given Index in a Bounded Array^] //|{source_base_url}/_1802_MaximumValueAtAGivenIndexInABoundedArray.java[Java] //|{doc_base_url}/1802-maximum-value-at-a-given-index-in-a-bounded-array.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-pairs-with-xor-in-a-range/[1803. Count Pairs With XOR in a Range^] //|{source_base_url}/_1803_CountPairsWithXorInARange.java[Java] //|{doc_base_url}/1803-count-pairs-with-xor-in-a-range.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/implement-trie-ii-prefix-tree/[1804. Implement Trie II (Prefix Tree)^] //|{source_base_url}/_1804_ImplementTrieIiPrefixTree.java[Java] //|{doc_base_url}/1804-implement-trie-ii-prefix-tree.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/number-of-different-integers-in-a-string/[1805. Number of Different Integers in a String^] //|{source_base_url}/_1805_NumberOfDifferentIntegersInAString.java[Java] //|{doc_base_url}/1805-number-of-different-integers-in-a-string.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/minimum-number-of-operations-to-reinitialize-a-permutation/[1806. Minimum Number of Operations to Reinitialize a Permutation^] //|{source_base_url}/_1806_MinimumNumberOfOperationsToReinitializeAPermutation.java[Java] //|{doc_base_url}/1806-minimum-number-of-operations-to-reinitialize-a-permutation.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/evaluate-the-bracket-pairs-of-a-string/[1807. Evaluate the Bracket Pairs of a String^] //|{source_base_url}/_1807_EvaluateTheBracketPairsOfAString.java[Java] //|{doc_base_url}/1807-evaluate-the-bracket-pairs-of-a-string.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximize-number-of-nice-divisors/[1808. Maximize Number of Nice Divisors^] //|{source_base_url}/_1808_MaximizeNumberOfNiceDivisors.java[Java] //|{doc_base_url}/1808-maximize-number-of-nice-divisors.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/ad-free-sessions/[1809. Ad-Free Sessions^] //|{source_base_url}/_1809_AdFreeSessions.java[Java] //|{doc_base_url}/1809-ad-free-sessions.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/minimum-path-cost-in-a-hidden-grid/[1810. Minimum Path Cost in a Hidden Grid^] //|{source_base_url}/_1810_MinimumPathCostInAHiddenGrid.java[Java] //|{doc_base_url}/1810-minimum-path-cost-in-a-hidden-grid.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-interview-candidates/[1811. Find Interview Candidates^] //|{source_base_url}/_1811_FindInterviewCandidates.java[Java] //|{doc_base_url}/1811-find-interview-candidates.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/determine-color-of-a-chessboard-square/[1812. Determine Color of a Chessboard Square^] //|{source_base_url}/_1812_DetermineColorOfAChessboardSquare.java[Java] //|{doc_base_url}/1812-determine-color-of-a-chessboard-square.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/sentence-similarity-iii/[1813. Sentence Similarity III^] //|{source_base_url}/_1813_SentenceSimilarityIii.java[Java] //|{doc_base_url}/1813-sentence-similarity-iii.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-nice-pairs-in-an-array/[1814. Count Nice Pairs in an Array^] //|{source_base_url}/_1814_CountNicePairsInAnArray.java[Java] //|{doc_base_url}/1814-count-nice-pairs-in-an-array.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-number-of-groups-getting-fresh-donuts/[1815. Maximum Number of Groups Getting Fresh Donuts^] //|{source_base_url}/_1815_MaximumNumberOfGroupsGettingFreshDonuts.java[Java] //|{doc_base_url}/1815-maximum-number-of-groups-getting-fresh-donuts.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/truncate-sentence/[1816. Truncate Sentence^] //|{source_base_url}/_1816_TruncateSentence.java[Java] //|{doc_base_url}/1816-truncate-sentence.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/finding-the-users-active-minutes/[1817. Finding the Users Active Minutes^] //|{source_base_url}/_1817_FindingTheUsersActiveMinutes.java[Java] //|{doc_base_url}/1817-finding-the-users-active-minutes.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-absolute-sum-difference/[1818. Minimum Absolute Sum Difference^] //|{source_base_url}/_1818_MinimumAbsoluteSumDifference.java[Java] //|{doc_base_url}/1818-minimum-absolute-sum-difference.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/number-of-different-subsequences-gcds/[1819. Number of Different Subsequences GCDs^] //|{source_base_url}/_1819_NumberOfDifferentSubsequencesGcds.java[Java] //|{doc_base_url}/1819-number-of-different-subsequences-gcds.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/maximum-number-of-accepted-invitations/[1820. Maximum Number of Accepted Invitations^] //|{source_base_url}/_1820_MaximumNumberOfAcceptedInvitations.java[Java] //|{doc_base_url}/1820-maximum-number-of-accepted-invitations.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-customers-with-positive-revenue-this-year/[1821. Find Customers With Positive Revenue this Year^] //|{source_base_url}/_1821_FindCustomersWithPositiveRevenueThisYear.java[Java] //|{doc_base_url}/1821-find-customers-with-positive-revenue-this-year.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/sign-of-the-product-of-an-array/[1822. Sign of the Product of an Array^] //|{source_base_url}/_1822_SignOfTheProductOfAnArray.java[Java] //|{doc_base_url}/1822-sign-of-the-product-of-an-array.adoc[题解] //|Easy //|

|{counter:codes} |{leetcode_base_url}/find-the-winner-of-the-circular-game/[1823. Find the Winner of the Circular Game^] |{source_base_url}/_1823_FindTheWinnerOfTheCircularGame.java[Java] |{doc_base_url}/1823-find-the-winner-of-the-circular-game.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/minimum-sideway-jumps/[1824. Minimum Sideway Jumps^] //|{source_base_url}/_1824_MinimumSidewayJumps.java[Java] //|{doc_base_url}/1824-minimum-sideway-jumps.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/finding-mk-average/[1825. Finding MK Average^] //|{source_base_url}/_1825_FindingMkAverage.java[Java] //|{doc_base_url}/1825-finding-mk-average.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/faulty-sensor/[1826. Faulty Sensor^] //|{source_base_url}/_1826_FaultySensor.java[Java] //|{doc_base_url}/1826-faulty-sensor.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/minimum-operations-to-make-the-array-increasing/[1827. Minimum Operations to Make the Array Increasing^] //|{source_base_url}/_1827_MinimumOperationsToMakeTheArrayIncreasing.java[Java] //|{doc_base_url}/1827-minimum-operations-to-make-the-array-increasing.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/queries-on-number-of-points-inside-a-circle/[1828. Queries on Number of Points Inside a Circle^] //|{source_base_url}/_1828_QueriesOnNumberOfPointsInsideACircle.java[Java] //|{doc_base_url}/1828-queries-on-number-of-points-inside-a-circle.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-xor-for-each-query/[1829. Maximum XOR for Each Query^] //|{source_base_url}/_1829_MaximumXorForEachQuery.java[Java] //|{doc_base_url}/1829-maximum-xor-for-each-query.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-number-of-operations-to-make-string-sorted/[1830. Minimum Number of Operations to Make String Sorted^] //|{source_base_url}/_1830_MinimumNumberOfOperationsToMakeStringSorted.java[Java] //|{doc_base_url}/1830-minimum-number-of-operations-to-make-string-sorted.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/maximum-transaction-each-day/[1831. Maximum Transaction Each Day^] //|{source_base_url}/_1831_MaximumTransactionEachDay.java[Java] //|{doc_base_url}/1831-maximum-transaction-each-day.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/check-if-the-sentence-is-pangram/[1832. Check if the Sentence Is Pangram^] //|{source_base_url}/_1832_CheckIfTheSentenceIsPangram.java[Java] //|{doc_base_url}/1832-check-if-the-sentence-is-pangram.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/maximum-ice-cream-bars/[1833. Maximum Ice Cream Bars^] //|{source_base_url}/_1833_MaximumIceCreamBars.java[Java] //|{doc_base_url}/1833-maximum-ice-cream-bars.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/single-threaded-cpu/[1834. Single-Threaded CPU^] //|{source_base_url}/_1834_SingleThreadedCpu.java[Java] //|{doc_base_url}/1834-single-threaded-cpu.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-xor-sum-of-all-pairs-bitwise-and/[1835. Find XOR Sum of All Pairs Bitwise AND^] //|{source_base_url}/_1835_FindXorSumOfAllPairsBitwiseAnd.java[Java] //|{doc_base_url}/1835-find-xor-sum-of-all-pairs-bitwise-and.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/remove-duplicates-from-an-unsorted-linked-list/[1836. Remove Duplicates From an Unsorted Linked List^] //|{source_base_url}/_1836_RemoveDuplicatesFromAnUnsortedLinkedList.java[Java] //|{doc_base_url}/1836-remove-duplicates-from-an-unsorted-linked-list.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/sum-of-digits-in-base-k/[1837. Sum of Digits in Base K^] //|{source_base_url}/_1837_SumOfDigitsInBaseK.java[Java] //|{doc_base_url}/1837-sum-of-digits-in-base-k.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/frequency-of-the-most-frequent-element/[1838. Frequency of the Most Frequent Element^] //|{source_base_url}/_1838_FrequencyOfTheMostFrequentElement.java[Java] //|{doc_base_url}/1838-frequency-of-the-most-frequent-element.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/longest-substring-of-all-vowels-in-order/[1839. Longest Substring Of All Vowels in Order^] //|{source_base_url}/_1839_LongestSubstringOfAllVowelsInOrder.java[Java] //|{doc_base_url}/1839-longest-substring-of-all-vowels-in-order.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-building-height/[1840. Maximum Building Height^] //|{source_base_url}/_1840_MaximumBuildingHeight.java[Java] //|{doc_base_url}/1840-maximum-building-height.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/league-statistics/[1841. League Statistics^] //|{source_base_url}/_1841_LeagueStatistics.java[Java] //|{doc_base_url}/1841-league-statistics.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/next-palindrome-using-same-digits/[1842. Next Palindrome Using Same Digits^] //|{source_base_url}/_1842_NextPalindromeUsingSameDigits.java[Java] //|{doc_base_url}/1842-next-palindrome-using-same-digits.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/suspicious-bank-accounts/[1843. Suspicious Bank Accounts^] //|{source_base_url}/_1843_SuspiciousBankAccounts.java[Java] //|{doc_base_url}/1843-suspicious-bank-accounts.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/replace-all-digits-with-characters/[1844. Replace All Digits with Characters^] //|{source_base_url}/_1844_ReplaceAllDigitsWithCharacters.java[Java] //|{doc_base_url}/1844-replace-all-digits-with-characters.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/seat-reservation-manager/[1845. Seat Reservation Manager^] //|{source_base_url}/_1845_SeatReservationManager.java[Java] //|{doc_base_url}/1845-seat-reservation-manager.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-element-after-decreasing-and-rearranging/[1846. Maximum Element After Decreasing and Rearranging^] //|{source_base_url}/_1846_MaximumElementAfterDecreasingAndRearranging.java[Java] //|{doc_base_url}/1846-maximum-element-after-decreasing-and-rearranging.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/closest-room/[1847. Closest Room^] //|{source_base_url}/_1847_ClosestRoom.java[Java] //|{doc_base_url}/1847-closest-room.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/minimum-distance-to-the-target-element/[1848. Minimum Distance to the Target Element^] //|{source_base_url}/_1848_MinimumDistanceToTheTargetElement.java[Java] //|{doc_base_url}/1848-minimum-distance-to-the-target-element.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/splitting-a-string-into-descending-consecutive-values/[1849. Splitting a String Into Descending Consecutive Values^] //|{source_base_url}/_1849_SplittingAStringIntoDescendingConsecutiveValues.java[Java] //|{doc_base_url}/1849-splitting-a-string-into-descending-consecutive-values.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-adjacent-swaps-to-reach-the-kth-smallest-number/[1850. Minimum Adjacent Swaps to Reach the Kth Smallest Number^] //|{source_base_url}/_1850_MinimumAdjacentSwapsToReachTheKthSmallestNumber.java[Java] //|{doc_base_url}/1850-minimum-adjacent-swaps-to-reach-the-kth-smallest-number.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-interval-to-include-each-query/[1851. Minimum Interval to Include Each Query^] //|{source_base_url}/_1851_MinimumIntervalToIncludeEachQuery.java[Java] //|{doc_base_url}/1851-minimum-interval-to-include-each-query.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/distinct-numbers-in-each-subarray/[1852. Distinct Numbers in Each Subarray^] //|{source_base_url}/_1852_DistinctNumbersInEachSubarray.java[Java] //|{doc_base_url}/1852-distinct-numbers-in-each-subarray.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/convert-date-format/[1853. Convert Date Format^] //|{source_base_url}/_1853_ConvertDateFormat.java[Java] //|{doc_base_url}/1853-convert-date-format.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/maximum-population-year/[1854. Maximum Population Year^] //|{source_base_url}/_1854_MaximumPopulationYear.java[Java] //|{doc_base_url}/1854-maximum-population-year.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/maximum-distance-between-a-pair-of-values/[1855. Maximum Distance Between a Pair of Values^] //|{source_base_url}/_1855_MaximumDistanceBetweenAPairOfValues.java[Java] //|{doc_base_url}/1855-maximum-distance-between-a-pair-of-values.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-subarray-min-product/[1856. Maximum Subarray Min-Product^] //|{source_base_url}/_1856_MaximumSubarrayMinProduct.java[Java] //|{doc_base_url}/1856-maximum-subarray-min-product.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/largest-color-value-in-a-directed-graph/[1857. Largest Color Value in a Directed Graph^] //|{source_base_url}/_1857_LargestColorValueInADirectedGraph.java[Java] //|{doc_base_url}/1857-largest-color-value-in-a-directed-graph.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/longest-word-with-all-prefixes/[1858. Longest Word With All Prefixes^] //|{source_base_url}/_1858_LongestWordWithAllPrefixes.java[Java] //|{doc_base_url}/1858-longest-word-with-all-prefixes.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/sorting-the-sentence/[1859. Sorting the Sentence^] //|{source_base_url}/_1859_SortingTheSentence.java[Java] //|{doc_base_url}/1859-sorting-the-sentence.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/incremental-memory-leak/[1860. Incremental Memory Leak^] //|{source_base_url}/_1860_IncrementalMemoryLeak.java[Java] //|{doc_base_url}/1860-incremental-memory-leak.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/rotating-the-box/[1861. Rotating the Box^] //|{source_base_url}/_1861_RotatingTheBox.java[Java] //|{doc_base_url}/1861-rotating-the-box.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/sum-of-floored-pairs/[1862. Sum of Floored Pairs^] //|{source_base_url}/_1862_SumOfFlooredPairs.java[Java] //|{doc_base_url}/1862-sum-of-floored-pairs.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/sum-of-all-subset-xor-totals/[1863. Sum of All Subset XOR Totals^] //|{source_base_url}/_1863_SumOfAllSubsetXorTotals.java[Java] //|{doc_base_url}/1863-sum-of-all-subset-xor-totals.adoc[题解] //|Easy //|

|{counter:codes} |{leetcode_base_url}/minimum-number-of-swaps-to-make-the-binary-string-alternating/[1864. Minimum Number of Swaps to Make the Binary String Alternating^] |{source_base_url}/_1864_MinimumNumberOfSwapsToMakeTheBinaryStringAlternating.java[Java] |{doc_base_url}/1864-minimum-number-of-swaps-to-make-the-binary-string-alternating.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/finding-pairs-with-a-certain-sum/[1865. Finding Pairs With a Certain Sum^] //|{source_base_url}/_1865_FindingPairsWithACertainSum.java[Java] //|{doc_base_url}/1865-finding-pairs-with-a-certain-sum.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/number-of-ways-to-rearrange-sticks-with-k-sticks-visible/[1866. Number of Ways to Rearrange Sticks With K Sticks Visible^] //|{source_base_url}/_1866_NumberOfWaysToRearrangeSticksWithKSticksVisible.java[Java] //|{doc_base_url}/1866-number-of-ways-to-rearrange-sticks-with-k-sticks-visible.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/orders-with-maximum-quantity-above-average/[1867. Orders With Maximum Quantity Above Average^] //|{source_base_url}/_1867_OrdersWithMaximumQuantityAboveAverage.java[Java] //|{doc_base_url}/1867-orders-with-maximum-quantity-above-average.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/product-of-two-run-length-encoded-arrays/[1868. Product of Two Run-Length Encoded Arrays^] //|{source_base_url}/_1868_ProductOfTwoRunLengthEncodedArrays.java[Java] //|{doc_base_url}/1868-product-of-two-run-length-encoded-arrays.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/longer-contiguous-segments-of-ones-than-zeros/[1869. Longer Contiguous Segments of Ones than Zeros^] //|{source_base_url}/_1869_LongerContiguousSegmentsOfOnesThanZeros.java[Java] //|{doc_base_url}/1869-longer-contiguous-segments-of-ones-than-zeros.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/minimum-speed-to-arrive-on-time/[1870. Minimum Speed to Arrive on Time^] //|{source_base_url}/_1870_MinimumSpeedToArriveOnTime.java[Java] //|{doc_base_url}/1870-minimum-speed-to-arrive-on-time.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/jump-game-vii/[1871. Jump Game VII^] //|{source_base_url}/_1871_JumpGameVii.java[Java] //|{doc_base_url}/1871-jump-game-vii.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/stone-game-viii/[1872. Stone Game VIII^] //|{source_base_url}/_1872_StoneGameViii.java[Java] //|{doc_base_url}/1872-stone-game-viii.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/calculate-special-bonus/[1873. Calculate Special Bonus^] //|{source_base_url}/_1873_CalculateSpecialBonus.java[Java] //|{doc_base_url}/1873-calculate-special-bonus.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/minimize-product-sum-of-two-arrays/[1874. Minimize Product Sum of Two Arrays^] //|{source_base_url}/_1874_MinimizeProductSumOfTwoArrays.java[Java] //|{doc_base_url}/1874-minimize-product-sum-of-two-arrays.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/group-employees-of-the-same-salary/[1875. Group Employees of the Same Salary^] //|{source_base_url}/_1875_GroupEmployeesOfTheSameSalary.java[Java] //|{doc_base_url}/1875-group-employees-of-the-same-salary.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/substrings-of-size-three-with-distinct-characters/[1876. Substrings of Size Three with Distinct Characters^] //|{source_base_url}/_1876_SubstringsOfSizeThreeWithDistinctCharacters.java[Java] //|{doc_base_url}/1876-substrings-of-size-three-with-distinct-characters.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/minimize-maximum-pair-sum-in-array/[1877. Minimize Maximum Pair Sum in Array^] //|{source_base_url}/_1877_MinimizeMaximumPairSumInArray.java[Java] //|{doc_base_url}/1877-minimize-maximum-pair-sum-in-array.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/get-biggest-three-rhombus-sums-in-a-grid/[1878. Get Biggest Three Rhombus Sums in a Grid^] //|{source_base_url}/_1878_GetBiggestThreeRhombusSumsInAGrid.java[Java] //|{doc_base_url}/1878-get-biggest-three-rhombus-sums-in-a-grid.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-xor-sum-of-two-arrays/[1879. Minimum XOR Sum of Two Arrays^] //|{source_base_url}/_1879_MinimumXorSumOfTwoArrays.java[Java] //|{doc_base_url}/1879-minimum-xor-sum-of-two-arrays.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/check-if-word-equals-summation-of-two-words/[1880. Check if Word Equals Summation of Two Words^] //|{source_base_url}/_1880_CheckIfWordEqualsSummationOfTwoWords.java[Java] //|{doc_base_url}/1880-check-if-word-equals-summation-of-two-words.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/maximum-value-after-insertion/[1881. Maximum Value after Insertion^] //|{source_base_url}/_1881_MaximumValueAfterInsertion.java[Java] //|{doc_base_url}/1881-maximum-value-after-insertion.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/process-tasks-using-servers/[1882. Process Tasks Using Servers^] //|{source_base_url}/_1882_ProcessTasksUsingServers.java[Java] //|{doc_base_url}/1882-process-tasks-using-servers.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-skips-to-arrive-at-meeting-on-time/[1883. Minimum Skips to Arrive at Meeting On Time^] //|{source_base_url}/_1883_MinimumSkipsToArriveAtMeetingOnTime.java[Java] //|{doc_base_url}/1883-minimum-skips-to-arrive-at-meeting-on-time.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/egg-drop-with-2-eggs-and-n-floors/[1884. Egg Drop With 2 Eggs and N Floors^] //|{source_base_url}/_1884_EggDropWith2EggsAndNFloors.java[Java] //|{doc_base_url}/1884-egg-drop-with-2-eggs-and-n-floors.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-pairs-in-two-arrays/[1885. Count Pairs in Two Arrays^] //|{source_base_url}/_1885_CountPairsInTwoArrays.java[Java] //|{doc_base_url}/1885-count-pairs-in-two-arrays.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/determine-whether-matrix-can-be-obtained-by-rotation/[1886. Determine Whether Matrix Can Be Obtained By Rotation^] //|{source_base_url}/_1886_DetermineWhetherMatrixCanBeObtainedByRotation.java[Java] //|{doc_base_url}/1886-determine-whether-matrix-can-be-obtained-by-rotation.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/reduction-operations-to-make-the-array-elements-equal/[1887. Reduction Operations to Make the Array Elements Equal^] //|{source_base_url}/_1887_ReductionOperationsToMakeTheArrayElementsEqual.java[Java] //|{doc_base_url}/1887-reduction-operations-to-make-the-array-elements-equal.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-number-of-flips-to-make-the-binary-string-alternating/[1888. Minimum Number of Flips to Make the Binary String Alternating^] //|{source_base_url}/_1888_MinimumNumberOfFlipsToMakeTheBinaryStringAlternating.java[Java] //|{doc_base_url}/1888-minimum-number-of-flips-to-make-the-binary-string-alternating.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-space-wasted-from-packaging/[1889. Minimum Space Wasted From Packaging^] //|{source_base_url}/_1889_MinimumSpaceWastedFromPackaging.java[Java] //|{doc_base_url}/1889-minimum-space-wasted-from-packaging.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/the-latest-login-in-2020/[1890. The Latest Login in 2020^] //|{source_base_url}/_1890_TheLatestLoginIn2020.java[Java] //|{doc_base_url}/1890-the-latest-login-in-2020.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/cutting-ribbons/[1891. Cutting Ribbons^] //|{source_base_url}/_1891_CuttingRibbons.java[Java] //|{doc_base_url}/1891-cutting-ribbons.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/page-recommendations-ii/[1892. Page Recommendations II^] //|{source_base_url}/_1892_PageRecommendationsIi.java[Java] //|{doc_base_url}/1892-page-recommendations-ii.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/check-if-all-the-integers-in-a-range-are-covered/[1893. Check if All the Integers in a Range Are Covered^] //|{source_base_url}/_1893_CheckIfAllTheIntegersInARangeAreCovered.java[Java] //|{doc_base_url}/1893-check-if-all-the-integers-in-a-range-are-covered.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/find-the-student-that-will-replace-the-chalk/[1894. Find the Student that Will Replace the Chalk^] //|{source_base_url}/_1894_FindTheStudentThatWillReplaceTheChalk.java[Java] //|{doc_base_url}/1894-find-the-student-that-will-replace-the-chalk.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/largest-magic-square/[1895. Largest Magic Square^] //|{source_base_url}/_1895_LargestMagicSquare.java[Java] //|{doc_base_url}/1895-largest-magic-square.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-cost-to-change-the-final-value-of-expression/[1896. Minimum Cost to Change the Final Value of Expression^] //|{source_base_url}/_1896_MinimumCostToChangeTheFinalValueOfExpression.java[Java] //|{doc_base_url}/1896-minimum-cost-to-change-the-final-value-of-expression.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/redistribute-characters-to-make-all-strings-equal/[1897. Redistribute Characters to Make All Strings Equal^] //|{source_base_url}/_1897_RedistributeCharactersToMakeAllStringsEqual.java[Java] //|{doc_base_url}/1897-redistribute-characters-to-make-all-strings-equal.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/maximum-number-of-removable-characters/[1898. Maximum Number of Removable Characters^] //|{source_base_url}/_1898_MaximumNumberOfRemovableCharacters.java[Java] //|{doc_base_url}/1898-maximum-number-of-removable-characters.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/merge-triplets-to-form-target-triplet/[1899. Merge Triplets to Form Target Triplet^] //|{source_base_url}/_1899_MergeTripletsToFormTargetTriplet.java[Java] //|{doc_base_url}/1899-merge-triplets-to-form-target-triplet.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/the-earliest-and-latest-rounds-where-players-compete/[1900. The Earliest and Latest Rounds Where Players Compete^] //|{source_base_url}/_1900_TheEarliestAndLatestRoundsWherePlayersCompete.java[Java] //|{doc_base_url}/1900-the-earliest-and-latest-rounds-where-players-compete.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/find-a-peak-element-ii/[1901. Find a Peak Element II^] //|{source_base_url}/_1901_FindAPeakElementIi.java[Java] //|{doc_base_url}/1901-find-a-peak-element-ii.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/depth-of-bst-given-insertion-order/[1902. Depth of BST Given Insertion Order^] //|{source_base_url}/_1902_DepthOfBstGivenInsertionOrder.java[Java] //|{doc_base_url}/1902-depth-of-bst-given-insertion-order.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/largest-odd-number-in-string/[1903. Largest Odd Number in String^] //|{source_base_url}/_1903_LargestOddNumberInString.java[Java] //|{doc_base_url}/1903-largest-odd-number-in-string.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/the-number-of-full-rounds-you-have-played/[1904. The Number of Full Rounds You Have Played^] //|{source_base_url}/_1904_TheNumberOfFullRoundsYouHavePlayed.java[Java] //|{doc_base_url}/1904-the-number-of-full-rounds-you-have-played.adoc[题解] //|Medium //|

|{counter:codes} |{leetcode_base_url}/count-sub-islands/[1905. Count Sub Islands^] |{source_base_url}/_1905_CountSubIslands.java[Java] |{doc_base_url}/1905-count-sub-islands.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/minimum-absolute-difference-queries/[1906. Minimum Absolute Difference Queries^] //|{source_base_url}/_1906_MinimumAbsoluteDifferenceQueries.java[Java] //|{doc_base_url}/1906-minimum-absolute-difference-queries.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-salary-categories/[1907. Count Salary Categories^] //|{source_base_url}/_1907_CountSalaryCategories.java[Java] //|{doc_base_url}/1907-count-salary-categories.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/game-of-nim/[1908. Game of Nim^] //|{source_base_url}/_1908_GameOfNim.java[Java] //|{doc_base_url}/1908-game-of-nim.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/remove-one-element-to-make-the-array-strictly-increasing/[1909. Remove One Element to Make the Array Strictly Increasing^] //|{source_base_url}/_1909_RemoveOneElementToMakeTheArrayStrictlyIncreasing.java[Java] //|{doc_base_url}/1909-remove-one-element-to-make-the-array-strictly-increasing.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/remove-all-occurrences-of-a-substring/[1910. Remove All Occurrences of a Substring^] //|{source_base_url}/_1910_RemoveAllOccurrencesOfASubstring.java[Java] //|{doc_base_url}/1910-remove-all-occurrences-of-a-substring.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-alternating-subsequence-sum/[1911. Maximum Alternating Subsequence Sum^] //|{source_base_url}/_1911_MaximumAlternatingSubsequenceSum.java[Java] //|{doc_base_url}/1911-maximum-alternating-subsequence-sum.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/design-movie-rental-system/[1912. Design Movie Rental System^] //|{source_base_url}/_1912_DesignMovieRentalSystem.java[Java] //|{doc_base_url}/1912-design-movie-rental-system.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/maximum-product-difference-between-two-pairs/[1913. Maximum Product Difference Between Two Pairs^] //|{source_base_url}/_1913_MaximumProductDifferenceBetweenTwoPairs.java[Java] //|{doc_base_url}/1913-maximum-product-difference-between-two-pairs.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/cyclically-rotating-a-grid/[1914. Cyclically Rotating a Grid^] //|{source_base_url}/_1914_CyclicallyRotatingAGrid.java[Java] //|{doc_base_url}/1914-cyclically-rotating-a-grid.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/number-of-wonderful-substrings/[1915. Number of Wonderful Substrings^] //|{source_base_url}/_1915_NumberOfWonderfulSubstrings.java[Java] //|{doc_base_url}/1915-number-of-wonderful-substrings.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-ways-to-build-rooms-in-an-ant-colony/[1916. Count Ways to Build Rooms in an Ant Colony^] //|{source_base_url}/_1916_CountWaysToBuildRoomsInAnAntColony.java[Java] //|{doc_base_url}/1916-count-ways-to-build-rooms-in-an-ant-colony.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/leetcodify-friends-recommendations/[1917. Leetcodify Friends Recommendations^] //|{source_base_url}/_1917_LeetcodifyFriendsRecommendations.java[Java] //|{doc_base_url}/1917-leetcodify-friends-recommendations.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/kth-smallest-subarray-sum/[1918. Kth Smallest Subarray Sum^] //|{source_base_url}/_1918_KthSmallestSubarraySum.java[Java] //|{doc_base_url}/1918-kth-smallest-subarray-sum.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/leetcodify-similar-friends/[1919. Leetcodify Similar Friends^] //|{source_base_url}/_1919_LeetcodifySimilarFriends.java[Java] //|{doc_base_url}/1919-leetcodify-similar-friends.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/build-array-from-permutation/[1920. Build Array from Permutation^] //|{source_base_url}/_1920_BuildArrayFromPermutation.java[Java] //|{doc_base_url}/1920-build-array-from-permutation.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/eliminate-maximum-number-of-monsters/[1921. Eliminate Maximum Number of Monsters^] //|{source_base_url}/_1921_EliminateMaximumNumberOfMonsters.java[Java] //|{doc_base_url}/1921-eliminate-maximum-number-of-monsters.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-good-numbers/[1922. Count Good Numbers^] //|{source_base_url}/_1922_CountGoodNumbers.java[Java] //|{doc_base_url}/1922-count-good-numbers.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/longest-common-subpath/[1923. Longest Common Subpath^] //|{source_base_url}/_1923_LongestCommonSubpath.java[Java] //|{doc_base_url}/1923-longest-common-subpath.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/erect-the-fence-ii/[1924. Erect the Fence II^] //|{source_base_url}/_1924_ErectTheFenceIi.java[Java] //|{doc_base_url}/1924-erect-the-fence-ii.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/count-square-sum-triples/[1925. Count Square Sum Triples^] //|{source_base_url}/_1925_CountSquareSumTriples.java[Java] //|{doc_base_url}/1925-count-square-sum-triples.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/nearest-exit-from-entrance-in-maze/[1926. Nearest Exit from Entrance in Maze^] //|{source_base_url}/_1926_NearestExitFromEntranceInMaze.java[Java] //|{doc_base_url}/1926-nearest-exit-from-entrance-in-maze.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/sum-game/[1927. Sum Game^] //|{source_base_url}/_1927_SumGame.java[Java] //|{doc_base_url}/1927-sum-game.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-cost-to-reach-destination-in-time/[1928. Minimum Cost to Reach Destination in Time^] //|{source_base_url}/_1928_MinimumCostToReachDestinationInTime.java[Java] //|{doc_base_url}/1928-minimum-cost-to-reach-destination-in-time.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/concatenation-of-array/[1929. Concatenation of Array^] //|{source_base_url}/_1929_ConcatenationOfArray.java[Java] //|{doc_base_url}/1929-concatenation-of-array.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/unique-length-3-palindromic-subsequences/[1930. Unique Length-3 Palindromic Subsequences^] //|{source_base_url}/_1930_UniqueLength3PalindromicSubsequences.java[Java] //|{doc_base_url}/1930-unique-length-3-palindromic-subsequences.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/painting-a-grid-with-three-different-colors/[1931. Painting a Grid With Three Different Colors^] //|{source_base_url}/_1931_PaintingAGridWithThreeDifferentColors.java[Java] //|{doc_base_url}/1931-painting-a-grid-with-three-different-colors.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/merge-bsts-to-create-single-bst/[1932. Merge BSTs to Create Single BST^] //|{source_base_url}/_1932_MergeBstsToCreateSingleBst.java[Java] //|{doc_base_url}/1932-merge-bsts-to-create-single-bst.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/check-if-string-is-decomposable-into-value-equal-substrings/[1933. Check if String Is Decomposable Into Value-Equal Substrings^] //|{source_base_url}/_1933_CheckIfStringIsDecomposableIntoValueEqualSubstrings.java[Java] //|{doc_base_url}/1933-check-if-string-is-decomposable-into-value-equal-substrings.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/confirmation-rate/[1934. Confirmation Rate^] //|{source_base_url}/_1934_ConfirmationRate.java[Java] //|{doc_base_url}/1934-confirmation-rate.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-number-of-words-you-can-type/[1935. Maximum Number of Words You Can Type^] //|{source_base_url}/_1935_MaximumNumberOfWordsYouCanType.java[Java] //|{doc_base_url}/1935-maximum-number-of-words-you-can-type.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/add-minimum-number-of-rungs/[1936. Add Minimum Number of Rungs^] //|{source_base_url}/_1936_AddMinimumNumberOfRungs.java[Java] //|{doc_base_url}/1936-add-minimum-number-of-rungs.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-number-of-points-with-cost/[1937. Maximum Number of Points with Cost^] //|{source_base_url}/_1937_MaximumNumberOfPointsWithCost.java[Java] //|{doc_base_url}/1937-maximum-number-of-points-with-cost.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-genetic-difference-query/[1938. Maximum Genetic Difference Query^] //|{source_base_url}/_1938_MaximumGeneticDifferenceQuery.java[Java] //|{doc_base_url}/1938-maximum-genetic-difference-query.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/users-that-actively-request-confirmation-messages/[1939. Users That Actively Request Confirmation Messages^] //|{source_base_url}/_1939_UsersThatActivelyRequestConfirmationMessages.java[Java] //|{doc_base_url}/1939-users-that-actively-request-confirmation-messages.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/longest-common-subsequence-between-sorted-arrays/[1940. Longest Common Subsequence Between Sorted Arrays^] //|{source_base_url}/_1940_LongestCommonSubsequenceBetweenSortedArrays.java[Java] //|{doc_base_url}/1940-longest-common-subsequence-between-sorted-arrays.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/check-if-all-characters-have-equal-number-of-occurrences/[1941. Check if All Characters Have Equal Number of Occurrences^] //|{source_base_url}/_1941_CheckIfAllCharactersHaveEqualNumberOfOccurrences.java[Java] //|{doc_base_url}/1941-check-if-all-characters-have-equal-number-of-occurrences.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/the-number-of-the-smallest-unoccupied-chair/[1942. The Number of the Smallest Unoccupied Chair^] //|{source_base_url}/_1942_TheNumberOfTheSmallestUnoccupiedChair.java[Java] //|{doc_base_url}/1942-the-number-of-the-smallest-unoccupied-chair.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/describe-the-painting/[1943. Describe the Painting^] //|{source_base_url}/_1943_DescribeThePainting.java[Java] //|{doc_base_url}/1943-describe-the-painting.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/number-of-visible-people-in-a-queue/[1944. Number of Visible People in a Queue^] //|{source_base_url}/_1944_NumberOfVisiblePeopleInAQueue.java[Java] //|{doc_base_url}/1944-number-of-visible-people-in-a-queue.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/sum-of-digits-of-string-after-convert/[1945. Sum of Digits of String After Convert^] //|{source_base_url}/_1945_SumOfDigitsOfStringAfterConvert.java[Java] //|{doc_base_url}/1945-sum-of-digits-of-string-after-convert.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/largest-number-after-mutating-substring/[1946. Largest Number After Mutating Substring^] //|{source_base_url}/_1946_LargestNumberAfterMutatingSubstring.java[Java] //|{doc_base_url}/1946-largest-number-after-mutating-substring.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-compatibility-score-sum/[1947. Maximum Compatibility Score Sum^] //|{source_base_url}/_1947_MaximumCompatibilityScoreSum.java[Java] //|{doc_base_url}/1947-maximum-compatibility-score-sum.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/delete-duplicate-folders-in-system/[1948. Delete Duplicate Folders in System^] //|{source_base_url}/_1948_DeleteDuplicateFoldersInSystem.java[Java] //|{doc_base_url}/1948-delete-duplicate-folders-in-system.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/strong-friendship/[1949. Strong Friendship^] //|{source_base_url}/_1949_StrongFriendship.java[Java] //|{doc_base_url}/1949-strong-friendship.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-of-minimum-values-in-all-subarrays/[1950. Maximum of Minimum Values in All Subarrays^] //|{source_base_url}/_1950_MaximumOfMinimumValuesInAllSubarrays.java[Java] //|{doc_base_url}/1950-maximum-of-minimum-values-in-all-subarrays.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/all-the-pairs-with-the-maximum-number-of-common-followers/[1951. All the Pairs With the Maximum Number of Common Followers^] //|{source_base_url}/_1951_AllThePairsWithTheMaximumNumberOfCommonFollowers.java[Java] //|{doc_base_url}/1951-all-the-pairs-with-the-maximum-number-of-common-followers.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/three-divisors/[1952. Three Divisors^] //|{source_base_url}/_1952_ThreeDivisors.java[Java] //|{doc_base_url}/1952-three-divisors.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/maximum-number-of-weeks-for-which-you-can-work/[1953. Maximum Number of Weeks for Which You Can Work^] //|{source_base_url}/_1953_MaximumNumberOfWeeksForWhichYouCanWork.java[Java] //|{doc_base_url}/1953-maximum-number-of-weeks-for-which-you-can-work.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-garden-perimeter-to-collect-enough-apples/[1954. Minimum Garden Perimeter to Collect Enough Apples^] //|{source_base_url}/_1954_MinimumGardenPerimeterToCollectEnoughApples.java[Java] //|{doc_base_url}/1954-minimum-garden-perimeter-to-collect-enough-apples.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-number-of-special-subsequences/[1955. Count Number of Special Subsequences^] //|{source_base_url}/_1955_CountNumberOfSpecialSubsequences.java[Java] //|{doc_base_url}/1955-count-number-of-special-subsequences.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/minimum-time-for-k-virus-variants-to-spread/[1956. Minimum Time For K Virus Variants to Spread^] //|{source_base_url}/_1956_MinimumTimeForKVirusVariantsToSpread.java[Java] //|{doc_base_url}/1956-minimum-time-for-k-virus-variants-to-spread.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/delete-characters-to-make-fancy-string/[1957. Delete Characters to Make Fancy String^] //|{source_base_url}/_1957_DeleteCharactersToMakeFancyString.java[Java] //|{doc_base_url}/1957-delete-characters-to-make-fancy-string.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/check-if-move-is-legal/[1958. Check if Move is Legal^] //|{source_base_url}/_1958_CheckIfMoveIsLegal.java[Java] //|{doc_base_url}/1958-check-if-move-is-legal.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-total-space-wasted-with-k-resizing-operations/[1959. Minimum Total Space Wasted With K Resizing Operations^] //|{source_base_url}/_1959_MinimumTotalSpaceWastedWithKResizingOperations.java[Java] //|{doc_base_url}/1959-minimum-total-space-wasted-with-k-resizing-operations.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-product-of-the-length-of-two-palindromic-substrings/[1960. Maximum Product of the Length of Two Palindromic Substrings^] //|{source_base_url}/_1960_MaximumProductOfTheLengthOfTwoPalindromicSubstrings.java[Java] //|{doc_base_url}/1960-maximum-product-of-the-length-of-two-palindromic-substrings.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/check-if-string-is-a-prefix-of-array/[1961. Check If String Is a Prefix of Array^] //|{source_base_url}/_1961_CheckIfStringIsAPrefixOfArray.java[Java] //|{doc_base_url}/1961-check-if-string-is-a-prefix-of-array.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/remove-stones-to-minimize-the-total/[1962. Remove Stones to Minimize the Total^] //|{source_base_url}/_1962_RemoveStonesToMinimizeTheTotal.java[Java] //|{doc_base_url}/1962-remove-stones-to-minimize-the-total.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-number-of-swaps-to-make-the-string-balanced/[1963. Minimum Number of Swaps to Make the String Balanced^] //|{source_base_url}/_1963_MinimumNumberOfSwapsToMakeTheStringBalanced.java[Java] //|{doc_base_url}/1963-minimum-number-of-swaps-to-make-the-string-balanced.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-the-longest-valid-obstacle-course-at-each-position/[1964. Find the Longest Valid Obstacle Course at Each Position^] //|{source_base_url}/_1964_FindTheLongestValidObstacleCourseAtEachPosition.java[Java] //|{doc_base_url}/1964-find-the-longest-valid-obstacle-course-at-each-position.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/employees-with-missing-information/[1965. Employees With Missing Information^] //|{source_base_url}/_1965_EmployeesWithMissingInformation.java[Java] //|{doc_base_url}/1965-employees-with-missing-information.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/binary-searchable-numbers-in-an-unsorted-array/[1966. Binary Searchable Numbers in an Unsorted Array^] //|{source_base_url}/_1966_BinarySearchableNumbersInAnUnsortedArray.java[Java] //|{doc_base_url}/1966-binary-searchable-numbers-in-an-unsorted-array.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/number-of-strings-that-appear-as-substrings-in-word/[1967. Number of Strings That Appear as Substrings in Word^] //|{source_base_url}/_1967_NumberOfStringsThatAppearAsSubstringsInWord.java[Java] //|{doc_base_url}/1967-number-of-strings-that-appear-as-substrings-in-word.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/array-with-elements-not-equal-to-average-of-neighbors/[1968. Array With Elements Not Equal to Average of Neighbors^] //|{source_base_url}/_1968_ArrayWithElementsNotEqualToAverageOfNeighbors.java[Java] //|{doc_base_url}/1968-array-with-elements-not-equal-to-average-of-neighbors.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-non-zero-product-of-the-array-elements/[1969. Minimum Non-Zero Product of the Array Elements^] //|{source_base_url}/_1969_MinimumNonZeroProductOfTheArrayElements.java[Java] //|{doc_base_url}/1969-minimum-non-zero-product-of-the-array-elements.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/last-day-where-you-can-still-cross/[1970. Last Day Where You Can Still Cross^] //|{source_base_url}/_1970_LastDayWhereYouCanStillCross.java[Java] //|{doc_base_url}/1970-last-day-where-you-can-still-cross.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/find-if-path-exists-in-graph/[1971. Find if Path Exists in Graph^] //|{source_base_url}/_1971_FindIfPathExistsInGraph.java[Java] //|{doc_base_url}/1971-find-if-path-exists-in-graph.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/first-and-last-call-on-the-same-day/[1972. First and Last Call On the Same Day^] //|{source_base_url}/_1972_FirstAndLastCallOnTheSameDay.java[Java] //|{doc_base_url}/1972-first-and-last-call-on-the-same-day.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/count-nodes-equal-to-sum-of-descendants/[1973. Count Nodes Equal to Sum of Descendants^] //|{source_base_url}/_1973_CountNodesEqualToSumOfDescendants.java[Java] //|{doc_base_url}/1973-count-nodes-equal-to-sum-of-descendants.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-time-to-type-word-using-special-typewriter/[1974. Minimum Time to Type Word Using Special Typewriter^] //|{source_base_url}/_1974_MinimumTimeToTypeWordUsingSpecialTypewriter.java[Java] //|{doc_base_url}/1974-minimum-time-to-type-word-using-special-typewriter.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/maximum-matrix-sum/[1975. Maximum Matrix Sum^] //|{source_base_url}/_1975_MaximumMatrixSum.java[Java] //|{doc_base_url}/1975-maximum-matrix-sum.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/number-of-ways-to-arrive-at-destination/[1976. Number of Ways to Arrive at Destination^] //|{source_base_url}/_1976_NumberOfWaysToArriveAtDestination.java[Java] //|{doc_base_url}/1976-number-of-ways-to-arrive-at-destination.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/number-of-ways-to-separate-numbers/[1977. Number of Ways to Separate Numbers^] //|{source_base_url}/_1977_NumberOfWaysToSeparateNumbers.java[Java] //|{doc_base_url}/1977-number-of-ways-to-separate-numbers.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/employees-whose-manager-left-the-company/[1978. Employees Whose Manager Left the Company^] //|{source_base_url}/_1978_EmployeesWhoseManagerLeftTheCompany.java[Java] //|{doc_base_url}/1978-employees-whose-manager-left-the-company.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/find-greatest-common-divisor-of-array/[1979. Find Greatest Common Divisor of Array^] //|{source_base_url}/_1979_FindGreatestCommonDivisorOfArray.java[Java] //|{doc_base_url}/1979-find-greatest-common-divisor-of-array.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/find-unique-binary-string/[1980. Find Unique Binary String^] //|{source_base_url}/_1980_FindUniqueBinaryString.java[Java] //|{doc_base_url}/1980-find-unique-binary-string.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimize-the-difference-between-target-and-chosen-elements/[1981. Minimize the Difference Between Target and Chosen Elements^] //|{source_base_url}/_1981_MinimizeTheDifferenceBetweenTargetAndChosenElements.java[Java] //|{doc_base_url}/1981-minimize-the-difference-between-target-and-chosen-elements.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-array-given-subset-sums/[1982. Find Array Given Subset Sums^] //|{source_base_url}/_1982_FindArrayGivenSubsetSums.java[Java] //|{doc_base_url}/1982-find-array-given-subset-sums.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/widest-pair-of-indices-with-equal-range-sum/[1983. Widest Pair of Indices With Equal Range Sum^] //|{source_base_url}/_1983_WidestPairOfIndicesWithEqualRangeSum.java[Java] //|{doc_base_url}/1983-widest-pair-of-indices-with-equal-range-sum.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-difference-between-highest-and-lowest-of-k-scores/[1984. Minimum Difference Between Highest and Lowest of K Scores^] //|{source_base_url}/_1984_MinimumDifferenceBetweenHighestAndLowestOfKScores.java[Java] //|{doc_base_url}/1984-minimum-difference-between-highest-and-lowest-of-k-scores.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/find-the-kth-largest-integer-in-the-array/[1985. Find the Kth Largest Integer in the Array^] //|{source_base_url}/_1985_FindTheKthLargestIntegerInTheArray.java[Java] //|{doc_base_url}/1985-find-the-kth-largest-integer-in-the-array.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-number-of-work-sessions-to-finish-the-tasks/[1986. Minimum Number of Work Sessions to Finish the Tasks^] //|{source_base_url}/_1986_MinimumNumberOfWorkSessionsToFinishTheTasks.java[Java] //|{doc_base_url}/1986-minimum-number-of-work-sessions-to-finish-the-tasks.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/number-of-unique-good-subsequences/[1987. Number of Unique Good Subsequences^] //|{source_base_url}/_1987_NumberOfUniqueGoodSubsequences.java[Java] //|{doc_base_url}/1987-number-of-unique-good-subsequences.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/find-cutoff-score-for-each-school/[1988. Find Cutoff Score for Each School^] //|{source_base_url}/_1988_FindCutoffScoreForEachSchool.java[Java] //|{doc_base_url}/1988-find-cutoff-score-for-each-school.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-number-of-people-that-can-be-caught-in-tag/[1989. Maximum Number of People That Can Be Caught in Tag^] //|{source_base_url}/_1989_MaximumNumberOfPeopleThatCanBeCaughtInTag.java[Java] //|{doc_base_url}/1989-maximum-number-of-people-that-can-be-caught-in-tag.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-the-number-of-experiments/[1990. Count the Number of Experiments^] //|{source_base_url}/_1990_CountTheNumberOfExperiments.java[Java] //|{doc_base_url}/1990-count-the-number-of-experiments.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-the-middle-index-in-array/[1991. Find the Middle Index in Array^] //|{source_base_url}/_1991_FindTheMiddleIndexInArray.java[Java] //|{doc_base_url}/1991-find-the-middle-index-in-array.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/find-all-groups-of-farmland/[1992. Find All Groups of Farmland^] //|{source_base_url}/_1992_FindAllGroupsOfFarmland.java[Java] //|{doc_base_url}/1992-find-all-groups-of-farmland.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/operations-on-tree/[1993. Operations on Tree^] //|{source_base_url}/_1993_OperationsOnTree.java[Java] //|{doc_base_url}/1993-operations-on-tree.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/the-number-of-good-subsets/[1994. The Number of Good Subsets^] //|{source_base_url}/_1994_TheNumberOfGoodSubsets.java[Java] //|{doc_base_url}/1994-the-number-of-good-subsets.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/count-special-quadruplets/[1995. Count Special Quadruplets^] //|{source_base_url}/_1995_CountSpecialQuadruplets.java[Java] //|{doc_base_url}/1995-count-special-quadruplets.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/the-number-of-weak-characters-in-the-game/[1996. The Number of Weak Characters in the Game^] //|{source_base_url}/_1996_TheNumberOfWeakCharactersInTheGame.java[Java] //|{doc_base_url}/1996-the-number-of-weak-characters-in-the-game.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/first-day-where-you-have-been-in-all-the-rooms/[1997. First Day Where You Have Been in All the Rooms^] //|{source_base_url}/_1997_FirstDayWhereYouHaveBeenInAllTheRooms.java[Java] //|{doc_base_url}/1997-first-day-where-you-have-been-in-all-the-rooms.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/gcd-sort-of-an-array/[1998. GCD Sort of an Array^] //|{source_base_url}/_1998_GcdSortOfAnArray.java[Java] //|{doc_base_url}/1998-gcd-sort-of-an-array.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/smallest-greater-multiple-made-of-two-digits/[1999. Smallest Greater Multiple Made of Two Digits^] //|{source_base_url}/_1999_SmallestGreaterMultipleMadeOfTwoDigits.java[Java] //|{doc_base_url}/1999-smallest-greater-multiple-made-of-two-digits.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/reverse-prefix-of-word/[2000. Reverse Prefix of Word^] //|{source_base_url}/_2000_ReversePrefixOfWord.java[Java] //|{doc_base_url}/2000-reverse-prefix-of-word.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/number-of-pairs-of-interchangeable-rectangles/[2001. Number of Pairs of Interchangeable Rectangles^] //|{source_base_url}/_2001_NumberOfPairsOfInterchangeableRectangles.java[Java] //|{doc_base_url}/2001-number-of-pairs-of-interchangeable-rectangles.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-product-of-the-length-of-two-palindromic-subsequences/[2002. Maximum Product of the Length of Two Palindromic Subsequences^] //|{source_base_url}/_2002_MaximumProductOfTheLengthOfTwoPalindromicSubsequences.java[Java] //|{doc_base_url}/2002-maximum-product-of-the-length-of-two-palindromic-subsequences.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/smallest-missing-genetic-value-in-each-subtree/[2003. Smallest Missing Genetic Value in Each Subtree^] //|{source_base_url}/_2003_SmallestMissingGeneticValueInEachSubtree.java[Java] //|{doc_base_url}/2003-smallest-missing-genetic-value-in-each-subtree.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/the-number-of-seniors-and-juniors-to-join-the-company/[2004. The Number of Seniors and Juniors to Join the Company^] //|{source_base_url}/_2004_TheNumberOfSeniorsAndJuniorsToJoinTheCompany.java[Java] //|{doc_base_url}/2004-the-number-of-seniors-and-juniors-to-join-the-company.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/subtree-removal-game-with-fibonacci-tree/[2005. Subtree Removal Game with Fibonacci Tree^] //|{source_base_url}/_2005_SubtreeRemovalGameWithFibonacciTree.java[Java] //|{doc_base_url}/2005-subtree-removal-game-with-fibonacci-tree.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/count-number-of-pairs-with-absolute-difference-k/[2006. Count Number of Pairs With Absolute Difference K^] //|{source_base_url}/_2006_CountNumberOfPairsWithAbsoluteDifferenceK.java[Java] //|{doc_base_url}/2006-count-number-of-pairs-with-absolute-difference-k.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/find-original-array-from-doubled-array/[2007. Find Original Array From Doubled Array^] //|{source_base_url}/_2007_FindOriginalArrayFromDoubledArray.java[Java] //|{doc_base_url}/2007-find-original-array-from-doubled-array.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-earnings-from-taxi/[2008. Maximum Earnings From Taxi^] //|{source_base_url}/_2008_MaximumEarningsFromTaxi.java[Java] //|{doc_base_url}/2008-maximum-earnings-from-taxi.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-number-of-operations-to-make-array-continuous/[2009. Minimum Number of Operations to Make Array Continuous^] //|{source_base_url}/_2009_MinimumNumberOfOperationsToMakeArrayContinuous.java[Java] //|{doc_base_url}/2009-minimum-number-of-operations-to-make-array-continuous.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/the-number-of-seniors-and-juniors-to-join-the-company-ii/[2010. The Number of Seniors and Juniors to Join the Company II^] //|{source_base_url}/_2010_TheNumberOfSeniorsAndJuniorsToJoinTheCompanyIi.java[Java] //|{doc_base_url}/2010-the-number-of-seniors-and-juniors-to-join-the-company-ii.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/final-value-of-variable-after-performing-operations/[2011. Final Value of Variable After Performing Operations^] //|{source_base_url}/_2011_FinalValueOfVariableAfterPerformingOperations.java[Java] //|{doc_base_url}/2011-final-value-of-variable-after-performing-operations.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/sum-of-beauty-in-the-array/[2012. Sum of Beauty in the Array^] //|{source_base_url}/_2012_SumOfBeautyInTheArray.java[Java] //|{doc_base_url}/2012-sum-of-beauty-in-the-array.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/detect-squares/[2013. Detect Squares^] //|{source_base_url}/_2013_DetectSquares.java[Java] //|{doc_base_url}/2013-detect-squares.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/longest-subsequence-repeated-k-times/[2014. Longest Subsequence Repeated k Times^] //|{source_base_url}/_2014_LongestSubsequenceRepeatedKTimes.java[Java] //|{doc_base_url}/2014-longest-subsequence-repeated-k-times.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/average-height-of-buildings-in-each-segment/[2015. Average Height of Buildings in Each Segment^] //|{source_base_url}/_2015_AverageHeightOfBuildingsInEachSegment.java[Java] //|{doc_base_url}/2015-average-height-of-buildings-in-each-segment.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-difference-between-increasing-elements/[2016. Maximum Difference Between Increasing Elements^] //|{source_base_url}/_2016_MaximumDifferenceBetweenIncreasingElements.java[Java] //|{doc_base_url}/2016-maximum-difference-between-increasing-elements.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/grid-game/[2017. Grid Game^] //|{source_base_url}/_2017_GridGame.java[Java] //|{doc_base_url}/2017-grid-game.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/check-if-word-can-be-placed-in-crossword/[2018. Check if Word Can Be Placed In Crossword^] //|{source_base_url}/_2018_CheckIfWordCanBePlacedInCrossword.java[Java] //|{doc_base_url}/2018-check-if-word-can-be-placed-in-crossword.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/the-score-of-students-solving-math-expression/[2019. The Score of Students Solving Math Expression^] //|{source_base_url}/_2019_TheScoreOfStudentsSolvingMathExpression.java[Java] //|{doc_base_url}/2019-the-score-of-students-solving-math-expression.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/number-of-accounts-that-did-not-stream/[2020. Number of Accounts That Did Not Stream^] //|{source_base_url}/_2020_NumberOfAccountsThatDidNotStream.java[Java] //|{doc_base_url}/2020-number-of-accounts-that-did-not-stream.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/brightest-position-on-street/[2021. Brightest Position on Street^] //|{source_base_url}/_2021_BrightestPositionOnStreet.java[Java] //|{doc_base_url}/2021-brightest-position-on-street.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/convert-1d-array-into-2d-array/[2022. Convert 1D Array Into 2D Array^] //|{source_base_url}/_2022_Convert1DArrayInto2DArray.java[Java] //|{doc_base_url}/2022-convert-1d-array-into-2d-array.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/number-of-pairs-of-strings-with-concatenation-equal-to-target/[2023. Number of Pairs of Strings With Concatenation Equal to Target^] //|{source_base_url}/_2023_NumberOfPairsOfStringsWithConcatenationEqualToTarget.java[Java] //|{doc_base_url}/2023-number-of-pairs-of-strings-with-concatenation-equal-to-target.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximize-the-confusion-of-an-exam/[2024. Maximize the Confusion of an Exam^] //|{source_base_url}/_2024_MaximizeTheConfusionOfAnExam.java[Java] //|{doc_base_url}/2024-maximize-the-confusion-of-an-exam.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-number-of-ways-to-partition-an-array/[2025. Maximum Number of Ways to Partition an Array^] //|{source_base_url}/_2025_MaximumNumberOfWaysToPartitionAnArray.java[Java] //|{doc_base_url}/2025-maximum-number-of-ways-to-partition-an-array.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/low-quality-problems/[2026. Low-Quality Problems^] //|{source_base_url}/_2026_LowQualityProblems.java[Java] //|{doc_base_url}/2026-low-quality-problems.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/minimum-moves-to-convert-string/[2027. Minimum Moves to Convert String^] //|{source_base_url}/_2027_MinimumMovesToConvertString.java[Java] //|{doc_base_url}/2027-minimum-moves-to-convert-string.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/find-missing-observations/[2028. Find Missing Observations^] //|{source_base_url}/_2028_FindMissingObservations.java[Java] //|{doc_base_url}/2028-find-missing-observations.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/stone-game-ix/[2029. Stone Game IX^] //|{source_base_url}/_2029_StoneGameIx.java[Java] //|{doc_base_url}/2029-stone-game-ix.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/smallest-k-length-subsequence-with-occurrences-of-a-letter/[2030. Smallest K-Length Subsequence With Occurrences of a Letter^] //|{source_base_url}/_2030_SmallestKLengthSubsequenceWithOccurrencesOfALetter.java[Java] //|{doc_base_url}/2030-smallest-k-length-subsequence-with-occurrences-of-a-letter.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/count-subarrays-with-more-ones-than-zeros/[2031. Count Subarrays With More Ones Than Zeros^] //|{source_base_url}/_2031_CountSubarraysWithMoreOnesThanZeros.java[Java] //|{doc_base_url}/2031-count-subarrays-with-more-ones-than-zeros.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/two-out-of-three/[2032. Two Out of Three^] //|{source_base_url}/_2032_TwoOutOfThree.java[Java] //|{doc_base_url}/2032-two-out-of-three.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/minimum-operations-to-make-a-uni-value-grid/[2033. Minimum Operations to Make a Uni-Value Grid^] //|{source_base_url}/_2033_MinimumOperationsToMakeAUniValueGrid.java[Java] //|{doc_base_url}/2033-minimum-operations-to-make-a-uni-value-grid.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/stock-price-fluctuation/[2034. Stock Price Fluctuation ^] //|{source_base_url}/_2034_StockPriceFluctuation.java[Java] //|{doc_base_url}/2034-stock-price-fluctuation.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/partition-array-into-two-arrays-to-minimize-sum-difference/[2035. Partition Array Into Two Arrays to Minimize Sum Difference^] //|{source_base_url}/_2035_PartitionArrayIntoTwoArraysToMinimizeSumDifference.java[Java] //|{doc_base_url}/2035-partition-array-into-two-arrays-to-minimize-sum-difference.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/maximum-alternating-subarray-sum/[2036. Maximum Alternating Subarray Sum^] //|{source_base_url}/_2036_MaximumAlternatingSubarraySum.java[Java] //|{doc_base_url}/2036-maximum-alternating-subarray-sum.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-number-of-moves-to-seat-everyone/[2037. Minimum Number of Moves to Seat Everyone^] //|{source_base_url}/_2037_MinimumNumberOfMovesToSeatEveryone.java[Java] //|{doc_base_url}/2037-minimum-number-of-moves-to-seat-everyone.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/remove-colored-pieces-if-both-neighbors-are-the-same-color/[2038. Remove Colored Pieces if Both Neighbors are the Same Color^] //|{source_base_url}/_2038_RemoveColoredPiecesIfBothNeighborsAreTheSameColor.java[Java] //|{doc_base_url}/2038-remove-colored-pieces-if-both-neighbors-are-the-same-color.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/the-time-when-the-network-becomes-idle/[2039. The Time When the Network Becomes Idle^] //|{source_base_url}/_2039_TheTimeWhenTheNetworkBecomesIdle.java[Java] //|{doc_base_url}/2039-the-time-when-the-network-becomes-idle.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/kth-smallest-product-of-two-sorted-arrays/[2040. Kth Smallest Product of Two Sorted Arrays^] //|{source_base_url}/_2040_KthSmallestProductOfTwoSortedArrays.java[Java] //|{doc_base_url}/2040-kth-smallest-product-of-two-sorted-arrays.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/accepted-candidates-from-the-interviews/[2041. Accepted Candidates From the Interviews^] //|{source_base_url}/_2041_AcceptedCandidatesFromTheInterviews.java[Java] //|{doc_base_url}/2041-accepted-candidates-from-the-interviews.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/check-if-numbers-are-ascending-in-a-sentence/[2042. Check if Numbers Are Ascending in a Sentence^] //|{source_base_url}/_2042_CheckIfNumbersAreAscendingInASentence.java[Java] //|{doc_base_url}/2042-check-if-numbers-are-ascending-in-a-sentence.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/simple-bank-system/[2043. Simple Bank System^] //|{source_base_url}/_2043_SimpleBankSystem.java[Java] //|{doc_base_url}/2043-simple-bank-system.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-number-of-maximum-bitwise-or-subsets/[2044. Count Number of Maximum Bitwise-OR Subsets^] //|{source_base_url}/_2044_CountNumberOfMaximumBitwiseOrSubsets.java[Java] //|{doc_base_url}/2044-count-number-of-maximum-bitwise-or-subsets.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/second-minimum-time-to-reach-destination/[2045. Second Minimum Time to Reach Destination^] //|{source_base_url}/_2045_SecondMinimumTimeToReachDestination.java[Java] //|{doc_base_url}/2045-second-minimum-time-to-reach-destination.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/sort-linked-list-already-sorted-using-absolute-values/[2046. Sort Linked List Already Sorted Using Absolute Values^] //|{source_base_url}/_2046_SortLinkedListAlreadySortedUsingAbsoluteValues.java[Java] //|{doc_base_url}/2046-sort-linked-list-already-sorted-using-absolute-values.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/number-of-valid-words-in-a-sentence/[2047. Number of Valid Words in a Sentence^] //|{source_base_url}/_2047_NumberOfValidWordsInASentence.java[Java] //|{doc_base_url}/2047-number-of-valid-words-in-a-sentence.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/next-greater-numerically-balanced-number/[2048. Next Greater Numerically Balanced Number^] //|{source_base_url}/_2048_NextGreaterNumericallyBalancedNumber.java[Java] //|{doc_base_url}/2048-next-greater-numerically-balanced-number.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-nodes-with-the-highest-score/[2049. Count Nodes With the Highest Score^] //|{source_base_url}/_2049_CountNodesWithTheHighestScore.java[Java] //|{doc_base_url}/2049-count-nodes-with-the-highest-score.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/parallel-courses-iii/[2050. Parallel Courses III^] //|{source_base_url}/_2050_ParallelCoursesIii.java[Java] //|{doc_base_url}/2050-parallel-courses-iii.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/the-category-of-each-member-in-the-store/[2051. The Category of Each Member in the Store^] //|{source_base_url}/_2051_TheCategoryOfEachMemberInTheStore.java[Java] //|{doc_base_url}/2051-the-category-of-each-member-in-the-store.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-cost-to-separate-sentence-into-rows/[2052. Minimum Cost to Separate Sentence Into Rows^] //|{source_base_url}/_2052_MinimumCostToSeparateSentenceIntoRows.java[Java] //|{doc_base_url}/2052-minimum-cost-to-separate-sentence-into-rows.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/kth-distinct-string-in-an-array/[2053. Kth Distinct String in an Array^] //|{source_base_url}/_2053_KthDistinctStringInAnArray.java[Java] //|{doc_base_url}/2053-kth-distinct-string-in-an-array.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/two-best-non-overlapping-events/[2054. Two Best Non-Overlapping Events^] //|{source_base_url}/_2054_TwoBestNonOverlappingEvents.java[Java] //|{doc_base_url}/2054-two-best-non-overlapping-events.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/plates-between-candles/[2055. Plates Between Candles^] //|{source_base_url}/_2055_PlatesBetweenCandles.java[Java] //|{doc_base_url}/2055-plates-between-candles.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/number-of-valid-move-combinations-on-chessboard/[2056. Number of Valid Move Combinations On Chessboard^] //|{source_base_url}/_2056_NumberOfValidMoveCombinationsOnChessboard.java[Java] //|{doc_base_url}/2056-number-of-valid-move-combinations-on-chessboard.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/smallest-index-with-equal-value/[2057. Smallest Index With Equal Value^] //|{source_base_url}/_2057_SmallestIndexWithEqualValue.java[Java] //|{doc_base_url}/2057-smallest-index-with-equal-value.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/find-the-minimum-and-maximum-number-of-nodes-between-critical-points/[2058. Find the Minimum and Maximum Number of Nodes Between Critical Points^] //|{source_base_url}/_2058_FindTheMinimumAndMaximumNumberOfNodesBetweenCriticalPoints.java[Java] //|{doc_base_url}/2058-find-the-minimum-and-maximum-number-of-nodes-between-critical-points.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-operations-to-convert-number/[2059. Minimum Operations to Convert Number^] //|{source_base_url}/_2059_MinimumOperationsToConvertNumber.java[Java] //|{doc_base_url}/2059-minimum-operations-to-convert-number.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/check-if-an-original-string-exists-given-two-encoded-strings/[2060. Check if an Original String Exists Given Two Encoded Strings^] //|{source_base_url}/_2060_CheckIfAnOriginalStringExistsGivenTwoEncodedStrings.java[Java] //|{doc_base_url}/2060-check-if-an-original-string-exists-given-two-encoded-strings.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/number-of-spaces-cleaning-robot-cleaned/[2061. Number of Spaces Cleaning Robot Cleaned^] //|{source_base_url}/_2061_NumberOfSpacesCleaningRobotCleaned.java[Java] //|{doc_base_url}/2061-number-of-spaces-cleaning-robot-cleaned.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-vowel-substrings-of-a-string/[2062. Count Vowel Substrings of a String^] //|{source_base_url}/_2062_CountVowelSubstringsOfAString.java[Java] //|{doc_base_url}/2062-count-vowel-substrings-of-a-string.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/vowels-of-all-substrings/[2063. Vowels of All Substrings^] //|{source_base_url}/_2063_VowelsOfAllSubstrings.java[Java] //|{doc_base_url}/2063-vowels-of-all-substrings.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimized-maximum-of-products-distributed-to-any-store/[2064. Minimized Maximum of Products Distributed to Any Store^] //|{source_base_url}/_2064_MinimizedMaximumOfProductsDistributedToAnyStore.java[Java] //|{doc_base_url}/2064-minimized-maximum-of-products-distributed-to-any-store.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-path-quality-of-a-graph/[2065. Maximum Path Quality of a Graph^] //|{source_base_url}/_2065_MaximumPathQualityOfAGraph.java[Java] //|{doc_base_url}/2065-maximum-path-quality-of-a-graph.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/account-balance/[2066. Account Balance^] //|{source_base_url}/_2066_AccountBalance.java[Java] //|{doc_base_url}/2066-account-balance.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/number-of-equal-count-substrings/[2067. Number of Equal Count Substrings^] //|{source_base_url}/_2067_NumberOfEqualCountSubstrings.java[Java] //|{doc_base_url}/2067-number-of-equal-count-substrings.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/check-whether-two-strings-are-almost-equivalent/[2068. Check Whether Two Strings are Almost Equivalent^] //|{source_base_url}/_2068_CheckWhetherTwoStringsAreAlmostEquivalent.java[Java] //|{doc_base_url}/2068-check-whether-two-strings-are-almost-equivalent.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/walking-robot-simulation-ii/[2069. Walking Robot Simulation II^] //|{source_base_url}/_2069_WalkingRobotSimulationIi.java[Java] //|{doc_base_url}/2069-walking-robot-simulation-ii.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/most-beautiful-item-for-each-query/[2070. Most Beautiful Item for Each Query^] //|{source_base_url}/_2070_MostBeautifulItemForEachQuery.java[Java] //|{doc_base_url}/2070-most-beautiful-item-for-each-query.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-number-of-tasks-you-can-assign/[2071. Maximum Number of Tasks You Can Assign^] //|{source_base_url}/_2071_MaximumNumberOfTasksYouCanAssign.java[Java] //|{doc_base_url}/2071-maximum-number-of-tasks-you-can-assign.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/the-winner-university/[2072. The Winner University^] //|{source_base_url}/_2072_TheWinnerUniversity.java[Java] //|{doc_base_url}/2072-the-winner-university.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/time-needed-to-buy-tickets/[2073. Time Needed to Buy Tickets^] //|{source_base_url}/_2073_TimeNeededToBuyTickets.java[Java] //|{doc_base_url}/2073-time-needed-to-buy-tickets.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/reverse-nodes-in-even-length-groups/[2074. Reverse Nodes in Even Length Groups^] //|{source_base_url}/_2074_ReverseNodesInEvenLengthGroups.java[Java] //|{doc_base_url}/2074-reverse-nodes-in-even-length-groups.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/decode-the-slanted-ciphertext/[2075. Decode the Slanted Ciphertext^] //|{source_base_url}/_2075_DecodeTheSlantedCiphertext.java[Java] //|{doc_base_url}/2075-decode-the-slanted-ciphertext.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/process-restricted-friend-requests/[2076. Process Restricted Friend Requests^] //|{source_base_url}/_2076_ProcessRestrictedFriendRequests.java[Java] //|{doc_base_url}/2076-process-restricted-friend-requests.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/paths-in-maze-that-lead-to-same-room/[2077. Paths in Maze That Lead to Same Room^] //|{source_base_url}/_2077_PathsInMazeThatLeadToSameRoom.java[Java] //|{doc_base_url}/2077-paths-in-maze-that-lead-to-same-room.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/two-furthest-houses-with-different-colors/[2078. Two Furthest Houses With Different Colors^] //|{source_base_url}/_2078_TwoFurthestHousesWithDifferentColors.java[Java] //|{doc_base_url}/2078-two-furthest-houses-with-different-colors.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/watering-plants/[2079. Watering Plants^] //|{source_base_url}/_2079_WateringPlants.java[Java] //|{doc_base_url}/2079-watering-plants.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/range-frequency-queries/[2080. Range Frequency Queries^] //|{source_base_url}/_2080_RangeFrequencyQueries.java[Java] //|{doc_base_url}/2080-range-frequency-queries.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/sum-of-k-mirror-numbers/[2081. Sum of k-Mirror Numbers^] //|{source_base_url}/_2081_SumOfKMirrorNumbers.java[Java] //|{doc_base_url}/2081-sum-of-k-mirror-numbers.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/the-number-of-rich-customers/[2082. The Number of Rich Customers^] //|{source_base_url}/_2082_TheNumberOfRichCustomers.java[Java] //|{doc_base_url}/2082-the-number-of-rich-customers.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/substrings-that-begin-and-end-with-the-same-letter/[2083. Substrings That Begin and End With the Same Letter^] //|{source_base_url}/_2083_SubstringsThatBeginAndEndWithTheSameLetter.java[Java] //|{doc_base_url}/2083-substrings-that-begin-and-end-with-the-same-letter.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/drop-type-1-orders-for-customers-with-type-0-orders/[2084. Drop Type 1 Orders for Customers With Type 0 Orders^] //|{source_base_url}/_2084_DropType1OrdersForCustomersWithType0Orders.java[Java] //|{doc_base_url}/2084-drop-type-1-orders-for-customers-with-type-0-orders.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-common-words-with-one-occurrence/[2085. Count Common Words With One Occurrence^] //|{source_base_url}/_2085_CountCommonWordsWithOneOccurrence.java[Java] //|{doc_base_url}/2085-count-common-words-with-one-occurrence.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/minimum-number-of-food-buckets-to-feed-the-hamsters/[2086. Minimum Number of Food Buckets to Feed the Hamsters^] //|{source_base_url}/_2086_MinimumNumberOfFoodBucketsToFeedTheHamsters.java[Java] //|{doc_base_url}/2086-minimum-number-of-food-buckets-to-feed-the-hamsters.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-cost-homecoming-of-a-robot-in-a-grid/[2087. Minimum Cost Homecoming of a Robot in a Grid^] //|{source_base_url}/_2087_MinimumCostHomecomingOfARobotInAGrid.java[Java] //|{doc_base_url}/2087-minimum-cost-homecoming-of-a-robot-in-a-grid.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-fertile-pyramids-in-a-land/[2088. Count Fertile Pyramids in a Land^] //|{source_base_url}/_2088_CountFertilePyramidsInALand.java[Java] //|{doc_base_url}/2088-count-fertile-pyramids-in-a-land.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/find-target-indices-after-sorting-array/[2089. Find Target Indices After Sorting Array^] //|{source_base_url}/_2089_FindTargetIndicesAfterSortingArray.java[Java] //|{doc_base_url}/2089-find-target-indices-after-sorting-array.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/k-radius-subarray-averages/[2090. K Radius Subarray Averages^] //|{source_base_url}/_2090_KRadiusSubarrayAverages.java[Java] //|{doc_base_url}/2090-k-radius-subarray-averages.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/removing-minimum-and-maximum-from-array/[2091. Removing Minimum and Maximum From Array^] //|{source_base_url}/_2091_RemovingMinimumAndMaximumFromArray.java[Java] //|{doc_base_url}/2091-removing-minimum-and-maximum-from-array.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-all-people-with-secret/[2092. Find All People With Secret^] //|{source_base_url}/_2092_FindAllPeopleWithSecret.java[Java] //|{doc_base_url}/2092-find-all-people-with-secret.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/minimum-cost-to-reach-city-with-discounts/[2093. Minimum Cost to Reach City With Discounts^] //|{source_base_url}/_2093_MinimumCostToReachCityWithDiscounts.java[Java] //|{doc_base_url}/2093-minimum-cost-to-reach-city-with-discounts.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/finding-3-digit-even-numbers/[2094. Finding 3-Digit Even Numbers^] //|{source_base_url}/_2094_Finding3DigitEvenNumbers.java[Java] //|{doc_base_url}/2094-finding-3-digit-even-numbers.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/delete-the-middle-node-of-a-linked-list/[2095. Delete the Middle Node of a Linked List^] //|{source_base_url}/_2095_DeleteTheMiddleNodeOfALinkedList.java[Java] //|{doc_base_url}/2095-delete-the-middle-node-of-a-linked-list.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/step-by-step-directions-from-a-binary-tree-node-to-another/[2096. Step-By-Step Directions From a Binary Tree Node to Another^] //|{source_base_url}/_2096_StepByStepDirectionsFromABinaryTreeNodeToAnother.java[Java] //|{doc_base_url}/2096-step-by-step-directions-from-a-binary-tree-node-to-another.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/valid-arrangement-of-pairs/[2097. Valid Arrangement of Pairs^] //|{source_base_url}/_2097_ValidArrangementOfPairs.java[Java] //|{doc_base_url}/2097-valid-arrangement-of-pairs.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/subsequence-of-size-k-with-the-largest-even-sum/[2098. Subsequence of Size K With the Largest Even Sum^] //|{source_base_url}/_2098_SubsequenceOfSizeKWithTheLargestEvenSum.java[Java] //|{doc_base_url}/2098-subsequence-of-size-k-with-the-largest-even-sum.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-subsequence-of-length-k-with-the-largest-sum/[2099. Find Subsequence of Length K With the Largest Sum^] //|{source_base_url}/_2099_FindSubsequenceOfLengthKWithTheLargestSum.java[Java] //|{doc_base_url}/2099-find-subsequence-of-length-k-with-the-largest-sum.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/find-good-days-to-rob-the-bank/[2100. Find Good Days to Rob the Bank^] //|{source_base_url}/_2100_FindGoodDaysToRobTheBank.java[Java] //|{doc_base_url}/2100-find-good-days-to-rob-the-bank.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/detonate-the-maximum-bombs/[2101. Detonate the Maximum Bombs^] //|{source_base_url}/_2101_DetonateTheMaximumBombs.java[Java] //|{doc_base_url}/2101-detonate-the-maximum-bombs.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/sequentially-ordinal-rank-tracker/[2102. Sequentially Ordinal Rank Tracker^] //|{source_base_url}/_2102_SequentiallyOrdinalRankTracker.java[Java] //|{doc_base_url}/2102-sequentially-ordinal-rank-tracker.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/rings-and-rods/[2103. Rings and Rods^] //|{source_base_url}/_2103_RingsAndRods.java[Java] //|{doc_base_url}/2103-rings-and-rods.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/sum-of-subarray-ranges/[2104. Sum of Subarray Ranges^] //|{source_base_url}/_2104_SumOfSubarrayRanges.java[Java] //|{doc_base_url}/2104-sum-of-subarray-ranges.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/watering-plants-ii/[2105. Watering Plants II^] //|{source_base_url}/_2105_WateringPlantsIi.java[Java] //|{doc_base_url}/2105-watering-plants-ii.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-fruits-harvested-after-at-most-k-steps/[2106. Maximum Fruits Harvested After at Most K Steps^] //|{source_base_url}/_2106_MaximumFruitsHarvestedAfterAtMostKSteps.java[Java] //|{doc_base_url}/2106-maximum-fruits-harvested-after-at-most-k-steps.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/number-of-unique-flavors-after-sharing-k-candies/[2107. Number of Unique Flavors After Sharing K Candies^] //|{source_base_url}/_2107_NumberOfUniqueFlavorsAfterSharingKCandies.java[Java] //|{doc_base_url}/2107-number-of-unique-flavors-after-sharing-k-candies.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-first-palindromic-string-in-the-array/[2108. Find First Palindromic String in the Array^] //|{source_base_url}/_2108_FindFirstPalindromicStringInTheArray.java[Java] //|{doc_base_url}/2108-find-first-palindromic-string-in-the-array.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/adding-spaces-to-a-string/[2109. Adding Spaces to a String^] //|{source_base_url}/_2109_AddingSpacesToAString.java[Java] //|{doc_base_url}/2109-adding-spaces-to-a-string.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/number-of-smooth-descent-periods-of-a-stock/[2110. Number of Smooth Descent Periods of a Stock^] //|{source_base_url}/_2110_NumberOfSmoothDescentPeriodsOfAStock.java[Java] //|{doc_base_url}/2110-number-of-smooth-descent-periods-of-a-stock.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-operations-to-make-the-array-k-increasing/[2111. Minimum Operations to Make the Array K-Increasing^] //|{source_base_url}/_2111_MinimumOperationsToMakeTheArrayKIncreasing.java[Java] //|{doc_base_url}/2111-minimum-operations-to-make-the-array-k-increasing.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/the-airport-with-the-most-traffic/[2112. The Airport With the Most Traffic^] //|{source_base_url}/_2112_TheAirportWithTheMostTraffic.java[Java] //|{doc_base_url}/2112-the-airport-with-the-most-traffic.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/elements-in-array-after-removing-and-replacing-elements/[2113. Elements in Array After Removing and Replacing Elements^] //|{source_base_url}/_2113_ElementsInArrayAfterRemovingAndReplacingElements.java[Java] //|{doc_base_url}/2113-elements-in-array-after-removing-and-replacing-elements.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-number-of-words-found-in-sentences/[2114. Maximum Number of Words Found in Sentences^] //|{source_base_url}/_2114_MaximumNumberOfWordsFoundInSentences.java[Java] //|{doc_base_url}/2114-maximum-number-of-words-found-in-sentences.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/find-all-possible-recipes-from-given-supplies/[2115. Find All Possible Recipes from Given Supplies^] //|{source_base_url}/_2115_FindAllPossibleRecipesFromGivenSupplies.java[Java] //|{doc_base_url}/2115-find-all-possible-recipes-from-given-supplies.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/check-if-a-parentheses-string-can-be-valid/[2116. Check if a Parentheses String Can Be Valid^] //|{source_base_url}/_2116_CheckIfAParenthesesStringCanBeValid.java[Java] //|{doc_base_url}/2116-check-if-a-parentheses-string-can-be-valid.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/abbreviating-the-product-of-a-range/[2117. Abbreviating the Product of a Range^] //|{source_base_url}/_2117_AbbreviatingTheProductOfARange.java[Java] //|{doc_base_url}/2117-abbreviating-the-product-of-a-range.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/build-the-equation/[2118. Build the Equation^] //|{source_base_url}/_2118_BuildTheEquation.java[Java] //|{doc_base_url}/2118-build-the-equation.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/a-number-after-a-double-reversal/[2119. A Number After a Double Reversal^] //|{source_base_url}/_2119_ANumberAfterADoubleReversal.java[Java] //|{doc_base_url}/2119-a-number-after-a-double-reversal.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/execution-of-all-suffix-instructions-staying-in-a-grid/[2120. Execution of All Suffix Instructions Staying in a Grid^] //|{source_base_url}/_2120_ExecutionOfAllSuffixInstructionsStayingInAGrid.java[Java] //|{doc_base_url}/2120-execution-of-all-suffix-instructions-staying-in-a-grid.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/intervals-between-identical-elements/[2121. Intervals Between Identical Elements^] //|{source_base_url}/_2121_IntervalsBetweenIdenticalElements.java[Java] //|{doc_base_url}/2121-intervals-between-identical-elements.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/recover-the-original-array/[2122. Recover the Original Array^] //|{source_base_url}/_2122_RecoverTheOriginalArray.java[Java] //|{doc_base_url}/2122-recover-the-original-array.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/minimum-operations-to-remove-adjacent-ones-in-matrix/[2123. Minimum Operations to Remove Adjacent Ones in Matrix^] //|{source_base_url}/_2123_MinimumOperationsToRemoveAdjacentOnesInMatrix.java[Java] //|{doc_base_url}/2123-minimum-operations-to-remove-adjacent-ones-in-matrix.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/check-if-all-as-appears-before-all-bs/[2124. Check if All A's Appears Before All B's^] //|{source_base_url}/_2124_CheckIfAllASAppearsBeforeAllBS.java[Java] //|{doc_base_url}/2124-check-if-all-as-appears-before-all-bs.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/number-of-laser-beams-in-a-bank/[2125. Number of Laser Beams in a Bank^] //|{source_base_url}/_2125_NumberOfLaserBeamsInABank.java[Java] //|{doc_base_url}/2125-number-of-laser-beams-in-a-bank.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/destroying-asteroids/[2126. Destroying Asteroids^] //|{source_base_url}/_2126_DestroyingAsteroids.java[Java] //|{doc_base_url}/2126-destroying-asteroids.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-employees-to-be-invited-to-a-meeting/[2127. Maximum Employees to Be Invited to a Meeting^] //|{source_base_url}/_2127_MaximumEmployeesToBeInvitedToAMeeting.java[Java] //|{doc_base_url}/2127-maximum-employees-to-be-invited-to-a-meeting.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/remove-all-ones-with-row-and-column-flips/[2128. Remove All Ones With Row and Column Flips^] //|{source_base_url}/_2128_RemoveAllOnesWithRowAndColumnFlips.java[Java] //|{doc_base_url}/2128-remove-all-ones-with-row-and-column-flips.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/capitalize-the-title/[2129. Capitalize the Title^] //|{source_base_url}/_2129_CapitalizeTheTitle.java[Java] //|{doc_base_url}/2129-capitalize-the-title.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/maximum-twin-sum-of-a-linked-list/[2130. Maximum Twin Sum of a Linked List^] //|{source_base_url}/_2130_MaximumTwinSumOfALinkedList.java[Java] //|{doc_base_url}/2130-maximum-twin-sum-of-a-linked-list.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/longest-palindrome-by-concatenating-two-letter-words/[2131. Longest Palindrome by Concatenating Two Letter Words^] //|{source_base_url}/_2131_LongestPalindromeByConcatenatingTwoLetterWords.java[Java] //|{doc_base_url}/2131-longest-palindrome-by-concatenating-two-letter-words.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/stamping-the-grid/[2132. Stamping the Grid^] //|{source_base_url}/_2132_StampingTheGrid.java[Java] //|{doc_base_url}/2132-stamping-the-grid.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/check-if-every-row-and-column-contains-all-numbers/[2133. Check if Every Row and Column Contains All Numbers^] //|{source_base_url}/_2133_CheckIfEveryRowAndColumnContainsAllNumbers.java[Java] //|{doc_base_url}/2133-check-if-every-row-and-column-contains-all-numbers.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/minimum-swaps-to-group-all-1s-together-ii/[2134. Minimum Swaps to Group All 1's Together II^] //|{source_base_url}/_2134_MinimumSwapsToGroupAll1STogetherIi.java[Java] //|{doc_base_url}/2134-minimum-swaps-to-group-all-1s-together-ii.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-words-obtained-after-adding-a-letter/[2135. Count Words Obtained After Adding a Letter^] //|{source_base_url}/_2135_CountWordsObtainedAfterAddingALetter.java[Java] //|{doc_base_url}/2135-count-words-obtained-after-adding-a-letter.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/earliest-possible-day-of-full-bloom/[2136. Earliest Possible Day of Full Bloom^] //|{source_base_url}/_2136_EarliestPossibleDayOfFullBloom.java[Java] //|{doc_base_url}/2136-earliest-possible-day-of-full-bloom.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/pour-water-between-buckets-to-make-water-levels-equal/[2137. Pour Water Between Buckets to Make Water Levels Equal^] //|{source_base_url}/_2137_PourWaterBetweenBucketsToMakeWaterLevelsEqual.java[Java] //|{doc_base_url}/2137-pour-water-between-buckets-to-make-water-levels-equal.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/divide-a-string-into-groups-of-size-k/[2138. Divide a String Into Groups of Size k^] //|{source_base_url}/_2138_DivideAStringIntoGroupsOfSizeK.java[Java] //|{doc_base_url}/2138-divide-a-string-into-groups-of-size-k.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/minimum-moves-to-reach-target-score/[2139. Minimum Moves to Reach Target Score^] //|{source_base_url}/_2139_MinimumMovesToReachTargetScore.java[Java] //|{doc_base_url}/2139-minimum-moves-to-reach-target-score.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/solving-questions-with-brainpower/[2140. Solving Questions With Brainpower^] //|{source_base_url}/_2140_SolvingQuestionsWithBrainpower.java[Java] //|{doc_base_url}/2140-solving-questions-with-brainpower.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-running-time-of-n-computers/[2141. Maximum Running Time of N Computers^] //|{source_base_url}/_2141_MaximumRunningTimeOfNComputers.java[Java] //|{doc_base_url}/2141-maximum-running-time-of-n-computers.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/the-number-of-passengers-in-each-bus-i/[2142. The Number of Passengers in Each Bus I^] //|{source_base_url}/_2142_TheNumberOfPassengersInEachBusI.java[Java] //|{doc_base_url}/2142-the-number-of-passengers-in-each-bus-i.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/choose-numbers-from-two-arrays-in-range/[2143. Choose Numbers From Two Arrays in Range^] //|{source_base_url}/_2143_ChooseNumbersFromTwoArraysInRange.java[Java] //|{doc_base_url}/2143-choose-numbers-from-two-arrays-in-range.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/minimum-cost-of-buying-candies-with-discount/[2144. Minimum Cost of Buying Candies With Discount^] //|{source_base_url}/_2144_MinimumCostOfBuyingCandiesWithDiscount.java[Java] //|{doc_base_url}/2144-minimum-cost-of-buying-candies-with-discount.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/count-the-hidden-sequences/[2145. Count the Hidden Sequences^] //|{source_base_url}/_2145_CountTheHiddenSequences.java[Java] //|{doc_base_url}/2145-count-the-hidden-sequences.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/k-highest-ranked-items-within-a-price-range/[2146. K Highest Ranked Items Within a Price Range^] //|{source_base_url}/_2146_KHighestRankedItemsWithinAPriceRange.java[Java] //|{doc_base_url}/2146-k-highest-ranked-items-within-a-price-range.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/number-of-ways-to-divide-a-long-corridor/[2147. Number of Ways to Divide a Long Corridor^] //|{source_base_url}/_2147_NumberOfWaysToDivideALongCorridor.java[Java] //|{doc_base_url}/2147-number-of-ways-to-divide-a-long-corridor.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/count-elements-with-strictly-smaller-and-greater-elements/[2148. Count Elements With Strictly Smaller and Greater Elements ^] //|{source_base_url}/_2148_CountElementsWithStrictlySmallerAndGreaterElements.java[Java] //|{doc_base_url}/2148-count-elements-with-strictly-smaller-and-greater-elements.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/rearrange-array-elements-by-sign/[2149. Rearrange Array Elements by Sign^] //|{source_base_url}/_2149_RearrangeArrayElementsBySign.java[Java] //|{doc_base_url}/2149-rearrange-array-elements-by-sign.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-all-lonely-numbers-in-the-array/[2150. Find All Lonely Numbers in the Array^] //|{source_base_url}/_2150_FindAllLonelyNumbersInTheArray.java[Java] //|{doc_base_url}/2150-find-all-lonely-numbers-in-the-array.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-good-people-based-on-statements/[2151. Maximum Good People Based on Statements^] //|{source_base_url}/_2151_MaximumGoodPeopleBasedOnStatements.java[Java] //|{doc_base_url}/2151-maximum-good-people-based-on-statements.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/minimum-number-of-lines-to-cover-points/[2152. Minimum Number of Lines to Cover Points^] //|{source_base_url}/_2152_MinimumNumberOfLinesToCoverPoints.java[Java] //|{doc_base_url}/2152-minimum-number-of-lines-to-cover-points.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/the-number-of-passengers-in-each-bus-ii/[2153. The Number of Passengers in Each Bus II^] //|{source_base_url}/_2153_TheNumberOfPassengersInEachBusIi.java[Java] //|{doc_base_url}/2153-the-number-of-passengers-in-each-bus-ii.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/keep-multiplying-found-values-by-two/[2154. Keep Multiplying Found Values by Two^] //|{source_base_url}/_2154_KeepMultiplyingFoundValuesByTwo.java[Java] //|{doc_base_url}/2154-keep-multiplying-found-values-by-two.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/all-divisions-with-the-highest-score-of-a-binary-array/[2155. All Divisions With the Highest Score of a Binary Array^] //|{source_base_url}/_2155_AllDivisionsWithTheHighestScoreOfABinaryArray.java[Java] //|{doc_base_url}/2155-all-divisions-with-the-highest-score-of-a-binary-array.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-substring-with-given-hash-value/[2156. Find Substring With Given Hash Value^] //|{source_base_url}/_2156_FindSubstringWithGivenHashValue.java[Java] //|{doc_base_url}/2156-find-substring-with-given-hash-value.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/groups-of-strings/[2157. Groups of Strings^] //|{source_base_url}/_2157_GroupsOfStrings.java[Java] //|{doc_base_url}/2157-groups-of-strings.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/amount-of-new-area-painted-each-day/[2158. Amount of New Area Painted Each Day^] //|{source_base_url}/_2158_AmountOfNewAreaPaintedEachDay.java[Java] //|{doc_base_url}/2158-amount-of-new-area-painted-each-day.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/order-two-columns-independently/[2159. Order Two Columns Independently^] //|{source_base_url}/_2159_OrderTwoColumnsIndependently.java[Java] //|{doc_base_url}/2159-order-two-columns-independently.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-sum-of-four-digit-number-after-splitting-digits/[2160. Minimum Sum of Four Digit Number After Splitting Digits^] //|{source_base_url}/_2160_MinimumSumOfFourDigitNumberAfterSplittingDigits.java[Java] //|{doc_base_url}/2160-minimum-sum-of-four-digit-number-after-splitting-digits.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/partition-array-according-to-given-pivot/[2161. Partition Array According to Given Pivot^] //|{source_base_url}/_2161_PartitionArrayAccordingToGivenPivot.java[Java] //|{doc_base_url}/2161-partition-array-according-to-given-pivot.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-cost-to-set-cooking-time/[2162. Minimum Cost to Set Cooking Time^] //|{source_base_url}/_2162_MinimumCostToSetCookingTime.java[Java] //|{doc_base_url}/2162-minimum-cost-to-set-cooking-time.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-difference-in-sums-after-removal-of-elements/[2163. Minimum Difference in Sums After Removal of Elements^] //|{source_base_url}/_2163_MinimumDifferenceInSumsAfterRemovalOfElements.java[Java] //|{doc_base_url}/2163-minimum-difference-in-sums-after-removal-of-elements.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/sort-even-and-odd-indices-independently/[2164. Sort Even and Odd Indices Independently^] //|{source_base_url}/_2164_SortEvenAndOddIndicesIndependently.java[Java] //|{doc_base_url}/2164-sort-even-and-odd-indices-independently.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/smallest-value-of-the-rearranged-number/[2165. Smallest Value of the Rearranged Number^] //|{source_base_url}/_2165_SmallestValueOfTheRearrangedNumber.java[Java] //|{doc_base_url}/2165-smallest-value-of-the-rearranged-number.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/design-bitset/[2166. Design Bitset^] //|{source_base_url}/_2166_DesignBitset.java[Java] //|{doc_base_url}/2166-design-bitset.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-time-to-remove-all-cars-containing-illegal-goods/[2167. Minimum Time to Remove All Cars Containing Illegal Goods^] //|{source_base_url}/_2167_MinimumTimeToRemoveAllCarsContainingIllegalGoods.java[Java] //|{doc_base_url}/2167-minimum-time-to-remove-all-cars-containing-illegal-goods.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/unique-substrings-with-equal-digit-frequency/[2168. Unique Substrings With Equal Digit Frequency^] //|{source_base_url}/_2168_UniqueSubstringsWithEqualDigitFrequency.java[Java] //|{doc_base_url}/2168-unique-substrings-with-equal-digit-frequency.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-operations-to-obtain-zero/[2169. Count Operations to Obtain Zero^] //|{source_base_url}/_2169_CountOperationsToObtainZero.java[Java] //|{doc_base_url}/2169-count-operations-to-obtain-zero.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/minimum-operations-to-make-the-array-alternating/[2170. Minimum Operations to Make the Array Alternating^] //|{source_base_url}/_2170_MinimumOperationsToMakeTheArrayAlternating.java[Java] //|{doc_base_url}/2170-minimum-operations-to-make-the-array-alternating.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/removing-minimum-number-of-magic-beans/[2171. Removing Minimum Number of Magic Beans^] //|{source_base_url}/_2171_RemovingMinimumNumberOfMagicBeans.java[Java] //|{doc_base_url}/2171-removing-minimum-number-of-magic-beans.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-and-sum-of-array/[2172. Maximum AND Sum of Array^] //|{source_base_url}/_2172_MaximumAndSumOfArray.java[Java] //|{doc_base_url}/2172-maximum-and-sum-of-array.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/longest-winning-streak/[2173. Longest Winning Streak^] //|{source_base_url}/_2173_LongestWinningStreak.java[Java] //|{doc_base_url}/2173-longest-winning-streak.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/remove-all-ones-with-row-and-column-flips-ii/[2174. Remove All Ones With Row and Column Flips II^] //|{source_base_url}/_2174_RemoveAllOnesWithRowAndColumnFlipsIi.java[Java] //|{doc_base_url}/2174-remove-all-ones-with-row-and-column-flips-ii.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/the-change-in-global-rankings/[2175. The Change in Global Rankings^] //|{source_base_url}/_2175_TheChangeInGlobalRankings.java[Java] //|{doc_base_url}/2175-the-change-in-global-rankings.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-equal-and-divisible-pairs-in-an-array/[2176. Count Equal and Divisible Pairs in an Array^] //|{source_base_url}/_2176_CountEqualAndDivisiblePairsInAnArray.java[Java] //|{doc_base_url}/2176-count-equal-and-divisible-pairs-in-an-array.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/find-three-consecutive-integers-that-sum-to-a-given-number/[2177. Find Three Consecutive Integers That Sum to a Given Number^] //|{source_base_url}/_2177_FindThreeConsecutiveIntegersThatSumToAGivenNumber.java[Java] //|{doc_base_url}/2177-find-three-consecutive-integers-that-sum-to-a-given-number.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-split-of-positive-even-integers/[2178. Maximum Split of Positive Even Integers^] //|{source_base_url}/_2178_MaximumSplitOfPositiveEvenIntegers.java[Java] //|{doc_base_url}/2178-maximum-split-of-positive-even-integers.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-good-triplets-in-an-array/[2179. Count Good Triplets in an Array^] //|{source_base_url}/_2179_CountGoodTripletsInAnArray.java[Java] //|{doc_base_url}/2179-count-good-triplets-in-an-array.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/count-integers-with-even-digit-sum/[2180. Count Integers With Even Digit Sum^] //|{source_base_url}/_2180_CountIntegersWithEvenDigitSum.java[Java] //|{doc_base_url}/2180-count-integers-with-even-digit-sum.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/merge-nodes-in-between-zeros/[2181. Merge Nodes in Between Zeros^] //|{source_base_url}/_2181_MergeNodesInBetweenZeros.java[Java] //|{doc_base_url}/2181-merge-nodes-in-between-zeros.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/construct-string-with-repeat-limit/[2182. Construct String With Repeat Limit^] //|{source_base_url}/_2182_ConstructStringWithRepeatLimit.java[Java] //|{doc_base_url}/2182-construct-string-with-repeat-limit.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-array-pairs-divisible-by-k/[2183. Count Array Pairs Divisible by K^] //|{source_base_url}/_2183_CountArrayPairsDivisibleByK.java[Java] //|{doc_base_url}/2183-count-array-pairs-divisible-by-k.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/number-of-ways-to-build-sturdy-brick-wall/[2184. Number of Ways to Build Sturdy Brick Wall^] //|{source_base_url}/_2184_NumberOfWaysToBuildSturdyBrickWall.java[Java] //|{doc_base_url}/2184-number-of-ways-to-build-sturdy-brick-wall.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/counting-words-with-a-given-prefix/[2185. Counting Words With a Given Prefix^] //|{source_base_url}/_2185_CountingWordsWithAGivenPrefix.java[Java] //|{doc_base_url}/2185-counting-words-with-a-given-prefix.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/minimum-number-of-steps-to-make-two-strings-anagram-ii/[2186. Minimum Number of Steps to Make Two Strings Anagram II^] //|{source_base_url}/_2186_MinimumNumberOfStepsToMakeTwoStringsAnagramIi.java[Java] //|{doc_base_url}/2186-minimum-number-of-steps-to-make-two-strings-anagram-ii.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-time-to-complete-trips/[2187. Minimum Time to Complete Trips^] //|{source_base_url}/_2187_MinimumTimeToCompleteTrips.java[Java] //|{doc_base_url}/2187-minimum-time-to-complete-trips.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-time-to-finish-the-race/[2188. Minimum Time to Finish the Race^] //|{source_base_url}/_2188_MinimumTimeToFinishTheRace.java[Java] //|{doc_base_url}/2188-minimum-time-to-finish-the-race.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/number-of-ways-to-build-house-of-cards/[2189. Number of Ways to Build House of Cards^] //|{source_base_url}/_2189_NumberOfWaysToBuildHouseOfCards.java[Java] //|{doc_base_url}/2189-number-of-ways-to-build-house-of-cards.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/most-frequent-number-following-key-in-an-array/[2190. Most Frequent Number Following Key In an Array^] //|{source_base_url}/_2190_MostFrequentNumberFollowingKeyInAnArray.java[Java] //|{doc_base_url}/2190-most-frequent-number-following-key-in-an-array.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/sort-the-jumbled-numbers/[2191. Sort the Jumbled Numbers^] //|{source_base_url}/_2191_SortTheJumbledNumbers.java[Java] //|{doc_base_url}/2191-sort-the-jumbled-numbers.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/all-ancestors-of-a-node-in-a-directed-acyclic-graph/[2192. All Ancestors of a Node in a Directed Acyclic Graph^] //|{source_base_url}/_2192_AllAncestorsOfANodeInADirectedAcyclicGraph.java[Java] //|{doc_base_url}/2192-all-ancestors-of-a-node-in-a-directed-acyclic-graph.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-number-of-moves-to-make-palindrome/[2193. Minimum Number of Moves to Make Palindrome^] //|{source_base_url}/_2193_MinimumNumberOfMovesToMakePalindrome.java[Java] //|{doc_base_url}/2193-minimum-number-of-moves-to-make-palindrome.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/cells-in-a-range-on-an-excel-sheet/[2194. Cells in a Range on an Excel Sheet^] //|{source_base_url}/_2194_CellsInARangeOnAnExcelSheet.java[Java] //|{doc_base_url}/2194-cells-in-a-range-on-an-excel-sheet.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/append-k-integers-with-minimal-sum/[2195. Append K Integers With Minimal Sum^] //|{source_base_url}/_2195_AppendKIntegersWithMinimalSum.java[Java] //|{doc_base_url}/2195-append-k-integers-with-minimal-sum.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/create-binary-tree-from-descriptions/[2196. Create Binary Tree From Descriptions^] //|{source_base_url}/_2196_CreateBinaryTreeFromDescriptions.java[Java] //|{doc_base_url}/2196-create-binary-tree-from-descriptions.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/replace-non-coprime-numbers-in-array/[2197. Replace Non-Coprime Numbers in Array^] //|{source_base_url}/_2197_ReplaceNonCoprimeNumbersInArray.java[Java] //|{doc_base_url}/2197-replace-non-coprime-numbers-in-array.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/number-of-single-divisor-triplets/[2198. Number of Single Divisor Triplets^] //|{source_base_url}/_2198_NumberOfSingleDivisorTriplets.java[Java] //|{doc_base_url}/2198-number-of-single-divisor-triplets.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/finding-the-topic-of-each-post/[2199. Finding the Topic of Each Post^] //|{source_base_url}/_2199_FindingTheTopicOfEachPost.java[Java] //|{doc_base_url}/2199-finding-the-topic-of-each-post.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/find-all-k-distant-indices-in-an-array/[2200. Find All K-Distant Indices in an Array^] //|{source_base_url}/_2200_FindAllKDistantIndicesInAnArray.java[Java] //|{doc_base_url}/2200-find-all-k-distant-indices-in-an-array.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/count-artifacts-that-can-be-extracted/[2201. Count Artifacts That Can Be Extracted^] //|{source_base_url}/_2201_CountArtifactsThatCanBeExtracted.java[Java] //|{doc_base_url}/2201-count-artifacts-that-can-be-extracted.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximize-the-topmost-element-after-k-moves/[2202. Maximize the Topmost Element After K Moves^] //|{source_base_url}/_2202_MaximizeTheTopmostElementAfterKMoves.java[Java] //|{doc_base_url}/2202-maximize-the-topmost-element-after-k-moves.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-weighted-subgraph-with-the-required-paths/[2203. Minimum Weighted Subgraph With the Required Paths^] //|{source_base_url}/_2203_MinimumWeightedSubgraphWithTheRequiredPaths.java[Java] //|{doc_base_url}/2203-minimum-weighted-subgraph-with-the-required-paths.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/distance-to-a-cycle-in-undirected-graph/[2204. Distance to a Cycle in Undirected Graph^] //|{source_base_url}/_2204_DistanceToACycleInUndirectedGraph.java[Java] //|{doc_base_url}/2204-distance-to-a-cycle-in-undirected-graph.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/the-number-of-users-that-are-eligible-for-discount/[2205. The Number of Users That Are Eligible for Discount^] //|{source_base_url}/_2205_TheNumberOfUsersThatAreEligibleForDiscount.java[Java] //|{doc_base_url}/2205-the-number-of-users-that-are-eligible-for-discount.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/divide-array-into-equal-pairs/[2206. Divide Array Into Equal Pairs^] //|{source_base_url}/_2206_DivideArrayIntoEqualPairs.java[Java] //|{doc_base_url}/2206-divide-array-into-equal-pairs.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/maximize-number-of-subsequences-in-a-string/[2207. Maximize Number of Subsequences in a String^] //|{source_base_url}/_2207_MaximizeNumberOfSubsequencesInAString.java[Java] //|{doc_base_url}/2207-maximize-number-of-subsequences-in-a-string.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-operations-to-halve-array-sum/[2208. Minimum Operations to Halve Array Sum^] //|{source_base_url}/_2208_MinimumOperationsToHalveArraySum.java[Java] //|{doc_base_url}/2208-minimum-operations-to-halve-array-sum.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-white-tiles-after-covering-with-carpets/[2209. Minimum White Tiles After Covering With Carpets^] //|{source_base_url}/_2209_MinimumWhiteTilesAfterCoveringWithCarpets.java[Java] //|{doc_base_url}/2209-minimum-white-tiles-after-covering-with-carpets.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/count-hills-and-valleys-in-an-array/[2210. Count Hills and Valleys in an Array^] //|{source_base_url}/_2210_CountHillsAndValleysInAnArray.java[Java] //|{doc_base_url}/2210-count-hills-and-valleys-in-an-array.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/count-collisions-on-a-road/[2211. Count Collisions on a Road^] //|{source_base_url}/_2211_CountCollisionsOnARoad.java[Java] //|{doc_base_url}/2211-count-collisions-on-a-road.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-points-in-an-archery-competition/[2212. Maximum Points in an Archery Competition^] //|{source_base_url}/_2212_MaximumPointsInAnArcheryCompetition.java[Java] //|{doc_base_url}/2212-maximum-points-in-an-archery-competition.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/longest-substring-of-one-repeating-character/[2213. Longest Substring of One Repeating Character^] //|{source_base_url}/_2213_LongestSubstringOfOneRepeatingCharacter.java[Java] //|{doc_base_url}/2213-longest-substring-of-one-repeating-character.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/minimum-health-to-beat-game/[2214. Minimum Health to Beat Game^] //|{source_base_url}/_2214_MinimumHealthToBeatGame.java[Java] //|{doc_base_url}/2214-minimum-health-to-beat-game.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-the-difference-of-two-arrays/[2215. Find the Difference of Two Arrays^] //|{source_base_url}/_2215_FindTheDifferenceOfTwoArrays.java[Java] //|{doc_base_url}/2215-find-the-difference-of-two-arrays.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/minimum-deletions-to-make-array-beautiful/[2216. Minimum Deletions to Make Array Beautiful^] //|{source_base_url}/_2216_MinimumDeletionsToMakeArrayBeautiful.java[Java] //|{doc_base_url}/2216-minimum-deletions-to-make-array-beautiful.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-palindrome-with-fixed-length/[2217. Find Palindrome With Fixed Length^] //|{source_base_url}/_2217_FindPalindromeWithFixedLength.java[Java] //|{doc_base_url}/2217-find-palindrome-with-fixed-length.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-value-of-k-coins-from-piles/[2218. Maximum Value of K Coins From Piles^] //|{source_base_url}/_2218_MaximumValueOfKCoinsFromPiles.java[Java] //|{doc_base_url}/2218-maximum-value-of-k-coins-from-piles.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/maximum-sum-score-of-array/[2219. Maximum Sum Score of Array^] //|{source_base_url}/_2219_MaximumSumScoreOfArray.java[Java] //|{doc_base_url}/2219-maximum-sum-score-of-array.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-bit-flips-to-convert-number/[2220. Minimum Bit Flips to Convert Number^] //|{source_base_url}/_2220_MinimumBitFlipsToConvertNumber.java[Java] //|{doc_base_url}/2220-minimum-bit-flips-to-convert-number.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/find-triangular-sum-of-an-array/[2221. Find Triangular Sum of an Array^] //|{source_base_url}/_2221_FindTriangularSumOfAnArray.java[Java] //|{doc_base_url}/2221-find-triangular-sum-of-an-array.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/number-of-ways-to-select-buildings/[2222. Number of Ways to Select Buildings^] //|{source_base_url}/_2222_NumberOfWaysToSelectBuildings.java[Java] //|{doc_base_url}/2222-number-of-ways-to-select-buildings.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/sum-of-scores-of-built-strings/[2223. Sum of Scores of Built Strings^] //|{source_base_url}/_2223_SumOfScoresOfBuiltStrings.java[Java] //|{doc_base_url}/2223-sum-of-scores-of-built-strings.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/minimum-number-of-operations-to-convert-time/[2224. Minimum Number of Operations to Convert Time^] //|{source_base_url}/_2224_MinimumNumberOfOperationsToConvertTime.java[Java] //|{doc_base_url}/2224-minimum-number-of-operations-to-convert-time.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/find-players-with-zero-or-one-losses/[2225. Find Players With Zero or One Losses^] //|{source_base_url}/_2225_FindPlayersWithZeroOrOneLosses.java[Java] //|{doc_base_url}/2225-find-players-with-zero-or-one-losses.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-candies-allocated-to-k-children/[2226. Maximum Candies Allocated to K Children^] //|{source_base_url}/_2226_MaximumCandiesAllocatedToKChildren.java[Java] //|{doc_base_url}/2226-maximum-candies-allocated-to-k-children.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/encrypt-and-decrypt-strings/[2227. Encrypt and Decrypt Strings^] //|{source_base_url}/_2227_EncryptAndDecryptStrings.java[Java] //|{doc_base_url}/2227-encrypt-and-decrypt-strings.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/users-with-two-purchases-within-seven-days/[2228. Users With Two Purchases Within Seven Days^] //|{source_base_url}/_2228_UsersWithTwoPurchasesWithinSevenDays.java[Java] //|{doc_base_url}/2228-users-with-two-purchases-within-seven-days.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/check-if-an-array-is-consecutive/[2229. Check if an Array Is Consecutive^] //|{source_base_url}/_2229_CheckIfAnArrayIsConsecutive.java[Java] //|{doc_base_url}/2229-check-if-an-array-is-consecutive.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/the-users-that-are-eligible-for-discount/[2230. The Users That Are Eligible for Discount^] //|{source_base_url}/_2230_TheUsersThatAreEligibleForDiscount.java[Java] //|{doc_base_url}/2230-the-users-that-are-eligible-for-discount.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/largest-number-after-digit-swaps-by-parity/[2231. Largest Number After Digit Swaps by Parity^] //|{source_base_url}/_2231_LargestNumberAfterDigitSwapsByParity.java[Java] //|{doc_base_url}/2231-largest-number-after-digit-swaps-by-parity.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/minimize-result-by-adding-parentheses-to-expression/[2232. Minimize Result by Adding Parentheses to Expression^] //|{source_base_url}/_2232_MinimizeResultByAddingParenthesesToExpression.java[Java] //|{doc_base_url}/2232-minimize-result-by-adding-parentheses-to-expression.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-product-after-k-increments/[2233. Maximum Product After K Increments^] //|{source_base_url}/_2233_MaximumProductAfterKIncrements.java[Java] //|{doc_base_url}/2233-maximum-product-after-k-increments.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-total-beauty-of-the-gardens/[2234. Maximum Total Beauty of the Gardens^] //|{source_base_url}/_2234_MaximumTotalBeautyOfTheGardens.java[Java] //|{doc_base_url}/2234-maximum-total-beauty-of-the-gardens.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/add-two-integers/[2235. Add Two Integers^] //|{source_base_url}/_2235_AddTwoIntegers.java[Java] //|{doc_base_url}/2235-add-two-integers.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/root-equals-sum-of-children/[2236. Root Equals Sum of Children^] //|{source_base_url}/_2236_RootEqualsSumOfChildren.java[Java] //|{doc_base_url}/2236-root-equals-sum-of-children.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/count-positions-on-street-with-required-brightness/[2237. Count Positions on Street With Required Brightness^] //|{source_base_url}/_2237_CountPositionsOnStreetWithRequiredBrightness.java[Java] //|{doc_base_url}/2237-count-positions-on-street-with-required-brightness.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/number-of-times-a-driver-was-a-passenger/[2238. Number of Times a Driver Was a Passenger^] //|{source_base_url}/_2238_NumberOfTimesADriverWasAPassenger.java[Java] //|{doc_base_url}/2238-number-of-times-a-driver-was-a-passenger.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-closest-number-to-zero/[2239. Find Closest Number to Zero^] //|{source_base_url}/_2239_FindClosestNumberToZero.java[Java] //|{doc_base_url}/2239-find-closest-number-to-zero.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/number-of-ways-to-buy-pens-and-pencils/[2240. Number of Ways to Buy Pens and Pencils^] //|{source_base_url}/_2240_NumberOfWaysToBuyPensAndPencils.java[Java] //|{doc_base_url}/2240-number-of-ways-to-buy-pens-and-pencils.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/design-an-atm-machine/[2241. Design an ATM Machine^] //|{source_base_url}/_2241_DesignAnAtmMachine.java[Java] //|{doc_base_url}/2241-design-an-atm-machine.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-score-of-a-node-sequence/[2242. Maximum Score of a Node Sequence^] //|{source_base_url}/_2242_MaximumScoreOfANodeSequence.java[Java] //|{doc_base_url}/2242-maximum-score-of-a-node-sequence.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/calculate-digit-sum-of-a-string/[2243. Calculate Digit Sum of a String^] //|{source_base_url}/_2243_CalculateDigitSumOfAString.java[Java] //|{doc_base_url}/2243-calculate-digit-sum-of-a-string.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/minimum-rounds-to-complete-all-tasks/[2244. Minimum Rounds to Complete All Tasks^] //|{source_base_url}/_2244_MinimumRoundsToCompleteAllTasks.java[Java] //|{doc_base_url}/2244-minimum-rounds-to-complete-all-tasks.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-trailing-zeros-in-a-cornered-path/[2245. Maximum Trailing Zeros in a Cornered Path^] //|{source_base_url}/_2245_MaximumTrailingZerosInACorneredPath.java[Java] //|{doc_base_url}/2245-maximum-trailing-zeros-in-a-cornered-path.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/longest-path-with-different-adjacent-characters/[2246. Longest Path With Different Adjacent Characters^] //|{source_base_url}/_2246_LongestPathWithDifferentAdjacentCharacters.java[Java] //|{doc_base_url}/2246-longest-path-with-different-adjacent-characters.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/maximum-cost-of-trip-with-k-highways/[2247. Maximum Cost of Trip With K Highways^] //|{source_base_url}/_2247_MaximumCostOfTripWithKHighways.java[Java] //|{doc_base_url}/2247-maximum-cost-of-trip-with-k-highways.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/intersection-of-multiple-arrays/[2248. Intersection of Multiple Arrays^] //|{source_base_url}/_2248_IntersectionOfMultipleArrays.java[Java] //|{doc_base_url}/2248-intersection-of-multiple-arrays.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/count-lattice-points-inside-a-circle/[2249. Count Lattice Points Inside a Circle^] //|{source_base_url}/_2249_CountLatticePointsInsideACircle.java[Java] //|{doc_base_url}/2249-count-lattice-points-inside-a-circle.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-number-of-rectangles-containing-each-point/[2250. Count Number of Rectangles Containing Each Point^] //|{source_base_url}/_2250_CountNumberOfRectanglesContainingEachPoint.java[Java] //|{doc_base_url}/2250-count-number-of-rectangles-containing-each-point.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/number-of-flowers-in-full-bloom/[2251. Number of Flowers in Full Bloom^] //|{source_base_url}/_2251_NumberOfFlowersInFullBloom.java[Java] //|{doc_base_url}/2251-number-of-flowers-in-full-bloom.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/dynamic-pivoting-of-a-table/[2252. Dynamic Pivoting of a Table^] //|{source_base_url}/_2252_DynamicPivotingOfATable.java[Java] //|{doc_base_url}/2252-dynamic-pivoting-of-a-table.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/dynamic-unpivoting-of-a-table/[2253. Dynamic Unpivoting of a Table^] //|{source_base_url}/_2253_DynamicUnpivotingOfATable.java[Java] //|{doc_base_url}/2253-dynamic-unpivoting-of-a-table.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/design-video-sharing-platform/[2254. Design Video Sharing Platform^] //|{source_base_url}/_2254_DesignVideoSharingPlatform.java[Java] //|{doc_base_url}/2254-design-video-sharing-platform.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/count-prefixes-of-a-given-string/[2255. Count Prefixes of a Given String^] //|{source_base_url}/_2255_CountPrefixesOfAGivenString.java[Java] //|{doc_base_url}/2255-count-prefixes-of-a-given-string.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/minimum-average-difference/[2256. Minimum Average Difference^] //|{source_base_url}/_2256_MinimumAverageDifference.java[Java] //|{doc_base_url}/2256-minimum-average-difference.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-unguarded-cells-in-the-grid/[2257. Count Unguarded Cells in the Grid^] //|{source_base_url}/_2257_CountUnguardedCellsInTheGrid.java[Java] //|{doc_base_url}/2257-count-unguarded-cells-in-the-grid.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/escape-the-spreading-fire/[2258. Escape the Spreading Fire^] //|{source_base_url}/_2258_EscapeTheSpreadingFire.java[Java] //|{doc_base_url}/2258-escape-the-spreading-fire.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/remove-digit-from-number-to-maximize-result/[2259. Remove Digit From Number to Maximize Result^] //|{source_base_url}/_2259_RemoveDigitFromNumberToMaximizeResult.java[Java] //|{doc_base_url}/2259-remove-digit-from-number-to-maximize-result.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/minimum-consecutive-cards-to-pick-up/[2260. Minimum Consecutive Cards to Pick Up^] //|{source_base_url}/_2260_MinimumConsecutiveCardsToPickUp.java[Java] //|{doc_base_url}/2260-minimum-consecutive-cards-to-pick-up.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/k-divisible-elements-subarrays/[2261. K Divisible Elements Subarrays^] //|{source_base_url}/_2261_KDivisibleElementsSubarrays.java[Java] //|{doc_base_url}/2261-k-divisible-elements-subarrays.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/total-appeal-of-a-string/[2262. Total Appeal of A String^] //|{source_base_url}/_2262_TotalAppealOfAString.java[Java] //|{doc_base_url}/2262-total-appeal-of-a-string.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/make-array-non-decreasing-or-non-increasing/[2263. Make Array Non-decreasing or Non-increasing^] //|{source_base_url}/_2263_MakeArrayNonDecreasingOrNonIncreasing.java[Java] //|{doc_base_url}/2263-make-array-non-decreasing-or-non-increasing.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/largest-3-same-digit-number-in-string/[2264. Largest 3-Same-Digit Number in String^] //|{source_base_url}/_2264_Largest3SameDigitNumberInString.java[Java] //|{doc_base_url}/2264-largest-3-same-digit-number-in-string.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/count-nodes-equal-to-average-of-subtree/[2265. Count Nodes Equal to Average of Subtree^] //|{source_base_url}/_2265_CountNodesEqualToAverageOfSubtree.java[Java] //|{doc_base_url}/2265-count-nodes-equal-to-average-of-subtree.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-number-of-texts/[2266. Count Number of Texts^] //|{source_base_url}/_2266_CountNumberOfTexts.java[Java] //|{doc_base_url}/2266-count-number-of-texts.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/check-if-there-is-a-valid-parentheses-string-path/[2267. Check if There Is a Valid Parentheses String Path^] //|{source_base_url}/_2267_CheckIfThereIsAValidParenthesesStringPath.java[Java] //|{doc_base_url}/2267-check-if-there-is-a-valid-parentheses-string-path.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/minimum-number-of-keypresses/[2268. Minimum Number of Keypresses^] //|{source_base_url}/_2268_MinimumNumberOfKeypresses.java[Java] //|{doc_base_url}/2268-minimum-number-of-keypresses.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-the-k-beauty-of-a-number/[2269. Find the K-Beauty of a Number^] //|{source_base_url}/_2269_FindTheKBeautyOfANumber.java[Java] //|{doc_base_url}/2269-find-the-k-beauty-of-a-number.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/number-of-ways-to-split-array/[2270. Number of Ways to Split Array^] //|{source_base_url}/_2270_NumberOfWaysToSplitArray.java[Java] //|{doc_base_url}/2270-number-of-ways-to-split-array.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-white-tiles-covered-by-a-carpet/[2271. Maximum White Tiles Covered by a Carpet^] //|{source_base_url}/_2271_MaximumWhiteTilesCoveredByACarpet.java[Java] //|{doc_base_url}/2271-maximum-white-tiles-covered-by-a-carpet.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/substring-with-largest-variance/[2272. Substring With Largest Variance^] //|{source_base_url}/_2272_SubstringWithLargestVariance.java[Java] //|{doc_base_url}/2272-substring-with-largest-variance.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/find-resultant-array-after-removing-anagrams/[2273. Find Resultant Array After Removing Anagrams^] //|{source_base_url}/_2273_FindResultantArrayAfterRemovingAnagrams.java[Java] //|{doc_base_url}/2273-find-resultant-array-after-removing-anagrams.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/maximum-consecutive-floors-without-special-floors/[2274. Maximum Consecutive Floors Without Special Floors^] //|{source_base_url}/_2274_MaximumConsecutiveFloorsWithoutSpecialFloors.java[Java] //|{doc_base_url}/2274-maximum-consecutive-floors-without-special-floors.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/largest-combination-with-bitwise-and-greater-than-zero/[2275. Largest Combination With Bitwise AND Greater Than Zero^] //|{source_base_url}/_2275_LargestCombinationWithBitwiseAndGreaterThanZero.java[Java] //|{doc_base_url}/2275-largest-combination-with-bitwise-and-greater-than-zero.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-integers-in-intervals/[2276. Count Integers in Intervals^] //|{source_base_url}/_2276_CountIntegersInIntervals.java[Java] //|{doc_base_url}/2276-count-integers-in-intervals.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/closest-node-to-path-in-tree/[2277. Closest Node to Path in Tree^] //|{source_base_url}/_2277_ClosestNodeToPathInTree.java[Java] //|{doc_base_url}/2277-closest-node-to-path-in-tree.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/percentage-of-letter-in-string/[2278. Percentage of Letter in String^] //|{source_base_url}/_2278_PercentageOfLetterInString.java[Java] //|{doc_base_url}/2278-percentage-of-letter-in-string.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/maximum-bags-with-full-capacity-of-rocks/[2279. Maximum Bags With Full Capacity of Rocks^] //|{source_base_url}/_2279_MaximumBagsWithFullCapacityOfRocks.java[Java] //|{doc_base_url}/2279-maximum-bags-with-full-capacity-of-rocks.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-lines-to-represent-a-line-chart/[2280. Minimum Lines to Represent a Line Chart^] //|{source_base_url}/_2280_MinimumLinesToRepresentALineChart.java[Java] //|{doc_base_url}/2280-minimum-lines-to-represent-a-line-chart.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/sum-of-total-strength-of-wizards/[2281. Sum of Total Strength of Wizards^] //|{source_base_url}/_2281_SumOfTotalStrengthOfWizards.java[Java] //|{doc_base_url}/2281-sum-of-total-strength-of-wizards.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/number-of-people-that-can-be-seen-in-a-grid/[2282. Number of People That Can Be Seen in a Grid^] //|{source_base_url}/_2282_NumberOfPeopleThatCanBeSeenInAGrid.java[Java] //|{doc_base_url}/2282-number-of-people-that-can-be-seen-in-a-grid.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/check-if-number-has-equal-digit-count-and-digit-value/[2283. Check if Number Has Equal Digit Count and Digit Value^] //|{source_base_url}/_2283_CheckIfNumberHasEqualDigitCountAndDigitValue.java[Java] //|{doc_base_url}/2283-check-if-number-has-equal-digit-count-and-digit-value.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/sender-with-largest-word-count/[2284. Sender With Largest Word Count^] //|{source_base_url}/_2284_SenderWithLargestWordCount.java[Java] //|{doc_base_url}/2284-sender-with-largest-word-count.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-total-importance-of-roads/[2285. Maximum Total Importance of Roads^] //|{source_base_url}/_2285_MaximumTotalImportanceOfRoads.java[Java] //|{doc_base_url}/2285-maximum-total-importance-of-roads.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/booking-concert-tickets-in-groups/[2286. Booking Concert Tickets in Groups^] //|{source_base_url}/_2286_BookingConcertTicketsInGroups.java[Java] //|{doc_base_url}/2286-booking-concert-tickets-in-groups.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/rearrange-characters-to-make-target-string/[2287. Rearrange Characters to Make Target String^] //|{source_base_url}/_2287_RearrangeCharactersToMakeTargetString.java[Java] //|{doc_base_url}/2287-rearrange-characters-to-make-target-string.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/apply-discount-to-prices/[2288. Apply Discount to Prices^] //|{source_base_url}/_2288_ApplyDiscountToPrices.java[Java] //|{doc_base_url}/2288-apply-discount-to-prices.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/steps-to-make-array-non-decreasing/[2289. Steps to Make Array Non-decreasing^] //|{source_base_url}/_2289_StepsToMakeArrayNonDecreasing.java[Java] //|{doc_base_url}/2289-steps-to-make-array-non-decreasing.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-obstacle-removal-to-reach-corner/[2290. Minimum Obstacle Removal to Reach Corner^] //|{source_base_url}/_2290_MinimumObstacleRemovalToReachCorner.java[Java] //|{doc_base_url}/2290-minimum-obstacle-removal-to-reach-corner.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/maximum-profit-from-trading-stocks/[2291. Maximum Profit From Trading Stocks^] //|{source_base_url}/_2291_MaximumProfitFromTradingStocks.java[Java] //|{doc_base_url}/2291-maximum-profit-from-trading-stocks.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/products-with-three-or-more-orders-in-two-consecutive-years/[2292. Products With Three or More Orders in Two Consecutive Years^] //|{source_base_url}/_2292_ProductsWithThreeOrMoreOrdersInTwoConsecutiveYears.java[Java] //|{doc_base_url}/2292-products-with-three-or-more-orders-in-two-consecutive-years.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/min-max-game/[2293. Min Max Game^] //|{source_base_url}/_2293_MinMaxGame.java[Java] //|{doc_base_url}/2293-min-max-game.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/partition-array-such-that-maximum-difference-is-k/[2294. Partition Array Such That Maximum Difference Is K^] //|{source_base_url}/_2294_PartitionArraySuchThatMaximumDifferenceIsK.java[Java] //|{doc_base_url}/2294-partition-array-such-that-maximum-difference-is-k.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/replace-elements-in-an-array/[2295. Replace Elements in an Array^] //|{source_base_url}/_2295_ReplaceElementsInAnArray.java[Java] //|{doc_base_url}/2295-replace-elements-in-an-array.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/design-a-text-editor/[2296. Design a Text Editor^] //|{source_base_url}/_2296_DesignATextEditor.java[Java] //|{doc_base_url}/2296-design-a-text-editor.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/jump-game-viii/[2297. Jump Game VIII^] //|{source_base_url}/_2297_JumpGameViii.java[Java] //|{doc_base_url}/2297-jump-game-viii.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/tasks-count-in-the-weekend/[2298. Tasks Count in the Weekend^] //|{source_base_url}/_2298_TasksCountInTheWeekend.java[Java] //|{doc_base_url}/2298-tasks-count-in-the-weekend.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/strong-password-checker-ii/[2299. Strong Password Checker II^] //|{source_base_url}/_2299_StrongPasswordCheckerIi.java[Java] //|{doc_base_url}/2299-strong-password-checker-ii.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/successful-pairs-of-spells-and-potions/[2300. Successful Pairs of Spells and Potions^] //|{source_base_url}/_2300_SuccessfulPairsOfSpellsAndPotions.java[Java] //|{doc_base_url}/2300-successful-pairs-of-spells-and-potions.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/match-substring-after-replacement/[2301. Match Substring After Replacement^] //|{source_base_url}/_2301_MatchSubstringAfterReplacement.java[Java] //|{doc_base_url}/2301-match-substring-after-replacement.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/count-subarrays-with-score-less-than-k/[2302. Count Subarrays With Score Less Than K^] //|{source_base_url}/_2302_CountSubarraysWithScoreLessThanK.java[Java] //|{doc_base_url}/2302-count-subarrays-with-score-less-than-k.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/calculate-amount-paid-in-taxes/[2303. Calculate Amount Paid in Taxes^] //|{source_base_url}/_2303_CalculateAmountPaidInTaxes.java[Java] //|{doc_base_url}/2303-calculate-amount-paid-in-taxes.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/minimum-path-cost-in-a-grid/[2304. Minimum Path Cost in a Grid^] //|{source_base_url}/_2304_MinimumPathCostInAGrid.java[Java] //|{doc_base_url}/2304-minimum-path-cost-in-a-grid.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/fair-distribution-of-cookies/[2305. Fair Distribution of Cookies^] //|{source_base_url}/_2305_FairDistributionOfCookies.java[Java] //|{doc_base_url}/2305-fair-distribution-of-cookies.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/naming-a-company/[2306. Naming a Company^] //|{source_base_url}/_2306_NamingACompany.java[Java] //|{doc_base_url}/2306-naming-a-company.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/check-for-contradictions-in-equations/[2307. Check for Contradictions in Equations^] //|{source_base_url}/_2307_CheckForContradictionsInEquations.java[Java] //|{doc_base_url}/2307-check-for-contradictions-in-equations.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/arrange-table-by-gender/[2308. Arrange Table by Gender^] //|{source_base_url}/_2308_ArrangeTableByGender.java[Java] //|{doc_base_url}/2308-arrange-table-by-gender.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/greatest-english-letter-in-upper-and-lower-case/[2309. Greatest English Letter in Upper and Lower Case^] //|{source_base_url}/_2309_GreatestEnglishLetterInUpperAndLowerCase.java[Java] //|{doc_base_url}/2309-greatest-english-letter-in-upper-and-lower-case.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/sum-of-numbers-with-units-digit-k/[2310. Sum of Numbers With Units Digit K^] //|{source_base_url}/_2310_SumOfNumbersWithUnitsDigitK.java[Java] //|{doc_base_url}/2310-sum-of-numbers-with-units-digit-k.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/longest-binary-subsequence-less-than-or-equal-to-k/[2311. Longest Binary Subsequence Less Than or Equal to K^] //|{source_base_url}/_2311_LongestBinarySubsequenceLessThanOrEqualToK.java[Java] //|{doc_base_url}/2311-longest-binary-subsequence-less-than-or-equal-to-k.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/selling-pieces-of-wood/[2312. Selling Pieces of Wood^] //|{source_base_url}/_2312_SellingPiecesOfWood.java[Java] //|{doc_base_url}/2312-selling-pieces-of-wood.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/minimum-flips-in-binary-tree-to-get-result/[2313. Minimum Flips in Binary Tree to Get Result^] //|{source_base_url}/_2313_MinimumFlipsInBinaryTreeToGetResult.java[Java] //|{doc_base_url}/2313-minimum-flips-in-binary-tree-to-get-result.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/the-first-day-of-the-maximum-recorded-degree-in-each-city/[2314. The First Day of the Maximum Recorded Degree in Each City^] //|{source_base_url}/_2314_TheFirstDayOfTheMaximumRecordedDegreeInEachCity.java[Java] //|{doc_base_url}/2314-the-first-day-of-the-maximum-recorded-degree-in-each-city.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-asterisks/[2315. Count Asterisks^] //|{source_base_url}/_2315_CountAsterisks.java[Java] //|{doc_base_url}/2315-count-asterisks.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/count-unreachable-pairs-of-nodes-in-an-undirected-graph/[2316. Count Unreachable Pairs of Nodes in an Undirected Graph^] //|{source_base_url}/_2316_CountUnreachablePairsOfNodesInAnUndirectedGraph.java[Java] //|{doc_base_url}/2316-count-unreachable-pairs-of-nodes-in-an-undirected-graph.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-xor-after-operations/[2317. Maximum XOR After Operations ^] //|{source_base_url}/_2317_MaximumXorAfterOperations.java[Java] //|{doc_base_url}/2317-maximum-xor-after-operations.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/number-of-distinct-roll-sequences/[2318. Number of Distinct Roll Sequences^] //|{source_base_url}/_2318_NumberOfDistinctRollSequences.java[Java] //|{doc_base_url}/2318-number-of-distinct-roll-sequences.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/check-if-matrix-is-x-matrix/[2319. Check if Matrix Is X-Matrix^] //|{source_base_url}/_2319_CheckIfMatrixIsXMatrix.java[Java] //|{doc_base_url}/2319-check-if-matrix-is-x-matrix.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/count-number-of-ways-to-place-houses/[2320. Count Number of Ways to Place Houses^] //|{source_base_url}/_2320_CountNumberOfWaysToPlaceHouses.java[Java] //|{doc_base_url}/2320-count-number-of-ways-to-place-houses.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-score-of-spliced-array/[2321. Maximum Score Of Spliced Array^] //|{source_base_url}/_2321_MaximumScoreOfSplicedArray.java[Java] //|{doc_base_url}/2321-maximum-score-of-spliced-array.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/minimum-score-after-removals-on-a-tree/[2322. Minimum Score After Removals on a Tree^] //|{source_base_url}/_2322_MinimumScoreAfterRemovalsOnATree.java[Java] //|{doc_base_url}/2322-minimum-score-after-removals-on-a-tree.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/find-minimum-time-to-finish-all-jobs-ii/[2323. Find Minimum Time to Finish All Jobs II^] //|{source_base_url}/_2323_FindMinimumTimeToFinishAllJobsIi.java[Java] //|{doc_base_url}/2323-find-minimum-time-to-finish-all-jobs-ii.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/product-sales-analysis-iv/[2324. Product Sales Analysis IV^] //|{source_base_url}/_2324_ProductSalesAnalysisIv.java[Java] //|{doc_base_url}/2324-product-sales-analysis-iv.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/decode-the-message/[2325. Decode the Message^] //|{source_base_url}/_2325_DecodeTheMessage.java[Java] //|{doc_base_url}/2325-decode-the-message.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/spiral-matrix-iv/[2326. Spiral Matrix IV^] //|{source_base_url}/_2326_SpiralMatrixIv.java[Java] //|{doc_base_url}/2326-spiral-matrix-iv.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/number-of-people-aware-of-a-secret/[2327. Number of People Aware of a Secret^] //|{source_base_url}/_2327_NumberOfPeopleAwareOfASecret.java[Java] //|{doc_base_url}/2327-number-of-people-aware-of-a-secret.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/number-of-increasing-paths-in-a-grid/[2328. Number of Increasing Paths in a Grid^] //|{source_base_url}/_2328_NumberOfIncreasingPathsInAGrid.java[Java] //|{doc_base_url}/2328-number-of-increasing-paths-in-a-grid.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/product-sales-analysis-v/[2329. Product Sales Analysis V^] //|{source_base_url}/_2329_ProductSalesAnalysisV.java[Java] //|{doc_base_url}/2329-product-sales-analysis-v.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/valid-palindrome-iv/[2330. Valid Palindrome IV^] //|{source_base_url}/_2330_ValidPalindromeIv.java[Java] //|{doc_base_url}/2330-valid-palindrome-iv.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/evaluate-boolean-binary-tree/[2331. Evaluate Boolean Binary Tree^] //|{source_base_url}/_2331_EvaluateBooleanBinaryTree.java[Java] //|{doc_base_url}/2331-evaluate-boolean-binary-tree.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/the-latest-time-to-catch-a-bus/[2332. The Latest Time to Catch a Bus^] //|{source_base_url}/_2332_TheLatestTimeToCatchABus.java[Java] //|{doc_base_url}/2332-the-latest-time-to-catch-a-bus.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-sum-of-squared-difference/[2333. Minimum Sum of Squared Difference^] //|{source_base_url}/_2333_MinimumSumOfSquaredDifference.java[Java] //|{doc_base_url}/2333-minimum-sum-of-squared-difference.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/subarray-with-elements-greater-than-varying-threshold/[2334. Subarray With Elements Greater Than Varying Threshold^] //|{source_base_url}/_2334_SubarrayWithElementsGreaterThanVaryingThreshold.java[Java] //|{doc_base_url}/2334-subarray-with-elements-greater-than-varying-threshold.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/minimum-amount-of-time-to-fill-cups/[2335. Minimum Amount of Time to Fill Cups^] //|{source_base_url}/_2335_MinimumAmountOfTimeToFillCups.java[Java] //|{doc_base_url}/2335-minimum-amount-of-time-to-fill-cups.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/smallest-number-in-infinite-set/[2336. Smallest Number in Infinite Set^] //|{source_base_url}/_2336_SmallestNumberInInfiniteSet.java[Java] //|{doc_base_url}/2336-smallest-number-in-infinite-set.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/move-pieces-to-obtain-a-string/[2337. Move Pieces to Obtain a String^] //|{source_base_url}/_2337_MovePiecesToObtainAString.java[Java] //|{doc_base_url}/2337-move-pieces-to-obtain-a-string.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-the-number-of-ideal-arrays/[2338. Count the Number of Ideal Arrays^] //|{source_base_url}/_2338_CountTheNumberOfIdealArrays.java[Java] //|{doc_base_url}/2338-count-the-number-of-ideal-arrays.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/all-the-matches-of-the-league/[2339. All the Matches of the League^] //|{source_base_url}/_2339_AllTheMatchesOfTheLeague.java[Java] //|{doc_base_url}/2339-all-the-matches-of-the-league.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/minimum-adjacent-swaps-to-make-a-valid-array/[2340. Minimum Adjacent Swaps to Make a Valid Array^] //|{source_base_url}/_2340_MinimumAdjacentSwapsToMakeAValidArray.java[Java] //|{doc_base_url}/2340-minimum-adjacent-swaps-to-make-a-valid-array.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-number-of-pairs-in-array/[2341. Maximum Number of Pairs in Array^] //|{source_base_url}/_2341_MaximumNumberOfPairsInArray.java[Java] //|{doc_base_url}/2341-maximum-number-of-pairs-in-array.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/max-sum-of-a-pair-with-equal-sum-of-digits/[2342. Max Sum of a Pair With Equal Sum of Digits^] //|{source_base_url}/_2342_MaxSumOfAPairWithEqualSumOfDigits.java[Java] //|{doc_base_url}/2342-max-sum-of-a-pair-with-equal-sum-of-digits.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/query-kth-smallest-trimmed-number/[2343. Query Kth Smallest Trimmed Number^] //|{source_base_url}/_2343_QueryKthSmallestTrimmedNumber.java[Java] //|{doc_base_url}/2343-query-kth-smallest-trimmed-number.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-deletions-to-make-array-divisible/[2344. Minimum Deletions to Make Array Divisible^] //|{source_base_url}/_2344_MinimumDeletionsToMakeArrayDivisible.java[Java] //|{doc_base_url}/2344-minimum-deletions-to-make-array-divisible.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/finding-the-number-of-visible-mountains/[2345. Finding the Number of Visible Mountains^] //|{source_base_url}/_2345_FindingTheNumberOfVisibleMountains.java[Java] //|{doc_base_url}/2345-finding-the-number-of-visible-mountains.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/compute-the-rank-as-a-percentage/[2346. Compute the Rank as a Percentage^] //|{source_base_url}/_2346_ComputeTheRankAsAPercentage.java[Java] //|{doc_base_url}/2346-compute-the-rank-as-a-percentage.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/best-poker-hand/[2347. Best Poker Hand^] //|{source_base_url}/_2347_BestPokerHand.java[Java] //|{doc_base_url}/2347-best-poker-hand.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/number-of-zero-filled-subarrays/[2348. Number of Zero-Filled Subarrays^] //|{source_base_url}/_2348_NumberOfZeroFilledSubarrays.java[Java] //|{doc_base_url}/2348-number-of-zero-filled-subarrays.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/design-a-number-container-system/[2349. Design a Number Container System^] //|{source_base_url}/_2349_DesignANumberContainerSystem.java[Java] //|{doc_base_url}/2349-design-a-number-container-system.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/shortest-impossible-sequence-of-rolls/[2350. Shortest Impossible Sequence of Rolls^] //|{source_base_url}/_2350_ShortestImpossibleSequenceOfRolls.java[Java] //|{doc_base_url}/2350-shortest-impossible-sequence-of-rolls.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/first-letter-to-appear-twice/[2351. First Letter to Appear Twice^] //|{source_base_url}/_2351_FirstLetterToAppearTwice.java[Java] //|{doc_base_url}/2351-first-letter-to-appear-twice.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/equal-row-and-column-pairs/[2352. Equal Row and Column Pairs^] //|{source_base_url}/_2352_EqualRowAndColumnPairs.java[Java] //|{doc_base_url}/2352-equal-row-and-column-pairs.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/design-a-food-rating-system/[2353. Design a Food Rating System^] //|{source_base_url}/_2353_DesignAFoodRatingSystem.java[Java] //|{doc_base_url}/2353-design-a-food-rating-system.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/number-of-excellent-pairs/[2354. Number of Excellent Pairs^] //|{source_base_url}/_2354_NumberOfExcellentPairs.java[Java] //|{doc_base_url}/2354-number-of-excellent-pairs.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/maximum-number-of-books-you-can-take/[2355. Maximum Number of Books You Can Take^] //|{source_base_url}/_2355_MaximumNumberOfBooksYouCanTake.java[Java] //|{doc_base_url}/2355-maximum-number-of-books-you-can-take.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/number-of-unique-subjects-taught-by-each-teacher/[2356. Number of Unique Subjects Taught by Each Teacher^] //|{source_base_url}/_2356_NumberOfUniqueSubjectsTaughtByEachTeacher.java[Java] //|{doc_base_url}/2356-number-of-unique-subjects-taught-by-each-teacher.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/make-array-zero-by-subtracting-equal-amounts/[2357. Make Array Zero by Subtracting Equal Amounts^] //|{source_base_url}/_2357_MakeArrayZeroBySubtractingEqualAmounts.java[Java] //|{doc_base_url}/2357-make-array-zero-by-subtracting-equal-amounts.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/maximum-number-of-groups-entering-a-competition/[2358. Maximum Number of Groups Entering a Competition^] //|{source_base_url}/_2358_MaximumNumberOfGroupsEnteringACompetition.java[Java] //|{doc_base_url}/2358-maximum-number-of-groups-entering-a-competition.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-closest-node-to-given-two-nodes/[2359. Find Closest Node to Given Two Nodes^] //|{source_base_url}/_2359_FindClosestNodeToGivenTwoNodes.java[Java] //|{doc_base_url}/2359-find-closest-node-to-given-two-nodes.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/longest-cycle-in-a-graph/[2360. Longest Cycle in a Graph^] //|{source_base_url}/_2360_LongestCycleInAGraph.java[Java] //|{doc_base_url}/2360-longest-cycle-in-a-graph.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/minimum-costs-using-the-train-line/[2361. Minimum Costs Using the Train Line^] //|{source_base_url}/_2361_MinimumCostsUsingTheTrainLine.java[Java] //|{doc_base_url}/2361-minimum-costs-using-the-train-line.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/generate-the-invoice/[2362. Generate the Invoice^] //|{source_base_url}/_2362_GenerateTheInvoice.java[Java] //|{doc_base_url}/2362-generate-the-invoice.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/merge-similar-items/[2363. Merge Similar Items^] //|{source_base_url}/_2363_MergeSimilarItems.java[Java] //|{doc_base_url}/2363-merge-similar-items.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/count-number-of-bad-pairs/[2364. Count Number of Bad Pairs^] //|{source_base_url}/_2364_CountNumberOfBadPairs.java[Java] //|{doc_base_url}/2364-count-number-of-bad-pairs.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/task-scheduler-ii/[2365. Task Scheduler II^] //|{source_base_url}/_2365_TaskSchedulerIi.java[Java] //|{doc_base_url}/2365-task-scheduler-ii.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-replacements-to-sort-the-array/[2366. Minimum Replacements to Sort the Array^] //|{source_base_url}/_2366_MinimumReplacementsToSortTheArray.java[Java] //|{doc_base_url}/2366-minimum-replacements-to-sort-the-array.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/number-of-arithmetic-triplets/[2367. Number of Arithmetic Triplets^] //|{source_base_url}/_2367_NumberOfArithmeticTriplets.java[Java] //|{doc_base_url}/2367-number-of-arithmetic-triplets.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/reachable-nodes-with-restrictions/[2368. Reachable Nodes With Restrictions^] //|{source_base_url}/_2368_ReachableNodesWithRestrictions.java[Java] //|{doc_base_url}/2368-reachable-nodes-with-restrictions.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/check-if-there-is-a-valid-partition-for-the-array/[2369. Check if There is a Valid Partition For The Array^] //|{source_base_url}/_2369_CheckIfThereIsAValidPartitionForTheArray.java[Java] //|{doc_base_url}/2369-check-if-there-is-a-valid-partition-for-the-array.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/longest-ideal-subsequence/[2370. Longest Ideal Subsequence^] //|{source_base_url}/_2370_LongestIdealSubsequence.java[Java] //|{doc_base_url}/2370-longest-ideal-subsequence.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimize-maximum-value-in-a-grid/[2371. Minimize Maximum Value in a Grid^] //|{source_base_url}/_2371_MinimizeMaximumValueInAGrid.java[Java] //|{doc_base_url}/2371-minimize-maximum-value-in-a-grid.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/calculate-the-influence-of-each-salesperson/[2372. Calculate the Influence of Each Salesperson^] //|{source_base_url}/_2372_CalculateTheInfluenceOfEachSalesperson.java[Java] //|{doc_base_url}/2372-calculate-the-influence-of-each-salesperson.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/largest-local-values-in-a-matrix/[2373. Largest Local Values in a Matrix^] //|{source_base_url}/_2373_LargestLocalValuesInAMatrix.java[Java] //|{doc_base_url}/2373-largest-local-values-in-a-matrix.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/node-with-highest-edge-score/[2374. Node With Highest Edge Score^] //|{source_base_url}/_2374_NodeWithHighestEdgeScore.java[Java] //|{doc_base_url}/2374-node-with-highest-edge-score.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/construct-smallest-number-from-di-string/[2375. Construct Smallest Number From DI String^] //|{source_base_url}/_2375_ConstructSmallestNumberFromDiString.java[Java] //|{doc_base_url}/2375-construct-smallest-number-from-di-string.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-special-integers/[2376. Count Special Integers^] //|{source_base_url}/_2376_CountSpecialIntegers.java[Java] //|{doc_base_url}/2376-count-special-integers.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/sort-the-olympic-table/[2377. Sort the Olympic Table^] //|{source_base_url}/_2377_SortTheOlympicTable.java[Java] //|{doc_base_url}/2377-sort-the-olympic-table.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/choose-edges-to-maximize-score-in-a-tree/[2378. Choose Edges to Maximize Score in a Tree^] //|{source_base_url}/_2378_ChooseEdgesToMaximizeScoreInATree.java[Java] //|{doc_base_url}/2378-choose-edges-to-maximize-score-in-a-tree.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-recolors-to-get-k-consecutive-black-blocks/[2379. Minimum Recolors to Get K Consecutive Black Blocks^] //|{source_base_url}/_2379_MinimumRecolorsToGetKConsecutiveBlackBlocks.java[Java] //|{doc_base_url}/2379-minimum-recolors-to-get-k-consecutive-black-blocks.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/time-needed-to-rearrange-a-binary-string/[2380. Time Needed to Rearrange a Binary String^] //|{source_base_url}/_2380_TimeNeededToRearrangeABinaryString.java[Java] //|{doc_base_url}/2380-time-needed-to-rearrange-a-binary-string.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/shifting-letters-ii/[2381. Shifting Letters II^] //|{source_base_url}/_2381_ShiftingLettersIi.java[Java] //|{doc_base_url}/2381-shifting-letters-ii.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-segment-sum-after-removals/[2382. Maximum Segment Sum After Removals^] //|{source_base_url}/_2382_MaximumSegmentSumAfterRemovals.java[Java] //|{doc_base_url}/2382-maximum-segment-sum-after-removals.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/minimum-hours-of-training-to-win-a-competition/[2383. Minimum Hours of Training to Win a Competition^] //|{source_base_url}/_2383_MinimumHoursOfTrainingToWinACompetition.java[Java] //|{doc_base_url}/2383-minimum-hours-of-training-to-win-a-competition.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/largest-palindromic-number/[2384. Largest Palindromic Number^] //|{source_base_url}/_2384_LargestPalindromicNumber.java[Java] //|{doc_base_url}/2384-largest-palindromic-number.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/amount-of-time-for-binary-tree-to-be-infected/[2385. Amount of Time for Binary Tree to Be Infected^] //|{source_base_url}/_2385_AmountOfTimeForBinaryTreeToBeInfected.java[Java] //|{doc_base_url}/2385-amount-of-time-for-binary-tree-to-be-infected.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-the-k-sum-of-an-array/[2386. Find the K-Sum of an Array^] //|{source_base_url}/_2386_FindTheKSumOfAnArray.java[Java] //|{doc_base_url}/2386-find-the-k-sum-of-an-array.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/median-of-a-row-wise-sorted-matrix/[2387. Median of a Row Wise Sorted Matrix^] //|{source_base_url}/_2387_MedianOfARowWiseSortedMatrix.java[Java] //|{doc_base_url}/2387-median-of-a-row-wise-sorted-matrix.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/change-null-values-in-a-table-to-the-previous-value/[2388. Change Null Values in a Table to the Previous Value^] //|{source_base_url}/_2388_ChangeNullValuesInATableToThePreviousValue.java[Java] //|{doc_base_url}/2388-change-null-values-in-a-table-to-the-previous-value.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/longest-subsequence-with-limited-sum/[2389. Longest Subsequence With Limited Sum^] //|{source_base_url}/_2389_LongestSubsequenceWithLimitedSum.java[Java] //|{doc_base_url}/2389-longest-subsequence-with-limited-sum.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/removing-stars-from-a-string/[2390. Removing Stars From a String^] //|{source_base_url}/_2390_RemovingStarsFromAString.java[Java] //|{doc_base_url}/2390-removing-stars-from-a-string.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-amount-of-time-to-collect-garbage/[2391. Minimum Amount of Time to Collect Garbage^] //|{source_base_url}/_2391_MinimumAmountOfTimeToCollectGarbage.java[Java] //|{doc_base_url}/2391-minimum-amount-of-time-to-collect-garbage.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/build-a-matrix-with-conditions/[2392. Build a Matrix With Conditions^] //|{source_base_url}/_2392_BuildAMatrixWithConditions.java[Java] //|{doc_base_url}/2392-build-a-matrix-with-conditions.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/count-strictly-increasing-subarrays/[2393. Count Strictly Increasing Subarrays^] //|{source_base_url}/_2393_CountStrictlyIncreasingSubarrays.java[Java] //|{doc_base_url}/2393-count-strictly-increasing-subarrays.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/employees-with-deductions/[2394. Employees With Deductions^] //|{source_base_url}/_2394_EmployeesWithDeductions.java[Java] //|{doc_base_url}/2394-employees-with-deductions.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-subarrays-with-equal-sum/[2395. Find Subarrays With Equal Sum^] //|{source_base_url}/_2395_FindSubarraysWithEqualSum.java[Java] //|{doc_base_url}/2395-find-subarrays-with-equal-sum.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/strictly-palindromic-number/[2396. Strictly Palindromic Number^] //|{source_base_url}/_2396_StrictlyPalindromicNumber.java[Java] //|{doc_base_url}/2396-strictly-palindromic-number.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-rows-covered-by-columns/[2397. Maximum Rows Covered by Columns^] //|{source_base_url}/_2397_MaximumRowsCoveredByColumns.java[Java] //|{doc_base_url}/2397-maximum-rows-covered-by-columns.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-number-of-robots-within-budget/[2398. Maximum Number of Robots Within Budget^] //|{source_base_url}/_2398_MaximumNumberOfRobotsWithinBudget.java[Java] //|{doc_base_url}/2398-maximum-number-of-robots-within-budget.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/check-distances-between-same-letters/[2399. Check Distances Between Same Letters^] //|{source_base_url}/_2399_CheckDistancesBetweenSameLetters.java[Java] //|{doc_base_url}/2399-check-distances-between-same-letters.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/number-of-ways-to-reach-a-position-after-exactly-k-steps/[2400. Number of Ways to Reach a Position After Exactly k Steps^] //|{source_base_url}/_2400_NumberOfWaysToReachAPositionAfterExactlyKSteps.java[Java] //|{doc_base_url}/2400-number-of-ways-to-reach-a-position-after-exactly-k-steps.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/longest-nice-subarray/[2401. Longest Nice Subarray^] //|{source_base_url}/_2401_LongestNiceSubarray.java[Java] //|{doc_base_url}/2401-longest-nice-subarray.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/meeting-rooms-iii/[2402. Meeting Rooms III^] //|{source_base_url}/_2402_MeetingRoomsIii.java[Java] //|{doc_base_url}/2402-meeting-rooms-iii.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/minimum-time-to-kill-all-monsters/[2403. Minimum Time to Kill All Monsters^] //|{source_base_url}/_2403_MinimumTimeToKillAllMonsters.java[Java] //|{doc_base_url}/2403-minimum-time-to-kill-all-monsters.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/most-frequent-even-element/[2404. Most Frequent Even Element^] //|{source_base_url}/_2404_MostFrequentEvenElement.java[Java] //|{doc_base_url}/2404-most-frequent-even-element.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/optimal-partition-of-string/[2405. Optimal Partition of String^] //|{source_base_url}/_2405_OptimalPartitionOfString.java[Java] //|{doc_base_url}/2405-optimal-partition-of-string.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/divide-intervals-into-minimum-number-of-groups/[2406. Divide Intervals Into Minimum Number of Groups^] //|{source_base_url}/_2406_DivideIntervalsIntoMinimumNumberOfGroups.java[Java] //|{doc_base_url}/2406-divide-intervals-into-minimum-number-of-groups.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/longest-increasing-subsequence-ii/[2407. Longest Increasing Subsequence II^] //|{source_base_url}/_2407_LongestIncreasingSubsequenceIi.java[Java] //|{doc_base_url}/2407-longest-increasing-subsequence-ii.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/design-sql/[2408. Design SQL^] //|{source_base_url}/_2408_DesignSql.java[Java] //|{doc_base_url}/2408-design-sql.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-days-spent-together/[2409. Count Days Spent Together^] //|{source_base_url}/_2409_CountDaysSpentTogether.java[Java] //|{doc_base_url}/2409-count-days-spent-together.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/maximum-matching-of-players-with-trainers/[2410. Maximum Matching of Players With Trainers^] //|{source_base_url}/_2410_MaximumMatchingOfPlayersWithTrainers.java[Java] //|{doc_base_url}/2410-maximum-matching-of-players-with-trainers.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/smallest-subarrays-with-maximum-bitwise-or/[2411. Smallest Subarrays With Maximum Bitwise OR^] //|{source_base_url}/_2411_SmallestSubarraysWithMaximumBitwiseOr.java[Java] //|{doc_base_url}/2411-smallest-subarrays-with-maximum-bitwise-or.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-money-required-before-transactions/[2412. Minimum Money Required Before Transactions^] //|{source_base_url}/_2412_MinimumMoneyRequiredBeforeTransactions.java[Java] //|{doc_base_url}/2412-minimum-money-required-before-transactions.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/smallest-even-multiple/[2413. Smallest Even Multiple^] //|{source_base_url}/_2413_SmallestEvenMultiple.java[Java] //|{doc_base_url}/2413-smallest-even-multiple.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/length-of-the-longest-alphabetical-continuous-substring/[2414. Length of the Longest Alphabetical Continuous Substring^] //|{source_base_url}/_2414_LengthOfTheLongestAlphabeticalContinuousSubstring.java[Java] //|{doc_base_url}/2414-length-of-the-longest-alphabetical-continuous-substring.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/reverse-odd-levels-of-binary-tree/[2415. Reverse Odd Levels of Binary Tree^] //|{source_base_url}/_2415_ReverseOddLevelsOfBinaryTree.java[Java] //|{doc_base_url}/2415-reverse-odd-levels-of-binary-tree.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/sum-of-prefix-scores-of-strings/[2416. Sum of Prefix Scores of Strings^] //|{source_base_url}/_2416_SumOfPrefixScoresOfStrings.java[Java] //|{doc_base_url}/2416-sum-of-prefix-scores-of-strings.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/closest-fair-integer/[2417. Closest Fair Integer^] //|{source_base_url}/_2417_ClosestFairInteger.java[Java] //|{doc_base_url}/2417-closest-fair-integer.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/sort-the-people/[2418. Sort the People^] //|{source_base_url}/_2418_SortThePeople.java[Java] //|{doc_base_url}/2418-sort-the-people.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/longest-subarray-with-maximum-bitwise-and/[2419. Longest Subarray With Maximum Bitwise AND^] //|{source_base_url}/_2419_LongestSubarrayWithMaximumBitwiseAnd.java[Java] //|{doc_base_url}/2419-longest-subarray-with-maximum-bitwise-and.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-all-good-indices/[2420. Find All Good Indices^] //|{source_base_url}/_2420_FindAllGoodIndices.java[Java] //|{doc_base_url}/2420-find-all-good-indices.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/number-of-good-paths/[2421. Number of Good Paths^] //|{source_base_url}/_2421_NumberOfGoodPaths.java[Java] //|{doc_base_url}/2421-number-of-good-paths.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/merge-operations-to-turn-array-into-a-palindrome/[2422. Merge Operations to Turn Array Into a Palindrome^] //|{source_base_url}/_2422_MergeOperationsToTurnArrayIntoAPalindrome.java[Java] //|{doc_base_url}/2422-merge-operations-to-turn-array-into-a-palindrome.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/remove-letter-to-equalize-frequency/[2423. Remove Letter To Equalize Frequency^] //|{source_base_url}/_2423_RemoveLetterToEqualizeFrequency.java[Java] //|{doc_base_url}/2423-remove-letter-to-equalize-frequency.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/longest-uploaded-prefix/[2424. Longest Uploaded Prefix^] //|{source_base_url}/_2424_LongestUploadedPrefix.java[Java] //|{doc_base_url}/2424-longest-uploaded-prefix.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/bitwise-xor-of-all-pairings/[2425. Bitwise XOR of All Pairings^] //|{source_base_url}/_2425_BitwiseXorOfAllPairings.java[Java] //|{doc_base_url}/2425-bitwise-xor-of-all-pairings.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/number-of-pairs-satisfying-inequality/[2426. Number of Pairs Satisfying Inequality^] //|{source_base_url}/_2426_NumberOfPairsSatisfyingInequality.java[Java] //|{doc_base_url}/2426-number-of-pairs-satisfying-inequality.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/number-of-common-factors/[2427. Number of Common Factors^] //|{source_base_url}/_2427_NumberOfCommonFactors.java[Java] //|{doc_base_url}/2427-number-of-common-factors.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/maximum-sum-of-an-hourglass/[2428. Maximum Sum of an Hourglass^] //|{source_base_url}/_2428_MaximumSumOfAnHourglass.java[Java] //|{doc_base_url}/2428-maximum-sum-of-an-hourglass.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimize-xor/[2429. Minimize XOR^] //|{source_base_url}/_2429_MinimizeXor.java[Java] //|{doc_base_url}/2429-minimize-xor.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-deletions-on-a-string/[2430. Maximum Deletions on a String^] //|{source_base_url}/_2430_MaximumDeletionsOnAString.java[Java] //|{doc_base_url}/2430-maximum-deletions-on-a-string.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/maximize-total-tastiness-of-purchased-fruits/[2431. Maximize Total Tastiness of Purchased Fruits^] //|{source_base_url}/_2431_MaximizeTotalTastinessOfPurchasedFruits.java[Java] //|{doc_base_url}/2431-maximize-total-tastiness-of-purchased-fruits.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/the-employee-that-worked-on-the-longest-task/[2432. The Employee That Worked on the Longest Task^] //|{source_base_url}/_2432_TheEmployeeThatWorkedOnTheLongestTask.java[Java] //|{doc_base_url}/2432-the-employee-that-worked-on-the-longest-task.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/find-the-original-array-of-prefix-xor/[2433. Find The Original Array of Prefix Xor^] //|{source_base_url}/_2433_FindTheOriginalArrayOfPrefixXor.java[Java] //|{doc_base_url}/2433-find-the-original-array-of-prefix-xor.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/using-a-robot-to-print-the-lexicographically-smallest-string/[2434. Using a Robot to Print the Lexicographically Smallest String^] //|{source_base_url}/_2434_UsingARobotToPrintTheLexicographicallySmallestString.java[Java] //|{doc_base_url}/2434-using-a-robot-to-print-the-lexicographically-smallest-string.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/paths-in-matrix-whose-sum-is-divisible-by-k/[2435. Paths in Matrix Whose Sum Is Divisible by K^] //|{source_base_url}/_2435_PathsInMatrixWhoseSumIsDivisibleByK.java[Java] //|{doc_base_url}/2435-paths-in-matrix-whose-sum-is-divisible-by-k.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/minimum-split-into-subarrays-with-gcd-greater-than-one/[2436. Minimum Split Into Subarrays With GCD Greater Than One^] //|{source_base_url}/_2436_MinimumSplitIntoSubarraysWithGcdGreaterThanOne.java[Java] //|{doc_base_url}/2436-minimum-split-into-subarrays-with-gcd-greater-than-one.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/number-of-valid-clock-times/[2437. Number of Valid Clock Times^] //|{source_base_url}/_2437_NumberOfValidClockTimes.java[Java] //|{doc_base_url}/2437-number-of-valid-clock-times.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/range-product-queries-of-powers/[2438. Range Product Queries of Powers^] //|{source_base_url}/_2438_RangeProductQueriesOfPowers.java[Java] //|{doc_base_url}/2438-range-product-queries-of-powers.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimize-maximum-of-array/[2439. Minimize Maximum of Array^] //|{source_base_url}/_2439_MinimizeMaximumOfArray.java[Java] //|{doc_base_url}/2439-minimize-maximum-of-array.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/create-components-with-same-value/[2440. Create Components With Same Value^] //|{source_base_url}/_2440_CreateComponentsWithSameValue.java[Java] //|{doc_base_url}/2440-create-components-with-same-value.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/largest-positive-integer-that-exists-with-its-negative/[2441. Largest Positive Integer That Exists With Its Negative^] //|{source_base_url}/_2441_LargestPositiveIntegerThatExistsWithItsNegative.java[Java] //|{doc_base_url}/2441-largest-positive-integer-that-exists-with-its-negative.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/count-number-of-distinct-integers-after-reverse-operations/[2442. Count Number of Distinct Integers After Reverse Operations^] //|{source_base_url}/_2442_CountNumberOfDistinctIntegersAfterReverseOperations.java[Java] //|{doc_base_url}/2442-count-number-of-distinct-integers-after-reverse-operations.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/sum-of-number-and-its-reverse/[2443. Sum of Number and Its Reverse^] //|{source_base_url}/_2443_SumOfNumberAndItsReverse.java[Java] //|{doc_base_url}/2443-sum-of-number-and-its-reverse.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-subarrays-with-fixed-bounds/[2444. Count Subarrays With Fixed Bounds^] //|{source_base_url}/_2444_CountSubarraysWithFixedBounds.java[Java] //|{doc_base_url}/2444-count-subarrays-with-fixed-bounds.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/number-of-nodes-with-value-one/[2445. Number of Nodes With Value One^] //|{source_base_url}/_2445_NumberOfNodesWithValueOne.java[Java] //|{doc_base_url}/2445-number-of-nodes-with-value-one.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/determine-if-two-events-have-conflict/[2446. Determine if Two Events Have Conflict^] //|{source_base_url}/_2446_DetermineIfTwoEventsHaveConflict.java[Java] //|{doc_base_url}/2446-determine-if-two-events-have-conflict.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/number-of-subarrays-with-gcd-equal-to-k/[2447. Number of Subarrays With GCD Equal to K^] //|{source_base_url}/_2447_NumberOfSubarraysWithGcdEqualToK.java[Java] //|{doc_base_url}/2447-number-of-subarrays-with-gcd-equal-to-k.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-cost-to-make-array-equal/[2448. Minimum Cost to Make Array Equal^] //|{source_base_url}/_2448_MinimumCostToMakeArrayEqual.java[Java] //|{doc_base_url}/2448-minimum-cost-to-make-array-equal.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/minimum-number-of-operations-to-make-arrays-similar/[2449. Minimum Number of Operations to Make Arrays Similar^] //|{source_base_url}/_2449_MinimumNumberOfOperationsToMakeArraysSimilar.java[Java] //|{doc_base_url}/2449-minimum-number-of-operations-to-make-arrays-similar.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/number-of-distinct-binary-strings-after-applying-operations/[2450. Number of Distinct Binary Strings After Applying Operations^] //|{source_base_url}/_2450_NumberOfDistinctBinaryStringsAfterApplyingOperations.java[Java] //|{doc_base_url}/2450-number-of-distinct-binary-strings-after-applying-operations.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/odd-string-difference/[2451. Odd String Difference^] //|{source_base_url}/_2451_OddStringDifference.java[Java] //|{doc_base_url}/2451-odd-string-difference.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/words-within-two-edits-of-dictionary/[2452. Words Within Two Edits of Dictionary^] //|{source_base_url}/_2452_WordsWithinTwoEditsOfDictionary.java[Java] //|{doc_base_url}/2452-words-within-two-edits-of-dictionary.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/destroy-sequential-targets/[2453. Destroy Sequential Targets^] //|{source_base_url}/_2453_DestroySequentialTargets.java[Java] //|{doc_base_url}/2453-destroy-sequential-targets.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/next-greater-element-iv/[2454. Next Greater Element IV^] //|{source_base_url}/_2454_NextGreaterElementIv.java[Java] //|{doc_base_url}/2454-next-greater-element-iv.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/average-value-of-even-numbers-that-are-divisible-by-three/[2455. Average Value of Even Numbers That Are Divisible by Three^] //|{source_base_url}/_2455_AverageValueOfEvenNumbersThatAreDivisibleByThree.java[Java] //|{doc_base_url}/2455-average-value-of-even-numbers-that-are-divisible-by-three.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/most-popular-video-creator/[2456. Most Popular Video Creator^] //|{source_base_url}/_2456_MostPopularVideoCreator.java[Java] //|{doc_base_url}/2456-most-popular-video-creator.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-addition-to-make-integer-beautiful/[2457. Minimum Addition to Make Integer Beautiful^] //|{source_base_url}/_2457_MinimumAdditionToMakeIntegerBeautiful.java[Java] //|{doc_base_url}/2457-minimum-addition-to-make-integer-beautiful.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/height-of-binary-tree-after-subtree-removal-queries/[2458. Height of Binary Tree After Subtree Removal Queries^] //|{source_base_url}/_2458_HeightOfBinaryTreeAfterSubtreeRemovalQueries.java[Java] //|{doc_base_url}/2458-height-of-binary-tree-after-subtree-removal-queries.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/sort-array-by-moving-items-to-empty-space/[2459. Sort Array by Moving Items to Empty Space^] //|{source_base_url}/_2459_SortArrayByMovingItemsToEmptySpace.java[Java] //|{doc_base_url}/2459-sort-array-by-moving-items-to-empty-space.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/apply-operations-to-an-array/[2460. Apply Operations to an Array^] //|{source_base_url}/_2460_ApplyOperationsToAnArray.java[Java] //|{doc_base_url}/2460-apply-operations-to-an-array.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/maximum-sum-of-distinct-subarrays-with-length-k/[2461. Maximum Sum of Distinct Subarrays With Length K^] //|{source_base_url}/_2461_MaximumSumOfDistinctSubarraysWithLengthK.java[Java] //|{doc_base_url}/2461-maximum-sum-of-distinct-subarrays-with-length-k.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/total-cost-to-hire-k-workers/[2462. Total Cost to Hire K Workers^] //|{source_base_url}/_2462_TotalCostToHireKWorkers.java[Java] //|{doc_base_url}/2462-total-cost-to-hire-k-workers.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-total-distance-traveled/[2463. Minimum Total Distance Traveled^] //|{source_base_url}/_2463_MinimumTotalDistanceTraveled.java[Java] //|{doc_base_url}/2463-minimum-total-distance-traveled.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/minimum-subarrays-in-a-valid-split/[2464. Minimum Subarrays in a Valid Split^] //|{source_base_url}/_2464_MinimumSubarraysInAValidSplit.java[Java] //|{doc_base_url}/2464-minimum-subarrays-in-a-valid-split.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/number-of-distinct-averages/[2465. Number of Distinct Averages^] //|{source_base_url}/_2465_NumberOfDistinctAverages.java[Java] //|{doc_base_url}/2465-number-of-distinct-averages.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/count-ways-to-build-good-strings/[2466. Count Ways To Build Good Strings^] //|{source_base_url}/_2466_CountWaysToBuildGoodStrings.java[Java] //|{doc_base_url}/2466-count-ways-to-build-good-strings.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/most-profitable-path-in-a-tree/[2467. Most Profitable Path in a Tree^] //|{source_base_url}/_2467_MostProfitablePathInATree.java[Java] //|{doc_base_url}/2467-most-profitable-path-in-a-tree.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/split-message-based-on-limit/[2468. Split Message Based on Limit^] //|{source_base_url}/_2468_SplitMessageBasedOnLimit.java[Java] //|{doc_base_url}/2468-split-message-based-on-limit.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/convert-the-temperature/[2469. Convert the Temperature^] //|{source_base_url}/_2469_ConvertTheTemperature.java[Java] //|{doc_base_url}/2469-convert-the-temperature.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/number-of-subarrays-with-lcm-equal-to-k/[2470. Number of Subarrays With LCM Equal to K^] //|{source_base_url}/_2470_NumberOfSubarraysWithLcmEqualToK.java[Java] //|{doc_base_url}/2470-number-of-subarrays-with-lcm-equal-to-k.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-number-of-operations-to-sort-a-binary-tree-by-level/[2471. Minimum Number of Operations to Sort a Binary Tree by Level^] //|{source_base_url}/_2471_MinimumNumberOfOperationsToSortABinaryTreeByLevel.java[Java] //|{doc_base_url}/2471-minimum-number-of-operations-to-sort-a-binary-tree-by-level.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-number-of-non-overlapping-palindrome-substrings/[2472. Maximum Number of Non-overlapping Palindrome Substrings^] //|{source_base_url}/_2472_MaximumNumberOfNonOverlappingPalindromeSubstrings.java[Java] //|{doc_base_url}/2472-maximum-number-of-non-overlapping-palindrome-substrings.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/minimum-cost-to-buy-apples/[2473. Minimum Cost to Buy Apples^] //|{source_base_url}/_2473_MinimumCostToBuyApples.java[Java] //|{doc_base_url}/2473-minimum-cost-to-buy-apples.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/customers-with-strictly-increasing-purchases/[2474. Customers With Strictly Increasing Purchases^] //|{source_base_url}/_2474_CustomersWithStrictlyIncreasingPurchases.java[Java] //|{doc_base_url}/2474-customers-with-strictly-increasing-purchases.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/number-of-unequal-triplets-in-array/[2475. Number of Unequal Triplets in Array^] //|{source_base_url}/_2475_NumberOfUnequalTripletsInArray.java[Java] //|{doc_base_url}/2475-number-of-unequal-triplets-in-array.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/closest-nodes-queries-in-a-binary-search-tree/[2476. Closest Nodes Queries in a Binary Search Tree^] //|{source_base_url}/_2476_ClosestNodesQueriesInABinarySearchTree.java[Java] //|{doc_base_url}/2476-closest-nodes-queries-in-a-binary-search-tree.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-fuel-cost-to-report-to-the-capital/[2477. Minimum Fuel Cost to Report to the Capital^] //|{source_base_url}/_2477_MinimumFuelCostToReportToTheCapital.java[Java] //|{doc_base_url}/2477-minimum-fuel-cost-to-report-to-the-capital.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/number-of-beautiful-partitions/[2478. Number of Beautiful Partitions^] //|{source_base_url}/_2478_NumberOfBeautifulPartitions.java[Java] //|{doc_base_url}/2478-number-of-beautiful-partitions.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/maximum-xor-of-two-non-overlapping-subtrees/[2479. Maximum XOR of Two Non-Overlapping Subtrees^] //|{source_base_url}/_2479_MaximumXorOfTwoNonOverlappingSubtrees.java[Java] //|{doc_base_url}/2479-maximum-xor-of-two-non-overlapping-subtrees.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/form-a-chemical-bond/[2480. Form a Chemical Bond^] //|{source_base_url}/_2480_FormAChemicalBond.java[Java] //|{doc_base_url}/2480-form-a-chemical-bond.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/minimum-cuts-to-divide-a-circle/[2481. Minimum Cuts to Divide a Circle^] //|{source_base_url}/_2481_MinimumCutsToDivideACircle.java[Java] //|{doc_base_url}/2481-minimum-cuts-to-divide-a-circle.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/difference-between-ones-and-zeros-in-row-and-column/[2482. Difference Between Ones and Zeros in Row and Column^] //|{source_base_url}/_2482_DifferenceBetweenOnesAndZerosInRowAndColumn.java[Java] //|{doc_base_url}/2482-difference-between-ones-and-zeros-in-row-and-column.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-penalty-for-a-shop/[2483. Minimum Penalty for a Shop^] //|{source_base_url}/_2483_MinimumPenaltyForAShop.java[Java] //|{doc_base_url}/2483-minimum-penalty-for-a-shop.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-palindromic-subsequences/[2484. Count Palindromic Subsequences^] //|{source_base_url}/_2484_CountPalindromicSubsequences.java[Java] //|{doc_base_url}/2484-count-palindromic-subsequences.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/find-the-pivot-integer/[2485. Find the Pivot Integer^] //|{source_base_url}/_2485_FindThePivotInteger.java[Java] //|{doc_base_url}/2485-find-the-pivot-integer.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/append-characters-to-string-to-make-subsequence/[2486. Append Characters to String to Make Subsequence^] //|{source_base_url}/_2486_AppendCharactersToStringToMakeSubsequence.java[Java] //|{doc_base_url}/2486-append-characters-to-string-to-make-subsequence.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/remove-nodes-from-linked-list/[2487. Remove Nodes From Linked List^] //|{source_base_url}/_2487_RemoveNodesFromLinkedList.java[Java] //|{doc_base_url}/2487-remove-nodes-from-linked-list.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-subarrays-with-median-k/[2488. Count Subarrays With Median K^] //|{source_base_url}/_2488_CountSubarraysWithMedianK.java[Java] //|{doc_base_url}/2488-count-subarrays-with-median-k.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/number-of-substrings-with-fixed-ratio/[2489. Number of Substrings With Fixed Ratio^] //|{source_base_url}/_2489_NumberOfSubstringsWithFixedRatio.java[Java] //|{doc_base_url}/2489-number-of-substrings-with-fixed-ratio.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/circular-sentence/[2490. Circular Sentence^] //|{source_base_url}/_2490_CircularSentence.java[Java] //|{doc_base_url}/2490-circular-sentence.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/divide-players-into-teams-of-equal-skill/[2491. Divide Players Into Teams of Equal Skill^] //|{source_base_url}/_2491_DividePlayersIntoTeamsOfEqualSkill.java[Java] //|{doc_base_url}/2491-divide-players-into-teams-of-equal-skill.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-score-of-a-path-between-two-cities/[2492. Minimum Score of a Path Between Two Cities^] //|{source_base_url}/_2492_MinimumScoreOfAPathBetweenTwoCities.java[Java] //|{doc_base_url}/2492-minimum-score-of-a-path-between-two-cities.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/divide-nodes-into-the-maximum-number-of-groups/[2493. Divide Nodes Into the Maximum Number of Groups^] //|{source_base_url}/_2493_DivideNodesIntoTheMaximumNumberOfGroups.java[Java] //|{doc_base_url}/2493-divide-nodes-into-the-maximum-number-of-groups.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/merge-overlapping-events-in-the-same-hall/[2494. Merge Overlapping Events in the Same Hall^] //|{source_base_url}/_2494_MergeOverlappingEventsInTheSameHall.java[Java] //|{doc_base_url}/2494-merge-overlapping-events-in-the-same-hall.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/number-of-subarrays-having-even-product/[2495. Number of Subarrays Having Even Product^] //|{source_base_url}/_2495_NumberOfSubarraysHavingEvenProduct.java[Java] //|{doc_base_url}/2495-number-of-subarrays-having-even-product.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-value-of-a-string-in-an-array/[2496. Maximum Value of a String in an Array^] //|{source_base_url}/_2496_MaximumValueOfAStringInAnArray.java[Java] //|{doc_base_url}/2496-maximum-value-of-a-string-in-an-array.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/maximum-star-sum-of-a-graph/[2497. Maximum Star Sum of a Graph^] //|{source_base_url}/_2497_MaximumStarSumOfAGraph.java[Java] //|{doc_base_url}/2497-maximum-star-sum-of-a-graph.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/frog-jump-ii/[2498. Frog Jump II^] //|{source_base_url}/_2498_FrogJumpIi.java[Java] //|{doc_base_url}/2498-frog-jump-ii.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-total-cost-to-make-arrays-unequal/[2499. Minimum Total Cost to Make Arrays Unequal^] //|{source_base_url}/_2499_MinimumTotalCostToMakeArraysUnequal.java[Java] //|{doc_base_url}/2499-minimum-total-cost-to-make-arrays-unequal.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/delete-greatest-value-in-each-row/[2500. Delete Greatest Value in Each Row^] //|{source_base_url}/_2500_DeleteGreatestValueInEachRow.java[Java] //|{doc_base_url}/2500-delete-greatest-value-in-each-row.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/longest-square-streak-in-an-array/[2501. Longest Square Streak in an Array^] //|{source_base_url}/_2501_LongestSquareStreakInAnArray.java[Java] //|{doc_base_url}/2501-longest-square-streak-in-an-array.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/design-memory-allocator/[2502. Design Memory Allocator^] //|{source_base_url}/_2502_DesignMemoryAllocator.java[Java] //|{doc_base_url}/2502-design-memory-allocator.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-number-of-points-from-grid-queries/[2503. Maximum Number of Points From Grid Queries^] //|{source_base_url}/_2503_MaximumNumberOfPointsFromGridQueries.java[Java] //|{doc_base_url}/2503-maximum-number-of-points-from-grid-queries.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/concatenate-the-name-and-the-profession/[2504. Concatenate the Name and the Profession^] //|{source_base_url}/_2504_ConcatenateTheNameAndTheProfession.java[Java] //|{doc_base_url}/2504-concatenate-the-name-and-the-profession.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/bitwise-or-of-all-subsequence-sums/[2505. Bitwise OR of All Subsequence Sums^] //|{source_base_url}/_2505_BitwiseOrOfAllSubsequenceSums.java[Java] //|{doc_base_url}/2505-bitwise-or-of-all-subsequence-sums.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-pairs-of-similar-strings/[2506. Count Pairs Of Similar Strings^] //|{source_base_url}/_2506_CountPairsOfSimilarStrings.java[Java] //|{doc_base_url}/2506-count-pairs-of-similar-strings.adoc[题解] //|Easy //|

|{counter:codes} |{leetcode_base_url}/smallest-value-after-replacing-with-sum-of-prime-factors/[2507. Smallest Value After Replacing With Sum of Prime Factors^] |{source_base_url}/_2507_SmallestValueAfterReplacingWithSumOfPrimeFactors.java[Java] |{doc_base_url}/2507-smallest-value-after-replacing-with-sum-of-prime-factors.adoc[题解] |Medium |

//|{counter:codes} //|{leetcode_base_url}/add-edges-to-make-degrees-of-all-nodes-even/[2508. Add Edges to Make Degrees of All Nodes Even^] //|{source_base_url}/_2508_AddEdgesToMakeDegreesOfAllNodesEven.java[Java] //|{doc_base_url}/2508-add-edges-to-make-degrees-of-all-nodes-even.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/cycle-length-queries-in-a-tree/[2509. Cycle Length Queries in a Tree^] //|{source_base_url}/_2509_CycleLengthQueriesInATree.java[Java] //|{doc_base_url}/2509-cycle-length-queries-in-a-tree.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/check-if-there-is-a-path-with-equal-number-of-0s-and-1s/[2510. Check if There is a Path With Equal Number of 0's And 1's^] //|{source_base_url}/_2510_CheckIfThereIsAPathWithEqualNumberOf0SAnd1S.java[Java] //|{doc_base_url}/2510-check-if-there-is-a-path-with-equal-number-of-0s-and-1s.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-enemy-forts-that-can-be-captured/[2511. Maximum Enemy Forts That Can Be Captured^] //|{source_base_url}/_2511_MaximumEnemyFortsThatCanBeCaptured.java[Java] //|{doc_base_url}/2511-maximum-enemy-forts-that-can-be-captured.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/reward-top-k-students/[2512. Reward Top K Students^] //|{source_base_url}/_2512_RewardTopKStudents.java[Java] //|{doc_base_url}/2512-reward-top-k-students.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimize-the-maximum-of-two-arrays/[2513. Minimize the Maximum of Two Arrays^] //|{source_base_url}/_2513_MinimizeTheMaximumOfTwoArrays.java[Java] //|{doc_base_url}/2513-minimize-the-maximum-of-two-arrays.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-anagrams/[2514. Count Anagrams^] //|{source_base_url}/_2514_CountAnagrams.java[Java] //|{doc_base_url}/2514-count-anagrams.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/shortest-distance-to-target-string-in-a-circular-array/[2515. Shortest Distance to Target String in a Circular Array^] //|{source_base_url}/_2515_ShortestDistanceToTargetStringInACircularArray.java[Java] //|{doc_base_url}/2515-shortest-distance-to-target-string-in-a-circular-array.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/take-k-of-each-character-from-left-and-right/[2516. Take K of Each Character From Left and Right^] //|{source_base_url}/_2516_TakeKOfEachCharacterFromLeftAndRight.java[Java] //|{doc_base_url}/2516-take-k-of-each-character-from-left-and-right.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-tastiness-of-candy-basket/[2517. Maximum Tastiness of Candy Basket^] //|{source_base_url}/_2517_MaximumTastinessOfCandyBasket.java[Java] //|{doc_base_url}/2517-maximum-tastiness-of-candy-basket.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/number-of-great-partitions/[2518. Number of Great Partitions^] //|{source_base_url}/_2518_NumberOfGreatPartitions.java[Java] //|{doc_base_url}/2518-number-of-great-partitions.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/count-the-number-of-k-big-indices/[2519. Count the Number of K-Big Indices^] //|{source_base_url}/_2519_CountTheNumberOfKBigIndices.java[Java] //|{doc_base_url}/2519-count-the-number-of-k-big-indices.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/count-the-digits-that-divide-a-number/[2520. Count the Digits That Divide a Number^] //|{source_base_url}/_2520_CountTheDigitsThatDivideANumber.java[Java] //|{doc_base_url}/2520-count-the-digits-that-divide-a-number.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/distinct-prime-factors-of-product-of-array/[2521. Distinct Prime Factors of Product of Array^] //|{source_base_url}/_2521_DistinctPrimeFactorsOfProductOfArray.java[Java] //|{doc_base_url}/2521-distinct-prime-factors-of-product-of-array.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/partition-string-into-substrings-with-values-at-most-k/[2522. Partition String Into Substrings With Values at Most K^] //|{source_base_url}/_2522_PartitionStringIntoSubstringsWithValuesAtMostK.java[Java] //|{doc_base_url}/2522-partition-string-into-substrings-with-values-at-most-k.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/closest-prime-numbers-in-range/[2523. Closest Prime Numbers in Range^] //|{source_base_url}/_2523_ClosestPrimeNumbersInRange.java[Java] //|{doc_base_url}/2523-closest-prime-numbers-in-range.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-frequency-score-of-a-subarray/[2524. Maximum Frequency Score of a Subarray^] //|{source_base_url}/_2524_MaximumFrequencyScoreOfASubarray.java[Java] //|{doc_base_url}/2524-maximum-frequency-score-of-a-subarray.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/categorize-box-according-to-criteria/[2525. Categorize Box According to Criteria^] //|{source_base_url}/_2525_CategorizeBoxAccordingToCriteria.java[Java] //|{doc_base_url}/2525-categorize-box-according-to-criteria.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/find-consecutive-integers-from-a-data-stream/[2526. Find Consecutive Integers from a Data Stream^] //|{source_base_url}/_2526_FindConsecutiveIntegersFromADataStream.java[Java] //|{doc_base_url}/2526-find-consecutive-integers-from-a-data-stream.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-xor-beauty-of-array/[2527. Find Xor-Beauty of Array^] //|{source_base_url}/_2527_FindXorBeautyOfArray.java[Java] //|{doc_base_url}/2527-find-xor-beauty-of-array.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximize-the-minimum-powered-city/[2528. Maximize the Minimum Powered City^] //|{source_base_url}/_2528_MaximizeTheMinimumPoweredCity.java[Java] //|{doc_base_url}/2528-maximize-the-minimum-powered-city.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/maximum-count-of-positive-integer-and-negative-integer/[2529. Maximum Count of Positive Integer and Negative Integer^] //|{source_base_url}/_2529_MaximumCountOfPositiveIntegerAndNegativeInteger.java[Java] //|{doc_base_url}/2529-maximum-count-of-positive-integer-and-negative-integer.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/maximal-score-after-applying-k-operations/[2530. Maximal Score After Applying K Operations^] //|{source_base_url}/_2530_MaximalScoreAfterApplyingKOperations.java[Java] //|{doc_base_url}/2530-maximal-score-after-applying-k-operations.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/make-number-of-distinct-characters-equal/[2531. Make Number of Distinct Characters Equal^] //|{source_base_url}/_2531_MakeNumberOfDistinctCharactersEqual.java[Java] //|{doc_base_url}/2531-make-number-of-distinct-characters-equal.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/time-to-cross-a-bridge/[2532. Time to Cross a Bridge^] //|{source_base_url}/_2532_TimeToCrossABridge.java[Java] //|{doc_base_url}/2532-time-to-cross-a-bridge.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/number-of-good-binary-strings/[2533. Number of Good Binary Strings^] //|{source_base_url}/_2533_NumberOfGoodBinaryStrings.java[Java] //|{doc_base_url}/2533-number-of-good-binary-strings.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/time-taken-to-cross-the-door/[2534. Time Taken to Cross the Door^] //|{source_base_url}/_2534_TimeTakenToCrossTheDoor.java[Java] //|{doc_base_url}/2534-time-taken-to-cross-the-door.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/difference-between-element-sum-and-digit-sum-of-an-array/[2535. Difference Between Element Sum and Digit Sum of an Array^] //|{source_base_url}/_2535_DifferenceBetweenElementSumAndDigitSumOfAnArray.java[Java] //|{doc_base_url}/2535-difference-between-element-sum-and-digit-sum-of-an-array.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/increment-submatrices-by-one/[2536. Increment Submatrices by One^] //|{source_base_url}/_2536_IncrementSubmatricesByOne.java[Java] //|{doc_base_url}/2536-increment-submatrices-by-one.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-the-number-of-good-subarrays/[2537. Count the Number of Good Subarrays^] //|{source_base_url}/_2537_CountTheNumberOfGoodSubarrays.java[Java] //|{doc_base_url}/2537-count-the-number-of-good-subarrays.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/difference-between-maximum-and-minimum-price-sum/[2538. Difference Between Maximum and Minimum Price Sum^] //|{source_base_url}/_2538_DifferenceBetweenMaximumAndMinimumPriceSum.java[Java] //|{doc_base_url}/2538-difference-between-maximum-and-minimum-price-sum.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/count-the-number-of-good-subsequences/[2539. Count the Number of Good Subsequences^] //|{source_base_url}/_2539_CountTheNumberOfGoodSubsequences.java[Java] //|{doc_base_url}/2539-count-the-number-of-good-subsequences.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-common-value/[2540. Minimum Common Value^] //|{source_base_url}/_2540_MinimumCommonValue.java[Java] //|{doc_base_url}/2540-minimum-common-value.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/minimum-operations-to-make-array-equal-ii/[2541. Minimum Operations to Make Array Equal II^] //|{source_base_url}/_2541_MinimumOperationsToMakeArrayEqualIi.java[Java] //|{doc_base_url}/2541-minimum-operations-to-make-array-equal-ii.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-subsequence-score/[2542. Maximum Subsequence Score^] //|{source_base_url}/_2542_MaximumSubsequenceScore.java[Java] //|{doc_base_url}/2542-maximum-subsequence-score.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/check-if-point-is-reachable/[2543. Check if Point Is Reachable^] //|{source_base_url}/_2543_CheckIfPointIsReachable.java[Java] //|{doc_base_url}/2543-check-if-point-is-reachable.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/alternating-digit-sum/[2544. Alternating Digit Sum^] //|{source_base_url}/_2544_AlternatingDigitSum.java[Java] //|{doc_base_url}/2544-alternating-digit-sum.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/sort-the-students-by-their-kth-score/[2545. Sort the Students by Their Kth Score^] //|{source_base_url}/_2545_SortTheStudentsByTheirKthScore.java[Java] //|{doc_base_url}/2545-sort-the-students-by-their-kth-score.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/apply-bitwise-operations-to-make-strings-equal/[2546. Apply Bitwise Operations to Make Strings Equal^] //|{source_base_url}/_2546_ApplyBitwiseOperationsToMakeStringsEqual.java[Java] //|{doc_base_url}/2546-apply-bitwise-operations-to-make-strings-equal.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-cost-to-split-an-array/[2547. Minimum Cost to Split an Array^] //|{source_base_url}/_2547_MinimumCostToSplitAnArray.java[Java] //|{doc_base_url}/2547-minimum-cost-to-split-an-array.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/maximum-price-to-fill-a-bag/[2548. Maximum Price to Fill a Bag^] //|{source_base_url}/_2548_MaximumPriceToFillABag.java[Java] //|{doc_base_url}/2548-maximum-price-to-fill-a-bag.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-distinct-numbers-on-board/[2549. Count Distinct Numbers on Board^] //|{source_base_url}/_2549_CountDistinctNumbersOnBoard.java[Java] //|{doc_base_url}/2549-count-distinct-numbers-on-board.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/count-collisions-of-monkeys-on-a-polygon/[2550. Count Collisions of Monkeys on a Polygon^] //|{source_base_url}/_2550_CountCollisionsOfMonkeysOnAPolygon.java[Java] //|{doc_base_url}/2550-count-collisions-of-monkeys-on-a-polygon.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/put-marbles-in-bags/[2551. Put Marbles in Bags^] //|{source_base_url}/_2551_PutMarblesInBags.java[Java] //|{doc_base_url}/2551-put-marbles-in-bags.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/count-increasing-quadruplets/[2552. Count Increasing Quadruplets^] //|{source_base_url}/_2552_CountIncreasingQuadruplets.java[Java] //|{doc_base_url}/2552-count-increasing-quadruplets.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/separate-the-digits-in-an-array/[2553. Separate the Digits in an Array^] //|{source_base_url}/_2553_SeparateTheDigitsInAnArray.java[Java] //|{doc_base_url}/2553-separate-the-digits-in-an-array.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/maximum-number-of-integers-to-choose-from-a-range-i/[2554. Maximum Number of Integers to Choose From a Range I^] //|{source_base_url}/_2554_MaximumNumberOfIntegersToChooseFromARangeI.java[Java] //|{doc_base_url}/2554-maximum-number-of-integers-to-choose-from-a-range-i.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximize-win-from-two-segments/[2555. Maximize Win From Two Segments^] //|{source_base_url}/_2555_MaximizeWinFromTwoSegments.java[Java] //|{doc_base_url}/2555-maximize-win-from-two-segments.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/disconnect-path-in-a-binary-matrix-by-at-most-one-flip/[2556. Disconnect Path in a Binary Matrix by at Most One Flip^] //|{source_base_url}/_2556_DisconnectPathInABinaryMatrixByAtMostOneFlip.java[Java] //|{doc_base_url}/2556-disconnect-path-in-a-binary-matrix-by-at-most-one-flip.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-number-of-integers-to-choose-from-a-range-ii/[2557. Maximum Number of Integers to Choose From a Range II^] //|{source_base_url}/_2557_MaximumNumberOfIntegersToChooseFromARangeIi.java[Java] //|{doc_base_url}/2557-maximum-number-of-integers-to-choose-from-a-range-ii.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/take-gifts-from-the-richest-pile/[2558. Take Gifts From the Richest Pile^] //|{source_base_url}/_2558_TakeGiftsFromTheRichestPile.java[Java] //|{doc_base_url}/2558-take-gifts-from-the-richest-pile.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/count-vowel-strings-in-ranges/[2559. Count Vowel Strings in Ranges^] //|{source_base_url}/_2559_CountVowelStringsInRanges.java[Java] //|{doc_base_url}/2559-count-vowel-strings-in-ranges.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/house-robber-iv/[2560. House Robber IV^] //|{source_base_url}/_2560_HouseRobberIv.java[Java] //|{doc_base_url}/2560-house-robber-iv.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/rearranging-fruits/[2561. Rearranging Fruits^] //|{source_base_url}/_2561_RearrangingFruits.java[Java] //|{doc_base_url}/2561-rearranging-fruits.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/find-the-array-concatenation-value/[2562. Find the Array Concatenation Value^] //|{source_base_url}/_2562_FindTheArrayConcatenationValue.java[Java] //|{doc_base_url}/2562-find-the-array-concatenation-value.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/count-the-number-of-fair-pairs/[2563. Count the Number of Fair Pairs^] //|{source_base_url}/_2563_CountTheNumberOfFairPairs.java[Java] //|{doc_base_url}/2563-count-the-number-of-fair-pairs.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/substring-xor-queries/[2564. Substring XOR Queries^] //|{source_base_url}/_2564_SubstringXorQueries.java[Java] //|{doc_base_url}/2564-substring-xor-queries.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/subsequence-with-the-minimum-score/[2565. Subsequence With the Minimum Score^] //|{source_base_url}/_2565_SubsequenceWithTheMinimumScore.java[Java] //|{doc_base_url}/2565-subsequence-with-the-minimum-score.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/maximum-difference-by-remapping-a-digit/[2566. Maximum Difference by Remapping a Digit^] //|{source_base_url}/_2566_MaximumDifferenceByRemappingADigit.java[Java] //|{doc_base_url}/2566-maximum-difference-by-remapping-a-digit.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/minimum-score-by-changing-two-elements/[2567. Minimum Score by Changing Two Elements^] //|{source_base_url}/_2567_MinimumScoreByChangingTwoElements.java[Java] //|{doc_base_url}/2567-minimum-score-by-changing-two-elements.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-impossible-or/[2568. Minimum Impossible OR^] //|{source_base_url}/_2568_MinimumImpossibleOr.java[Java] //|{doc_base_url}/2568-minimum-impossible-or.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/handling-sum-queries-after-update/[2569. Handling Sum Queries After Update^] //|{source_base_url}/_2569_HandlingSumQueriesAfterUpdate.java[Java] //|{doc_base_url}/2569-handling-sum-queries-after-update.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/merge-two-2d-arrays-by-summing-values/[2570. Merge Two 2D Arrays by Summing Values^] //|{source_base_url}/_2570_MergeTwo2DArraysBySummingValues.java[Java] //|{doc_base_url}/2570-merge-two-2d-arrays-by-summing-values.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/minimum-operations-to-reduce-an-integer-to-0/[2571. Minimum Operations to Reduce an Integer to 0^] //|{source_base_url}/_2571_MinimumOperationsToReduceAnIntegerTo0.java[Java] //|{doc_base_url}/2571-minimum-operations-to-reduce-an-integer-to-0.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-the-number-of-square-free-subsets/[2572. Count the Number of Square-Free Subsets^] //|{source_base_url}/_2572_CountTheNumberOfSquareFreeSubsets.java[Java] //|{doc_base_url}/2572-count-the-number-of-square-free-subsets.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-the-string-with-lcp/[2573. Find the String with LCP^] //|{source_base_url}/_2573_FindTheStringWithLcp.java[Java] //|{doc_base_url}/2573-find-the-string-with-lcp.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/left-and-right-sum-differences/[2574. Left and Right Sum Differences^] //|{source_base_url}/_2574_LeftAndRightSumDifferences.java[Java] //|{doc_base_url}/2574-left-and-right-sum-differences.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/find-the-divisibility-array-of-a-string/[2575. Find the Divisibility Array of a String^] //|{source_base_url}/_2575_FindTheDivisibilityArrayOfAString.java[Java] //|{doc_base_url}/2575-find-the-divisibility-array-of-a-string.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-the-maximum-number-of-marked-indices/[2576. Find the Maximum Number of Marked Indices^] //|{source_base_url}/_2576_FindTheMaximumNumberOfMarkedIndices.java[Java] //|{doc_base_url}/2576-find-the-maximum-number-of-marked-indices.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-time-to-visit-a-cell-in-a-grid/[2577. Minimum Time to Visit a Cell In a Grid^] //|{source_base_url}/_2577_MinimumTimeToVisitACellInAGrid.java[Java] //|{doc_base_url}/2577-minimum-time-to-visit-a-cell-in-a-grid.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/split-with-minimum-sum/[2578. Split With Minimum Sum^] //|{source_base_url}/_2578_SplitWithMinimumSum.java[Java] //|{doc_base_url}/2578-split-with-minimum-sum.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/count-total-number-of-colored-cells/[2579. Count Total Number of Colored Cells^] //|{source_base_url}/_2579_CountTotalNumberOfColoredCells.java[Java] //|{doc_base_url}/2579-count-total-number-of-colored-cells.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-ways-to-group-overlapping-ranges/[2580. Count Ways to Group Overlapping Ranges^] //|{source_base_url}/_2580_CountWaysToGroupOverlappingRanges.java[Java] //|{doc_base_url}/2580-count-ways-to-group-overlapping-ranges.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-number-of-possible-root-nodes/[2581. Count Number of Possible Root Nodes^] //|{source_base_url}/_2581_CountNumberOfPossibleRootNodes.java[Java] //|{doc_base_url}/2581-count-number-of-possible-root-nodes.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/pass-the-pillow/[2582. Pass the Pillow^] //|{source_base_url}/_2582_PassThePillow.java[Java] //|{doc_base_url}/2582-pass-the-pillow.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/kth-largest-sum-in-a-binary-tree/[2583. Kth Largest Sum in a Binary Tree^] //|{source_base_url}/_2583_KthLargestSumInABinaryTree.java[Java] //|{doc_base_url}/2583-kth-largest-sum-in-a-binary-tree.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/split-the-array-to-make-coprime-products/[2584. Split the Array to Make Coprime Products^] //|{source_base_url}/_2584_SplitTheArrayToMakeCoprimeProducts.java[Java] //|{doc_base_url}/2584-split-the-array-to-make-coprime-products.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/number-of-ways-to-earn-points/[2585. Number of Ways to Earn Points^] //|{source_base_url}/_2585_NumberOfWaysToEarnPoints.java[Java] //|{doc_base_url}/2585-number-of-ways-to-earn-points.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/count-the-number-of-vowel-strings-in-range/[2586. Count the Number of Vowel Strings in Range^] //|{source_base_url}/_2586_CountTheNumberOfVowelStringsInRange.java[Java] //|{doc_base_url}/2586-count-the-number-of-vowel-strings-in-range.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/rearrange-array-to-maximize-prefix-score/[2587. Rearrange Array to Maximize Prefix Score^] //|{source_base_url}/_2587_RearrangeArrayToMaximizePrefixScore.java[Java] //|{doc_base_url}/2587-rearrange-array-to-maximize-prefix-score.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-the-number-of-beautiful-subarrays/[2588. Count the Number of Beautiful Subarrays^] //|{source_base_url}/_2588_CountTheNumberOfBeautifulSubarrays.java[Java] //|{doc_base_url}/2588-count-the-number-of-beautiful-subarrays.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-time-to-complete-all-tasks/[2589. Minimum Time to Complete All Tasks^] //|{source_base_url}/_2589_MinimumTimeToCompleteAllTasks.java[Java] //|{doc_base_url}/2589-minimum-time-to-complete-all-tasks.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/design-a-todo-list/[2590. Design a Todo List^] //|{source_base_url}/_2590_DesignATodoList.java[Java] //|{doc_base_url}/2590-design-a-todo-list.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/distribute-money-to-maximum-children/[2591. Distribute Money to Maximum Children^] //|{source_base_url}/_2591_DistributeMoneyToMaximumChildren.java[Java] //|{doc_base_url}/2591-distribute-money-to-maximum-children.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/maximize-greatness-of-an-array/[2592. Maximize Greatness of an Array^] //|{source_base_url}/_2592_MaximizeGreatnessOfAnArray.java[Java] //|{doc_base_url}/2592-maximize-greatness-of-an-array.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-score-of-an-array-after-marking-all-elements/[2593. Find Score of an Array After Marking All Elements^] //|{source_base_url}/_2593_FindScoreOfAnArrayAfterMarkingAllElements.java[Java] //|{doc_base_url}/2593-find-score-of-an-array-after-marking-all-elements.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-time-to-repair-cars/[2594. Minimum Time to Repair Cars^] //|{source_base_url}/_2594_MinimumTimeToRepairCars.java[Java] //|{doc_base_url}/2594-minimum-time-to-repair-cars.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/number-of-even-and-odd-bits/[2595. Number of Even and Odd Bits^] //|{source_base_url}/_2595_NumberOfEvenAndOddBits.java[Java] //|{doc_base_url}/2595-number-of-even-and-odd-bits.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/check-knight-tour-configuration/[2596. Check Knight Tour Configuration^] //|{source_base_url}/_2596_CheckKnightTourConfiguration.java[Java] //|{doc_base_url}/2596-check-knight-tour-configuration.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/the-number-of-beautiful-subsets/[2597. The Number of Beautiful Subsets^] //|{source_base_url}/_2597_TheNumberOfBeautifulSubsets.java[Java] //|{doc_base_url}/2597-the-number-of-beautiful-subsets.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/smallest-missing-non-negative-integer-after-operations/[2598. Smallest Missing Non-negative Integer After Operations^] //|{source_base_url}/_2598_SmallestMissingNonNegativeIntegerAfterOperations.java[Java] //|{doc_base_url}/2598-smallest-missing-non-negative-integer-after-operations.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/make-the-prefix-sum-non-negative/[2599. Make the Prefix Sum Non-negative^] //|{source_base_url}/_2599_MakeThePrefixSumNonNegative.java[Java] //|{doc_base_url}/2599-make-the-prefix-sum-non-negative.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/k-items-with-the-maximum-sum/[2600. K Items With the Maximum Sum^] //|{source_base_url}/_2600_KItemsWithTheMaximumSum.java[Java] //|{doc_base_url}/2600-k-items-with-the-maximum-sum.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/prime-subtraction-operation/[2601. Prime Subtraction Operation^] //|{source_base_url}/_2601_PrimeSubtractionOperation.java[Java] //|{doc_base_url}/2601-prime-subtraction-operation.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-operations-to-make-all-array-elements-equal/[2602. Minimum Operations to Make All Array Elements Equal^] //|{source_base_url}/_2602_MinimumOperationsToMakeAllArrayElementsEqual.java[Java] //|{doc_base_url}/2602-minimum-operations-to-make-all-array-elements-equal.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/collect-coins-in-a-tree/[2603. Collect Coins in a Tree^] //|{source_base_url}/_2603_CollectCoinsInATree.java[Java] //|{doc_base_url}/2603-collect-coins-in-a-tree.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/minimum-time-to-eat-all-grains/[2604. Minimum Time to Eat All Grains^] //|{source_base_url}/_2604_MinimumTimeToEatAllGrains.java[Java] //|{doc_base_url}/2604-minimum-time-to-eat-all-grains.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/form-smallest-number-from-two-digit-arrays/[2605. Form Smallest Number From Two Digit Arrays^] //|{source_base_url}/_2605_FormSmallestNumberFromTwoDigitArrays.java[Java] //|{doc_base_url}/2605-form-smallest-number-from-two-digit-arrays.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/find-the-substring-with-maximum-cost/[2606. Find the Substring With Maximum Cost^] //|{source_base_url}/_2606_FindTheSubstringWithMaximumCost.java[Java] //|{doc_base_url}/2606-find-the-substring-with-maximum-cost.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/make-k-subarray-sums-equal/[2607. Make K-Subarray Sums Equal^] //|{source_base_url}/_2607_MakeKSubarraySumsEqual.java[Java] //|{doc_base_url}/2607-make-k-subarray-sums-equal.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/shortest-cycle-in-a-graph/[2608. Shortest Cycle in a Graph^] //|{source_base_url}/_2608_ShortestCycleInAGraph.java[Java] //|{doc_base_url}/2608-shortest-cycle-in-a-graph.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/find-the-longest-balanced-substring-of-a-binary-string/[2609. Find the Longest Balanced Substring of a Binary String^] //|{source_base_url}/_2609_FindTheLongestBalancedSubstringOfABinaryString.java[Java] //|{doc_base_url}/2609-find-the-longest-balanced-substring-of-a-binary-string.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/convert-an-array-into-a-2d-array-with-conditions/[2610. Convert an Array Into a 2D Array With Conditions^] //|{source_base_url}/_2610_ConvertAnArrayIntoA2DArrayWithConditions.java[Java] //|{doc_base_url}/2610-convert-an-array-into-a-2d-array-with-conditions.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/mice-and-cheese/[2611. Mice and Cheese^] //|{source_base_url}/_2611_MiceAndCheese.java[Java] //|{doc_base_url}/2611-mice-and-cheese.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-reverse-operations/[2612. Minimum Reverse Operations^] //|{source_base_url}/_2612_MinimumReverseOperations.java[Java] //|{doc_base_url}/2612-minimum-reverse-operations.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/beautiful-pairs/[2613. Beautiful Pairs^] //|{source_base_url}/_2613_BeautifulPairs.java[Java] //|{doc_base_url}/2613-beautiful-pairs.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/prime-in-diagonal/[2614. Prime In Diagonal^] //|{source_base_url}/_2614_PrimeInDiagonal.java[Java] //|{doc_base_url}/2614-prime-in-diagonal.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/sum-of-distances/[2615. Sum of Distances^] //|{source_base_url}/_2615_SumOfDistances.java[Java] //|{doc_base_url}/2615-sum-of-distances.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimize-the-maximum-difference-of-pairs/[2616. Minimize the Maximum Difference of Pairs^] //|{source_base_url}/_2616_MinimizeTheMaximumDifferenceOfPairs.java[Java] //|{doc_base_url}/2616-minimize-the-maximum-difference-of-pairs.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-number-of-visited-cells-in-a-grid/[2617. Minimum Number of Visited Cells in a Grid^] //|{source_base_url}/_2617_MinimumNumberOfVisitedCellsInAGrid.java[Java] //|{doc_base_url}/2617-minimum-number-of-visited-cells-in-a-grid.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/check-if-object-instance-of-class/[2618. Check if Object Instance of Class^] //|{source_base_url}/_2618_CheckIfObjectInstanceOfClass.java[Java] //|{doc_base_url}/2618-check-if-object-instance-of-class.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/array-prototype-last/[2619. Array Prototype Last^] //|{source_base_url}/_2619_ArrayPrototypeLast.java[Java] //|{doc_base_url}/2619-array-prototype-last.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/counter/[2620. Counter^] //|{source_base_url}/_2620_Counter.java[Java] //|{doc_base_url}/2620-counter.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/sleep/[2621. Sleep^] //|{source_base_url}/_2621_Sleep.java[Java] //|{doc_base_url}/2621-sleep.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/cache-with-time-limit/[2622. Cache With Time Limit^] //|{source_base_url}/_2622_CacheWithTimeLimit.java[Java] //|{doc_base_url}/2622-cache-with-time-limit.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/memoize/[2623. Memoize^] //|{source_base_url}/_2623_Memoize.java[Java] //|{doc_base_url}/2623-memoize.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/snail-traversal/[2624. Snail Traversal^] //|{source_base_url}/_2624_SnailTraversal.java[Java] //|{doc_base_url}/2624-snail-traversal.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/flatten-deeply-nested-array/[2625. Flatten Deeply Nested Array^] //|{source_base_url}/_2625_FlattenDeeplyNestedArray.java[Java] //|{doc_base_url}/2625-flatten-deeply-nested-array.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/array-reduce-transformation/[2626. Array Reduce Transformation^] //|{source_base_url}/_2626_ArrayReduceTransformation.java[Java] //|{doc_base_url}/2626-array-reduce-transformation.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/debounce/[2627. Debounce^] //|{source_base_url}/_2627_Debounce.java[Java] //|{doc_base_url}/2627-debounce.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/json-deep-equal/[2628. JSON Deep Equal^] //|{source_base_url}/_2628_JsonDeepEqual.java[Java] //|{doc_base_url}/2628-json-deep-equal.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/function-composition/[2629. Function Composition^] //|{source_base_url}/_2629_FunctionComposition.java[Java] //|{doc_base_url}/2629-function-composition.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/memoize-ii/[2630. Memoize II^] //|{source_base_url}/_2630_MemoizeIi.java[Java] //|{doc_base_url}/2630-memoize-ii.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/group-by/[2631. Group By^] //|{source_base_url}/_2631_GroupBy.java[Java] //|{doc_base_url}/2631-group-by.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/curry/[2632. Curry^] //|{source_base_url}/_2632_Curry.java[Java] //|{doc_base_url}/2632-curry.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/convert-object-to-json-string/[2633. Convert Object to JSON String^] //|{source_base_url}/_2633_ConvertObjectToJsonString.java[Java] //|{doc_base_url}/2633-convert-object-to-json-string.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/filter-elements-from-array/[2634. Filter Elements from Array^] //|{source_base_url}/_2634_FilterElementsFromArray.java[Java] //|{doc_base_url}/2634-filter-elements-from-array.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/apply-transform-over-each-element-in-array/[2635. Apply Transform Over Each Element in Array^] //|{source_base_url}/_2635_ApplyTransformOverEachElementInArray.java[Java] //|{doc_base_url}/2635-apply-transform-over-each-element-in-array.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/promise-pool/[2636. Promise Pool^] //|{source_base_url}/_2636_PromisePool.java[Java] //|{doc_base_url}/2636-promise-pool.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/promise-time-limit/[2637. Promise Time Limit^] //|{source_base_url}/_2637_PromiseTimeLimit.java[Java] //|{doc_base_url}/2637-promise-time-limit.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-the-number-of-k-free-subsets/[2638. Count the Number of K-Free Subsets^] //|{source_base_url}/_2638_CountTheNumberOfKFreeSubsets.java[Java] //|{doc_base_url}/2638-count-the-number-of-k-free-subsets.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-the-width-of-columns-of-a-grid/[2639. Find the Width of Columns of a Grid^] //|{source_base_url}/_2639_FindTheWidthOfColumnsOfAGrid.java[Java] //|{doc_base_url}/2639-find-the-width-of-columns-of-a-grid.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/find-the-score-of-all-prefixes-of-an-array/[2640. Find the Score of All Prefixes of an Array^] //|{source_base_url}/_2640_FindTheScoreOfAllPrefixesOfAnArray.java[Java] //|{doc_base_url}/2640-find-the-score-of-all-prefixes-of-an-array.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/cousins-in-binary-tree-ii/[2641. Cousins in Binary Tree II^] //|{source_base_url}/_2641_CousinsInBinaryTreeIi.java[Java] //|{doc_base_url}/2641-cousins-in-binary-tree-ii.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/design-graph-with-shortest-path-calculator/[2642. Design Graph With Shortest Path Calculator^] //|{source_base_url}/_2642_DesignGraphWithShortestPathCalculator.java[Java] //|{doc_base_url}/2642-design-graph-with-shortest-path-calculator.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/row-with-maximum-ones/[2643. Row With Maximum Ones^] //|{source_base_url}/_2643_RowWithMaximumOnes.java[Java] //|{doc_base_url}/2643-row-with-maximum-ones.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/find-the-maximum-divisibility-score/[2644. Find the Maximum Divisibility Score^] //|{source_base_url}/_2644_FindTheMaximumDivisibilityScore.java[Java] //|{doc_base_url}/2644-find-the-maximum-divisibility-score.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/minimum-additions-to-make-valid-string/[2645. Minimum Additions to Make Valid String^] //|{source_base_url}/_2645_MinimumAdditionsToMakeValidString.java[Java] //|{doc_base_url}/2645-minimum-additions-to-make-valid-string.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimize-the-total-price-of-the-trips/[2646. Minimize the Total Price of the Trips^] //|{source_base_url}/_2646_MinimizeTheTotalPriceOfTheTrips.java[Java] //|{doc_base_url}/2646-minimize-the-total-price-of-the-trips.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/color-the-triangle-red/[2647. Color the Triangle Red^] //|{source_base_url}/_2647_ColorTheTriangleRed.java[Java] //|{doc_base_url}/2647-color-the-triangle-red.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/generate-fibonacci-sequence/[2648. Generate Fibonacci Sequence^] //|{source_base_url}/_2648_GenerateFibonacciSequence.java[Java] //|{doc_base_url}/2648-generate-fibonacci-sequence.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/nested-array-generator/[2649. Nested Array Generator^] //|{source_base_url}/_2649_NestedArrayGenerator.java[Java] //|{doc_base_url}/2649-nested-array-generator.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/design-cancellable-function/[2650. Design Cancellable Function^] //|{source_base_url}/_2650_DesignCancellableFunction.java[Java] //|{doc_base_url}/2650-design-cancellable-function.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/calculate-delayed-arrival-time/[2651. Calculate Delayed Arrival Time^] //|{source_base_url}/_2651_CalculateDelayedArrivalTime.java[Java] //|{doc_base_url}/2651-calculate-delayed-arrival-time.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/sum-multiples/[2652. Sum Multiples^] //|{source_base_url}/_2652_SumMultiples.java[Java] //|{doc_base_url}/2652-sum-multiples.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/sliding-subarray-beauty/[2653. Sliding Subarray Beauty^] //|{source_base_url}/_2653_SlidingSubarrayBeauty.java[Java] //|{doc_base_url}/2653-sliding-subarray-beauty.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-number-of-operations-to-make-all-array-elements-equal-to-1/[2654. Minimum Number of Operations to Make All Array Elements Equal to 1^] //|{source_base_url}/_2654_MinimumNumberOfOperationsToMakeAllArrayElementsEqualTo1.java[Java] //|{doc_base_url}/2654-minimum-number-of-operations-to-make-all-array-elements-equal-to-1.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-maximal-uncovered-ranges/[2655. Find Maximal Uncovered Ranges^] //|{source_base_url}/_2655_FindMaximalUncoveredRanges.java[Java] //|{doc_base_url}/2655-find-maximal-uncovered-ranges.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-sum-with-exactly-k-elements/[2656. Maximum Sum With Exactly K Elements ^] //|{source_base_url}/_2656_MaximumSumWithExactlyKElements.java[Java] //|{doc_base_url}/2656-maximum-sum-with-exactly-k-elements.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/find-the-prefix-common-array-of-two-arrays/[2657. Find the Prefix Common Array of Two Arrays^] //|{source_base_url}/_2657_FindThePrefixCommonArrayOfTwoArrays.java[Java] //|{doc_base_url}/2657-find-the-prefix-common-array-of-two-arrays.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-number-of-fish-in-a-grid/[2658. Maximum Number of Fish in a Grid^] //|{source_base_url}/_2658_MaximumNumberOfFishInAGrid.java[Java] //|{doc_base_url}/2658-maximum-number-of-fish-in-a-grid.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/make-array-empty/[2659. Make Array Empty^] //|{source_base_url}/_2659_MakeArrayEmpty.java[Java] //|{doc_base_url}/2659-make-array-empty.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/determine-the-winner-of-a-bowling-game/[2660. Determine the Winner of a Bowling Game^] //|{source_base_url}/_2660_DetermineTheWinnerOfABowlingGame.java[Java] //|{doc_base_url}/2660-determine-the-winner-of-a-bowling-game.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/first-completely-painted-row-or-column/[2661. First Completely Painted Row or Column^] //|{source_base_url}/_2661_FirstCompletelyPaintedRowOrColumn.java[Java] //|{doc_base_url}/2661-first-completely-painted-row-or-column.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-cost-of-a-path-with-special-roads/[2662. Minimum Cost of a Path With Special Roads^] //|{source_base_url}/_2662_MinimumCostOfAPathWithSpecialRoads.java[Java] //|{doc_base_url}/2662-minimum-cost-of-a-path-with-special-roads.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/lexicographically-smallest-beautiful-string/[2663. Lexicographically Smallest Beautiful String^] //|{source_base_url}/_2663_LexicographicallySmallestBeautifulString.java[Java] //|{doc_base_url}/2663-lexicographically-smallest-beautiful-string.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/the-knights-tour/[2664. The Knight’s Tour^] //|{source_base_url}/_2664_TheKnightSTour.java[Java] //|{doc_base_url}/2664-the-knights-tour.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/counter-ii/[2665. Counter II^] //|{source_base_url}/_2665_CounterIi.java[Java] //|{doc_base_url}/2665-counter-ii.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/allow-one-function-call/[2666. Allow One Function Call^] //|{source_base_url}/_2666_AllowOneFunctionCall.java[Java] //|{doc_base_url}/2666-allow-one-function-call.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/create-hello-world-function/[2667. Create Hello World Function^] //|{source_base_url}/_2667_CreateHelloWorldFunction.java[Java] //|{doc_base_url}/2667-create-hello-world-function.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/find-latest-salaries/[2668. Find Latest Salaries^] //|{source_base_url}/_2668_FindLatestSalaries.java[Java] //|{doc_base_url}/2668-find-latest-salaries.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/count-artist-occurrences-on-spotify-ranking-list/[2669. Count Artist Occurrences On Spotify Ranking List^] //|{source_base_url}/_2669_CountArtistOccurrencesOnSpotifyRankingList.java[Java] //|{doc_base_url}/2669-count-artist-occurrences-on-spotify-ranking-list.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/find-the-distinct-difference-array/[2670. Find the Distinct Difference Array^] //|{source_base_url}/_2670_FindTheDistinctDifferenceArray.java[Java] //|{doc_base_url}/2670-find-the-distinct-difference-array.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/frequency-tracker/[2671. Frequency Tracker^] //|{source_base_url}/_2671_FrequencyTracker.java[Java] //|{doc_base_url}/2671-frequency-tracker.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/number-of-adjacent-elements-with-the-same-color/[2672. Number of Adjacent Elements With the Same Color^] //|{source_base_url}/_2672_NumberOfAdjacentElementsWithTheSameColor.java[Java] //|{doc_base_url}/2672-number-of-adjacent-elements-with-the-same-color.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/make-costs-of-paths-equal-in-a-binary-tree/[2673. Make Costs of Paths Equal in a Binary Tree^] //|{source_base_url}/_2673_MakeCostsOfPathsEqualInABinaryTree.java[Java] //|{doc_base_url}/2673-make-costs-of-paths-equal-in-a-binary-tree.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/split-a-circular-linked-list/[2674. Split a Circular Linked List^] //|{source_base_url}/_2674_SplitACircularLinkedList.java[Java] //|{doc_base_url}/2674-split-a-circular-linked-list.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/array-of-objects-to-matrix/[2675. Array of Objects to Matrix^] //|{source_base_url}/_2675_ArrayOfObjectsToMatrix.java[Java] //|{doc_base_url}/2675-array-of-objects-to-matrix.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/throttle/[2676. Throttle^] //|{source_base_url}/_2676_Throttle.java[Java] //|{doc_base_url}/2676-throttle.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/chunk-array/[2677. Chunk Array^] //|{source_base_url}/_2677_ChunkArray.java[Java] //|{doc_base_url}/2677-chunk-array.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/number-of-senior-citizens/[2678. Number of Senior Citizens^] //|{source_base_url}/_2678_NumberOfSeniorCitizens.java[Java] //|{doc_base_url}/2678-number-of-senior-citizens.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/sum-in-a-matrix/[2679. Sum in a Matrix^] //|{source_base_url}/_2679_SumInAMatrix.java[Java] //|{doc_base_url}/2679-sum-in-a-matrix.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-or/[2680. Maximum OR^] //|{source_base_url}/_2680_MaximumOr.java[Java] //|{doc_base_url}/2680-maximum-or.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/power-of-heroes/[2681. Power of Heroes^] //|{source_base_url}/_2681_PowerOfHeroes.java[Java] //|{doc_base_url}/2681-power-of-heroes.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/find-the-losers-of-the-circular-game/[2682. Find the Losers of the Circular Game^] //|{source_base_url}/_2682_FindTheLosersOfTheCircularGame.java[Java] //|{doc_base_url}/2682-find-the-losers-of-the-circular-game.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/neighboring-bitwise-xor/[2683. Neighboring Bitwise XOR^] //|{source_base_url}/_2683_NeighboringBitwiseXor.java[Java] //|{doc_base_url}/2683-neighboring-bitwise-xor.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-number-of-moves-in-a-grid/[2684. Maximum Number of Moves in a Grid^] //|{source_base_url}/_2684_MaximumNumberOfMovesInAGrid.java[Java] //|{doc_base_url}/2684-maximum-number-of-moves-in-a-grid.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-the-number-of-complete-components/[2685. Count the Number of Complete Components^] //|{source_base_url}/_2685_CountTheNumberOfCompleteComponents.java[Java] //|{doc_base_url}/2685-count-the-number-of-complete-components.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/immediate-food-delivery-iii/[2686. Immediate Food Delivery III^] //|{source_base_url}/_2686_ImmediateFoodDeliveryIii.java[Java] //|{doc_base_url}/2686-immediate-food-delivery-iii.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/bikes-last-time-used/[2687. Bikes Last Time Used ^] //|{source_base_url}/_2687_BikesLastTimeUsed.java[Java] //|{doc_base_url}/2687-bikes-last-time-used.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/find-active-users/[2688. Find Active Users^] //|{source_base_url}/_2688_FindActiveUsers.java[Java] //|{doc_base_url}/2688-find-active-users.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/extract-kth-character-from-the-rope-tree/[2689. Extract Kth Character From The Rope Tree^] //|{source_base_url}/_2689_ExtractKthCharacterFromTheRopeTree.java[Java] //|{doc_base_url}/2689-extract-kth-character-from-the-rope-tree.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/infinite-method-object/[2690. Infinite Method Object^] //|{source_base_url}/_2690_InfiniteMethodObject.java[Java] //|{doc_base_url}/2690-infinite-method-object.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/immutability-helper/[2691. Immutability Helper^] //|{source_base_url}/_2691_ImmutabilityHelper.java[Java] //|{doc_base_url}/2691-immutability-helper.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/make-object-immutable/[2692. Make Object Immutable^] //|{source_base_url}/_2692_MakeObjectImmutable.java[Java] //|{doc_base_url}/2692-make-object-immutable.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/call-function-with-custom-context/[2693. Call Function with Custom Context^] //|{source_base_url}/_2693_CallFunctionWithCustomContext.java[Java] //|{doc_base_url}/2693-call-function-with-custom-context.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/event-emitter/[2694. Event Emitter^] //|{source_base_url}/_2694_EventEmitter.java[Java] //|{doc_base_url}/2694-event-emitter.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/array-wrapper/[2695. Array Wrapper^] //|{source_base_url}/_2695_ArrayWrapper.java[Java] //|{doc_base_url}/2695-array-wrapper.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/minimum-string-length-after-removing-substrings/[2696. Minimum String Length After Removing Substrings^] //|{source_base_url}/_2696_MinimumStringLengthAfterRemovingSubstrings.java[Java] //|{doc_base_url}/2696-minimum-string-length-after-removing-substrings.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/lexicographically-smallest-palindrome/[2697. Lexicographically Smallest Palindrome^] //|{source_base_url}/_2697_LexicographicallySmallestPalindrome.java[Java] //|{doc_base_url}/2697-lexicographically-smallest-palindrome.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/find-the-punishment-number-of-an-integer/[2698. Find the Punishment Number of an Integer^] //|{source_base_url}/_2698_FindThePunishmentNumberOfAnInteger.java[Java] //|{doc_base_url}/2698-find-the-punishment-number-of-an-integer.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/modify-graph-edge-weights/[2699. Modify Graph Edge Weights^] //|{source_base_url}/_2699_ModifyGraphEdgeWeights.java[Java] //|{doc_base_url}/2699-modify-graph-edge-weights.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/differences-between-two-objects/[2700. Differences Between Two Objects^] //|{source_base_url}/_2700_DifferencesBetweenTwoObjects.java[Java] //|{doc_base_url}/2700-differences-between-two-objects.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/consecutive-transactions-with-increasing-amounts/[2701. Consecutive Transactions with Increasing Amounts^] //|{source_base_url}/_2701_ConsecutiveTransactionsWithIncreasingAmounts.java[Java] //|{doc_base_url}/2701-consecutive-transactions-with-increasing-amounts.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/minimum-operations-to-make-numbers-non-positive/[2702. Minimum Operations to Make Numbers Non-positive^] //|{source_base_url}/_2702_MinimumOperationsToMakeNumbersNonPositive.java[Java] //|{doc_base_url}/2702-minimum-operations-to-make-numbers-non-positive.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/return-length-of-arguments-passed/[2703. Return Length of Arguments Passed^] //|{source_base_url}/_2703_ReturnLengthOfArgumentsPassed.java[Java] //|{doc_base_url}/2703-return-length-of-arguments-passed.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/to-be-or-not-to-be/[2704. To Be Or Not To Be^] //|{source_base_url}/_2704_ToBeOrNotToBe.java[Java] //|{doc_base_url}/2704-to-be-or-not-to-be.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/compact-object/[2705. Compact Object^] //|{source_base_url}/_2705_CompactObject.java[Java] //|{doc_base_url}/2705-compact-object.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/buy-two-chocolates/[2706. Buy Two Chocolates^] //|{source_base_url}/_2706_BuyTwoChocolates.java[Java] //|{doc_base_url}/2706-buy-two-chocolates.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/extra-characters-in-a-string/[2707. Extra Characters in a String^] //|{source_base_url}/_2707_ExtraCharactersInAString.java[Java] //|{doc_base_url}/2707-extra-characters-in-a-string.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-strength-of-a-group/[2708. Maximum Strength of a Group^] //|{source_base_url}/_2708_MaximumStrengthOfAGroup.java[Java] //|{doc_base_url}/2708-maximum-strength-of-a-group.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/greatest-common-divisor-traversal/[2709. Greatest Common Divisor Traversal^] //|{source_base_url}/_2709_GreatestCommonDivisorTraversal.java[Java] //|{doc_base_url}/2709-greatest-common-divisor-traversal.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/remove-trailing-zeros-from-a-string/[2710. Remove Trailing Zeros From a String^] //|{source_base_url}/_2710_RemoveTrailingZerosFromAString.java[Java] //|{doc_base_url}/2710-remove-trailing-zeros-from-a-string.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/difference-of-number-of-distinct-values-on-diagonals/[2711. Difference of Number of Distinct Values on Diagonals^] //|{source_base_url}/_2711_DifferenceOfNumberOfDistinctValuesOnDiagonals.java[Java] //|{doc_base_url}/2711-difference-of-number-of-distinct-values-on-diagonals.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-cost-to-make-all-characters-equal/[2712. Minimum Cost to Make All Characters Equal^] //|{source_base_url}/_2712_MinimumCostToMakeAllCharactersEqual.java[Java] //|{doc_base_url}/2712-minimum-cost-to-make-all-characters-equal.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-strictly-increasing-cells-in-a-matrix/[2713. Maximum Strictly Increasing Cells in a Matrix^] //|{source_base_url}/_2713_MaximumStrictlyIncreasingCellsInAMatrix.java[Java] //|{doc_base_url}/2713-maximum-strictly-increasing-cells-in-a-matrix.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/find-shortest-path-with-k-hops/[2714. Find Shortest Path with K Hops^] //|{source_base_url}/_2714_FindShortestPathWithKHops.java[Java] //|{doc_base_url}/2714-find-shortest-path-with-k-hops.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/timeout-cancellation/[2715. Timeout Cancellation^] //|{source_base_url}/_2715_TimeoutCancellation.java[Java] //|{doc_base_url}/2715-timeout-cancellation.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/minimize-string-length/[2716. Minimize String Length^] //|{source_base_url}/_2716_MinimizeStringLength.java[Java] //|{doc_base_url}/2716-minimize-string-length.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/semi-ordered-permutation/[2717. Semi-Ordered Permutation^] //|{source_base_url}/_2717_SemiOrderedPermutation.java[Java] //|{doc_base_url}/2717-semi-ordered-permutation.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/sum-of-matrix-after-queries/[2718. Sum of Matrix After Queries^] //|{source_base_url}/_2718_SumOfMatrixAfterQueries.java[Java] //|{doc_base_url}/2718-sum-of-matrix-after-queries.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-of-integers/[2719. Count of Integers^] //|{source_base_url}/_2719_CountOfIntegers.java[Java] //|{doc_base_url}/2719-count-of-integers.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/popularity-percentage/[2720. Popularity Percentage^] //|{source_base_url}/_2720_PopularityPercentage.java[Java] //|{doc_base_url}/2720-popularity-percentage.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/execute-asynchronous-functions-in-parallel/[2721. Execute Asynchronous Functions in Parallel^] //|{source_base_url}/_2721_ExecuteAsynchronousFunctionsInParallel.java[Java] //|{doc_base_url}/2721-execute-asynchronous-functions-in-parallel.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/join-two-arrays-by-id/[2722. Join Two Arrays by ID^] //|{source_base_url}/_2722_JoinTwoArraysById.java[Java] //|{doc_base_url}/2722-join-two-arrays-by-id.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/add-two-promises/[2723. Add Two Promises^] //|{source_base_url}/_2723_AddTwoPromises.java[Java] //|{doc_base_url}/2723-add-two-promises.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/sort-by/[2724. Sort By^] //|{source_base_url}/_2724_SortBy.java[Java] //|{doc_base_url}/2724-sort-by.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/interval-cancellation/[2725. Interval Cancellation^] //|{source_base_url}/_2725_IntervalCancellation.java[Java] //|{doc_base_url}/2725-interval-cancellation.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/calculator-with-method-chaining/[2726. Calculator with Method Chaining^] //|{source_base_url}/_2726_CalculatorWithMethodChaining.java[Java] //|{doc_base_url}/2726-calculator-with-method-chaining.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/is-object-empty/[2727. Is Object Empty^] //|{source_base_url}/_2727_IsObjectEmpty.java[Java] //|{doc_base_url}/2727-is-object-empty.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/count-houses-in-a-circular-street/[2728. Count Houses in a Circular Street^] //|{source_base_url}/_2728_CountHousesInACircularStreet.java[Java] //|{doc_base_url}/2728-count-houses-in-a-circular-street.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/check-if-the-number-is-fascinating/[2729. Check if The Number is Fascinating^] //|{source_base_url}/_2729_CheckIfTheNumberIsFascinating.java[Java] //|{doc_base_url}/2729-check-if-the-number-is-fascinating.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/find-the-longest-semi-repetitive-substring/[2730. Find the Longest Semi-Repetitive Substring^] //|{source_base_url}/_2730_FindTheLongestSemiRepetitiveSubstring.java[Java] //|{doc_base_url}/2730-find-the-longest-semi-repetitive-substring.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/movement-of-robots/[2731. Movement of Robots^] //|{source_base_url}/_2731_MovementOfRobots.java[Java] //|{doc_base_url}/2731-movement-of-robots.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-a-good-subset-of-the-matrix/[2732. Find a Good Subset of the Matrix^] //|{source_base_url}/_2732_FindAGoodSubsetOfTheMatrix.java[Java] //|{doc_base_url}/2732-find-a-good-subset-of-the-matrix.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/neither-minimum-nor-maximum/[2733. Neither Minimum nor Maximum^] //|{source_base_url}/_2733_NeitherMinimumNorMaximum.java[Java] //|{doc_base_url}/2733-neither-minimum-nor-maximum.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/lexicographically-smallest-string-after-substring-operation/[2734. Lexicographically Smallest String After Substring Operation^] //|{source_base_url}/_2734_LexicographicallySmallestStringAfterSubstringOperation.java[Java] //|{doc_base_url}/2734-lexicographically-smallest-string-after-substring-operation.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/collecting-chocolates/[2735. Collecting Chocolates^] //|{source_base_url}/_2735_CollectingChocolates.java[Java] //|{doc_base_url}/2735-collecting-chocolates.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-sum-queries/[2736. Maximum Sum Queries^] //|{source_base_url}/_2736_MaximumSumQueries.java[Java] //|{doc_base_url}/2736-maximum-sum-queries.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/find-the-closest-marked-node/[2737. Find the Closest Marked Node^] //|{source_base_url}/_2737_FindTheClosestMarkedNode.java[Java] //|{doc_base_url}/2737-find-the-closest-marked-node.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-occurrences-in-text/[2738. Count Occurrences in Text^] //|{source_base_url}/_2738_CountOccurrencesInText.java[Java] //|{doc_base_url}/2738-count-occurrences-in-text.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/total-distance-traveled/[2739. Total Distance Traveled^] //|{source_base_url}/_2739_TotalDistanceTraveled.java[Java] //|{doc_base_url}/2739-total-distance-traveled.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/find-the-value-of-the-partition/[2740. Find the Value of the Partition^] //|{source_base_url}/_2740_FindTheValueOfThePartition.java[Java] //|{doc_base_url}/2740-find-the-value-of-the-partition.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/special-permutations/[2741. Special Permutations^] //|{source_base_url}/_2741_SpecialPermutations.java[Java] //|{doc_base_url}/2741-special-permutations.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/painting-the-walls/[2742. Painting the Walls^] //|{source_base_url}/_2742_PaintingTheWalls.java[Java] //|{doc_base_url}/2742-painting-the-walls.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/count-substrings-without-repeating-character/[2743. Count Substrings Without Repeating Character^] //|{source_base_url}/_2743_CountSubstringsWithoutRepeatingCharacter.java[Java] //|{doc_base_url}/2743-count-substrings-without-repeating-character.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-maximum-number-of-string-pairs/[2744. Find Maximum Number of String Pairs^] //|{source_base_url}/_2744_FindMaximumNumberOfStringPairs.java[Java] //|{doc_base_url}/2744-find-maximum-number-of-string-pairs.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/construct-the-longest-new-string/[2745. Construct the Longest New String^] //|{source_base_url}/_2745_ConstructTheLongestNewString.java[Java] //|{doc_base_url}/2745-construct-the-longest-new-string.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/decremental-string-concatenation/[2746. Decremental String Concatenation^] //|{source_base_url}/_2746_DecrementalStringConcatenation.java[Java] //|{doc_base_url}/2746-decremental-string-concatenation.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-zero-request-servers/[2747. Count Zero Request Servers^] //|{source_base_url}/_2747_CountZeroRequestServers.java[Java] //|{doc_base_url}/2747-count-zero-request-servers.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/number-of-beautiful-pairs/[2748. Number of Beautiful Pairs^] //|{source_base_url}/_2748_NumberOfBeautifulPairs.java[Java] //|{doc_base_url}/2748-number-of-beautiful-pairs.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/minimum-operations-to-make-the-integer-zero/[2749. Minimum Operations to Make the Integer Zero^] //|{source_base_url}/_2749_MinimumOperationsToMakeTheIntegerZero.java[Java] //|{doc_base_url}/2749-minimum-operations-to-make-the-integer-zero.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/ways-to-split-array-into-good-subarrays/[2750. Ways to Split Array Into Good Subarrays^] //|{source_base_url}/_2750_WaysToSplitArrayIntoGoodSubarrays.java[Java] //|{doc_base_url}/2750-ways-to-split-array-into-good-subarrays.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/robot-collisions/[2751. Robot Collisions^] //|{source_base_url}/_2751_RobotCollisions.java[Java] //|{doc_base_url}/2751-robot-collisions.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/customers-with-maximum-number-of-transactions-on-consecutive-days/[2752. Customers with Maximum Number of Transactions on Consecutive Days^] //|{source_base_url}/_2752_CustomersWithMaximumNumberOfTransactionsOnConsecutiveDays.java[Java] //|{doc_base_url}/2752-customers-with-maximum-number-of-transactions-on-consecutive-days.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/count-houses-in-a-circular-street-ii/[2753. Count Houses in a Circular Street II^] //|{source_base_url}/_2753_CountHousesInACircularStreetIi.java[Java] //|{doc_base_url}/2753-count-houses-in-a-circular-street-ii.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/bind-function-to-context/[2754. Bind Function to Context^] //|{source_base_url}/_2754_BindFunctionToContext.java[Java] //|{doc_base_url}/2754-bind-function-to-context.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/deep-merge-of-two-objects/[2755. Deep Merge of Two Objects^] //|{source_base_url}/_2755_DeepMergeOfTwoObjects.java[Java] //|{doc_base_url}/2755-deep-merge-of-two-objects.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/query-batching/[2756. Query Batching^] //|{source_base_url}/_2756_QueryBatching.java[Java] //|{doc_base_url}/2756-query-batching.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/generate-circular-array-values/[2757. Generate Circular Array Values^] //|{source_base_url}/_2757_GenerateCircularArrayValues.java[Java] //|{doc_base_url}/2757-generate-circular-array-values.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/next-day/[2758. Next Day^] //|{source_base_url}/_2758_NextDay.java[Java] //|{doc_base_url}/2758-next-day.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/convert-json-string-to-object/[2759. Convert JSON String to Object^] //|{source_base_url}/_2759_ConvertJsonStringToObject.java[Java] //|{doc_base_url}/2759-convert-json-string-to-object.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/longest-even-odd-subarray-with-threshold/[2760. Longest Even Odd Subarray With Threshold^] //|{source_base_url}/_2760_LongestEvenOddSubarrayWithThreshold.java[Java] //|{doc_base_url}/2760-longest-even-odd-subarray-with-threshold.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/prime-pairs-with-target-sum/[2761. Prime Pairs With Target Sum^] //|{source_base_url}/_2761_PrimePairsWithTargetSum.java[Java] //|{doc_base_url}/2761-prime-pairs-with-target-sum.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/continuous-subarrays/[2762. Continuous Subarrays^] //|{source_base_url}/_2762_ContinuousSubarrays.java[Java] //|{doc_base_url}/2762-continuous-subarrays.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/sum-of-imbalance-numbers-of-all-subarrays/[2763. Sum of Imbalance Numbers of All Subarrays^] //|{source_base_url}/_2763_SumOfImbalanceNumbersOfAllSubarrays.java[Java] //|{doc_base_url}/2763-sum-of-imbalance-numbers-of-all-subarrays.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/is-array-a-preorder-of-some-binary-tree/[2764. Is Array a Preorder of Some ‌Binary Tree^] //|{source_base_url}/_2764_IsArrayAPreorderOfSomeBinaryTree.java[Java] //|{doc_base_url}/2764-is-array-a-preorder-of-some-binary-tree.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/longest-alternating-subarray/[2765. Longest Alternating Subarray^] //|{source_base_url}/_2765_LongestAlternatingSubarray.java[Java] //|{doc_base_url}/2765-longest-alternating-subarray.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/relocate-marbles/[2766. Relocate Marbles^] //|{source_base_url}/_2766_RelocateMarbles.java[Java] //|{doc_base_url}/2766-relocate-marbles.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/partition-string-into-minimum-beautiful-substrings/[2767. Partition String Into Minimum Beautiful Substrings^] //|{source_base_url}/_2767_PartitionStringIntoMinimumBeautifulSubstrings.java[Java] //|{doc_base_url}/2767-partition-string-into-minimum-beautiful-substrings.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/number-of-black-blocks/[2768. Number of Black Blocks^] //|{source_base_url}/_2768_NumberOfBlackBlocks.java[Java] //|{doc_base_url}/2768-number-of-black-blocks.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-the-maximum-achievable-number/[2769. Find the Maximum Achievable Number^] //|{source_base_url}/_2769_FindTheMaximumAchievableNumber.java[Java] //|{doc_base_url}/2769-find-the-maximum-achievable-number.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/maximum-number-of-jumps-to-reach-the-last-index/[2770. Maximum Number of Jumps to Reach the Last Index^] //|{source_base_url}/_2770_MaximumNumberOfJumpsToReachTheLastIndex.java[Java] //|{doc_base_url}/2770-maximum-number-of-jumps-to-reach-the-last-index.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/longest-non-decreasing-subarray-from-two-arrays/[2771. Longest Non-decreasing Subarray From Two Arrays^] //|{source_base_url}/_2771_LongestNonDecreasingSubarrayFromTwoArrays.java[Java] //|{doc_base_url}/2771-longest-non-decreasing-subarray-from-two-arrays.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/apply-operations-to-make-all-array-elements-equal-to-zero/[2772. Apply Operations to Make All Array Elements Equal to Zero^] //|{source_base_url}/_2772_ApplyOperationsToMakeAllArrayElementsEqualToZero.java[Java] //|{doc_base_url}/2772-apply-operations-to-make-all-array-elements-equal-to-zero.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/height-of-special-binary-tree/[2773. Height of Special Binary Tree^] //|{source_base_url}/_2773_HeightOfSpecialBinaryTree.java[Java] //|{doc_base_url}/2773-height-of-special-binary-tree.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/array-upper-bound/[2774. Array Upper Bound^] //|{source_base_url}/_2774_ArrayUpperBound.java[Java] //|{doc_base_url}/2774-array-upper-bound.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/undefined-to-null/[2775. Undefined to Null^] //|{source_base_url}/_2775_UndefinedToNull.java[Java] //|{doc_base_url}/2775-undefined-to-null.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/convert-callback-based-function-to-promise-based-function/[2776. Convert Callback Based Function to Promise Based Function^] //|{source_base_url}/_2776_ConvertCallbackBasedFunctionToPromiseBasedFunction.java[Java] //|{doc_base_url}/2776-convert-callback-based-function-to-promise-based-function.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/date-range-generator/[2777. Date Range Generator^] //|{source_base_url}/_2777_DateRangeGenerator.java[Java] //|{doc_base_url}/2777-date-range-generator.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/sum-of-squares-of-special-elements/[2778. Sum of Squares of Special Elements ^] //|{source_base_url}/_2778_SumOfSquaresOfSpecialElements.java[Java] //|{doc_base_url}/2778-sum-of-squares-of-special-elements.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/maximum-beauty-of-an-array-after-applying-operation/[2779. Maximum Beauty of an Array After Applying Operation^] //|{source_base_url}/_2779_MaximumBeautyOfAnArrayAfterApplyingOperation.java[Java] //|{doc_base_url}/2779-maximum-beauty-of-an-array-after-applying-operation.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-index-of-a-valid-split/[2780. Minimum Index of a Valid Split^] //|{source_base_url}/_2780_MinimumIndexOfAValidSplit.java[Java] //|{doc_base_url}/2780-minimum-index-of-a-valid-split.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/length-of-the-longest-valid-substring/[2781. Length of the Longest Valid Substring^] //|{source_base_url}/_2781_LengthOfTheLongestValidSubstring.java[Java] //|{doc_base_url}/2781-length-of-the-longest-valid-substring.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/number-of-unique-categories/[2782. Number of Unique Categories^] //|{source_base_url}/_2782_NumberOfUniqueCategories.java[Java] //|{doc_base_url}/2782-number-of-unique-categories.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/flight-occupancy-and-waitlist-analysis/[2783. Flight Occupancy and Waitlist Analysis^] //|{source_base_url}/_2783_FlightOccupancyAndWaitlistAnalysis.java[Java] //|{doc_base_url}/2783-flight-occupancy-and-waitlist-analysis.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/check-if-array-is-good/[2784. Check if Array is Good^] //|{source_base_url}/_2784_CheckIfArrayIsGood.java[Java] //|{doc_base_url}/2784-check-if-array-is-good.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/sort-vowels-in-a-string/[2785. Sort Vowels in a String^] //|{source_base_url}/_2785_SortVowelsInAString.java[Java] //|{doc_base_url}/2785-sort-vowels-in-a-string.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/visit-array-positions-to-maximize-score/[2786. Visit Array Positions to Maximize Score^] //|{source_base_url}/_2786_VisitArrayPositionsToMaximizeScore.java[Java] //|{doc_base_url}/2786-visit-array-positions-to-maximize-score.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/ways-to-express-an-integer-as-sum-of-powers/[2787. Ways to Express an Integer as Sum of Powers^] //|{source_base_url}/_2787_WaysToExpressAnIntegerAsSumOfPowers.java[Java] //|{doc_base_url}/2787-ways-to-express-an-integer-as-sum-of-powers.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/split-strings-by-separator/[2788. Split Strings by Separator^] //|{source_base_url}/_2788_SplitStringsBySeparator.java[Java] //|{doc_base_url}/2788-split-strings-by-separator.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/largest-element-in-an-array-after-merge-operations/[2789. Largest Element in an Array after Merge Operations^] //|{source_base_url}/_2789_LargestElementInAnArrayAfterMergeOperations.java[Java] //|{doc_base_url}/2789-largest-element-in-an-array-after-merge-operations.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-number-of-groups-with-increasing-length/[2790. Maximum Number of Groups With Increasing Length^] //|{source_base_url}/_2790_MaximumNumberOfGroupsWithIncreasingLength.java[Java] //|{doc_base_url}/2790-maximum-number-of-groups-with-increasing-length.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/count-paths-that-can-form-a-palindrome-in-a-tree/[2791. Count Paths That Can Form a Palindrome in a Tree^] //|{source_base_url}/_2791_CountPathsThatCanFormAPalindromeInATree.java[Java] //|{doc_base_url}/2791-count-paths-that-can-form-a-palindrome-in-a-tree.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/count-nodes-that-are-great-enough/[2792. Count Nodes That Are Great Enough^] //|{source_base_url}/_2792_CountNodesThatAreGreatEnough.java[Java] //|{doc_base_url}/2792-count-nodes-that-are-great-enough.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/status-of-flight-tickets/[2793. Status of Flight Tickets^] //|{source_base_url}/_2793_StatusOfFlightTickets.java[Java] //|{doc_base_url}/2793-status-of-flight-tickets.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/create-object-from-two-arrays/[2794. Create Object from Two Arrays^] //|{source_base_url}/_2794_CreateObjectFromTwoArrays.java[Java] //|{doc_base_url}/2794-create-object-from-two-arrays.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/parallel-execution-of-promises-for-individual-results-retrieval/[2795. Parallel Execution of Promises for Individual Results Retrieval^] //|{source_base_url}/_2795_ParallelExecutionOfPromisesForIndividualResultsRetrieval.java[Java] //|{doc_base_url}/2795-parallel-execution-of-promises-for-individual-results-retrieval.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/repeat-string/[2796. Repeat String^] //|{source_base_url}/_2796_RepeatString.java[Java] //|{doc_base_url}/2796-repeat-string.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/partial-function-with-placeholders/[2797. Partial Function with Placeholders^] //|{source_base_url}/_2797_PartialFunctionWithPlaceholders.java[Java] //|{doc_base_url}/2797-partial-function-with-placeholders.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/number-of-employees-who-met-the-target/[2798. Number of Employees Who Met the Target^] //|{source_base_url}/_2798_NumberOfEmployeesWhoMetTheTarget.java[Java] //|{doc_base_url}/2798-number-of-employees-who-met-the-target.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/count-complete-subarrays-in-an-array/[2799. Count Complete Subarrays in an Array^] //|{source_base_url}/_2799_CountCompleteSubarraysInAnArray.java[Java] //|{doc_base_url}/2799-count-complete-subarrays-in-an-array.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/shortest-string-that-contains-three-strings/[2800. Shortest String That Contains Three Strings^] //|{source_base_url}/_2800_ShortestStringThatContainsThreeStrings.java[Java] //|{doc_base_url}/2800-shortest-string-that-contains-three-strings.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-stepping-numbers-in-range/[2801. Count Stepping Numbers in Range^] //|{source_base_url}/_2801_CountSteppingNumbersInRange.java[Java] //|{doc_base_url}/2801-count-stepping-numbers-in-range.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/find-the-k-th-lucky-number/[2802. Find The K-th Lucky Number^] //|{source_base_url}/_2802_FindTheKThLuckyNumber.java[Java] //|{doc_base_url}/2802-find-the-k-th-lucky-number.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/factorial-generator/[2803. Factorial Generator^] //|{source_base_url}/_2803_FactorialGenerator.java[Java] //|{doc_base_url}/2803-factorial-generator.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/array-prototype-foreach/[2804. Array Prototype ForEach^] //|{source_base_url}/_2804_ArrayPrototypeForeach.java[Java] //|{doc_base_url}/2804-array-prototype-foreach.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/custom-interval/[2805. Custom Interval^] //|{source_base_url}/_2805_CustomInterval.java[Java] //|{doc_base_url}/2805-custom-interval.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/account-balance-after-rounded-purchase/[2806. Account Balance After Rounded Purchase^] //|{source_base_url}/_2806_AccountBalanceAfterRoundedPurchase.java[Java] //|{doc_base_url}/2806-account-balance-after-rounded-purchase.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/insert-greatest-common-divisors-in-linked-list/[2807. Insert Greatest Common Divisors in Linked List^] //|{source_base_url}/_2807_InsertGreatestCommonDivisorsInLinkedList.java[Java] //|{doc_base_url}/2807-insert-greatest-common-divisors-in-linked-list.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-seconds-to-equalize-a-circular-array/[2808. Minimum Seconds to Equalize a Circular Array^] //|{source_base_url}/_2808_MinimumSecondsToEqualizeACircularArray.java[Java] //|{doc_base_url}/2808-minimum-seconds-to-equalize-a-circular-array.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-time-to-make-array-sum-at-most-x/[2809. Minimum Time to Make Array Sum At Most x^] //|{source_base_url}/_2809_MinimumTimeToMakeArraySumAtMostX.java[Java] //|{doc_base_url}/2809-minimum-time-to-make-array-sum-at-most-x.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/faulty-keyboard/[2810. Faulty Keyboard^] //|{source_base_url}/_2810_FaultyKeyboard.java[Java] //|{doc_base_url}/2810-faulty-keyboard.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/check-if-it-is-possible-to-split-array/[2811. Check if it is Possible to Split Array^] //|{source_base_url}/_2811_CheckIfItIsPossibleToSplitArray.java[Java] //|{doc_base_url}/2811-check-if-it-is-possible-to-split-array.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-the-safest-path-in-a-grid/[2812. Find the Safest Path in a Grid^] //|{source_base_url}/_2812_FindTheSafestPathInAGrid.java[Java] //|{doc_base_url}/2812-find-the-safest-path-in-a-grid.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-elegance-of-a-k-length-subsequence/[2813. Maximum Elegance of a K-Length Subsequence^] //|{source_base_url}/_2813_MaximumEleganceOfAKLengthSubsequence.java[Java] //|{doc_base_url}/2813-maximum-elegance-of-a-k-length-subsequence.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/minimum-time-takes-to-reach-destination-without-drowning/[2814. Minimum Time Takes to Reach Destination Without Drowning^] //|{source_base_url}/_2814_MinimumTimeTakesToReachDestinationWithoutDrowning.java[Java] //|{doc_base_url}/2814-minimum-time-takes-to-reach-destination-without-drowning.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/max-pair-sum-in-an-array/[2815. Max Pair Sum in an Array^] //|{source_base_url}/_2815_MaxPairSumInAnArray.java[Java] //|{doc_base_url}/2815-max-pair-sum-in-an-array.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/double-a-number-represented-as-a-linked-list/[2816. Double a Number Represented as a Linked List^] //|{source_base_url}/_2816_DoubleANumberRepresentedAsALinkedList.java[Java] //|{doc_base_url}/2816-double-a-number-represented-as-a-linked-list.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-absolute-difference-between-elements-with-constraint/[2817. Minimum Absolute Difference Between Elements With Constraint^] //|{source_base_url}/_2817_MinimumAbsoluteDifferenceBetweenElementsWithConstraint.java[Java] //|{doc_base_url}/2817-minimum-absolute-difference-between-elements-with-constraint.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/apply-operations-to-maximize-score/[2818. Apply Operations to Maximize Score^] //|{source_base_url}/_2818_ApplyOperationsToMaximizeScore.java[Java] //|{doc_base_url}/2818-apply-operations-to-maximize-score.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/minimum-relative-loss-after-buying-chocolates/[2819. Minimum Relative Loss After Buying Chocolates^] //|{source_base_url}/_2819_MinimumRelativeLossAfterBuyingChocolates.java[Java] //|{doc_base_url}/2819-minimum-relative-loss-after-buying-chocolates.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/election-results/[2820. Election Results^] //|{source_base_url}/_2820_ElectionResults.java[Java] //|{doc_base_url}/2820-election-results.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/delay-the-resolution-of-each-promise/[2821. Delay the Resolution of Each Promise^] //|{source_base_url}/_2821_DelayTheResolutionOfEachPromise.java[Java] //|{doc_base_url}/2821-delay-the-resolution-of-each-promise.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/inversion-of-object/[2822. Inversion of Object^] //|{source_base_url}/_2822_InversionOfObject.java[Java] //|{doc_base_url}/2822-inversion-of-object.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/deep-object-filter/[2823. Deep Object Filter^] //|{source_base_url}/_2823_DeepObjectFilter.java[Java] //|{doc_base_url}/2823-deep-object-filter.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-pairs-whose-sum-is-less-than-target/[2824. Count Pairs Whose Sum is Less than Target^] //|{source_base_url}/_2824_CountPairsWhoseSumIsLessThanTarget.java[Java] //|{doc_base_url}/2824-count-pairs-whose-sum-is-less-than-target.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/make-string-a-subsequence-using-cyclic-increments/[2825. Make String a Subsequence Using Cyclic Increments^] //|{source_base_url}/_2825_MakeStringASubsequenceUsingCyclicIncrements.java[Java] //|{doc_base_url}/2825-make-string-a-subsequence-using-cyclic-increments.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/sorting-three-groups/[2826. Sorting Three Groups^] //|{source_base_url}/_2826_SortingThreeGroups.java[Java] //|{doc_base_url}/2826-sorting-three-groups.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/number-of-beautiful-integers-in-the-range/[2827. Number of Beautiful Integers in the Range^] //|{source_base_url}/_2827_NumberOfBeautifulIntegersInTheRange.java[Java] //|{doc_base_url}/2827-number-of-beautiful-integers-in-the-range.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/check-if-a-string-is-an-acronym-of-words/[2828. Check if a String Is an Acronym of Words^] //|{source_base_url}/_2828_CheckIfAStringIsAnAcronymOfWords.java[Java] //|{doc_base_url}/2828-check-if-a-string-is-an-acronym-of-words.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/determine-the-minimum-sum-of-a-k-avoiding-array/[2829. Determine the Minimum Sum of a k-avoiding Array^] //|{source_base_url}/_2829_DetermineTheMinimumSumOfAKAvoidingArray.java[Java] //|{doc_base_url}/2829-determine-the-minimum-sum-of-a-k-avoiding-array.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximize-the-profit-as-the-salesman/[2830. Maximize the Profit as the Salesman^] //|{source_base_url}/_2830_MaximizeTheProfitAsTheSalesman.java[Java] //|{doc_base_url}/2830-maximize-the-profit-as-the-salesman.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-the-longest-equal-subarray/[2831. Find the Longest Equal Subarray^] //|{source_base_url}/_2831_FindTheLongestEqualSubarray.java[Java] //|{doc_base_url}/2831-find-the-longest-equal-subarray.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximal-range-that-each-element-is-maximum-in-it/[2832. Maximal Range That Each Element Is Maximum in It^] //|{source_base_url}/_2832_MaximalRangeThatEachElementIsMaximumInIt.java[Java] //|{doc_base_url}/2832-maximal-range-that-each-element-is-maximum-in-it.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/furthest-point-from-origin/[2833. Furthest Point From Origin^] //|{source_base_url}/_2833_FurthestPointFromOrigin.java[Java] //|{doc_base_url}/2833-furthest-point-from-origin.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/find-the-minimum-possible-sum-of-a-beautiful-array/[2834. Find the Minimum Possible Sum of a Beautiful Array^] //|{source_base_url}/_2834_FindTheMinimumPossibleSumOfABeautifulArray.java[Java] //|{doc_base_url}/2834-find-the-minimum-possible-sum-of-a-beautiful-array.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-operations-to-form-subsequence-with-target-sum/[2835. Minimum Operations to Form Subsequence With Target Sum^] //|{source_base_url}/_2835_MinimumOperationsToFormSubsequenceWithTargetSum.java[Java] //|{doc_base_url}/2835-minimum-operations-to-form-subsequence-with-target-sum.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/maximize-value-of-function-in-a-ball-passing-game/[2836. Maximize Value of Function in a Ball Passing Game^] //|{source_base_url}/_2836_MaximizeValueOfFunctionInABallPassingGame.java[Java] //|{doc_base_url}/2836-maximize-value-of-function-in-a-ball-passing-game.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/total-traveled-distance/[2837. Total Traveled Distance^] //|{source_base_url}/_2837_TotalTraveledDistance.java[Java] //|{doc_base_url}/2837-total-traveled-distance.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/maximum-coins-heroes-can-collect/[2838. Maximum Coins Heroes Can Collect^] //|{source_base_url}/_2838_MaximumCoinsHeroesCanCollect.java[Java] //|{doc_base_url}/2838-maximum-coins-heroes-can-collect.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/check-if-strings-can-be-made-equal-with-operations-i/[2839. Check if Strings Can be Made Equal With Operations I^] //|{source_base_url}/_2839_CheckIfStringsCanBeMadeEqualWithOperationsI.java[Java] //|{doc_base_url}/2839-check-if-strings-can-be-made-equal-with-operations-i.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/check-if-strings-can-be-made-equal-with-operations-ii/[2840. Check if Strings Can be Made Equal With Operations II^] //|{source_base_url}/_2840_CheckIfStringsCanBeMadeEqualWithOperationsIi.java[Java] //|{doc_base_url}/2840-check-if-strings-can-be-made-equal-with-operations-ii.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-sum-of-almost-unique-subarray/[2841. Maximum Sum of Almost Unique Subarray^] //|{source_base_url}/_2841_MaximumSumOfAlmostUniqueSubarray.java[Java] //|{doc_base_url}/2841-maximum-sum-of-almost-unique-subarray.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-k-subsequences-of-a-string-with-maximum-beauty/[2842. Count K-Subsequences of a String With Maximum Beauty^] //|{source_base_url}/_2842_CountKSubsequencesOfAStringWithMaximumBeauty.java[Java] //|{doc_base_url}/2842-count-k-subsequences-of-a-string-with-maximum-beauty.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/count-symmetric-integers/[2843. Count Symmetric Integers^] //|{source_base_url}/_2843_CountSymmetricIntegers.java[Java] //|{doc_base_url}/2843-count-symmetric-integers.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/minimum-operations-to-make-a-special-number/[2844. Minimum Operations to Make a Special Number^] //|{source_base_url}/_2844_MinimumOperationsToMakeASpecialNumber.java[Java] //|{doc_base_url}/2844-minimum-operations-to-make-a-special-number.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-of-interesting-subarrays/[2845. Count of Interesting Subarrays^] //|{source_base_url}/_2845_CountOfInterestingSubarrays.java[Java] //|{doc_base_url}/2845-count-of-interesting-subarrays.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-edge-weight-equilibrium-queries-in-a-tree/[2846. Minimum Edge Weight Equilibrium Queries in a Tree^] //|{source_base_url}/_2846_MinimumEdgeWeightEquilibriumQueriesInATree.java[Java] //|{doc_base_url}/2846-minimum-edge-weight-equilibrium-queries-in-a-tree.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/smallest-number-with-given-digit-product/[2847. Smallest Number With Given Digit Product^] //|{source_base_url}/_2847_SmallestNumberWithGivenDigitProduct.java[Java] //|{doc_base_url}/2847-smallest-number-with-given-digit-product.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/points-that-intersect-with-cars/[2848. Points That Intersect With Cars^] //|{source_base_url}/_2848_PointsThatIntersectWithCars.java[Java] //|{doc_base_url}/2848-points-that-intersect-with-cars.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/determine-if-a-cell-is-reachable-at-a-given-time/[2849. Determine if a Cell Is Reachable at a Given Time^] //|{source_base_url}/_2849_DetermineIfACellIsReachableAtAGivenTime.java[Java] //|{doc_base_url}/2849-determine-if-a-cell-is-reachable-at-a-given-time.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-moves-to-spread-stones-over-grid/[2850. Minimum Moves to Spread Stones Over Grid^] //|{source_base_url}/_2850_MinimumMovesToSpreadStonesOverGrid.java[Java] //|{doc_base_url}/2850-minimum-moves-to-spread-stones-over-grid.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/string-transformation/[2851. String Transformation^] //|{source_base_url}/_2851_StringTransformation.java[Java] //|{doc_base_url}/2851-string-transformation.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/sum-of-remoteness-of-all-cells/[2852. Sum of Remoteness of All Cells^] //|{source_base_url}/_2852_SumOfRemotenessOfAllCells.java[Java] //|{doc_base_url}/2852-sum-of-remoteness-of-all-cells.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/highest-salaries-difference/[2853. Highest Salaries Difference^] //|{source_base_url}/_2853_HighestSalariesDifference.java[Java] //|{doc_base_url}/2853-highest-salaries-difference.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/rolling-average-steps/[2854. Rolling Average Steps^] //|{source_base_url}/_2854_RollingAverageSteps.java[Java] //|{doc_base_url}/2854-rolling-average-steps.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-right-shifts-to-sort-the-array/[2855. Minimum Right Shifts to Sort the Array^] //|{source_base_url}/_2855_MinimumRightShiftsToSortTheArray.java[Java] //|{doc_base_url}/2855-minimum-right-shifts-to-sort-the-array.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/minimum-array-length-after-pair-removals/[2856. Minimum Array Length After Pair Removals^] //|{source_base_url}/_2856_MinimumArrayLengthAfterPairRemovals.java[Java] //|{doc_base_url}/2856-minimum-array-length-after-pair-removals.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-pairs-of-points-with-distance-k/[2857. Count Pairs of Points With Distance k^] //|{source_base_url}/_2857_CountPairsOfPointsWithDistanceK.java[Java] //|{doc_base_url}/2857-count-pairs-of-points-with-distance-k.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-edge-reversals-so-every-node-is-reachable/[2858. Minimum Edge Reversals So Every Node Is Reachable^] //|{source_base_url}/_2858_MinimumEdgeReversalsSoEveryNodeIsReachable.java[Java] //|{doc_base_url}/2858-minimum-edge-reversals-so-every-node-is-reachable.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/sum-of-values-at-indices-with-k-set-bits/[2859. Sum of Values at Indices With K Set Bits^] //|{source_base_url}/_2859_SumOfValuesAtIndicesWithKSetBits.java[Java] //|{doc_base_url}/2859-sum-of-values-at-indices-with-k-set-bits.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/happy-students/[2860. Happy Students^] //|{source_base_url}/_2860_HappyStudents.java[Java] //|{doc_base_url}/2860-happy-students.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-number-of-alloys/[2861. Maximum Number of Alloys^] //|{source_base_url}/_2861_MaximumNumberOfAlloys.java[Java] //|{doc_base_url}/2861-maximum-number-of-alloys.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-element-sum-of-a-complete-subset-of-indices/[2862. Maximum Element-Sum of a Complete Subset of Indices^] //|{source_base_url}/_2862_MaximumElementSumOfACompleteSubsetOfIndices.java[Java] //|{doc_base_url}/2862-maximum-element-sum-of-a-complete-subset-of-indices.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/maximum-length-of-semi-decreasing-subarrays/[2863. Maximum Length of Semi-Decreasing Subarrays^] //|{source_base_url}/_2863_MaximumLengthOfSemiDecreasingSubarrays.java[Java] //|{doc_base_url}/2863-maximum-length-of-semi-decreasing-subarrays.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-odd-binary-number/[2864. Maximum Odd Binary Number^] //|{source_base_url}/_2864_MaximumOddBinaryNumber.java[Java] //|{doc_base_url}/2864-maximum-odd-binary-number.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/beautiful-towers-i/[2865. Beautiful Towers I^] //|{source_base_url}/_2865_BeautifulTowersI.java[Java] //|{doc_base_url}/2865-beautiful-towers-i.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/beautiful-towers-ii/[2866. Beautiful Towers II^] //|{source_base_url}/_2866_BeautifulTowersIi.java[Java] //|{doc_base_url}/2866-beautiful-towers-ii.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-valid-paths-in-a-tree/[2867. Count Valid Paths in a Tree^] //|{source_base_url}/_2867_CountValidPathsInATree.java[Java] //|{doc_base_url}/2867-count-valid-paths-in-a-tree.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/the-wording-game/[2868. The Wording Game^] //|{source_base_url}/_2868_TheWordingGame.java[Java] //|{doc_base_url}/2868-the-wording-game.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/minimum-operations-to-collect-elements/[2869. Minimum Operations to Collect Elements^] //|{source_base_url}/_2869_MinimumOperationsToCollectElements.java[Java] //|{doc_base_url}/2869-minimum-operations-to-collect-elements.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/minimum-number-of-operations-to-make-array-empty/[2870. Minimum Number of Operations to Make Array Empty^] //|{source_base_url}/_2870_MinimumNumberOfOperationsToMakeArrayEmpty.java[Java] //|{doc_base_url}/2870-minimum-number-of-operations-to-make-array-empty.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/split-array-into-maximum-number-of-subarrays/[2871. Split Array Into Maximum Number of Subarrays^] //|{source_base_url}/_2871_SplitArrayIntoMaximumNumberOfSubarrays.java[Java] //|{doc_base_url}/2871-split-array-into-maximum-number-of-subarrays.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-number-of-k-divisible-components/[2872. Maximum Number of K-Divisible Components^] //|{source_base_url}/_2872_MaximumNumberOfKDivisibleComponents.java[Java] //|{doc_base_url}/2872-maximum-number-of-k-divisible-components.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/maximum-value-of-an-ordered-triplet-i/[2873. Maximum Value of an Ordered Triplet I^] //|{source_base_url}/_2873_MaximumValueOfAnOrderedTripletI.java[Java] //|{doc_base_url}/2873-maximum-value-of-an-ordered-triplet-i.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/maximum-value-of-an-ordered-triplet-ii/[2874. Maximum Value of an Ordered Triplet II^] //|{source_base_url}/_2874_MaximumValueOfAnOrderedTripletIi.java[Java] //|{doc_base_url}/2874-maximum-value-of-an-ordered-triplet-ii.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-size-subarray-in-infinite-array/[2875. Minimum Size Subarray in Infinite Array^] //|{source_base_url}/_2875_MinimumSizeSubarrayInInfiniteArray.java[Java] //|{doc_base_url}/2875-minimum-size-subarray-in-infinite-array.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-visited-nodes-in-a-directed-graph/[2876. Count Visited Nodes in a Directed Graph^] //|{source_base_url}/_2876_CountVisitedNodesInADirectedGraph.java[Java] //|{doc_base_url}/2876-count-visited-nodes-in-a-directed-graph.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/create-a-dataframe-from-list/[2877. Create a DataFrame from List^] //|{source_base_url}/_2877_CreateADataframeFromList.java[Java] //|{doc_base_url}/2877-create-a-dataframe-from-list.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/get-the-size-of-a-dataframe/[2878. Get the Size of a DataFrame^] //|{source_base_url}/_2878_GetTheSizeOfADataframe.java[Java] //|{doc_base_url}/2878-get-the-size-of-a-dataframe.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/display-the-first-three-rows/[2879. Display the First Three Rows^] //|{source_base_url}/_2879_DisplayTheFirstThreeRows.java[Java] //|{doc_base_url}/2879-display-the-first-three-rows.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/select-data/[2880. Select Data^] //|{source_base_url}/_2880_SelectData.java[Java] //|{doc_base_url}/2880-select-data.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/create-a-new-column/[2881. Create a New Column^] //|{source_base_url}/_2881_CreateANewColumn.java[Java] //|{doc_base_url}/2881-create-a-new-column.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/drop-duplicate-rows/[2882. Drop Duplicate Rows^] //|{source_base_url}/_2882_DropDuplicateRows.java[Java] //|{doc_base_url}/2882-drop-duplicate-rows.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/drop-missing-data/[2883. Drop Missing Data^] //|{source_base_url}/_2883_DropMissingData.java[Java] //|{doc_base_url}/2883-drop-missing-data.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/modify-columns/[2884. Modify Columns^] //|{source_base_url}/_2884_ModifyColumns.java[Java] //|{doc_base_url}/2884-modify-columns.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/rename-columns/[2885. Rename Columns^] //|{source_base_url}/_2885_RenameColumns.java[Java] //|{doc_base_url}/2885-rename-columns.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/change-data-type/[2886. Change Data Type^] //|{source_base_url}/_2886_ChangeDataType.java[Java] //|{doc_base_url}/2886-change-data-type.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/fill-missing-data/[2887. Fill Missing Data^] //|{source_base_url}/_2887_FillMissingData.java[Java] //|{doc_base_url}/2887-fill-missing-data.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/reshape-data-concatenate/[2888. Reshape Data: Concatenate^] //|{source_base_url}/_2888_ReshapeDataConcatenate.java[Java] //|{doc_base_url}/2888-reshape-data-concatenate.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/reshape-data-pivot/[2889. Reshape Data: Pivot^] //|{source_base_url}/_2889_ReshapeDataPivot.java[Java] //|{doc_base_url}/2889-reshape-data-pivot.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/reshape-data-melt/[2890. Reshape Data: Melt^] //|{source_base_url}/_2890_ReshapeDataMelt.java[Java] //|{doc_base_url}/2890-reshape-data-melt.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/method-chaining/[2891. Method Chaining^] //|{source_base_url}/_2891_MethodChaining.java[Java] //|{doc_base_url}/2891-method-chaining.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/minimizing-array-after-replacing-pairs-with-their-product/[2892. Minimizing Array After Replacing Pairs With Their Product^] //|{source_base_url}/_2892_MinimizingArrayAfterReplacingPairsWithTheirProduct.java[Java] //|{doc_base_url}/2892-minimizing-array-after-replacing-pairs-with-their-product.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/calculate-orders-within-each-interval/[2893. Calculate Orders Within Each Interval^] //|{source_base_url}/_2893_CalculateOrdersWithinEachInterval.java[Java] //|{doc_base_url}/2893-calculate-orders-within-each-interval.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/divisible-and-non-divisible-sums-difference/[2894. Divisible and Non-divisible Sums Difference^] //|{source_base_url}/_2894_DivisibleAndNonDivisibleSumsDifference.java[Java] //|{doc_base_url}/2894-divisible-and-non-divisible-sums-difference.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/minimum-processing-time/[2895. Minimum Processing Time^] //|{source_base_url}/_2895_MinimumProcessingTime.java[Java] //|{doc_base_url}/2895-minimum-processing-time.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/apply-operations-to-make-two-strings-equal/[2896. Apply Operations to Make Two Strings Equal^] //|{source_base_url}/_2896_ApplyOperationsToMakeTwoStringsEqual.java[Java] //|{doc_base_url}/2896-apply-operations-to-make-two-strings-equal.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/apply-operations-on-array-to-maximize-sum-of-squares/[2897. Apply Operations on Array to Maximize Sum of Squares^] //|{source_base_url}/_2897_ApplyOperationsOnArrayToMaximizeSumOfSquares.java[Java] //|{doc_base_url}/2897-apply-operations-on-array-to-maximize-sum-of-squares.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/maximum-linear-stock-score/[2898. Maximum Linear Stock Score^] //|{source_base_url}/_2898_MaximumLinearStockScore.java[Java] //|{doc_base_url}/2898-maximum-linear-stock-score.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/last-visited-integers/[2899. Last Visited Integers^] //|{source_base_url}/_2899_LastVisitedIntegers.java[Java] //|{doc_base_url}/2899-last-visited-integers.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/longest-unequal-adjacent-groups-subsequence-i/[2900. Longest Unequal Adjacent Groups Subsequence I^] //|{source_base_url}/_2900_LongestUnequalAdjacentGroupsSubsequenceI.java[Java] //|{doc_base_url}/2900-longest-unequal-adjacent-groups-subsequence-i.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/longest-unequal-adjacent-groups-subsequence-ii/[2901. Longest Unequal Adjacent Groups Subsequence II^] //|{source_base_url}/_2901_LongestUnequalAdjacentGroupsSubsequenceIi.java[Java] //|{doc_base_url}/2901-longest-unequal-adjacent-groups-subsequence-ii.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-of-sub-multisets-with-bounded-sum/[2902. Count of Sub-Multisets With Bounded Sum^] //|{source_base_url}/_2902_CountOfSubMultisetsWithBoundedSum.java[Java] //|{doc_base_url}/2902-count-of-sub-multisets-with-bounded-sum.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/find-indices-with-index-and-value-difference-i/[2903. Find Indices With Index and Value Difference I^] //|{source_base_url}/_2903_FindIndicesWithIndexAndValueDifferenceI.java[Java] //|{doc_base_url}/2903-find-indices-with-index-and-value-difference-i.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/shortest-and-lexicographically-smallest-beautiful-string/[2904. Shortest and Lexicographically Smallest Beautiful String^] //|{source_base_url}/_2904_ShortestAndLexicographicallySmallestBeautifulString.java[Java] //|{doc_base_url}/2904-shortest-and-lexicographically-smallest-beautiful-string.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-indices-with-index-and-value-difference-ii/[2905. Find Indices With Index and Value Difference II^] //|{source_base_url}/_2905_FindIndicesWithIndexAndValueDifferenceIi.java[Java] //|{doc_base_url}/2905-find-indices-with-index-and-value-difference-ii.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/construct-product-matrix/[2906. Construct Product Matrix^] //|{source_base_url}/_2906_ConstructProductMatrix.java[Java] //|{doc_base_url}/2906-construct-product-matrix.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-profitable-triplets-with-increasing-prices-i/[2907. Maximum Profitable Triplets With Increasing Prices I^] //|{source_base_url}/_2907_MaximumProfitableTripletsWithIncreasingPricesI.java[Java] //|{doc_base_url}/2907-maximum-profitable-triplets-with-increasing-prices-i.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-sum-of-mountain-triplets-i/[2908. Minimum Sum of Mountain Triplets I^] //|{source_base_url}/_2908_MinimumSumOfMountainTripletsI.java[Java] //|{doc_base_url}/2908-minimum-sum-of-mountain-triplets-i.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/minimum-sum-of-mountain-triplets-ii/[2909. Minimum Sum of Mountain Triplets II^] //|{source_base_url}/_2909_MinimumSumOfMountainTripletsIi.java[Java] //|{doc_base_url}/2909-minimum-sum-of-mountain-triplets-ii.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-number-of-groups-to-create-a-valid-assignment/[2910. Minimum Number of Groups to Create a Valid Assignment^] //|{source_base_url}/_2910_MinimumNumberOfGroupsToCreateAValidAssignment.java[Java] //|{doc_base_url}/2910-minimum-number-of-groups-to-create-a-valid-assignment.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-changes-to-make-k-semi-palindromes/[2911. Minimum Changes to Make K Semi-palindromes^] //|{source_base_url}/_2911_MinimumChangesToMakeKSemiPalindromes.java[Java] //|{doc_base_url}/2911-minimum-changes-to-make-k-semi-palindromes.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/number-of-ways-to-reach-destination-in-the-grid/[2912. Number of Ways to Reach Destination in the Grid^] //|{source_base_url}/_2912_NumberOfWaysToReachDestinationInTheGrid.java[Java] //|{doc_base_url}/2912-number-of-ways-to-reach-destination-in-the-grid.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/subarrays-distinct-element-sum-of-squares-i/[2913. Subarrays Distinct Element Sum of Squares I^] //|{source_base_url}/_2913_SubarraysDistinctElementSumOfSquaresI.java[Java] //|{doc_base_url}/2913-subarrays-distinct-element-sum-of-squares-i.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/minimum-number-of-changes-to-make-binary-string-beautiful/[2914. Minimum Number of Changes to Make Binary String Beautiful^] //|{source_base_url}/_2914_MinimumNumberOfChangesToMakeBinaryStringBeautiful.java[Java] //|{doc_base_url}/2914-minimum-number-of-changes-to-make-binary-string-beautiful.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/length-of-the-longest-subsequence-that-sums-to-target/[2915. Length of the Longest Subsequence That Sums to Target^] //|{source_base_url}/_2915_LengthOfTheLongestSubsequenceThatSumsToTarget.java[Java] //|{doc_base_url}/2915-length-of-the-longest-subsequence-that-sums-to-target.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/subarrays-distinct-element-sum-of-squares-ii/[2916. Subarrays Distinct Element Sum of Squares II^] //|{source_base_url}/_2916_SubarraysDistinctElementSumOfSquaresIi.java[Java] //|{doc_base_url}/2916-subarrays-distinct-element-sum-of-squares-ii.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/find-the-k-or-of-an-array/[2917. Find the K-or of an Array^] //|{source_base_url}/_2917_FindTheKOrOfAnArray.java[Java] //|{doc_base_url}/2917-find-the-k-or-of-an-array.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/minimum-equal-sum-of-two-arrays-after-replacing-zeros/[2918. Minimum Equal Sum of Two Arrays After Replacing Zeros^] //|{source_base_url}/_2918_MinimumEqualSumOfTwoArraysAfterReplacingZeros.java[Java] //|{doc_base_url}/2918-minimum-equal-sum-of-two-arrays-after-replacing-zeros.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-increment-operations-to-make-array-beautiful/[2919. Minimum Increment Operations to Make Array Beautiful^] //|{source_base_url}/_2919_MinimumIncrementOperationsToMakeArrayBeautiful.java[Java] //|{doc_base_url}/2919-minimum-increment-operations-to-make-array-beautiful.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-points-after-collecting-coins-from-all-nodes/[2920. Maximum Points After Collecting Coins From All Nodes^] //|{source_base_url}/_2920_MaximumPointsAfterCollectingCoinsFromAllNodes.java[Java] //|{doc_base_url}/2920-maximum-points-after-collecting-coins-from-all-nodes.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/maximum-profitable-triplets-with-increasing-prices-ii/[2921. Maximum Profitable Triplets With Increasing Prices II^] //|{source_base_url}/_2921_MaximumProfitableTripletsWithIncreasingPricesIi.java[Java] //|{doc_base_url}/2921-maximum-profitable-triplets-with-increasing-prices-ii.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/market-analysis-iii/[2922. Market Analysis III^] //|{source_base_url}/_2922_MarketAnalysisIii.java[Java] //|{doc_base_url}/2922-market-analysis-iii.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-champion-i/[2923. Find Champion I^] //|{source_base_url}/_2923_FindChampionI.java[Java] //|{doc_base_url}/2923-find-champion-i.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/find-champion-ii/[2924. Find Champion II^] //|{source_base_url}/_2924_FindChampionIi.java[Java] //|{doc_base_url}/2924-find-champion-ii.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-score-after-applying-operations-on-a-tree/[2925. Maximum Score After Applying Operations on a Tree^] //|{source_base_url}/_2925_MaximumScoreAfterApplyingOperationsOnATree.java[Java] //|{doc_base_url}/2925-maximum-score-after-applying-operations-on-a-tree.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-balanced-subsequence-sum/[2926. Maximum Balanced Subsequence Sum^] //|{source_base_url}/_2926_MaximumBalancedSubsequenceSum.java[Java] //|{doc_base_url}/2926-maximum-balanced-subsequence-sum.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/distribute-candies-among-children-iii/[2927. Distribute Candies Among Children III^] //|{source_base_url}/_2927_DistributeCandiesAmongChildrenIii.java[Java] //|{doc_base_url}/2927-distribute-candies-among-children-iii.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/distribute-candies-among-children-i/[2928. Distribute Candies Among Children I^] //|{source_base_url}/_2928_DistributeCandiesAmongChildrenI.java[Java] //|{doc_base_url}/2928-distribute-candies-among-children-i.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/distribute-candies-among-children-ii/[2929. Distribute Candies Among Children II^] //|{source_base_url}/_2929_DistributeCandiesAmongChildrenIi.java[Java] //|{doc_base_url}/2929-distribute-candies-among-children-ii.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/number-of-strings-which-can-be-rearranged-to-contain-substring/[2930. Number of Strings Which Can Be Rearranged to Contain Substring^] //|{source_base_url}/_2930_NumberOfStringsWhichCanBeRearrangedToContainSubstring.java[Java] //|{doc_base_url}/2930-number-of-strings-which-can-be-rearranged-to-contain-substring.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-spending-after-buying-items/[2931. Maximum Spending After Buying Items^] //|{source_base_url}/_2931_MaximumSpendingAfterBuyingItems.java[Java] //|{doc_base_url}/2931-maximum-spending-after-buying-items.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/maximum-strong-pair-xor-i/[2932. Maximum Strong Pair XOR I^] //|{source_base_url}/_2932_MaximumStrongPairXorI.java[Java] //|{doc_base_url}/2932-maximum-strong-pair-xor-i.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/high-access-employees/[2933. High-Access Employees^] //|{source_base_url}/_2933_HighAccessEmployees.java[Java] //|{doc_base_url}/2933-high-access-employees.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-operations-to-maximize-last-elements-in-arrays/[2934. Minimum Operations to Maximize Last Elements in Arrays^] //|{source_base_url}/_2934_MinimumOperationsToMaximizeLastElementsInArrays.java[Java] //|{doc_base_url}/2934-minimum-operations-to-maximize-last-elements-in-arrays.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-strong-pair-xor-ii/[2935. Maximum Strong Pair XOR II^] //|{source_base_url}/_2935_MaximumStrongPairXorIi.java[Java] //|{doc_base_url}/2935-maximum-strong-pair-xor-ii.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/number-of-equal-numbers-blocks/[2936. Number of Equal Numbers Blocks^] //|{source_base_url}/_2936_NumberOfEqualNumbersBlocks.java[Java] //|{doc_base_url}/2936-number-of-equal-numbers-blocks.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/make-three-strings-equal/[2937. Make Three Strings Equal^] //|{source_base_url}/_2937_MakeThreeStringsEqual.java[Java] //|{doc_base_url}/2937-make-three-strings-equal.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/separate-black-and-white-balls/[2938. Separate Black and White Balls^] //|{source_base_url}/_2938_SeparateBlackAndWhiteBalls.java[Java] //|{doc_base_url}/2938-separate-black-and-white-balls.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-xor-product/[2939. Maximum Xor Product^] //|{source_base_url}/_2939_MaximumXorProduct.java[Java] //|{doc_base_url}/2939-maximum-xor-product.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-building-where-alice-and-bob-can-meet/[2940. Find Building Where Alice and Bob Can Meet^] //|{source_base_url}/_2940_FindBuildingWhereAliceAndBobCanMeet.java[Java] //|{doc_base_url}/2940-find-building-where-alice-and-bob-can-meet.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/maximum-gcd-sum-of-a-subarray/[2941. Maximum GCD-Sum of a Subarray^] //|{source_base_url}/_2941_MaximumGcdSumOfASubarray.java[Java] //|{doc_base_url}/2941-maximum-gcd-sum-of-a-subarray.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/find-words-containing-character/[2942. Find Words Containing Character^] //|{source_base_url}/_2942_FindWordsContainingCharacter.java[Java] //|{doc_base_url}/2942-find-words-containing-character.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/maximize-area-of-square-hole-in-grid/[2943. Maximize Area of Square Hole in Grid^] //|{source_base_url}/_2943_MaximizeAreaOfSquareHoleInGrid.java[Java] //|{doc_base_url}/2943-maximize-area-of-square-hole-in-grid.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-number-of-coins-for-fruits/[2944. Minimum Number of Coins for Fruits^] //|{source_base_url}/_2944_MinimumNumberOfCoinsForFruits.java[Java] //|{doc_base_url}/2944-minimum-number-of-coins-for-fruits.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-maximum-non-decreasing-array-length/[2945. Find Maximum Non-decreasing Array Length^] //|{source_base_url}/_2945_FindMaximumNonDecreasingArrayLength.java[Java] //|{doc_base_url}/2945-find-maximum-non-decreasing-array-length.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/matrix-similarity-after-cyclic-shifts/[2946. Matrix Similarity After Cyclic Shifts^] //|{source_base_url}/_2946_MatrixSimilarityAfterCyclicShifts.java[Java] //|{doc_base_url}/2946-matrix-similarity-after-cyclic-shifts.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/count-beautiful-substrings-i/[2947. Count Beautiful Substrings I^] //|{source_base_url}/_2947_CountBeautifulSubstringsI.java[Java] //|{doc_base_url}/2947-count-beautiful-substrings-i.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/make-lexicographically-smallest-array-by-swapping-elements/[2948. Make Lexicographically Smallest Array by Swapping Elements^] //|{source_base_url}/_2948_MakeLexicographicallySmallestArrayBySwappingElements.java[Java] //|{doc_base_url}/2948-make-lexicographically-smallest-array-by-swapping-elements.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-beautiful-substrings-ii/[2949. Count Beautiful Substrings II^] //|{source_base_url}/_2949_CountBeautifulSubstringsIi.java[Java] //|{doc_base_url}/2949-count-beautiful-substrings-ii.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/number-of-divisible-substrings/[2950. Number of Divisible Substrings^] //|{source_base_url}/_2950_NumberOfDivisibleSubstrings.java[Java] //|{doc_base_url}/2950-number-of-divisible-substrings.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-the-peaks/[2951. Find the Peaks^] //|{source_base_url}/_2951_FindThePeaks.java[Java] //|{doc_base_url}/2951-find-the-peaks.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/minimum-number-of-coins-to-be-added/[2952. Minimum Number of Coins to be Added^] //|{source_base_url}/_2952_MinimumNumberOfCoinsToBeAdded.java[Java] //|{doc_base_url}/2952-minimum-number-of-coins-to-be-added.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-complete-substrings/[2953. Count Complete Substrings^] //|{source_base_url}/_2953_CountCompleteSubstrings.java[Java] //|{doc_base_url}/2953-count-complete-substrings.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/count-the-number-of-infection-sequences/[2954. Count the Number of Infection Sequences^] //|{source_base_url}/_2954_CountTheNumberOfInfectionSequences.java[Java] //|{doc_base_url}/2954-count-the-number-of-infection-sequences.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/number-of-same-end-substrings/[2955. Number of Same-End Substrings^] //|{source_base_url}/_2955_NumberOfSameEndSubstrings.java[Java] //|{doc_base_url}/2955-number-of-same-end-substrings.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-common-elements-between-two-arrays/[2956. Find Common Elements Between Two Arrays^] //|{source_base_url}/_2956_FindCommonElementsBetweenTwoArrays.java[Java] //|{doc_base_url}/2956-find-common-elements-between-two-arrays.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/remove-adjacent-almost-equal-characters/[2957. Remove Adjacent Almost-Equal Characters^] //|{source_base_url}/_2957_RemoveAdjacentAlmostEqualCharacters.java[Java] //|{doc_base_url}/2957-remove-adjacent-almost-equal-characters.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/length-of-longest-subarray-with-at-most-k-frequency/[2958. Length of Longest Subarray With at Most K Frequency^] //|{source_base_url}/_2958_LengthOfLongestSubarrayWithAtMostKFrequency.java[Java] //|{doc_base_url}/2958-length-of-longest-subarray-with-at-most-k-frequency.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/number-of-possible-sets-of-closing-branches/[2959. Number of Possible Sets of Closing Branches^] //|{source_base_url}/_2959_NumberOfPossibleSetsOfClosingBranches.java[Java] //|{doc_base_url}/2959-number-of-possible-sets-of-closing-branches.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/count-tested-devices-after-test-operations/[2960. Count Tested Devices After Test Operations^] //|{source_base_url}/_2960_CountTestedDevicesAfterTestOperations.java[Java] //|{doc_base_url}/2960-count-tested-devices-after-test-operations.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/double-modular-exponentiation/[2961. Double Modular Exponentiation^] //|{source_base_url}/_2961_DoubleModularExponentiation.java[Java] //|{doc_base_url}/2961-double-modular-exponentiation.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-subarrays-where-max-element-appears-at-least-k-times/[2962. Count Subarrays Where Max Element Appears at Least K Times^] //|{source_base_url}/_2962_CountSubarraysWhereMaxElementAppearsAtLeastKTimes.java[Java] //|{doc_base_url}/2962-count-subarrays-where-max-element-appears-at-least-k-times.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-the-number-of-good-partitions/[2963. Count the Number of Good Partitions^] //|{source_base_url}/_2963_CountTheNumberOfGoodPartitions.java[Java] //|{doc_base_url}/2963-count-the-number-of-good-partitions.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/number-of-divisible-triplet-sums/[2964. Number of Divisible Triplet Sums^] //|{source_base_url}/_2964_NumberOfDivisibleTripletSums.java[Java] //|{doc_base_url}/2964-number-of-divisible-triplet-sums.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-missing-and-repeated-values/[2965. Find Missing and Repeated Values^] //|{source_base_url}/_2965_FindMissingAndRepeatedValues.java[Java] //|{doc_base_url}/2965-find-missing-and-repeated-values.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/divide-array-into-arrays-with-max-difference/[2966. Divide Array Into Arrays With Max Difference^] //|{source_base_url}/_2966_DivideArrayIntoArraysWithMaxDifference.java[Java] //|{doc_base_url}/2966-divide-array-into-arrays-with-max-difference.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-cost-to-make-array-equalindromic/[2967. Minimum Cost to Make Array Equalindromic^] //|{source_base_url}/_2967_MinimumCostToMakeArrayEqualindromic.java[Java] //|{doc_base_url}/2967-minimum-cost-to-make-array-equalindromic.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/apply-operations-to-maximize-frequency-score/[2968. Apply Operations to Maximize Frequency Score^] //|{source_base_url}/_2968_ApplyOperationsToMaximizeFrequencyScore.java[Java] //|{doc_base_url}/2968-apply-operations-to-maximize-frequency-score.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/minimum-number-of-coins-for-fruits-ii/[2969. Minimum Number of Coins for Fruits II^] //|{source_base_url}/_2969_MinimumNumberOfCoinsForFruitsIi.java[Java] //|{doc_base_url}/2969-minimum-number-of-coins-for-fruits-ii.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/count-the-number-of-incremovable-subarrays-i/[2970. Count the Number of Incremovable Subarrays I^] //|{source_base_url}/_2970_CountTheNumberOfIncremovableSubarraysI.java[Java] //|{doc_base_url}/2970-count-the-number-of-incremovable-subarrays-i.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/find-polygon-with-the-largest-perimeter/[2971. Find Polygon With the Largest Perimeter^] //|{source_base_url}/_2971_FindPolygonWithTheLargestPerimeter.java[Java] //|{doc_base_url}/2971-find-polygon-with-the-largest-perimeter.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-the-number-of-incremovable-subarrays-ii/[2972. Count the Number of Incremovable Subarrays II^] //|{source_base_url}/_2972_CountTheNumberOfIncremovableSubarraysIi.java[Java] //|{doc_base_url}/2972-count-the-number-of-incremovable-subarrays-ii.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/find-number-of-coins-to-place-in-tree-nodes/[2973. Find Number of Coins to Place in Tree Nodes^] //|{source_base_url}/_2973_FindNumberOfCoinsToPlaceInTreeNodes.java[Java] //|{doc_base_url}/2973-find-number-of-coins-to-place-in-tree-nodes.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/minimum-number-game/[2974. Minimum Number Game^] //|{source_base_url}/_2974_MinimumNumberGame.java[Java] //|{doc_base_url}/2974-minimum-number-game.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/maximum-square-area-by-removing-fences-from-a-field/[2975. Maximum Square Area by Removing Fences From a Field^] //|{source_base_url}/_2975_MaximumSquareAreaByRemovingFencesFromAField.java[Java] //|{doc_base_url}/2975-maximum-square-area-by-removing-fences-from-a-field.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-cost-to-convert-string-i/[2976. Minimum Cost to Convert String I^] //|{source_base_url}/_2976_MinimumCostToConvertStringI.java[Java] //|{doc_base_url}/2976-minimum-cost-to-convert-string-i.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-cost-to-convert-string-ii/[2977. Minimum Cost to Convert String II^] //|{source_base_url}/_2977_MinimumCostToConvertStringIi.java[Java] //|{doc_base_url}/2977-minimum-cost-to-convert-string-ii.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/symmetric-coordinates/[2978. Symmetric Coordinates^] //|{source_base_url}/_2978_SymmetricCoordinates.java[Java] //|{doc_base_url}/2978-symmetric-coordinates.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/most-expensive-item-that-can-not-be-bought/[2979. Most Expensive Item That Can Not Be Bought^] //|{source_base_url}/_2979_MostExpensiveItemThatCanNotBeBought.java[Java] //|{doc_base_url}/2979-most-expensive-item-that-can-not-be-bought.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/check-if-bitwise-or-has-trailing-zeros/[2980. Check if Bitwise OR Has Trailing Zeros^] //|{source_base_url}/_2980_CheckIfBitwiseOrHasTrailingZeros.java[Java] //|{doc_base_url}/2980-check-if-bitwise-or-has-trailing-zeros.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/find-longest-special-substring-that-occurs-thrice-i/[2981. Find Longest Special Substring That Occurs Thrice I^] //|{source_base_url}/_2981_FindLongestSpecialSubstringThatOccursThriceI.java[Java] //|{doc_base_url}/2981-find-longest-special-substring-that-occurs-thrice-i.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-longest-special-substring-that-occurs-thrice-ii/[2982. Find Longest Special Substring That Occurs Thrice II^] //|{source_base_url}/_2982_FindLongestSpecialSubstringThatOccursThriceIi.java[Java] //|{doc_base_url}/2982-find-longest-special-substring-that-occurs-thrice-ii.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/palindrome-rearrangement-queries/[2983. Palindrome Rearrangement Queries^] //|{source_base_url}/_2983_PalindromeRearrangementQueries.java[Java] //|{doc_base_url}/2983-palindrome-rearrangement-queries.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/find-peak-calling-hours-for-each-city/[2984. Find Peak Calling Hours for Each City^] //|{source_base_url}/_2984_FindPeakCallingHoursForEachCity.java[Java] //|{doc_base_url}/2984-find-peak-calling-hours-for-each-city.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/calculate-compressed-mean/[2985. Calculate Compressed Mean^] //|{source_base_url}/_2985_CalculateCompressedMean.java[Java] //|{doc_base_url}/2985-calculate-compressed-mean.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/find-third-transaction/[2986. Find Third Transaction^] //|{source_base_url}/_2986_FindThirdTransaction.java[Java] //|{doc_base_url}/2986-find-third-transaction.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-expensive-cities/[2987. Find Expensive Cities^] //|{source_base_url}/_2987_FindExpensiveCities.java[Java] //|{doc_base_url}/2987-find-expensive-cities.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/manager-of-the-largest-department/[2988. Manager of the Largest Department^] //|{source_base_url}/_2988_ManagerOfTheLargestDepartment.java[Java] //|{doc_base_url}/2988-manager-of-the-largest-department.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/class-performance/[2989. Class Performance^] //|{source_base_url}/_2989_ClassPerformance.java[Java] //|{doc_base_url}/2989-class-performance.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/loan-types/[2990. Loan Types^] //|{source_base_url}/_2990_LoanTypes.java[Java] //|{doc_base_url}/2990-loan-types.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/top-three-wineries/[2991. Top Three Wineries ^] //|{source_base_url}/_2991_TopThreeWineries.java[Java] //|{doc_base_url}/2991-top-three-wineries.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/number-of-self-divisible-permutations/[2992. Number of Self-Divisible Permutations^] //|{source_base_url}/_2992_NumberOfSelfDivisiblePermutations.java[Java] //|{doc_base_url}/2992-number-of-self-divisible-permutations.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/friday-purchases-i/[2993. Friday Purchases I^] //|{source_base_url}/_2993_FridayPurchasesI.java[Java] //|{doc_base_url}/2993-friday-purchases-i.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/friday-purchases-ii/[2994. Friday Purchases II ^] //|{source_base_url}/_2994_FridayPurchasesIi.java[Java] //|{doc_base_url}/2994-friday-purchases-ii.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/viewers-turned-streamers/[2995. Viewers Turned Streamers^] //|{source_base_url}/_2995_ViewersTurnedStreamers.java[Java] //|{doc_base_url}/2995-viewers-turned-streamers.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/smallest-missing-integer-greater-than-sequential-prefix-sum/[2996. Smallest Missing Integer Greater Than Sequential Prefix Sum^] //|{source_base_url}/_2996_SmallestMissingIntegerGreaterThanSequentialPrefixSum.java[Java] //|{doc_base_url}/2996-smallest-missing-integer-greater-than-sequential-prefix-sum.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/minimum-number-of-operations-to-make-array-xor-equal-to-k/[2997. Minimum Number of Operations to Make Array XOR Equal to K^] //|{source_base_url}/_2997_MinimumNumberOfOperationsToMakeArrayXorEqualToK.java[Java] //|{doc_base_url}/2997-minimum-number-of-operations-to-make-array-xor-equal-to-k.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-number-of-operations-to-make-x-and-y-equal/[2998. Minimum Number of Operations to Make X and Y Equal^] //|{source_base_url}/_2998_MinimumNumberOfOperationsToMakeXAndYEqual.java[Java] //|{doc_base_url}/2998-minimum-number-of-operations-to-make-x-and-y-equal.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-the-number-of-powerful-integers/[2999. Count the Number of Powerful Integers^] //|{source_base_url}/_2999_CountTheNumberOfPowerfulIntegers.java[Java] //|{doc_base_url}/2999-count-the-number-of-powerful-integers.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/maximum-area-of-longest-diagonal-rectangle/[3000. Maximum Area of Longest Diagonal Rectangle^] //|{source_base_url}/_3000_MaximumAreaOfLongestDiagonalRectangle.java[Java] //|{doc_base_url}/3000-maximum-area-of-longest-diagonal-rectangle.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/minimum-moves-to-capture-the-queen/[3001. Minimum Moves to Capture The Queen^] //|{source_base_url}/_3001_MinimumMovesToCaptureTheQueen.java[Java] //|{doc_base_url}/3001-minimum-moves-to-capture-the-queen.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-size-of-a-set-after-removals/[3002. Maximum Size of a Set After Removals^] //|{source_base_url}/_3002_MaximumSizeOfASetAfterRemovals.java[Java] //|{doc_base_url}/3002-maximum-size-of-a-set-after-removals.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximize-the-number-of-partitions-after-operations/[3003. Maximize the Number of Partitions After Operations^] //|{source_base_url}/_3003_MaximizeTheNumberOfPartitionsAfterOperations.java[Java] //|{doc_base_url}/3003-maximize-the-number-of-partitions-after-operations.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/maximum-subtree-of-the-same-color/[3004. Maximum Subtree of the Same Color^] //|{source_base_url}/_3004_MaximumSubtreeOfTheSameColor.java[Java] //|{doc_base_url}/3004-maximum-subtree-of-the-same-color.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-elements-with-maximum-frequency/[3005. Count Elements With Maximum Frequency^] //|{source_base_url}/_3005_CountElementsWithMaximumFrequency.java[Java] //|{doc_base_url}/3005-count-elements-with-maximum-frequency.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/find-beautiful-indices-in-the-given-array-i/[3006. Find Beautiful Indices in the Given Array I^] //|{source_base_url}/_3006_FindBeautifulIndicesInTheGivenArrayI.java[Java] //|{doc_base_url}/3006-find-beautiful-indices-in-the-given-array-i.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-number-that-sum-of-the-prices-is-less-than-or-equal-to-k/[3007. Maximum Number That Sum of the Prices Is Less Than or Equal to K^] //|{source_base_url}/_3007_MaximumNumberThatSumOfThePricesIsLessThanOrEqualToK.java[Java] //|{doc_base_url}/3007-maximum-number-that-sum-of-the-prices-is-less-than-or-equal-to-k.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-beautiful-indices-in-the-given-array-ii/[3008. Find Beautiful Indices in the Given Array II^] //|{source_base_url}/_3008_FindBeautifulIndicesInTheGivenArrayIi.java[Java] //|{doc_base_url}/3008-find-beautiful-indices-in-the-given-array-ii.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/maximum-number-of-intersections-on-the-chart/[3009. Maximum Number of Intersections on the Chart^] //|{source_base_url}/_3009_MaximumNumberOfIntersectionsOnTheChart.java[Java] //|{doc_base_url}/3009-maximum-number-of-intersections-on-the-chart.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/divide-an-array-into-subarrays-with-minimum-cost-i/[3010. Divide an Array Into Subarrays With Minimum Cost I^] //|{source_base_url}/_3010_DivideAnArrayIntoSubarraysWithMinimumCostI.java[Java] //|{doc_base_url}/3010-divide-an-array-into-subarrays-with-minimum-cost-i.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/find-if-array-can-be-sorted/[3011. Find if Array Can Be Sorted^] //|{source_base_url}/_3011_FindIfArrayCanBeSorted.java[Java] //|{doc_base_url}/3011-find-if-array-can-be-sorted.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimize-length-of-array-using-operations/[3012. Minimize Length of Array Using Operations^] //|{source_base_url}/_3012_MinimizeLengthOfArrayUsingOperations.java[Java] //|{doc_base_url}/3012-minimize-length-of-array-using-operations.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/divide-an-array-into-subarrays-with-minimum-cost-ii/[3013. Divide an Array Into Subarrays With Minimum Cost II^] //|{source_base_url}/_3013_DivideAnArrayIntoSubarraysWithMinimumCostIi.java[Java] //|{doc_base_url}/3013-divide-an-array-into-subarrays-with-minimum-cost-ii.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/minimum-number-of-pushes-to-type-word-i/[3014. Minimum Number of Pushes to Type Word I^] //|{source_base_url}/_3014_MinimumNumberOfPushesToTypeWordI.java[Java] //|{doc_base_url}/3014-minimum-number-of-pushes-to-type-word-i.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/count-the-number-of-houses-at-a-certain-distance-i/[3015. Count the Number of Houses at a Certain Distance I^] //|{source_base_url}/_3015_CountTheNumberOfHousesAtACertainDistanceI.java[Java] //|{doc_base_url}/3015-count-the-number-of-houses-at-a-certain-distance-i.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-number-of-pushes-to-type-word-ii/[3016. Minimum Number of Pushes to Type Word II^] //|{source_base_url}/_3016_MinimumNumberOfPushesToTypeWordIi.java[Java] //|{doc_base_url}/3016-minimum-number-of-pushes-to-type-word-ii.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-the-number-of-houses-at-a-certain-distance-ii/[3017. Count the Number of Houses at a Certain Distance II^] //|{source_base_url}/_3017_CountTheNumberOfHousesAtACertainDistanceIi.java[Java] //|{doc_base_url}/3017-count-the-number-of-houses-at-a-certain-distance-ii.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/maximum-number-of-removal-queries-that-can-be-processed-i/[3018. Maximum Number of Removal Queries That Can Be Processed I^] //|{source_base_url}/_3018_MaximumNumberOfRemovalQueriesThatCanBeProcessedI.java[Java] //|{doc_base_url}/3018-maximum-number-of-removal-queries-that-can-be-processed-i.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/number-of-changing-keys/[3019. Number of Changing Keys^] //|{source_base_url}/_3019_NumberOfChangingKeys.java[Java] //|{doc_base_url}/3019-number-of-changing-keys.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/find-the-maximum-number-of-elements-in-subset/[3020. Find the Maximum Number of Elements in Subset^] //|{source_base_url}/_3020_FindTheMaximumNumberOfElementsInSubset.java[Java] //|{doc_base_url}/3020-find-the-maximum-number-of-elements-in-subset.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/alice-and-bob-playing-flower-game/[3021. Alice and Bob Playing Flower Game^] //|{source_base_url}/_3021_AliceAndBobPlayingFlowerGame.java[Java] //|{doc_base_url}/3021-alice-and-bob-playing-flower-game.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimize-or-of-remaining-elements-using-operations/[3022. Minimize OR of Remaining Elements Using Operations^] //|{source_base_url}/_3022_MinimizeOrOfRemainingElementsUsingOperations.java[Java] //|{doc_base_url}/3022-minimize-or-of-remaining-elements-using-operations.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/find-pattern-in-infinite-stream-i/[3023. Find Pattern in Infinite Stream I^] //|{source_base_url}/_3023_FindPatternInInfiniteStreamI.java[Java] //|{doc_base_url}/3023-find-pattern-in-infinite-stream-i.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/type-of-triangle/[3024. Type of Triangle^] //|{source_base_url}/_3024_TypeOfTriangle.java[Java] //|{doc_base_url}/3024-type-of-triangle.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/find-the-number-of-ways-to-place-people-i/[3025. Find the Number of Ways to Place People I^] //|{source_base_url}/_3025_FindTheNumberOfWaysToPlacePeopleI.java[Java] //|{doc_base_url}/3025-find-the-number-of-ways-to-place-people-i.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-good-subarray-sum/[3026. Maximum Good Subarray Sum^] //|{source_base_url}/_3026_MaximumGoodSubarraySum.java[Java] //|{doc_base_url}/3026-maximum-good-subarray-sum.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-the-number-of-ways-to-place-people-ii/[3027. Find the Number of Ways to Place People II^] //|{source_base_url}/_3027_FindTheNumberOfWaysToPlacePeopleIi.java[Java] //|{doc_base_url}/3027-find-the-number-of-ways-to-place-people-ii.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/ant-on-the-boundary/[3028. Ant on the Boundary^] //|{source_base_url}/_3028_AntOnTheBoundary.java[Java] //|{doc_base_url}/3028-ant-on-the-boundary.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/minimum-time-to-revert-word-to-initial-state-i/[3029. Minimum Time to Revert Word to Initial State I^] //|{source_base_url}/_3029_MinimumTimeToRevertWordToInitialStateI.java[Java] //|{doc_base_url}/3029-minimum-time-to-revert-word-to-initial-state-i.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-the-grid-of-region-average/[3030. Find the Grid of Region Average^] //|{source_base_url}/_3030_FindTheGridOfRegionAverage.java[Java] //|{doc_base_url}/3030-find-the-grid-of-region-average.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-time-to-revert-word-to-initial-state-ii/[3031. Minimum Time to Revert Word to Initial State II^] //|{source_base_url}/_3031_MinimumTimeToRevertWordToInitialStateIi.java[Java] //|{doc_base_url}/3031-minimum-time-to-revert-word-to-initial-state-ii.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/count-numbers-with-unique-digits-ii/[3032. Count Numbers With Unique Digits II^] //|{source_base_url}/_3032_CountNumbersWithUniqueDigitsIi.java[Java] //|{doc_base_url}/3032-count-numbers-with-unique-digits-ii.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/modify-the-matrix/[3033. Modify the Matrix^] //|{source_base_url}/_3033_ModifyTheMatrix.java[Java] //|{doc_base_url}/3033-modify-the-matrix.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/number-of-subarrays-that-match-a-pattern-i/[3034. Number of Subarrays That Match a Pattern I^] //|{source_base_url}/_3034_NumberOfSubarraysThatMatchAPatternI.java[Java] //|{doc_base_url}/3034-number-of-subarrays-that-match-a-pattern-i.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-palindromes-after-operations/[3035. Maximum Palindromes After Operations^] //|{source_base_url}/_3035_MaximumPalindromesAfterOperations.java[Java] //|{doc_base_url}/3035-maximum-palindromes-after-operations.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/number-of-subarrays-that-match-a-pattern-ii/[3036. Number of Subarrays That Match a Pattern II^] //|{source_base_url}/_3036_NumberOfSubarraysThatMatchAPatternIi.java[Java] //|{doc_base_url}/3036-number-of-subarrays-that-match-a-pattern-ii.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/find-pattern-in-infinite-stream-ii/[3037. Find Pattern in Infinite Stream II^] //|{source_base_url}/_3037_FindPatternInInfiniteStreamIi.java[Java] //|{doc_base_url}/3037-find-pattern-in-infinite-stream-ii.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/maximum-number-of-operations-with-the-same-score-i/[3038. Maximum Number of Operations With the Same Score I^] //|{source_base_url}/_3038_MaximumNumberOfOperationsWithTheSameScoreI.java[Java] //|{doc_base_url}/3038-maximum-number-of-operations-with-the-same-score-i.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/apply-operations-to-make-string-empty/[3039. Apply Operations to Make String Empty^] //|{source_base_url}/_3039_ApplyOperationsToMakeStringEmpty.java[Java] //|{doc_base_url}/3039-apply-operations-to-make-string-empty.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-number-of-operations-with-the-same-score-ii/[3040. Maximum Number of Operations With the Same Score II^] //|{source_base_url}/_3040_MaximumNumberOfOperationsWithTheSameScoreIi.java[Java] //|{doc_base_url}/3040-maximum-number-of-operations-with-the-same-score-ii.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximize-consecutive-elements-in-an-array-after-modification/[3041. Maximize Consecutive Elements in an Array After Modification^] //|{source_base_url}/_3041_MaximizeConsecutiveElementsInAnArrayAfterModification.java[Java] //|{doc_base_url}/3041-maximize-consecutive-elements-in-an-array-after-modification.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/count-prefix-and-suffix-pairs-i/[3042. Count Prefix and Suffix Pairs I^] //|{source_base_url}/_3042_CountPrefixAndSuffixPairsI.java[Java] //|{doc_base_url}/3042-count-prefix-and-suffix-pairs-i.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/find-the-length-of-the-longest-common-prefix/[3043. Find the Length of the Longest Common Prefix^] //|{source_base_url}/_3043_FindTheLengthOfTheLongestCommonPrefix.java[Java] //|{doc_base_url}/3043-find-the-length-of-the-longest-common-prefix.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/most-frequent-prime/[3044. Most Frequent Prime^] //|{source_base_url}/_3044_MostFrequentPrime.java[Java] //|{doc_base_url}/3044-most-frequent-prime.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-prefix-and-suffix-pairs-ii/[3045. Count Prefix and Suffix Pairs II^] //|{source_base_url}/_3045_CountPrefixAndSuffixPairsIi.java[Java] //|{doc_base_url}/3045-count-prefix-and-suffix-pairs-ii.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/split-the-array/[3046. Split the Array^] //|{source_base_url}/_3046_SplitTheArray.java[Java] //|{doc_base_url}/3046-split-the-array.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/find-the-largest-area-of-square-inside-two-rectangles/[3047. Find the Largest Area of Square Inside Two Rectangles^] //|{source_base_url}/_3047_FindTheLargestAreaOfSquareInsideTwoRectangles.java[Java] //|{doc_base_url}/3047-find-the-largest-area-of-square-inside-two-rectangles.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/earliest-second-to-mark-indices-i/[3048. Earliest Second to Mark Indices I^] //|{source_base_url}/_3048_EarliestSecondToMarkIndicesI.java[Java] //|{doc_base_url}/3048-earliest-second-to-mark-indices-i.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/earliest-second-to-mark-indices-ii/[3049. Earliest Second to Mark Indices II^] //|{source_base_url}/_3049_EarliestSecondToMarkIndicesIi.java[Java] //|{doc_base_url}/3049-earliest-second-to-mark-indices-ii.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/pizza-toppings-cost-analysis/[3050. Pizza Toppings Cost Analysis^] //|{source_base_url}/_3050_PizzaToppingsCostAnalysis.java[Java] //|{doc_base_url}/3050-pizza-toppings-cost-analysis.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-candidates-for-data-scientist-position/[3051. Find Candidates for Data Scientist Position^] //|{source_base_url}/_3051_FindCandidatesForDataScientistPosition.java[Java] //|{doc_base_url}/3051-find-candidates-for-data-scientist-position.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/maximize-items/[3052. Maximize Items^] //|{source_base_url}/_3052_MaximizeItems.java[Java] //|{doc_base_url}/3052-maximize-items.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/classifying-triangles-by-lengths/[3053. Classifying Triangles by Lengths^] //|{source_base_url}/_3053_ClassifyingTrianglesByLengths.java[Java] //|{doc_base_url}/3053-classifying-triangles-by-lengths.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/binary-tree-nodes/[3054. Binary Tree Nodes^] //|{source_base_url}/_3054_BinaryTreeNodes.java[Java] //|{doc_base_url}/3054-binary-tree-nodes.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/top-percentile-fraud/[3055. Top Percentile Fraud^] //|{source_base_url}/_3055_TopPercentileFraud.java[Java] //|{doc_base_url}/3055-top-percentile-fraud.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/snaps-analysis/[3056. Snaps Analysis^] //|{source_base_url}/_3056_SnapsAnalysis.java[Java] //|{doc_base_url}/3056-snaps-analysis.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/employees-project-allocation/[3057. Employees Project Allocation^] //|{source_base_url}/_3057_EmployeesProjectAllocation.java[Java] //|{doc_base_url}/3057-employees-project-allocation.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/friends-with-no-mutual-friends/[3058. Friends With No Mutual Friends^] //|{source_base_url}/_3058_FriendsWithNoMutualFriends.java[Java] //|{doc_base_url}/3058-friends-with-no-mutual-friends.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-all-unique-email-domains/[3059. Find All Unique Email Domains^] //|{source_base_url}/_3059_FindAllUniqueEmailDomains.java[Java] //|{doc_base_url}/3059-find-all-unique-email-domains.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/user-activities-within-time-bounds/[3060. User Activities within Time Bounds^] //|{source_base_url}/_3060_UserActivitiesWithinTimeBounds.java[Java] //|{doc_base_url}/3060-user-activities-within-time-bounds.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/calculate-trapping-rain-water/[3061. Calculate Trapping Rain Water^] //|{source_base_url}/_3061_CalculateTrappingRainWater.java[Java] //|{doc_base_url}/3061-calculate-trapping-rain-water.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/winner-of-the-linked-list-game/[3062. Winner of the Linked List Game^] //|{source_base_url}/_3062_WinnerOfTheLinkedListGame.java[Java] //|{doc_base_url}/3062-winner-of-the-linked-list-game.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/linked-list-frequency/[3063. Linked List Frequency^] //|{source_base_url}/_3063_LinkedListFrequency.java[Java] //|{doc_base_url}/3063-linked-list-frequency.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/guess-the-number-using-bitwise-questions-i/[3064. Guess the Number Using Bitwise Questions I^] //|{source_base_url}/_3064_GuessTheNumberUsingBitwiseQuestionsI.java[Java] //|{doc_base_url}/3064-guess-the-number-using-bitwise-questions-i.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-operations-to-exceed-threshold-value-i/[3065. Minimum Operations to Exceed Threshold Value I^] //|{source_base_url}/_3065_MinimumOperationsToExceedThresholdValueI.java[Java] //|{doc_base_url}/3065-minimum-operations-to-exceed-threshold-value-i.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/minimum-operations-to-exceed-threshold-value-ii/[3066. Minimum Operations to Exceed Threshold Value II^] //|{source_base_url}/_3066_MinimumOperationsToExceedThresholdValueIi.java[Java] //|{doc_base_url}/3066-minimum-operations-to-exceed-threshold-value-ii.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-pairs-of-connectable-servers-in-a-weighted-tree-network/[3067. Count Pairs of Connectable Servers in a Weighted Tree Network^] //|{source_base_url}/_3067_CountPairsOfConnectableServersInAWeightedTreeNetwork.java[Java] //|{doc_base_url}/3067-count-pairs-of-connectable-servers-in-a-weighted-tree-network.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-the-maximum-sum-of-node-values/[3068. Find the Maximum Sum of Node Values^] //|{source_base_url}/_3068_FindTheMaximumSumOfNodeValues.java[Java] //|{doc_base_url}/3068-find-the-maximum-sum-of-node-values.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/distribute-elements-into-two-arrays-i/[3069. Distribute Elements Into Two Arrays I^] //|{source_base_url}/_3069_DistributeElementsIntoTwoArraysI.java[Java] //|{doc_base_url}/3069-distribute-elements-into-two-arrays-i.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/count-submatrices-with-top-left-element-and-sum-less-than-k/[3070. Count Submatrices with Top-Left Element and Sum Less Than k^] //|{source_base_url}/_3070_CountSubmatricesWithTopLeftElementAndSumLessThanK.java[Java] //|{doc_base_url}/3070-count-submatrices-with-top-left-element-and-sum-less-than-k.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-operations-to-write-the-letter-y-on-a-grid/[3071. Minimum Operations to Write the Letter Y on a Grid^] //|{source_base_url}/_3071_MinimumOperationsToWriteTheLetterYOnAGrid.java[Java] //|{doc_base_url}/3071-minimum-operations-to-write-the-letter-y-on-a-grid.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/distribute-elements-into-two-arrays-ii/[3072. Distribute Elements Into Two Arrays II^] //|{source_base_url}/_3072_DistributeElementsIntoTwoArraysIi.java[Java] //|{doc_base_url}/3072-distribute-elements-into-two-arrays-ii.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/maximum-increasing-triplet-value/[3073. Maximum Increasing Triplet Value^] //|{source_base_url}/_3073_MaximumIncreasingTripletValue.java[Java] //|{doc_base_url}/3073-maximum-increasing-triplet-value.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/apple-redistribution-into-boxes/[3074. Apple Redistribution into Boxes^] //|{source_base_url}/_3074_AppleRedistributionIntoBoxes.java[Java] //|{doc_base_url}/3074-apple-redistribution-into-boxes.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/maximize-happiness-of-selected-children/[3075. Maximize Happiness of Selected Children^] //|{source_base_url}/_3075_MaximizeHappinessOfSelectedChildren.java[Java] //|{doc_base_url}/3075-maximize-happiness-of-selected-children.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/shortest-uncommon-substring-in-an-array/[3076. Shortest Uncommon Substring in an Array^] //|{source_base_url}/_3076_ShortestUncommonSubstringInAnArray.java[Java] //|{doc_base_url}/3076-shortest-uncommon-substring-in-an-array.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-strength-of-k-disjoint-subarrays/[3077. Maximum Strength of K Disjoint Subarrays^] //|{source_base_url}/_3077_MaximumStrengthOfKDisjointSubarrays.java[Java] //|{doc_base_url}/3077-maximum-strength-of-k-disjoint-subarrays.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/match-alphanumerical-pattern-in-matrix-i/[3078. Match Alphanumerical Pattern in Matrix I^] //|{source_base_url}/_3078_MatchAlphanumericalPatternInMatrixI.java[Java] //|{doc_base_url}/3078-match-alphanumerical-pattern-in-matrix-i.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-the-sum-of-encrypted-integers/[3079. Find the Sum of Encrypted Integers^] //|{source_base_url}/_3079_FindTheSumOfEncryptedIntegers.java[Java] //|{doc_base_url}/3079-find-the-sum-of-encrypted-integers.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/mark-elements-on-array-by-performing-queries/[3080. Mark Elements on Array by Performing Queries^] //|{source_base_url}/_3080_MarkElementsOnArrayByPerformingQueries.java[Java] //|{doc_base_url}/3080-mark-elements-on-array-by-performing-queries.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/replace-question-marks-in-string-to-minimize-its-value/[3081. Replace Question Marks in String to Minimize Its Value^] //|{source_base_url}/_3081_ReplaceQuestionMarksInStringToMinimizeItsValue.java[Java] //|{doc_base_url}/3081-replace-question-marks-in-string-to-minimize-its-value.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-the-sum-of-the-power-of-all-subsequences/[3082. Find the Sum of the Power of All Subsequences^] //|{source_base_url}/_3082_FindTheSumOfThePowerOfAllSubsequences.java[Java] //|{doc_base_url}/3082-find-the-sum-of-the-power-of-all-subsequences.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/existence-of-a-substring-in-a-string-and-its-reverse/[3083. Existence of a Substring in a String and Its Reverse^] //|{source_base_url}/_3083_ExistenceOfASubstringInAStringAndItsReverse.java[Java] //|{doc_base_url}/3083-existence-of-a-substring-in-a-string-and-its-reverse.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/count-substrings-starting-and-ending-with-given-character/[3084. Count Substrings Starting and Ending with Given Character^] //|{source_base_url}/_3084_CountSubstringsStartingAndEndingWithGivenCharacter.java[Java] //|{doc_base_url}/3084-count-substrings-starting-and-ending-with-given-character.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-deletions-to-make-string-k-special/[3085. Minimum Deletions to Make String K-Special^] //|{source_base_url}/_3085_MinimumDeletionsToMakeStringKSpecial.java[Java] //|{doc_base_url}/3085-minimum-deletions-to-make-string-k-special.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-moves-to-pick-k-ones/[3086. Minimum Moves to Pick K Ones^] //|{source_base_url}/_3086_MinimumMovesToPickKOnes.java[Java] //|{doc_base_url}/3086-minimum-moves-to-pick-k-ones.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/find-trending-hashtags/[3087. Find Trending Hashtags^] //|{source_base_url}/_3087_FindTrendingHashtags.java[Java] //|{doc_base_url}/3087-find-trending-hashtags.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/make-string-anti-palindrome/[3088. Make String Anti-palindrome^] //|{source_base_url}/_3088_MakeStringAntiPalindrome.java[Java] //|{doc_base_url}/3088-make-string-anti-palindrome.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/find-bursty-behavior/[3089. Find Bursty Behavior^] //|{source_base_url}/_3089_FindBurstyBehavior.java[Java] //|{doc_base_url}/3089-find-bursty-behavior.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-length-substring-with-two-occurrences/[3090. Maximum Length Substring With Two Occurrences^] //|{source_base_url}/_3090_MaximumLengthSubstringWithTwoOccurrences.java[Java] //|{doc_base_url}/3090-maximum-length-substring-with-two-occurrences.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/apply-operations-to-make-sum-of-array-greater-than-or-equal-to-k/[3091. Apply Operations to Make Sum of Array Greater Than or Equal to k^] //|{source_base_url}/_3091_ApplyOperationsToMakeSumOfArrayGreaterThanOrEqualToK.java[Java] //|{doc_base_url}/3091-apply-operations-to-make-sum-of-array-greater-than-or-equal-to-k.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/most-frequent-ids/[3092. Most Frequent IDs^] //|{source_base_url}/_3092_MostFrequentIds.java[Java] //|{doc_base_url}/3092-most-frequent-ids.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/longest-common-suffix-queries/[3093. Longest Common Suffix Queries^] //|{source_base_url}/_3093_LongestCommonSuffixQueries.java[Java] //|{doc_base_url}/3093-longest-common-suffix-queries.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/guess-the-number-using-bitwise-questions-ii/[3094. Guess the Number Using Bitwise Questions II^] //|{source_base_url}/_3094_GuessTheNumberUsingBitwiseQuestionsIi.java[Java] //|{doc_base_url}/3094-guess-the-number-using-bitwise-questions-ii.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/shortest-subarray-with-or-at-least-k-i/[3095. Shortest Subarray With OR at Least K I^] //|{source_base_url}/_3095_ShortestSubarrayWithOrAtLeastKI.java[Java] //|{doc_base_url}/3095-shortest-subarray-with-or-at-least-k-i.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/minimum-levels-to-gain-more-points/[3096. Minimum Levels to Gain More Points^] //|{source_base_url}/_3096_MinimumLevelsToGainMorePoints.java[Java] //|{doc_base_url}/3096-minimum-levels-to-gain-more-points.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/shortest-subarray-with-or-at-least-k-ii/[3097. Shortest Subarray With OR at Least K II^] //|{source_base_url}/_3097_ShortestSubarrayWithOrAtLeastKIi.java[Java] //|{doc_base_url}/3097-shortest-subarray-with-or-at-least-k-ii.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-the-sum-of-subsequence-powers/[3098. Find the Sum of Subsequence Powers^] //|{source_base_url}/_3098_FindTheSumOfSubsequencePowers.java[Java] //|{doc_base_url}/3098-find-the-sum-of-subsequence-powers.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/harshad-number/[3099. Harshad Number^] //|{source_base_url}/_3099_HarshadNumber.java[Java] //|{doc_base_url}/3099-harshad-number.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/water-bottles-ii/[3100. Water Bottles II^] //|{source_base_url}/_3100_WaterBottlesIi.java[Java] //|{doc_base_url}/3100-water-bottles-ii.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-alternating-subarrays/[3101. Count Alternating Subarrays^] //|{source_base_url}/_3101_CountAlternatingSubarrays.java[Java] //|{doc_base_url}/3101-count-alternating-subarrays.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimize-manhattan-distances/[3102. Minimize Manhattan Distances^] //|{source_base_url}/_3102_MinimizeManhattanDistances.java[Java] //|{doc_base_url}/3102-minimize-manhattan-distances.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/find-trending-hashtags-ii/[3103. Find Trending Hashtags II ^] //|{source_base_url}/_3103_FindTrendingHashtagsIi.java[Java] //|{doc_base_url}/3103-find-trending-hashtags-ii.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/find-longest-self-contained-substring/[3104. Find Longest Self-Contained Substring^] //|{source_base_url}/_3104_FindLongestSelfContainedSubstring.java[Java] //|{doc_base_url}/3104-find-longest-self-contained-substring.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/longest-strictly-increasing-or-strictly-decreasing-subarray/[3105. Longest Strictly Increasing or Strictly Decreasing Subarray^] //|{source_base_url}/_3105_LongestStrictlyIncreasingOrStrictlyDecreasingSubarray.java[Java] //|{doc_base_url}/3105-longest-strictly-increasing-or-strictly-decreasing-subarray.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/lexicographically-smallest-string-after-operations-with-constraint/[3106. Lexicographically Smallest String After Operations With Constraint^] //|{source_base_url}/_3106_LexicographicallySmallestStringAfterOperationsWithConstraint.java[Java] //|{doc_base_url}/3106-lexicographically-smallest-string-after-operations-with-constraint.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-operations-to-make-median-of-array-equal-to-k/[3107. Minimum Operations to Make Median of Array Equal to K^] //|{source_base_url}/_3107_MinimumOperationsToMakeMedianOfArrayEqualToK.java[Java] //|{doc_base_url}/3107-minimum-operations-to-make-median-of-array-equal-to-k.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-cost-walk-in-weighted-graph/[3108. Minimum Cost Walk in Weighted Graph^] //|{source_base_url}/_3108_MinimumCostWalkInWeightedGraph.java[Java] //|{doc_base_url}/3108-minimum-cost-walk-in-weighted-graph.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/find-the-index-of-permutation/[3109. Find the Index of Permutation^] //|{source_base_url}/_3109_FindTheIndexOfPermutation.java[Java] //|{doc_base_url}/3109-find-the-index-of-permutation.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/score-of-a-string/[3110. Score of a String^] //|{source_base_url}/_3110_ScoreOfAString.java[Java] //|{doc_base_url}/3110-score-of-a-string.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/minimum-rectangles-to-cover-points/[3111. Minimum Rectangles to Cover Points^] //|{source_base_url}/_3111_MinimumRectanglesToCoverPoints.java[Java] //|{doc_base_url}/3111-minimum-rectangles-to-cover-points.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-time-to-visit-disappearing-nodes/[3112. Minimum Time to Visit Disappearing Nodes^] //|{source_base_url}/_3112_MinimumTimeToVisitDisappearingNodes.java[Java] //|{doc_base_url}/3112-minimum-time-to-visit-disappearing-nodes.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-the-number-of-subarrays-where-boundary-elements-are-maximum/[3113. Find the Number of Subarrays Where Boundary Elements Are Maximum^] //|{source_base_url}/_3113_FindTheNumberOfSubarraysWhereBoundaryElementsAreMaximum.java[Java] //|{doc_base_url}/3113-find-the-number-of-subarrays-where-boundary-elements-are-maximum.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/latest-time-you-can-obtain-after-replacing-characters/[3114. Latest Time You Can Obtain After Replacing Characters^] //|{source_base_url}/_3114_LatestTimeYouCanObtainAfterReplacingCharacters.java[Java] //|{doc_base_url}/3114-latest-time-you-can-obtain-after-replacing-characters.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/maximum-prime-difference/[3115. Maximum Prime Difference^] //|{source_base_url}/_3115_MaximumPrimeDifference.java[Java] //|{doc_base_url}/3115-maximum-prime-difference.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/kth-smallest-amount-with-single-denomination-combination/[3116. Kth Smallest Amount With Single Denomination Combination^] //|{source_base_url}/_3116_KthSmallestAmountWithSingleDenominationCombination.java[Java] //|{doc_base_url}/3116-kth-smallest-amount-with-single-denomination-combination.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/minimum-sum-of-values-by-dividing-array/[3117. Minimum Sum of Values by Dividing Array^] //|{source_base_url}/_3117_MinimumSumOfValuesByDividingArray.java[Java] //|{doc_base_url}/3117-minimum-sum-of-values-by-dividing-array.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/friday-purchase-iii/[3118. Friday Purchase III ^] //|{source_base_url}/_3118_FridayPurchaseIii.java[Java] //|{doc_base_url}/3118-friday-purchase-iii.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-number-of-potholes-that-can-be-fixed/[3119. Maximum Number of Potholes That Can Be Fixed^] //|{source_base_url}/_3119_MaximumNumberOfPotholesThatCanBeFixed.java[Java] //|{doc_base_url}/3119-maximum-number-of-potholes-that-can-be-fixed.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-the-number-of-special-characters-i/[3120. Count the Number of Special Characters I^] //|{source_base_url}/_3120_CountTheNumberOfSpecialCharactersI.java[Java] //|{doc_base_url}/3120-count-the-number-of-special-characters-i.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/count-the-number-of-special-characters-ii/[3121. Count the Number of Special Characters II^] //|{source_base_url}/_3121_CountTheNumberOfSpecialCharactersIi.java[Java] //|{doc_base_url}/3121-count-the-number-of-special-characters-ii.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-number-of-operations-to-satisfy-conditions/[3122. Minimum Number of Operations to Satisfy Conditions^] //|{source_base_url}/_3122_MinimumNumberOfOperationsToSatisfyConditions.java[Java] //|{doc_base_url}/3122-minimum-number-of-operations-to-satisfy-conditions.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-edges-in-shortest-paths/[3123. Find Edges in Shortest Paths^] //|{source_base_url}/_3123_FindEdgesInShortestPaths.java[Java] //|{doc_base_url}/3123-find-edges-in-shortest-paths.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/find-longest-calls/[3124. Find Longest Calls^] //|{source_base_url}/_3124_FindLongestCalls.java[Java] //|{doc_base_url}/3124-find-longest-calls.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-number-that-makes-result-of-bitwise-and-zero/[3125. Maximum Number That Makes Result of Bitwise AND Zero^] //|{source_base_url}/_3125_MaximumNumberThatMakesResultOfBitwiseAndZero.java[Java] //|{doc_base_url}/3125-maximum-number-that-makes-result-of-bitwise-and-zero.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/server-utilization-time/[3126. Server Utilization Time^] //|{source_base_url}/_3126_ServerUtilizationTime.java[Java] //|{doc_base_url}/3126-server-utilization-time.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/make-a-square-with-the-same-color/[3127. Make a Square with the Same Color^] //|{source_base_url}/_3127_MakeASquareWithTheSameColor.java[Java] //|{doc_base_url}/3127-make-a-square-with-the-same-color.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/right-triangles/[3128. Right Triangles^] //|{source_base_url}/_3128_RightTriangles.java[Java] //|{doc_base_url}/3128-right-triangles.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-all-possible-stable-binary-arrays-i/[3129. Find All Possible Stable Binary Arrays I^] //|{source_base_url}/_3129_FindAllPossibleStableBinaryArraysI.java[Java] //|{doc_base_url}/3129-find-all-possible-stable-binary-arrays-i.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-all-possible-stable-binary-arrays-ii/[3130. Find All Possible Stable Binary Arrays II^] //|{source_base_url}/_3130_FindAllPossibleStableBinaryArraysIi.java[Java] //|{doc_base_url}/3130-find-all-possible-stable-binary-arrays-ii.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/find-the-integer-added-to-array-i/[3131. Find the Integer Added to Array I^] //|{source_base_url}/_3131_FindTheIntegerAddedToArrayI.java[Java] //|{doc_base_url}/3131-find-the-integer-added-to-array-i.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/find-the-integer-added-to-array-ii/[3132. Find the Integer Added to Array II^] //|{source_base_url}/_3132_FindTheIntegerAddedToArrayIi.java[Java] //|{doc_base_url}/3132-find-the-integer-added-to-array-ii.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-array-end/[3133. Minimum Array End^] //|{source_base_url}/_3133_MinimumArrayEnd.java[Java] //|{doc_base_url}/3133-minimum-array-end.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-the-median-of-the-uniqueness-array/[3134. Find the Median of the Uniqueness Array^] //|{source_base_url}/_3134_FindTheMedianOfTheUniquenessArray.java[Java] //|{doc_base_url}/3134-find-the-median-of-the-uniqueness-array.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/equalize-strings-by-adding-or-removing-characters-at-ends/[3135. Equalize Strings by Adding or Removing Characters at Ends^] //|{source_base_url}/_3135_EqualizeStringsByAddingOrRemovingCharactersAtEnds.java[Java] //|{doc_base_url}/3135-equalize-strings-by-adding-or-removing-characters-at-ends.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/valid-word/[3136. Valid Word^] //|{source_base_url}/_3136_ValidWord.java[Java] //|{doc_base_url}/3136-valid-word.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/minimum-number-of-operations-to-make-word-k-periodic/[3137. Minimum Number of Operations to Make Word K-Periodic^] //|{source_base_url}/_3137_MinimumNumberOfOperationsToMakeWordKPeriodic.java[Java] //|{doc_base_url}/3137-minimum-number-of-operations-to-make-word-k-periodic.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-length-of-anagram-concatenation/[3138. Minimum Length of Anagram Concatenation^] //|{source_base_url}/_3138_MinimumLengthOfAnagramConcatenation.java[Java] //|{doc_base_url}/3138-minimum-length-of-anagram-concatenation.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-cost-to-equalize-array/[3139. Minimum Cost to Equalize Array^] //|{source_base_url}/_3139_MinimumCostToEqualizeArray.java[Java] //|{doc_base_url}/3139-minimum-cost-to-equalize-array.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/consecutive-available-seats-ii/[3140. Consecutive Available Seats II^] //|{source_base_url}/_3140_ConsecutiveAvailableSeatsIi.java[Java] //|{doc_base_url}/3140-consecutive-available-seats-ii.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-hamming-distances/[3141. Maximum Hamming Distances^] //|{source_base_url}/_3141_MaximumHammingDistances.java[Java] //|{doc_base_url}/3141-maximum-hamming-distances.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/check-if-grid-satisfies-conditions/[3142. Check if Grid Satisfies Conditions^] //|{source_base_url}/_3142_CheckIfGridSatisfiesConditions.java[Java] //|{doc_base_url}/3142-check-if-grid-satisfies-conditions.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/maximum-points-inside-the-square/[3143. Maximum Points Inside the Square^] //|{source_base_url}/_3143_MaximumPointsInsideTheSquare.java[Java] //|{doc_base_url}/3143-maximum-points-inside-the-square.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-substring-partition-of-equal-character-frequency/[3144. Minimum Substring Partition of Equal Character Frequency^] //|{source_base_url}/_3144_MinimumSubstringPartitionOfEqualCharacterFrequency.java[Java] //|{doc_base_url}/3144-minimum-substring-partition-of-equal-character-frequency.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-products-of-elements-of-big-array/[3145. Find Products of Elements of Big Array^] //|{source_base_url}/_3145_FindProductsOfElementsOfBigArray.java[Java] //|{doc_base_url}/3145-find-products-of-elements-of-big-array.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/permutation-difference-between-two-strings/[3146. Permutation Difference between Two Strings^] //|{source_base_url}/_3146_PermutationDifferenceBetweenTwoStrings.java[Java] //|{doc_base_url}/3146-permutation-difference-between-two-strings.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/taking-maximum-energy-from-the-mystic-dungeon/[3147. Taking Maximum Energy From the Mystic Dungeon^] //|{source_base_url}/_3147_TakingMaximumEnergyFromTheMysticDungeon.java[Java] //|{doc_base_url}/3147-taking-maximum-energy-from-the-mystic-dungeon.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-difference-score-in-a-grid/[3148. Maximum Difference Score in a Grid^] //|{source_base_url}/_3148_MaximumDifferenceScoreInAGrid.java[Java] //|{doc_base_url}/3148-maximum-difference-score-in-a-grid.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-the-minimum-cost-array-permutation/[3149. Find the Minimum Cost Array Permutation^] //|{source_base_url}/_3149_FindTheMinimumCostArrayPermutation.java[Java] //|{doc_base_url}/3149-find-the-minimum-cost-array-permutation.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/invalid-tweets-ii/[3150. Invalid Tweets II^] //|{source_base_url}/_3150_InvalidTweetsIi.java[Java] //|{doc_base_url}/3150-invalid-tweets-ii.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/special-array-i/[3151. Special Array I^] //|{source_base_url}/_3151_SpecialArrayI.java[Java] //|{doc_base_url}/3151-special-array-i.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/special-array-ii/[3152. Special Array II^] //|{source_base_url}/_3152_SpecialArrayIi.java[Java] //|{doc_base_url}/3152-special-array-ii.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/sum-of-digit-differences-of-all-pairs/[3153. Sum of Digit Differences of All Pairs^] //|{source_base_url}/_3153_SumOfDigitDifferencesOfAllPairs.java[Java] //|{doc_base_url}/3153-sum-of-digit-differences-of-all-pairs.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-number-of-ways-to-reach-the-k-th-stair/[3154. Find Number of Ways to Reach the K-th Stair^] //|{source_base_url}/_3154_FindNumberOfWaysToReachTheKThStair.java[Java] //|{doc_base_url}/3154-find-number-of-ways-to-reach-the-k-th-stair.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/maximum-number-of-upgradable-servers/[3155. Maximum Number of Upgradable Servers^] //|{source_base_url}/_3155_MaximumNumberOfUpgradableServers.java[Java] //|{doc_base_url}/3155-maximum-number-of-upgradable-servers.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/employee-task-duration-and-concurrent-tasks/[3156. Employee Task Duration and Concurrent Tasks^] //|{source_base_url}/_3156_EmployeeTaskDurationAndConcurrentTasks.java[Java] //|{doc_base_url}/3156-employee-task-duration-and-concurrent-tasks.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/find-the-level-of-tree-with-minimum-sum/[3157. Find the Level of Tree with Minimum Sum^] //|{source_base_url}/_3157_FindTheLevelOfTreeWithMinimumSum.java[Java] //|{doc_base_url}/3157-find-the-level-of-tree-with-minimum-sum.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-the-xor-of-numbers-which-appear-twice/[3158. Find the XOR of Numbers Which Appear Twice^] //|{source_base_url}/_3158_FindTheXorOfNumbersWhichAppearTwice.java[Java] //|{doc_base_url}/3158-find-the-xor-of-numbers-which-appear-twice.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/find-occurrences-of-an-element-in-an-array/[3159. Find Occurrences of an Element in an Array^] //|{source_base_url}/_3159_FindOccurrencesOfAnElementInAnArray.java[Java] //|{doc_base_url}/3159-find-occurrences-of-an-element-in-an-array.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-the-number-of-distinct-colors-among-the-balls/[3160. Find the Number of Distinct Colors Among the Balls^] //|{source_base_url}/_3160_FindTheNumberOfDistinctColorsAmongTheBalls.java[Java] //|{doc_base_url}/3160-find-the-number-of-distinct-colors-among-the-balls.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/block-placement-queries/[3161. Block Placement Queries^] //|{source_base_url}/_3161_BlockPlacementQueries.java[Java] //|{doc_base_url}/3161-block-placement-queries.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/find-the-number-of-good-pairs-i/[3162. Find the Number of Good Pairs I^] //|{source_base_url}/_3162_FindTheNumberOfGoodPairsI.java[Java] //|{doc_base_url}/3162-find-the-number-of-good-pairs-i.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/string-compression-iii/[3163. String Compression III^] //|{source_base_url}/_3163_StringCompressionIii.java[Java] //|{doc_base_url}/3163-string-compression-iii.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-the-number-of-good-pairs-ii/[3164. Find the Number of Good Pairs II^] //|{source_base_url}/_3164_FindTheNumberOfGoodPairsIi.java[Java] //|{doc_base_url}/3164-find-the-number-of-good-pairs-ii.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-sum-of-subsequence-with-non-adjacent-elements/[3165. Maximum Sum of Subsequence With Non-adjacent Elements^] //|{source_base_url}/_3165_MaximumSumOfSubsequenceWithNonAdjacentElements.java[Java] //|{doc_base_url}/3165-maximum-sum-of-subsequence-with-non-adjacent-elements.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/calculate-parking-fees-and-duration/[3166. Calculate Parking Fees and Duration^] //|{source_base_url}/_3166_CalculateParkingFeesAndDuration.java[Java] //|{doc_base_url}/3166-calculate-parking-fees-and-duration.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/better-compression-of-string/[3167. Better Compression of String^] //|{source_base_url}/_3167_BetterCompressionOfString.java[Java] //|{doc_base_url}/3167-better-compression-of-string.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-number-of-chairs-in-a-waiting-room/[3168. Minimum Number of Chairs in a Waiting Room^] //|{source_base_url}/_3168_MinimumNumberOfChairsInAWaitingRoom.java[Java] //|{doc_base_url}/3168-minimum-number-of-chairs-in-a-waiting-room.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/count-days-without-meetings/[3169. Count Days Without Meetings^] //|{source_base_url}/_3169_CountDaysWithoutMeetings.java[Java] //|{doc_base_url}/3169-count-days-without-meetings.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/lexicographically-minimum-string-after-removing-stars/[3170. Lexicographically Minimum String After Removing Stars^] //|{source_base_url}/_3170_LexicographicallyMinimumStringAfterRemovingStars.java[Java] //|{doc_base_url}/3170-lexicographically-minimum-string-after-removing-stars.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-subarray-with-bitwise-or-closest-to-k/[3171. Find Subarray With Bitwise OR Closest to K^] //|{source_base_url}/_3171_FindSubarrayWithBitwiseOrClosestToK.java[Java] //|{doc_base_url}/3171-find-subarray-with-bitwise-or-closest-to-k.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/second-day-verification/[3172. Second Day Verification^] //|{source_base_url}/_3172_SecondDayVerification.java[Java] //|{doc_base_url}/3172-second-day-verification.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/bitwise-or-of-adjacent-elements/[3173. Bitwise OR of Adjacent Elements^] //|{source_base_url}/_3173_BitwiseOrOfAdjacentElements.java[Java] //|{doc_base_url}/3173-bitwise-or-of-adjacent-elements.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/clear-digits/[3174. Clear Digits^] //|{source_base_url}/_3174_ClearDigits.java[Java] //|{doc_base_url}/3174-clear-digits.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/find-the-first-player-to-win-k-games-in-a-row/[3175. Find The First Player to win K Games in a Row^] //|{source_base_url}/_3175_FindTheFirstPlayerToWinKGamesInARow.java[Java] //|{doc_base_url}/3175-find-the-first-player-to-win-k-games-in-a-row.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-the-maximum-length-of-a-good-subsequence-i/[3176. Find the Maximum Length of a Good Subsequence I^] //|{source_base_url}/_3176_FindTheMaximumLengthOfAGoodSubsequenceI.java[Java] //|{doc_base_url}/3176-find-the-maximum-length-of-a-good-subsequence-i.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-the-maximum-length-of-a-good-subsequence-ii/[3177. Find the Maximum Length of a Good Subsequence II^] //|{source_base_url}/_3177_FindTheMaximumLengthOfAGoodSubsequenceIi.java[Java] //|{doc_base_url}/3177-find-the-maximum-length-of-a-good-subsequence-ii.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/find-the-child-who-has-the-ball-after-k-seconds/[3178. Find the Child Who Has the Ball After K Seconds^] //|{source_base_url}/_3178_FindTheChildWhoHasTheBallAfterKSeconds.java[Java] //|{doc_base_url}/3178-find-the-child-who-has-the-ball-after-k-seconds.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/find-the-n-th-value-after-k-seconds/[3179. Find the N-th Value After K Seconds^] //|{source_base_url}/_3179_FindTheNThValueAfterKSeconds.java[Java] //|{doc_base_url}/3179-find-the-n-th-value-after-k-seconds.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-total-reward-using-operations-i/[3180. Maximum Total Reward Using Operations I^] //|{source_base_url}/_3180_MaximumTotalRewardUsingOperationsI.java[Java] //|{doc_base_url}/3180-maximum-total-reward-using-operations-i.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-total-reward-using-operations-ii/[3181. Maximum Total Reward Using Operations II^] //|{source_base_url}/_3181_MaximumTotalRewardUsingOperationsIi.java[Java] //|{doc_base_url}/3181-maximum-total-reward-using-operations-ii.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/find-top-scoring-students/[3182. Find Top Scoring Students^] //|{source_base_url}/_3182_FindTopScoringStudents.java[Java] //|{doc_base_url}/3182-find-top-scoring-students.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/the-number-of-ways-to-make-the-sum/[3183. The Number of Ways to Make the Sum^] //|{source_base_url}/_3183_TheNumberOfWaysToMakeTheSum.java[Java] //|{doc_base_url}/3183-the-number-of-ways-to-make-the-sum.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-pairs-that-form-a-complete-day-i/[3184. Count Pairs That Form a Complete Day I^] //|{source_base_url}/_3184_CountPairsThatFormACompleteDayI.java[Java] //|{doc_base_url}/3184-count-pairs-that-form-a-complete-day-i.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/count-pairs-that-form-a-complete-day-ii/[3185. Count Pairs That Form a Complete Day II^] //|{source_base_url}/_3185_CountPairsThatFormACompleteDayIi.java[Java] //|{doc_base_url}/3185-count-pairs-that-form-a-complete-day-ii.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-total-damage-with-spell-casting/[3186. Maximum Total Damage With Spell Casting^] //|{source_base_url}/_3186_MaximumTotalDamageWithSpellCasting.java[Java] //|{doc_base_url}/3186-maximum-total-damage-with-spell-casting.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/peaks-in-array/[3187. Peaks in Array^] //|{source_base_url}/_3187_PeaksInArray.java[Java] //|{doc_base_url}/3187-peaks-in-array.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/find-top-scoring-students-ii/[3188. Find Top Scoring Students II^] //|{source_base_url}/_3188_FindTopScoringStudentsIi.java[Java] //|{doc_base_url}/3188-find-top-scoring-students-ii.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/minimum-moves-to-get-a-peaceful-board/[3189. Minimum Moves to Get a Peaceful Board^] //|{source_base_url}/_3189_MinimumMovesToGetAPeacefulBoard.java[Java] //|{doc_base_url}/3189-minimum-moves-to-get-a-peaceful-board.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-minimum-operations-to-make-all-elements-divisible-by-three/[3190. Find Minimum Operations to Make All Elements Divisible by Three^] //|{source_base_url}/_3190_FindMinimumOperationsToMakeAllElementsDivisibleByThree.java[Java] //|{doc_base_url}/3190-find-minimum-operations-to-make-all-elements-divisible-by-three.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/minimum-operations-to-make-binary-array-elements-equal-to-one-i/[3191. Minimum Operations to Make Binary Array Elements Equal to One I^] //|{source_base_url}/_3191_MinimumOperationsToMakeBinaryArrayElementsEqualToOneI.java[Java] //|{doc_base_url}/3191-minimum-operations-to-make-binary-array-elements-equal-to-one-i.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-operations-to-make-binary-array-elements-equal-to-one-ii/[3192. Minimum Operations to Make Binary Array Elements Equal to One II^] //|{source_base_url}/_3192_MinimumOperationsToMakeBinaryArrayElementsEqualToOneIi.java[Java] //|{doc_base_url}/3192-minimum-operations-to-make-binary-array-elements-equal-to-one-ii.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-the-number-of-inversions/[3193. Count the Number of Inversions^] //|{source_base_url}/_3193_CountTheNumberOfInversions.java[Java] //|{doc_base_url}/3193-count-the-number-of-inversions.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/minimum-average-of-smallest-and-largest-elements/[3194. Minimum Average of Smallest and Largest Elements^] //|{source_base_url}/_3194_MinimumAverageOfSmallestAndLargestElements.java[Java] //|{doc_base_url}/3194-minimum-average-of-smallest-and-largest-elements.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/find-the-minimum-area-to-cover-all-ones-i/[3195. Find the Minimum Area to Cover All Ones I^] //|{source_base_url}/_3195_FindTheMinimumAreaToCoverAllOnesI.java[Java] //|{doc_base_url}/3195-find-the-minimum-area-to-cover-all-ones-i.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximize-total-cost-of-alternating-subarrays/[3196. Maximize Total Cost of Alternating Subarrays^] //|{source_base_url}/_3196_MaximizeTotalCostOfAlternatingSubarrays.java[Java] //|{doc_base_url}/3196-maximize-total-cost-of-alternating-subarrays.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-the-minimum-area-to-cover-all-ones-ii/[3197. Find the Minimum Area to Cover All Ones II^] //|{source_base_url}/_3197_FindTheMinimumAreaToCoverAllOnesIi.java[Java] //|{doc_base_url}/3197-find-the-minimum-area-to-cover-all-ones-ii.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/find-cities-in-each-state/[3198. Find Cities in Each State^] //|{source_base_url}/_3198_FindCitiesInEachState.java[Java] //|{doc_base_url}/3198-find-cities-in-each-state.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/count-triplets-with-even-xor-set-bits-i/[3199. Count Triplets with Even XOR Set Bits I^] //|{source_base_url}/_3199_CountTripletsWithEvenXorSetBitsI.java[Java] //|{doc_base_url}/3199-count-triplets-with-even-xor-set-bits-i.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/maximum-height-of-a-triangle/[3200. Maximum Height of a Triangle^] //|{source_base_url}/_3200_MaximumHeightOfATriangle.java[Java] //|{doc_base_url}/3200-maximum-height-of-a-triangle.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/find-the-maximum-length-of-valid-subsequence-i/[3201. Find the Maximum Length of Valid Subsequence I^] //|{source_base_url}/_3201_FindTheMaximumLengthOfValidSubsequenceI.java[Java] //|{doc_base_url}/3201-find-the-maximum-length-of-valid-subsequence-i.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-the-maximum-length-of-valid-subsequence-ii/[3202. Find the Maximum Length of Valid Subsequence II^] //|{source_base_url}/_3202_FindTheMaximumLengthOfValidSubsequenceIi.java[Java] //|{doc_base_url}/3202-find-the-maximum-length-of-valid-subsequence-ii.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-minimum-diameter-after-merging-two-trees/[3203. Find Minimum Diameter After Merging Two Trees^] //|{source_base_url}/_3203_FindMinimumDiameterAfterMergingTwoTrees.java[Java] //|{doc_base_url}/3203-find-minimum-diameter-after-merging-two-trees.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/bitwise-user-permissions-analysis/[3204. Bitwise User Permissions Analysis^] //|{source_base_url}/_3204_BitwiseUserPermissionsAnalysis.java[Java] //|{doc_base_url}/3204-bitwise-user-permissions-analysis.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-array-hopping-score-i/[3205. Maximum Array Hopping Score I^] //|{source_base_url}/_3205_MaximumArrayHoppingScoreI.java[Java] //|{doc_base_url}/3205-maximum-array-hopping-score-i.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/alternating-groups-i/[3206. Alternating Groups I^] //|{source_base_url}/_3206_AlternatingGroupsI.java[Java] //|{doc_base_url}/3206-alternating-groups-i.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/maximum-points-after-enemy-battles/[3207. Maximum Points After Enemy Battles^] //|{source_base_url}/_3207_MaximumPointsAfterEnemyBattles.java[Java] //|{doc_base_url}/3207-maximum-points-after-enemy-battles.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/alternating-groups-ii/[3208. Alternating Groups II^] //|{source_base_url}/_3208_AlternatingGroupsIi.java[Java] //|{doc_base_url}/3208-alternating-groups-ii.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/number-of-subarrays-with-and-value-of-k/[3209. Number of Subarrays With AND Value of K^] //|{source_base_url}/_3209_NumberOfSubarraysWithAndValueOfK.java[Java] //|{doc_base_url}/3209-number-of-subarrays-with-and-value-of-k.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/find-the-encrypted-string/[3210. Find the Encrypted String^] //|{source_base_url}/_3210_FindTheEncryptedString.java[Java] //|{doc_base_url}/3210-find-the-encrypted-string.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/generate-binary-strings-without-adjacent-zeros/[3211. Generate Binary Strings Without Adjacent Zeros^] //|{source_base_url}/_3211_GenerateBinaryStringsWithoutAdjacentZeros.java[Java] //|{doc_base_url}/3211-generate-binary-strings-without-adjacent-zeros.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-submatrices-with-equal-frequency-of-x-and-y/[3212. Count Submatrices With Equal Frequency of X and Y^] //|{source_base_url}/_3212_CountSubmatricesWithEqualFrequencyOfXAndY.java[Java] //|{doc_base_url}/3212-count-submatrices-with-equal-frequency-of-x-and-y.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/construct-string-with-minimum-cost/[3213. Construct String with Minimum Cost^] //|{source_base_url}/_3213_ConstructStringWithMinimumCost.java[Java] //|{doc_base_url}/3213-construct-string-with-minimum-cost.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/year-on-year-growth-rate/[3214. Year on Year Growth Rate^] //|{source_base_url}/_3214_YearOnYearGrowthRate.java[Java] //|{doc_base_url}/3214-year-on-year-growth-rate.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/count-triplets-with-even-xor-set-bits-ii/[3215. Count Triplets with Even XOR Set Bits II^] //|{source_base_url}/_3215_CountTripletsWithEvenXorSetBitsIi.java[Java] //|{doc_base_url}/3215-count-triplets-with-even-xor-set-bits-ii.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/lexicographically-smallest-string-after-a-swap/[3216. Lexicographically Smallest String After a Swap^] //|{source_base_url}/_3216_LexicographicallySmallestStringAfterASwap.java[Java] //|{doc_base_url}/3216-lexicographically-smallest-string-after-a-swap.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/delete-nodes-from-linked-list-present-in-array/[3217. Delete Nodes From Linked List Present in Array^] //|{source_base_url}/_3217_DeleteNodesFromLinkedListPresentInArray.java[Java] //|{doc_base_url}/3217-delete-nodes-from-linked-list-present-in-array.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-cost-for-cutting-cake-i/[3218. Minimum Cost for Cutting Cake I^] //|{source_base_url}/_3218_MinimumCostForCuttingCakeI.java[Java] //|{doc_base_url}/3218-minimum-cost-for-cutting-cake-i.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-cost-for-cutting-cake-ii/[3219. Minimum Cost for Cutting Cake II^] //|{source_base_url}/_3219_MinimumCostForCuttingCakeIi.java[Java] //|{doc_base_url}/3219-minimum-cost-for-cutting-cake-ii.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/odd-and-even-transactions/[3220. Odd and Even Transactions^] //|{source_base_url}/_3220_OddAndEvenTransactions.java[Java] //|{doc_base_url}/3220-odd-and-even-transactions.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-array-hopping-score-ii/[3221. Maximum Array Hopping Score II^] //|{source_base_url}/_3221_MaximumArrayHoppingScoreIi.java[Java] //|{doc_base_url}/3221-maximum-array-hopping-score-ii.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-the-winning-player-in-coin-game/[3222. Find the Winning Player in Coin Game^] //|{source_base_url}/_3222_FindTheWinningPlayerInCoinGame.java[Java] //|{doc_base_url}/3222-find-the-winning-player-in-coin-game.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/minimum-length-of-string-after-operations/[3223. Minimum Length of String After Operations^] //|{source_base_url}/_3223_MinimumLengthOfStringAfterOperations.java[Java] //|{doc_base_url}/3223-minimum-length-of-string-after-operations.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-array-changes-to-make-differences-equal/[3224. Minimum Array Changes to Make Differences Equal^] //|{source_base_url}/_3224_MinimumArrayChangesToMakeDifferencesEqual.java[Java] //|{doc_base_url}/3224-minimum-array-changes-to-make-differences-equal.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-score-from-grid-operations/[3225. Maximum Score From Grid Operations^] //|{source_base_url}/_3225_MaximumScoreFromGridOperations.java[Java] //|{doc_base_url}/3225-maximum-score-from-grid-operations.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/number-of-bit-changes-to-make-two-integers-equal/[3226. Number of Bit Changes to Make Two Integers Equal^] //|{source_base_url}/_3226_NumberOfBitChangesToMakeTwoIntegersEqual.java[Java] //|{doc_base_url}/3226-number-of-bit-changes-to-make-two-integers-equal.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/vowels-game-in-a-string/[3227. Vowels Game in a String^] //|{source_base_url}/_3227_VowelsGameInAString.java[Java] //|{doc_base_url}/3227-vowels-game-in-a-string.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/maximum-number-of-operations-to-move-ones-to-the-end/[3228. Maximum Number of Operations to Move Ones to the End^] //|{source_base_url}/_3228_MaximumNumberOfOperationsToMoveOnesToTheEnd.java[Java] //|{doc_base_url}/3228-maximum-number-of-operations-to-move-ones-to-the-end.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-operations-to-make-array-equal-to-target/[3229. Minimum Operations to Make Array Equal to Target^] //|{source_base_url}/_3229_MinimumOperationsToMakeArrayEqualToTarget.java[Java] //|{doc_base_url}/3229-minimum-operations-to-make-array-equal-to-target.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/customer-purchasing-behavior-analysis/[3230. Customer Purchasing Behavior Analysis^] //|{source_base_url}/_3230_CustomerPurchasingBehaviorAnalysis.java[Java] //|{doc_base_url}/3230-customer-purchasing-behavior-analysis.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-number-of-increasing-subsequence-to-be-removed/[3231. Minimum Number of Increasing Subsequence to Be Removed^] //|{source_base_url}/_3231_MinimumNumberOfIncreasingSubsequenceToBeRemoved.java[Java] //|{doc_base_url}/3231-minimum-number-of-increasing-subsequence-to-be-removed.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/find-if-digit-game-can-be-won/[3232. Find if Digit Game Can Be Won^] //|{source_base_url}/_3232_FindIfDigitGameCanBeWon.java[Java] //|{doc_base_url}/3232-find-if-digit-game-can-be-won.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/find-the-count-of-numbers-which-are-not-special/[3233. Find the Count of Numbers Which Are Not Special^] //|{source_base_url}/_3233_FindTheCountOfNumbersWhichAreNotSpecial.java[Java] //|{doc_base_url}/3233-find-the-count-of-numbers-which-are-not-special.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/count-the-number-of-substrings-with-dominant-ones/[3234. Count the Number of Substrings With Dominant Ones^] //|{source_base_url}/_3234_CountTheNumberOfSubstringsWithDominantOnes.java[Java] //|{doc_base_url}/3234-count-the-number-of-substrings-with-dominant-ones.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/check-if-the-rectangle-corner-is-reachable/[3235. Check if the Rectangle Corner Is Reachable^] //|{source_base_url}/_3235_CheckIfTheRectangleCornerIsReachable.java[Java] //|{doc_base_url}/3235-check-if-the-rectangle-corner-is-reachable.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/ceo-subordinate-hierarchy/[3236. CEO Subordinate Hierarchy^] //|{source_base_url}/_3236_CeoSubordinateHierarchy.java[Java] //|{doc_base_url}/3236-ceo-subordinate-hierarchy.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/alt-and-tab-simulation/[3237. Alt and Tab Simulation^] //|{source_base_url}/_3237_AltAndTabSimulation.java[Java] //|{doc_base_url}/3237-alt-and-tab-simulation.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-the-number-of-winning-players/[3238. Find the Number of Winning Players^] //|{source_base_url}/_3238_FindTheNumberOfWinningPlayers.java[Java] //|{doc_base_url}/3238-find-the-number-of-winning-players.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/minimum-number-of-flips-to-make-binary-grid-palindromic-i/[3239. Minimum Number of Flips to Make Binary Grid Palindromic I^] //|{source_base_url}/_3239_MinimumNumberOfFlipsToMakeBinaryGridPalindromicI.java[Java] //|{doc_base_url}/3239-minimum-number-of-flips-to-make-binary-grid-palindromic-i.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/minimum-number-of-flips-to-make-binary-grid-palindromic-ii/[3240. Minimum Number of Flips to Make Binary Grid Palindromic II^] //|{source_base_url}/_3240_MinimumNumberOfFlipsToMakeBinaryGridPalindromicIi.java[Java] //|{doc_base_url}/3240-minimum-number-of-flips-to-make-binary-grid-palindromic-ii.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/time-taken-to-mark-all-nodes/[3241. Time Taken to Mark All Nodes^] //|{source_base_url}/_3241_TimeTakenToMarkAllNodes.java[Java] //|{doc_base_url}/3241-time-taken-to-mark-all-nodes.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/design-neighbor-sum-service/[3242. Design Neighbor Sum Service^] //|{source_base_url}/_3242_DesignNeighborSumService.java[Java] //|{doc_base_url}/3242-design-neighbor-sum-service.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/shortest-distance-after-road-addition-queries-i/[3243. Shortest Distance After Road Addition Queries I^] //|{source_base_url}/_3243_ShortestDistanceAfterRoadAdditionQueriesI.java[Java] //|{doc_base_url}/3243-shortest-distance-after-road-addition-queries-i.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/shortest-distance-after-road-addition-queries-ii/[3244. Shortest Distance After Road Addition Queries II^] //|{source_base_url}/_3244_ShortestDistanceAfterRoadAdditionQueriesIi.java[Java] //|{doc_base_url}/3244-shortest-distance-after-road-addition-queries-ii.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/alternating-groups-iii/[3245. Alternating Groups III^] //|{source_base_url}/_3245_AlternatingGroupsIii.java[Java] //|{doc_base_url}/3245-alternating-groups-iii.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/premier-league-table-ranking/[3246. Premier League Table Ranking^] //|{source_base_url}/_3246_PremierLeagueTableRanking.java[Java] //|{doc_base_url}/3246-premier-league-table-ranking.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/number-of-subsequences-with-odd-sum/[3247. Number of Subsequences with Odd Sum^] //|{source_base_url}/_3247_NumberOfSubsequencesWithOddSum.java[Java] //|{doc_base_url}/3247-number-of-subsequences-with-odd-sum.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/snake-in-matrix/[3248. Snake in Matrix^] //|{source_base_url}/_3248_SnakeInMatrix.java[Java] //|{doc_base_url}/3248-snake-in-matrix.adoc[题解] //|Easy //|

//|{counter:codes} //|{leetcode_base_url}/count-the-number-of-good-nodes/[3249. Count the Number of Good Nodes^] //|{source_base_url}/_3249_CountTheNumberOfGoodNodes.java[Java] //|{doc_base_url}/3249-count-the-number-of-good-nodes.adoc[题解] //|Medium //|

//|{counter:codes} //|{leetcode_base_url}/find-the-count-of-monotonic-pairs-i/[3250. Find the Count of Monotonic Pairs I^] //|{source_base_url}/_3250_FindTheCountOfMonotonicPairsI.java[Java] //|{doc_base_url}/3250-find-the-count-of-monotonic-pairs-i.adoc[题解] //|Hard //|

//|{counter:codes} //|{leetcode_base_url}/find-the-count-of-monotonic-pairs-ii/[3251. Find the Count of Monotonic Pairs II^] //|{source_base_url}/_3251_FindTheCountOfMonotonicPairsIi.java[Java] //|{doc_base_url}/3251-find-the-count-of-monotonic-pairs-ii.adoc[题解] //|Hard //|

// |{counter:codes} // |{leetcode_base_url}/premier-league-table-ranking-ii/[3252. Premier League Table Ranking II^] // |{source_base_url}/_3252_PremierLeagueTableRankingIi.java[Java] // |{doc_base_url}/3252-premier-league-table-ranking-ii.adoc[题解] // |Medium // |

// |{counter:codes} // |{leetcode_base_url}/construct-string-with-minimum-cost-easy/[3253. Construct String with Minimum Cost (Easy)^] // |{source_base_url}/_3253_ConstructStringWithMinimumCostEasy.java[Java] // |{doc_base_url}/3253-construct-string-with-minimum-cost-easy.adoc[题解] // |Medium // |

|===

截止目前，一共完成 {codes} 道题。