# Array

- [Best Time To Buy And Sell Stock](https://wentao-shao.gitbook.io/leetcode/array/best-time-to-buy-and-sell-stock.md)
- [121.Best-Time-to-Buy-and-Sell-Stock](https://wentao-shao.gitbook.io/leetcode/array/best-time-to-buy-and-sell-stock/121.best-time-to-buy-and-sell-stock.md)
- [122.Best-Time-to-Buy-and-Sell-Stock-II](https://wentao-shao.gitbook.io/leetcode/array/best-time-to-buy-and-sell-stock/122.best-time-to-buy-and-sell-stock-ii.md)
- [123.Best-Time-to-Buy-and-Sell-Stock-III](https://wentao-shao.gitbook.io/leetcode/array/best-time-to-buy-and-sell-stock/123.best-time-to-buy-and-sell-stock-iii.md)
- [188.Best-Time-to-Buy-and-Sell-Stock-IV](https://wentao-shao.gitbook.io/leetcode/array/best-time-to-buy-and-sell-stock/188.best-time-to-buy-and-sell-stock-iv.md)
- [1.Two-Sum](https://wentao-shao.gitbook.io/leetcode/array/1.two-sum.md)
- [1007.Minimum-Domino-Rotations-For-Equal-Row](https://wentao-shao.gitbook.io/leetcode/array/1007.minimum-domino-rotations-for-equal-row.md)
- [1031.Maximum-Sum-of-Two-Non-Overlapping-Subarrays](https://wentao-shao.gitbook.io/leetcode/array/1031.maximum-sum-of-two-non-overlapping-subarrays.md)
- [1052.Grumpy-Bookstore-Owner](https://wentao-shao.gitbook.io/leetcode/array/1052.grumpy-bookstore-owner.md)
- [11.Container-With-Most-Water](https://wentao-shao.gitbook.io/leetcode/array/11.container-with-most-water.md)
- [1122.Relative-Sort-Array](https://wentao-shao.gitbook.io/leetcode/array/1122.relative-sort-array.md)
- [1163.Last-Substring-in-Lexicographical-Order](https://wentao-shao.gitbook.io/leetcode/array/1163.last-substring-in-lexicographical-order.md)
- [\[118.Pascal's-Triangle\](Array/118.Pascal's-Triangle.md)](https://wentao-shao.gitbook.io/leetcode/array/118.pascals-triangle-array-118.pascals-triangle-md.md)
- [1181.Before-and-After-Puzzle](https://wentao-shao.gitbook.io/leetcode/array/1181.before-and-after-puzzle.md)
- [1231.Divide-Chocolate](https://wentao-shao.gitbook.io/leetcode/array/1231.divide-chocolate.md)
- [1296.Divide-Array-in-Sets-of-K-Consecutive-Numbers](https://wentao-shao.gitbook.io/leetcode/array/1296.divide-array-in-sets-of-k-consecutive-numbers.md)
- [1304.Find-N-Unique-Integers-Sum-up-to-Zero](https://wentao-shao.gitbook.io/leetcode/array/1304.find-n-unique-integers-sum-up-to-zero.md)
- [134.Gas-Station](https://wentao-shao.gitbook.io/leetcode/array/134.gas-station.md)
- [135.Candy](https://wentao-shao.gitbook.io/leetcode/array/135.candy.md)
- [1352.Product-of-the-Last-K-Numbers](https://wentao-shao.gitbook.io/leetcode/array/1352.product-of-the-last-k-numbers.md)
- [136.Single-Number](https://wentao-shao.gitbook.io/leetcode/array/136.single-number.md)
- [14.Longest-Common-Prefix](https://wentao-shao.gitbook.io/leetcode/array/14.longest-common-prefix.md)
- [1477.Find-Two-Non-overlapping-Sub-arrays-Each-With-Target-Sum](https://wentao-shao.gitbook.io/leetcode/array/1477.find-two-non-overlapping-sub-arrays-each-with-target-sum.md)
- [15.3Sum](https://wentao-shao.gitbook.io/leetcode/array/15.3sum.md)
- [152.Maximum-Product-Subarray](https://wentao-shao.gitbook.io/leetcode/array/152.maximum-product-subarray.md)
- [16.3Sum-Closest](https://wentao-shao.gitbook.io/leetcode/array/16.3sum-closest.md)
- [163.Missing-Ranges](https://wentao-shao.gitbook.io/leetcode/array/163.missing-ranges.md)
- [169.Majority-Element](https://wentao-shao.gitbook.io/leetcode/array/169.majority-element.md)
- [18.4Sum](https://wentao-shao.gitbook.io/leetcode/array/18.4sum.md)
- [189.Rotate-Array](https://wentao-shao.gitbook.io/leetcode/array/189.rotate-array.md)
- [204.Count-Primes](https://wentao-shao.gitbook.io/leetcode/array/204.count-primes.md)
- [215.Kth-Largest-Element-in-an-Array](https://wentao-shao.gitbook.io/leetcode/array/215.kth-largest-element-in-an-array.md)
- [217.Contains-Duplicate](https://wentao-shao.gitbook.io/leetcode/array/217.contains-duplicate.md)
- [219.Contains-Duplicate-II](https://wentao-shao.gitbook.io/leetcode/array/219.contains-duplicate-ii.md)
- [220.Contains-Duplicate-III](https://wentao-shao.gitbook.io/leetcode/array/220.contains-duplicate-iii.md)
- [228.Summary-Ranges](https://wentao-shao.gitbook.io/leetcode/array/228.summary-ranges.md)
- [229.Majority-Element-II](https://wentao-shao.gitbook.io/leetcode/array/229.majority-element-ii.md)
- [238.Product-of-Array-Except-Self](https://wentao-shao.gitbook.io/leetcode/array/238.product-of-array-except-self.md)
- [239.Sliding-Window-Maximum](https://wentao-shao.gitbook.io/leetcode/array/239.sliding-window-maximum.md)
- [243.Shortest-Word-Distance](https://wentao-shao.gitbook.io/leetcode/array/243.shortest-word-distance.md)
- [252.Meeting-Rooms](https://wentao-shao.gitbook.io/leetcode/array/252.meeting-rooms.md)
- [266.Palindrome-Permutation](https://wentao-shao.gitbook.io/leetcode/array/266.palindrome-permutation.md)
- [268.Missing-Number](https://wentao-shao.gitbook.io/leetcode/array/268.missing-number.md)
- [273.Integer-to-English-Words](https://wentao-shao.gitbook.io/leetcode/array/273.integer-to-english-words.md)
- [279.Perfect-Squares](https://wentao-shao.gitbook.io/leetcode/array/279.perfect-squares.md)
- [283.Move-Zeroes](https://wentao-shao.gitbook.io/leetcode/array/283.move-zeroes.md)
- [287.Find-the-Duplicate-Number](https://wentao-shao.gitbook.io/leetcode/array/287.find-the-duplicate-number.md)
- [29.Divide-Two-Integers](https://wentao-shao.gitbook.io/leetcode/array/29.divide-two-integers.md)
- [299.Bulls-and-Cows](https://wentao-shao.gitbook.io/leetcode/array/299.bulls-and-cows.md)
- [31.Next-Permutation](https://wentao-shao.gitbook.io/leetcode/array/31.next-permutation.md)
- [325.Maximum-Size-Subarray-Sum-Equals-k](https://wentao-shao.gitbook.io/leetcode/array/325.maximum-size-subarray-sum-equals-k.md)
- [334.Increasing-Triplet-Subsequence](https://wentao-shao.gitbook.io/leetcode/array/334.increasing-triplet-subsequence.md)
- [340.Longest-Substring-with-At-Most-K-Distinct-Characters](https://wentao-shao.gitbook.io/leetcode/array/340.longest-substring-with-at-most-k-distinct-characters.md)
- [347.Top-K-Frequent-Elements](https://wentao-shao.gitbook.io/leetcode/array/347.top-k-frequent-elements.md)
- [349.Intersection-of-Two-Arrays](https://wentao-shao.gitbook.io/leetcode/array/349.intersection-of-two-arrays.md)
- [350.Intersection-of-Two-Arrays-II](https://wentao-shao.gitbook.io/leetcode/array/350.intersection-of-two-arrays-ii.md)
- [354.Russian-Doll-Envelopes](https://wentao-shao.gitbook.io/leetcode/array/354.russian-doll-envelopes.md)
- [367.Valid-Perfect-Square](https://wentao-shao.gitbook.io/leetcode/array/367.valid-perfect-square.md)
- [378.Kth-Smallest-Element-in-a-Sorted-Matrix](https://wentao-shao.gitbook.io/leetcode/array/378.kth-smallest-element-in-a-sorted-matrix.md)
- [38.Count-and-Say](https://wentao-shao.gitbook.io/leetcode/array/38.count-and-say.md)
- [383.Ransom-Note](https://wentao-shao.gitbook.io/leetcode/array/383.ransom-note.md)
- [387.First-Unique-Character-in-a-String](https://wentao-shao.gitbook.io/leetcode/array/387.first-unique-character-in-a-string.md)
- [4.Median-of-Two-Sorted-Arrays](https://wentao-shao.gitbook.io/leetcode/array/4.median-of-two-sorted-arrays.md)
- [406.Queue-Reconstruction-by-Height](https://wentao-shao.gitbook.io/leetcode/array/406.queue-reconstruction-by-height.md)
- [410.Split-Array-Largest-Sum](https://wentao-shao.gitbook.io/leetcode/array/410.split-array-largest-sum.md)
- [412.Fizz-Buzz](https://wentao-shao.gitbook.io/leetcode/array/412.fizz-buzz.md)
- [419.Battleships-in-a-Board](https://wentao-shao.gitbook.io/leetcode/array/419.battleships-in-a-board.md)
- [435.Non-overlapping-Intervals](https://wentao-shao.gitbook.io/leetcode/array/435.non-overlapping-intervals.md)
- [438.Find-All-Anagrams-in-a-String](https://wentao-shao.gitbook.io/leetcode/array/438.find-all-anagrams-in-a-string.md)
- [442.Find-All-Duplicates-in-an-Array](https://wentao-shao.gitbook.io/leetcode/array/442.find-all-duplicates-in-an-array.md)
- [457.Circular-Array-Loop](https://wentao-shao.gitbook.io/leetcode/array/457.circular-array-loop.md)
- [509.Fibonacci-Number](https://wentao-shao.gitbook.io/leetcode/array/509.fibonacci-number.md)
- [53.Maximum-Subarray](https://wentao-shao.gitbook.io/leetcode/array/53.maximum-subarray.md)
- [539.Minimum-Time-Difference](https://wentao-shao.gitbook.io/leetcode/array/539.minimum-time-difference.md)
- [540.Single-Element-in-a-Sorted-Array](https://wentao-shao.gitbook.io/leetcode/array/540.single-element-in-a-sorted-array.md)
- [56.Merge-Intervals](https://wentao-shao.gitbook.io/leetcode/array/56.merge-intervals.md)
- [560.Subarray-Sum-Equals-K](https://wentao-shao.gitbook.io/leetcode/array/560.subarray-sum-equals-k.md)
- [57.Insert-Interval](https://wentao-shao.gitbook.io/leetcode/array/57.insert-interval.md)
- [575.Distribute-Candies](https://wentao-shao.gitbook.io/leetcode/array/575.distribute-candies.md)
- [581.Shortest-Unsorted-Continuous-Subarray](https://wentao-shao.gitbook.io/leetcode/array/581.shortest-unsorted-continuous-subarray.md)
- [593.Valid-Square](https://wentao-shao.gitbook.io/leetcode/array/593.valid-square.md)
- [6.ZigZag-Conversion](https://wentao-shao.gitbook.io/leetcode/array/6.zigzag-conversion.md)
- [609.Find-Duplicate-File-in-System](https://wentao-shao.gitbook.io/leetcode/array/609.find-duplicate-file-in-system.md)
- [611.Valid-Triangle-Number](https://wentao-shao.gitbook.io/leetcode/array/611.valid-triangle-number.md)
- [621.Task-Scheduler](https://wentao-shao.gitbook.io/leetcode/array/621.task-scheduler.md)
- [628.Maximum-Product-of-Three-Numbers](https://wentao-shao.gitbook.io/leetcode/array/628.maximum-product-of-three-numbers.md)
- [632.Smallest-Range-Covering-Elements-from-K-Lists](https://wentao-shao.gitbook.io/leetcode/array/632.smallest-range-covering-elements-from-k-lists.md)
- [659.Split-Array-into-Consecutive-Subsequences](https://wentao-shao.gitbook.io/leetcode/array/659.split-array-into-consecutive-subsequences.md)
- [67.Add-Binary](https://wentao-shao.gitbook.io/leetcode/array/67.add-binary.md)
- [670.Maximum-Swap](https://wentao-shao.gitbook.io/leetcode/array/670.maximum-swap.md)
- [7.Reverse-Integer](https://wentao-shao.gitbook.io/leetcode/array/7.reverse-integer.md)
- [717.1-bit-and-2-bit-Characters](https://wentao-shao.gitbook.io/leetcode/array/717.1-bit-and-2-bit-characters.md)
- [722.Remove-Comments](https://wentao-shao.gitbook.io/leetcode/array/722.remove-comments.md)
- [724.Find-Pivot-Index](https://wentao-shao.gitbook.io/leetcode/array/724.find-pivot-index.md)
- [763.Partition-Labels](https://wentao-shao.gitbook.io/leetcode/array/763.partition-labels.md)
- [811.Subdomain-Visit-Count](https://wentao-shao.gitbook.io/leetcode/array/811.subdomain-visit-count.md)
- [845.Longest-Mountain-in-Array](https://wentao-shao.gitbook.io/leetcode/array/845.longest-mountain-in-array.md)
- [846.Hand-of-Straights](https://wentao-shao.gitbook.io/leetcode/array/846.hand-of-straights.md)
- [862.Shortest-Subarray-with-Sum-at-Least-K](https://wentao-shao.gitbook.io/leetcode/array/862.shortest-subarray-with-sum-at-least-k.md)
- [866.Prime-Palindrome](https://wentao-shao.gitbook.io/leetcode/array/866.prime-palindrome.md)
- [881.Boats-to-Save-People](https://wentao-shao.gitbook.io/leetcode/array/881.boats-to-save-people.md)
- [937.Reorder-Data-in-Log-Files](https://wentao-shao.gitbook.io/leetcode/array/937.reorder-data-in-log-files.md)
- [953.Verifying-an-Alien-Dictionary](https://wentao-shao.gitbook.io/leetcode/array/953.verifying-an-alien-dictionary.md)
- [957.Prison-Cells-After-N-Days](https://wentao-shao.gitbook.io/leetcode/array/957.prison-cells-after-n-days.md)
- [973.K-Closest-Points-to-Origin](https://wentao-shao.gitbook.io/leetcode/array/973.k-closest-points-to-origin.md)
- [974.Subarray-Sums-Divisible-by-K](https://wentao-shao.gitbook.io/leetcode/array/974.subarray-sums-divisible-by-k.md)
- [995.Minimum-Number-of-K-Consecutive-Bit-Flips](https://wentao-shao.gitbook.io/leetcode/array/995.minimum-number-of-k-consecutive-bit-flips.md)
- [Interleaving Positive And Negative Numbers](https://wentao-shao.gitbook.io/leetcode/array/interleaving-positive-and-negative-numbers.md)
- [Maximum Subarray Difference](https://wentao-shao.gitbook.io/leetcode/array/maximum-subarray-difference.md)
- [Maximum Subarray Ii](https://wentao-shao.gitbook.io/leetcode/array/maximum-subarray-ii.md)
- [Merge Sorted Array Ii](https://wentao-shao.gitbook.io/leetcode/array/merge-sorted-array-ii.md)
- [Minimum Subarray](https://wentao-shao.gitbook.io/leetcode/array/minimum-subarray.md)
- [Partition Array](https://wentao-shao.gitbook.io/leetcode/array/partition-array.md)
- [Recover Rotated Sorted Array](https://wentao-shao.gitbook.io/leetcode/array/recover-rotated-sorted-array.md)
- [Subarray Sum Closest](https://wentao-shao.gitbook.io/leetcode/array/subarray-sum-closest.md)
- [Subarray Sum Zero](https://wentao-shao.gitbook.io/leetcode/array/subarray-sum-zero.md)


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://wentao-shao.gitbook.io/leetcode/array.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.