> For the complete documentation index, see [llms.txt](https://jaywin.gitbook.io/leetcode/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://jaywin.gitbook.io/leetcode/solutions.md).

# Solutions

- [0001. Two Sum](https://jaywin.gitbook.io/leetcode/solutions/0001-two-sum.md)
- [0002. Add Two Numbers](https://jaywin.gitbook.io/leetcode/solutions/0002-add-two-numbers.md)
- [0003. Longest Substring Without Repeating Characters](https://jaywin.gitbook.io/leetcode/solutions/0003-longest-substring-without-repeating-characters.md)
- [0004. Median of Two Sorted Arrays](https://jaywin.gitbook.io/leetcode/solutions/0004-median-of-two-sorted-arrays.md)
- [0005. Longest Palindromic Substring](https://jaywin.gitbook.io/leetcode/solutions/0005-longest-palindromic-substring.md)
- [0006. ZigZag Conversion](https://jaywin.gitbook.io/leetcode/solutions/0006-zigzag-conversion.md)
- [0007. Reverse Integer](https://jaywin.gitbook.io/leetcode/solutions/0007-reverse-integer.md)
- [0008. String to Integer (solutions/atoi)](https://jaywin.gitbook.io/leetcode/solutions/0008-string-to-integer-atoi.md)
- [0009. Palindrome Number](https://jaywin.gitbook.io/leetcode/solutions/0009-palindrome-number.md)
- [0010. Regular Expression Matching](https://jaywin.gitbook.io/leetcode/solutions/0010-regular-expression-matching.md)
- [0011. Container With Most Water](https://jaywin.gitbook.io/leetcode/solutions/0011-container-with-most-water.md)
- [0012. Integer to Roman](https://jaywin.gitbook.io/leetcode/solutions/0012-integer-to-roman.md)
- [0013. Roman to Integer](https://jaywin.gitbook.io/leetcode/solutions/0013-roman-to-integer.md)
- [0014. Longest Common Prefix](https://jaywin.gitbook.io/leetcode/solutions/0014-longest-common-prefix.md)
- [0015. 3Sum](https://jaywin.gitbook.io/leetcode/solutions/0015-3sum.md)
- [0016. 3Sum Closest](https://jaywin.gitbook.io/leetcode/solutions/0016-3sum-closest.md)
- [0017. Letter Combinations of a Phone Number](https://jaywin.gitbook.io/leetcode/solutions/0017-letter-combinations-of-a-phone-number.md)
- [0018. 4Sum](https://jaywin.gitbook.io/leetcode/solutions/0018-4sum.md)
- [0019. Remove Nth Node From End of List](https://jaywin.gitbook.io/leetcode/solutions/0019-remove-nth-node-from-end-of-list.md)
- [0020. Valid Parentheses](https://jaywin.gitbook.io/leetcode/solutions/0020-valid-parentheses.md)
- [0021. Merge Two Sorted Lists](https://jaywin.gitbook.io/leetcode/solutions/0021-merge-two-sorted-lists.md)
- [0022. Generate Parentheses](https://jaywin.gitbook.io/leetcode/solutions/0022-generate-parentheses.md)
- [0023. Merge k Sorted Lists](https://jaywin.gitbook.io/leetcode/solutions/0023-merge-k-sorted-lists.md)
- [0024. Swap Nodes in Pairs](https://jaywin.gitbook.io/leetcode/solutions/0024-swap-nodes-in-pairs.md)
- [0025. Reverse Nodes in k-Group](https://jaywin.gitbook.io/leetcode/solutions/0025-reverse-nodes-in-k-group.md)
- [0026. Remove Duplicates from Sorted Array](https://jaywin.gitbook.io/leetcode/solutions/0026-remove-duplicates-from-sorted-array.md)
- [0027. Remove Element](https://jaywin.gitbook.io/leetcode/solutions/0027-remove-element.md)
- [0028. Implement strStr(solutions/)](https://jaywin.gitbook.io/leetcode/solutions/0028-implement-strstr.md)
- [0029. Divide Two Integers](https://jaywin.gitbook.io/leetcode/solutions/0029-divide-two-integers.md)
- [0030. Substring with Concatenation of All Words](https://jaywin.gitbook.io/leetcode/solutions/0030-substring-with-concatenation-of-all-words.md)
- [0031. Next Permutation](https://jaywin.gitbook.io/leetcode/solutions/0031-next-permutation.md)
- [0032. Longest Valid Parentheses](https://jaywin.gitbook.io/leetcode/solutions/0032-longest-valid-parentheses.md)
- [0033. Search in Rotated Sorted Array](https://jaywin.gitbook.io/leetcode/solutions/0033-search-in-rotated-sorted-array.md)
- [0034. Find First and Last Position of Element in Sorted Array](https://jaywin.gitbook.io/leetcode/solutions/0034-find-first-and-last-position-of-element-in-sorted-array.md)
- [0035. Search Insert Position](https://jaywin.gitbook.io/leetcode/solutions/0035-search-insert-position.md)
- [0036. Valid Sudoku](https://jaywin.gitbook.io/leetcode/solutions/0036-valid-sudoku.md)
- [0037. Sudoku Solver](https://jaywin.gitbook.io/leetcode/solutions/0037-sudoku-solver.md)
- [0038. Count and Say](https://jaywin.gitbook.io/leetcode/solutions/0038-count-and-say.md)
- [0039. Combination Sum](https://jaywin.gitbook.io/leetcode/solutions/0039-combination-sum.md)
- [0040. Combination Sum II](https://jaywin.gitbook.io/leetcode/solutions/0040-combination-sum-ii.md)
- [0041. First Missing Positive](https://jaywin.gitbook.io/leetcode/solutions/0041-first-missing-positive.md)
- [0042. Trapping Rain Water](https://jaywin.gitbook.io/leetcode/solutions/0042-trapping-rain-water.md)
- [0043. Multiply Strings](https://jaywin.gitbook.io/leetcode/solutions/0043-multiply-strings.md)
- [0044. Wildcard Matching](https://jaywin.gitbook.io/leetcode/solutions/0044-wildcard-matching.md)
- [0045. Jump Game II](https://jaywin.gitbook.io/leetcode/solutions/0045-jump-game-ii.md)
- [0046. Permutations](https://jaywin.gitbook.io/leetcode/solutions/0046-permutations.md)
- [0047. Permutations II](https://jaywin.gitbook.io/leetcode/solutions/0047-permutations-ii.md)
- [0048. Rotate Image](https://jaywin.gitbook.io/leetcode/solutions/0048-rotate-image.md)
- [0049. Group Anagrams](https://jaywin.gitbook.io/leetcode/solutions/0049-group-anagrams.md)
- [0050. Pow(solutions/x, n)](https://jaywin.gitbook.io/leetcode/solutions/0050-powx-n.md)
- [0051. N-Queens](https://jaywin.gitbook.io/leetcode/solutions/0051-n-queens.md)
- [0052. N-Queens II](https://jaywin.gitbook.io/leetcode/solutions/0052-n-queens-ii.md)
- [0053. Maximum Subarray](https://jaywin.gitbook.io/leetcode/solutions/0053-maximum-subarray.md)
- [0054. Spiral Matrix](https://jaywin.gitbook.io/leetcode/solutions/0054-spiral-matrix.md)
- [0055. Jump Game](https://jaywin.gitbook.io/leetcode/solutions/0055-jump-game.md)
- [0056. Merge Intervals](https://jaywin.gitbook.io/leetcode/solutions/0056-merge-intervals.md)
- [0057. Insert Interval](https://jaywin.gitbook.io/leetcode/solutions/0057-insert-interval.md)
- [0058. Length of Last Word](https://jaywin.gitbook.io/leetcode/solutions/0058-length-of-last-word.md)
- [0059. Spiral Matrix II](https://jaywin.gitbook.io/leetcode/solutions/0059-spiral-matrix-ii.md)
- [0060. Permutation Sequence](https://jaywin.gitbook.io/leetcode/solutions/0060-permutation-sequence.md)
- [0061. Rotate List](https://jaywin.gitbook.io/leetcode/solutions/0061-rotate-list.md)
- [0062. Unique Paths](https://jaywin.gitbook.io/leetcode/solutions/0062-unique-paths.md)
- [0063. Unique Paths II](https://jaywin.gitbook.io/leetcode/solutions/0063-unique-paths-ii.md)
- [0064. Minimum Path Sum](https://jaywin.gitbook.io/leetcode/solutions/0064-minimum-path-sum.md)
- [0065. Valid Number](https://jaywin.gitbook.io/leetcode/solutions/0065-valid-number.md)
- [0066. Plus One](https://jaywin.gitbook.io/leetcode/solutions/0066-plus-one.md)
- [0067. Add Binary](https://jaywin.gitbook.io/leetcode/solutions/0067-add-binary.md)
- [0068. Text Justification](https://jaywin.gitbook.io/leetcode/solutions/0068-text-justification.md)
- [0069. Sqrt(solutions/x)](https://jaywin.gitbook.io/leetcode/solutions/0069-sqrtx.md)
- [0070. Climbing Stairs](https://jaywin.gitbook.io/leetcode/solutions/0070-climbing-stairs.md)
- [0071. Simplify Path](https://jaywin.gitbook.io/leetcode/solutions/0071-simplify-path.md)
- [0072. Edit Distance](https://jaywin.gitbook.io/leetcode/solutions/0072-edit-distance.md)
- [0073. Set Matrix Zeroes](https://jaywin.gitbook.io/leetcode/solutions/0073-set-matrix-zeroes.md)
- [0074. Search a 2D Matrix](https://jaywin.gitbook.io/leetcode/solutions/0074-search-a-2d-matrix.md)
- [0075. Sort Colors](https://jaywin.gitbook.io/leetcode/solutions/0075-sort-colors.md)
- [0076. Minimum Window Substring](https://jaywin.gitbook.io/leetcode/solutions/0076-minimum-window-substring.md)
- [0077. Combinations](https://jaywin.gitbook.io/leetcode/solutions/0077-combinations.md)
- [0078. Subsets](https://jaywin.gitbook.io/leetcode/solutions/0078-subsets.md)
- [0079. Word Search](https://jaywin.gitbook.io/leetcode/solutions/0079-word-search.md)
- [0080. Remove Duplicates from Sorted Array II](https://jaywin.gitbook.io/leetcode/solutions/0080-remove-duplicates-from-sorted-array-ii.md)
- [0081. Search in Rotated Sorted Array II](https://jaywin.gitbook.io/leetcode/solutions/0081-search-in-rotated-sorted-array-ii.md)
- [0082. Remove Duplicates from Sorted List II](https://jaywin.gitbook.io/leetcode/solutions/0082-remove-duplicates-from-sorted-list-ii.md)
- [0083. Remove Duplicates from Sorted List](https://jaywin.gitbook.io/leetcode/solutions/0083-remove-duplicates-from-sorted-list.md)
- [0084. Largest Rectangle in Histogram](https://jaywin.gitbook.io/leetcode/solutions/0084-largest-rectangle-in-histogram.md)
- [0085. Maximal Rectangle](https://jaywin.gitbook.io/leetcode/solutions/0085-maximal-rectangle.md)
- [0086. Partition List](https://jaywin.gitbook.io/leetcode/solutions/0086-partition-list.md)
- [0087. Scramble String](https://jaywin.gitbook.io/leetcode/solutions/0087-scramble-string.md)
- [0088. Merge Sorted Array](https://jaywin.gitbook.io/leetcode/solutions/0088-merge-sorted-array.md)
- [0089. Gray Code](https://jaywin.gitbook.io/leetcode/solutions/0089-gray-code.md)
- [0090. Subsets II](https://jaywin.gitbook.io/leetcode/solutions/0090-subsets-ii.md)
- [0091. Decode Ways](https://jaywin.gitbook.io/leetcode/solutions/0091-decode-ways.md)
- [0092. Reverse Linked List II](https://jaywin.gitbook.io/leetcode/solutions/0092-reverse-linked-list-ii.md)
- [0093. Restore IP Addresses](https://jaywin.gitbook.io/leetcode/solutions/0093-restore-ip-addresses.md)
- [0094. Binary Tree Inorder Traversal](https://jaywin.gitbook.io/leetcode/solutions/0094-binary-tree-inorder-traversal.md)
- [0095. Unique Binary Search Trees II](https://jaywin.gitbook.io/leetcode/solutions/0095-unique-binary-search-trees-ii.md)
- [0096. Unique Binary Search Trees](https://jaywin.gitbook.io/leetcode/solutions/0096-unique-binary-search-trees.md)
- [0097. Interleaving String](https://jaywin.gitbook.io/leetcode/solutions/0097-interleaving-string.md)
- [0098. Validate Binary Search Tree](https://jaywin.gitbook.io/leetcode/solutions/0098-validate-binary-search-tree.md)
- [0099. Recover Binary Search Tree](https://jaywin.gitbook.io/leetcode/solutions/0099-recover-binary-search-tree.md)
- [0100. Same Tree](https://jaywin.gitbook.io/leetcode/solutions/0100-same-tree.md)
- [0101. Symmetric Tree](https://jaywin.gitbook.io/leetcode/solutions/0101-symmetric-tree.md)
- [0102. Binary Tree Level Order Traversal](https://jaywin.gitbook.io/leetcode/solutions/0102-binary-tree-level-order-traversal.md)
- [0103. Binary Tree Zigzag Level Order Traversal](https://jaywin.gitbook.io/leetcode/solutions/0103-binary-tree-zigzag-level-order-traversal.md)
- [0104. Maximum Depth of Binary Tree](https://jaywin.gitbook.io/leetcode/solutions/0104-maximum-depth-of-binary-tree.md)
- [0105. Construct Binary Tree from Preorder and Inorder Traversal](https://jaywin.gitbook.io/leetcode/solutions/0105-construct-binary-tree-from-preorder-and-inorder-traversal.md)
- [0106. Construct Binary Tree from Inorder and Postorder Traversal](https://jaywin.gitbook.io/leetcode/solutions/0106-construct-binary-tree-from-inorder-and-postorder-traversal.md)
- [0107. Binary Tree Level Order Traversal II](https://jaywin.gitbook.io/leetcode/solutions/0107-binary-tree-level-order-traversal-ii.md)
- [0108. Convert Sorted Array to Binary Search Tree](https://jaywin.gitbook.io/leetcode/solutions/0108-convert-sorted-array-to-binary-search-tree.md)
- [0109. Convert Sorted List to Binary Search Tree](https://jaywin.gitbook.io/leetcode/solutions/0109-convert-sorted-list-to-binary-search-tree.md)
- [0110. Balanced Binary Tree](https://jaywin.gitbook.io/leetcode/solutions/0110-balanced-binary-tree.md)
- [0111. Minimum Depth of Binary Tree](https://jaywin.gitbook.io/leetcode/solutions/0111-minimum-depth-of-binary-tree.md)
- [0112. Path Sum](https://jaywin.gitbook.io/leetcode/solutions/0112-path-sum.md)
- [0113. Path Sum II](https://jaywin.gitbook.io/leetcode/solutions/0113-path-sum-ii.md)
- [0114. Flatten Binary Tree to Linked List](https://jaywin.gitbook.io/leetcode/solutions/0114-flatten-binary-tree-to-linked-list.md)
- [0115. Distinct Subsequences](https://jaywin.gitbook.io/leetcode/solutions/0115-distinct-subsequences.md)
- [0116. Populating Next Right Pointers in Each Node](https://jaywin.gitbook.io/leetcode/solutions/0116-populating-next-right-pointers-in-each-node.md)
- [0117. Populating Next Right Pointers in Each Node II](https://jaywin.gitbook.io/leetcode/solutions/0117-populating-next-right-pointers-in-each-node-ii.md)
- [0118. Pascal's Triangle](https://jaywin.gitbook.io/leetcode/solutions/0118-pascals-triangle.md)
- [0119. Pascal's Triangle II](https://jaywin.gitbook.io/leetcode/solutions/0119-pascals-triangle-ii.md)
- [0120. Triangle](https://jaywin.gitbook.io/leetcode/solutions/0120-triangle.md)
- [0121. Best Time to Buy and Sell Stock](https://jaywin.gitbook.io/leetcode/solutions/0121-best-time-to-buy-and-sell-stock.md)
- [0122. Best Time to Buy and Sell Stock II](https://jaywin.gitbook.io/leetcode/solutions/0122-best-time-to-buy-and-sell-stock-ii.md)
- [0123. Best Time to Buy and Sell Stock III](https://jaywin.gitbook.io/leetcode/solutions/0123-best-time-to-buy-and-sell-stock-iii.md)
- [0124. Binary Tree Maximum Path Sum](https://jaywin.gitbook.io/leetcode/solutions/0124-binary-tree-maximum-path-sum.md)
- [0125. Valid Palindrome](https://jaywin.gitbook.io/leetcode/solutions/0125-valid-palindrome.md)
- [0126. Word Ladder II](https://jaywin.gitbook.io/leetcode/solutions/0126-word-ladder-ii.md)
- [0127. Word Ladder](https://jaywin.gitbook.io/leetcode/solutions/0127-word-ladder.md)
- [0128. Longest Consecutive Sequence](https://jaywin.gitbook.io/leetcode/solutions/0128-longest-consecutive-sequence.md)
- [0129. Sum Root to Leaf Numbers](https://jaywin.gitbook.io/leetcode/solutions/0129-sum-root-to-leaf-numbers.md)
- [0130. Surrounded Regions](https://jaywin.gitbook.io/leetcode/solutions/0130-surrounded-regions.md)
- [0131. Palindrome Partitioning](https://jaywin.gitbook.io/leetcode/solutions/0131-palindrome-partitioning.md)
- [0132. Palindrome Partitioning II](https://jaywin.gitbook.io/leetcode/solutions/0132-palindrome-partitioning-ii.md)
- [0133. Clone Graph](https://jaywin.gitbook.io/leetcode/solutions/0133-clone-graph.md)
- [0134. Gas Station](https://jaywin.gitbook.io/leetcode/solutions/0134-gas-station.md)
- [0135. Candy](https://jaywin.gitbook.io/leetcode/solutions/0135-candy.md)
- [0136. Single Number](https://jaywin.gitbook.io/leetcode/solutions/0136-single-number.md)
- [0137. Single Number II](https://jaywin.gitbook.io/leetcode/solutions/0137-single-number-ii.md)
- [0138. Copy List with Random Pointer](https://jaywin.gitbook.io/leetcode/solutions/0138-copy-list-with-random-pointer.md)
- [0139. Word Break](https://jaywin.gitbook.io/leetcode/solutions/0139-word-break.md)
- [0140. Word Break II](https://jaywin.gitbook.io/leetcode/solutions/0140-word-break-ii.md)
- [0141. Linked List Cycle](https://jaywin.gitbook.io/leetcode/solutions/0141-linked-list-cycle.md)
- [0142. Linked List Cycle II](https://jaywin.gitbook.io/leetcode/solutions/0142-linked-list-cycle-ii.md)
- [0143. Reorder List](https://jaywin.gitbook.io/leetcode/solutions/0143-reorder-list.md)
- [0144. Binary Tree Preorder Traversal](https://jaywin.gitbook.io/leetcode/solutions/0144-binary-tree-preorder-traversal.md)
- [0145. Binary Tree Postorder Traversal](https://jaywin.gitbook.io/leetcode/solutions/0145-binary-tree-postorder-traversal.md)
- [0146. LRU Cache](https://jaywin.gitbook.io/leetcode/solutions/0146-lru-cache.md)
- [0147. Insertion Sort List](https://jaywin.gitbook.io/leetcode/solutions/0147-insertion-sort-list.md)
- [0148. Sort List](https://jaywin.gitbook.io/leetcode/solutions/0148-sort-list.md)
- [0149. Max Points on a Line](https://jaywin.gitbook.io/leetcode/solutions/0149-max-points-on-a-line.md)
- [0150. Evaluate Reverse Polish Notation](https://jaywin.gitbook.io/leetcode/solutions/0150-evaluate-reverse-polish-notation.md)
- [0151. Reverse Words in a String](https://jaywin.gitbook.io/leetcode/solutions/0151-reverse-words-in-a-string.md)
- [0152. Maximum Product Subarray](https://jaywin.gitbook.io/leetcode/solutions/0152-maximum-product-subarray.md)
- [0153. Find Minimum in Rotated Sorted Array](https://jaywin.gitbook.io/leetcode/solutions/0153-find-minimum-in-rotated-sorted-array.md)
- [0154. Find Minimum in Rotated Sorted Array II](https://jaywin.gitbook.io/leetcode/solutions/0154-find-minimum-in-rotated-sorted-array-ii.md)
- [0155. Min Stack](https://jaywin.gitbook.io/leetcode/solutions/0155-min-stack.md)
- [0156. Binary Tree Upside Down](https://jaywin.gitbook.io/leetcode/solutions/0156-binary-tree-upside-down.md)
- [0157. Read N Characters Given Read4](https://jaywin.gitbook.io/leetcode/solutions/0157-read-n-characters-given-read4.md)
- [0158. Read N Characters Given Read4 II - Call multiple times](https://jaywin.gitbook.io/leetcode/solutions/0158-read-n-characters-given-read4-ii-call-multiple-times.md)
- [0159. Longest Substring with At Most Two Distinct Characters](https://jaywin.gitbook.io/leetcode/solutions/0159-longest-substring-with-at-most-two-distinct-characters.md)
- [0160. Intersection of Two Linked Lists](https://jaywin.gitbook.io/leetcode/solutions/0160-intersection-of-two-linked-lists.md)
- [0161. One Edit Distance](https://jaywin.gitbook.io/leetcode/solutions/0161-one-edit-distance.md)
- [0162. Find Peak Element](https://jaywin.gitbook.io/leetcode/solutions/0162-find-peak-element.md)
- [0163. Missing Ranges](https://jaywin.gitbook.io/leetcode/solutions/0163-missing-ranges.md)
- [0164. Maximum Gap](https://jaywin.gitbook.io/leetcode/solutions/0164-maximum-gap.md)
- [0165. Compare Version Numbers](https://jaywin.gitbook.io/leetcode/solutions/0165-compare-version-numbers.md)
- [0166. Fraction to Recurring Decimal](https://jaywin.gitbook.io/leetcode/solutions/0166-fraction-to-recurring-decimal.md)
- [0167. Two Sum II - Input array is sorted](https://jaywin.gitbook.io/leetcode/solutions/0167-two-sum-ii-input-array-is-sorted.md)
- [0168. Excel Sheet Column Title](https://jaywin.gitbook.io/leetcode/solutions/0168-excel-sheet-column-title.md)
- [0169. Majority Element](https://jaywin.gitbook.io/leetcode/solutions/0169-majority-element.md)
- [0170. Two Sum III - Data structure design](https://jaywin.gitbook.io/leetcode/solutions/0170-two-sum-iii-data-structure-design.md)
- [0171. Excel Sheet Column Number](https://jaywin.gitbook.io/leetcode/solutions/0171-excel-sheet-column-number.md)
- [0172. Factorial Trailing Zeroes](https://jaywin.gitbook.io/leetcode/solutions/0172-factorial-trailing-zeroes.md)
- [0173. Binary Search Tree Iterator](https://jaywin.gitbook.io/leetcode/solutions/0173-binary-search-tree-iterator.md)
- [0174. Dungeon Game](https://jaywin.gitbook.io/leetcode/solutions/0174-dungeon-game.md)
- [0175. Combine Two Tables](https://jaywin.gitbook.io/leetcode/solutions/0175-combine-two-tables.md)
- [0176. Second Highest Salary](https://jaywin.gitbook.io/leetcode/solutions/0176-second-highest-salary.md)
- [0177. Nth Highest Salary](https://jaywin.gitbook.io/leetcode/solutions/0177-nth-highest-salary.md)
- [0178. Rank Scores](https://jaywin.gitbook.io/leetcode/solutions/0178-rank-scores.md)
- [0179. Largest Number](https://jaywin.gitbook.io/leetcode/solutions/0179-largest-number.md)
- [0180. Consecutive Numbers](https://jaywin.gitbook.io/leetcode/solutions/0180-consecutive-numbers.md)
- [0181. Employees Earning More Than Their Managers](https://jaywin.gitbook.io/leetcode/solutions/0181-employees-earning-more-than-their-managers.md)
- [0182. Duplicate Emails](https://jaywin.gitbook.io/leetcode/solutions/0182-duplicate-emails.md)
- [0183. Customers Who Never Order](https://jaywin.gitbook.io/leetcode/solutions/0183-customers-who-never-order.md)
- [0184. Department Highest Salary](https://jaywin.gitbook.io/leetcode/solutions/0184-department-highest-salary.md)
- [0185. Department Top Three Salaries](https://jaywin.gitbook.io/leetcode/solutions/0185-department-top-three-salaries.md)
- [0186. Reverse Words in a String II](https://jaywin.gitbook.io/leetcode/solutions/0186-reverse-words-in-a-string-ii.md)
- [0187. Repeated DNA Sequences](https://jaywin.gitbook.io/leetcode/solutions/0187-repeated-dna-sequences.md)
- [0188. Best Time to Buy and Sell Stock IV](https://jaywin.gitbook.io/leetcode/solutions/0188-best-time-to-buy-and-sell-stock-iv.md)
- [0189. Rotate Array](https://jaywin.gitbook.io/leetcode/solutions/0189-rotate-array.md)
- [0190. Reverse Bits](https://jaywin.gitbook.io/leetcode/solutions/0190-reverse-bits.md)
- [0191. Number of 1 Bits](https://jaywin.gitbook.io/leetcode/solutions/0191-number-of-1-bits.md)
- [0192. Word Frequency](https://jaywin.gitbook.io/leetcode/solutions/0192-word-frequency.md)
- [0193. Valid Phone Numbers](https://jaywin.gitbook.io/leetcode/solutions/0193-valid-phone-numbers.md)
- [0194. Transpose File](https://jaywin.gitbook.io/leetcode/solutions/0194-transpose-file.md)
- [0195. Tenth Line](https://jaywin.gitbook.io/leetcode/solutions/0195-tenth-line.md)
- [0196. Delete Duplicate Emails](https://jaywin.gitbook.io/leetcode/solutions/0196-delete-duplicate-emails.md)
- [0197. Rising Temperature](https://jaywin.gitbook.io/leetcode/solutions/0197-rising-temperature.md)
- [0198. House Robber](https://jaywin.gitbook.io/leetcode/solutions/0198-house-robber.md)
- [0199. Binary Tree Right Side View](https://jaywin.gitbook.io/leetcode/solutions/0199-binary-tree-right-side-view.md)
- [0200. Number of Islands](https://jaywin.gitbook.io/leetcode/solutions/0200-number-of-islands.md)
- [0201. Bitwise AND of Numbers Range](https://jaywin.gitbook.io/leetcode/solutions/0201-bitwise-and-of-numbers-range.md)
- [0202. Happy Number](https://jaywin.gitbook.io/leetcode/solutions/0202-happy-number.md)
- [0203. Remove Linked List Elements](https://jaywin.gitbook.io/leetcode/solutions/0203-remove-linked-list-elements.md)
- [0204. Count Primes](https://jaywin.gitbook.io/leetcode/solutions/0204-count-primes.md)
- [0205. Isomorphic Strings](https://jaywin.gitbook.io/leetcode/solutions/0205-isomorphic-strings.md)
- [0206. Reverse Linked List](https://jaywin.gitbook.io/leetcode/solutions/0206-reverse-linked-list.md)
- [0207. Course Schedule](https://jaywin.gitbook.io/leetcode/solutions/0207-course-schedule.md)
- [0208. Implement Trie (solutions/Prefix Tree)](https://jaywin.gitbook.io/leetcode/solutions/0208-implement-trie-prefix-tree.md)
- [0209. Minimum Size Subarray Sum](https://jaywin.gitbook.io/leetcode/solutions/0209-minimum-size-subarray-sum.md)
- [0210. Course Schedule II](https://jaywin.gitbook.io/leetcode/solutions/0210-course-schedule-ii.md)
- [0211. Design Add and Search Words Data Structure](https://jaywin.gitbook.io/leetcode/solutions/0211-design-add-and-search-words-data-structure.md)
- [0212. Word Search II](https://jaywin.gitbook.io/leetcode/solutions/0212-word-search-ii.md)
- [0213. House Robber II](https://jaywin.gitbook.io/leetcode/solutions/0213-house-robber-ii.md)
- [0214. Shortest Palindrome](https://jaywin.gitbook.io/leetcode/solutions/0214-shortest-palindrome.md)
- [0215. Kth Largest Element in an Array](https://jaywin.gitbook.io/leetcode/solutions/0215-kth-largest-element-in-an-array.md)
- [0216. Combination Sum III](https://jaywin.gitbook.io/leetcode/solutions/0216-combination-sum-iii.md)
- [0217. Contains Duplicate](https://jaywin.gitbook.io/leetcode/solutions/0217-contains-duplicate.md)
- [0218. The Skyline Problem](https://jaywin.gitbook.io/leetcode/solutions/0218-the-skyline-problem.md)
- [0219. Contains Duplicate II](https://jaywin.gitbook.io/leetcode/solutions/0219-contains-duplicate-ii.md)
- [0220. Contains Duplicate III](https://jaywin.gitbook.io/leetcode/solutions/0220-contains-duplicate-iii.md)
- [0221. Maximal Square](https://jaywin.gitbook.io/leetcode/solutions/0221-maximal-square.md)
- [0222. Count Complete Tree Nodes](https://jaywin.gitbook.io/leetcode/solutions/0222-count-complete-tree-nodes.md)
- [0223. Rectangle Area](https://jaywin.gitbook.io/leetcode/solutions/0223-rectangle-area.md)
- [0224. Basic Calculator](https://jaywin.gitbook.io/leetcode/solutions/0224-basic-calculator.md)
- [0225. Implement Stack using Queues](https://jaywin.gitbook.io/leetcode/solutions/0225-implement-stack-using-queues.md)
- [0226. Invert Binary Tree](https://jaywin.gitbook.io/leetcode/solutions/0226-invert-binary-tree.md)
- [0227. Basic Calculator II](https://jaywin.gitbook.io/leetcode/solutions/0227-basic-calculator-ii.md)
- [0228. Summary Ranges](https://jaywin.gitbook.io/leetcode/solutions/0228-summary-ranges.md)
- [0229. Majority Element II](https://jaywin.gitbook.io/leetcode/solutions/0229-majority-element-ii.md)
- [0230. Kth Smallest Element in a BST](https://jaywin.gitbook.io/leetcode/solutions/0230-kth-smallest-element-in-a-bst.md)
- [0231. Power of Two](https://jaywin.gitbook.io/leetcode/solutions/0231-power-of-two.md)
- [0232. Implement Queue using Stacks](https://jaywin.gitbook.io/leetcode/solutions/0232-implement-queue-using-stacks.md)
- [0233. Number of Digit One](https://jaywin.gitbook.io/leetcode/solutions/0233-number-of-digit-one.md)
- [0234. Palindrome Linked List](https://jaywin.gitbook.io/leetcode/solutions/0234-palindrome-linked-list.md)
- [0235. Lowest Common Ancestor of a Binary Search Tree](https://jaywin.gitbook.io/leetcode/solutions/0235-lowest-common-ancestor-of-a-binary-search-tree.md)
- [0236. Lowest Common Ancestor of a Binary Tree](https://jaywin.gitbook.io/leetcode/solutions/0236-lowest-common-ancestor-of-a-binary-tree.md)
- [0237. Delete Node in a Linked List](https://jaywin.gitbook.io/leetcode/solutions/0237-delete-node-in-a-linked-list.md)
- [0238. Product of Array Except Self](https://jaywin.gitbook.io/leetcode/solutions/0238-product-of-array-except-self.md)
- [0239. Sliding Window Maximum](https://jaywin.gitbook.io/leetcode/solutions/0239-sliding-window-maximum.md)
- [0240. Search a 2D Matrix II](https://jaywin.gitbook.io/leetcode/solutions/0240-search-a-2d-matrix-ii.md)
- [0241. Different Ways to Add Parentheses](https://jaywin.gitbook.io/leetcode/solutions/0241-different-ways-to-add-parentheses.md)
- [0242. Valid Anagram](https://jaywin.gitbook.io/leetcode/solutions/0242-valid-anagram.md)
- [0243. Shortest Word Distance](https://jaywin.gitbook.io/leetcode/solutions/0243-shortest-word-distance.md)
- [0244. Shortest Word Distance II](https://jaywin.gitbook.io/leetcode/solutions/0244-shortest-word-distance-ii.md)
- [0245. Shortest Word Distance III](https://jaywin.gitbook.io/leetcode/solutions/0245-shortest-word-distance-iii.md)
- [0246. Strobogrammatic Number](https://jaywin.gitbook.io/leetcode/solutions/0246-strobogrammatic-number.md)
- [0247. Strobogrammatic Number II](https://jaywin.gitbook.io/leetcode/solutions/0247-strobogrammatic-number-ii.md)
- [0248. Strobogrammatic Number III](https://jaywin.gitbook.io/leetcode/solutions/0248-strobogrammatic-number-iii.md)
- [0249. Group Shifted Strings](https://jaywin.gitbook.io/leetcode/solutions/0249-group-shifted-strings.md)
- [0250. Count Univalue Subtrees](https://jaywin.gitbook.io/leetcode/solutions/0250-count-univalue-subtrees.md)
- [0251. Flatten 2D Vector](https://jaywin.gitbook.io/leetcode/solutions/0251-flatten-2d-vector.md)
- [0252. Meeting Rooms](https://jaywin.gitbook.io/leetcode/solutions/0252-meeting-rooms.md)
- [0253. Meeting Rooms II](https://jaywin.gitbook.io/leetcode/solutions/0253-meeting-rooms-ii.md)
- [0254. Factor Combinations](https://jaywin.gitbook.io/leetcode/solutions/0254-factor-combinations.md)
- [0255. Verify Preorder Sequence in Binary Search Tree](https://jaywin.gitbook.io/leetcode/solutions/0255-verify-preorder-sequence-in-binary-search-tree.md)
- [0256. Paint House](https://jaywin.gitbook.io/leetcode/solutions/0256-paint-house.md)
- [0257. Binary Tree Paths](https://jaywin.gitbook.io/leetcode/solutions/0257-binary-tree-paths.md)
- [0258. Add Digits](https://jaywin.gitbook.io/leetcode/solutions/0258-add-digits.md)
- [0259. 3Sum Smaller](https://jaywin.gitbook.io/leetcode/solutions/0259-3sum-smaller.md)
- [0260. Single Number III](https://jaywin.gitbook.io/leetcode/solutions/0260-single-number-iii.md)
- [0261. Graph Valid Tree](https://jaywin.gitbook.io/leetcode/solutions/0261-graph-valid-tree.md)
- [0262. Trips and Users](https://jaywin.gitbook.io/leetcode/solutions/0262-trips-and-users.md)
- [0263. Ugly Number](https://jaywin.gitbook.io/leetcode/solutions/0263-ugly-number.md)
- [0264. Ugly Number II](https://jaywin.gitbook.io/leetcode/solutions/0264-ugly-number-ii.md)
- [0265. Paint House II](https://jaywin.gitbook.io/leetcode/solutions/0265-paint-house-ii.md)
- [0266. Palindrome Permutation](https://jaywin.gitbook.io/leetcode/solutions/0266-palindrome-permutation.md)
- [0267. Palindrome Permutation II](https://jaywin.gitbook.io/leetcode/solutions/0267-palindrome-permutation-ii.md)
- [0268. Missing Number](https://jaywin.gitbook.io/leetcode/solutions/0268-missing-number.md)
- [0269. Alien Dictionary](https://jaywin.gitbook.io/leetcode/solutions/0269-alien-dictionary.md)
- [0270. Closest Binary Search Tree Value](https://jaywin.gitbook.io/leetcode/solutions/0270-closest-binary-search-tree-value.md)
- [0271. Encode and Decode Strings](https://jaywin.gitbook.io/leetcode/solutions/0271-encode-and-decode-strings.md)
- [0272. Closest Binary Search Tree Value II](https://jaywin.gitbook.io/leetcode/solutions/0272-closest-binary-search-tree-value-ii.md)
- [0273. Integer to English Words](https://jaywin.gitbook.io/leetcode/solutions/0273-integer-to-english-words.md)
- [0274. H-Index](https://jaywin.gitbook.io/leetcode/solutions/0274-h-index.md)
- [0275. H-Index II](https://jaywin.gitbook.io/leetcode/solutions/0275-h-index-ii.md)
- [0276. Paint Fence](https://jaywin.gitbook.io/leetcode/solutions/0276-paint-fence.md)
- [0277. Find the Celebrity](https://jaywin.gitbook.io/leetcode/solutions/0277-find-the-celebrity.md)
- [0278. First Bad Version](https://jaywin.gitbook.io/leetcode/solutions/0278-first-bad-version.md)
- [0279. Perfect Squares](https://jaywin.gitbook.io/leetcode/solutions/0279-perfect-squares.md)
- [0280. Wiggle Sort](https://jaywin.gitbook.io/leetcode/solutions/0280-wiggle-sort.md)
- [0281. Zigzag Iterator](https://jaywin.gitbook.io/leetcode/solutions/0281-zigzag-iterator.md)
- [0282. Expression Add Operators](https://jaywin.gitbook.io/leetcode/solutions/0282-expression-add-operators.md)
- [0283. Move Zeroes](https://jaywin.gitbook.io/leetcode/solutions/0283-move-zeroes.md)
- [0284. Peeking Iterator](https://jaywin.gitbook.io/leetcode/solutions/0284-peeking-iterator.md)
- [0285. Inorder Successor in BST](https://jaywin.gitbook.io/leetcode/solutions/0285-inorder-successor-in-bst.md)
- [0286. Walls and Gates](https://jaywin.gitbook.io/leetcode/solutions/0286-walls-and-gates.md)
- [0287. Find the Duplicate Number](https://jaywin.gitbook.io/leetcode/solutions/0287-find-the-duplicate-number.md)
- [0288. Unique Word Abbreviation](https://jaywin.gitbook.io/leetcode/solutions/0288-unique-word-abbreviation.md)
- [0289. Game of Life](https://jaywin.gitbook.io/leetcode/solutions/0289-game-of-life.md)
- [0290. Word Pattern](https://jaywin.gitbook.io/leetcode/solutions/0290-word-pattern.md)
- [0291. Word Pattern II](https://jaywin.gitbook.io/leetcode/solutions/0291-word-pattern-ii.md)
- [0292. Nim Game](https://jaywin.gitbook.io/leetcode/solutions/0292-nim-game.md)
- [0293. Flip Game](https://jaywin.gitbook.io/leetcode/solutions/0293-flip-game.md)
- [0294. Flip Game II](https://jaywin.gitbook.io/leetcode/solutions/0294-flip-game-ii.md)
- [0295. Find Median from Data Stream](https://jaywin.gitbook.io/leetcode/solutions/0295-find-median-from-data-stream.md)
- [0296. Best Meeting Point](https://jaywin.gitbook.io/leetcode/solutions/0296-best-meeting-point.md)
- [0297. Serialize and Deserialize Binary Tree](https://jaywin.gitbook.io/leetcode/solutions/0297-serialize-and-deserialize-binary-tree.md)
- [0298. Binary Tree Longest Consecutive Sequence](https://jaywin.gitbook.io/leetcode/solutions/0298-binary-tree-longest-consecutive-sequence.md)
- [0299. Bulls and Cows](https://jaywin.gitbook.io/leetcode/solutions/0299-bulls-and-cows.md)
- [0300. Longest Increasing Subsequence](https://jaywin.gitbook.io/leetcode/solutions/0300-longest-increasing-subsequence.md)
- [0301. Remove Invalid Parentheses](https://jaywin.gitbook.io/leetcode/solutions/0301-remove-invalid-parentheses.md)
- [0302. Smallest Rectangle Enclosing Black Pixels](https://jaywin.gitbook.io/leetcode/solutions/0302-smallest-rectangle-enclosing-black-pixels.md)
- [0303. Range Sum Query - Immutable](https://jaywin.gitbook.io/leetcode/solutions/0303-range-sum-query-immutable.md)
- [0304. Range Sum Query 2D - Immutable](https://jaywin.gitbook.io/leetcode/solutions/0304-range-sum-query-2d-immutable.md)
- [0305. Number of Islands II](https://jaywin.gitbook.io/leetcode/solutions/0305-number-of-islands-ii.md)
- [0306. Additive Number](https://jaywin.gitbook.io/leetcode/solutions/0306-additive-number.md)
- [0307. Range Sum Query - Mutable](https://jaywin.gitbook.io/leetcode/solutions/0307-range-sum-query-mutable.md)
- [0308. Range Sum Query 2D - Mutable](https://jaywin.gitbook.io/leetcode/solutions/0308-range-sum-query-2d-mutable.md)
- [0309. Best Time to Buy and Sell Stock with Cooldown](https://jaywin.gitbook.io/leetcode/solutions/0309-best-time-to-buy-and-sell-stock-with-cooldown.md)
- [0310. Minimum Height Trees](https://jaywin.gitbook.io/leetcode/solutions/0310-minimum-height-trees.md)
- [0311. Sparse Matrix Multiplication](https://jaywin.gitbook.io/leetcode/solutions/0311-sparse-matrix-multiplication.md)
- [0312. Burst Balloons](https://jaywin.gitbook.io/leetcode/solutions/0312-burst-balloons.md)
- [0313. Super Ugly Number](https://jaywin.gitbook.io/leetcode/solutions/0313-super-ugly-number.md)
- [0314. Binary Tree Vertical Order Traversal](https://jaywin.gitbook.io/leetcode/solutions/0314-binary-tree-vertical-order-traversal.md)
- [0315. Count of Smaller Numbers After Self](https://jaywin.gitbook.io/leetcode/solutions/0315-count-of-smaller-numbers-after-self.md)
- [0316. Remove Duplicate Letters](https://jaywin.gitbook.io/leetcode/solutions/0316-remove-duplicate-letters.md)
- [0317. Shortest Distance from All Buildings](https://jaywin.gitbook.io/leetcode/solutions/0317-shortest-distance-from-all-buildings.md)
- [0318. Maximum Product of Word Lengths](https://jaywin.gitbook.io/leetcode/solutions/0318-maximum-product-of-word-lengths.md)
- [0319. Bulb Switcher](https://jaywin.gitbook.io/leetcode/solutions/0319-bulb-switcher.md)
- [0320. Generalized Abbreviation](https://jaywin.gitbook.io/leetcode/solutions/0320-generalized-abbreviation.md)
- [0321. Create Maximum Number](https://jaywin.gitbook.io/leetcode/solutions/0321-create-maximum-number.md)
- [0322. Coin Change](https://jaywin.gitbook.io/leetcode/solutions/0322-coin-change.md)
- [0323. Number of Connected Components in an Undirected Graph](https://jaywin.gitbook.io/leetcode/solutions/0323-number-of-connected-components-in-an-undirected-graph.md)
- [0324. Wiggle Sort II](https://jaywin.gitbook.io/leetcode/solutions/0324-wiggle-sort-ii.md)
- [0325. Maximum Size Subarray Sum Equals k](https://jaywin.gitbook.io/leetcode/solutions/0325-maximum-size-subarray-sum-equals-k.md)
- [0326. Power of Three](https://jaywin.gitbook.io/leetcode/solutions/0326-power-of-three.md)
- [0327. Count of Range Sum](https://jaywin.gitbook.io/leetcode/solutions/0327-count-of-range-sum.md)
- [0328. Odd Even Linked List](https://jaywin.gitbook.io/leetcode/solutions/0328-odd-even-linked-list.md)
- [0329. Longest Increasing Path in a Matrix](https://jaywin.gitbook.io/leetcode/solutions/0329-longest-increasing-path-in-a-matrix.md)
- [0330. Patching Array](https://jaywin.gitbook.io/leetcode/solutions/0330-patching-array.md)
- [0331. Verify Preorder Serialization of a Binary Tree](https://jaywin.gitbook.io/leetcode/solutions/0331-verify-preorder-serialization-of-a-binary-tree.md)
- [0332. Reconstruct Itinerary](https://jaywin.gitbook.io/leetcode/solutions/0332-reconstruct-itinerary.md)
- [0333. Largest BST Subtree](https://jaywin.gitbook.io/leetcode/solutions/0333-largest-bst-subtree.md)
- [0334. Increasing Triplet Subsequence](https://jaywin.gitbook.io/leetcode/solutions/0334-increasing-triplet-subsequence.md)
- [0335. Self Crossing](https://jaywin.gitbook.io/leetcode/solutions/0335-self-crossing.md)
- [0336. Palindrome Pairs](https://jaywin.gitbook.io/leetcode/solutions/0336-palindrome-pairs.md)
- [0337. House Robber III](https://jaywin.gitbook.io/leetcode/solutions/0337-house-robber-iii.md)
- [0338. Counting Bits](https://jaywin.gitbook.io/leetcode/solutions/0338-counting-bits.md)
- [0339. Nested List Weight Sum](https://jaywin.gitbook.io/leetcode/solutions/0339-nested-list-weight-sum.md)
- [0340. Longest Substring with At Most K Distinct Characters](https://jaywin.gitbook.io/leetcode/solutions/0340-longest-substring-with-at-most-k-distinct-characters.md)
- [0341. Flatten Nested List Iterator](https://jaywin.gitbook.io/leetcode/solutions/0341-flatten-nested-list-iterator.md)
- [0342. Power of Four](https://jaywin.gitbook.io/leetcode/solutions/0342-power-of-four.md)
- [0343. Integer Break](https://jaywin.gitbook.io/leetcode/solutions/0343-integer-break.md)
- [0344. Reverse String](https://jaywin.gitbook.io/leetcode/solutions/0344-reverse-string.md)
- [0345. Reverse Vowels of a String](https://jaywin.gitbook.io/leetcode/solutions/0345-reverse-vowels-of-a-string.md)
- [0346. Moving Average from Data Stream](https://jaywin.gitbook.io/leetcode/solutions/0346-moving-average-from-data-stream.md)
- [0347. Top K Frequent Elements](https://jaywin.gitbook.io/leetcode/solutions/0347-top-k-frequent-elements.md)
- [0348. Design Tic-Tac-Toe](https://jaywin.gitbook.io/leetcode/solutions/0348-design-tic-tac-toe.md)
- [0349. Intersection of Two Arrays](https://jaywin.gitbook.io/leetcode/solutions/0349-intersection-of-two-arrays.md)
- [0350. Intersection of Two Arrays II](https://jaywin.gitbook.io/leetcode/solutions/0350-intersection-of-two-arrays-ii.md)
- [0351. Android Unlock Patterns](https://jaywin.gitbook.io/leetcode/solutions/0351-android-unlock-patterns.md)
- [0352. Data Stream as Disjoint Intervals](https://jaywin.gitbook.io/leetcode/solutions/0352-data-stream-as-disjoint-intervals.md)
- [0353. Design Snake Game](https://jaywin.gitbook.io/leetcode/solutions/0353-design-snake-game.md)
- [0354. Russian Doll Envelopes](https://jaywin.gitbook.io/leetcode/solutions/0354-russian-doll-envelopes.md)
- [0355. Design Twitter](https://jaywin.gitbook.io/leetcode/solutions/0355-design-twitter.md)
- [0356. Line Reflection](https://jaywin.gitbook.io/leetcode/solutions/0356-line-reflection.md)
- [0357. Count Numbers with Unique Digits](https://jaywin.gitbook.io/leetcode/solutions/0357-count-numbers-with-unique-digits.md)
- [0358. Rearrange String k Distance Apart](https://jaywin.gitbook.io/leetcode/solutions/0358-rearrange-string-k-distance-apart.md)
- [0359. Logger Rate Limiter](https://jaywin.gitbook.io/leetcode/solutions/0359-logger-rate-limiter.md)
- [0360. Sort Transformed Array](https://jaywin.gitbook.io/leetcode/solutions/0360-sort-transformed-array.md)
- [0361. Bomb Enemy](https://jaywin.gitbook.io/leetcode/solutions/0361-bomb-enemy.md)
- [0362. Design Hit Counter](https://jaywin.gitbook.io/leetcode/solutions/0362-design-hit-counter.md)
- [0363. Max Sum of Rectangle No Larger Than K](https://jaywin.gitbook.io/leetcode/solutions/0363-max-sum-of-rectangle-no-larger-than-k.md)
- [0364. Nested List Weight Sum II](https://jaywin.gitbook.io/leetcode/solutions/0364-nested-list-weight-sum-ii.md)
- [0365. Water and Jug Problem](https://jaywin.gitbook.io/leetcode/solutions/0365-water-and-jug-problem.md)
- [0366. Find Leaves of Binary Tree](https://jaywin.gitbook.io/leetcode/solutions/0366-find-leaves-of-binary-tree.md)
- [0367. Valid Perfect Square](https://jaywin.gitbook.io/leetcode/solutions/0367-valid-perfect-square.md)
- [0368. Largest Divisible Subset](https://jaywin.gitbook.io/leetcode/solutions/0368-largest-divisible-subset.md)
- [0369. Plus One Linked List](https://jaywin.gitbook.io/leetcode/solutions/0369-plus-one-linked-list.md)
- [0370. Range Addition](https://jaywin.gitbook.io/leetcode/solutions/0370-range-addition.md)
- [0371. Sum of Two Integers](https://jaywin.gitbook.io/leetcode/solutions/0371-sum-of-two-integers.md)
- [0372. Super Pow](https://jaywin.gitbook.io/leetcode/solutions/0372-super-pow.md)
- [0373. Find K Pairs with Smallest Sums](https://jaywin.gitbook.io/leetcode/solutions/0373-find-k-pairs-with-smallest-sums.md)
- [0374. Guess Number Higher or Lower](https://jaywin.gitbook.io/leetcode/solutions/0374-guess-number-higher-or-lower.md)
- [0375. Guess Number Higher or Lower II](https://jaywin.gitbook.io/leetcode/solutions/0375-guess-number-higher-or-lower-ii.md)
- [0376. Wiggle Subsequence](https://jaywin.gitbook.io/leetcode/solutions/0376-wiggle-subsequence.md)
- [0377. Combination Sum IV](https://jaywin.gitbook.io/leetcode/solutions/0377-combination-sum-iv.md)
- [0378. Kth Smallest Element in a Sorted Matrix](https://jaywin.gitbook.io/leetcode/solutions/0378-kth-smallest-element-in-a-sorted-matrix.md)
- [0379. Design Phone Directory](https://jaywin.gitbook.io/leetcode/solutions/0379-design-phone-directory.md)
- [0380. Insert Delete GetRandom O(solutions/1)](https://jaywin.gitbook.io/leetcode/solutions/0380-insert-delete-getrandom-o1.md)
- [0381. Insert Delete GetRandom O(solutions/1) - Duplicates allowed](https://jaywin.gitbook.io/leetcode/solutions/0381-insert-delete-getrandom-o1-duplicates-allowed.md)
- [0382. Linked List Random Node](https://jaywin.gitbook.io/leetcode/solutions/0382-linked-list-random-node.md)
- [0383. Ransom Note](https://jaywin.gitbook.io/leetcode/solutions/0383-ransom-note.md)
- [0384. Shuffle an Array](https://jaywin.gitbook.io/leetcode/solutions/0384-shuffle-an-array.md)
- [0385. Mini Parser](https://jaywin.gitbook.io/leetcode/solutions/0385-mini-parser.md)
- [0386. Lexicographical Numbers](https://jaywin.gitbook.io/leetcode/solutions/0386-lexicographical-numbers.md)
- [0387. First Unique Character in a String](https://jaywin.gitbook.io/leetcode/solutions/0387-first-unique-character-in-a-string.md)
- [0388. Longest Absolute File Path](https://jaywin.gitbook.io/leetcode/solutions/0388-longest-absolute-file-path.md)
- [0389. Find the Difference](https://jaywin.gitbook.io/leetcode/solutions/0389-find-the-difference.md)
- [0390. Elimination Game](https://jaywin.gitbook.io/leetcode/solutions/0390-elimination-game.md)
- [0391. Perfect Rectangle](https://jaywin.gitbook.io/leetcode/solutions/0391-perfect-rectangle.md)
- [0392. Is Subsequence](https://jaywin.gitbook.io/leetcode/solutions/0392-is-subsequence.md)
- [0393. UTF-8 Validation](https://jaywin.gitbook.io/leetcode/solutions/0393-utf-8-validation.md)
- [0394. Decode String](https://jaywin.gitbook.io/leetcode/solutions/0394-decode-string.md)
- [0395. Longest Substring with At Least K Repeating Characters](https://jaywin.gitbook.io/leetcode/solutions/0395-longest-substring-with-at-least-k-repeating-characters.md)
- [0396. Rotate Function](https://jaywin.gitbook.io/leetcode/solutions/0396-rotate-function.md)
- [0397. Integer Replacement](https://jaywin.gitbook.io/leetcode/solutions/0397-integer-replacement.md)
- [0398. Random Pick Index](https://jaywin.gitbook.io/leetcode/solutions/0398-random-pick-index.md)
- [0399. Evaluate Division](https://jaywin.gitbook.io/leetcode/solutions/0399-evaluate-division.md)
- [0400. Nth Digit](https://jaywin.gitbook.io/leetcode/solutions/0400-nth-digit.md)
- [0401. Binary Watch](https://jaywin.gitbook.io/leetcode/solutions/0401-binary-watch.md)
- [0402. Remove K Digits](https://jaywin.gitbook.io/leetcode/solutions/0402-remove-k-digits.md)
- [0403. Frog Jump](https://jaywin.gitbook.io/leetcode/solutions/0403-frog-jump.md)
- [0404. Sum of Left Leaves](https://jaywin.gitbook.io/leetcode/solutions/0404-sum-of-left-leaves.md)
- [0405. Convert a Number to Hexadecimal](https://jaywin.gitbook.io/leetcode/solutions/0405-convert-a-number-to-hexadecimal.md)
- [0406. Queue Reconstruction by Height](https://jaywin.gitbook.io/leetcode/solutions/0406-queue-reconstruction-by-height.md)
- [0407. Trapping Rain Water II](https://jaywin.gitbook.io/leetcode/solutions/0407-trapping-rain-water-ii.md)
- [0408. Valid Word Abbreviation](https://jaywin.gitbook.io/leetcode/solutions/0408-valid-word-abbreviation.md)
- [0409. Longest Palindrome](https://jaywin.gitbook.io/leetcode/solutions/0409-longest-palindrome.md)
- [0410. Split Array Largest Sum](https://jaywin.gitbook.io/leetcode/solutions/0410-split-array-largest-sum.md)
- [0411. Minimum Unique Word Abbreviation](https://jaywin.gitbook.io/leetcode/solutions/0411-minimum-unique-word-abbreviation.md)
- [0412. Fizz Buzz](https://jaywin.gitbook.io/leetcode/solutions/0412-fizz-buzz.md)
- [0413. Arithmetic Slices](https://jaywin.gitbook.io/leetcode/solutions/0413-arithmetic-slices.md)
- [0414. Third Maximum Number](https://jaywin.gitbook.io/leetcode/solutions/0414-third-maximum-number.md)
- [0415. Add Strings](https://jaywin.gitbook.io/leetcode/solutions/0415-add-strings.md)
- [0416. Partition Equal Subset Sum](https://jaywin.gitbook.io/leetcode/solutions/0416-partition-equal-subset-sum.md)
- [0417. Pacific Atlantic Water Flow](https://jaywin.gitbook.io/leetcode/solutions/0417-pacific-atlantic-water-flow.md)
- [0418. Sentence Screen Fitting](https://jaywin.gitbook.io/leetcode/solutions/0418-sentence-screen-fitting.md)
- [0419. Battleships in a Board](https://jaywin.gitbook.io/leetcode/solutions/0419-battleships-in-a-board.md)
- [0420. Strong Password Checker](https://jaywin.gitbook.io/leetcode/solutions/0420-strong-password-checker.md)
- [0421. Maximum XOR of Two Numbers in an Array](https://jaywin.gitbook.io/leetcode/solutions/0421-maximum-xor-of-two-numbers-in-an-array.md)
- [0422. Valid Word Square](https://jaywin.gitbook.io/leetcode/solutions/0422-valid-word-square.md)
- [0423. Reconstruct Original Digits from English](https://jaywin.gitbook.io/leetcode/solutions/0423-reconstruct-original-digits-from-english.md)
- [0424. Longest Repeating Character Replacement](https://jaywin.gitbook.io/leetcode/solutions/0424-longest-repeating-character-replacement.md)
- [0425. Word Squares](https://jaywin.gitbook.io/leetcode/solutions/0425-word-squares.md)
- [0426. Convert Binary Search Tree to Sorted Doubly Linked List](https://jaywin.gitbook.io/leetcode/solutions/0426-convert-binary-search-tree-to-sorted-doubly-linked-list.md)
- [0427. Construct Quad Tree](https://jaywin.gitbook.io/leetcode/solutions/0427-construct-quad-tree.md)
- [0428. Serialize and Deserialize N-ary Tree](https://jaywin.gitbook.io/leetcode/solutions/0428-serialize-and-deserialize-n-ary-tree.md)
- [0429. N-ary Tree Level Order Traversal](https://jaywin.gitbook.io/leetcode/solutions/0429-n-ary-tree-level-order-traversal.md)
- [0430. Flatten a Multilevel Doubly Linked List](https://jaywin.gitbook.io/leetcode/solutions/0430-flatten-a-multilevel-doubly-linked-list.md)
- [0431. Encode N-ary Tree to Binary Tree](https://jaywin.gitbook.io/leetcode/solutions/0431-encode-n-ary-tree-to-binary-tree.md)
- [0432. All O\`one Data Structure](https://jaywin.gitbook.io/leetcode/solutions/0432-all-oone-data-structure.md)
- [0433. Minimum Genetic Mutation](https://jaywin.gitbook.io/leetcode/solutions/0433-minimum-genetic-mutation.md)
- [0434. Number of Segments in a String](https://jaywin.gitbook.io/leetcode/solutions/0434-number-of-segments-in-a-string.md)
- [0435. Non-overlapping Intervals](https://jaywin.gitbook.io/leetcode/solutions/0435-non-overlapping-intervals.md)
- [0436. Find Right Interval](https://jaywin.gitbook.io/leetcode/solutions/0436-find-right-interval.md)
- [0437. Path Sum III](https://jaywin.gitbook.io/leetcode/solutions/0437-path-sum-iii.md)
- [0438. Find All Anagrams in a String](https://jaywin.gitbook.io/leetcode/solutions/0438-find-all-anagrams-in-a-string.md)
- [0439. Ternary Expression Parser](https://jaywin.gitbook.io/leetcode/solutions/0439-ternary-expression-parser.md)
- [0440. K-th Smallest in Lexicographical Order](https://jaywin.gitbook.io/leetcode/solutions/0440-k-th-smallest-in-lexicographical-order.md)
- [0441. Arranging Coins](https://jaywin.gitbook.io/leetcode/solutions/0441-arranging-coins.md)
- [0442. Find All Duplicates in an Array](https://jaywin.gitbook.io/leetcode/solutions/0442-find-all-duplicates-in-an-array.md)
- [0443. String Compression](https://jaywin.gitbook.io/leetcode/solutions/0443-string-compression.md)
- [0444. Sequence Reconstruction](https://jaywin.gitbook.io/leetcode/solutions/0444-sequence-reconstruction.md)
- [0445. Add Two Numbers II](https://jaywin.gitbook.io/leetcode/solutions/0445-add-two-numbers-ii.md)
- [0446. Arithmetic Slices II - Subsequence](https://jaywin.gitbook.io/leetcode/solutions/0446-arithmetic-slices-ii-subsequence.md)
- [0447. Number of Boomerangs](https://jaywin.gitbook.io/leetcode/solutions/0447-number-of-boomerangs.md)
- [0448. Find All Numbers Disappeared in an Array](https://jaywin.gitbook.io/leetcode/solutions/0448-find-all-numbers-disappeared-in-an-array.md)
- [0449. Serialize and Deserialize BST](https://jaywin.gitbook.io/leetcode/solutions/0449-serialize-and-deserialize-bst.md)
- [0450. Delete Node in a BST](https://jaywin.gitbook.io/leetcode/solutions/0450-delete-node-in-a-bst.md)
- [0451. Sort Characters By Frequency](https://jaywin.gitbook.io/leetcode/solutions/0451-sort-characters-by-frequency.md)
- [0452. Minimum Number of Arrows to Burst Balloons](https://jaywin.gitbook.io/leetcode/solutions/0452-minimum-number-of-arrows-to-burst-balloons.md)
- [0453. Minimum Moves to Equal Array Elements](https://jaywin.gitbook.io/leetcode/solutions/0453-minimum-moves-to-equal-array-elements.md)
- [0454. 4Sum II](https://jaywin.gitbook.io/leetcode/solutions/0454-4sum-ii.md)
- [0455. Assign Cookies](https://jaywin.gitbook.io/leetcode/solutions/0455-assign-cookies.md)
- [0456. 132 Pattern](https://jaywin.gitbook.io/leetcode/solutions/0456-132-pattern.md)
- [0457. Circular Array Loop](https://jaywin.gitbook.io/leetcode/solutions/0457-circular-array-loop.md)
- [0458. Poor Pigs](https://jaywin.gitbook.io/leetcode/solutions/0458-poor-pigs.md)
- [0459. Repeated Substring Pattern](https://jaywin.gitbook.io/leetcode/solutions/0459-repeated-substring-pattern.md)
- [0460. LFU Cache](https://jaywin.gitbook.io/leetcode/solutions/0460-lfu-cache.md)
- [0461. Hamming Distance](https://jaywin.gitbook.io/leetcode/solutions/0461-hamming-distance.md)
- [0462. Minimum Moves to Equal Array Elements II](https://jaywin.gitbook.io/leetcode/solutions/0462-minimum-moves-to-equal-array-elements-ii.md)
- [0463. Island Perimeter](https://jaywin.gitbook.io/leetcode/solutions/0463-island-perimeter.md)
- [0464. Can I Win](https://jaywin.gitbook.io/leetcode/solutions/0464-can-i-win.md)
- [0465. Optimal Account Balancing](https://jaywin.gitbook.io/leetcode/solutions/0465-optimal-account-balancing.md)
- [0466. Count The Repetitions](https://jaywin.gitbook.io/leetcode/solutions/0466-count-the-repetitions.md)
- [0467. Unique Substrings in Wraparound String](https://jaywin.gitbook.io/leetcode/solutions/0467-unique-substrings-in-wraparound-string.md)
- [0468. Validate IP Address](https://jaywin.gitbook.io/leetcode/solutions/0468-validate-ip-address.md)
- [0469. Convex Polygon](https://jaywin.gitbook.io/leetcode/solutions/0469-convex-polygon.md)
- [0470. Implement Rand10(solutions/) Using Rand7(solutions/)](https://jaywin.gitbook.io/leetcode/solutions/0470-implement-rand10-using-rand7.md)
- [0471. Encode String with Shortest Length](https://jaywin.gitbook.io/leetcode/solutions/0471-encode-string-with-shortest-length.md)
- [0472. Concatenated Words](https://jaywin.gitbook.io/leetcode/solutions/0472-concatenated-words.md)
- [0473. Matchsticks to Square](https://jaywin.gitbook.io/leetcode/solutions/0473-matchsticks-to-square.md)
- [0474. Ones and Zeroes](https://jaywin.gitbook.io/leetcode/solutions/0474-ones-and-zeroes.md)
- [0475. Heaters](https://jaywin.gitbook.io/leetcode/solutions/0475-heaters.md)
- [0476. Number Complement](https://jaywin.gitbook.io/leetcode/solutions/0476-number-complement.md)
- [0477. Total Hamming Distance](https://jaywin.gitbook.io/leetcode/solutions/0477-total-hamming-distance.md)
- [0478. Generate Random Point in a Circle](https://jaywin.gitbook.io/leetcode/solutions/0478-generate-random-point-in-a-circle.md)
- [0479. Largest Palindrome Product](https://jaywin.gitbook.io/leetcode/solutions/0479-largest-palindrome-product.md)
- [0480. Sliding Window Median](https://jaywin.gitbook.io/leetcode/solutions/0480-sliding-window-median.md)
- [0481. Magical String](https://jaywin.gitbook.io/leetcode/solutions/0481-magical-string.md)
- [0482. License Key Formatting](https://jaywin.gitbook.io/leetcode/solutions/0482-license-key-formatting.md)
- [0483. Smallest Good Base](https://jaywin.gitbook.io/leetcode/solutions/0483-smallest-good-base.md)
- [0484. Find Permutation](https://jaywin.gitbook.io/leetcode/solutions/0484-find-permutation.md)
- [0485. Max Consecutive Ones](https://jaywin.gitbook.io/leetcode/solutions/0485-max-consecutive-ones.md)
- [0486. Predict the Winner](https://jaywin.gitbook.io/leetcode/solutions/0486-predict-the-winner.md)
- [0487. Max Consecutive Ones II](https://jaywin.gitbook.io/leetcode/solutions/0487-max-consecutive-ones-ii.md)
- [0488. Zuma Game](https://jaywin.gitbook.io/leetcode/solutions/0488-zuma-game.md)
- [0489. Robot Room Cleaner](https://jaywin.gitbook.io/leetcode/solutions/0489-robot-room-cleaner.md)
- [0490. The Maze](https://jaywin.gitbook.io/leetcode/solutions/0490-the-maze.md)
- [0491. Increasing Subsequences](https://jaywin.gitbook.io/leetcode/solutions/0491-increasing-subsequences.md)
- [0492. Construct the Rectangle](https://jaywin.gitbook.io/leetcode/solutions/0492-construct-the-rectangle.md)
- [0493. Reverse Pairs](https://jaywin.gitbook.io/leetcode/solutions/0493-reverse-pairs.md)
- [0494. Target Sum](https://jaywin.gitbook.io/leetcode/solutions/0494-target-sum.md)
- [0495. Teemo Attacking](https://jaywin.gitbook.io/leetcode/solutions/0495-teemo-attacking.md)
- [0496. Next Greater Element I](https://jaywin.gitbook.io/leetcode/solutions/0496-next-greater-element-i.md)
- [0497. Random Point in Non-overlapping Rectangles](https://jaywin.gitbook.io/leetcode/solutions/0497-random-point-in-non-overlapping-rectangles.md)
- [0498. Diagonal Traverse](https://jaywin.gitbook.io/leetcode/solutions/0498-diagonal-traverse.md)
- [0499. The Maze III](https://jaywin.gitbook.io/leetcode/solutions/0499-the-maze-iii.md)
- [0500. Keyboard Row](https://jaywin.gitbook.io/leetcode/solutions/0500-keyboard-row.md)
- [0501. Find Mode in Binary Search Tree](https://jaywin.gitbook.io/leetcode/solutions/0501-find-mode-in-binary-search-tree.md)
- [0502. IPO](https://jaywin.gitbook.io/leetcode/solutions/0502-ipo.md)
- [0503. Next Greater Element II](https://jaywin.gitbook.io/leetcode/solutions/0503-next-greater-element-ii.md)
- [0504. Base 7](https://jaywin.gitbook.io/leetcode/solutions/0504-base-7.md)
- [0505. The Maze II](https://jaywin.gitbook.io/leetcode/solutions/0505-the-maze-ii.md)
- [0506. Relative Ranks](https://jaywin.gitbook.io/leetcode/solutions/0506-relative-ranks.md)
- [0507. Perfect Number](https://jaywin.gitbook.io/leetcode/solutions/0507-perfect-number.md)
- [0508. Most Frequent Subtree Sum](https://jaywin.gitbook.io/leetcode/solutions/0508-most-frequent-subtree-sum.md)
- [0509. Fibonacci Number](https://jaywin.gitbook.io/leetcode/solutions/0509-fibonacci-number.md)
- [0510. Inorder Successor in BST II](https://jaywin.gitbook.io/leetcode/solutions/0510-inorder-successor-in-bst-ii.md)
- [0511. Game Play Analysis I](https://jaywin.gitbook.io/leetcode/solutions/0511-game-play-analysis-i.md)
- [0512. Game Play Analysis II](https://jaywin.gitbook.io/leetcode/solutions/0512-game-play-analysis-ii.md)
- [0513. Find Bottom Left Tree Value](https://jaywin.gitbook.io/leetcode/solutions/0513-find-bottom-left-tree-value.md)
- [0514. Freedom Trail](https://jaywin.gitbook.io/leetcode/solutions/0514-freedom-trail.md)
- [0515. Find Largest Value in Each Tree Row](https://jaywin.gitbook.io/leetcode/solutions/0515-find-largest-value-in-each-tree-row.md)
- [0516. Longest Palindromic Subsequence](https://jaywin.gitbook.io/leetcode/solutions/0516-longest-palindromic-subsequence.md)
- [0517. Super Washing Machines](https://jaywin.gitbook.io/leetcode/solutions/0517-super-washing-machines.md)
- [0518. Coin Change 2](https://jaywin.gitbook.io/leetcode/solutions/0518-coin-change-2.md)
- [0519. Random Flip Matrix](https://jaywin.gitbook.io/leetcode/solutions/0519-random-flip-matrix.md)
- [0520. Detect Capital](https://jaywin.gitbook.io/leetcode/solutions/0520-detect-capital.md)
- [0521. Longest Uncommon Subsequence I](https://jaywin.gitbook.io/leetcode/solutions/0521-longest-uncommon-subsequence-i.md)
- [0522. Longest Uncommon Subsequence II](https://jaywin.gitbook.io/leetcode/solutions/0522-longest-uncommon-subsequence-ii.md)
- [0523. Continuous Subarray Sum](https://jaywin.gitbook.io/leetcode/solutions/0523-continuous-subarray-sum.md)
- [0524. Longest Word in Dictionary through Deleting](https://jaywin.gitbook.io/leetcode/solutions/0524-longest-word-in-dictionary-through-deleting.md)
- [0525. Contiguous Array](https://jaywin.gitbook.io/leetcode/solutions/0525-contiguous-array.md)
- [0526. Beautiful Arrangement](https://jaywin.gitbook.io/leetcode/solutions/0526-beautiful-arrangement.md)
- [0527. Word Abbreviation](https://jaywin.gitbook.io/leetcode/solutions/0527-word-abbreviation.md)
- [0528. Random Pick with Weight](https://jaywin.gitbook.io/leetcode/solutions/0528-random-pick-with-weight.md)
- [0529. Minesweeper](https://jaywin.gitbook.io/leetcode/solutions/0529-minesweeper.md)
- [0530. Minimum Absolute Difference in BST](https://jaywin.gitbook.io/leetcode/solutions/0530-minimum-absolute-difference-in-bst.md)
- [0531. Lonely Pixel I](https://jaywin.gitbook.io/leetcode/solutions/0531-lonely-pixel-i.md)
- [0532. K-diff Pairs in an Array](https://jaywin.gitbook.io/leetcode/solutions/0532-k-diff-pairs-in-an-array.md)
- [0533. Lonely Pixel II](https://jaywin.gitbook.io/leetcode/solutions/0533-lonely-pixel-ii.md)
- [0534. Game Play Analysis III](https://jaywin.gitbook.io/leetcode/solutions/0534-game-play-analysis-iii.md)
- [0535. Encode and Decode TinyURL](https://jaywin.gitbook.io/leetcode/solutions/0535-encode-and-decode-tinyurl.md)
- [0536. Construct Binary Tree from String](https://jaywin.gitbook.io/leetcode/solutions/0536-construct-binary-tree-from-string.md)
- [0537. Complex Number Multiplication](https://jaywin.gitbook.io/leetcode/solutions/0537-complex-number-multiplication.md)
- [0538. Convert BST to Greater Tree](https://jaywin.gitbook.io/leetcode/solutions/0538-convert-bst-to-greater-tree.md)
- [0539. Minimum Time Difference](https://jaywin.gitbook.io/leetcode/solutions/0539-minimum-time-difference.md)
- [0540. Single Element in a Sorted Array](https://jaywin.gitbook.io/leetcode/solutions/0540-single-element-in-a-sorted-array.md)
- [0541. Reverse String II](https://jaywin.gitbook.io/leetcode/solutions/0541-reverse-string-ii.md)
- [0542. 01 Matrix](https://jaywin.gitbook.io/leetcode/solutions/0542-01-matrix.md)
- [0543. Diameter of Binary Tree](https://jaywin.gitbook.io/leetcode/solutions/0543-diameter-of-binary-tree.md)
- [0544. Output Contest Matches](https://jaywin.gitbook.io/leetcode/solutions/0544-output-contest-matches.md)
- [0545. Boundary of Binary Tree](https://jaywin.gitbook.io/leetcode/solutions/0545-boundary-of-binary-tree.md)
- [0546. Remove Boxes](https://jaywin.gitbook.io/leetcode/solutions/0546-remove-boxes.md)
- [0547. Number of Provinces](https://jaywin.gitbook.io/leetcode/solutions/0547-number-of-provinces.md)
- [0548. Split Array with Equal Sum](https://jaywin.gitbook.io/leetcode/solutions/0548-split-array-with-equal-sum.md)
- [0549. Binary Tree Longest Consecutive Sequence II](https://jaywin.gitbook.io/leetcode/solutions/0549-binary-tree-longest-consecutive-sequence-ii.md)
- [0550. Game Play Analysis IV](https://jaywin.gitbook.io/leetcode/solutions/0550-game-play-analysis-iv.md)
- [0551. Student Attendance Record I](https://jaywin.gitbook.io/leetcode/solutions/0551-student-attendance-record-i.md)
- [0552. Student Attendance Record II](https://jaywin.gitbook.io/leetcode/solutions/0552-student-attendance-record-ii.md)
- [0553. Optimal Division](https://jaywin.gitbook.io/leetcode/solutions/0553-optimal-division.md)
- [0554. Brick Wall](https://jaywin.gitbook.io/leetcode/solutions/0554-brick-wall.md)
- [0555. Split Concatenated Strings](https://jaywin.gitbook.io/leetcode/solutions/0555-split-concatenated-strings.md)
- [0556. Next Greater Element III](https://jaywin.gitbook.io/leetcode/solutions/0556-next-greater-element-iii.md)
- [0557. Reverse Words in a String III](https://jaywin.gitbook.io/leetcode/solutions/0557-reverse-words-in-a-string-iii.md)
- [0558. Logical OR of Two Binary Grids Represented as Quad-Trees](https://jaywin.gitbook.io/leetcode/solutions/0558-logical-or-of-two-binary-grids-represented-as-quad-trees.md)
- [0559. Maximum Depth of N-ary Tree](https://jaywin.gitbook.io/leetcode/solutions/0559-maximum-depth-of-n-ary-tree.md)
- [0560. Subarray Sum Equals K](https://jaywin.gitbook.io/leetcode/solutions/0560-subarray-sum-equals-k.md)
- [0561. Array Partition I](https://jaywin.gitbook.io/leetcode/solutions/0561-array-partition-i.md)
- [0562. Longest Line of Consecutive One in Matrix](https://jaywin.gitbook.io/leetcode/solutions/0562-longest-line-of-consecutive-one-in-matrix.md)
- [0563. Binary Tree Tilt](https://jaywin.gitbook.io/leetcode/solutions/0563-binary-tree-tilt.md)
- [0564. Find the Closest Palindrome](https://jaywin.gitbook.io/leetcode/solutions/0564-find-the-closest-palindrome.md)
- [0565. Array Nesting](https://jaywin.gitbook.io/leetcode/solutions/0565-array-nesting.md)
- [0566. Reshape the Matrix](https://jaywin.gitbook.io/leetcode/solutions/0566-reshape-the-matrix.md)
- [0567. Permutation in String](https://jaywin.gitbook.io/leetcode/solutions/0567-permutation-in-string.md)
- [0568. Maximum Vacation Days](https://jaywin.gitbook.io/leetcode/solutions/0568-maximum-vacation-days.md)
- [0569. Median Employee Salary](https://jaywin.gitbook.io/leetcode/solutions/0569-median-employee-salary.md)
- [0570. Managers with at Least 5 Direct Reports](https://jaywin.gitbook.io/leetcode/solutions/0570-managers-with-at-least-5-direct-reports.md)
- [0571. Find Median Given Frequency of Numbers](https://jaywin.gitbook.io/leetcode/solutions/0571-find-median-given-frequency-of-numbers.md)
- [0572. Subtree of Another Tree](https://jaywin.gitbook.io/leetcode/solutions/0572-subtree-of-another-tree.md)
- [0573. Squirrel Simulation](https://jaywin.gitbook.io/leetcode/solutions/0573-squirrel-simulation.md)
- [0574. Winning Candidate](https://jaywin.gitbook.io/leetcode/solutions/0574-winning-candidate.md)
- [0575. Distribute Candies](https://jaywin.gitbook.io/leetcode/solutions/0575-distribute-candies.md)
- [0576. Out of Boundary Paths](https://jaywin.gitbook.io/leetcode/solutions/0576-out-of-boundary-paths.md)
- [0577. Employee Bonus](https://jaywin.gitbook.io/leetcode/solutions/0577-employee-bonus.md)
- [0578. Get Highest Answer Rate Question](https://jaywin.gitbook.io/leetcode/solutions/0578-get-highest-answer-rate-question.md)
- [0579. Find Cumulative Salary of an Employee](https://jaywin.gitbook.io/leetcode/solutions/0579-find-cumulative-salary-of-an-employee.md)
- [0580. Count Student Number in Departments](https://jaywin.gitbook.io/leetcode/solutions/0580-count-student-number-in-departments.md)
- [0581. Shortest Unsorted Continuous Subarray](https://jaywin.gitbook.io/leetcode/solutions/0581-shortest-unsorted-continuous-subarray.md)
- [0582. Kill Process](https://jaywin.gitbook.io/leetcode/solutions/0582-kill-process.md)
- [0583. Delete Operation for Two Strings](https://jaywin.gitbook.io/leetcode/solutions/0583-delete-operation-for-two-strings.md)
- [0584. Find Customer Referee](https://jaywin.gitbook.io/leetcode/solutions/0584-find-customer-referee.md)
- [0585. Investments in 2016](https://jaywin.gitbook.io/leetcode/solutions/0585-investments-in-2016.md)
- [0586. Customer Placing the Largest Number of Orders](https://jaywin.gitbook.io/leetcode/solutions/0586-customer-placing-the-largest-number-of-orders.md)
- [0587. Erect the Fence](https://jaywin.gitbook.io/leetcode/solutions/0587-erect-the-fence.md)
- [0588. Design In-Memory File System](https://jaywin.gitbook.io/leetcode/solutions/0588-design-in-memory-file-system.md)
- [0589. N-ary Tree Preorder Traversal](https://jaywin.gitbook.io/leetcode/solutions/0589-n-ary-tree-preorder-traversal.md)
- [0590. N-ary Tree Postorder Traversal](https://jaywin.gitbook.io/leetcode/solutions/0590-n-ary-tree-postorder-traversal.md)
- [0591. Tag Validator](https://jaywin.gitbook.io/leetcode/solutions/0591-tag-validator.md)
- [0592. Fraction Addition and Subtraction](https://jaywin.gitbook.io/leetcode/solutions/0592-fraction-addition-and-subtraction.md)
- [0593. Valid Square](https://jaywin.gitbook.io/leetcode/solutions/0593-valid-square.md)
- [0594. Longest Harmonious Subsequence](https://jaywin.gitbook.io/leetcode/solutions/0594-longest-harmonious-subsequence.md)
- [0595. Big Countries](https://jaywin.gitbook.io/leetcode/solutions/0595-big-countries.md)
- [0596. Classes More Than 5 Students](https://jaywin.gitbook.io/leetcode/solutions/0596-classes-more-than-5-students.md)
- [0597. Friend Requests I: Overall Acceptance Rate](https://jaywin.gitbook.io/leetcode/solutions/0597-friend-requests-i-overall-acceptance-rate.md)
- [0598. Range Addition II](https://jaywin.gitbook.io/leetcode/solutions/0598-range-addition-ii.md)
- [0599. Minimum Index Sum of Two Lists](https://jaywin.gitbook.io/leetcode/solutions/0599-minimum-index-sum-of-two-lists.md)
- [0600. Non-negative Integers without Consecutive Ones](https://jaywin.gitbook.io/leetcode/solutions/0600-non-negative-integers-without-consecutive-ones.md)
- [0601. Human Traffic of Stadium](https://jaywin.gitbook.io/leetcode/solutions/0601-human-traffic-of-stadium.md)
- [0602. Friend Requests II: Who Has the Most Friends](https://jaywin.gitbook.io/leetcode/solutions/0602-friend-requests-ii-who-has-the-most-friends.md)
- [0603. Consecutive Available Seats](https://jaywin.gitbook.io/leetcode/solutions/0603-consecutive-available-seats.md)
- [0604. Design Compressed String Iterator](https://jaywin.gitbook.io/leetcode/solutions/0604-design-compressed-string-iterator.md)
- [0605. Can Place Flowers](https://jaywin.gitbook.io/leetcode/solutions/0605-can-place-flowers.md)
- [0606. Construct String from Binary Tree](https://jaywin.gitbook.io/leetcode/solutions/0606-construct-string-from-binary-tree.md)
- [0607. Sales Person](https://jaywin.gitbook.io/leetcode/solutions/0607-sales-person.md)
- [0608. Tree Node](https://jaywin.gitbook.io/leetcode/solutions/0608-tree-node.md)
- [0609. Find Duplicate File in System](https://jaywin.gitbook.io/leetcode/solutions/0609-find-duplicate-file-in-system.md)
- [0610. Triangle Judgement](https://jaywin.gitbook.io/leetcode/solutions/0610-triangle-judgement.md)
- [0611. Valid Triangle Number](https://jaywin.gitbook.io/leetcode/solutions/0611-valid-triangle-number.md)
- [0612. Shortest Distance in a Plane](https://jaywin.gitbook.io/leetcode/solutions/0612-shortest-distance-in-a-plane.md)
- [0613. Shortest Distance in a Line](https://jaywin.gitbook.io/leetcode/solutions/0613-shortest-distance-in-a-line.md)
- [0614. Second Degree Follower](https://jaywin.gitbook.io/leetcode/solutions/0614-second-degree-follower.md)
- [0615. Average Salary: Departments VS Company](https://jaywin.gitbook.io/leetcode/solutions/0615-average-salary-departments-vs-company.md)
- [0616. Add Bold Tag in String](https://jaywin.gitbook.io/leetcode/solutions/0616-add-bold-tag-in-string.md)
- [0617. Merge Two Binary Trees](https://jaywin.gitbook.io/leetcode/solutions/0617-merge-two-binary-trees.md)
- [0618. Students Report By Geography](https://jaywin.gitbook.io/leetcode/solutions/0618-students-report-by-geography.md)
- [0619. Biggest Single Number](https://jaywin.gitbook.io/leetcode/solutions/0619-biggest-single-number.md)
- [0620. Not Boring Movies](https://jaywin.gitbook.io/leetcode/solutions/0620-not-boring-movies.md)
- [0621. Task Scheduler](https://jaywin.gitbook.io/leetcode/solutions/0621-task-scheduler.md)
- [0622. Design Circular Queue](https://jaywin.gitbook.io/leetcode/solutions/0622-design-circular-queue.md)
- [0623. Add One Row to Tree](https://jaywin.gitbook.io/leetcode/solutions/0623-add-one-row-to-tree.md)
- [0624. Maximum Distance in Arrays](https://jaywin.gitbook.io/leetcode/solutions/0624-maximum-distance-in-arrays.md)
- [0625. Minimum Factorization](https://jaywin.gitbook.io/leetcode/solutions/0625-minimum-factorization.md)
- [0626. Exchange Seats](https://jaywin.gitbook.io/leetcode/solutions/0626-exchange-seats.md)
- [0627. Swap Salary](https://jaywin.gitbook.io/leetcode/solutions/0627-swap-salary.md)
- [0628. Maximum Product of Three Numbers](https://jaywin.gitbook.io/leetcode/solutions/0628-maximum-product-of-three-numbers.md)
- [0629. K Inverse Pairs Array](https://jaywin.gitbook.io/leetcode/solutions/0629-k-inverse-pairs-array.md)
- [0630. Course Schedule III](https://jaywin.gitbook.io/leetcode/solutions/0630-course-schedule-iii.md)
- [0631. Design Excel Sum Formula](https://jaywin.gitbook.io/leetcode/solutions/0631-design-excel-sum-formula.md)
- [0632. Smallest Range Covering Elements from K Lists](https://jaywin.gitbook.io/leetcode/solutions/0632-smallest-range-covering-elements-from-k-lists.md)
- [0633. Sum of Square Numbers](https://jaywin.gitbook.io/leetcode/solutions/0633-sum-of-square-numbers.md)
- [0634. Find the Derangement of An Array](https://jaywin.gitbook.io/leetcode/solutions/0634-find-the-derangement-of-an-array.md)
- [0635. Design Log Storage System](https://jaywin.gitbook.io/leetcode/solutions/0635-design-log-storage-system.md)
- [0636. Exclusive Time of Functions](https://jaywin.gitbook.io/leetcode/solutions/0636-exclusive-time-of-functions.md)
- [0637. Average of Levels in Binary Tree](https://jaywin.gitbook.io/leetcode/solutions/0637-average-of-levels-in-binary-tree.md)
- [0638. Shopping Offers](https://jaywin.gitbook.io/leetcode/solutions/0638-shopping-offers.md)
- [0639. Decode Ways II](https://jaywin.gitbook.io/leetcode/solutions/0639-decode-ways-ii.md)
- [0640. Solve the Equation](https://jaywin.gitbook.io/leetcode/solutions/0640-solve-the-equation.md)
- [0641. Design Circular Deque](https://jaywin.gitbook.io/leetcode/solutions/0641-design-circular-deque.md)
- [0642. Design Search Autocomplete System](https://jaywin.gitbook.io/leetcode/solutions/0642-design-search-autocomplete-system.md)
- [0643. Maximum Average Subarray I](https://jaywin.gitbook.io/leetcode/solutions/0643-maximum-average-subarray-i.md)
- [0644. Maximum Average Subarray II](https://jaywin.gitbook.io/leetcode/solutions/0644-maximum-average-subarray-ii.md)
- [0645. Set Mismatch](https://jaywin.gitbook.io/leetcode/solutions/0645-set-mismatch.md)
- [0646. Maximum Length of Pair Chain](https://jaywin.gitbook.io/leetcode/solutions/0646-maximum-length-of-pair-chain.md)
- [0647. Palindromic Substrings](https://jaywin.gitbook.io/leetcode/solutions/0647-palindromic-substrings.md)
- [0648. Replace Words](https://jaywin.gitbook.io/leetcode/solutions/0648-replace-words.md)
- [0649. Dota2 Senate](https://jaywin.gitbook.io/leetcode/solutions/0649-dota2-senate.md)
- [0650. 2 Keys Keyboard](https://jaywin.gitbook.io/leetcode/solutions/0650-2-keys-keyboard.md)
- [0651. 4 Keys Keyboard](https://jaywin.gitbook.io/leetcode/solutions/0651-4-keys-keyboard.md)
- [0652. Find Duplicate Subtrees](https://jaywin.gitbook.io/leetcode/solutions/0652-find-duplicate-subtrees.md)
- [0653. Two Sum IV - Input is a BST](https://jaywin.gitbook.io/leetcode/solutions/0653-two-sum-iv-input-is-a-bst.md)
- [0654. Maximum Binary Tree](https://jaywin.gitbook.io/leetcode/solutions/0654-maximum-binary-tree.md)
- [0655. Print Binary Tree](https://jaywin.gitbook.io/leetcode/solutions/0655-print-binary-tree.md)
- [0656. Coin Path](https://jaywin.gitbook.io/leetcode/solutions/0656-coin-path.md)
- [0657. Robot Return to Origin](https://jaywin.gitbook.io/leetcode/solutions/0657-robot-return-to-origin.md)
- [0658. Find K Closest Elements](https://jaywin.gitbook.io/leetcode/solutions/0658-find-k-closest-elements.md)
- [0659. Split Array into Consecutive Subsequences](https://jaywin.gitbook.io/leetcode/solutions/0659-split-array-into-consecutive-subsequences.md)
- [0660. Remove 9](https://jaywin.gitbook.io/leetcode/solutions/0660-remove-9.md)
- [0661. Image Smoother](https://jaywin.gitbook.io/leetcode/solutions/0661-image-smoother.md)
- [0662. Maximum Width of Binary Tree](https://jaywin.gitbook.io/leetcode/solutions/0662-maximum-width-of-binary-tree.md)
- [0663. Equal Tree Partition](https://jaywin.gitbook.io/leetcode/solutions/0663-equal-tree-partition.md)
- [0664. Strange Printer](https://jaywin.gitbook.io/leetcode/solutions/0664-strange-printer.md)
- [0665. Non-decreasing Array](https://jaywin.gitbook.io/leetcode/solutions/0665-non-decreasing-array.md)
- [0666. Path Sum IV](https://jaywin.gitbook.io/leetcode/solutions/0666-path-sum-iv.md)
- [0667. Beautiful Arrangement II](https://jaywin.gitbook.io/leetcode/solutions/0667-beautiful-arrangement-ii.md)
- [0668. Kth Smallest Number in Multiplication Table](https://jaywin.gitbook.io/leetcode/solutions/0668-kth-smallest-number-in-multiplication-table.md)
- [0669. Trim a Binary Search Tree](https://jaywin.gitbook.io/leetcode/solutions/0669-trim-a-binary-search-tree.md)
- [0670. Maximum Swap](https://jaywin.gitbook.io/leetcode/solutions/0670-maximum-swap.md)
- [0671. Second Minimum Node In a Binary Tree](https://jaywin.gitbook.io/leetcode/solutions/0671-second-minimum-node-in-a-binary-tree.md)
- [0672. Bulb Switcher II](https://jaywin.gitbook.io/leetcode/solutions/0672-bulb-switcher-ii.md)
- [0673. Number of Longest Increasing Subsequence](https://jaywin.gitbook.io/leetcode/solutions/0673-number-of-longest-increasing-subsequence.md)
- [0674. Longest Continuous Increasing Subsequence](https://jaywin.gitbook.io/leetcode/solutions/0674-longest-continuous-increasing-subsequence.md)
- [0675. Cut Off Trees for Golf Event](https://jaywin.gitbook.io/leetcode/solutions/0675-cut-off-trees-for-golf-event.md)
- [0676. Implement Magic Dictionary](https://jaywin.gitbook.io/leetcode/solutions/0676-implement-magic-dictionary.md)
- [0677. Map Sum Pairs](https://jaywin.gitbook.io/leetcode/solutions/0677-map-sum-pairs.md)
- [0678. Valid Parenthesis String](https://jaywin.gitbook.io/leetcode/solutions/0678-valid-parenthesis-string.md)
- [0679. 24 Game](https://jaywin.gitbook.io/leetcode/solutions/0679-24-game.md)
- [0680. Valid Palindrome II](https://jaywin.gitbook.io/leetcode/solutions/0680-valid-palindrome-ii.md)
- [0681. Next Closest Time](https://jaywin.gitbook.io/leetcode/solutions/0681-next-closest-time.md)
- [0682. Baseball Game](https://jaywin.gitbook.io/leetcode/solutions/0682-baseball-game.md)
- [0683. K Empty Slots](https://jaywin.gitbook.io/leetcode/solutions/0683-k-empty-slots.md)
- [0684. Redundant Connection](https://jaywin.gitbook.io/leetcode/solutions/0684-redundant-connection.md)
- [0685. Redundant Connection II](https://jaywin.gitbook.io/leetcode/solutions/0685-redundant-connection-ii.md)
- [0686. Repeated String Match](https://jaywin.gitbook.io/leetcode/solutions/0686-repeated-string-match.md)
- [0687. Longest Univalue Path](https://jaywin.gitbook.io/leetcode/solutions/0687-longest-univalue-path.md)
- [0688. Knight Probability in Chessboard](https://jaywin.gitbook.io/leetcode/solutions/0688-knight-probability-in-chessboard.md)
- [0689. Maximum Sum of 3 Non-Overlapping Subarrays](https://jaywin.gitbook.io/leetcode/solutions/0689-maximum-sum-of-3-non-overlapping-subarrays.md)
- [0690. Employee Importance](https://jaywin.gitbook.io/leetcode/solutions/0690-employee-importance.md)
- [0691. Stickers to Spell Word](https://jaywin.gitbook.io/leetcode/solutions/0691-stickers-to-spell-word.md)
- [0692. Top K Frequent Words](https://jaywin.gitbook.io/leetcode/solutions/0692-top-k-frequent-words.md)
- [0693. Binary Number with Alternating Bits](https://jaywin.gitbook.io/leetcode/solutions/0693-binary-number-with-alternating-bits.md)
- [0694. Number of Distinct Islands](https://jaywin.gitbook.io/leetcode/solutions/0694-number-of-distinct-islands.md)
- [0695. Max Area of Island](https://jaywin.gitbook.io/leetcode/solutions/0695-max-area-of-island.md)
- [0696. Count Binary Substrings](https://jaywin.gitbook.io/leetcode/solutions/0696-count-binary-substrings.md)
- [0697. Degree of an Array](https://jaywin.gitbook.io/leetcode/solutions/0697-degree-of-an-array.md)
- [0698. Partition to K Equal Sum Subsets](https://jaywin.gitbook.io/leetcode/solutions/0698-partition-to-k-equal-sum-subsets.md)
- [0699. Falling Squares](https://jaywin.gitbook.io/leetcode/solutions/0699-falling-squares.md)
- [0700. Search in a Binary Search Tree](https://jaywin.gitbook.io/leetcode/solutions/0700-search-in-a-binary-search-tree.md)
- [0701. Insert into a Binary Search Tree](https://jaywin.gitbook.io/leetcode/solutions/0701-insert-into-a-binary-search-tree.md)
- [0702. Search in a Sorted Array of Unknown Size](https://jaywin.gitbook.io/leetcode/solutions/0702-search-in-a-sorted-array-of-unknown-size.md)
- [0703. Kth Largest Element in a Stream](https://jaywin.gitbook.io/leetcode/solutions/0703-kth-largest-element-in-a-stream.md)
- [0704. Binary Search](https://jaywin.gitbook.io/leetcode/solutions/0704-binary-search.md)
- [0705. Design HashSet](https://jaywin.gitbook.io/leetcode/solutions/0705-design-hashset.md)
- [0706. Design HashMap](https://jaywin.gitbook.io/leetcode/solutions/0706-design-hashmap.md)
- [0707. Design Linked List](https://jaywin.gitbook.io/leetcode/solutions/0707-design-linked-list.md)
- [0708. Insert into a Sorted Circular Linked List](https://jaywin.gitbook.io/leetcode/solutions/0708-insert-into-a-sorted-circular-linked-list.md)
- [0709. To Lower Case](https://jaywin.gitbook.io/leetcode/solutions/0709-to-lower-case.md)
- [0710. Random Pick with Blacklist](https://jaywin.gitbook.io/leetcode/solutions/0710-random-pick-with-blacklist.md)
- [0711. Number of Distinct Islands II](https://jaywin.gitbook.io/leetcode/solutions/0711-number-of-distinct-islands-ii.md)
- [0712. Minimum ASCII Delete Sum for Two Strings](https://jaywin.gitbook.io/leetcode/solutions/0712-minimum-ascii-delete-sum-for-two-strings.md)
- [0713. Subarray Product Less Than K](https://jaywin.gitbook.io/leetcode/solutions/0713-subarray-product-less-than-k.md)
- [0714. Best Time to Buy and Sell Stock with Transaction Fee](https://jaywin.gitbook.io/leetcode/solutions/0714-best-time-to-buy-and-sell-stock-with-transaction-fee.md)
- [0715. Range Module](https://jaywin.gitbook.io/leetcode/solutions/0715-range-module.md)
- [0716. Max Stack](https://jaywin.gitbook.io/leetcode/solutions/0716-max-stack.md)
- [0717. 1-bit and 2-bit Characters](https://jaywin.gitbook.io/leetcode/solutions/0717-1-bit-and-2-bit-characters.md)
- [0718. Maximum Length of Repeated Subarray](https://jaywin.gitbook.io/leetcode/solutions/0718-maximum-length-of-repeated-subarray.md)
- [0719. Find K-th Smallest Pair Distance](https://jaywin.gitbook.io/leetcode/solutions/0719-find-k-th-smallest-pair-distance.md)
- [0720. Longest Word in Dictionary](https://jaywin.gitbook.io/leetcode/solutions/0720-longest-word-in-dictionary.md)
- [0721. Accounts Merge](https://jaywin.gitbook.io/leetcode/solutions/0721-accounts-merge.md)
- [0722. Remove Comments](https://jaywin.gitbook.io/leetcode/solutions/0722-remove-comments.md)
- [0723. Candy Crush](https://jaywin.gitbook.io/leetcode/solutions/0723-candy-crush.md)
- [0724. Find Pivot Index](https://jaywin.gitbook.io/leetcode/solutions/0724-find-pivot-index.md)
- [0725. Split Linked List in Parts](https://jaywin.gitbook.io/leetcode/solutions/0725-split-linked-list-in-parts.md)
- [0726. Number of Atoms](https://jaywin.gitbook.io/leetcode/solutions/0726-number-of-atoms.md)
- [0727. Minimum Window Subsequence](https://jaywin.gitbook.io/leetcode/solutions/0727-minimum-window-subsequence.md)
- [0728. Self Dividing Numbers](https://jaywin.gitbook.io/leetcode/solutions/0728-self-dividing-numbers.md)
- [0729. My Calendar I](https://jaywin.gitbook.io/leetcode/solutions/0729-my-calendar-i.md)
- [0730. Count Different Palindromic Subsequences](https://jaywin.gitbook.io/leetcode/solutions/0730-count-different-palindromic-subsequences.md)
- [0731. My Calendar II](https://jaywin.gitbook.io/leetcode/solutions/0731-my-calendar-ii.md)
- [0732. My Calendar III](https://jaywin.gitbook.io/leetcode/solutions/0732-my-calendar-iii.md)
- [0733. Flood Fill](https://jaywin.gitbook.io/leetcode/solutions/0733-flood-fill.md)
- [0734. Sentence Similarity](https://jaywin.gitbook.io/leetcode/solutions/0734-sentence-similarity.md)
- [0735. Asteroid Collision](https://jaywin.gitbook.io/leetcode/solutions/0735-asteroid-collision.md)
- [0736. Parse Lisp Expression](https://jaywin.gitbook.io/leetcode/solutions/0736-parse-lisp-expression.md)
- [0737. Sentence Similarity II](https://jaywin.gitbook.io/leetcode/solutions/0737-sentence-similarity-ii.md)
- [0738. Monotone Increasing Digits](https://jaywin.gitbook.io/leetcode/solutions/0738-monotone-increasing-digits.md)
- [0739. Daily Temperatures](https://jaywin.gitbook.io/leetcode/solutions/0739-daily-temperatures.md)
- [0740. Delete and Earn](https://jaywin.gitbook.io/leetcode/solutions/0740-delete-and-earn.md)
- [0741. Cherry Pickup](https://jaywin.gitbook.io/leetcode/solutions/0741-cherry-pickup.md)
- [0742. Closest Leaf in a Binary Tree](https://jaywin.gitbook.io/leetcode/solutions/0742-closest-leaf-in-a-binary-tree.md)
- [0743. Network Delay Time](https://jaywin.gitbook.io/leetcode/solutions/0743-network-delay-time.md)
- [0744. Find Smallest Letter Greater Than Target](https://jaywin.gitbook.io/leetcode/solutions/0744-find-smallest-letter-greater-than-target.md)
- [0745. Prefix and Suffix Search](https://jaywin.gitbook.io/leetcode/solutions/0745-prefix-and-suffix-search.md)
- [0746. Min Cost Climbing Stairs](https://jaywin.gitbook.io/leetcode/solutions/0746-min-cost-climbing-stairs.md)
- [0747. Largest Number At Least Twice of Others](https://jaywin.gitbook.io/leetcode/solutions/0747-largest-number-at-least-twice-of-others.md)
- [0748. Shortest Completing Word](https://jaywin.gitbook.io/leetcode/solutions/0748-shortest-completing-word.md)
- [0749. Contain Virus](https://jaywin.gitbook.io/leetcode/solutions/0749-contain-virus.md)
- [0750. Number Of Corner Rectangles](https://jaywin.gitbook.io/leetcode/solutions/0750-number-of-corner-rectangles.md)
- [0751. IP to CIDR](https://jaywin.gitbook.io/leetcode/solutions/0751-ip-to-cidr.md)
- [0752. Open the Lock](https://jaywin.gitbook.io/leetcode/solutions/0752-open-the-lock.md)
- [0753. Cracking the Safe](https://jaywin.gitbook.io/leetcode/solutions/0753-cracking-the-safe.md)
- [0754. Reach a Number](https://jaywin.gitbook.io/leetcode/solutions/0754-reach-a-number.md)
- [0755. Pour Water](https://jaywin.gitbook.io/leetcode/solutions/0755-pour-water.md)
- [0756. Pyramid Transition Matrix](https://jaywin.gitbook.io/leetcode/solutions/0756-pyramid-transition-matrix.md)
- [0757. Set Intersection Size At Least Two](https://jaywin.gitbook.io/leetcode/solutions/0757-set-intersection-size-at-least-two.md)
- [0758. Bold Words in String](https://jaywin.gitbook.io/leetcode/solutions/0758-bold-words-in-string.md)
- [0759. Employee Free Time](https://jaywin.gitbook.io/leetcode/solutions/0759-employee-free-time.md)
- [0760. Find Anagram Mappings](https://jaywin.gitbook.io/leetcode/solutions/0760-find-anagram-mappings.md)
- [0761. Special Binary String](https://jaywin.gitbook.io/leetcode/solutions/0761-special-binary-string.md)
- [0762. Prime Number of Set Bits in Binary Representation](https://jaywin.gitbook.io/leetcode/solutions/0762-prime-number-of-set-bits-in-binary-representation.md)
- [0763. Partition Labels](https://jaywin.gitbook.io/leetcode/solutions/0763-partition-labels.md)
- [0764. Largest Plus Sign](https://jaywin.gitbook.io/leetcode/solutions/0764-largest-plus-sign.md)
- [0765. Couples Holding Hands](https://jaywin.gitbook.io/leetcode/solutions/0765-couples-holding-hands.md)
- [0766. Toeplitz Matrix](https://jaywin.gitbook.io/leetcode/solutions/0766-toeplitz-matrix.md)
- [0767. Reorganize String](https://jaywin.gitbook.io/leetcode/solutions/0767-reorganize-string.md)
- [0768. Max Chunks To Make Sorted II](https://jaywin.gitbook.io/leetcode/solutions/0768-max-chunks-to-make-sorted-ii.md)
- [0769. Max Chunks To Make Sorted](https://jaywin.gitbook.io/leetcode/solutions/0769-max-chunks-to-make-sorted.md)
- [0770. Basic Calculator IV](https://jaywin.gitbook.io/leetcode/solutions/0770-basic-calculator-iv.md)
- [0771. Jewels and Stones](https://jaywin.gitbook.io/leetcode/solutions/0771-jewels-and-stones.md)
- [0772. Basic Calculator III](https://jaywin.gitbook.io/leetcode/solutions/0772-basic-calculator-iii.md)
- [0773. Sliding Puzzle](https://jaywin.gitbook.io/leetcode/solutions/0773-sliding-puzzle.md)
- [0774. Minimize Max Distance to Gas Station](https://jaywin.gitbook.io/leetcode/solutions/0774-minimize-max-distance-to-gas-station.md)
- [0775. Global and Local Inversions](https://jaywin.gitbook.io/leetcode/solutions/0775-global-and-local-inversions.md)
- [0776. Split BST](https://jaywin.gitbook.io/leetcode/solutions/0776-split-bst.md)
- [0777. Swap Adjacent in LR String](https://jaywin.gitbook.io/leetcode/solutions/0777-swap-adjacent-in-lr-string.md)
- [0778. Swim in Rising Water](https://jaywin.gitbook.io/leetcode/solutions/0778-swim-in-rising-water.md)
- [0779. K-th Symbol in Grammar](https://jaywin.gitbook.io/leetcode/solutions/0779-k-th-symbol-in-grammar.md)
- [0780. Reaching Points](https://jaywin.gitbook.io/leetcode/solutions/0780-reaching-points.md)
- [0781. Rabbits in Forest](https://jaywin.gitbook.io/leetcode/solutions/0781-rabbits-in-forest.md)
- [0782. Transform to Chessboard](https://jaywin.gitbook.io/leetcode/solutions/0782-transform-to-chessboard.md)
- [0783. Minimum Distance Between BST Nodes](https://jaywin.gitbook.io/leetcode/solutions/0783-minimum-distance-between-bst-nodes.md)
- [0784. Letter Case Permutation](https://jaywin.gitbook.io/leetcode/solutions/0784-letter-case-permutation.md)
- [0785. Is Graph Bipartite?](https://jaywin.gitbook.io/leetcode/solutions/0785-is-graph-bipartite.md)
- [0786. K-th Smallest Prime Fraction](https://jaywin.gitbook.io/leetcode/solutions/0786-k-th-smallest-prime-fraction.md)
- [0787. Cheapest Flights Within K Stops](https://jaywin.gitbook.io/leetcode/solutions/0787-cheapest-flights-within-k-stops.md)
- [0788. Rotated Digits](https://jaywin.gitbook.io/leetcode/solutions/0788-rotated-digits.md)
- [0789. Escape The Ghosts](https://jaywin.gitbook.io/leetcode/solutions/0789-escape-the-ghosts.md)
- [0790. Domino and Tromino Tiling](https://jaywin.gitbook.io/leetcode/solutions/0790-domino-and-tromino-tiling.md)
- [0791. Custom Sort String](https://jaywin.gitbook.io/leetcode/solutions/0791-custom-sort-string.md)
- [0792. Number of Matching Subsequences](https://jaywin.gitbook.io/leetcode/solutions/0792-number-of-matching-subsequences.md)
- [0793. Preimage Size of Factorial Zeroes Function](https://jaywin.gitbook.io/leetcode/solutions/0793-preimage-size-of-factorial-zeroes-function.md)
- [0794. Valid Tic-Tac-Toe State](https://jaywin.gitbook.io/leetcode/solutions/0794-valid-tic-tac-toe-state.md)
- [0795. Number of Subarrays with Bounded Maximum](https://jaywin.gitbook.io/leetcode/solutions/0795-number-of-subarrays-with-bounded-maximum.md)
- [0796. Rotate String](https://jaywin.gitbook.io/leetcode/solutions/0796-rotate-string.md)
- [0797. All Paths From Source to Target](https://jaywin.gitbook.io/leetcode/solutions/0797-all-paths-from-source-to-target.md)
- [0798. Smallest Rotation with Highest Score](https://jaywin.gitbook.io/leetcode/solutions/0798-smallest-rotation-with-highest-score.md)
- [0799. Champagne Tower](https://jaywin.gitbook.io/leetcode/solutions/0799-champagne-tower.md)
- [0800. Similar RGB Color](https://jaywin.gitbook.io/leetcode/solutions/0800-similar-rgb-color.md)
- [0801. Minimum Swaps To Make Sequences Increasing](https://jaywin.gitbook.io/leetcode/solutions/0801-minimum-swaps-to-make-sequences-increasing.md)
- [0802. Find Eventual Safe States](https://jaywin.gitbook.io/leetcode/solutions/0802-find-eventual-safe-states.md)
- [0803. Bricks Falling When Hit](https://jaywin.gitbook.io/leetcode/solutions/0803-bricks-falling-when-hit.md)
- [0804. Unique Morse Code Words](https://jaywin.gitbook.io/leetcode/solutions/0804-unique-morse-code-words.md)
- [0805. Split Array With Same Average](https://jaywin.gitbook.io/leetcode/solutions/0805-split-array-with-same-average.md)
- [0806. Number of Lines To Write String](https://jaywin.gitbook.io/leetcode/solutions/0806-number-of-lines-to-write-string.md)
- [0807. Max Increase to Keep City Skyline](https://jaywin.gitbook.io/leetcode/solutions/0807-max-increase-to-keep-city-skyline.md)
- [0808. Soup Servings](https://jaywin.gitbook.io/leetcode/solutions/0808-soup-servings.md)
- [0809. Expressive Words](https://jaywin.gitbook.io/leetcode/solutions/0809-expressive-words.md)
- [0810. Chalkboard XOR Game](https://jaywin.gitbook.io/leetcode/solutions/0810-chalkboard-xor-game.md)
- [0811. Subdomain Visit Count](https://jaywin.gitbook.io/leetcode/solutions/0811-subdomain-visit-count.md)
- [0812. Largest Triangle Area](https://jaywin.gitbook.io/leetcode/solutions/0812-largest-triangle-area.md)
- [0813. Largest Sum of Averages](https://jaywin.gitbook.io/leetcode/solutions/0813-largest-sum-of-averages.md)
- [0814. Binary Tree Pruning](https://jaywin.gitbook.io/leetcode/solutions/0814-binary-tree-pruning.md)
- [0815. Bus Routes](https://jaywin.gitbook.io/leetcode/solutions/0815-bus-routes.md)
- [0816. Ambiguous Coordinates](https://jaywin.gitbook.io/leetcode/solutions/0816-ambiguous-coordinates.md)
- [0817. Linked List Components](https://jaywin.gitbook.io/leetcode/solutions/0817-linked-list-components.md)
- [0818. Race Car](https://jaywin.gitbook.io/leetcode/solutions/0818-race-car.md)
- [0819. Most Common Word](https://jaywin.gitbook.io/leetcode/solutions/0819-most-common-word.md)
- [0820. Short Encoding of Words](https://jaywin.gitbook.io/leetcode/solutions/0820-short-encoding-of-words.md)
- [0821. Shortest Distance to a Character](https://jaywin.gitbook.io/leetcode/solutions/0821-shortest-distance-to-a-character.md)
- [0822. Card Flipping Game](https://jaywin.gitbook.io/leetcode/solutions/0822-card-flipping-game.md)
- [0823. Binary Trees With Factors](https://jaywin.gitbook.io/leetcode/solutions/0823-binary-trees-with-factors.md)
- [0824. Goat Latin](https://jaywin.gitbook.io/leetcode/solutions/0824-goat-latin.md)
- [0825. Friends Of Appropriate Ages](https://jaywin.gitbook.io/leetcode/solutions/0825-friends-of-appropriate-ages.md)
- [0826. Most Profit Assigning Work](https://jaywin.gitbook.io/leetcode/solutions/0826-most-profit-assigning-work.md)
- [0827. Making A Large Island](https://jaywin.gitbook.io/leetcode/solutions/0827-making-a-large-island.md)
- [0828. Count Unique Characters of All Substrings of a Given String](https://jaywin.gitbook.io/leetcode/solutions/0828-count-unique-characters-of-all-substrings-of-a-given-string.md)
- [0829. Consecutive Numbers Sum](https://jaywin.gitbook.io/leetcode/solutions/0829-consecutive-numbers-sum.md)
- [0830. Positions of Large Groups](https://jaywin.gitbook.io/leetcode/solutions/0830-positions-of-large-groups.md)
- [0831. Masking Personal Information](https://jaywin.gitbook.io/leetcode/solutions/0831-masking-personal-information.md)
- [0832. Flipping an Image](https://jaywin.gitbook.io/leetcode/solutions/0832-flipping-an-image.md)
- [0833. Find And Replace in String](https://jaywin.gitbook.io/leetcode/solutions/0833-find-and-replace-in-string.md)
- [0834. Sum of Distances in Tree](https://jaywin.gitbook.io/leetcode/solutions/0834-sum-of-distances-in-tree.md)
- [0835. Image Overlap](https://jaywin.gitbook.io/leetcode/solutions/0835-image-overlap.md)
- [0836. Rectangle Overlap](https://jaywin.gitbook.io/leetcode/solutions/0836-rectangle-overlap.md)
- [0837. New 21 Game](https://jaywin.gitbook.io/leetcode/solutions/0837-new-21-game.md)
- [0838. Push Dominoes](https://jaywin.gitbook.io/leetcode/solutions/0838-push-dominoes.md)
- [0839. Similar String Groups](https://jaywin.gitbook.io/leetcode/solutions/0839-similar-string-groups.md)
- [0840. Magic Squares In Grid](https://jaywin.gitbook.io/leetcode/solutions/0840-magic-squares-in-grid.md)
- [0841. Keys and Rooms](https://jaywin.gitbook.io/leetcode/solutions/0841-keys-and-rooms.md)
- [0842. Split Array into Fibonacci Sequence](https://jaywin.gitbook.io/leetcode/solutions/0842-split-array-into-fibonacci-sequence.md)
- [0843. Guess the Word](https://jaywin.gitbook.io/leetcode/solutions/0843-guess-the-word.md)
- [0844. Backspace String Compare](https://jaywin.gitbook.io/leetcode/solutions/0844-backspace-string-compare.md)
- [0845. Longest Mountain in Array](https://jaywin.gitbook.io/leetcode/solutions/0845-longest-mountain-in-array.md)
- [0846. Hand of Straights](https://jaywin.gitbook.io/leetcode/solutions/0846-hand-of-straights.md)
- [0847. Shortest Path Visiting All Nodes](https://jaywin.gitbook.io/leetcode/solutions/0847-shortest-path-visiting-all-nodes.md)
- [0848. Shifting Letters](https://jaywin.gitbook.io/leetcode/solutions/0848-shifting-letters.md)
- [0849. Maximize Distance to Closest Person](https://jaywin.gitbook.io/leetcode/solutions/0849-maximize-distance-to-closest-person.md)
- [0850. Rectangle Area II](https://jaywin.gitbook.io/leetcode/solutions/0850-rectangle-area-ii.md)
- [0851. Loud and Rich](https://jaywin.gitbook.io/leetcode/solutions/0851-loud-and-rich.md)
- [0852. Peak Index in a Mountain Array](https://jaywin.gitbook.io/leetcode/solutions/0852-peak-index-in-a-mountain-array.md)
- [0853. Car Fleet](https://jaywin.gitbook.io/leetcode/solutions/0853-car-fleet.md)
- [0854. K-Similar Strings](https://jaywin.gitbook.io/leetcode/solutions/0854-k-similar-strings.md)
- [0855. Exam Room](https://jaywin.gitbook.io/leetcode/solutions/0855-exam-room.md)
- [0856. Score of Parentheses](https://jaywin.gitbook.io/leetcode/solutions/0856-score-of-parentheses.md)
- [0857. Minimum Cost to Hire K Workers](https://jaywin.gitbook.io/leetcode/solutions/0857-minimum-cost-to-hire-k-workers.md)
- [0858. Mirror Reflection](https://jaywin.gitbook.io/leetcode/solutions/0858-mirror-reflection.md)
- [0859. Buddy Strings](https://jaywin.gitbook.io/leetcode/solutions/0859-buddy-strings.md)
- [0860. Lemonade Change](https://jaywin.gitbook.io/leetcode/solutions/0860-lemonade-change.md)
- [0861. Score After Flipping Matrix](https://jaywin.gitbook.io/leetcode/solutions/0861-score-after-flipping-matrix.md)
- [0862. Shortest Subarray with Sum at Least K](https://jaywin.gitbook.io/leetcode/solutions/0862-shortest-subarray-with-sum-at-least-k.md)
- [0863. All Nodes Distance K in Binary Tree](https://jaywin.gitbook.io/leetcode/solutions/0863-all-nodes-distance-k-in-binary-tree.md)
- [0864. Shortest Path to Get All Keys](https://jaywin.gitbook.io/leetcode/solutions/0864-shortest-path-to-get-all-keys.md)
- [0865. Smallest Subtree with all the Deepest Nodes](https://jaywin.gitbook.io/leetcode/solutions/0865-smallest-subtree-with-all-the-deepest-nodes.md)
- [0866. Prime Palindrome](https://jaywin.gitbook.io/leetcode/solutions/0866-prime-palindrome.md)
- [0867. Transpose Matrix](https://jaywin.gitbook.io/leetcode/solutions/0867-transpose-matrix.md)
- [0868. Binary Gap](https://jaywin.gitbook.io/leetcode/solutions/0868-binary-gap.md)
- [0869. Reordered Power of 2](https://jaywin.gitbook.io/leetcode/solutions/0869-reordered-power-of-2.md)
- [0870. Advantage Shuffle](https://jaywin.gitbook.io/leetcode/solutions/0870-advantage-shuffle.md)
- [0871. Minimum Number of Refueling Stops](https://jaywin.gitbook.io/leetcode/solutions/0871-minimum-number-of-refueling-stops.md)
- [0872. Leaf-Similar Trees](https://jaywin.gitbook.io/leetcode/solutions/0872-leaf-similar-trees.md)
- [0873. Length of Longest Fibonacci Subsequence](https://jaywin.gitbook.io/leetcode/solutions/0873-length-of-longest-fibonacci-subsequence.md)
- [0874. Walking Robot Simulation](https://jaywin.gitbook.io/leetcode/solutions/0874-walking-robot-simulation.md)
- [0875. Koko Eating Bananas](https://jaywin.gitbook.io/leetcode/solutions/0875-koko-eating-bananas.md)
- [0876. Middle of the Linked List](https://jaywin.gitbook.io/leetcode/solutions/0876-middle-of-the-linked-list.md)
- [0877. Stone Game](https://jaywin.gitbook.io/leetcode/solutions/0877-stone-game.md)
- [0878. Nth Magical Number](https://jaywin.gitbook.io/leetcode/solutions/0878-nth-magical-number.md)
- [0879. Profitable Schemes](https://jaywin.gitbook.io/leetcode/solutions/0879-profitable-schemes.md)
- [0880. Decoded String at Index](https://jaywin.gitbook.io/leetcode/solutions/0880-decoded-string-at-index.md)
- [0881. Boats to Save People](https://jaywin.gitbook.io/leetcode/solutions/0881-boats-to-save-people.md)
- [0882. Reachable Nodes In Subdivided Graph](https://jaywin.gitbook.io/leetcode/solutions/0882-reachable-nodes-in-subdivided-graph.md)
- [0883. Projection Area of 3D Shapes](https://jaywin.gitbook.io/leetcode/solutions/0883-projection-area-of-3d-shapes.md)
- [0884. Uncommon Words from Two Sentences](https://jaywin.gitbook.io/leetcode/solutions/0884-uncommon-words-from-two-sentences.md)
- [0885. Spiral Matrix III](https://jaywin.gitbook.io/leetcode/solutions/0885-spiral-matrix-iii.md)
- [0886. Possible Bipartition](https://jaywin.gitbook.io/leetcode/solutions/0886-possible-bipartition.md)
- [0887. Super Egg Drop](https://jaywin.gitbook.io/leetcode/solutions/0887-super-egg-drop.md)
- [0888. Fair Candy Swap](https://jaywin.gitbook.io/leetcode/solutions/0888-fair-candy-swap.md)
- [0889. Construct Binary Tree from Preorder and Postorder Traversal](https://jaywin.gitbook.io/leetcode/solutions/0889-construct-binary-tree-from-preorder-and-postorder-traversal.md)
- [0890. Find and Replace Pattern](https://jaywin.gitbook.io/leetcode/solutions/0890-find-and-replace-pattern.md)
- [0891. Sum of Subsequence Widths](https://jaywin.gitbook.io/leetcode/solutions/0891-sum-of-subsequence-widths.md)
- [0892. Surface Area of 3D Shapes](https://jaywin.gitbook.io/leetcode/solutions/0892-surface-area-of-3d-shapes.md)
- [0893. Groups of Special-Equivalent Strings](https://jaywin.gitbook.io/leetcode/solutions/0893-groups-of-special-equivalent-strings.md)
- [0894. All Possible Full Binary Trees](https://jaywin.gitbook.io/leetcode/solutions/0894-all-possible-full-binary-trees.md)
- [0895. Maximum Frequency Stack](https://jaywin.gitbook.io/leetcode/solutions/0895-maximum-frequency-stack.md)
- [0896. Monotonic Array](https://jaywin.gitbook.io/leetcode/solutions/0896-monotonic-array.md)
- [0897. Increasing Order Search Tree](https://jaywin.gitbook.io/leetcode/solutions/0897-increasing-order-search-tree.md)
- [0898. Bitwise ORs of Subarrays](https://jaywin.gitbook.io/leetcode/solutions/0898-bitwise-ors-of-subarrays.md)
- [0899. Orderly Queue](https://jaywin.gitbook.io/leetcode/solutions/0899-orderly-queue.md)
- [0900. RLE Iterator](https://jaywin.gitbook.io/leetcode/solutions/0900-rle-iterator.md)
- [0901. Online Stock Span](https://jaywin.gitbook.io/leetcode/solutions/0901-online-stock-span.md)
- [0902. Numbers At Most N Given Digit Set](https://jaywin.gitbook.io/leetcode/solutions/0902-numbers-at-most-n-given-digit-set.md)
- [0903. Valid Permutations for DI Sequence](https://jaywin.gitbook.io/leetcode/solutions/0903-valid-permutations-for-di-sequence.md)
- [0904. Fruit Into Baskets](https://jaywin.gitbook.io/leetcode/solutions/0904-fruit-into-baskets.md)
- [0905. Sort Array By Parity](https://jaywin.gitbook.io/leetcode/solutions/0905-sort-array-by-parity.md)
- [0906. Super Palindromes](https://jaywin.gitbook.io/leetcode/solutions/0906-super-palindromes.md)
- [0907. Sum of Subarray Minimums](https://jaywin.gitbook.io/leetcode/solutions/0907-sum-of-subarray-minimums.md)
- [0908. Smallest Range I](https://jaywin.gitbook.io/leetcode/solutions/0908-smallest-range-i.md)
- [0909. Snakes and Ladders](https://jaywin.gitbook.io/leetcode/solutions/0909-snakes-and-ladders.md)
- [0910. Smallest Range II](https://jaywin.gitbook.io/leetcode/solutions/0910-smallest-range-ii.md)
- [0911. Online Election](https://jaywin.gitbook.io/leetcode/solutions/0911-online-election.md)
- [0912. Sort an Array](https://jaywin.gitbook.io/leetcode/solutions/0912-sort-an-array.md)
- [0913. Cat and Mouse](https://jaywin.gitbook.io/leetcode/solutions/0913-cat-and-mouse.md)
- [0914. X of a Kind in a Deck of Cards](https://jaywin.gitbook.io/leetcode/solutions/0914-x-of-a-kind-in-a-deck-of-cards.md)
- [0915. Partition Array into Disjoint Intervals](https://jaywin.gitbook.io/leetcode/solutions/0915-partition-array-into-disjoint-intervals.md)
- [0916. Word Subsets](https://jaywin.gitbook.io/leetcode/solutions/0916-word-subsets.md)
- [0917. Reverse Only Letters](https://jaywin.gitbook.io/leetcode/solutions/0917-reverse-only-letters.md)
- [0918. Maximum Sum Circular Subarray](https://jaywin.gitbook.io/leetcode/solutions/0918-maximum-sum-circular-subarray.md)
- [0919. Complete Binary Tree Inserter](https://jaywin.gitbook.io/leetcode/solutions/0919-complete-binary-tree-inserter.md)
- [0920. Number of Music Playlists](https://jaywin.gitbook.io/leetcode/solutions/0920-number-of-music-playlists.md)
- [0921. Minimum Add to Make Parentheses Valid](https://jaywin.gitbook.io/leetcode/solutions/0921-minimum-add-to-make-parentheses-valid.md)
- [0922. Sort Array By Parity II](https://jaywin.gitbook.io/leetcode/solutions/0922-sort-array-by-parity-ii.md)
- [0923. 3Sum With Multiplicity](https://jaywin.gitbook.io/leetcode/solutions/0923-3sum-with-multiplicity.md)
- [0924. Minimize Malware Spread](https://jaywin.gitbook.io/leetcode/solutions/0924-minimize-malware-spread.md)
- [0925. Long Pressed Name](https://jaywin.gitbook.io/leetcode/solutions/0925-long-pressed-name.md)
- [0926. Flip String to Monotone Increasing](https://jaywin.gitbook.io/leetcode/solutions/0926-flip-string-to-monotone-increasing.md)
- [0927. Three Equal Parts](https://jaywin.gitbook.io/leetcode/solutions/0927-three-equal-parts.md)
- [0928. Minimize Malware Spread II](https://jaywin.gitbook.io/leetcode/solutions/0928-minimize-malware-spread-ii.md)
- [0929. Unique Email Addresses](https://jaywin.gitbook.io/leetcode/solutions/0929-unique-email-addresses.md)
- [0930. Binary Subarrays With Sum](https://jaywin.gitbook.io/leetcode/solutions/0930-binary-subarrays-with-sum.md)
- [0931. Minimum Falling Path Sum](https://jaywin.gitbook.io/leetcode/solutions/0931-minimum-falling-path-sum.md)
- [0932. Beautiful Array](https://jaywin.gitbook.io/leetcode/solutions/0932-beautiful-array.md)
- [0933. Number of Recent Calls](https://jaywin.gitbook.io/leetcode/solutions/0933-number-of-recent-calls.md)
- [0934. Shortest Bridge](https://jaywin.gitbook.io/leetcode/solutions/0934-shortest-bridge.md)
- [0935. Knight Dialer](https://jaywin.gitbook.io/leetcode/solutions/0935-knight-dialer.md)
- [0936. Stamping The Sequence](https://jaywin.gitbook.io/leetcode/solutions/0936-stamping-the-sequence.md)
- [0937. Reorder Data in Log Files](https://jaywin.gitbook.io/leetcode/solutions/0937-reorder-data-in-log-files.md)
- [0938. Range Sum of BST](https://jaywin.gitbook.io/leetcode/solutions/0938-range-sum-of-bst.md)
- [0939. Minimum Area Rectangle](https://jaywin.gitbook.io/leetcode/solutions/0939-minimum-area-rectangle.md)
- [0940. Distinct Subsequences II](https://jaywin.gitbook.io/leetcode/solutions/0940-distinct-subsequences-ii.md)
- [0941. Valid Mountain Array](https://jaywin.gitbook.io/leetcode/solutions/0941-valid-mountain-array.md)
- [0942. DI String Match](https://jaywin.gitbook.io/leetcode/solutions/0942-di-string-match.md)
- [0943. Find the Shortest Superstring](https://jaywin.gitbook.io/leetcode/solutions/0943-find-the-shortest-superstring.md)
- [0944. Delete Columns to Make Sorted](https://jaywin.gitbook.io/leetcode/solutions/0944-delete-columns-to-make-sorted.md)
- [0945. Minimum Increment to Make Array Unique](https://jaywin.gitbook.io/leetcode/solutions/0945-minimum-increment-to-make-array-unique.md)
- [0946. Validate Stack Sequences](https://jaywin.gitbook.io/leetcode/solutions/0946-validate-stack-sequences.md)
- [0947. Most Stones Removed with Same Row or Column](https://jaywin.gitbook.io/leetcode/solutions/0947-most-stones-removed-with-same-row-or-column.md)
- [0948. Bag of Tokens](https://jaywin.gitbook.io/leetcode/solutions/0948-bag-of-tokens.md)
- [0949. Largest Time for Given Digits](https://jaywin.gitbook.io/leetcode/solutions/0949-largest-time-for-given-digits.md)
- [0950. Reveal Cards In Increasing Order](https://jaywin.gitbook.io/leetcode/solutions/0950-reveal-cards-in-increasing-order.md)
- [0951. Flip Equivalent Binary Trees](https://jaywin.gitbook.io/leetcode/solutions/0951-flip-equivalent-binary-trees.md)
- [0952. Largest Component Size by Common Factor](https://jaywin.gitbook.io/leetcode/solutions/0952-largest-component-size-by-common-factor.md)
- [0953. Verifying an Alien Dictionary](https://jaywin.gitbook.io/leetcode/solutions/0953-verifying-an-alien-dictionary.md)
- [0954. Array of Doubled Pairs](https://jaywin.gitbook.io/leetcode/solutions/0954-array-of-doubled-pairs.md)
- [0955. Delete Columns to Make Sorted II](https://jaywin.gitbook.io/leetcode/solutions/0955-delete-columns-to-make-sorted-ii.md)
- [0956. Tallest Billboard](https://jaywin.gitbook.io/leetcode/solutions/0956-tallest-billboard.md)
- [0957. Prison Cells After N Days](https://jaywin.gitbook.io/leetcode/solutions/0957-prison-cells-after-n-days.md)
- [0958. Check Completeness of a Binary Tree](https://jaywin.gitbook.io/leetcode/solutions/0958-check-completeness-of-a-binary-tree.md)
- [0959. Regions Cut By Slashes](https://jaywin.gitbook.io/leetcode/solutions/0959-regions-cut-by-slashes.md)
- [0960. Delete Columns to Make Sorted III](https://jaywin.gitbook.io/leetcode/solutions/0960-delete-columns-to-make-sorted-iii.md)
- [0961. N-Repeated Element in Size 2N Array](https://jaywin.gitbook.io/leetcode/solutions/0961-n-repeated-element-in-size-2n-array.md)
- [0962. Maximum Width Ramp](https://jaywin.gitbook.io/leetcode/solutions/0962-maximum-width-ramp.md)
- [0963. Minimum Area Rectangle II](https://jaywin.gitbook.io/leetcode/solutions/0963-minimum-area-rectangle-ii.md)
- [0964. Least Operators to Express Number](https://jaywin.gitbook.io/leetcode/solutions/0964-least-operators-to-express-number.md)
- [0965. Univalued Binary Tree](https://jaywin.gitbook.io/leetcode/solutions/0965-univalued-binary-tree.md)
- [0966. Vowel Spellchecker](https://jaywin.gitbook.io/leetcode/solutions/0966-vowel-spellchecker.md)
- [0967. Numbers With Same Consecutive Differences](https://jaywin.gitbook.io/leetcode/solutions/0967-numbers-with-same-consecutive-differences.md)
- [0968. Binary Tree Cameras](https://jaywin.gitbook.io/leetcode/solutions/0968-binary-tree-cameras.md)
- [0969. Pancake Sorting](https://jaywin.gitbook.io/leetcode/solutions/0969-pancake-sorting.md)
- [0970. Powerful Integers](https://jaywin.gitbook.io/leetcode/solutions/0970-powerful-integers.md)
- [0971. Flip Binary Tree To Match Preorder Traversal](https://jaywin.gitbook.io/leetcode/solutions/0971-flip-binary-tree-to-match-preorder-traversal.md)
- [0972. Equal Rational Numbers](https://jaywin.gitbook.io/leetcode/solutions/0972-equal-rational-numbers.md)
- [0973. K Closest Points to Origin](https://jaywin.gitbook.io/leetcode/solutions/0973-k-closest-points-to-origin.md)
- [0974. Subarray Sums Divisible by K](https://jaywin.gitbook.io/leetcode/solutions/0974-subarray-sums-divisible-by-k.md)
- [0975. Odd Even Jump](https://jaywin.gitbook.io/leetcode/solutions/0975-odd-even-jump.md)
- [0976. Largest Perimeter Triangle](https://jaywin.gitbook.io/leetcode/solutions/0976-largest-perimeter-triangle.md)
- [0977. Squares of a Sorted Array](https://jaywin.gitbook.io/leetcode/solutions/0977-squares-of-a-sorted-array.md)
- [0978. Longest Turbulent Subarray](https://jaywin.gitbook.io/leetcode/solutions/0978-longest-turbulent-subarray.md)
- [0979. Distribute Coins in Binary Tree](https://jaywin.gitbook.io/leetcode/solutions/0979-distribute-coins-in-binary-tree.md)
- [0980. Unique Paths III](https://jaywin.gitbook.io/leetcode/solutions/0980-unique-paths-iii.md)
- [0981. Time Based Key-Value Store](https://jaywin.gitbook.io/leetcode/solutions/0981-time-based-key-value-store.md)
- [0982. Triples with Bitwise AND Equal To Zero](https://jaywin.gitbook.io/leetcode/solutions/0982-triples-with-bitwise-and-equal-to-zero.md)
- [0983. Minimum Cost For Tickets](https://jaywin.gitbook.io/leetcode/solutions/0983-minimum-cost-for-tickets.md)
- [0984. String Without AAA or BBB](https://jaywin.gitbook.io/leetcode/solutions/0984-string-without-aaa-or-bbb.md)
- [0985. Sum of Even Numbers After Queries](https://jaywin.gitbook.io/leetcode/solutions/0985-sum-of-even-numbers-after-queries.md)
- [0986. Interval List Intersections](https://jaywin.gitbook.io/leetcode/solutions/0986-interval-list-intersections.md)
- [0987. Vertical Order Traversal of a Binary Tree](https://jaywin.gitbook.io/leetcode/solutions/0987-vertical-order-traversal-of-a-binary-tree.md)
- [0988. Smallest String Starting From Leaf](https://jaywin.gitbook.io/leetcode/solutions/0988-smallest-string-starting-from-leaf.md)
- [0989. Add to Array-Form of Integer](https://jaywin.gitbook.io/leetcode/solutions/0989-add-to-array-form-of-integer.md)
- [0990. Satisfiability of Equality Equations](https://jaywin.gitbook.io/leetcode/solutions/0990-satisfiability-of-equality-equations.md)
- [0991. Broken Calculator](https://jaywin.gitbook.io/leetcode/solutions/0991-broken-calculator.md)
- [0992. Subarrays with K Different Integers](https://jaywin.gitbook.io/leetcode/solutions/0992-subarrays-with-k-different-integers.md)
- [0993. Cousins in Binary Tree](https://jaywin.gitbook.io/leetcode/solutions/0993-cousins-in-binary-tree.md)
- [0994. Rotting Oranges](https://jaywin.gitbook.io/leetcode/solutions/0994-rotting-oranges.md)
- [0995. Minimum Number of K Consecutive Bit Flips](https://jaywin.gitbook.io/leetcode/solutions/0995-minimum-number-of-k-consecutive-bit-flips.md)
- [0996. Number of Squareful Arrays](https://jaywin.gitbook.io/leetcode/solutions/0996-number-of-squareful-arrays.md)
- [0997. Find the Town Judge](https://jaywin.gitbook.io/leetcode/solutions/0997-find-the-town-judge.md)
- [0998. Maximum Binary Tree II](https://jaywin.gitbook.io/leetcode/solutions/0998-maximum-binary-tree-ii.md)
- [0999. Available Captures for Rook](https://jaywin.gitbook.io/leetcode/solutions/0999-available-captures-for-rook.md)
- [1000. Minimum Cost to Merge Stones](https://jaywin.gitbook.io/leetcode/solutions/1000-minimum-cost-to-merge-stones.md)
- [1001. Grid Illumination](https://jaywin.gitbook.io/leetcode/solutions/1001-grid-illumination.md)
- [1002. Find Common Characters](https://jaywin.gitbook.io/leetcode/solutions/1002-find-common-characters.md)
- [1003. Check If Word Is Valid After Substitutions](https://jaywin.gitbook.io/leetcode/solutions/1003-check-if-word-is-valid-after-substitutions.md)
- [1004. Max Consecutive Ones III](https://jaywin.gitbook.io/leetcode/solutions/1004-max-consecutive-ones-iii.md)
- [1005. Maximize Sum Of Array After K Negations](https://jaywin.gitbook.io/leetcode/solutions/1005-maximize-sum-of-array-after-k-negations.md)
- [1006. Clumsy Factorial](https://jaywin.gitbook.io/leetcode/solutions/1006-clumsy-factorial.md)
- [1007. Minimum Domino Rotations For Equal Row](https://jaywin.gitbook.io/leetcode/solutions/1007-minimum-domino-rotations-for-equal-row.md)
- [1008. Construct Binary Search Tree from Preorder Traversal](https://jaywin.gitbook.io/leetcode/solutions/1008-construct-binary-search-tree-from-preorder-traversal.md)
- [1009. Complement of Base 10 Integer](https://jaywin.gitbook.io/leetcode/solutions/1009-complement-of-base-10-integer.md)
- [1010. Pairs of Songs With Total Durations Divisible by 60](https://jaywin.gitbook.io/leetcode/solutions/1010-pairs-of-songs-with-total-durations-divisible-by-60.md)
- [1011. Capacity To Ship Packages Within D Days](https://jaywin.gitbook.io/leetcode/solutions/1011-capacity-to-ship-packages-within-d-days.md)
- [1012. Numbers With Repeated Digits](https://jaywin.gitbook.io/leetcode/solutions/1012-numbers-with-repeated-digits.md)
- [1013. Partition Array Into Three Parts With Equal Sum](https://jaywin.gitbook.io/leetcode/solutions/1013-partition-array-into-three-parts-with-equal-sum.md)
- [1014. Best Sightseeing Pair](https://jaywin.gitbook.io/leetcode/solutions/1014-best-sightseeing-pair.md)
- [1015. Smallest Integer Divisible by K](https://jaywin.gitbook.io/leetcode/solutions/1015-smallest-integer-divisible-by-k.md)
- [1016. Binary String With Substrings Representing 1 To N](https://jaywin.gitbook.io/leetcode/solutions/1016-binary-string-with-substrings-representing-1-to-n.md)
- [1017. Convert to Base -2](https://jaywin.gitbook.io/leetcode/solutions/1017-convert-to-base-2.md)
- [1018. Binary Prefix Divisible By 5](https://jaywin.gitbook.io/leetcode/solutions/1018-binary-prefix-divisible-by-5.md)
- [1019. Next Greater Node In Linked List](https://jaywin.gitbook.io/leetcode/solutions/1019-next-greater-node-in-linked-list.md)
- [1020. Number of Enclaves](https://jaywin.gitbook.io/leetcode/solutions/1020-number-of-enclaves.md)
- [1021. Remove Outermost Parentheses](https://jaywin.gitbook.io/leetcode/solutions/1021-remove-outermost-parentheses.md)
- [1022. Sum of Root To Leaf Binary Numbers](https://jaywin.gitbook.io/leetcode/solutions/1022-sum-of-root-to-leaf-binary-numbers.md)
- [1023. Camelcase Matching](https://jaywin.gitbook.io/leetcode/solutions/1023-camelcase-matching.md)
- [1024. Video Stitching](https://jaywin.gitbook.io/leetcode/solutions/1024-video-stitching.md)
- [1025. Divisor Game](https://jaywin.gitbook.io/leetcode/solutions/1025-divisor-game.md)
- [1026. Maximum Difference Between Node and Ancestor](https://jaywin.gitbook.io/leetcode/solutions/1026-maximum-difference-between-node-and-ancestor.md)
- [1027. Longest Arithmetic Subsequence](https://jaywin.gitbook.io/leetcode/solutions/1027-longest-arithmetic-subsequence.md)
- [1028. Recover a Tree From Preorder Traversal](https://jaywin.gitbook.io/leetcode/solutions/1028-recover-a-tree-from-preorder-traversal.md)
- [1029. Two City Scheduling](https://jaywin.gitbook.io/leetcode/solutions/1029-two-city-scheduling.md)
- [1030. Matrix Cells in Distance Order](https://jaywin.gitbook.io/leetcode/solutions/1030-matrix-cells-in-distance-order.md)
- [1031. Maximum Sum of Two Non-Overlapping Subarrays](https://jaywin.gitbook.io/leetcode/solutions/1031-maximum-sum-of-two-non-overlapping-subarrays.md)
- [1032. Stream of Characters](https://jaywin.gitbook.io/leetcode/solutions/1032-stream-of-characters.md)
- [1033. Moving Stones Until Consecutive](https://jaywin.gitbook.io/leetcode/solutions/1033-moving-stones-until-consecutive.md)
- [1034. Coloring A Border](https://jaywin.gitbook.io/leetcode/solutions/1034-coloring-a-border.md)
- [1035. Uncrossed Lines](https://jaywin.gitbook.io/leetcode/solutions/1035-uncrossed-lines.md)
- [1036. Escape a Large Maze](https://jaywin.gitbook.io/leetcode/solutions/1036-escape-a-large-maze.md)
- [1037. Valid Boomerang](https://jaywin.gitbook.io/leetcode/solutions/1037-valid-boomerang.md)
- [1038. Binary Search Tree to Greater Sum Tree](https://jaywin.gitbook.io/leetcode/solutions/1038-binary-search-tree-to-greater-sum-tree.md)
- [1039. Minimum Score Triangulation of Polygon](https://jaywin.gitbook.io/leetcode/solutions/1039-minimum-score-triangulation-of-polygon.md)
- [1040. Moving Stones Until Consecutive II](https://jaywin.gitbook.io/leetcode/solutions/1040-moving-stones-until-consecutive-ii.md)
- [1041. Robot Bounded In Circle](https://jaywin.gitbook.io/leetcode/solutions/1041-robot-bounded-in-circle.md)
- [1042. Flower Planting With No Adjacent](https://jaywin.gitbook.io/leetcode/solutions/1042-flower-planting-with-no-adjacent.md)
- [1043. Partition Array for Maximum Sum](https://jaywin.gitbook.io/leetcode/solutions/1043-partition-array-for-maximum-sum.md)
- [1044. Longest Duplicate Substring](https://jaywin.gitbook.io/leetcode/solutions/1044-longest-duplicate-substring.md)
- [1045. Customers Who Bought All Products](https://jaywin.gitbook.io/leetcode/solutions/1045-customers-who-bought-all-products.md)
- [1046. Last Stone Weight](https://jaywin.gitbook.io/leetcode/solutions/1046-last-stone-weight.md)
- [1047. Remove All Adjacent Duplicates In String](https://jaywin.gitbook.io/leetcode/solutions/1047-remove-all-adjacent-duplicates-in-string.md)
- [1048. Longest String Chain](https://jaywin.gitbook.io/leetcode/solutions/1048-longest-string-chain.md)
- [1049. Last Stone Weight II](https://jaywin.gitbook.io/leetcode/solutions/1049-last-stone-weight-ii.md)
- [1050. Actors and Directors Who Cooperated At Least Three Times](https://jaywin.gitbook.io/leetcode/solutions/1050-actors-and-directors-who-cooperated-at-least-three-times.md)
- [1051. Height Checker](https://jaywin.gitbook.io/leetcode/solutions/1051-height-checker.md)
- [1052. Grumpy Bookstore Owner](https://jaywin.gitbook.io/leetcode/solutions/1052-grumpy-bookstore-owner.md)
- [1053. Previous Permutation With One Swap](https://jaywin.gitbook.io/leetcode/solutions/1053-previous-permutation-with-one-swap.md)
- [1054. Distant Barcodes](https://jaywin.gitbook.io/leetcode/solutions/1054-distant-barcodes.md)
- [1055. Shortest Way to Form String](https://jaywin.gitbook.io/leetcode/solutions/1055-shortest-way-to-form-string.md)
- [1056. Confusing Number](https://jaywin.gitbook.io/leetcode/solutions/1056-confusing-number.md)
- [1057. Campus Bikes](https://jaywin.gitbook.io/leetcode/solutions/1057-campus-bikes.md)
- [1058. Minimize Rounding Error to Meet Target](https://jaywin.gitbook.io/leetcode/solutions/1058-minimize-rounding-error-to-meet-target.md)
- [1059. All Paths from Source Lead to Destination](https://jaywin.gitbook.io/leetcode/solutions/1059-all-paths-from-source-lead-to-destination.md)
- [1060. Missing Element in Sorted Array](https://jaywin.gitbook.io/leetcode/solutions/1060-missing-element-in-sorted-array.md)
- [1061. Lexicographically Smallest Equivalent String](https://jaywin.gitbook.io/leetcode/solutions/1061-lexicographically-smallest-equivalent-string.md)
- [1062. Longest Repeating Substring](https://jaywin.gitbook.io/leetcode/solutions/1062-longest-repeating-substring.md)
- [1063. Number of Valid Subarrays](https://jaywin.gitbook.io/leetcode/solutions/1063-number-of-valid-subarrays.md)
- [1064. Fixed Point](https://jaywin.gitbook.io/leetcode/solutions/1064-fixed-point.md)
- [1065. Index Pairs of a String](https://jaywin.gitbook.io/leetcode/solutions/1065-index-pairs-of-a-string.md)
- [1066. Campus Bikes II](https://jaywin.gitbook.io/leetcode/solutions/1066-campus-bikes-ii.md)
- [1067. Digit Count in Range](https://jaywin.gitbook.io/leetcode/solutions/1067-digit-count-in-range.md)
- [1068. Product Sales Analysis I](https://jaywin.gitbook.io/leetcode/solutions/1068-product-sales-analysis-i.md)
- [1069. Product Sales Analysis II](https://jaywin.gitbook.io/leetcode/solutions/1069-product-sales-analysis-ii.md)
- [1070. Product Sales Analysis III](https://jaywin.gitbook.io/leetcode/solutions/1070-product-sales-analysis-iii.md)
- [1071. Greatest Common Divisor of Strings](https://jaywin.gitbook.io/leetcode/solutions/1071-greatest-common-divisor-of-strings.md)
- [1072. Flip Columns For Maximum Number of Equal Rows](https://jaywin.gitbook.io/leetcode/solutions/1072-flip-columns-for-maximum-number-of-equal-rows.md)
- [1073. Adding Two Negabinary Numbers](https://jaywin.gitbook.io/leetcode/solutions/1073-adding-two-negabinary-numbers.md)
- [1074. Number of Submatrices That Sum to Target](https://jaywin.gitbook.io/leetcode/solutions/1074-number-of-submatrices-that-sum-to-target.md)
- [1075. Project Employees I](https://jaywin.gitbook.io/leetcode/solutions/1075-project-employees-i.md)
- [1076. Project Employees II](https://jaywin.gitbook.io/leetcode/solutions/1076-project-employees-ii.md)
- [1077. Project Employees III](https://jaywin.gitbook.io/leetcode/solutions/1077-project-employees-iii.md)
- [1078. Occurrences After Bigram](https://jaywin.gitbook.io/leetcode/solutions/1078-occurrences-after-bigram.md)
- [1079. Letter Tile Possibilities](https://jaywin.gitbook.io/leetcode/solutions/1079-letter-tile-possibilities.md)
- [1080. Insufficient Nodes in Root to Leaf Paths](https://jaywin.gitbook.io/leetcode/solutions/1080-insufficient-nodes-in-root-to-leaf-paths.md)
- [1081. Smallest Subsequence of Distinct Characters](https://jaywin.gitbook.io/leetcode/solutions/1081-smallest-subsequence-of-distinct-characters.md)
- [1082. Sales Analysis I](https://jaywin.gitbook.io/leetcode/solutions/1082-sales-analysis-i.md)
- [1083. Sales Analysis II](https://jaywin.gitbook.io/leetcode/solutions/1083-sales-analysis-ii.md)
- [1084. Sales Analysis III](https://jaywin.gitbook.io/leetcode/solutions/1084-sales-analysis-iii.md)
- [1085. Sum of Digits in the Minimum Number](https://jaywin.gitbook.io/leetcode/solutions/1085-sum-of-digits-in-the-minimum-number.md)
- [1086. High Five](https://jaywin.gitbook.io/leetcode/solutions/1086-high-five.md)
- [1087. Brace Expansion](https://jaywin.gitbook.io/leetcode/solutions/1087-brace-expansion.md)
- [1088. Confusing Number II](https://jaywin.gitbook.io/leetcode/solutions/1088-confusing-number-ii.md)
- [1089. Duplicate Zeros](https://jaywin.gitbook.io/leetcode/solutions/1089-duplicate-zeros.md)
- [1090. Largest Values From Labels](https://jaywin.gitbook.io/leetcode/solutions/1090-largest-values-from-labels.md)
- [1091. Shortest Path in Binary Matrix](https://jaywin.gitbook.io/leetcode/solutions/1091-shortest-path-in-binary-matrix.md)
- [1092. Shortest Common Supersequence](https://jaywin.gitbook.io/leetcode/solutions/1092-shortest-common-supersequence.md)
- [1093. Statistics from a Large Sample](https://jaywin.gitbook.io/leetcode/solutions/1093-statistics-from-a-large-sample.md)
- [1094. Car Pooling](https://jaywin.gitbook.io/leetcode/solutions/1094-car-pooling.md)
- [1095. Find in Mountain Array](https://jaywin.gitbook.io/leetcode/solutions/1095-find-in-mountain-array.md)
- [1096. Brace Expansion II](https://jaywin.gitbook.io/leetcode/solutions/1096-brace-expansion-ii.md)
- [1097. Game Play Analysis V](https://jaywin.gitbook.io/leetcode/solutions/1097-game-play-analysis-v.md)
- [1098. Unpopular Books](https://jaywin.gitbook.io/leetcode/solutions/1098-unpopular-books.md)
- [1099. Two Sum Less Than K](https://jaywin.gitbook.io/leetcode/solutions/1099-two-sum-less-than-k.md)
- [1100. Find K-Length Substrings With No Repeated Characters](https://jaywin.gitbook.io/leetcode/solutions/1100-find-k-length-substrings-with-no-repeated-characters.md)
- [1101. The Earliest Moment When Everyone Become Friends](https://jaywin.gitbook.io/leetcode/solutions/1101-the-earliest-moment-when-everyone-become-friends.md)
- [1102. Path With Maximum Minimum Value](https://jaywin.gitbook.io/leetcode/solutions/1102-path-with-maximum-minimum-value.md)
- [1103. Distribute Candies to People](https://jaywin.gitbook.io/leetcode/solutions/1103-distribute-candies-to-people.md)
- [1104. Path In Zigzag Labelled Binary Tree](https://jaywin.gitbook.io/leetcode/solutions/1104-path-in-zigzag-labelled-binary-tree.md)
- [1105. Filling Bookcase Shelves](https://jaywin.gitbook.io/leetcode/solutions/1105-filling-bookcase-shelves.md)
- [1106. Parsing A Boolean Expression](https://jaywin.gitbook.io/leetcode/solutions/1106-parsing-a-boolean-expression.md)
- [1107. New Users Daily Count](https://jaywin.gitbook.io/leetcode/solutions/1107-new-users-daily-count.md)
- [1108. Defanging an IP Address](https://jaywin.gitbook.io/leetcode/solutions/1108-defanging-an-ip-address.md)
- [1109. Corporate Flight Bookings](https://jaywin.gitbook.io/leetcode/solutions/1109-corporate-flight-bookings.md)
- [1110. Delete Nodes And Return Forest](https://jaywin.gitbook.io/leetcode/solutions/1110-delete-nodes-and-return-forest.md)
- [1111. Maximum Nesting Depth of Two Valid Parentheses Strings](https://jaywin.gitbook.io/leetcode/solutions/1111-maximum-nesting-depth-of-two-valid-parentheses-strings.md)
- [1112. Highest Grade For Each Student](https://jaywin.gitbook.io/leetcode/solutions/1112-highest-grade-for-each-student.md)
- [1113. Reported Posts](https://jaywin.gitbook.io/leetcode/solutions/1113-reported-posts.md)
- [1114. Print in Order](https://jaywin.gitbook.io/leetcode/solutions/1114-print-in-order.md)
- [1115. Print FooBar Alternately](https://jaywin.gitbook.io/leetcode/solutions/1115-print-foobar-alternately.md)
- [1116. Print Zero Even Odd](https://jaywin.gitbook.io/leetcode/solutions/1116-print-zero-even-odd.md)
- [1117. Building H2O](https://jaywin.gitbook.io/leetcode/solutions/1117-building-h2o.md)
- [1118. Number of Days in a Month](https://jaywin.gitbook.io/leetcode/solutions/1118-number-of-days-in-a-month.md)
- [1119. Remove Vowels from a String](https://jaywin.gitbook.io/leetcode/solutions/1119-remove-vowels-from-a-string.md)
- [1120. Maximum Average Subtree](https://jaywin.gitbook.io/leetcode/solutions/1120-maximum-average-subtree.md)
- [1121. Divide Array Into Increasing Sequences](https://jaywin.gitbook.io/leetcode/solutions/1121-divide-array-into-increasing-sequences.md)
- [1122. Relative Sort Array](https://jaywin.gitbook.io/leetcode/solutions/1122-relative-sort-array.md)
- [1123. Lowest Common Ancestor of Deepest Leaves](https://jaywin.gitbook.io/leetcode/solutions/1123-lowest-common-ancestor-of-deepest-leaves.md)
- [1124. Longest Well-Performing Interval](https://jaywin.gitbook.io/leetcode/solutions/1124-longest-well-performing-interval.md)
- [1125. Smallest Sufficient Team](https://jaywin.gitbook.io/leetcode/solutions/1125-smallest-sufficient-team.md)
- [1126. Active Businesses](https://jaywin.gitbook.io/leetcode/solutions/1126-active-businesses.md)
- [1127. User Purchase Platform](https://jaywin.gitbook.io/leetcode/solutions/1127-user-purchase-platform.md)
- [1128. Number of Equivalent Domino Pairs](https://jaywin.gitbook.io/leetcode/solutions/1128-number-of-equivalent-domino-pairs.md)
- [1129. Shortest Path with Alternating Colors](https://jaywin.gitbook.io/leetcode/solutions/1129-shortest-path-with-alternating-colors.md)
- [1130. Minimum Cost Tree From Leaf Values](https://jaywin.gitbook.io/leetcode/solutions/1130-minimum-cost-tree-from-leaf-values.md)
- [1131. Maximum of Absolute Value Expression](https://jaywin.gitbook.io/leetcode/solutions/1131-maximum-of-absolute-value-expression.md)
- [1132. Reported Posts II](https://jaywin.gitbook.io/leetcode/solutions/1132-reported-posts-ii.md)
- [1133. Largest Unique Number](https://jaywin.gitbook.io/leetcode/solutions/1133-largest-unique-number.md)
- [1134. Armstrong Number](https://jaywin.gitbook.io/leetcode/solutions/1134-armstrong-number.md)
- [1135. Connecting Cities With Minimum Cost](https://jaywin.gitbook.io/leetcode/solutions/1135-connecting-cities-with-minimum-cost.md)
- [1136. Parallel Courses](https://jaywin.gitbook.io/leetcode/solutions/1136-parallel-courses.md)
- [1137. N-th Tribonacci Number](https://jaywin.gitbook.io/leetcode/solutions/1137-n-th-tribonacci-number.md)
- [1138. Alphabet Board Path](https://jaywin.gitbook.io/leetcode/solutions/1138-alphabet-board-path.md)
- [1139. Largest 1-Bordered Square](https://jaywin.gitbook.io/leetcode/solutions/1139-largest-1-bordered-square.md)
- [1140. Stone Game II](https://jaywin.gitbook.io/leetcode/solutions/1140-stone-game-ii.md)
- [1141. User Activity for the Past 30 Days I](https://jaywin.gitbook.io/leetcode/solutions/1141-user-activity-for-the-past-30-days-i.md)
- [1142. User Activity for the Past 30 Days II](https://jaywin.gitbook.io/leetcode/solutions/1142-user-activity-for-the-past-30-days-ii.md)
- [1143. Longest Common Subsequence](https://jaywin.gitbook.io/leetcode/solutions/1143-longest-common-subsequence.md)
- [1144. Decrease Elements To Make Array Zigzag](https://jaywin.gitbook.io/leetcode/solutions/1144-decrease-elements-to-make-array-zigzag.md)
- [1145. Binary Tree Coloring Game](https://jaywin.gitbook.io/leetcode/solutions/1145-binary-tree-coloring-game.md)
- [1146. Snapshot Array](https://jaywin.gitbook.io/leetcode/solutions/1146-snapshot-array.md)
- [1147. Longest Chunked Palindrome Decomposition](https://jaywin.gitbook.io/leetcode/solutions/1147-longest-chunked-palindrome-decomposition.md)
- [1148. Article Views I](https://jaywin.gitbook.io/leetcode/solutions/1148-article-views-i.md)
- [1149. Article Views II](https://jaywin.gitbook.io/leetcode/solutions/1149-article-views-ii.md)
- [1150. Check If a Number Is Majority Element in a Sorted Array](https://jaywin.gitbook.io/leetcode/solutions/1150-check-if-a-number-is-majority-element-in-a-sorted-array.md)
- [1151. Minimum Swaps to Group All 1's Together](https://jaywin.gitbook.io/leetcode/solutions/1151-minimum-swaps-to-group-all-1s-together.md)
- [1152. Analyze User Website Visit Pattern](https://jaywin.gitbook.io/leetcode/solutions/1152-analyze-user-website-visit-pattern.md)
- [1153. String Transforms Into Another String](https://jaywin.gitbook.io/leetcode/solutions/1153-string-transforms-into-another-string.md)
- [1154. Day of the Year](https://jaywin.gitbook.io/leetcode/solutions/1154-day-of-the-year.md)
- [1155. Number of Dice Rolls With Target Sum](https://jaywin.gitbook.io/leetcode/solutions/1155-number-of-dice-rolls-with-target-sum.md)
- [1156. Swap For Longest Repeated Character Substring](https://jaywin.gitbook.io/leetcode/solutions/1156-swap-for-longest-repeated-character-substring.md)
- [1157. Online Majority Element In Subarray](https://jaywin.gitbook.io/leetcode/solutions/1157-online-majority-element-in-subarray.md)
- [1158. Market Analysis I](https://jaywin.gitbook.io/leetcode/solutions/1158-market-analysis-i.md)
- [1159. Market Analysis II](https://jaywin.gitbook.io/leetcode/solutions/1159-market-analysis-ii.md)
- [1160. Find Words That Can Be Formed by Characters](https://jaywin.gitbook.io/leetcode/solutions/1160-find-words-that-can-be-formed-by-characters.md)
- [1161. Maximum Level Sum of a Binary Tree](https://jaywin.gitbook.io/leetcode/solutions/1161-maximum-level-sum-of-a-binary-tree.md)
- [1162. As Far from Land as Possible](https://jaywin.gitbook.io/leetcode/solutions/1162-as-far-from-land-as-possible.md)
- [1163. Last Substring in Lexicographical Order](https://jaywin.gitbook.io/leetcode/solutions/1163-last-substring-in-lexicographical-order.md)
- [1164. Product Price at a Given Date](https://jaywin.gitbook.io/leetcode/solutions/1164-product-price-at-a-given-date.md)
- [1165. Single-Row Keyboard](https://jaywin.gitbook.io/leetcode/solutions/1165-single-row-keyboard.md)
- [1166. Design File System](https://jaywin.gitbook.io/leetcode/solutions/1166-design-file-system.md)
- [1167. Minimum Cost to Connect Sticks](https://jaywin.gitbook.io/leetcode/solutions/1167-minimum-cost-to-connect-sticks.md)
- [1168. Optimize Water Distribution in a Village](https://jaywin.gitbook.io/leetcode/solutions/1168-optimize-water-distribution-in-a-village.md)
- [1169. Invalid Transactions](https://jaywin.gitbook.io/leetcode/solutions/1169-invalid-transactions.md)
- [1170. Compare Strings by Frequency of the Smallest Character](https://jaywin.gitbook.io/leetcode/solutions/1170-compare-strings-by-frequency-of-the-smallest-character.md)
- [1171. Remove Zero Sum Consecutive Nodes from Linked List](https://jaywin.gitbook.io/leetcode/solutions/1171-remove-zero-sum-consecutive-nodes-from-linked-list.md)
- [1172. Dinner Plate Stacks](https://jaywin.gitbook.io/leetcode/solutions/1172-dinner-plate-stacks.md)
- [1173. Immediate Food Delivery I](https://jaywin.gitbook.io/leetcode/solutions/1173-immediate-food-delivery-i.md)
- [1174. Immediate Food Delivery II](https://jaywin.gitbook.io/leetcode/solutions/1174-immediate-food-delivery-ii.md)
- [1175. Prime Arrangements](https://jaywin.gitbook.io/leetcode/solutions/1175-prime-arrangements.md)
- [1176. Diet Plan Performance](https://jaywin.gitbook.io/leetcode/solutions/1176-diet-plan-performance.md)
- [1177. Can Make Palindrome from Substring](https://jaywin.gitbook.io/leetcode/solutions/1177-can-make-palindrome-from-substring.md)
- [1178. Number of Valid Words for Each Puzzle](https://jaywin.gitbook.io/leetcode/solutions/1178-number-of-valid-words-for-each-puzzle.md)
- [1179. Reformat Department Table](https://jaywin.gitbook.io/leetcode/solutions/1179-reformat-department-table.md)
- [1180. Count Substrings with Only One Distinct Letter](https://jaywin.gitbook.io/leetcode/solutions/1180-count-substrings-with-only-one-distinct-letter.md)
- [1181. Before and After Puzzle](https://jaywin.gitbook.io/leetcode/solutions/1181-before-and-after-puzzle.md)
- [1182. Shortest Distance to Target Color](https://jaywin.gitbook.io/leetcode/solutions/1182-shortest-distance-to-target-color.md)
- [1183. Maximum Number of Ones](https://jaywin.gitbook.io/leetcode/solutions/1183-maximum-number-of-ones.md)
- [1184. Distance Between Bus Stops](https://jaywin.gitbook.io/leetcode/solutions/1184-distance-between-bus-stops.md)
- [1185. Day of the Week](https://jaywin.gitbook.io/leetcode/solutions/1185-day-of-the-week.md)
- [1186. Maximum Subarray Sum with One Deletion](https://jaywin.gitbook.io/leetcode/solutions/1186-maximum-subarray-sum-with-one-deletion.md)
- [1187. Make Array Strictly Increasing](https://jaywin.gitbook.io/leetcode/solutions/1187-make-array-strictly-increasing.md)
- [1188. Design Bounded Blocking Queue](https://jaywin.gitbook.io/leetcode/solutions/1188-design-bounded-blocking-queue.md)
- [1189. Maximum Number of Balloons](https://jaywin.gitbook.io/leetcode/solutions/1189-maximum-number-of-balloons.md)
- [1190. Reverse Substrings Between Each Pair of Parentheses](https://jaywin.gitbook.io/leetcode/solutions/1190-reverse-substrings-between-each-pair-of-parentheses.md)
- [1191. K-Concatenation Maximum Sum](https://jaywin.gitbook.io/leetcode/solutions/1191-k-concatenation-maximum-sum.md)
- [1192. Critical Connections in a Network](https://jaywin.gitbook.io/leetcode/solutions/1192-critical-connections-in-a-network.md)
- [1193. Monthly Transactions I](https://jaywin.gitbook.io/leetcode/solutions/1193-monthly-transactions-i.md)
- [1194. Tournament Winners](https://jaywin.gitbook.io/leetcode/solutions/1194-tournament-winners.md)
- [1195. Fizz Buzz Multithreaded](https://jaywin.gitbook.io/leetcode/solutions/1195-fizz-buzz-multithreaded.md)
- [1196. How Many Apples Can You Put into the Basket](https://jaywin.gitbook.io/leetcode/solutions/1196-how-many-apples-can-you-put-into-the-basket.md)
- [1197. Minimum Knight Moves](https://jaywin.gitbook.io/leetcode/solutions/1197-minimum-knight-moves.md)
- [1198. Find Smallest Common Element in All Rows](https://jaywin.gitbook.io/leetcode/solutions/1198-find-smallest-common-element-in-all-rows.md)
- [1199. Minimum Time to Build Blocks](https://jaywin.gitbook.io/leetcode/solutions/1199-minimum-time-to-build-blocks.md)
- [1200. Minimum Absolute Difference](https://jaywin.gitbook.io/leetcode/solutions/1200-minimum-absolute-difference.md)
- [1201. Ugly Number III](https://jaywin.gitbook.io/leetcode/solutions/1201-ugly-number-iii.md)
- [1202. Smallest String With Swaps](https://jaywin.gitbook.io/leetcode/solutions/1202-smallest-string-with-swaps.md)
- [1203. Sort Items by Groups Respecting Dependencies](https://jaywin.gitbook.io/leetcode/solutions/1203-sort-items-by-groups-respecting-dependencies.md)
- [1204. Last Person to Fit in the Bus](https://jaywin.gitbook.io/leetcode/solutions/1204-last-person-to-fit-in-the-bus.md)
- [1205. Monthly Transactions II](https://jaywin.gitbook.io/leetcode/solutions/1205-monthly-transactions-ii.md)
- [1206. Design Skiplist](https://jaywin.gitbook.io/leetcode/solutions/1206-design-skiplist.md)
- [1207. Unique Number of Occurrences](https://jaywin.gitbook.io/leetcode/solutions/1207-unique-number-of-occurrences.md)
- [1208. Get Equal Substrings Within Budget](https://jaywin.gitbook.io/leetcode/solutions/1208-get-equal-substrings-within-budget.md)
- [1209. Remove All Adjacent Duplicates in String II](https://jaywin.gitbook.io/leetcode/solutions/1209-remove-all-adjacent-duplicates-in-string-ii.md)
- [1210. Minimum Moves to Reach Target with Rotations](https://jaywin.gitbook.io/leetcode/solutions/1210-minimum-moves-to-reach-target-with-rotations.md)
- [1211. Queries Quality and Percentage](https://jaywin.gitbook.io/leetcode/solutions/1211-queries-quality-and-percentage.md)
- [1212. Team Scores in Football Tournament](https://jaywin.gitbook.io/leetcode/solutions/1212-team-scores-in-football-tournament.md)
- [1213. Intersection of Three Sorted Arrays](https://jaywin.gitbook.io/leetcode/solutions/1213-intersection-of-three-sorted-arrays.md)
- [1214. Two Sum BSTs](https://jaywin.gitbook.io/leetcode/solutions/1214-two-sum-bsts.md)
- [1215. Stepping Numbers](https://jaywin.gitbook.io/leetcode/solutions/1215-stepping-numbers.md)
- [1216. Valid Palindrome III](https://jaywin.gitbook.io/leetcode/solutions/1216-valid-palindrome-iii.md)
- [1217. Minimum Cost to Move Chips to The Same Position](https://jaywin.gitbook.io/leetcode/solutions/1217-minimum-cost-to-move-chips-to-the-same-position.md)
- [1218. Longest Arithmetic Subsequence of Given Difference](https://jaywin.gitbook.io/leetcode/solutions/1218-longest-arithmetic-subsequence-of-given-difference.md)
- [1219. Path with Maximum Gold](https://jaywin.gitbook.io/leetcode/solutions/1219-path-with-maximum-gold.md)
- [1220. Count Vowels Permutation](https://jaywin.gitbook.io/leetcode/solutions/1220-count-vowels-permutation.md)
- [1221. Split a String in Balanced Strings](https://jaywin.gitbook.io/leetcode/solutions/1221-split-a-string-in-balanced-strings.md)
- [1222. Queens That Can Attack the King](https://jaywin.gitbook.io/leetcode/solutions/1222-queens-that-can-attack-the-king.md)
- [1223. Dice Roll Simulation](https://jaywin.gitbook.io/leetcode/solutions/1223-dice-roll-simulation.md)
- [1224. Maximum Equal Frequency](https://jaywin.gitbook.io/leetcode/solutions/1224-maximum-equal-frequency.md)
- [1225. Report Contiguous Dates](https://jaywin.gitbook.io/leetcode/solutions/1225-report-contiguous-dates.md)
- [1226. The Dining Philosophers](https://jaywin.gitbook.io/leetcode/solutions/1226-the-dining-philosophers.md)
- [1227. Airplane Seat Assignment Probability](https://jaywin.gitbook.io/leetcode/solutions/1227-airplane-seat-assignment-probability.md)
- [1228. Missing Number In Arithmetic Progression](https://jaywin.gitbook.io/leetcode/solutions/1228-missing-number-in-arithmetic-progression.md)
- [1229. Meeting Scheduler](https://jaywin.gitbook.io/leetcode/solutions/1229-meeting-scheduler.md)
- [1230. Toss Strange Coins](https://jaywin.gitbook.io/leetcode/solutions/1230-toss-strange-coins.md)
- [1231. Divide Chocolate](https://jaywin.gitbook.io/leetcode/solutions/1231-divide-chocolate.md)
- [1232. Check If It Is a Straight Line](https://jaywin.gitbook.io/leetcode/solutions/1232-check-if-it-is-a-straight-line.md)
- [1233. Remove Sub-Folders from the Filesystem](https://jaywin.gitbook.io/leetcode/solutions/1233-remove-sub-folders-from-the-filesystem.md)
- [1234. Replace the Substring for Balanced String](https://jaywin.gitbook.io/leetcode/solutions/1234-replace-the-substring-for-balanced-string.md)
- [1235. Maximum Profit in Job Scheduling](https://jaywin.gitbook.io/leetcode/solutions/1235-maximum-profit-in-job-scheduling.md)
- [1236. Web Crawler](https://jaywin.gitbook.io/leetcode/solutions/1236-web-crawler.md)
- [1237. Find Positive Integer Solution for a Given Equation](https://jaywin.gitbook.io/leetcode/solutions/1237-find-positive-integer-solution-for-a-given-equation.md)
- [1238. Circular Permutation in Binary Representation](https://jaywin.gitbook.io/leetcode/solutions/1238-circular-permutation-in-binary-representation.md)
- [1239. Maximum Length of a Concatenated String with Unique Characters](https://jaywin.gitbook.io/leetcode/solutions/1239-maximum-length-of-a-concatenated-string-with-unique-characters.md)
- [1240. Tiling a Rectangle with the Fewest Squares](https://jaywin.gitbook.io/leetcode/solutions/1240-tiling-a-rectangle-with-the-fewest-squares.md)
- [1241. Number of Comments per Post](https://jaywin.gitbook.io/leetcode/solutions/1241-number-of-comments-per-post.md)
- [1242. Web Crawler Multithreaded](https://jaywin.gitbook.io/leetcode/solutions/1242-web-crawler-multithreaded.md)
- [1243. Array Transformation](https://jaywin.gitbook.io/leetcode/solutions/1243-array-transformation.md)
- [1244. Design A Leaderboard](https://jaywin.gitbook.io/leetcode/solutions/1244-design-a-leaderboard.md)
- [1245. Tree Diameter](https://jaywin.gitbook.io/leetcode/solutions/1245-tree-diameter.md)
- [1246. Palindrome Removal](https://jaywin.gitbook.io/leetcode/solutions/1246-palindrome-removal.md)
- [1247. Minimum Swaps to Make Strings Equal](https://jaywin.gitbook.io/leetcode/solutions/1247-minimum-swaps-to-make-strings-equal.md)
- [1248. Count Number of Nice Subarrays](https://jaywin.gitbook.io/leetcode/solutions/1248-count-number-of-nice-subarrays.md)
- [1249. Minimum Remove to Make Valid Parentheses](https://jaywin.gitbook.io/leetcode/solutions/1249-minimum-remove-to-make-valid-parentheses.md)
- [1250. Check If It Is a Good Array](https://jaywin.gitbook.io/leetcode/solutions/1250-check-if-it-is-a-good-array.md)
- [1251. Average Selling Price](https://jaywin.gitbook.io/leetcode/solutions/1251-average-selling-price.md)
- [1252. Cells with Odd Values in a Matrix](https://jaywin.gitbook.io/leetcode/solutions/1252-cells-with-odd-values-in-a-matrix.md)
- [1253. Reconstruct a 2-Row Binary Matrix](https://jaywin.gitbook.io/leetcode/solutions/1253-reconstruct-a-2-row-binary-matrix.md)
- [1254. Number of Closed Islands](https://jaywin.gitbook.io/leetcode/solutions/1254-number-of-closed-islands.md)
- [1255. Maximum Score Words Formed by Letters](https://jaywin.gitbook.io/leetcode/solutions/1255-maximum-score-words-formed-by-letters.md)
- [1256. Encode Number](https://jaywin.gitbook.io/leetcode/solutions/1256-encode-number.md)
- [1257. Smallest Common Region](https://jaywin.gitbook.io/leetcode/solutions/1257-smallest-common-region.md)
- [1258. Synonymous Sentences](https://jaywin.gitbook.io/leetcode/solutions/1258-synonymous-sentences.md)
- [1259. Handshakes That Don't Cross](https://jaywin.gitbook.io/leetcode/solutions/1259-handshakes-that-dont-cross.md)
- [1260. Shift 2D Grid](https://jaywin.gitbook.io/leetcode/solutions/1260-shift-2d-grid.md)
- [1261. Find Elements in a Contaminated Binary Tree](https://jaywin.gitbook.io/leetcode/solutions/1261-find-elements-in-a-contaminated-binary-tree.md)
- [1262. Greatest Sum Divisible by Three](https://jaywin.gitbook.io/leetcode/solutions/1262-greatest-sum-divisible-by-three.md)
- [1263. Minimum Moves to Move a Box to Their Target Location](https://jaywin.gitbook.io/leetcode/solutions/1263-minimum-moves-to-move-a-box-to-their-target-location.md)
- [1264. Page Recommendations](https://jaywin.gitbook.io/leetcode/solutions/1264-page-recommendations.md)
- [1265. Print Immutable Linked List in Reverse](https://jaywin.gitbook.io/leetcode/solutions/1265-print-immutable-linked-list-in-reverse.md)
- [1266. Minimum Time Visiting All Points](https://jaywin.gitbook.io/leetcode/solutions/1266-minimum-time-visiting-all-points.md)
- [1267. Count Servers that Communicate](https://jaywin.gitbook.io/leetcode/solutions/1267-count-servers-that-communicate.md)
- [1268. Search Suggestions System](https://jaywin.gitbook.io/leetcode/solutions/1268-search-suggestions-system.md)
- [1269. Number of Ways to Stay in the Same Place After Some Steps](https://jaywin.gitbook.io/leetcode/solutions/1269-number-of-ways-to-stay-in-the-same-place-after-some-steps.md)
- [1270. All People Report to the Given Manager](https://jaywin.gitbook.io/leetcode/solutions/1270-all-people-report-to-the-given-manager.md)
- [1271. Hexspeak](https://jaywin.gitbook.io/leetcode/solutions/1271-hexspeak.md)
- [1272. Remove Interval](https://jaywin.gitbook.io/leetcode/solutions/1272-remove-interval.md)
- [1273. Delete Tree Nodes](https://jaywin.gitbook.io/leetcode/solutions/1273-delete-tree-nodes.md)
- [1274. Number of Ships in a Rectangle](https://jaywin.gitbook.io/leetcode/solutions/1274-number-of-ships-in-a-rectangle.md)
- [1275. Find Winner on a Tic Tac Toe Game](https://jaywin.gitbook.io/leetcode/solutions/1275-find-winner-on-a-tic-tac-toe-game.md)
- [1276. Number of Burgers with No Waste of Ingredients](https://jaywin.gitbook.io/leetcode/solutions/1276-number-of-burgers-with-no-waste-of-ingredients.md)
- [1277. Count Square Submatrices with All Ones](https://jaywin.gitbook.io/leetcode/solutions/1277-count-square-submatrices-with-all-ones.md)
- [1278. Palindrome Partitioning III](https://jaywin.gitbook.io/leetcode/solutions/1278-palindrome-partitioning-iii.md)
- [1279. Traffic Light Controlled Intersection](https://jaywin.gitbook.io/leetcode/solutions/1279-traffic-light-controlled-intersection.md)
- [1280. Students and Examinations](https://jaywin.gitbook.io/leetcode/solutions/1280-students-and-examinations.md)
- [1281. Subtract the Product and Sum of Digits of an Integer](https://jaywin.gitbook.io/leetcode/solutions/1281-subtract-the-product-and-sum-of-digits-of-an-integer.md)
- [1282. Group the People Given the Group Size They Belong To](https://jaywin.gitbook.io/leetcode/solutions/1282-group-the-people-given-the-group-size-they-belong-to.md)
- [1283. Find the Smallest Divisor Given a Threshold](https://jaywin.gitbook.io/leetcode/solutions/1283-find-the-smallest-divisor-given-a-threshold.md)
- [1284. Minimum Number of Flips to Convert Binary Matrix to Zero Matrix](https://jaywin.gitbook.io/leetcode/solutions/1284-minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix.md)
- [1285. Find the Start and End Number of Continuous Ranges](https://jaywin.gitbook.io/leetcode/solutions/1285-find-the-start-and-end-number-of-continuous-ranges.md)
- [1286. Iterator for Combination](https://jaywin.gitbook.io/leetcode/solutions/1286-iterator-for-combination.md)
- [1287. Element Appearing More Than 25% In Sorted Array](https://jaywin.gitbook.io/leetcode/solutions/1287-element-appearing-more-than-25-in-sorted-array.md)
- [1288. Remove Covered Intervals](https://jaywin.gitbook.io/leetcode/solutions/1288-remove-covered-intervals.md)
- [1289. Minimum Falling Path Sum II](https://jaywin.gitbook.io/leetcode/solutions/1289-minimum-falling-path-sum-ii.md)
- [1290. Convert Binary Number in a Linked List to Integer](https://jaywin.gitbook.io/leetcode/solutions/1290-convert-binary-number-in-a-linked-list-to-integer.md)
- [1291. Sequential Digits](https://jaywin.gitbook.io/leetcode/solutions/1291-sequential-digits.md)
- [1292. Maximum Side Length of a Square with Sum Less than or Equal to Threshold](https://jaywin.gitbook.io/leetcode/solutions/1292-maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold.md)
- [1293. Shortest Path in a Grid with Obstacles Elimination](https://jaywin.gitbook.io/leetcode/solutions/1293-shortest-path-in-a-grid-with-obstacles-elimination.md)
- [1294. Weather Type in Each Country](https://jaywin.gitbook.io/leetcode/solutions/1294-weather-type-in-each-country.md)
- [1295. Find Numbers with Even Number of Digits](https://jaywin.gitbook.io/leetcode/solutions/1295-find-numbers-with-even-number-of-digits.md)
- [1296. Divide Array in Sets of K Consecutive Numbers](https://jaywin.gitbook.io/leetcode/solutions/1296-divide-array-in-sets-of-k-consecutive-numbers.md)
- [1297. Maximum Number of Occurrences of a Substring](https://jaywin.gitbook.io/leetcode/solutions/1297-maximum-number-of-occurrences-of-a-substring.md)
- [1298. Maximum Candies You Can Get from Boxes](https://jaywin.gitbook.io/leetcode/solutions/1298-maximum-candies-you-can-get-from-boxes.md)
- [1299. Replace Elements with Greatest Element on Right Side](https://jaywin.gitbook.io/leetcode/solutions/1299-replace-elements-with-greatest-element-on-right-side.md)
- [1300. Sum of Mutated Array Closest to Target](https://jaywin.gitbook.io/leetcode/solutions/1300-sum-of-mutated-array-closest-to-target.md)
- [1301. Number of Paths with Max Score](https://jaywin.gitbook.io/leetcode/solutions/1301-number-of-paths-with-max-score.md)
- [1302. Deepest Leaves Sum](https://jaywin.gitbook.io/leetcode/solutions/1302-deepest-leaves-sum.md)
- [1303. Find the Team Size](https://jaywin.gitbook.io/leetcode/solutions/1303-find-the-team-size.md)
- [1304. Find N Unique Integers Sum up to Zero](https://jaywin.gitbook.io/leetcode/solutions/1304-find-n-unique-integers-sum-up-to-zero.md)
- [1305. All Elements in Two Binary Search Trees](https://jaywin.gitbook.io/leetcode/solutions/1305-all-elements-in-two-binary-search-trees.md)
- [1306. Jump Game III](https://jaywin.gitbook.io/leetcode/solutions/1306-jump-game-iii.md)
- [1307. Verbal Arithmetic Puzzle](https://jaywin.gitbook.io/leetcode/solutions/1307-verbal-arithmetic-puzzle.md)
- [1308. Running Total for Different Genders](https://jaywin.gitbook.io/leetcode/solutions/1308-running-total-for-different-genders.md)
- [1309. Decrypt String from Alphabet to Integer Mapping](https://jaywin.gitbook.io/leetcode/solutions/1309-decrypt-string-from-alphabet-to-integer-mapping.md)
- [1310. XOR Queries of a Subarray](https://jaywin.gitbook.io/leetcode/solutions/1310-xor-queries-of-a-subarray.md)
- [1311. Get Watched Videos by Your Friends](https://jaywin.gitbook.io/leetcode/solutions/1311-get-watched-videos-by-your-friends.md)
- [1312. Minimum Insertion Steps to Make a String Palindrome](https://jaywin.gitbook.io/leetcode/solutions/1312-minimum-insertion-steps-to-make-a-string-palindrome.md)
- [1313. Decompress Run-Length Encoded List](https://jaywin.gitbook.io/leetcode/solutions/1313-decompress-run-length-encoded-list.md)
- [1314. Matrix Block Sum](https://jaywin.gitbook.io/leetcode/solutions/1314-matrix-block-sum.md)
- [1315. Sum of Nodes with Even-Valued Grandparent](https://jaywin.gitbook.io/leetcode/solutions/1315-sum-of-nodes-with-even-valued-grandparent.md)
- [1316. Distinct Echo Substrings](https://jaywin.gitbook.io/leetcode/solutions/1316-distinct-echo-substrings.md)
- [1317. Convert Integer to the Sum of Two No-Zero Integers](https://jaywin.gitbook.io/leetcode/solutions/1317-convert-integer-to-the-sum-of-two-no-zero-integers.md)
- [1318. Minimum Flips to Make a OR b Equal to c](https://jaywin.gitbook.io/leetcode/solutions/1318-minimum-flips-to-make-a-or-b-equal-to-c.md)
- [1319. Number of Operations to Make Network Connected](https://jaywin.gitbook.io/leetcode/solutions/1319-number-of-operations-to-make-network-connected.md)
- [1320. Minimum Distance to Type a Word Using Two Fingers](https://jaywin.gitbook.io/leetcode/solutions/1320-minimum-distance-to-type-a-word-using-two-fingers.md)
- [1321. Restaurant Growth](https://jaywin.gitbook.io/leetcode/solutions/1321-restaurant-growth.md)
- [1322. Ads Performance](https://jaywin.gitbook.io/leetcode/solutions/1322-ads-performance.md)
- [1323. Maximum 69 Number](https://jaywin.gitbook.io/leetcode/solutions/1323-maximum-69-number.md)
- [1324. Print Words Vertically](https://jaywin.gitbook.io/leetcode/solutions/1324-print-words-vertically.md)
- [1325. Delete Leaves With a Given Value](https://jaywin.gitbook.io/leetcode/solutions/1325-delete-leaves-with-a-given-value.md)
- [1326. Minimum Number of Taps to Open to Water a Garden](https://jaywin.gitbook.io/leetcode/solutions/1326-minimum-number-of-taps-to-open-to-water-a-garden.md)
- [1327. List the Products Ordered in a Period](https://jaywin.gitbook.io/leetcode/solutions/1327-list-the-products-ordered-in-a-period.md)
- [1328. Break a Palindrome](https://jaywin.gitbook.io/leetcode/solutions/1328-break-a-palindrome.md)
- [1329. Sort the Matrix Diagonally](https://jaywin.gitbook.io/leetcode/solutions/1329-sort-the-matrix-diagonally.md)
- [1330. Reverse Subarray To Maximize Array Value](https://jaywin.gitbook.io/leetcode/solutions/1330-reverse-subarray-to-maximize-array-value.md)
- [1331. Rank Transform of an Array](https://jaywin.gitbook.io/leetcode/solutions/1331-rank-transform-of-an-array.md)
- [1332. Remove Palindromic Subsequences](https://jaywin.gitbook.io/leetcode/solutions/1332-remove-palindromic-subsequences.md)
- [1333. Filter Restaurants by Vegan-Friendly, Price and Distance](https://jaywin.gitbook.io/leetcode/solutions/1333-filter-restaurants-by-vegan-friendly-price-and-distance.md)
- [1334. Find the City With the Smallest Number of Neighbors at a Threshold Distance](https://jaywin.gitbook.io/leetcode/solutions/1334-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance.md)
- [1335. Minimum Difficulty of a Job Schedule](https://jaywin.gitbook.io/leetcode/solutions/1335-minimum-difficulty-of-a-job-schedule.md)
- [1336. Number of Transactions per Visit](https://jaywin.gitbook.io/leetcode/solutions/1336-number-of-transactions-per-visit.md)
- [1337. The K Weakest Rows in a Matrix](https://jaywin.gitbook.io/leetcode/solutions/1337-the-k-weakest-rows-in-a-matrix.md)
- [1338. Reduce Array Size to The Half](https://jaywin.gitbook.io/leetcode/solutions/1338-reduce-array-size-to-the-half.md)
- [1339. Maximum Product of Splitted Binary Tree](https://jaywin.gitbook.io/leetcode/solutions/1339-maximum-product-of-splitted-binary-tree.md)
- [1340. Jump Game V](https://jaywin.gitbook.io/leetcode/solutions/1340-jump-game-v.md)
- [1341. Movie Rating](https://jaywin.gitbook.io/leetcode/solutions/1341-movie-rating.md)
- [1342. Number of Steps to Reduce a Number to Zero](https://jaywin.gitbook.io/leetcode/solutions/1342-number-of-steps-to-reduce-a-number-to-zero.md)
- [1343. Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold](https://jaywin.gitbook.io/leetcode/solutions/1343-number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold.md)
- [1344. Angle Between Hands of a Clock](https://jaywin.gitbook.io/leetcode/solutions/1344-angle-between-hands-of-a-clock.md)
- [1345. Jump Game IV](https://jaywin.gitbook.io/leetcode/solutions/1345-jump-game-iv.md)
- [1346. Check If N and Its Double Exist](https://jaywin.gitbook.io/leetcode/solutions/1346-check-if-n-and-its-double-exist.md)
- [1347. Minimum Number of Steps to Make Two Strings Anagram](https://jaywin.gitbook.io/leetcode/solutions/1347-minimum-number-of-steps-to-make-two-strings-anagram.md)
- [1348. Tweet Counts Per Frequency](https://jaywin.gitbook.io/leetcode/solutions/1348-tweet-counts-per-frequency.md)
- [1349. Maximum Students Taking Exam](https://jaywin.gitbook.io/leetcode/solutions/1349-maximum-students-taking-exam.md)
- [1350. Students With Invalid Departments](https://jaywin.gitbook.io/leetcode/solutions/1350-students-with-invalid-departments.md)
- [1351. Count Negative Numbers in a Sorted Matrix](https://jaywin.gitbook.io/leetcode/solutions/1351-count-negative-numbers-in-a-sorted-matrix.md)
- [1352. Product of the Last K Numbers](https://jaywin.gitbook.io/leetcode/solutions/1352-product-of-the-last-k-numbers.md)
- [1353. Maximum Number of Events That Can Be Attended](https://jaywin.gitbook.io/leetcode/solutions/1353-maximum-number-of-events-that-can-be-attended.md)
- [1354. Construct Target Array With Multiple Sums](https://jaywin.gitbook.io/leetcode/solutions/1354-construct-target-array-with-multiple-sums.md)
- [1355. Activity Participants](https://jaywin.gitbook.io/leetcode/solutions/1355-activity-participants.md)
- [1356. Sort Integers by The Number of 1 Bits](https://jaywin.gitbook.io/leetcode/solutions/1356-sort-integers-by-the-number-of-1-bits.md)
- [1357. Apply Discount Every n Orders](https://jaywin.gitbook.io/leetcode/solutions/1357-apply-discount-every-n-orders.md)
- [1358. Number of Substrings Containing All Three Characters](https://jaywin.gitbook.io/leetcode/solutions/1358-number-of-substrings-containing-all-three-characters.md)
- [1359. Count All Valid Pickup and Delivery Options](https://jaywin.gitbook.io/leetcode/solutions/1359-count-all-valid-pickup-and-delivery-options.md)
- [1360. Number of Days Between Two Dates](https://jaywin.gitbook.io/leetcode/solutions/1360-number-of-days-between-two-dates.md)
- [1361. Validate Binary Tree Nodes](https://jaywin.gitbook.io/leetcode/solutions/1361-validate-binary-tree-nodes.md)
- [1362. Closest Divisors](https://jaywin.gitbook.io/leetcode/solutions/1362-closest-divisors.md)
- [1363. Largest Multiple of Three](https://jaywin.gitbook.io/leetcode/solutions/1363-largest-multiple-of-three.md)
- [1364. Number of Trusted Contacts of a Customer](https://jaywin.gitbook.io/leetcode/solutions/1364-number-of-trusted-contacts-of-a-customer.md)
- [1365. How Many Numbers Are Smaller Than the Current Number](https://jaywin.gitbook.io/leetcode/solutions/1365-how-many-numbers-are-smaller-than-the-current-number.md)
- [1366. Rank Teams by Votes](https://jaywin.gitbook.io/leetcode/solutions/1366-rank-teams-by-votes.md)
- [1367. Linked List in Binary Tree](https://jaywin.gitbook.io/leetcode/solutions/1367-linked-list-in-binary-tree.md)
- [1368. Minimum Cost to Make at Least One Valid Path in a Grid](https://jaywin.gitbook.io/leetcode/solutions/1368-minimum-cost-to-make-at-least-one-valid-path-in-a-grid.md)
- [1369. Get the Second Most Recent Activity](https://jaywin.gitbook.io/leetcode/solutions/1369-get-the-second-most-recent-activity.md)
- [1370. Increasing Decreasing String](https://jaywin.gitbook.io/leetcode/solutions/1370-increasing-decreasing-string.md)
- [1371. Find the Longest Substring Containing Vowels in Even Counts](https://jaywin.gitbook.io/leetcode/solutions/1371-find-the-longest-substring-containing-vowels-in-even-counts.md)
- [1372. Longest ZigZag Path in a Binary Tree](https://jaywin.gitbook.io/leetcode/solutions/1372-longest-zigzag-path-in-a-binary-tree.md)
- [1373. Maximum Sum BST in Binary Tree](https://jaywin.gitbook.io/leetcode/solutions/1373-maximum-sum-bst-in-binary-tree.md)
- [1374. Generate a String With Characters That Have Odd Counts](https://jaywin.gitbook.io/leetcode/solutions/1374-generate-a-string-with-characters-that-have-odd-counts.md)
- [1375. Bulb Switcher III](https://jaywin.gitbook.io/leetcode/solutions/1375-bulb-switcher-iii.md)
- [1376. Time Needed to Inform All Employees](https://jaywin.gitbook.io/leetcode/solutions/1376-time-needed-to-inform-all-employees.md)
- [1377. Frog Position After T Seconds](https://jaywin.gitbook.io/leetcode/solutions/1377-frog-position-after-t-seconds.md)
- [1378. Replace Employee ID With The Unique Identifier](https://jaywin.gitbook.io/leetcode/solutions/1378-replace-employee-id-with-the-unique-identifier.md)
- [1379. Find a Corresponding Node of a Binary Tree in a Clone of That Tree](https://jaywin.gitbook.io/leetcode/solutions/1379-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree.md)
- [1380. Lucky Numbers in a Matrix](https://jaywin.gitbook.io/leetcode/solutions/1380-lucky-numbers-in-a-matrix.md)
- [1381. Design a Stack With Increment Operation](https://jaywin.gitbook.io/leetcode/solutions/1381-design-a-stack-with-increment-operation.md)
- [1382. Balance a Binary Search Tree](https://jaywin.gitbook.io/leetcode/solutions/1382-balance-a-binary-search-tree.md)
- [1383. Maximum Performance of a Team](https://jaywin.gitbook.io/leetcode/solutions/1383-maximum-performance-of-a-team.md)
- [1384. Total Sales Amount by Year](https://jaywin.gitbook.io/leetcode/solutions/1384-total-sales-amount-by-year.md)
- [1385. Find the Distance Value Between Two Arrays](https://jaywin.gitbook.io/leetcode/solutions/1385-find-the-distance-value-between-two-arrays.md)
- [1386. Cinema Seat Allocation](https://jaywin.gitbook.io/leetcode/solutions/1386-cinema-seat-allocation.md)
- [1387. Sort Integers by The Power Value](https://jaywin.gitbook.io/leetcode/solutions/1387-sort-integers-by-the-power-value.md)
- [1388. Pizza With 3n Slices](https://jaywin.gitbook.io/leetcode/solutions/1388-pizza-with-3n-slices.md)
- [1389. Create Target Array in the Given Order](https://jaywin.gitbook.io/leetcode/solutions/1389-create-target-array-in-the-given-order.md)
- [1390. Four Divisors](https://jaywin.gitbook.io/leetcode/solutions/1390-four-divisors.md)
- [1391. Check if There is a Valid Path in a Grid](https://jaywin.gitbook.io/leetcode/solutions/1391-check-if-there-is-a-valid-path-in-a-grid.md)
- [1392. Longest Happy Prefix](https://jaywin.gitbook.io/leetcode/solutions/1392-longest-happy-prefix.md)
- [1393. Capital Gain/Loss](https://jaywin.gitbook.io/leetcode/solutions/1393-capital-gainloss.md)
- [1394. Find Lucky Integer in an Array](https://jaywin.gitbook.io/leetcode/solutions/1394-find-lucky-integer-in-an-array.md)
- [1395. Count Number of Teams](https://jaywin.gitbook.io/leetcode/solutions/1395-count-number-of-teams.md)
- [1396. Design Underground System](https://jaywin.gitbook.io/leetcode/solutions/1396-design-underground-system.md)
- [1397. Find All Good Strings](https://jaywin.gitbook.io/leetcode/solutions/1397-find-all-good-strings.md)
- [1398. Customers Who Bought Products A and B but Not C](https://jaywin.gitbook.io/leetcode/solutions/1398-customers-who-bought-products-a-and-b-but-not-c.md)
- [1399. Count Largest Group](https://jaywin.gitbook.io/leetcode/solutions/1399-count-largest-group.md)
- [1400. Construct K Palindrome Strings](https://jaywin.gitbook.io/leetcode/solutions/1400-construct-k-palindrome-strings.md)
- [1401. Circle and Rectangle Overlapping](https://jaywin.gitbook.io/leetcode/solutions/1401-circle-and-rectangle-overlapping.md)
- [1402. Reducing Dishes](https://jaywin.gitbook.io/leetcode/solutions/1402-reducing-dishes.md)
- [1403. Minimum Subsequence in Non-Increasing Order](https://jaywin.gitbook.io/leetcode/solutions/1403-minimum-subsequence-in-non-increasing-order.md)
- [1404. Number of Steps to Reduce a Number in Binary Representation to One](https://jaywin.gitbook.io/leetcode/solutions/1404-number-of-steps-to-reduce-a-number-in-binary-representation-to-one.md)
- [1405. Longest Happy String](https://jaywin.gitbook.io/leetcode/solutions/1405-longest-happy-string.md)
- [1406. Stone Game III](https://jaywin.gitbook.io/leetcode/solutions/1406-stone-game-iii.md)
- [1407. Top Travellers](https://jaywin.gitbook.io/leetcode/solutions/1407-top-travellers.md)
- [1408. String Matching in an Array](https://jaywin.gitbook.io/leetcode/solutions/1408-string-matching-in-an-array.md)
- [1409. Queries on a Permutation With Key](https://jaywin.gitbook.io/leetcode/solutions/1409-queries-on-a-permutation-with-key.md)
- [1410. HTML Entity Parser](https://jaywin.gitbook.io/leetcode/solutions/1410-html-entity-parser.md)
- [1411. Number of Ways to Paint N × 3 Grid](https://jaywin.gitbook.io/leetcode/solutions/1411-number-of-ways-to-paint-n-3-grid.md)
- [1412. Find the Quiet Students in All Exams](https://jaywin.gitbook.io/leetcode/solutions/1412-find-the-quiet-students-in-all-exams.md)
- [1413. Minimum Value to Get Positive Step by Step Sum](https://jaywin.gitbook.io/leetcode/solutions/1413-minimum-value-to-get-positive-step-by-step-sum.md)
- [1414. Find the Minimum Number of Fibonacci Numbers Whose Sum Is K](https://jaywin.gitbook.io/leetcode/solutions/1414-find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k.md)
- [1415. The k-th Lexicographical String of All Happy Strings of Length n](https://jaywin.gitbook.io/leetcode/solutions/1415-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n.md)
- [1416. Restore The Array](https://jaywin.gitbook.io/leetcode/solutions/1416-restore-the-array.md)
- [1417. Reformat The String](https://jaywin.gitbook.io/leetcode/solutions/1417-reformat-the-string.md)
- [1418. Display Table of Food Orders in a Restaurant](https://jaywin.gitbook.io/leetcode/solutions/1418-display-table-of-food-orders-in-a-restaurant.md)
- [1419. Minimum Number of Frogs Croaking](https://jaywin.gitbook.io/leetcode/solutions/1419-minimum-number-of-frogs-croaking.md)
- [1420. Build Array Where You Can Find The Maximum Exactly K Comparisons](https://jaywin.gitbook.io/leetcode/solutions/1420-build-array-where-you-can-find-the-maximum-exactly-k-comparisons.md)
- [1421. NPV Queries](https://jaywin.gitbook.io/leetcode/solutions/1421-npv-queries.md)
- [1422. Maximum Score After Splitting a String](https://jaywin.gitbook.io/leetcode/solutions/1422-maximum-score-after-splitting-a-string.md)
- [1423. Maximum Points You Can Obtain from Cards](https://jaywin.gitbook.io/leetcode/solutions/1423-maximum-points-you-can-obtain-from-cards.md)
- [1424. Diagonal Traverse II](https://jaywin.gitbook.io/leetcode/solutions/1424-diagonal-traverse-ii.md)
- [1425. Constrained Subsequence Sum](https://jaywin.gitbook.io/leetcode/solutions/1425-constrained-subsequence-sum.md)
- [1426. Counting Elements](https://jaywin.gitbook.io/leetcode/solutions/1426-counting-elements.md)
- [1427. Perform String Shifts](https://jaywin.gitbook.io/leetcode/solutions/1427-perform-string-shifts.md)
- [1428. Leftmost Column with at Least a One](https://jaywin.gitbook.io/leetcode/solutions/1428-leftmost-column-with-at-least-a-one.md)
- [1429. First Unique Number](https://jaywin.gitbook.io/leetcode/solutions/1429-first-unique-number.md)
- [1430. Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree](https://jaywin.gitbook.io/leetcode/solutions/1430-check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree.md)
- [1431. Kids With the Greatest Number of Candies](https://jaywin.gitbook.io/leetcode/solutions/1431-kids-with-the-greatest-number-of-candies.md)
- [1432. Max Difference You Can Get From Changing an Integer](https://jaywin.gitbook.io/leetcode/solutions/1432-max-difference-you-can-get-from-changing-an-integer.md)
- [1433. Check If a String Can Break Another String](https://jaywin.gitbook.io/leetcode/solutions/1433-check-if-a-string-can-break-another-string.md)
- [1434. Number of Ways to Wear Different Hats to Each Other](https://jaywin.gitbook.io/leetcode/solutions/1434-number-of-ways-to-wear-different-hats-to-each-other.md)
- [1435. Create a Session Bar Chart](https://jaywin.gitbook.io/leetcode/solutions/1435-create-a-session-bar-chart.md)
- [1436. Destination City](https://jaywin.gitbook.io/leetcode/solutions/1436-destination-city.md)
- [1437. Check If All 1's Are at Least Length K Places Away](https://jaywin.gitbook.io/leetcode/solutions/1437-check-if-all-1s-are-at-least-length-k-places-away.md)
- [1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit](https://jaywin.gitbook.io/leetcode/solutions/1438-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit.md)
- [1439. Find the Kth Smallest Sum of a Matrix With Sorted Rows](https://jaywin.gitbook.io/leetcode/solutions/1439-find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows.md)
- [1440. Evaluate Boolean Expression](https://jaywin.gitbook.io/leetcode/solutions/1440-evaluate-boolean-expression.md)
- [1441. Build an Array With Stack Operations](https://jaywin.gitbook.io/leetcode/solutions/1441-build-an-array-with-stack-operations.md)
- [1442. Count Triplets That Can Form Two Arrays of Equal XOR](https://jaywin.gitbook.io/leetcode/solutions/1442-count-triplets-that-can-form-two-arrays-of-equal-xor.md)
- [1443. Minimum Time to Collect All Apples in a Tree](https://jaywin.gitbook.io/leetcode/solutions/1443-minimum-time-to-collect-all-apples-in-a-tree.md)
- [1444. Number of Ways of Cutting a Pizza](https://jaywin.gitbook.io/leetcode/solutions/1444-number-of-ways-of-cutting-a-pizza.md)
- [1445. Apples & Oranges](https://jaywin.gitbook.io/leetcode/solutions/1445-apples-oranges.md)
- [1446. Consecutive Characters](https://jaywin.gitbook.io/leetcode/solutions/1446-consecutive-characters.md)
- [1447. Simplified Fractions](https://jaywin.gitbook.io/leetcode/solutions/1447-simplified-fractions.md)
- [1448. Count Good Nodes in Binary Tree](https://jaywin.gitbook.io/leetcode/solutions/1448-count-good-nodes-in-binary-tree.md)
- [1449. Form Largest Integer With Digits That Add up to Target](https://jaywin.gitbook.io/leetcode/solutions/1449-form-largest-integer-with-digits-that-add-up-to-target.md)
- [1450. Number of Students Doing Homework at a Given Time](https://jaywin.gitbook.io/leetcode/solutions/1450-number-of-students-doing-homework-at-a-given-time.md)
- [1451. Rearrange Words in a Sentence](https://jaywin.gitbook.io/leetcode/solutions/1451-rearrange-words-in-a-sentence.md)
- [1452. People Whose List of Favorite Companies Is Not a Subset of Another List](https://jaywin.gitbook.io/leetcode/solutions/1452-people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list.md)
- [1453. Maximum Number of Darts Inside of a Circular Dartboard](https://jaywin.gitbook.io/leetcode/solutions/1453-maximum-number-of-darts-inside-of-a-circular-dartboard.md)
- [1454. Active Users](https://jaywin.gitbook.io/leetcode/solutions/1454-active-users.md)
- [1455. Check If a Word Occurs As a Prefix of Any Word in a Sentence](https://jaywin.gitbook.io/leetcode/solutions/1455-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence.md)
- [1456. Maximum Number of Vowels in a Substring of Given Length](https://jaywin.gitbook.io/leetcode/solutions/1456-maximum-number-of-vowels-in-a-substring-of-given-length.md)
- [1457. Pseudo-Palindromic Paths in a Binary Tree](https://jaywin.gitbook.io/leetcode/solutions/1457-pseudo-palindromic-paths-in-a-binary-tree.md)
- [1458. Max Dot Product of Two Subsequences](https://jaywin.gitbook.io/leetcode/solutions/1458-max-dot-product-of-two-subsequences.md)
- [1459. Rectangles Area](https://jaywin.gitbook.io/leetcode/solutions/1459-rectangles-area.md)
- [1460. Make Two Arrays Equal by Reversing Sub-arrays](https://jaywin.gitbook.io/leetcode/solutions/1460-make-two-arrays-equal-by-reversing-sub-arrays.md)
- [1461. Check If a String Contains All Binary Codes of Size K](https://jaywin.gitbook.io/leetcode/solutions/1461-check-if-a-string-contains-all-binary-codes-of-size-k.md)
- [1462. Course Schedule IV](https://jaywin.gitbook.io/leetcode/solutions/1462-course-schedule-iv.md)
- [1463. Cherry Pickup II](https://jaywin.gitbook.io/leetcode/solutions/1463-cherry-pickup-ii.md)
- [1464. Maximum Product of Two Elements in an Array](https://jaywin.gitbook.io/leetcode/solutions/1464-maximum-product-of-two-elements-in-an-array.md)
- [1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts](https://jaywin.gitbook.io/leetcode/solutions/1465-maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts.md)
- [1466. Reorder Routes to Make All Paths Lead to the City Zero](https://jaywin.gitbook.io/leetcode/solutions/1466-reorder-routes-to-make-all-paths-lead-to-the-city-zero.md)
- [1467. Probability of a Two Boxes Having The Same Number of Distinct Balls](https://jaywin.gitbook.io/leetcode/solutions/1467-probability-of-a-two-boxes-having-the-same-number-of-distinct-balls.md)
- [1468. Calculate Salaries](https://jaywin.gitbook.io/leetcode/solutions/1468-calculate-salaries.md)
- [1469. Find All The Lonely Nodes](https://jaywin.gitbook.io/leetcode/solutions/1469-find-all-the-lonely-nodes.md)
- [1470. Shuffle the Array](https://jaywin.gitbook.io/leetcode/solutions/1470-shuffle-the-array.md)
- [1471. The k Strongest Values in an Array](https://jaywin.gitbook.io/leetcode/solutions/1471-the-k-strongest-values-in-an-array.md)
- [1472. Design Browser History](https://jaywin.gitbook.io/leetcode/solutions/1472-design-browser-history.md)
- [1473. Paint House III](https://jaywin.gitbook.io/leetcode/solutions/1473-paint-house-iii.md)
- [1474. Delete N Nodes After M Nodes of a Linked List](https://jaywin.gitbook.io/leetcode/solutions/1474-delete-n-nodes-after-m-nodes-of-a-linked-list.md)
- [1475. Final Prices With a Special Discount in a Shop](https://jaywin.gitbook.io/leetcode/solutions/1475-final-prices-with-a-special-discount-in-a-shop.md)
- [1476. Subrectangle Queries](https://jaywin.gitbook.io/leetcode/solutions/1476-subrectangle-queries.md)
- [1477. Find Two Non-overlapping Sub-arrays Each With Target Sum](https://jaywin.gitbook.io/leetcode/solutions/1477-find-two-non-overlapping-sub-arrays-each-with-target-sum.md)
- [1478. Allocate Mailboxes](https://jaywin.gitbook.io/leetcode/solutions/1478-allocate-mailboxes.md)
- [1479. Sales by Day of the Week](https://jaywin.gitbook.io/leetcode/solutions/1479-sales-by-day-of-the-week.md)
- [1480. Running Sum of 1d Array](https://jaywin.gitbook.io/leetcode/solutions/1480-running-sum-of-1d-array.md)
- [1481. Least Number of Unique Integers after K Removals](https://jaywin.gitbook.io/leetcode/solutions/1481-least-number-of-unique-integers-after-k-removals.md)
- [1482. Minimum Number of Days to Make m Bouquets](https://jaywin.gitbook.io/leetcode/solutions/1482-minimum-number-of-days-to-make-m-bouquets.md)
- [1483. Kth Ancestor of a Tree Node](https://jaywin.gitbook.io/leetcode/solutions/1483-kth-ancestor-of-a-tree-node.md)
- [1484. Group Sold Products By The Date](https://jaywin.gitbook.io/leetcode/solutions/1484-group-sold-products-by-the-date.md)
- [1485. Clone Binary Tree With Random Pointer](https://jaywin.gitbook.io/leetcode/solutions/1485-clone-binary-tree-with-random-pointer.md)
- [1486. XOR Operation in an Array](https://jaywin.gitbook.io/leetcode/solutions/1486-xor-operation-in-an-array.md)
- [1487. Making File Names Unique](https://jaywin.gitbook.io/leetcode/solutions/1487-making-file-names-unique.md)
- [1488. Avoid Flood in The City](https://jaywin.gitbook.io/leetcode/solutions/1488-avoid-flood-in-the-city.md)
- [1489. Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree](https://jaywin.gitbook.io/leetcode/solutions/1489-find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree.md)
- [1490. Clone N-ary Tree](https://jaywin.gitbook.io/leetcode/solutions/1490-clone-n-ary-tree.md)
- [1491. Average Salary Excluding the Minimum and Maximum Salary](https://jaywin.gitbook.io/leetcode/solutions/1491-average-salary-excluding-the-minimum-and-maximum-salary.md)
- [1492. The kth Factor of n](https://jaywin.gitbook.io/leetcode/solutions/1492-the-kth-factor-of-n.md)
- [1493. Longest Subarray of 1's After Deleting One Element](https://jaywin.gitbook.io/leetcode/solutions/1493-longest-subarray-of-1s-after-deleting-one-element.md)
- [1494. Parallel Courses II](https://jaywin.gitbook.io/leetcode/solutions/1494-parallel-courses-ii.md)
- [1495. Friendly Movies Streamed Last Month](https://jaywin.gitbook.io/leetcode/solutions/1495-friendly-movies-streamed-last-month.md)
- [1496. Path Crossing](https://jaywin.gitbook.io/leetcode/solutions/1496-path-crossing.md)
- [1497. Check If Array Pairs Are Divisible by k](https://jaywin.gitbook.io/leetcode/solutions/1497-check-if-array-pairs-are-divisible-by-k.md)
- [1498. Number of Subsequences That Satisfy the Given Sum Condition](https://jaywin.gitbook.io/leetcode/solutions/1498-number-of-subsequences-that-satisfy-the-given-sum-condition.md)
- [1499. Max Value of Equation](https://jaywin.gitbook.io/leetcode/solutions/1499-max-value-of-equation.md)
- [1500. Design a File Sharing System](https://jaywin.gitbook.io/leetcode/solutions/1500-design-a-file-sharing-system.md)
- [1501. Countries You Can Safely Invest In](https://jaywin.gitbook.io/leetcode/solutions/1501-countries-you-can-safely-invest-in.md)
- [1502. Can Make Arithmetic Progression From Sequence](https://jaywin.gitbook.io/leetcode/solutions/1502-can-make-arithmetic-progression-from-sequence.md)
- [1503. Last Moment Before All Ants Fall Out of a Plank](https://jaywin.gitbook.io/leetcode/solutions/1503-last-moment-before-all-ants-fall-out-of-a-plank.md)
- [1504. Count Submatrices With All Ones](https://jaywin.gitbook.io/leetcode/solutions/1504-count-submatrices-with-all-ones.md)
- [1505. Minimum Possible Integer After at Most K Adjacent Swaps On Digits](https://jaywin.gitbook.io/leetcode/solutions/1505-minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits.md)
- [1506. Find Root of N-Ary Tree](https://jaywin.gitbook.io/leetcode/solutions/1506-find-root-of-n-ary-tree.md)
- [1507. Reformat Date](https://jaywin.gitbook.io/leetcode/solutions/1507-reformat-date.md)
- [1508. Range Sum of Sorted Subarray Sums](https://jaywin.gitbook.io/leetcode/solutions/1508-range-sum-of-sorted-subarray-sums.md)
- [1509. Minimum Difference Between Largest and Smallest Value in Three Moves](https://jaywin.gitbook.io/leetcode/solutions/1509-minimum-difference-between-largest-and-smallest-value-in-three-moves.md)
- [1510. Stone Game IV](https://jaywin.gitbook.io/leetcode/solutions/1510-stone-game-iv.md)
- [1511. Customer Order Frequency](https://jaywin.gitbook.io/leetcode/solutions/1511-customer-order-frequency.md)
- [1512. Number of Good Pairs](https://jaywin.gitbook.io/leetcode/solutions/1512-number-of-good-pairs.md)
- [1513. Number of Substrings With Only 1s](https://jaywin.gitbook.io/leetcode/solutions/1513-number-of-substrings-with-only-1s.md)
- [1514. Path with Maximum Probability](https://jaywin.gitbook.io/leetcode/solutions/1514-path-with-maximum-probability.md)
- [1515. Best Position for a Service Centre](https://jaywin.gitbook.io/leetcode/solutions/1515-best-position-for-a-service-centre.md)
- [1516. Move Sub-Tree of N-Ary Tree](https://jaywin.gitbook.io/leetcode/solutions/1516-move-sub-tree-of-n-ary-tree.md)
- [1517. Find Users With Valid E-Mails](https://jaywin.gitbook.io/leetcode/solutions/1517-find-users-with-valid-e-mails.md)
- [1518. Water Bottles](https://jaywin.gitbook.io/leetcode/solutions/1518-water-bottles.md)
- [1519. Number of Nodes in the Sub-Tree With the Same Label](https://jaywin.gitbook.io/leetcode/solutions/1519-number-of-nodes-in-the-sub-tree-with-the-same-label.md)
- [1520. Maximum Number of Non-Overlapping Substrings](https://jaywin.gitbook.io/leetcode/solutions/1520-maximum-number-of-non-overlapping-substrings.md)
- [1521. Find a Value of a Mysterious Function Closest to Target](https://jaywin.gitbook.io/leetcode/solutions/1521-find-a-value-of-a-mysterious-function-closest-to-target.md)
- [1522. Diameter of N-Ary Tree](https://jaywin.gitbook.io/leetcode/solutions/1522-diameter-of-n-ary-tree.md)
- [1523. Count Odd Numbers in an Interval Range](https://jaywin.gitbook.io/leetcode/solutions/1523-count-odd-numbers-in-an-interval-range.md)
- [1524. Number of Sub-arrays With Odd Sum](https://jaywin.gitbook.io/leetcode/solutions/1524-number-of-sub-arrays-with-odd-sum.md)
- [1525. Number of Good Ways to Split a String](https://jaywin.gitbook.io/leetcode/solutions/1525-number-of-good-ways-to-split-a-string.md)
- [1526. Minimum Number of Increments on Subarrays to Form a Target Array](https://jaywin.gitbook.io/leetcode/solutions/1526-minimum-number-of-increments-on-subarrays-to-form-a-target-array.md)
- [1527. Patients With a Condition](https://jaywin.gitbook.io/leetcode/solutions/1527-patients-with-a-condition.md)
- [1528. Shuffle String](https://jaywin.gitbook.io/leetcode/solutions/1528-shuffle-string.md)
- [1529. Bulb Switcher IV](https://jaywin.gitbook.io/leetcode/solutions/1529-bulb-switcher-iv.md)
- [1530. Number of Good Leaf Nodes Pairs](https://jaywin.gitbook.io/leetcode/solutions/1530-number-of-good-leaf-nodes-pairs.md)
- [1531. String Compression II](https://jaywin.gitbook.io/leetcode/solutions/1531-string-compression-ii.md)
- [1532. The Most Recent Three Orders](https://jaywin.gitbook.io/leetcode/solutions/1532-the-most-recent-three-orders.md)
- [1533. Find the Index of the Large Integer](https://jaywin.gitbook.io/leetcode/solutions/1533-find-the-index-of-the-large-integer.md)
- [1534. Count Good Triplets](https://jaywin.gitbook.io/leetcode/solutions/1534-count-good-triplets.md)
- [1535. Find the Winner of an Array Game](https://jaywin.gitbook.io/leetcode/solutions/1535-find-the-winner-of-an-array-game.md)
- [1536. Minimum Swaps to Arrange a Binary Grid](https://jaywin.gitbook.io/leetcode/solutions/1536-minimum-swaps-to-arrange-a-binary-grid.md)
- [1537. Get the Maximum Score](https://jaywin.gitbook.io/leetcode/solutions/1537-get-the-maximum-score.md)
- [1538. Guess the Majority in a Hidden Array](https://jaywin.gitbook.io/leetcode/solutions/1538-guess-the-majority-in-a-hidden-array.md)
- [1539. Kth Missing Positive Number](https://jaywin.gitbook.io/leetcode/solutions/1539-kth-missing-positive-number.md)
- [1540. Can Convert String in K Moves](https://jaywin.gitbook.io/leetcode/solutions/1540-can-convert-string-in-k-moves.md)
- [1541. Minimum Insertions to Balance a Parentheses String](https://jaywin.gitbook.io/leetcode/solutions/1541-minimum-insertions-to-balance-a-parentheses-string.md)
- [1542. Find Longest Awesome Substring](https://jaywin.gitbook.io/leetcode/solutions/1542-find-longest-awesome-substring.md)
- [1543. Fix Product Name Format](https://jaywin.gitbook.io/leetcode/solutions/1543-fix-product-name-format.md)
- [1544. Make The String Great](https://jaywin.gitbook.io/leetcode/solutions/1544-make-the-string-great.md)
- [1545. Find Kth Bit in Nth Binary String](https://jaywin.gitbook.io/leetcode/solutions/1545-find-kth-bit-in-nth-binary-string.md)
- [1546. Maximum Number of Non-Overlapping Subarrays With Sum Equals Target](https://jaywin.gitbook.io/leetcode/solutions/1546-maximum-number-of-non-overlapping-subarrays-with-sum-equals-target.md)
- [1547. Minimum Cost to Cut a Stick](https://jaywin.gitbook.io/leetcode/solutions/1547-minimum-cost-to-cut-a-stick.md)
- [1548. The Most Similar Path in a Graph](https://jaywin.gitbook.io/leetcode/solutions/1548-the-most-similar-path-in-a-graph.md)
- [1549. The Most Recent Orders for Each Product](https://jaywin.gitbook.io/leetcode/solutions/1549-the-most-recent-orders-for-each-product.md)
- [1550. Three Consecutive Odds](https://jaywin.gitbook.io/leetcode/solutions/1550-three-consecutive-odds.md)
- [1551. Minimum Operations to Make Array Equal](https://jaywin.gitbook.io/leetcode/solutions/1551-minimum-operations-to-make-array-equal.md)
- [1552. Magnetic Force Between Two Balls](https://jaywin.gitbook.io/leetcode/solutions/1552-magnetic-force-between-two-balls.md)
- [1553. Minimum Number of Days to Eat N Oranges](https://jaywin.gitbook.io/leetcode/solutions/1553-minimum-number-of-days-to-eat-n-oranges.md)
- [1554. Strings Differ by One Character](https://jaywin.gitbook.io/leetcode/solutions/1554-strings-differ-by-one-character.md)
- [1555. Bank Account Summary](https://jaywin.gitbook.io/leetcode/solutions/1555-bank-account-summary.md)
- [1556. Thousand Separator](https://jaywin.gitbook.io/leetcode/solutions/1556-thousand-separator.md)
- [1557. Minimum Number of Vertices to Reach All Nodes](https://jaywin.gitbook.io/leetcode/solutions/1557-minimum-number-of-vertices-to-reach-all-nodes.md)
- [1558. Minimum Numbers of Function Calls to Make Target Array](https://jaywin.gitbook.io/leetcode/solutions/1558-minimum-numbers-of-function-calls-to-make-target-array.md)
- [1559. Detect Cycles in 2D Grid](https://jaywin.gitbook.io/leetcode/solutions/1559-detect-cycles-in-2d-grid.md)
- [1560. Most Visited Sector in a Circular Track](https://jaywin.gitbook.io/leetcode/solutions/1560-most-visited-sector-in-a-circular-track.md)
- [1561. Maximum Number of Coins You Can Get](https://jaywin.gitbook.io/leetcode/solutions/1561-maximum-number-of-coins-you-can-get.md)
- [1562. Find Latest Group of Size M](https://jaywin.gitbook.io/leetcode/solutions/1562-find-latest-group-of-size-m.md)
- [1563. Stone Game V](https://jaywin.gitbook.io/leetcode/solutions/1563-stone-game-v.md)
- [1564. Put Boxes Into the Warehouse I](https://jaywin.gitbook.io/leetcode/solutions/1564-put-boxes-into-the-warehouse-i.md)
- [1565. Unique Orders and Customers Per Month](https://jaywin.gitbook.io/leetcode/solutions/1565-unique-orders-and-customers-per-month.md)
- [1566. Detect Pattern of Length M Repeated K or More Times](https://jaywin.gitbook.io/leetcode/solutions/1566-detect-pattern-of-length-m-repeated-k-or-more-times.md)
- [1567. Maximum Length of Subarray With Positive Product](https://jaywin.gitbook.io/leetcode/solutions/1567-maximum-length-of-subarray-with-positive-product.md)
- [1568. Minimum Number of Days to Disconnect Island](https://jaywin.gitbook.io/leetcode/solutions/1568-minimum-number-of-days-to-disconnect-island.md)
- [1569. Number of Ways to Reorder Array to Get Same BST](https://jaywin.gitbook.io/leetcode/solutions/1569-number-of-ways-to-reorder-array-to-get-same-bst.md)
- [1570. Dot Product of Two Sparse Vectors](https://jaywin.gitbook.io/leetcode/solutions/1570-dot-product-of-two-sparse-vectors.md)
- [1571. Warehouse Manager](https://jaywin.gitbook.io/leetcode/solutions/1571-warehouse-manager.md)
- [1572. Matrix Diagonal Sum](https://jaywin.gitbook.io/leetcode/solutions/1572-matrix-diagonal-sum.md)
- [1573. Number of Ways to Split a String](https://jaywin.gitbook.io/leetcode/solutions/1573-number-of-ways-to-split-a-string.md)
- [1574. Shortest Subarray to be Removed to Make Array Sorted](https://jaywin.gitbook.io/leetcode/solutions/1574-shortest-subarray-to-be-removed-to-make-array-sorted.md)
- [1575. Count All Possible Routes](https://jaywin.gitbook.io/leetcode/solutions/1575-count-all-possible-routes.md)
- [1576. Replace All ?'s to Avoid Consecutive Repeating Characters](https://jaywin.gitbook.io/leetcode/solutions/1576-replace-all-s-to-avoid-consecutive-repeating-characters.md)
- [1577. Number of Ways Where Square of Number Is Equal to Product of Two Numbers](https://jaywin.gitbook.io/leetcode/solutions/1577-number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers.md)
- [1578. Minimum Deletion Cost to Avoid Repeating Letters](https://jaywin.gitbook.io/leetcode/solutions/1578-minimum-deletion-cost-to-avoid-repeating-letters.md)
- [1579. Remove Max Number of Edges to Keep Graph Fully Traversable](https://jaywin.gitbook.io/leetcode/solutions/1579-remove-max-number-of-edges-to-keep-graph-fully-traversable.md)
- [1580. Put Boxes Into the Warehouse II](https://jaywin.gitbook.io/leetcode/solutions/1580-put-boxes-into-the-warehouse-ii.md)
- [1581. Customer Who Visited but Did Not Make Any Transactions](https://jaywin.gitbook.io/leetcode/solutions/1581-customer-who-visited-but-did-not-make-any-transactions.md)
- [1582. Special Positions in a Binary Matrix](https://jaywin.gitbook.io/leetcode/solutions/1582-special-positions-in-a-binary-matrix.md)
- [1583. Count Unhappy Friends](https://jaywin.gitbook.io/leetcode/solutions/1583-count-unhappy-friends.md)
- [1584. Min Cost to Connect All Points](https://jaywin.gitbook.io/leetcode/solutions/1584-min-cost-to-connect-all-points.md)
- [1585. Check If String Is Transformable With Substring Sort Operations](https://jaywin.gitbook.io/leetcode/solutions/1585-check-if-string-is-transformable-with-substring-sort-operations.md)
- [1586. Binary Search Tree Iterator II](https://jaywin.gitbook.io/leetcode/solutions/1586-binary-search-tree-iterator-ii.md)
- [1587. Bank Account Summary II](https://jaywin.gitbook.io/leetcode/solutions/1587-bank-account-summary-ii.md)
- [1588. Sum of All Odd Length Subarrays](https://jaywin.gitbook.io/leetcode/solutions/1588-sum-of-all-odd-length-subarrays.md)
- [1589. Maximum Sum Obtained of Any Permutation](https://jaywin.gitbook.io/leetcode/solutions/1589-maximum-sum-obtained-of-any-permutation.md)
- [1590. Make Sum Divisible by P](https://jaywin.gitbook.io/leetcode/solutions/1590-make-sum-divisible-by-p.md)
- [1591. Strange Printer II](https://jaywin.gitbook.io/leetcode/solutions/1591-strange-printer-ii.md)
- [1592. Rearrange Spaces Between Words](https://jaywin.gitbook.io/leetcode/solutions/1592-rearrange-spaces-between-words.md)
- [1593. Split a String Into the Max Number of Unique Substrings](https://jaywin.gitbook.io/leetcode/solutions/1593-split-a-string-into-the-max-number-of-unique-substrings.md)
- [1594. Maximum Non Negative Product in a Matrix](https://jaywin.gitbook.io/leetcode/solutions/1594-maximum-non-negative-product-in-a-matrix.md)
- [1595. Minimum Cost to Connect Two Groups of Points](https://jaywin.gitbook.io/leetcode/solutions/1595-minimum-cost-to-connect-two-groups-of-points.md)
- [1596. The Most Frequently Ordered Products for Each Customer](https://jaywin.gitbook.io/leetcode/solutions/1596-the-most-frequently-ordered-products-for-each-customer.md)
- [1597. Build Binary Expression Tree From Infix Expression](https://jaywin.gitbook.io/leetcode/solutions/1597-build-binary-expression-tree-from-infix-expression.md)
- [1598. Crawler Log Folder](https://jaywin.gitbook.io/leetcode/solutions/1598-crawler-log-folder.md)
- [1599. Maximum Profit of Operating a Centennial Wheel](https://jaywin.gitbook.io/leetcode/solutions/1599-maximum-profit-of-operating-a-centennial-wheel.md)
- [1600. Throne Inheritance](https://jaywin.gitbook.io/leetcode/solutions/1600-throne-inheritance.md)
- [1601. Maximum Number of Achievable Transfer Requests](https://jaywin.gitbook.io/leetcode/solutions/1601-maximum-number-of-achievable-transfer-requests.md)
- [1602. Find Nearest Right Node in Binary Tree](https://jaywin.gitbook.io/leetcode/solutions/1602-find-nearest-right-node-in-binary-tree.md)
- [1603. Design Parking System](https://jaywin.gitbook.io/leetcode/solutions/1603-design-parking-system.md)
- [1604. Alert Using Same Key-Card Three or More Times in a One Hour Period](https://jaywin.gitbook.io/leetcode/solutions/1604-alert-using-same-key-card-three-or-more-times-in-a-one-hour-period.md)
- [1605. Find Valid Matrix Given Row and Column Sums](https://jaywin.gitbook.io/leetcode/solutions/1605-find-valid-matrix-given-row-and-column-sums.md)
- [1606. Find Servers That Handled Most Number of Requests](https://jaywin.gitbook.io/leetcode/solutions/1606-find-servers-that-handled-most-number-of-requests.md)
- [1607. Sellers With No Sales](https://jaywin.gitbook.io/leetcode/solutions/1607-sellers-with-no-sales.md)
- [1608. Special Array With X Elements Greater Than or Equal X](https://jaywin.gitbook.io/leetcode/solutions/1608-special-array-with-x-elements-greater-than-or-equal-x.md)
- [1609. Even Odd Tree](https://jaywin.gitbook.io/leetcode/solutions/1609-even-odd-tree.md)
- [1610. Maximum Number of Visible Points](https://jaywin.gitbook.io/leetcode/solutions/1610-maximum-number-of-visible-points.md)
- [1611. Minimum One Bit Operations to Make Integers Zero](https://jaywin.gitbook.io/leetcode/solutions/1611-minimum-one-bit-operations-to-make-integers-zero.md)
- [1612. Check If Two Expression Trees are Equivalent](https://jaywin.gitbook.io/leetcode/solutions/1612-check-if-two-expression-trees-are-equivalent.md)
- [1613. Find the Missing IDs](https://jaywin.gitbook.io/leetcode/solutions/1613-find-the-missing-ids.md)
- [1614. Maximum Nesting Depth of the Parentheses](https://jaywin.gitbook.io/leetcode/solutions/1614-maximum-nesting-depth-of-the-parentheses.md)
- [1615. Maximal Network Rank](https://jaywin.gitbook.io/leetcode/solutions/1615-maximal-network-rank.md)
- [1616. Split Two Strings to Make Palindrome](https://jaywin.gitbook.io/leetcode/solutions/1616-split-two-strings-to-make-palindrome.md)
- [1617. Count Subtrees With Max Distance Between Cities](https://jaywin.gitbook.io/leetcode/solutions/1617-count-subtrees-with-max-distance-between-cities.md)
- [1618. Maximum Font to Fit a Sentence in a Screen](https://jaywin.gitbook.io/leetcode/solutions/1618-maximum-font-to-fit-a-sentence-in-a-screen.md)
- [1619. Mean of Array After Removing Some Elements](https://jaywin.gitbook.io/leetcode/solutions/1619-mean-of-array-after-removing-some-elements.md)
- [1620. Coordinate With Maximum Network Quality](https://jaywin.gitbook.io/leetcode/solutions/1620-coordinate-with-maximum-network-quality.md)
- [1621. Number of Sets of K Non-Overlapping Line Segments](https://jaywin.gitbook.io/leetcode/solutions/1621-number-of-sets-of-k-non-overlapping-line-segments.md)
- [1622. Fancy Sequence](https://jaywin.gitbook.io/leetcode/solutions/1622-fancy-sequence.md)
- [1623. All Valid Triplets That Can Represent a Country](https://jaywin.gitbook.io/leetcode/solutions/1623-all-valid-triplets-that-can-represent-a-country.md)
- [1624. Largest Substring Between Two Equal Characters](https://jaywin.gitbook.io/leetcode/solutions/1624-largest-substring-between-two-equal-characters.md)
- [1625. Lexicographically Smallest String After Applying Operations](https://jaywin.gitbook.io/leetcode/solutions/1625-lexicographically-smallest-string-after-applying-operations.md)
- [1626. Best Team With No Conflicts](https://jaywin.gitbook.io/leetcode/solutions/1626-best-team-with-no-conflicts.md)
- [1627. Graph Connectivity With Threshold](https://jaywin.gitbook.io/leetcode/solutions/1627-graph-connectivity-with-threshold.md)
- [1628. Design an Expression Tree With Evaluate Function](https://jaywin.gitbook.io/leetcode/solutions/1628-design-an-expression-tree-with-evaluate-function.md)
- [1629. Slowest Key](https://jaywin.gitbook.io/leetcode/solutions/1629-slowest-key.md)
- [1630. Arithmetic Subarrays](https://jaywin.gitbook.io/leetcode/solutions/1630-arithmetic-subarrays.md)
- [1631. Path With Minimum Effort](https://jaywin.gitbook.io/leetcode/solutions/1631-path-with-minimum-effort.md)
- [1632. Rank Transform of a Matrix](https://jaywin.gitbook.io/leetcode/solutions/1632-rank-transform-of-a-matrix.md)
- [1633. Percentage of Users Attended a Contest](https://jaywin.gitbook.io/leetcode/solutions/1633-percentage-of-users-attended-a-contest.md)
- [1634. Add Two Polynomials Represented as Linked Lists](https://jaywin.gitbook.io/leetcode/solutions/1634-add-two-polynomials-represented-as-linked-lists.md)
- [1635. Hopper Company Queries I](https://jaywin.gitbook.io/leetcode/solutions/1635-hopper-company-queries-i.md)
- [1636. Sort Array by Increasing Frequency](https://jaywin.gitbook.io/leetcode/solutions/1636-sort-array-by-increasing-frequency.md)
- [1637. Widest Vertical Area Between Two Points Containing No Points](https://jaywin.gitbook.io/leetcode/solutions/1637-widest-vertical-area-between-two-points-containing-no-points.md)
- [1638. Count Substrings That Differ by One Character](https://jaywin.gitbook.io/leetcode/solutions/1638-count-substrings-that-differ-by-one-character.md)
- [1639. Number of Ways to Form a Target String Given a Dictionary](https://jaywin.gitbook.io/leetcode/solutions/1639-number-of-ways-to-form-a-target-string-given-a-dictionary.md)
- [1640. Check Array Formation Through Concatenation](https://jaywin.gitbook.io/leetcode/solutions/1640-check-array-formation-through-concatenation.md)
- [1641. Count Sorted Vowel Strings](https://jaywin.gitbook.io/leetcode/solutions/1641-count-sorted-vowel-strings.md)
- [1642. Furthest Building You Can Reach](https://jaywin.gitbook.io/leetcode/solutions/1642-furthest-building-you-can-reach.md)
- [1643. Kth Smallest Instructions](https://jaywin.gitbook.io/leetcode/solutions/1643-kth-smallest-instructions.md)
- [1644. Lowest Common Ancestor of a Binary Tree II](https://jaywin.gitbook.io/leetcode/solutions/1644-lowest-common-ancestor-of-a-binary-tree-ii.md)
- [1645. Hopper Company Queries II](https://jaywin.gitbook.io/leetcode/solutions/1645-hopper-company-queries-ii.md)
- [1646. Get Maximum in Generated Array](https://jaywin.gitbook.io/leetcode/solutions/1646-get-maximum-in-generated-array.md)
- [1647. Minimum Deletions to Make Character Frequencies Unique](https://jaywin.gitbook.io/leetcode/solutions/1647-minimum-deletions-to-make-character-frequencies-unique.md)
- [1648. Sell Diminishing-Valued Colored Balls](https://jaywin.gitbook.io/leetcode/solutions/1648-sell-diminishing-valued-colored-balls.md)
- [1649. Create Sorted Array through Instructions](https://jaywin.gitbook.io/leetcode/solutions/1649-create-sorted-array-through-instructions.md)
- [1650. Lowest Common Ancestor of a Binary Tree III](https://jaywin.gitbook.io/leetcode/solutions/1650-lowest-common-ancestor-of-a-binary-tree-iii.md)
- [1651. Hopper Company Queries III](https://jaywin.gitbook.io/leetcode/solutions/1651-hopper-company-queries-iii.md)
- [1652. Defuse the Bomb](https://jaywin.gitbook.io/leetcode/solutions/1652-defuse-the-bomb.md)
- [1653. Minimum Deletions to Make String Balanced](https://jaywin.gitbook.io/leetcode/solutions/1653-minimum-deletions-to-make-string-balanced.md)
- [1654. Minimum Jumps to Reach Home](https://jaywin.gitbook.io/leetcode/solutions/1654-minimum-jumps-to-reach-home.md)
- [1655. Distribute Repeating Integers](https://jaywin.gitbook.io/leetcode/solutions/1655-distribute-repeating-integers.md)
- [1656. Design an Ordered Stream](https://jaywin.gitbook.io/leetcode/solutions/1656-design-an-ordered-stream.md)
- [1657. Determine if Two Strings Are Close](https://jaywin.gitbook.io/leetcode/solutions/1657-determine-if-two-strings-are-close.md)
- [1658. Minimum Operations to Reduce X to Zero](https://jaywin.gitbook.io/leetcode/solutions/1658-minimum-operations-to-reduce-x-to-zero.md)
- [1659. Maximize Grid Happiness](https://jaywin.gitbook.io/leetcode/solutions/1659-maximize-grid-happiness.md)
- [1660. Correct a Binary Tree](https://jaywin.gitbook.io/leetcode/solutions/1660-correct-a-binary-tree.md)
- [1661. Average Time of Process per Machine](https://jaywin.gitbook.io/leetcode/solutions/1661-average-time-of-process-per-machine.md)
- [1662. Check If Two String Arrays are Equivalent](https://jaywin.gitbook.io/leetcode/solutions/1662-check-if-two-string-arrays-are-equivalent.md)
- [1663. Smallest String With A Given Numeric Value](https://jaywin.gitbook.io/leetcode/solutions/1663-smallest-string-with-a-given-numeric-value.md)
- [1664. Ways to Make a Fair Array](https://jaywin.gitbook.io/leetcode/solutions/1664-ways-to-make-a-fair-array.md)
- [1665. Minimum Initial Energy to Finish Tasks](https://jaywin.gitbook.io/leetcode/solutions/1665-minimum-initial-energy-to-finish-tasks.md)
- [1666. Change the Root of a Binary Tree](https://jaywin.gitbook.io/leetcode/solutions/1666-change-the-root-of-a-binary-tree.md)
- [1667. Fix Names in a Table](https://jaywin.gitbook.io/leetcode/solutions/1667-fix-names-in-a-table.md)
- [1668. Maximum Repeating Substring](https://jaywin.gitbook.io/leetcode/solutions/1668-maximum-repeating-substring.md)
- [1669. Merge In Between Linked Lists](https://jaywin.gitbook.io/leetcode/solutions/1669-merge-in-between-linked-lists.md)
- [1670. Design Front Middle Back Queue](https://jaywin.gitbook.io/leetcode/solutions/1670-design-front-middle-back-queue.md)
- [1671. Minimum Number of Removals to Make Mountain Array](https://jaywin.gitbook.io/leetcode/solutions/1671-minimum-number-of-removals-to-make-mountain-array.md)
- [1672. Richest Customer Wealth](https://jaywin.gitbook.io/leetcode/solutions/1672-richest-customer-wealth.md)
- [1673. Find the Most Competitive Subsequence](https://jaywin.gitbook.io/leetcode/solutions/1673-find-the-most-competitive-subsequence.md)
- [1674. Minimum Moves to Make Array Complementary](https://jaywin.gitbook.io/leetcode/solutions/1674-minimum-moves-to-make-array-complementary.md)
- [1675. Minimize Deviation in Array](https://jaywin.gitbook.io/leetcode/solutions/1675-minimize-deviation-in-array.md)
- [1676. Lowest Common Ancestor of a Binary Tree IV](https://jaywin.gitbook.io/leetcode/solutions/1676-lowest-common-ancestor-of-a-binary-tree-iv.md)
- [1677. Product's Worth Over Invoices](https://jaywin.gitbook.io/leetcode/solutions/1677-products-worth-over-invoices.md)
- [1678. Goal Parser Interpretation](https://jaywin.gitbook.io/leetcode/solutions/1678-goal-parser-interpretation.md)
- [1679. Max Number of K-Sum Pairs](https://jaywin.gitbook.io/leetcode/solutions/1679-max-number-of-k-sum-pairs.md)
- [1680. Concatenation of Consecutive Binary Numbers](https://jaywin.gitbook.io/leetcode/solutions/1680-concatenation-of-consecutive-binary-numbers.md)
- [1681. Minimum Incompatibility](https://jaywin.gitbook.io/leetcode/solutions/1681-minimum-incompatibility.md)
- [1682. Longest Palindromic Subsequence II](https://jaywin.gitbook.io/leetcode/solutions/1682-longest-palindromic-subsequence-ii.md)
- [1683. Invalid Tweets](https://jaywin.gitbook.io/leetcode/solutions/1683-invalid-tweets.md)
- [1684. Count the Number of Consistent Strings](https://jaywin.gitbook.io/leetcode/solutions/1684-count-the-number-of-consistent-strings.md)
- [1685. Sum of Absolute Differences in a Sorted Array](https://jaywin.gitbook.io/leetcode/solutions/1685-sum-of-absolute-differences-in-a-sorted-array.md)
- [1686. Stone Game VI](https://jaywin.gitbook.io/leetcode/solutions/1686-stone-game-vi.md)
- [1687. Delivering Boxes from Storage to Ports](https://jaywin.gitbook.io/leetcode/solutions/1687-delivering-boxes-from-storage-to-ports.md)
- [1688. Count of Matches in Tournament](https://jaywin.gitbook.io/leetcode/solutions/1688-count-of-matches-in-tournament.md)
- [1689. Partitioning Into Minimum Number Of Deci-Binary Numbers](https://jaywin.gitbook.io/leetcode/solutions/1689-partitioning-into-minimum-number-of-deci-binary-numbers.md)
- [1690. Stone Game VII](https://jaywin.gitbook.io/leetcode/solutions/1690-stone-game-vii.md)
- [1691. Maximum Height by Stacking Cuboids](https://jaywin.gitbook.io/leetcode/solutions/1691-maximum-height-by-stacking-cuboids.md)
- [1692. Count Ways to Distribute Candies](https://jaywin.gitbook.io/leetcode/solutions/1692-count-ways-to-distribute-candies.md)
- [1693. Daily Leads and Partners](https://jaywin.gitbook.io/leetcode/solutions/1693-daily-leads-and-partners.md)
- [1694. Reformat Phone Number](https://jaywin.gitbook.io/leetcode/solutions/1694-reformat-phone-number.md)
- [1695. Maximum Erasure Value](https://jaywin.gitbook.io/leetcode/solutions/1695-maximum-erasure-value.md)
- [1696. Jump Game VI](https://jaywin.gitbook.io/leetcode/solutions/1696-jump-game-vi.md)
- [1697. Checking Existence of Edge Length Limited Paths](https://jaywin.gitbook.io/leetcode/solutions/1697-checking-existence-of-edge-length-limited-paths.md)
- [1698. Number of Distinct Substrings in a String](https://jaywin.gitbook.io/leetcode/solutions/1698-number-of-distinct-substrings-in-a-string.md)
- [1699. Number of Calls Between Two Persons](https://jaywin.gitbook.io/leetcode/solutions/1699-number-of-calls-between-two-persons.md)
- [1700. Number of Students Unable to Eat Lunch](https://jaywin.gitbook.io/leetcode/solutions/1700-number-of-students-unable-to-eat-lunch.md)
- [1701. Average Waiting Time](https://jaywin.gitbook.io/leetcode/solutions/1701-average-waiting-time.md)
- [1702. Maximum Binary String After Change](https://jaywin.gitbook.io/leetcode/solutions/1702-maximum-binary-string-after-change.md)
- [1703. Minimum Adjacent Swaps for K Consecutive Ones](https://jaywin.gitbook.io/leetcode/solutions/1703-minimum-adjacent-swaps-for-k-consecutive-ones.md)
- [1704. Determine if String Halves Are Alike](https://jaywin.gitbook.io/leetcode/solutions/1704-determine-if-string-halves-are-alike.md)
- [1705. Maximum Number of Eaten Apples](https://jaywin.gitbook.io/leetcode/solutions/1705-maximum-number-of-eaten-apples.md)
- [1706. Where Will the Ball Fall](https://jaywin.gitbook.io/leetcode/solutions/1706-where-will-the-ball-fall.md)
- [1707. Maximum XOR With an Element From Array](https://jaywin.gitbook.io/leetcode/solutions/1707-maximum-xor-with-an-element-from-array.md)
- [1708. Largest Subarray Length K](https://jaywin.gitbook.io/leetcode/solutions/1708-largest-subarray-length-k.md)
- [1709. Biggest Window Between Visits](https://jaywin.gitbook.io/leetcode/solutions/1709-biggest-window-between-visits.md)
- [1710. Maximum Units on a Truck](https://jaywin.gitbook.io/leetcode/solutions/1710-maximum-units-on-a-truck.md)
- [1711. Count Good Meals](https://jaywin.gitbook.io/leetcode/solutions/1711-count-good-meals.md)
- [1712. Ways to Split Array Into Three Subarrays](https://jaywin.gitbook.io/leetcode/solutions/1712-ways-to-split-array-into-three-subarrays.md)
- [1713. Minimum Operations to Make a Subsequence](https://jaywin.gitbook.io/leetcode/solutions/1713-minimum-operations-to-make-a-subsequence.md)
- [1714. Sum Of Special Evenly-Spaced Elements In Array](https://jaywin.gitbook.io/leetcode/solutions/1714-sum-of-special-evenly-spaced-elements-in-array.md)
- [1715. Count Apples and Oranges](https://jaywin.gitbook.io/leetcode/solutions/1715-count-apples-and-oranges.md)
- [1716. Calculate Money in Leetcode Bank](https://jaywin.gitbook.io/leetcode/solutions/1716-calculate-money-in-leetcode-bank.md)
- [1717. Maximum Score From Removing Substrings](https://jaywin.gitbook.io/leetcode/solutions/1717-maximum-score-from-removing-substrings.md)
- [1718. Construct the Lexicographically Largest Valid Sequence](https://jaywin.gitbook.io/leetcode/solutions/1718-construct-the-lexicographically-largest-valid-sequence.md)
- [1719. Number Of Ways To Reconstruct A Tree](https://jaywin.gitbook.io/leetcode/solutions/1719-number-of-ways-to-reconstruct-a-tree.md)
- [1720. Decode XORed Array](https://jaywin.gitbook.io/leetcode/solutions/1720-decode-xored-array.md)
- [1721. Swapping Nodes in a Linked List](https://jaywin.gitbook.io/leetcode/solutions/1721-swapping-nodes-in-a-linked-list.md)
- [1722. Minimize Hamming Distance After Swap Operations](https://jaywin.gitbook.io/leetcode/solutions/1722-minimize-hamming-distance-after-swap-operations.md)
- [1723. Find Minimum Time to Finish All Jobs](https://jaywin.gitbook.io/leetcode/solutions/1723-find-minimum-time-to-finish-all-jobs.md)
- [1724. Checking Existence of Edge Length Limited Paths II](https://jaywin.gitbook.io/leetcode/solutions/1724-checking-existence-of-edge-length-limited-paths-ii.md)
- [1725. Number Of Rectangles That Can Form The Largest Square](https://jaywin.gitbook.io/leetcode/solutions/1725-number-of-rectangles-that-can-form-the-largest-square.md)
- [1726. Tuple with Same Product](https://jaywin.gitbook.io/leetcode/solutions/1726-tuple-with-same-product.md)
- [1727. Largest Submatrix With Rearrangements](https://jaywin.gitbook.io/leetcode/solutions/1727-largest-submatrix-with-rearrangements.md)
- [1728. Cat and Mouse II](https://jaywin.gitbook.io/leetcode/solutions/1728-cat-and-mouse-ii.md)
- [1729. Find Followers Count](https://jaywin.gitbook.io/leetcode/solutions/1729-find-followers-count.md)
- [1730. Shortest Path to Get Food](https://jaywin.gitbook.io/leetcode/solutions/1730-shortest-path-to-get-food.md)
- [1731. The Number of Employees Which Report to Each Employee](https://jaywin.gitbook.io/leetcode/solutions/1731-the-number-of-employees-which-report-to-each-employee.md)
- [1732. Find the Highest Altitude](https://jaywin.gitbook.io/leetcode/solutions/1732-find-the-highest-altitude.md)
- [1733. Minimum Number of People to Teach](https://jaywin.gitbook.io/leetcode/solutions/1733-minimum-number-of-people-to-teach.md)
- [1734. Decode XORed Permutation](https://jaywin.gitbook.io/leetcode/solutions/1734-decode-xored-permutation.md)
- [1735. Count Ways to Make Array With Product](https://jaywin.gitbook.io/leetcode/solutions/1735-count-ways-to-make-array-with-product.md)
- [1736. Latest Time by Replacing Hidden Digits](https://jaywin.gitbook.io/leetcode/solutions/1736-latest-time-by-replacing-hidden-digits.md)
- [1737. Change Minimum Characters to Satisfy One of Three Conditions](https://jaywin.gitbook.io/leetcode/solutions/1737-change-minimum-characters-to-satisfy-one-of-three-conditions.md)
- [1738. Find Kth Largest XOR Coordinate Value](https://jaywin.gitbook.io/leetcode/solutions/1738-find-kth-largest-xor-coordinate-value.md)
- [1739. Building Boxes](https://jaywin.gitbook.io/leetcode/solutions/1739-building-boxes.md)
- [1740. Find Distance in a Binary Tree](https://jaywin.gitbook.io/leetcode/solutions/1740-find-distance-in-a-binary-tree.md)
- [1741. Find Total Time Spent by Each Employee](https://jaywin.gitbook.io/leetcode/solutions/1741-find-total-time-spent-by-each-employee.md)
- [1742. Maximum Number of Balls in a Box](https://jaywin.gitbook.io/leetcode/solutions/1742-maximum-number-of-balls-in-a-box.md)
- [1743. Restore the Array From Adjacent Pairs](https://jaywin.gitbook.io/leetcode/solutions/1743-restore-the-array-from-adjacent-pairs.md)
- [1744. Can You Eat Your Favorite Candy on Your Favorite Day?](https://jaywin.gitbook.io/leetcode/solutions/1744-can-you-eat-your-favorite-candy-on-your-favorite-day.md)
- [1745. Palindrome Partitioning IV](https://jaywin.gitbook.io/leetcode/solutions/1745-palindrome-partitioning-iv.md)
- [1746. Maximum Subarray Sum After One Operation](https://jaywin.gitbook.io/leetcode/solutions/1746-maximum-subarray-sum-after-one-operation.md)
- [1747. Leetflex Banned Accounts](https://jaywin.gitbook.io/leetcode/solutions/1747-leetflex-banned-accounts.md)
- [1748. Sum of Unique Elements](https://jaywin.gitbook.io/leetcode/solutions/1748-sum-of-unique-elements.md)
- [1749. Maximum Absolute Sum of Any Subarray](https://jaywin.gitbook.io/leetcode/solutions/1749-maximum-absolute-sum-of-any-subarray.md)
- [1750. Minimum Length of String After Deleting Similar Ends](https://jaywin.gitbook.io/leetcode/solutions/1750-minimum-length-of-string-after-deleting-similar-ends.md)
- [1751. Maximum Number of Events That Can Be Attended II](https://jaywin.gitbook.io/leetcode/solutions/1751-maximum-number-of-events-that-can-be-attended-ii.md)
- [1752. Check if Array Is Sorted and Rotated](https://jaywin.gitbook.io/leetcode/solutions/1752-check-if-array-is-sorted-and-rotated.md)
- [1753. Maximum Score From Removing Stones](https://jaywin.gitbook.io/leetcode/solutions/1753-maximum-score-from-removing-stones.md)
- [1754. Largest Merge Of Two Strings](https://jaywin.gitbook.io/leetcode/solutions/1754-largest-merge-of-two-strings.md)
- [1755. Closest Subsequence Sum](https://jaywin.gitbook.io/leetcode/solutions/1755-closest-subsequence-sum.md)
- [1756. Design Most Recently Used Queue](https://jaywin.gitbook.io/leetcode/solutions/1756-design-most-recently-used-queue.md)
- [1757. Recyclable and Low Fat Products](https://jaywin.gitbook.io/leetcode/solutions/1757-recyclable-and-low-fat-products.md)
- [1758. Minimum Changes To Make Alternating Binary String](https://jaywin.gitbook.io/leetcode/solutions/1758-minimum-changes-to-make-alternating-binary-string.md)
- [1759. Count Number of Homogenous Substrings](https://jaywin.gitbook.io/leetcode/solutions/1759-count-number-of-homogenous-substrings.md)
- [1760. Minimum Limit of Balls in a Bag](https://jaywin.gitbook.io/leetcode/solutions/1760-minimum-limit-of-balls-in-a-bag.md)
- [1761. Minimum Degree of a Connected Trio in a Graph](https://jaywin.gitbook.io/leetcode/solutions/1761-minimum-degree-of-a-connected-trio-in-a-graph.md)
- [1762. Buildings With an Ocean View](https://jaywin.gitbook.io/leetcode/solutions/1762-buildings-with-an-ocean-view.md)
- [1763. Longest Nice Substring](https://jaywin.gitbook.io/leetcode/solutions/1763-longest-nice-substring.md)
- [1764. Form Array by Concatenating Subarrays of Another Array](https://jaywin.gitbook.io/leetcode/solutions/1764-form-array-by-concatenating-subarrays-of-another-array.md)
- [1765. Map of Highest Peak](https://jaywin.gitbook.io/leetcode/solutions/1765-map-of-highest-peak.md)
- [1766. Tree of Coprimes](https://jaywin.gitbook.io/leetcode/solutions/1766-tree-of-coprimes.md)
- [1767. Find the Subtasks That Did Not Execute](https://jaywin.gitbook.io/leetcode/solutions/1767-find-the-subtasks-that-did-not-execute.md)
- [1768. Merge Strings Alternately](https://jaywin.gitbook.io/leetcode/solutions/1768-merge-strings-alternately.md)
- [1769. Minimum Number of Operations to Move All Balls to Each Box](https://jaywin.gitbook.io/leetcode/solutions/1769-minimum-number-of-operations-to-move-all-balls-to-each-box.md)
- [1770. Maximum Score from Performing Multiplication Operations](https://jaywin.gitbook.io/leetcode/solutions/1770-maximum-score-from-performing-multiplication-operations.md)
- [1771. Maximize Palindrome Length From Subsequences](https://jaywin.gitbook.io/leetcode/solutions/1771-maximize-palindrome-length-from-subsequences.md)
- [1772. Sort Features by Popularity](https://jaywin.gitbook.io/leetcode/solutions/1772-sort-features-by-popularity.md)
- [1773. Count Items Matching a Rule](https://jaywin.gitbook.io/leetcode/solutions/1773-count-items-matching-a-rule.md)
- [1774. Closest Dessert Cost](https://jaywin.gitbook.io/leetcode/solutions/1774-closest-dessert-cost.md)
- [1775. Equal Sum Arrays With Minimum Number of Operations](https://jaywin.gitbook.io/leetcode/solutions/1775-equal-sum-arrays-with-minimum-number-of-operations.md)
- [1776. Car Fleet II](https://jaywin.gitbook.io/leetcode/solutions/1776-car-fleet-ii.md)
- [1777. Product's Price for Each Store](https://jaywin.gitbook.io/leetcode/solutions/1777-products-price-for-each-store.md)
- [1778. Shortest Path in a Hidden Grid](https://jaywin.gitbook.io/leetcode/solutions/1778-shortest-path-in-a-hidden-grid.md)
- [1779. Find Nearest Point That Has the Same X or Y Coordinate](https://jaywin.gitbook.io/leetcode/solutions/1779-find-nearest-point-that-has-the-same-x-or-y-coordinate.md)
- [1780. Check if Number is a Sum of Powers of Three](https://jaywin.gitbook.io/leetcode/solutions/1780-check-if-number-is-a-sum-of-powers-of-three.md)
- [1781. Sum of Beauty of All Substrings](https://jaywin.gitbook.io/leetcode/solutions/1781-sum-of-beauty-of-all-substrings.md)
- [1782. Count Pairs Of Nodes](https://jaywin.gitbook.io/leetcode/solutions/1782-count-pairs-of-nodes.md)
- [1783. Grand Slam Titles](https://jaywin.gitbook.io/leetcode/solutions/1783-grand-slam-titles.md)
- [1784. Check if Binary String Has at Most One Segment of Ones](https://jaywin.gitbook.io/leetcode/solutions/1784-check-if-binary-string-has-at-most-one-segment-of-ones.md)
- [1785. Minimum Elements to Add to Form a Given Sum](https://jaywin.gitbook.io/leetcode/solutions/1785-minimum-elements-to-add-to-form-a-given-sum.md)
- [1786. Number of Restricted Paths From First to Last Node](https://jaywin.gitbook.io/leetcode/solutions/1786-number-of-restricted-paths-from-first-to-last-node.md)
- [1787. Make the XOR of All Segments Equal to Zero](https://jaywin.gitbook.io/leetcode/solutions/1787-make-the-xor-of-all-segments-equal-to-zero.md)
- [1788. Maximize the Beauty of the Garden](https://jaywin.gitbook.io/leetcode/solutions/1788-maximize-the-beauty-of-the-garden.md)
- [1789. Primary Department for Each Employee](https://jaywin.gitbook.io/leetcode/solutions/1789-primary-department-for-each-employee.md)
- [1790. Check if One String Swap Can Make Strings Equal](https://jaywin.gitbook.io/leetcode/solutions/1790-check-if-one-string-swap-can-make-strings-equal.md)
- [1791. Find Center of Star Graph](https://jaywin.gitbook.io/leetcode/solutions/1791-find-center-of-star-graph.md)
- [1792. Maximum Average Pass Ratio](https://jaywin.gitbook.io/leetcode/solutions/1792-maximum-average-pass-ratio.md)
- [1793. Maximum Score of a Good Subarray](https://jaywin.gitbook.io/leetcode/solutions/1793-maximum-score-of-a-good-subarray.md)
- [1794. Count Pairs of Equal Substrings With Minimum Difference](https://jaywin.gitbook.io/leetcode/solutions/1794-count-pairs-of-equal-substrings-with-minimum-difference.md)
- [1795. Rearrange Products Table](https://jaywin.gitbook.io/leetcode/solutions/1795-rearrange-products-table.md)
- [1796. Second Largest Digit in a String](https://jaywin.gitbook.io/leetcode/solutions/1796-second-largest-digit-in-a-string.md)
- [1797. Design Authentication Manager](https://jaywin.gitbook.io/leetcode/solutions/1797-design-authentication-manager.md)
- [1798. Maximum Number of Consecutive Values You Can Make](https://jaywin.gitbook.io/leetcode/solutions/1798-maximum-number-of-consecutive-values-you-can-make.md)
- [1799. Maximize Score After N Operations](https://jaywin.gitbook.io/leetcode/solutions/1799-maximize-score-after-n-operations.md)
- [1800. Maximum Ascending Subarray Sum](https://jaywin.gitbook.io/leetcode/solutions/1800-maximum-ascending-subarray-sum.md)
- [1801. Number of Orders in the Backlog](https://jaywin.gitbook.io/leetcode/solutions/1801-number-of-orders-in-the-backlog.md)
- [1802. Maximum Value at a Given Index in a Bounded Array](https://jaywin.gitbook.io/leetcode/solutions/1802-maximum-value-at-a-given-index-in-a-bounded-array.md)
- [1803. Count Pairs With XOR in a Range](https://jaywin.gitbook.io/leetcode/solutions/1803-count-pairs-with-xor-in-a-range.md)
- [1804. Implement Trie II (solutions/Prefix Tree)](https://jaywin.gitbook.io/leetcode/solutions/1804-implement-trie-ii-prefix-tree.md)
- [1805. Number of Different Integers in a String](https://jaywin.gitbook.io/leetcode/solutions/1805-number-of-different-integers-in-a-string.md)
- [1806. Minimum Number of Operations to Reinitialize a Permutation](https://jaywin.gitbook.io/leetcode/solutions/1806-minimum-number-of-operations-to-reinitialize-a-permutation.md)
- [1807. Evaluate the Bracket Pairs of a String](https://jaywin.gitbook.io/leetcode/solutions/1807-evaluate-the-bracket-pairs-of-a-string.md)
- [1808. Maximize Number of Nice Divisors](https://jaywin.gitbook.io/leetcode/solutions/1808-maximize-number-of-nice-divisors.md)
- [1809. Ad-Free Sessions](https://jaywin.gitbook.io/leetcode/solutions/1809-ad-free-sessions.md)
- [1810. Minimum Path Cost in a Hidden Grid](https://jaywin.gitbook.io/leetcode/solutions/1810-minimum-path-cost-in-a-hidden-grid.md)
- [1811. Find Interview Candidates](https://jaywin.gitbook.io/leetcode/solutions/1811-find-interview-candidates.md)
- [1812. Determine Color of a Chessboard Square](https://jaywin.gitbook.io/leetcode/solutions/1812-determine-color-of-a-chessboard-square.md)
- [1813. Sentence Similarity III](https://jaywin.gitbook.io/leetcode/solutions/1813-sentence-similarity-iii.md)
- [1814. Count Nice Pairs in an Array](https://jaywin.gitbook.io/leetcode/solutions/1814-count-nice-pairs-in-an-array.md)
- [1815. Maximum Number of Groups Getting Fresh Donuts](https://jaywin.gitbook.io/leetcode/solutions/1815-maximum-number-of-groups-getting-fresh-donuts.md)
- [1816. Truncate Sentence](https://jaywin.gitbook.io/leetcode/solutions/1816-truncate-sentence.md)
- [1817. Finding the Users Active Minutes](https://jaywin.gitbook.io/leetcode/solutions/1817-finding-the-users-active-minutes.md)
- [1818. Minimum Absolute Sum Difference](https://jaywin.gitbook.io/leetcode/solutions/1818-minimum-absolute-sum-difference.md)
- [1819. Number of Different Subsequences GCDs](https://jaywin.gitbook.io/leetcode/solutions/1819-number-of-different-subsequences-gcds.md)
- [1820. Maximum Number of Accepted Invitations](https://jaywin.gitbook.io/leetcode/solutions/1820-maximum-number-of-accepted-invitations.md)
- [1821. Find Customers With Positive Revenue this Year](https://jaywin.gitbook.io/leetcode/solutions/1821-find-customers-with-positive-revenue-this-year.md)
- [1822. Sign of the Product of an Array](https://jaywin.gitbook.io/leetcode/solutions/1822-sign-of-the-product-of-an-array.md)
- [1823. Find the Winner of the Circular Game](https://jaywin.gitbook.io/leetcode/solutions/1823-find-the-winner-of-the-circular-game.md)
- [1824. Minimum Sideway Jumps](https://jaywin.gitbook.io/leetcode/solutions/1824-minimum-sideway-jumps.md)
- [1825. Finding MK Average](https://jaywin.gitbook.io/leetcode/solutions/1825-finding-mk-average.md)
- [1826. Faulty Sensor](https://jaywin.gitbook.io/leetcode/solutions/1826-faulty-sensor.md)
- [1827. Minimum Operations to Make the Array Increasing](https://jaywin.gitbook.io/leetcode/solutions/1827-minimum-operations-to-make-the-array-increasing.md)
- [1828. Queries on Number of Points Inside a Circle](https://jaywin.gitbook.io/leetcode/solutions/1828-queries-on-number-of-points-inside-a-circle.md)
- [1829. Maximum XOR for Each Query](https://jaywin.gitbook.io/leetcode/solutions/1829-maximum-xor-for-each-query.md)
- [1830. Minimum Number of Operations to Make String Sorted](https://jaywin.gitbook.io/leetcode/solutions/1830-minimum-number-of-operations-to-make-string-sorted.md)
- [1831. Maximum Transaction Each Day](https://jaywin.gitbook.io/leetcode/solutions/1831-maximum-transaction-each-day.md)
- [1832. Check if the Sentence Is Pangram](https://jaywin.gitbook.io/leetcode/solutions/1832-check-if-the-sentence-is-pangram.md)
- [1833. Maximum Ice Cream Bars](https://jaywin.gitbook.io/leetcode/solutions/1833-maximum-ice-cream-bars.md)
- [1834. Single-Threaded CPU](https://jaywin.gitbook.io/leetcode/solutions/1834-single-threaded-cpu.md)
- [1835. Find XOR Sum of All Pairs Bitwise AND](https://jaywin.gitbook.io/leetcode/solutions/1835-find-xor-sum-of-all-pairs-bitwise-and.md)
- [1836. Remove Duplicates From an Unsorted Linked List](https://jaywin.gitbook.io/leetcode/solutions/1836-remove-duplicates-from-an-unsorted-linked-list.md)
- [1837. Sum of Digits in Base K](https://jaywin.gitbook.io/leetcode/solutions/1837-sum-of-digits-in-base-k.md)
- [1838. Frequency of the Most Frequent Element](https://jaywin.gitbook.io/leetcode/solutions/1838-frequency-of-the-most-frequent-element.md)
- [1839. Longest Substring Of All Vowels in Order](https://jaywin.gitbook.io/leetcode/solutions/1839-longest-substring-of-all-vowels-in-order.md)
- [1840. Maximum Building Height](https://jaywin.gitbook.io/leetcode/solutions/1840-maximum-building-height.md)
- [1841. League Statistics](https://jaywin.gitbook.io/leetcode/solutions/1841-league-statistics.md)
- [1842. Next Palindrome Using Same Digits](https://jaywin.gitbook.io/leetcode/solutions/1842-next-palindrome-using-same-digits.md)
- [1843. Suspicious Bank Accounts](https://jaywin.gitbook.io/leetcode/solutions/1843-suspicious-bank-accounts.md)
- [1844. Replace All Digits with Characters](https://jaywin.gitbook.io/leetcode/solutions/1844-replace-all-digits-with-characters.md)
- [1845. Seat Reservation Manager](https://jaywin.gitbook.io/leetcode/solutions/1845-seat-reservation-manager.md)
- [1846. Maximum Element After Decreasing and Rearranging](https://jaywin.gitbook.io/leetcode/solutions/1846-maximum-element-after-decreasing-and-rearranging.md)
- [1847. Closest Room](https://jaywin.gitbook.io/leetcode/solutions/1847-closest-room.md)
- [1848. Minimum Distance to the Target Element](https://jaywin.gitbook.io/leetcode/solutions/1848-minimum-distance-to-the-target-element.md)
- [1849. Splitting a String Into Descending Consecutive Values](https://jaywin.gitbook.io/leetcode/solutions/1849-splitting-a-string-into-descending-consecutive-values.md)
- [1850. Minimum Adjacent Swaps to Reach the Kth Smallest Number](https://jaywin.gitbook.io/leetcode/solutions/1850-minimum-adjacent-swaps-to-reach-the-kth-smallest-number.md)
- [1851. Minimum Interval to Include Each Query](https://jaywin.gitbook.io/leetcode/solutions/1851-minimum-interval-to-include-each-query.md)
- [1852. Distinct Numbers in Each Subarray](https://jaywin.gitbook.io/leetcode/solutions/1852-distinct-numbers-in-each-subarray.md)
- [1853. Convert Date Format](https://jaywin.gitbook.io/leetcode/solutions/1853-convert-date-format.md)
- [1854. Maximum Population Year](https://jaywin.gitbook.io/leetcode/solutions/1854-maximum-population-year.md)
- [1855. Maximum Distance Between a Pair of Values](https://jaywin.gitbook.io/leetcode/solutions/1855-maximum-distance-between-a-pair-of-values.md)
- [1856. Maximum Subarray Min-Product](https://jaywin.gitbook.io/leetcode/solutions/1856-maximum-subarray-min-product.md)
- [1857. Largest Color Value in a Directed Graph](https://jaywin.gitbook.io/leetcode/solutions/1857-largest-color-value-in-a-directed-graph.md)
- [1858. Longest Word With All Prefixes](https://jaywin.gitbook.io/leetcode/solutions/1858-longest-word-with-all-prefixes.md)
- [1859. Sorting the Sentence](https://jaywin.gitbook.io/leetcode/solutions/1859-sorting-the-sentence.md)
- [1860. Incremental Memory Leak](https://jaywin.gitbook.io/leetcode/solutions/1860-incremental-memory-leak.md)
- [1861. Rotating the Box](https://jaywin.gitbook.io/leetcode/solutions/1861-rotating-the-box.md)
- [1862. Sum of Floored Pairs](https://jaywin.gitbook.io/leetcode/solutions/1862-sum-of-floored-pairs.md)
- [1863. Sum of All Subset XOR Totals](https://jaywin.gitbook.io/leetcode/solutions/1863-sum-of-all-subset-xor-totals.md)
- [1864. Minimum Number of Swaps to Make the Binary String Alternating](https://jaywin.gitbook.io/leetcode/solutions/1864-minimum-number-of-swaps-to-make-the-binary-string-alternating.md)
- [1865. Finding Pairs With a Certain Sum](https://jaywin.gitbook.io/leetcode/solutions/1865-finding-pairs-with-a-certain-sum.md)
- [1866. Number of Ways to Rearrange Sticks With K Sticks Visible](https://jaywin.gitbook.io/leetcode/solutions/1866-number-of-ways-to-rearrange-sticks-with-k-sticks-visible.md)
- [1867. Orders With Maximum Quantity Above Average](https://jaywin.gitbook.io/leetcode/solutions/1867-orders-with-maximum-quantity-above-average.md)
- [1868. Product of Two Run-Length Encoded Arrays](https://jaywin.gitbook.io/leetcode/solutions/1868-product-of-two-run-length-encoded-arrays.md)
- [1869. Longer Contiguous Segments of Ones than Zeros](https://jaywin.gitbook.io/leetcode/solutions/1869-longer-contiguous-segments-of-ones-than-zeros.md)
- [1870. Minimum Speed to Arrive on Time](https://jaywin.gitbook.io/leetcode/solutions/1870-minimum-speed-to-arrive-on-time.md)
- [1871. Jump Game VII](https://jaywin.gitbook.io/leetcode/solutions/1871-jump-game-vii.md)
- [1872. Stone Game VIII](https://jaywin.gitbook.io/leetcode/solutions/1872-stone-game-viii.md)
- [1873. Calculate Special Bonus](https://jaywin.gitbook.io/leetcode/solutions/1873-calculate-special-bonus.md)
- [1874. Minimize Product Sum of Two Arrays](https://jaywin.gitbook.io/leetcode/solutions/1874-minimize-product-sum-of-two-arrays.md)
- [1875. Group Employees of the Same Salary](https://jaywin.gitbook.io/leetcode/solutions/1875-group-employees-of-the-same-salary.md)
- [1876. Substrings of Size Three with Distinct Characters](https://jaywin.gitbook.io/leetcode/solutions/1876-substrings-of-size-three-with-distinct-characters.md)
- [1877. Minimize Maximum Pair Sum in Array](https://jaywin.gitbook.io/leetcode/solutions/1877-minimize-maximum-pair-sum-in-array.md)
- [1878. Get Biggest Three Rhombus Sums in a Grid](https://jaywin.gitbook.io/leetcode/solutions/1878-get-biggest-three-rhombus-sums-in-a-grid.md)
- [1879. Minimum XOR Sum of Two Arrays](https://jaywin.gitbook.io/leetcode/solutions/1879-minimum-xor-sum-of-two-arrays.md)
- [1880. Check if Word Equals Summation of Two Words](https://jaywin.gitbook.io/leetcode/solutions/1880-check-if-word-equals-summation-of-two-words.md)
- [1881. Maximum Value after Insertion](https://jaywin.gitbook.io/leetcode/solutions/1881-maximum-value-after-insertion.md)
- [1882. Process Tasks Using Servers](https://jaywin.gitbook.io/leetcode/solutions/1882-process-tasks-using-servers.md)
- [1883. Minimum Skips to Arrive at Meeting On Time](https://jaywin.gitbook.io/leetcode/solutions/1883-minimum-skips-to-arrive-at-meeting-on-time.md)
- [1884. Egg Drop With 2 Eggs and N Floors](https://jaywin.gitbook.io/leetcode/solutions/1884-egg-drop-with-2-eggs-and-n-floors.md)
- [1885. Count Pairs in Two Arrays](https://jaywin.gitbook.io/leetcode/solutions/1885-count-pairs-in-two-arrays.md)
- [1886. Determine Whether Matrix Can Be Obtained By Rotation](https://jaywin.gitbook.io/leetcode/solutions/1886-determine-whether-matrix-can-be-obtained-by-rotation.md)
- [1887. Reduction Operations to Make the Array Elements Equal](https://jaywin.gitbook.io/leetcode/solutions/1887-reduction-operations-to-make-the-array-elements-equal.md)
- [1888. Minimum Number of Flips to Make the Binary String Alternating](https://jaywin.gitbook.io/leetcode/solutions/1888-minimum-number-of-flips-to-make-the-binary-string-alternating.md)
- [1889. Minimum Space Wasted From Packaging](https://jaywin.gitbook.io/leetcode/solutions/1889-minimum-space-wasted-from-packaging.md)
- [1890. The Latest Login in 2020](https://jaywin.gitbook.io/leetcode/solutions/1890-the-latest-login-in-2020.md)
- [1891. Cutting Ribbons](https://jaywin.gitbook.io/leetcode/solutions/1891-cutting-ribbons.md)
- [1892. Page Recommendations II](https://jaywin.gitbook.io/leetcode/solutions/1892-page-recommendations-ii.md)
- [1893. Check if All the Integers in a Range Are Covered](https://jaywin.gitbook.io/leetcode/solutions/1893-check-if-all-the-integers-in-a-range-are-covered.md)
- [1894. Find the Student that Will Replace the Chalk](https://jaywin.gitbook.io/leetcode/solutions/1894-find-the-student-that-will-replace-the-chalk.md)
- [1895. Largest Magic Square](https://jaywin.gitbook.io/leetcode/solutions/1895-largest-magic-square.md)
- [1896. Minimum Cost to Change the Final Value of Expression](https://jaywin.gitbook.io/leetcode/solutions/1896-minimum-cost-to-change-the-final-value-of-expression.md)
- [1897. Redistribute Characters to Make All Strings Equal](https://jaywin.gitbook.io/leetcode/solutions/1897-redistribute-characters-to-make-all-strings-equal.md)
- [1898. Maximum Number of Removable Characters](https://jaywin.gitbook.io/leetcode/solutions/1898-maximum-number-of-removable-characters.md)
- [1899. Merge Triplets to Form Target Triplet](https://jaywin.gitbook.io/leetcode/solutions/1899-merge-triplets-to-form-target-triplet.md)
- [1900. The Earliest and Latest Rounds Where Players Compete](https://jaywin.gitbook.io/leetcode/solutions/1900-the-earliest-and-latest-rounds-where-players-compete.md)
- [1901. Find a Peak Element II](https://jaywin.gitbook.io/leetcode/solutions/1901-find-a-peak-element-ii.md)
- [1902. Depth of BST Given Insertion Order](https://jaywin.gitbook.io/leetcode/solutions/1902-depth-of-bst-given-insertion-order.md)
- [1903. Largest Odd Number in String](https://jaywin.gitbook.io/leetcode/solutions/1903-largest-odd-number-in-string.md)
- [1904. The Number of Full Rounds You Have Played](https://jaywin.gitbook.io/leetcode/solutions/1904-the-number-of-full-rounds-you-have-played.md)
- [1905. Count Sub Islands](https://jaywin.gitbook.io/leetcode/solutions/1905-count-sub-islands.md)
- [1906. Minimum Absolute Difference Queries](https://jaywin.gitbook.io/leetcode/solutions/1906-minimum-absolute-difference-queries.md)
- [1907. Count Salary Categories](https://jaywin.gitbook.io/leetcode/solutions/1907-count-salary-categories.md)
- [1908. Game of Nim](https://jaywin.gitbook.io/leetcode/solutions/1908-game-of-nim.md)
- [1909. Remove One Element to Make the Array Strictly Increasing](https://jaywin.gitbook.io/leetcode/solutions/1909-remove-one-element-to-make-the-array-strictly-increasing.md)
- [1910. Remove All Occurrences of a Substring](https://jaywin.gitbook.io/leetcode/solutions/1910-remove-all-occurrences-of-a-substring.md)
- [1911. Maximum Alternating Subsequence Sum](https://jaywin.gitbook.io/leetcode/solutions/1911-maximum-alternating-subsequence-sum.md)
- [1912. Design Movie Rental System](https://jaywin.gitbook.io/leetcode/solutions/1912-design-movie-rental-system.md)
- [1913. Maximum Product Difference Between Two Pairs](https://jaywin.gitbook.io/leetcode/solutions/1913-maximum-product-difference-between-two-pairs.md)
- [1914. Cyclically Rotating a Grid](https://jaywin.gitbook.io/leetcode/solutions/1914-cyclically-rotating-a-grid.md)
- [1915. Number of Wonderful Substrings](https://jaywin.gitbook.io/leetcode/solutions/1915-number-of-wonderful-substrings.md)
- [1916. Count Ways to Build Rooms in an Ant Colony](https://jaywin.gitbook.io/leetcode/solutions/1916-count-ways-to-build-rooms-in-an-ant-colony.md)
- [1917. Leetcodify Friends Recommendations](https://jaywin.gitbook.io/leetcode/solutions/1917-leetcodify-friends-recommendations.md)
- [1918. Kth Smallest Subarray Sum](https://jaywin.gitbook.io/leetcode/solutions/1918-kth-smallest-subarray-sum.md)
- [1919. Leetcodify Similar Friends](https://jaywin.gitbook.io/leetcode/solutions/1919-leetcodify-similar-friends.md)
- [1920. Build Array from Permutation](https://jaywin.gitbook.io/leetcode/solutions/1920-build-array-from-permutation.md)
- [1921. Eliminate Maximum Number of Monsters](https://jaywin.gitbook.io/leetcode/solutions/1921-eliminate-maximum-number-of-monsters.md)
- [1922. Count Good Numbers](https://jaywin.gitbook.io/leetcode/solutions/1922-count-good-numbers.md)
- [1923. Longest Common Subpath](https://jaywin.gitbook.io/leetcode/solutions/1923-longest-common-subpath.md)
- [1924. Erect the Fence II](https://jaywin.gitbook.io/leetcode/solutions/1924-erect-the-fence-ii.md)
- [1925. Count Square Sum Triples](https://jaywin.gitbook.io/leetcode/solutions/1925-count-square-sum-triples.md)
- [1926. Nearest Exit from Entrance in Maze](https://jaywin.gitbook.io/leetcode/solutions/1926-nearest-exit-from-entrance-in-maze.md)
- [1927. Sum Game](https://jaywin.gitbook.io/leetcode/solutions/1927-sum-game.md)
- [1928. Minimum Cost to Reach Destination in Time](https://jaywin.gitbook.io/leetcode/solutions/1928-minimum-cost-to-reach-destination-in-time.md)
- [1929. Concatenation of Array](https://jaywin.gitbook.io/leetcode/solutions/1929-concatenation-of-array.md)
- [1930. Unique Length-3 Palindromic Subsequences](https://jaywin.gitbook.io/leetcode/solutions/1930-unique-length-3-palindromic-subsequences.md)
- [1931. Painting a Grid With Three Different Colors](https://jaywin.gitbook.io/leetcode/solutions/1931-painting-a-grid-with-three-different-colors.md)
- [1932. Merge BSTs to Create Single BST](https://jaywin.gitbook.io/leetcode/solutions/1932-merge-bsts-to-create-single-bst.md)
- [1933. Check if String Is Decomposable Into Value-Equal Substrings](https://jaywin.gitbook.io/leetcode/solutions/1933-check-if-string-is-decomposable-into-value-equal-substrings.md)
- [1934. Confirmation Rate](https://jaywin.gitbook.io/leetcode/solutions/1934-confirmation-rate.md)
- [1935. Maximum Number of Words You Can Type](https://jaywin.gitbook.io/leetcode/solutions/1935-maximum-number-of-words-you-can-type.md)
- [1936. Add Minimum Number of Rungs](https://jaywin.gitbook.io/leetcode/solutions/1936-add-minimum-number-of-rungs.md)
- [1937. Maximum Number of Points with Cost](https://jaywin.gitbook.io/leetcode/solutions/1937-maximum-number-of-points-with-cost.md)
- [1938. Maximum Genetic Difference Query](https://jaywin.gitbook.io/leetcode/solutions/1938-maximum-genetic-difference-query.md)
- [1939. Users That Actively Request Confirmation Messages](https://jaywin.gitbook.io/leetcode/solutions/1939-users-that-actively-request-confirmation-messages.md)
- [1940. Longest Common Subsequence Between Sorted Arrays](https://jaywin.gitbook.io/leetcode/solutions/1940-longest-common-subsequence-between-sorted-arrays.md)
- [1941. Check if All Characters Have Equal Number of Occurrences](https://jaywin.gitbook.io/leetcode/solutions/1941-check-if-all-characters-have-equal-number-of-occurrences.md)
- [1942. The Number of the Smallest Unoccupied Chair](https://jaywin.gitbook.io/leetcode/solutions/1942-the-number-of-the-smallest-unoccupied-chair.md)
- [1943. Describe the Painting](https://jaywin.gitbook.io/leetcode/solutions/1943-describe-the-painting.md)
- [1944. Number of Visible People in a Queue](https://jaywin.gitbook.io/leetcode/solutions/1944-number-of-visible-people-in-a-queue.md)
- [1945. Sum of Digits of String After Convert](https://jaywin.gitbook.io/leetcode/solutions/1945-sum-of-digits-of-string-after-convert.md)
- [1946. Largest Number After Mutating Substring](https://jaywin.gitbook.io/leetcode/solutions/1946-largest-number-after-mutating-substring.md)
- [1947. Maximum Compatibility Score Sum](https://jaywin.gitbook.io/leetcode/solutions/1947-maximum-compatibility-score-sum.md)
- [1948. Delete Duplicate Folders in System](https://jaywin.gitbook.io/leetcode/solutions/1948-delete-duplicate-folders-in-system.md)
- [1949. Strong Friendship](https://jaywin.gitbook.io/leetcode/solutions/1949-strong-friendship.md)
- [1950. Maximum of Minimum Values in All Subarrays](https://jaywin.gitbook.io/leetcode/solutions/1950-maximum-of-minimum-values-in-all-subarrays.md)
- [1951. All the Pairs With the Maximum Number of Common Followers](https://jaywin.gitbook.io/leetcode/solutions/1951-all-the-pairs-with-the-maximum-number-of-common-followers.md)
- [1952. Three Divisors](https://jaywin.gitbook.io/leetcode/solutions/1952-three-divisors.md)
- [1953. Maximum Number of Weeks for Which You Can Work](https://jaywin.gitbook.io/leetcode/solutions/1953-maximum-number-of-weeks-for-which-you-can-work.md)
- [1954. Minimum Garden Perimeter to Collect Enough Apples](https://jaywin.gitbook.io/leetcode/solutions/1954-minimum-garden-perimeter-to-collect-enough-apples.md)
- [1955. Count Number of Special Subsequences](https://jaywin.gitbook.io/leetcode/solutions/1955-count-number-of-special-subsequences.md)
- [1956. Minimum Time For K Virus Variants to Spread](https://jaywin.gitbook.io/leetcode/solutions/1956-minimum-time-for-k-virus-variants-to-spread.md)
- [1957. Delete Characters to Make Fancy String](https://jaywin.gitbook.io/leetcode/solutions/1957-delete-characters-to-make-fancy-string.md)
- [1958. Check if Move is Legal](https://jaywin.gitbook.io/leetcode/solutions/1958-check-if-move-is-legal.md)
- [1959. Minimum Total Space Wasted With K Resizing Operations](https://jaywin.gitbook.io/leetcode/solutions/1959-minimum-total-space-wasted-with-k-resizing-operations.md)
- [1960. Maximum Product of the Length of Two Palindromic Substrings](https://jaywin.gitbook.io/leetcode/solutions/1960-maximum-product-of-the-length-of-two-palindromic-substrings.md)
- [1961. Check If String Is a Prefix of Array](https://jaywin.gitbook.io/leetcode/solutions/1961-check-if-string-is-a-prefix-of-array.md)
- [1962. Remove Stones to Minimize the Total](https://jaywin.gitbook.io/leetcode/solutions/1962-remove-stones-to-minimize-the-total.md)
- [1963. Minimum Number of Swaps to Make the String Balanced](https://jaywin.gitbook.io/leetcode/solutions/1963-minimum-number-of-swaps-to-make-the-string-balanced.md)
- [1964. Find the Longest Valid Obstacle Course at Each Position](https://jaywin.gitbook.io/leetcode/solutions/1964-find-the-longest-valid-obstacle-course-at-each-position.md)
- [1965. Employees With Missing Information](https://jaywin.gitbook.io/leetcode/solutions/1965-employees-with-missing-information.md)
- [1966. Binary Searchable Numbers in an Unsorted Array](https://jaywin.gitbook.io/leetcode/solutions/1966-binary-searchable-numbers-in-an-unsorted-array.md)
- [1967. Number of Strings That Appear as Substrings in Word](https://jaywin.gitbook.io/leetcode/solutions/1967-number-of-strings-that-appear-as-substrings-in-word.md)
- [1968. Array With Elements Not Equal to Average of Neighbors](https://jaywin.gitbook.io/leetcode/solutions/1968-array-with-elements-not-equal-to-average-of-neighbors.md)
- [1969. Minimum Non-Zero Product of the Array Elements](https://jaywin.gitbook.io/leetcode/solutions/1969-minimum-non-zero-product-of-the-array-elements.md)
- [1970. Last Day Where You Can Still Cross](https://jaywin.gitbook.io/leetcode/solutions/1970-last-day-where-you-can-still-cross.md)
- [1971. Find if Path Exists in Graph](https://jaywin.gitbook.io/leetcode/solutions/1971-find-if-path-exists-in-graph.md)
- [1972. First and Last Call On the Same Day](https://jaywin.gitbook.io/leetcode/solutions/1972-first-and-last-call-on-the-same-day.md)
- [1973. Count Nodes Equal to Sum of Descendants](https://jaywin.gitbook.io/leetcode/solutions/1973-count-nodes-equal-to-sum-of-descendants.md)
- [1974. Minimum Time to Type Word Using Special Typewriter](https://jaywin.gitbook.io/leetcode/solutions/1974-minimum-time-to-type-word-using-special-typewriter.md)
- [1975. Maximum Matrix Sum](https://jaywin.gitbook.io/leetcode/solutions/1975-maximum-matrix-sum.md)
- [1976. Number of Ways to Arrive at Destination](https://jaywin.gitbook.io/leetcode/solutions/1976-number-of-ways-to-arrive-at-destination.md)
- [1977. Number of Ways to Separate Numbers](https://jaywin.gitbook.io/leetcode/solutions/1977-number-of-ways-to-separate-numbers.md)
- [1978. Employees Whose Manager Left the Company](https://jaywin.gitbook.io/leetcode/solutions/1978-employees-whose-manager-left-the-company.md)
- [1979. Find Greatest Common Divisor of Array](https://jaywin.gitbook.io/leetcode/solutions/1979-find-greatest-common-divisor-of-array.md)
- [1980. Find Unique Binary String](https://jaywin.gitbook.io/leetcode/solutions/1980-find-unique-binary-string.md)
- [1981. Minimize the Difference Between Target and Chosen Elements](https://jaywin.gitbook.io/leetcode/solutions/1981-minimize-the-difference-between-target-and-chosen-elements.md)
- [1982. Find Array Given Subset Sums](https://jaywin.gitbook.io/leetcode/solutions/1982-find-array-given-subset-sums.md)
- [1983. Widest Pair of Indices With Equal Range Sum](https://jaywin.gitbook.io/leetcode/solutions/1983-widest-pair-of-indices-with-equal-range-sum.md)
- [1984. Minimum Difference Between Highest and Lowest of K Scores](https://jaywin.gitbook.io/leetcode/solutions/1984-minimum-difference-between-highest-and-lowest-of-k-scores.md)
- [1985. Find the Kth Largest Integer in the Array](https://jaywin.gitbook.io/leetcode/solutions/1985-find-the-kth-largest-integer-in-the-array.md)
- [1986. Minimum Number of Work Sessions to Finish the Tasks](https://jaywin.gitbook.io/leetcode/solutions/1986-minimum-number-of-work-sessions-to-finish-the-tasks.md)
- [1987. Number of Unique Good Subsequences](https://jaywin.gitbook.io/leetcode/solutions/1987-number-of-unique-good-subsequences.md)
- [1988. Find Cutoff Score for Each School](https://jaywin.gitbook.io/leetcode/solutions/1988-find-cutoff-score-for-each-school.md)
- [1989. Maximum Number of People That Can Be Caught in Tag](https://jaywin.gitbook.io/leetcode/solutions/1989-maximum-number-of-people-that-can-be-caught-in-tag.md)
- [1990. Count the Number of Experiments](https://jaywin.gitbook.io/leetcode/solutions/1990-count-the-number-of-experiments.md)
- [1991. Find the Middle Index in Array](https://jaywin.gitbook.io/leetcode/solutions/1991-find-the-middle-index-in-array.md)
- [1992. Find All Groups of Farmland](https://jaywin.gitbook.io/leetcode/solutions/1992-find-all-groups-of-farmland.md)
- [1993. Operations on Tree](https://jaywin.gitbook.io/leetcode/solutions/1993-operations-on-tree.md)
- [1994. The Number of Good Subsets](https://jaywin.gitbook.io/leetcode/solutions/1994-the-number-of-good-subsets.md)
- [1995. Count Special Quadruplets](https://jaywin.gitbook.io/leetcode/solutions/1995-count-special-quadruplets.md)
- [1996. The Number of Weak Characters in the Game](https://jaywin.gitbook.io/leetcode/solutions/1996-the-number-of-weak-characters-in-the-game.md)
- [1997. First Day Where You Have Been in All the Rooms](https://jaywin.gitbook.io/leetcode/solutions/1997-first-day-where-you-have-been-in-all-the-rooms.md)
- [1998. GCD Sort of an Array](https://jaywin.gitbook.io/leetcode/solutions/1998-gcd-sort-of-an-array.md)
- [1999. Smallest Greater Multiple Made of Two Digits](https://jaywin.gitbook.io/leetcode/solutions/1999-smallest-greater-multiple-made-of-two-digits.md)
- [2000. Reverse Prefix of Word](https://jaywin.gitbook.io/leetcode/solutions/2000-reverse-prefix-of-word.md)
- [2001. Number of Pairs of Interchangeable Rectangles](https://jaywin.gitbook.io/leetcode/solutions/2001-number-of-pairs-of-interchangeable-rectangles.md)
- [2002. Maximum Product of the Length of Two Palindromic Subsequences](https://jaywin.gitbook.io/leetcode/solutions/2002-maximum-product-of-the-length-of-two-palindromic-subsequences.md)
- [2003. Smallest Missing Genetic Value in Each Subtree](https://jaywin.gitbook.io/leetcode/solutions/2003-smallest-missing-genetic-value-in-each-subtree.md)
- [2004. The Number of Seniors and Juniors to Join the Company](https://jaywin.gitbook.io/leetcode/solutions/2004-the-number-of-seniors-and-juniors-to-join-the-company.md)
- [2005. Subtree Removal Game with Fibonacci Tree](https://jaywin.gitbook.io/leetcode/solutions/2005-subtree-removal-game-with-fibonacci-tree.md)
- [2006. Count Number of Pairs With Absolute Difference K](https://jaywin.gitbook.io/leetcode/solutions/2006-count-number-of-pairs-with-absolute-difference-k.md)
- [2007. Find Original Array From Doubled Array](https://jaywin.gitbook.io/leetcode/solutions/2007-find-original-array-from-doubled-array.md)
- [2008. Maximum Earnings From Taxi](https://jaywin.gitbook.io/leetcode/solutions/2008-maximum-earnings-from-taxi.md)
- [2009. Minimum Number of Operations to Make Array Continuous](https://jaywin.gitbook.io/leetcode/solutions/2009-minimum-number-of-operations-to-make-array-continuous.md)
- [2010. The Number of Seniors and Juniors to Join the Company II](https://jaywin.gitbook.io/leetcode/solutions/2010-the-number-of-seniors-and-juniors-to-join-the-company-ii.md)
- [2011. Final Value of Variable After Performing Operations](https://jaywin.gitbook.io/leetcode/solutions/2011-final-value-of-variable-after-performing-operations.md)
- [2012. Sum of Beauty in the Array](https://jaywin.gitbook.io/leetcode/solutions/2012-sum-of-beauty-in-the-array.md)
- [2013. Detect Squares](https://jaywin.gitbook.io/leetcode/solutions/2013-detect-squares.md)
- [2014. Longest Subsequence Repeated k Times](https://jaywin.gitbook.io/leetcode/solutions/2014-longest-subsequence-repeated-k-times.md)
- [2015. Average Height of Buildings in Each Segment](https://jaywin.gitbook.io/leetcode/solutions/2015-average-height-of-buildings-in-each-segment.md)
- [2016. Maximum Difference Between Increasing Elements](https://jaywin.gitbook.io/leetcode/solutions/2016-maximum-difference-between-increasing-elements.md)
- [2017. Grid Game](https://jaywin.gitbook.io/leetcode/solutions/2017-grid-game.md)
- [2018. Check if Word Can Be Placed In Crossword](https://jaywin.gitbook.io/leetcode/solutions/2018-check-if-word-can-be-placed-in-crossword.md)
- [2019. The Score of Students Solving Math Expression](https://jaywin.gitbook.io/leetcode/solutions/2019-the-score-of-students-solving-math-expression.md)