├── 0001-two-sum ├── 0001-two-sum.cpp ├── NOTES.md └── README.md ├── 0002-add-two-numbers ├── 0002-add-two-numbers.cpp └── README.md ├── 0004-median-of-two-sorted-arrays ├── 0004-median-of-two-sorted-arrays.cpp ├── NOTES.md └── README.md ├── 0005-longest-palindromic-substring ├── 0005-longest-palindromic-substring.cpp ├── NOTES.md └── README.md ├── 0006-zigzag-conversion ├── 0006-zigzag-conversion.cpp └── NOTES.md ├── 0017-letter-combinations-of-a-phone-number └── NOTES.md ├── 0020-valid-parentheses ├── 0020-valid-parentheses.cpp ├── NOTES.md └── README.md ├── 0021-merge-two-sorted-lists ├── 0021-merge-two-sorted-lists.cpp └── NOTES.md ├── 0023-merge-k-sorted-lists ├── 0023-merge-k-sorted-lists.cpp └── NOTES.md ├── 0024-swap-nodes-in-pairs ├── 0024-swap-nodes-in-pairs.cpp └── NOTES.md ├── 0028-find-the-index-of-the-first-occurrence-in-a-string ├── 0028-find-the-index-of-the-first-occurrence-in-a-string.cpp └── NOTES.md ├── 0033-search-in-rotated-sorted-array ├── 0033-search-in-rotated-sorted-array.cpp ├── NOTES.md └── README.md ├── 0034-find-first-and-last-position-of-element-in-sorted-array ├── 0034-find-first-and-last-position-of-element-in-sorted-array.cpp ├── NOTES.md └── README.md ├── 0035-search-insert-position ├── 0035-search-insert-position.cpp └── README.md ├── 0038-count-and-say ├── 0038-count-and-say.cpp └── README.md ├── 0040-combination-sum-ii ├── 0040-combination-sum-ii.cpp ├── NOTES.md └── README.md ├── 0041-first-missing-positive ├── 0041-first-missing-positive.cpp ├── NOTES.md └── README.md ├── 0042-trapping-rain-water ├── 0042-trapping-rain-water.cpp ├── NOTES.md └── README.md ├── 0045-jump-game-ii └── 0045-jump-game-ii.cpp ├── 0049-group-anagrams ├── 0049-group-anagrams.cpp ├── NOTES.md └── README.md ├── 0050-powx-n ├── 0050-powx-n.cpp ├── NOTES.md └── README.md ├── 0054-spiral-matrix └── 0054-spiral-matrix.cpp ├── 0057-insert-interval ├── 0057-insert-interval.cpp └── NOTES.md ├── 0058-length-of-last-word ├── 0058-length-of-last-word.cpp ├── NOTES.md └── README.md ├── 0059-spiral-matrix-ii ├── 0059-spiral-matrix-ii.cpp └── README.md ├── 0062-unique-paths ├── 0062-unique-paths.cpp ├── NOTES.md └── README.md ├── 0063-unique-paths-ii ├── 0063-unique-paths-ii.cpp ├── NOTES.md └── README.md ├── 0064-minimum-path-sum ├── 0064-minimum-path-sum.cpp └── NOTES.md ├── 0067-add-binary ├── 0067-add-binary.cpp ├── NOTES.md └── README.md ├── 0068-text-justification ├── 0068-text-justification.cpp ├── NOTES.md └── README.md ├── 0070-climbing-stairs ├── 0070-climbing-stairs.cpp ├── NOTES.md └── README.md ├── 0071-simplify-path ├── 0071-simplify-path.cpp └── NOTES.md ├── 0072-edit-distance ├── 0072-edit-distance.cpp └── README.md ├── 0073-set-matrix-zeroes ├── 0073-set-matrix-zeroes.cpp └── README.md ├── 0074-search-a-2d-matrix ├── 0074-search-a-2d-matrix.cpp ├── NOTES.md └── README.md ├── 0075-sort-colors ├── 0075-sort-colors.cpp ├── NOTES.md └── README.md ├── 0076-minimum-window-substring ├── 0076-minimum-window-substring.cpp ├── NOTES.md └── README.md ├── 0077-combinations ├── 0077-combinations.cpp └── NOTES.md ├── 0078-subsets ├── 0078-subsets.cpp ├── NOTES.md └── README.md ├── 0079-word-search ├── 0079-word-search.cpp ├── NOTES.md └── README.md ├── 0081-search-in-rotated-sorted-array-ii ├── 0081-search-in-rotated-sorted-array-ii.cpp ├── NOTES.md └── README.md ├── 0085-maximal-rectangle ├── 0085-maximal-rectangle.cpp ├── NOTES.md └── README.md ├── 0086-partition-list ├── 0086-partition-list.cpp ├── NOTES.md └── README.md ├── 0087-scramble-string ├── 0087-scramble-string.cpp ├── NOTES.md └── README.md ├── 0091-decode-ways ├── 0091-decode-ways.cpp ├── NOTES.md └── README.md ├── 0092-reverse-linked-list-ii ├── 0092-reverse-linked-list-ii.cpp ├── NOTES.md └── README.md ├── 0093-restore-ip-addresses ├── 0093-restore-ip-addresses.cpp ├── NOTES.md └── README.md ├── 0094-binary-tree-inorder-traversal ├── 0094-binary-tree-inorder-traversal.cpp ├── NOTES.md └── README.md ├── 0095-unique-binary-search-trees-ii ├── 0095-unique-binary-search-trees-ii.cpp └── README.md ├── 0097-interleaving-string ├── 0097-interleaving-string.cpp ├── NOTES.md └── README.md ├── 0098-validate-binary-search-tree └── NOTES.md ├── 01-matrix ├── 01-matrix.cpp └── README.md ├── 0100-same-tree ├── 0100-same-tree.cpp ├── NOTES.md └── README.md ├── 0101-symmetric-tree ├── 0101-symmetric-tree.cpp ├── NOTES.md └── README.md ├── 0102-binary-tree-level-order-traversal ├── 0102-binary-tree-level-order-traversal.cpp ├── NOTES.md └── README.md ├── 0103-binary-tree-zigzag-level-order-traversal ├── 0103-binary-tree-zigzag-level-order-traversal.cpp └── README.md ├── 0104-maximum-depth-of-binary-tree ├── 0104-maximum-depth-of-binary-tree.cpp ├── NOTES.md └── README.md ├── 0106-construct-binary-tree-from-inorder-and-postorder-traversal ├── 0106-construct-binary-tree-from-inorder-and-postorder-traversal.cpp └── NOTES.md ├── 0109-convert-sorted-list-to-binary-search-tree ├── 0109-convert-sorted-list-to-binary-search-tree.cpp ├── NOTES.md └── README.md ├── 0118-pascals-triangle ├── 0118-pascals-triangle.cpp ├── NOTES.md └── README.md ├── 0119-pascals-triangle-ii ├── 0119-pascals-triangle-ii.cpp ├── NOTES.md └── README.md ├── 0121-best-time-to-buy-and-sell-stock ├── 0121-best-time-to-buy-and-sell-stock.cpp └── NOTES.md ├── 0122-best-time-to-buy-and-sell-stock-ii ├── 0122-best-time-to-buy-and-sell-stock-ii.cpp └── README.md ├── 0128-longest-consecutive-sequence ├── 0128-longest-consecutive-sequence.cpp ├── NOTES.md └── README.md ├── 0129-sum-root-to-leaf-numbers ├── 0129-sum-root-to-leaf-numbers.cpp └── NOTES.md ├── 0131-palindrome-partitioning ├── 0131-palindrome-partitioning.cpp └── NOTES.md ├── 0133-clone-graph ├── 0133-clone-graph.cpp ├── NOTES.md └── README.md ├── 0134-gas-station ├── 0134-gas-station.cpp ├── NOTES.md └── README.md ├── 0135-candy ├── 0135-candy.cpp ├── NOTES.md └── README.md ├── 0137-single-number-ii ├── 0137-single-number-ii.cpp └── README.md ├── 0138-copy-list-with-random-pointer ├── 0138-copy-list-with-random-pointer.cpp ├── NOTES.md └── README.md ├── 0139-word-break └── NOTES.md ├── 0140-word-break-ii ├── 0140-word-break-ii.cpp ├── NOTES.md └── README.md ├── 0141-linked-list-cycle ├── 0141-linked-list-cycle.cpp ├── NOTES.md └── README.md ├── 0142-linked-list-cycle-ii └── 0142-linked-list-cycle-ii.cpp ├── 0143-reorder-list ├── 0143-reorder-list.cpp ├── NOTES.md └── README.md ├── 0144-binary-tree-preorder-traversal └── NOTES.md ├── 0145-binary-tree-postorder-traversal ├── 0145-binary-tree-postorder-traversal.cpp ├── NOTES.md └── README.md ├── 0146-lru-cache └── README.md ├── 0148-sort-list ├── 0148-sort-list.cpp └── README.md ├── 0149-max-points-on-a-line ├── 0149-max-points-on-a-line.cpp └── NOTES.md ├── 0150-evaluate-reverse-polish-notation ├── 0150-evaluate-reverse-polish-notation.cpp ├── NOTES.md └── README.md ├── 0165-compare-version-numbers ├── 0165-compare-version-numbers.cpp ├── NOTES.md └── README.md ├── 0168-excel-sheet-column-title ├── 0168-excel-sheet-column-title.cpp ├── NOTES.md └── README.md ├── 0169-majority-element ├── 0169-majority-element.cpp ├── NOTES.md └── README.md ├── 0179-largest-number ├── 0179-largest-number.cpp ├── NOTES.md └── README.md ├── 0191-number-of-1-bits ├── 0191-number-of-1-bits.cpp ├── NOTES.md └── README.md ├── 0198-house-robber ├── 0198-house-robber.cpp ├── NOTES.md └── README.md ├── 0200-number-of-islands ├── 0200-number-of-islands.cpp ├── NOTES.md └── README.md ├── 0201-bitwise-and-of-numbers-range └── README.md ├── 0202-happy-number ├── 0202-happy-number.cpp ├── NOTES.md └── README.md ├── 0205-isomorphic-strings ├── 0205-isomorphic-strings.cpp ├── NOTES.md └── README.md ├── 0206-reverse-linked-list ├── 0206-reverse-linked-list.cpp ├── NOTES.md └── README.md ├── 0207-course-schedule ├── 0207-course-schedule.cpp └── README.md ├── 0208-implement-trie-prefix-tree ├── 0208-implement-trie-prefix-tree.cpp ├── NOTES.md └── README.md ├── 0209-minimum-size-subarray-sum └── README.md ├── 0211-design-add-and-search-words-data-structure ├── 0211-design-add-and-search-words-data-structure.cpp └── NOTES.md ├── 0214-shortest-palindrome ├── 0214-shortest-palindrome.cpp ├── NOTES.md └── README.md ├── 0215-kth-largest-element-in-an-array ├── NOTES.md └── README.md ├── 0217-contains-duplicate ├── 0217-contains-duplicate.cpp └── NOTES.md ├── 0225-implement-stack-using-queues ├── 0225-implement-stack-using-queues.cpp ├── NOTES.md └── README.md ├── 0226-invert-binary-tree ├── NOTES.md └── README.md ├── 0228-summary-ranges ├── 0228-summary-ranges.cpp └── NOTES.md ├── 0229-majority-element-ii ├── NOTES.md └── README.md ├── 0231-power-of-two ├── 0231-power-of-two.cpp ├── NOTES.md └── README.md ├── 0232-implement-queue-using-stacks ├── 0232-implement-queue-using-stacks.cpp ├── NOTES.md └── README.md ├── 0234-palindrome-linked-list ├── 0234-palindrome-linked-list.cpp ├── NOTES.md └── README.md ├── 0235-lowest-common-ancestor-of-a-binary-search-tree ├── 0235-lowest-common-ancestor-of-a-binary-search-tree.cpp ├── NOTES.md └── README.md ├── 0237-delete-node-in-a-linked-list ├── 0237-delete-node-in-a-linked-list.cpp ├── NOTES.md └── README.md ├── 0238-product-of-array-except-self ├── 0238-product-of-array-except-self.cpp ├── NOTES.md └── README.md ├── 0239-sliding-window-maximum ├── 0239-sliding-window-maximum.cpp ├── NOTES.md └── README.md ├── 0241-different-ways-to-add-parentheses ├── 0241-different-ways-to-add-parentheses.cpp ├── NOTES.md └── README.md ├── 0242-valid-anagram ├── 0242-valid-anagram.cpp ├── NOTES.md └── README.md ├── 0258-add-digits ├── 0258-add-digits.cpp └── NOTES.md ├── 0260-single-number-iii ├── 0260-single-number-iii.cpp ├── NOTES.md └── README.md ├── 0264-ugly-number-ii ├── NOTES.md └── README.md ├── 0268-missing-number ├── 0268-missing-number.cpp ├── NOTES.md └── README.md ├── 0273-integer-to-english-words ├── 0273-integer-to-english-words.cpp ├── NOTES.md └── README.md ├── 0278-first-bad-version ├── 0278-first-bad-version.cpp ├── NOTES.md └── README.md ├── 0279-perfect-squares ├── 0279-perfect-squares.cpp ├── NOTES.md └── README.md ├── 0283-move-zeroes ├── 0283-move-zeroes.cpp └── README.md ├── 0287-find-the-duplicate-number ├── 0287-find-the-duplicate-number.cpp ├── NOTES.md └── README.md ├── 0290-word-pattern └── README.md ├── 0299-bulls-and-cows ├── 0299-bulls-and-cows.cpp ├── NOTES.md └── README.md ├── 0300-longest-increasing-subsequence ├── 0300-longest-increasing-subsequence.cpp ├── NOTES.md └── README.md ├── 0303-range-sum-query-immutable ├── 0303-range-sum-query-immutable.cpp ├── NOTES.md └── README.md ├── 0310-minimum-height-trees ├── 0310-minimum-height-trees.cpp ├── NOTES.md └── README.md ├── 0316-remove-duplicate-letters ├── 0316-remove-duplicate-letters.cpp ├── NOTES.md └── README.md ├── 0319-bulb-switcher ├── 0319-bulb-switcher.cpp └── NOTES.md ├── 0328-odd-even-linked-list ├── 0328-odd-even-linked-list.cpp └── README.md ├── 0330-patching-array ├── 0330-patching-array.cpp ├── NOTES.md └── README.md ├── 0332-reconstruct-itinerary ├── 0332-reconstruct-itinerary.cpp ├── NOTES.md └── README.md ├── 0338-counting-bits ├── 0338-counting-bits.cpp ├── NOTES.md └── README.md ├── 0341-flatten-nested-list-iterator ├── 0341-flatten-nested-list-iterator.cpp ├── NOTES.md └── README.md ├── 0342-power-of-four ├── NOTES.md └── README.md ├── 0343-integer-break ├── 0343-integer-break.cpp ├── NOTES.md └── README.md ├── 0344-reverse-string ├── 0344-reverse-string.cpp ├── NOTES.md └── README.md ├── 0345-reverse-vowels-of-a-string ├── 0345-reverse-vowels-of-a-string.cpp ├── NOTES.md └── README.md ├── 0347-top-k-frequent-elements ├── 0347-top-k-frequent-elements.cpp └── README.md ├── 0349-intersection-of-two-arrays ├── 0349-intersection-of-two-arrays.cpp └── README.md ├── 0350-intersection-of-two-arrays-ii ├── 0350-intersection-of-two-arrays-ii.cpp ├── NOTES.md └── README.md ├── 0352-data-stream-as-disjoint-intervals ├── 0352-data-stream-as-disjoint-intervals.cpp └── NOTES.md ├── 0368-largest-divisible-subset ├── 0368-largest-divisible-subset.cpp ├── NOTES.md └── README.md ├── 0373-find-k-pairs-with-smallest-sums ├── 0373-find-k-pairs-with-smallest-sums.cpp ├── NOTES.md └── README.md ├── 0377-combination-sum-iv ├── 0377-combination-sum-iv.cpp ├── NOTES.md └── README.md ├── 0380-insert-delete-getrandom-o1 ├── 0380-insert-delete-getrandom-o1.cpp ├── NOTES.md └── README.md ├── 0382-linked-list-random-node ├── 0382-linked-list-random-node.cpp └── README.md ├── 0386-lexicographical-numbers ├── 0386-lexicographical-numbers.cpp ├── NOTES.md └── README.md ├── 0387-first-unique-character-in-a-string ├── NOTES.md └── README.md ├── 0389-find-the-difference ├── 0389-find-the-difference.cpp └── README.md ├── 0392-is-subsequence ├── 0392-is-subsequence.cpp ├── NOTES.md └── README.md ├── 0394-decode-string ├── 0394-decode-string.cpp └── NOTES.md ├── 0399-evaluate-division ├── 0399-evaluate-division.cpp └── NOTES.md ├── 0402-remove-k-digits ├── 0402-remove-k-digits.cpp ├── NOTES.md └── README.md ├── 0403-frog-jump ├── 0403-frog-jump.cpp ├── NOTES.md └── README.md ├── 0404-sum-of-left-leaves ├── 0404-sum-of-left-leaves.cpp └── NOTES.md ├── 0407-trapping-rain-water-ii ├── 0407-trapping-rain-water-ii.cpp └── README.md ├── 0409-longest-palindrome ├── 0409-longest-palindrome.cpp └── NOTES.md ├── 0416-partition-equal-subset-sum ├── 0416-partition-equal-subset-sum.cpp └── README.md ├── 0424-longest-repeating-character-replacement ├── 0424-longest-repeating-character-replacement.cpp └── NOTES.md ├── 0427-construct-quad-tree ├── 0427-construct-quad-tree.cpp ├── NOTES.md └── README.md ├── 0432-all-oone-data-structure ├── 0432-all-oone-data-structure.cpp └── README.md ├── 0433-minimum-genetic-mutation ├── 0433-minimum-genetic-mutation.cpp └── README.md ├── 0435-non-overlapping-intervals ├── 0435-non-overlapping-intervals.cpp ├── NOTES.md └── README.md ├── 0438-find-all-anagrams-in-a-string ├── 0438-find-all-anagrams-in-a-string.cpp └── NOTES.md ├── 0440-k-th-smallest-in-lexicographical-order ├── 0440-k-th-smallest-in-lexicographical-order.cpp ├── NOTES.md └── README.md ├── 0442-find-all-duplicates-in-an-array ├── 0442-find-all-duplicates-in-an-array.cpp ├── NOTES.md └── README.md ├── 0443-string-compression └── 0443-string-compression.cpp ├── 0445-add-two-numbers-ii └── NOTES.md ├── 0446-arithmetic-slices-ii-subsequence ├── 0446-arithmetic-slices-ii-subsequence.cpp ├── NOTES.md └── README.md ├── 0451-sort-characters-by-frequency ├── NOTES.md └── README.md ├── 0452-minimum-number-of-arrows-to-burst-balloons ├── 0452-minimum-number-of-arrows-to-burst-balloons.cpp └── NOTES.md ├── 0455-assign-cookies ├── 0455-assign-cookies.cpp ├── NOTES.md └── README.md ├── 0456-132-pattern ├── 0456-132-pattern.cpp ├── NOTES.md └── README.md ├── 0458-poor-pigs ├── 0458-poor-pigs.cpp ├── NOTES.md └── README.md ├── 0459-repeated-substring-pattern ├── 0459-repeated-substring-pattern.cpp ├── NOTES.md └── README.md ├── 0460-lfu-cache └── NOTES.md ├── 0463-island-perimeter ├── 0463-island-perimeter.cpp ├── NOTES.md └── README.md ├── 0472-concatenated-words ├── 0472-concatenated-words.cpp ├── NOTES.md └── README.md ├── 0476-number-complement ├── 0476-number-complement.cpp └── README.md ├── 0491-non-decreasing-subsequences ├── 0491-non-decreasing-subsequences.cpp ├── NOTES.md └── README.md ├── 0494-target-sum ├── 0494-target-sum.cpp └── README.md ├── 0496-next-greater-element-i ├── 0496-next-greater-element-i.cpp └── NOTES.md ├── 0500-keyboard-row ├── 0500-keyboard-row.cpp └── NOTES.md ├── 0501-find-mode-in-binary-search-tree ├── 0501-find-mode-in-binary-search-tree.cpp ├── NOTES.md └── README.md ├── 0502-ipo ├── 0502-ipo.cpp ├── NOTES.md └── README.md ├── 0506-relative-ranks ├── 0506-relative-ranks.cpp ├── NOTES.md └── README.md ├── 0509-fibonacci-number ├── 0509-fibonacci-number.cpp └── README.md ├── 0513-find-bottom-left-tree-value ├── 0513-find-bottom-left-tree-value.cpp ├── NOTES.md └── README.md ├── 0514-freedom-trail ├── 0514-freedom-trail.cpp ├── NOTES.md └── README.md ├── 0515-find-largest-value-in-each-tree-row ├── 0515-find-largest-value-in-each-tree-row.cpp ├── NOTES.md └── README.md ├── 0516-longest-palindromic-subsequence └── 0516-longest-palindromic-subsequence.cpp ├── 0518-coin-change-ii ├── 0518-coin-change-ii.cpp ├── NOTES.md └── README.md ├── 0520-detect-capital ├── 0520-detect-capital.cpp ├── NOTES.md └── README.md ├── 0523-continuous-subarray-sum ├── 0523-continuous-subarray-sum.cpp ├── NOTES.md └── README.md ├── 0525-contiguous-array ├── 0525-contiguous-array.cpp ├── NOTES.md └── README.md ├── 0530-minimum-absolute-difference-in-bst ├── 0530-minimum-absolute-difference-in-bst.cpp └── NOTES.md ├── 0539-minimum-time-difference └── README.md ├── 0540-single-element-in-a-sorted-array ├── 0540-single-element-in-a-sorted-array.cpp └── NOTES.md ├── 0542-01-matrix ├── NOTES.md └── README.md ├── 0543-diameter-of-binary-tree ├── 0543-diameter-of-binary-tree.cpp ├── NOTES.md └── README.md ├── 0547-number-of-provinces ├── 0547-number-of-provinces.cpp ├── NOTES.md └── README.md ├── 0557-reverse-words-in-a-string-iii ├── 0557-reverse-words-in-a-string-iii.cpp ├── NOTES.md └── README.md ├── 0564-find-the-closest-palindrome ├── 0564-find-the-closest-palindrome.cpp ├── NOTES.md └── README.md ├── 0566-reshape-the-matrix ├── 0566-reshape-the-matrix.cpp ├── NOTES.md └── README.md ├── 0567-permutation-in-string ├── 0567-permutation-in-string.cpp └── NOTES.md ├── 0575-distribute-candies ├── 0575-distribute-candies.cpp ├── NOTES.md └── README.md ├── 0576-out-of-boundary-paths ├── 0576-out-of-boundary-paths.cpp ├── NOTES.md └── README.md ├── 0589-n-ary-tree-preorder-traversal ├── 0589-n-ary-tree-preorder-traversal.cpp ├── NOTES.md └── README.md ├── 0590-n-ary-tree-postorder-traversal ├── 0590-n-ary-tree-postorder-traversal.cpp ├── NOTES.md └── README.md ├── 0592-fraction-addition-and-subtraction ├── 0592-fraction-addition-and-subtraction.cpp ├── NOTES.md └── README.md ├── 0605-can-place-flowers ├── 0605-can-place-flowers.cpp ├── NOTES.md └── README.md ├── 0606-construct-string-from-binary-tree ├── 0606-construct-string-from-binary-tree.cpp ├── NOTES.md └── README.md ├── 0621-task-scheduler ├── 0621-task-scheduler.cpp ├── NOTES.md └── README.md ├── 0623-add-one-row-to-tree ├── 0623-add-one-row-to-tree.cpp ├── NOTES.md └── README.md ├── 0624-maximum-distance-in-arrays ├── 0624-maximum-distance-in-arrays.cpp ├── NOTES.md └── README.md ├── 0628-maximum-product-of-three-numbers ├── 0628-maximum-product-of-three-numbers.cpp └── NOTES.md ├── 0629-k-inverse-pairs-array ├── 0629-k-inverse-pairs-array.cpp ├── NOTES.md └── README.md ├── 0632-smallest-range-covering-elements-from-k-lists ├── 0632-smallest-range-covering-elements-from-k-lists.cpp ├── NOTES.md └── README.md ├── 0641-design-circular-deque ├── 0641-design-circular-deque.cpp ├── NOTES.md └── README.md ├── 0645-set-mismatch ├── 0645-set-mismatch.cpp └── README.md ├── 0646-maximum-length-of-pair-chain ├── 0646-maximum-length-of-pair-chain.cpp ├── NOTES.md └── README.md ├── 0647-palindromic-substrings ├── 0647-palindromic-substrings.cpp ├── NOTES.md └── README.md ├── 0648-replace-words ├── 0648-replace-words.cpp ├── NOTES.md └── README.md ├── 0649-dota2-senate ├── 0649-dota2-senate.cpp └── NOTES.md ├── 0650-2-keys-keyboard ├── 0650-2-keys-keyboard.cpp ├── NOTES.md └── README.md ├── 0652-find-duplicate-subtrees ├── 0652-find-duplicate-subtrees.cpp └── NOTES.md ├── 0661-image-smoother ├── 0661-image-smoother.cpp ├── NOTES.md └── README.md ├── 0662-maximum-width-of-binary-tree ├── 0662-maximum-width-of-binary-tree.cpp └── README.md ├── 0664-strange-printer ├── 0664-strange-printer.cpp ├── NOTES.md └── README.md ├── 0670-maximum-swap ├── 0670-maximum-swap.cpp └── README.md ├── 0673-number-of-longest-increasing-subsequence ├── 0673-number-of-longest-increasing-subsequence.cpp └── README.md ├── 0678-valid-parenthesis-string ├── 0678-valid-parenthesis-string.cpp ├── NOTES.md └── README.md ├── 0684-redundant-connection ├── 0684-redundant-connection.cpp └── README.md ├── 0688-knight-probability-in-chessboard ├── 0688-knight-probability-in-chessboard.cpp └── README.md ├── 0689-maximum-sum-of-3-non-overlapping-subarrays ├── 0689-maximum-sum-of-3-non-overlapping-subarrays.cpp └── README.md ├── 0692-top-k-frequent-words ├── 0692-top-k-frequent-words.cpp └── NOTES.md ├── 0703-kth-largest-element-in-a-stream ├── 0703-kth-largest-element-in-a-stream.cpp ├── NOTES.md └── README.md ├── 0704-binary-search ├── 0704-binary-search.cpp └── README.md ├── 0705-design-hashset ├── 0705-design-hashset.cpp └── README.md ├── 0706-design-hashmap ├── 0706-design-hashmap.cpp ├── NOTES.md └── README.md ├── 0709-to-lower-case ├── 0709-to-lower-case.cpp └── NOTES.md ├── 0712-minimum-ascii-delete-sum-for-two-strings ├── 0712-minimum-ascii-delete-sum-for-two-strings.cpp └── NOTES.md ├── 0713-subarray-product-less-than-k ├── 0713-subarray-product-less-than-k.cpp ├── NOTES.md └── README.md ├── 0714-best-time-to-buy-and-sell-stock-with-transaction-fee ├── 0714-best-time-to-buy-and-sell-stock-with-transaction-fee.cpp └── README.md ├── 0719-find-k-th-smallest-pair-distance └── README.md ├── 0724-find-pivot-index ├── 0724-find-pivot-index.cpp └── NOTES.md ├── 0725-split-linked-list-in-parts ├── 0725-split-linked-list-in-parts.cpp ├── NOTES.md └── README.md ├── 0726-number-of-atoms ├── 0726-number-of-atoms.cpp ├── NOTES.md └── README.md ├── 0728-self-dividing-numbers ├── 0728-self-dividing-numbers.cpp ├── NOTES.md └── README.md ├── 0729-my-calendar-i ├── 0729-my-calendar-i.cpp ├── NOTES.md └── README.md ├── 0731-my-calendar-ii ├── 0731-my-calendar-ii.cpp ├── NOTES.md └── README.md ├── 0733-flood-fill ├── 0733-flood-fill.cpp ├── NOTES.md └── README.md ├── 0735-asteroid-collision └── README.md ├── 0739-daily-temperatures ├── 0739-daily-temperatures.cpp ├── NOTES.md └── README.md ├── 0744-find-smallest-letter-greater-than-target ├── 0744-find-smallest-letter-greater-than-target.cpp └── NOTES.md ├── 0746-min-cost-climbing-stairs ├── 0746-min-cost-climbing-stairs.cpp ├── NOTES.md └── README.md ├── 0762-prime-number-of-set-bits-in-binary-representation ├── 0762-prime-number-of-set-bits-in-binary-representation.cpp └── NOTES.md ├── 0766-toeplitz-matrix ├── 0766-toeplitz-matrix.cpp └── NOTES.md ├── 0767-reorganize-string ├── NOTES.md └── README.md ├── 0768-partition-labels ├── 0768-partition-labels.cpp └── README.md ├── 0779-k-th-symbol-in-grammar ├── 0779-k-th-symbol-in-grammar.cpp ├── NOTES.md └── README.md ├── 0780-max-chunks-to-make-sorted ├── 0780-max-chunks-to-make-sorted.cpp └── README.md ├── 0783-minimum-distance-between-bst-nodes └── README.md ├── 0785-is-graph-bipartite ├── 0785-is-graph-bipartite.cpp ├── NOTES.md └── README.md ├── 0787-cheapest-flights-within-k-stops ├── 0787-cheapest-flights-within-k-stops.cpp └── NOTES.md ├── 0787-sliding-puzzle ├── 0787-sliding-puzzle.cpp └── README.md ├── 0791-custom-sort-string ├── 0791-custom-sort-string.cpp ├── NOTES.md └── README.md ├── 0797-rabbits-in-forest ├── 0797-rabbits-in-forest.cpp └── README.md ├── 0799-champagne-tower ├── 0799-champagne-tower.cpp ├── NOTES.md └── README.md ├── 0802-find-eventual-safe-states ├── 0802-find-eventual-safe-states.cpp └── README.md ├── 0806-domino-and-tromino-tiling ├── 0806-domino-and-tromino-tiling.cpp └── README.md ├── 0806-number-of-lines-to-write-string ├── 0806-number-of-lines-to-write-string.cpp ├── NOTES.md └── README.md ├── 0807-max-increase-to-keep-city-skyline ├── 0807-max-increase-to-keep-city-skyline.cpp ├── NOTES.md └── README.md ├── 0808-soup-servings ├── 0808-soup-servings.cpp └── NOTES.md ├── 0812-rotate-string ├── 0812-rotate-string.cpp └── README.md ├── 0815-bus-routes ├── 0815-bus-routes.cpp ├── NOTES.md └── README.md ├── 0820-find-eventual-safe-states ├── 0820-find-eventual-safe-states.cpp └── README.md ├── 0821-shortest-distance-to-a-character ├── 0821-shortest-distance-to-a-character.cpp ├── NOTES.md └── README.md ├── 0823-binary-trees-with-factors ├── 0823-binary-trees-with-factors.cpp ├── NOTES.md └── README.md ├── 0826-most-profit-assigning-work ├── 0826-most-profit-assigning-work.cpp ├── NOTES.md └── README.md ├── 0834-sum-of-distances-in-tree ├── 0834-sum-of-distances-in-tree.cpp ├── NOTES.md └── README.md ├── 0837-new-21-game ├── 0837-new-21-game.cpp ├── NOTES.md └── README.md ├── 0839-similar-string-groups ├── 0839-similar-string-groups.cpp └── NOTES.md ├── 0840-magic-squares-in-grid ├── NOTES.md └── README.md ├── 0844-backspace-string-compare ├── 0844-backspace-string-compare.cpp ├── NOTES.md └── README.md ├── 0845-longest-mountain-in-array ├── 0845-longest-mountain-in-array.cpp ├── NOTES.md └── README.md ├── 0846-hand-of-straights ├── 0846-hand-of-straights.cpp ├── NOTES.md └── README.md ├── 0847-shortest-path-visiting-all-nodes ├── 0847-shortest-path-visiting-all-nodes.cpp ├── NOTES.md └── README.md ├── 0852-peak-index-in-a-mountain-array ├── 0852-peak-index-in-a-mountain-array.cpp ├── NOTES.md └── README.md ├── 0854-making-a-large-island ├── 0854-making-a-large-island.cpp └── README.md ├── 0857-minimum-cost-to-hire-k-workers ├── 0857-minimum-cost-to-hire-k-workers.cpp ├── NOTES.md └── README.md ├── 0859-buddy-strings └── 0859-buddy-strings.cpp ├── 0860-lemonade-change ├── 0860-lemonade-change.cpp ├── NOTES.md └── README.md ├── 0861-score-after-flipping-matrix ├── 0861-score-after-flipping-matrix.cpp ├── NOTES.md └── README.md ├── 0863-all-nodes-distance-k-in-binary-tree ├── 0863-all-nodes-distance-k-in-binary-tree.cpp └── NOTES.md ├── 0864-shortest-path-to-get-all-keys └── README.md ├── 0867-transpose-matrix ├── 0867-transpose-matrix.cpp ├── NOTES.md └── README.md ├── 0872-leaf-similar-trees ├── 0872-leaf-similar-trees.cpp └── NOTES.md ├── 0874-walking-robot-simulation ├── 0874-walking-robot-simulation.cpp └── README.md ├── 0875-koko-eating-bananas ├── 0875-koko-eating-bananas.cpp └── README.md ├── 0876-middle-of-the-linked-list ├── 0876-middle-of-the-linked-list.cpp ├── NOTES.md └── README.md ├── 0879-profitable-schemes ├── 0879-profitable-schemes.cpp ├── NOTES.md └── README.md ├── 0880-decoded-string-at-index ├── 0880-decoded-string-at-index.cpp └── README.md ├── 0881-boats-to-save-people ├── 0881-boats-to-save-people.cpp ├── NOTES.md └── README.md ├── 0883-projection-area-of-3d-shapes ├── 0883-projection-area-of-3d-shapes.cpp └── NOTES.md ├── 0884-uncommon-words-from-two-sentences ├── 0884-uncommon-words-from-two-sentences.cpp ├── NOTES.md └── README.md ├── 0885-spiral-matrix-iii ├── 0885-spiral-matrix-iii.cpp ├── NOTES.md └── README.md ├── 0892-shortest-subarray-with-sum-at-least-k ├── 0892-shortest-subarray-with-sum-at-least-k.cpp └── README.md ├── 0894-all-possible-full-binary-trees ├── 0894-all-possible-full-binary-trees.cpp ├── NOTES.md └── README.md ├── 0896-monotonic-array ├── 0896-monotonic-array.cpp ├── NOTES.md └── README.md ├── 0904-fruit-into-baskets ├── 0904-fruit-into-baskets.cpp └── NOTES.md ├── 0905-length-of-longest-fibonacci-subsequence ├── 0905-length-of-longest-fibonacci-subsequence.cpp └── README.md ├── 0905-sort-array-by-parity ├── 0905-sort-array-by-parity.cpp ├── NOTES.md └── README.md ├── 0907-sum-of-subarray-minimums ├── 0907-sum-of-subarray-minimums.cpp ├── NOTES.md └── README.md ├── 0908-smallest-range-i ├── 0908-smallest-range-i.cpp └── NOTES.md ├── 0909-snakes-and-ladders ├── 0909-snakes-and-ladders.cpp └── NOTES.md ├── 0912-sort-an-array ├── 0912-sort-an-array.cpp └── NOTES.md ├── 0918-maximum-sum-circular-subarray ├── 0918-maximum-sum-circular-subarray.cpp └── NOTES.md ├── 0920-number-of-music-playlists ├── 0920-number-of-music-playlists.cpp ├── NOTES.md └── README.md ├── 0921-minimum-add-to-make-parentheses-valid ├── 0921-minimum-add-to-make-parentheses-valid.cpp ├── NOTES.md └── README.md ├── 0922-sort-array-by-parity-ii ├── 0922-sort-array-by-parity-ii.cpp └── NOTES.md ├── 0925-construct-binary-tree-from-preorder-and-postorder-traversal ├── 0925-construct-binary-tree-from-preorder-and-postorder-traversal.cpp └── README.md ├── 0926-flip-string-to-monotone-increasing ├── 0926-flip-string-to-monotone-increasing.cpp ├── NOTES.md └── README.md ├── 0929-unique-email-addresses ├── 0929-unique-email-addresses.cpp ├── NOTES.md └── README.md ├── 0930-binary-subarrays-with-sum ├── 0930-binary-subarrays-with-sum.cpp ├── NOTES.md └── README.md ├── 0931-minimum-falling-path-sum ├── 0931-minimum-falling-path-sum.cpp ├── NOTES.md └── README.md ├── 0933-number-of-recent-calls ├── 0933-number-of-recent-calls.cpp └── NOTES.md ├── 0934-shortest-bridge ├── 0934-shortest-bridge.cpp ├── NOTES.md └── README.md ├── 0935-knight-dialer ├── 0935-knight-dialer.cpp ├── NOTES.md └── README.md ├── 0938-range-sum-of-bst ├── 0938-range-sum-of-bst.cpp ├── NOTES.md └── README.md ├── 0942-di-string-match ├── 0942-di-string-match.cpp ├── NOTES.md └── README.md ├── 0944-delete-columns-to-make-sorted ├── 0944-delete-columns-to-make-sorted.cpp └── README.md ├── 0945-minimum-increment-to-make-array-unique ├── 0945-minimum-increment-to-make-array-unique.cpp ├── NOTES.md └── README.md ├── 0945-snakes-and-ladders └── README.md ├── 0946-validate-stack-sequences ├── 0946-validate-stack-sequences.cpp ├── NOTES.md └── README.md ├── 0947-most-stones-removed-with-same-row-or-column ├── 0947-most-stones-removed-with-same-row-or-column.cpp ├── NOTES.md └── README.md ├── 0950-reveal-cards-in-increasing-order ├── 0950-reveal-cards-in-increasing-order.cpp ├── NOTES.md └── README.md ├── 0951-flip-equivalent-binary-trees ├── NOTES.md └── README.md ├── 0953-verifying-an-alien-dictionary ├── 0953-verifying-an-alien-dictionary.cpp └── NOTES.md ├── 0956-tallest-billboard ├── 0956-tallest-billboard.cpp └── NOTES.md ├── 0958-check-completeness-of-a-binary-tree ├── 0958-check-completeness-of-a-binary-tree.cpp ├── NOTES.md └── README.md ├── 0959-regions-cut-by-slashes ├── 0959-regions-cut-by-slashes.cpp ├── NOTES.md └── README.md ├── 0961-n-repeated-element-in-size-2n-array ├── 0961-n-repeated-element-in-size-2n-array.cpp ├── NOTES.md └── README.md ├── 0962-maximum-width-ramp ├── 0962-maximum-width-ramp.cpp └── README.md ├── 0965-univalued-binary-tree └── NOTES.md ├── 0974-subarray-sums-divisible-by-k ├── 0974-subarray-sums-divisible-by-k.cpp ├── NOTES.md └── README.md ├── 0976-largest-perimeter-triangle ├── 0976-largest-perimeter-triangle.cpp └── NOTES.md ├── 0977-squares-of-a-sorted-array ├── 0977-squares-of-a-sorted-array.cpp ├── NOTES.md └── README.md ├── 0979-distribute-coins-in-binary-tree ├── 0979-distribute-coins-in-binary-tree.cpp ├── NOTES.md └── README.md ├── 0983-minimum-cost-for-tickets ├── 0983-minimum-cost-for-tickets.cpp ├── NOTES.md └── README.md ├── 0988-smallest-string-starting-from-leaf ├── 0988-smallest-string-starting-from-leaf.cpp ├── NOTES.md └── README.md ├── 0989-add-to-array-form-of-integer └── README.md ├── 0992-subarrays-with-k-different-integers ├── 0992-subarrays-with-k-different-integers.cpp ├── NOTES.md └── README.md ├── 0995-minimum-number-of-k-consecutive-bit-flips ├── 0995-minimum-number-of-k-consecutive-bit-flips.cpp ├── NOTES.md └── README.md ├── 0997-find-the-town-judge ├── 0997-find-the-town-judge.cpp └── NOTES.md ├── 0999-available-captures-for-rook └── 0999-available-captures-for-rook.cpp ├── 1-two-sum ├── 1-two-sum.cpp ├── NOTES.md └── README.md ├── 1. Missing number in array - GFG └── 1.-missing-number-in-array.cpp ├── 100-same-tree ├── 100-same-tree.cpp ├── NOTES.md └── README.md ├── 1002-find-common-characters ├── 1002-find-common-characters.cpp └── NOTES.md ├── 1007-minimum-domino-rotations-for-equal-row ├── 1007-minimum-domino-rotations-for-equal-row.cpp ├── NOTES.md └── README.md ├── 1008-construct-binary-search-tree-from-preorder-traversal ├── 1008-construct-binary-search-tree-from-preorder-traversal.cpp └── README.md ├── 1009-complement-of-base-10-integer ├── 1009-complement-of-base-10-integer.cpp ├── NOTES.md └── README.md ├── 101-symmetric-tree ├── 101-symmetric-tree.cpp ├── NOTES.md └── README.md ├── 1011-capacity-to-ship-packages-within-d-days ├── 1011-capacity-to-ship-packages-within-d-days.cpp ├── NOTES.md └── README.md ├── 102-binary-tree-level-order-traversal ├── 102-binary-tree-level-order-traversal.cpp ├── NOTES.md └── README.md ├── 1020-number-of-enclaves ├── 1020-number-of-enclaves.cpp ├── NOTES.md └── README.md ├── 1021-remove-outermost-parentheses ├── 1021-remove-outermost-parentheses.cpp └── NOTES.md ├── 1022-sum-of-root-to-leaf-binary-numbers ├── 1022-sum-of-root-to-leaf-binary-numbers.cpp ├── NOTES.md └── README.md ├── 1025-minimum-cost-for-tickets ├── 1025-minimum-cost-for-tickets.cpp └── README.md ├── 1026-maximum-difference-between-node-and-ancestor ├── 1026-maximum-difference-between-node-and-ancestor.cpp ├── NOTES.md └── README.md ├── 1027-longest-arithmetic-subsequence ├── 1027-longest-arithmetic-subsequence.cpp └── README.md ├── 1029-two-city-scheduling ├── 1029-two-city-scheduling.cpp ├── NOTES.md └── README.md ├── 103-binary-tree-zigzag-level-order-traversal ├── 103-binary-tree-zigzag-level-order-traversal.cpp ├── NOTES.md └── README.md ├── 1030-matrix-cells-in-distance-order └── 1030-matrix-cells-in-distance-order.cpp ├── 1035-uncrossed-lines ├── 1035-uncrossed-lines.cpp └── NOTES.md ├── 1038-binary-search-tree-to-greater-sum-tree ├── 1038-binary-search-tree-to-greater-sum-tree.cpp ├── NOTES.md └── README.md ├── 104-maximum-depth-of-binary-tree ├── NOTES.md └── README.md ├── 1041-robot-bounded-in-circle ├── 1041-robot-bounded-in-circle.cpp ├── NOTES.md └── README.md ├── 1043-partition-array-for-maximum-sum ├── 1043-partition-array-for-maximum-sum.cpp ├── NOTES.md └── README.md ├── 1046-last-stone-weight ├── 1046-last-stone-weight.cpp ├── NOTES.md └── README.md ├── 1047-remove-all-adjacent-duplicates-in-string ├── 1047-remove-all-adjacent-duplicates-in-string.cpp ├── NOTES.md └── README.md ├── 1048-longest-string-chain ├── 1048-longest-string-chain.cpp └── README.md ├── 1049-minimum-domino-rotations-for-equal-row ├── 1049-minimum-domino-rotations-for-equal-row.cpp └── README.md ├── 105-construct-binary-tree-from-preorder-and-inorder-traversal ├── 105-construct-binary-tree-from-preorder-and-inorder-traversal.cpp ├── NOTES.md └── README.md ├── 1050-actors-and-directors-who-cooperated-at-least-three-times ├── 1050-actors-and-directors-who-cooperated-at-least-three-times.sql ├── NOTES.md └── README.md ├── 1051-height-checker ├── 1051-height-checker.cpp ├── NOTES.md └── README.md ├── 1052-grumpy-bookstore-owner ├── NOTES.md └── README.md ├── 1058-lexicographically-smallest-equivalent-string ├── 1058-lexicographically-smallest-equivalent-string.cpp └── README.md ├── 106-construct-binary-tree-from-inorder-and-postorder-traversal ├── 106-construct-binary-tree-from-inorder-and-postorder-traversal.cpp └── README.md ├── 1061-lexicographically-smallest-equivalent-string ├── 1061-lexicographically-smallest-equivalent-string.cpp ├── NOTES.md └── README.md ├── 1063-best-sightseeing-pair ├── 1063-best-sightseeing-pair.cpp └── README.md ├── 1071-greatest-common-divisor-of-strings ├── 1071-greatest-common-divisor-of-strings.cpp └── README.md ├── 1074-number-of-submatrices-that-sum-to-target ├── 1074-number-of-submatrices-that-sum-to-target.cpp ├── NOTES.md └── README.md ├── 108-convert-sorted-array-to-binary-search-tree ├── 108-convert-sorted-array-to-binary-search-tree.cpp ├── NOTES.md └── README.md ├── 1084-sales-analysis-iii ├── 1084-sales-analysis-iii.sql ├── NOTES.md └── README.md ├── 1091-shortest-path-in-binary-matrix ├── 1091-shortest-path-in-binary-matrix.cpp ├── NOTES.md └── README.md ├── 1093-recover-a-tree-from-preorder-traversal ├── 1093-recover-a-tree-from-preorder-traversal.cpp └── README.md ├── 1094-car-pooling ├── 1094-car-pooling.cpp ├── NOTES.md └── README.md ├── 1095-find-in-mountain-array ├── 1095-find-in-mountain-array.cpp ├── NOTES.md └── README.md ├── 11-container-with-most-water ├── 11-container-with-most-water.cpp ├── NOTES.md └── README.md ├── 110-balanced-binary-tree ├── 110-balanced-binary-tree.cpp ├── NOTES.md └── README.md ├── 1105-filling-bookcase-shelves ├── 1105-filling-bookcase-shelves.cpp ├── NOTES.md └── README.md ├── 1106-parsing-a-boolean-expression ├── 1106-parsing-a-boolean-expression.cpp ├── NOTES.md └── README.md ├── 1110-delete-nodes-and-return-forest ├── 1110-delete-nodes-and-return-forest.cpp ├── NOTES.md └── README.md ├── 1114-print-in-order ├── 1114-print-in-order.cpp ├── NOTES.md └── README.md ├── 1122-relative-sort-array ├── 1122-relative-sort-array.cpp ├── NOTES.md └── README.md ├── 1125-smallest-sufficient-team ├── 1125-smallest-sufficient-team.cpp └── NOTES.md ├── 1129-shortest-path-with-alternating-colors ├── 1129-shortest-path-with-alternating-colors.cpp ├── NOTES.md └── README.md ├── 1137-n-th-tribonacci-number ├── 1137-n-th-tribonacci-number.cpp └── NOTES.md ├── 114-flatten-binary-tree-to-linked-list ├── 114-flatten-binary-tree-to-linked-list.cpp ├── NOTES.md └── README.md ├── 1140-stone-game-ii ├── 1140-stone-game-ii.cpp ├── NOTES.md └── README.md ├── 1141-user-activity-for-the-past-30-days-i ├── 1141-user-activity-for-the-past-30-days-i.sql └── NOTES.md ├── 1143-longest-common-subsequence ├── 1143-longest-common-subsequence.cpp ├── NOTES.md └── README.md ├── 1146-snapshot-array ├── 1146-snapshot-array.cpp ├── NOTES.md └── README.md ├── 1147-flip-columns-for-maximum-number-of-equal-rows ├── 1147-flip-columns-for-maximum-number-of-equal-rows.cpp └── README.md ├── 1148-article-views-i ├── 1148-article-views-i.sql ├── NOTES.md └── README.md ├── 1155-number-of-dice-rolls-with-target-sum ├── 1155-number-of-dice-rolls-with-target-sum.cpp ├── NOTES.md └── README.md ├── 1158-market-analysis-i ├── 1158-market-analysis-i.sql ├── NOTES.md └── README.md ├── 116-populating-next-right-pointers-in-each-node └── 116-populating-next-right-pointers-in-each-node.cpp ├── 1160-find-words-that-can-be-formed-by-characters ├── 1160-find-words-that-can-be-formed-by-characters.cpp └── NOTES.md ├── 1160-letter-tile-possibilities └── README.md ├── 1161-maximum-level-sum-of-a-binary-tree ├── 1161-maximum-level-sum-of-a-binary-tree.cpp └── README.md ├── 1162-as-far-from-land-as-possible ├── 1162-as-far-from-land-as-possible.cpp ├── NOTES.md └── README.md ├── 117-populating-next-right-pointers-in-each-node-ii ├── 117-populating-next-right-pointers-in-each-node-ii.cpp ├── NOTES.md └── README.md ├── 1170-shortest-common-supersequence ├── 1170-shortest-common-supersequence.cpp └── README.md ├── 1171-remove-zero-sum-consecutive-nodes-from-linked-list ├── 1171-remove-zero-sum-consecutive-nodes-from-linked-list.cpp ├── NOTES.md └── README.md ├── 1179-reformat-department-table ├── 1179-reformat-department-table.sql ├── NOTES.md └── README.md ├── 118-pascals-triangle ├── 118-pascals-triangle.cpp ├── NOTES.md └── README.md ├── 1187-make-array-strictly-increasing ├── 1187-make-array-strictly-increasing.cpp └── NOTES.md ├── 1189-maximum-number-of-balloons ├── 1189-maximum-number-of-balloons.cpp ├── NOTES.md └── README.md ├── 1190-reverse-substrings-between-each-pair-of-parentheses ├── 1190-reverse-substrings-between-each-pair-of-parentheses.cpp ├── NOTES.md └── README.md ├── 1192-critical-connections-in-a-network ├── 1192-critical-connections-in-a-network.cpp ├── NOTES.md └── README.md ├── 1201-ugly-number-iii ├── 1201-ugly-number-iii.cpp ├── NOTES.md └── README.md ├── 1202-smallest-string-with-swaps ├── 1202-smallest-string-with-swaps.cpp ├── NOTES.md └── README.md ├── 1203-sort-items-by-groups-respecting-dependencies ├── 1203-sort-items-by-groups-respecting-dependencies.cpp ├── NOTES.md └── README.md ├── 1207-unique-number-of-occurrences ├── 1207-unique-number-of-occurrences.cpp ├── NOTES.md └── README.md ├── 1208-get-equal-substrings-within-budget ├── 1208-get-equal-substrings-within-budget.cpp ├── NOTES.md └── README.md ├── 1209-remove-all-adjacent-duplicates-in-string-ii ├── 1209-remove-all-adjacent-duplicates-in-string-ii.cpp ├── NOTES.md └── README.md ├── 121-best-time-to-buy-and-sell-stock ├── 121-best-time-to-buy-and-sell-stock.cpp ├── NOTES.md └── README.md ├── 1218-longest-arithmetic-subsequence-of-given-difference ├── 1218-longest-arithmetic-subsequence-of-given-difference.cpp └── README.md ├── 1218-lowest-common-ancestor-of-deepest-leaves ├── 1218-lowest-common-ancestor-of-deepest-leaves.cpp └── README.md ├── 1219-path-with-maximum-gold ├── 1219-path-with-maximum-gold.cpp ├── NOTES.md └── README.md ├── 1220-count-vowels-permutation ├── 1220-count-vowels-permutation.cpp ├── NOTES.md └── README.md ├── 1221-split-a-string-in-balanced-strings ├── 1221-split-a-string-in-balanced-strings.cpp ├── NOTES.md └── README.md ├── 1227-number-of-equivalent-domino-pairs ├── 1227-number-of-equivalent-domino-pairs.cpp └── README.md ├── 1232-check-if-it-is-a-straight-line ├── 1232-check-if-it-is-a-straight-line.cpp ├── NOTES.md └── README.md ├── 1233-remove-sub-folders-from-the-filesystem ├── 1233-remove-sub-folders-from-the-filesystem.cpp ├── NOTES.md └── README.md ├── 1235-maximum-profit-in-job-scheduling ├── 1235-maximum-profit-in-job-scheduling.cpp ├── NOTES.md └── README.md ├── 1239-maximum-length-of-a-concatenated-string-with-unique-characters ├── 1239-maximum-length-of-a-concatenated-string-with-unique-characters.cpp ├── NOTES.md └── README.md ├── 124-binary-tree-maximum-path-sum ├── 124-binary-tree-maximum-path-sum.cpp ├── NOTES.md └── README.md ├── 1248-count-number-of-nice-subarrays ├── 1248-count-number-of-nice-subarrays.cpp ├── NOTES.md └── README.md ├── 1249-minimum-remove-to-make-valid-parentheses ├── 1249-minimum-remove-to-make-valid-parentheses.cpp ├── NOTES.md └── README.md ├── 125-valid-palindrome └── 125-valid-palindrome.cpp ├── 1252-cells-with-odd-values-in-a-matrix ├── 1252-cells-with-odd-values-in-a-matrix.cpp └── NOTES.md ├── 1254-number-of-closed-islands ├── 1254-number-of-closed-islands.cpp ├── NOTES.md └── README.md ├── 1255-maximum-score-words-formed-by-letters ├── 1255-maximum-score-words-formed-by-letters.cpp ├── NOTES.md └── README.md ├── 1260-shift-2d-grid ├── 1260-shift-2d-grid.cpp ├── NOTES.md └── README.md ├── 1261-find-elements-in-a-contaminated-binary-tree └── NOTES.md ├── 1266-minimum-time-visiting-all-points ├── 1266-minimum-time-visiting-all-points.cpp ├── NOTES.md └── README.md ├── 1268-search-suggestions-system ├── 1268-search-suggestions-system.cpp ├── NOTES.md └── README.md ├── 1269-number-of-ways-to-stay-in-the-same-place-after-some-steps ├── 1269-number-of-ways-to-stay-in-the-same-place-after-some-steps.cpp ├── NOTES.md └── README.md ├── 127-word-ladder ├── 127-word-ladder.cpp ├── NOTES.md └── README.md ├── 1277-count-square-submatrices-with-all-ones └── README.md ├── 128-longest-consecutive-sequence ├── 128-longest-consecutive-sequence.cpp ├── NOTES.md └── README.md ├── 1281-subtract-the-product-and-sum-of-digits-of-an-integer ├── 1281-subtract-the-product-and-sum-of-digits-of-an-integer.cpp ├── NOTES.md └── README.md ├── 1282-group-the-people-given-the-group-size-they-belong-to ├── 1282-group-the-people-given-the-group-size-they-belong-to.cpp ├── NOTES.md └── README.md ├── 1283-find-the-smallest-divisor-given-a-threshold ├── 1283-find-the-smallest-divisor-given-a-threshold.cpp ├── NOTES.md └── README.md ├── 1287-element-appearing-more-than-25-in-sorted-array ├── 1287-element-appearing-more-than-25-in-sorted-array.cpp ├── NOTES.md └── README.md ├── 1288-remove-covered-intervals ├── 1288-remove-covered-intervals.cpp └── NOTES.md ├── 1289-minimum-falling-path-sum-ii ├── 1289-minimum-falling-path-sum-ii.cpp ├── NOTES.md └── README.md ├── 1290-convert-binary-number-in-a-linked-list-to-integer ├── 1290-convert-binary-number-in-a-linked-list-to-integer.cpp ├── NOTES.md └── README.md ├── 1291-sequential-digits ├── 1291-sequential-digits.cpp ├── NOTES.md └── README.md ├── 1292-maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold ├── 1292-maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold.cpp ├── NOTES.md └── README.md ├── 1293-three-consecutive-odds ├── 1293-three-consecutive-odds.cpp └── README.md ├── 1295-find-numbers-with-even-number-of-digits ├── 1295-find-numbers-with-even-number-of-digits.cpp └── NOTES.md ├── 1299-replace-elements-with-greatest-element-on-right-side ├── 1299-replace-elements-with-greatest-element-on-right-side.cpp └── NOTES.md ├── 13-roman-to-integer ├── 13-roman-to-integer.cpp ├── NOTES.md └── README.md ├── 1300-sum-of-mutated-array-closest-to-target ├── 1300-sum-of-mutated-array-closest-to-target.cpp ├── NOTES.md └── README.md ├── 1302-deepest-leaves-sum ├── 1302-deepest-leaves-sum.cpp ├── NOTES.md └── README.md ├── 1304-find-n-unique-integers-sum-up-to-zero ├── 1304-find-n-unique-integers-sum-up-to-zero.cpp ├── NOTES.md └── README.md ├── 1305-all-elements-in-two-binary-search-trees ├── 1305-all-elements-in-two-binary-search-trees.cpp ├── NOTES.md └── README.md ├── 1306-jump-game-iii └── NOTES.md ├── 1309-decrypt-string-from-alphabet-to-integer-mapping ├── 1309-decrypt-string-from-alphabet-to-integer-mapping.cpp ├── NOTES.md └── README.md ├── 131-palindrome-partitioning ├── 131-palindrome-partitioning.cpp ├── NOTES.md └── README.md ├── 1310-xor-queries-of-a-subarray ├── 1310-xor-queries-of-a-subarray.cpp ├── NOTES.md └── README.md ├── 1312-minimum-insertion-steps-to-make-a-string-palindrome ├── 1312-minimum-insertion-steps-to-make-a-string-palindrome.cpp ├── NOTES.md └── README.md ├── 1315-sum-of-nodes-with-even-valued-grandparent ├── 1315-sum-of-nodes-with-even-valued-grandparent.cpp └── NOTES.md ├── 1318-minimum-flips-to-make-a-or-b-equal-to-c ├── 1318-minimum-flips-to-make-a-or-b-equal-to-c.cpp └── NOTES.md ├── 1319-number-of-operations-to-make-network-connected ├── 1319-number-of-operations-to-make-network-connected.cpp ├── NOTES.md └── README.md ├── 1323-maximum-69-number ├── 1323-maximum-69-number.cpp ├── NOTES.md └── README.md ├── 1325-delete-leaves-with-a-given-value ├── 1325-delete-leaves-with-a-given-value.cpp ├── NOTES.md └── README.md ├── 133-clone-graph ├── 133-clone-graph.cpp └── NOTES.md ├── 1331-rank-transform-of-an-array ├── 1331-rank-transform-of-an-array.cpp ├── NOTES.md └── README.md ├── 1332-remove-palindromic-subsequences ├── 1332-remove-palindromic-subsequences.cpp └── NOTES.md ├── 1334-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance ├── NOTES.md └── README.md ├── 1335-maximum-candies-allocated-to-k-children ├── 1335-maximum-candies-allocated-to-k-children.cpp └── README.md ├── 1335-minimum-difficulty-of-a-job-schedule ├── 1335-minimum-difficulty-of-a-job-schedule.cpp ├── NOTES.md └── README.md ├── 1337-the-k-weakest-rows-in-a-matrix ├── 1337-the-k-weakest-rows-in-a-matrix.cpp ├── NOTES.md └── README.md ├── 1338-reduce-array-size-to-the-half ├── 1338-reduce-array-size-to-the-half.cpp ├── NOTES.md └── README.md ├── 134-gas-station ├── 134-gas-station.cpp ├── NOTES.md └── README.md ├── 1342-number-of-steps-to-reduce-a-number-to-zero ├── 1342-number-of-steps-to-reduce-a-number-to-zero.cpp ├── NOTES.md └── README.md ├── 1345-jump-game-iv ├── 1345-jump-game-iv.cpp ├── NOTES.md └── README.md ├── 1346-check-if-n-and-its-double-exist ├── 1346-check-if-n-and-its-double-exist.cpp ├── NOTES.md └── README.md ├── 1347-minimum-number-of-steps-to-make-two-strings-anagram ├── 1347-minimum-number-of-steps-to-make-two-strings-anagram.cpp ├── NOTES.md └── README.md ├── 135-candy ├── 135-candy.cpp ├── NOTES.md └── README.md ├── 1351-count-negative-numbers-in-a-sorted-matrix ├── 1351-count-negative-numbers-in-a-sorted-matrix.cpp ├── NOTES.md └── README.md ├── 1354-construct-target-array-with-multiple-sums ├── 1354-construct-target-array-with-multiple-sums.cpp └── README.md ├── 1356-sort-integers-by-the-number-of-1-bits ├── 1356-sort-integers-by-the-number-of-1-bits.cpp ├── NOTES.md └── README.md ├── 1359-count-all-valid-pickup-and-delivery-options ├── 1359-count-all-valid-pickup-and-delivery-options.cpp ├── NOTES.md └── README.md ├── 136-single-number ├── 136-single-number.cpp ├── NOTES.md └── README.md ├── 1361-validate-binary-tree-nodes ├── 1361-validate-binary-tree-nodes.cpp ├── NOTES.md └── README.md ├── 1364-tuple-with-same-product ├── 1364-tuple-with-same-product.cpp └── README.md ├── 1367-linked-list-in-binary-tree ├── 1367-linked-list-in-binary-tree.cpp ├── NOTES.md └── README.md ├── 1370-increasing-decreasing-string ├── 1370-increasing-decreasing-string.cpp └── README.md ├── 1371-find-the-longest-substring-containing-vowels-in-even-counts ├── 1371-find-the-longest-substring-containing-vowels-in-even-counts.cpp ├── NOTES.md └── README.md ├── 1372-longest-zigzag-path-in-a-binary-tree ├── 1372-longest-zigzag-path-in-a-binary-tree.cpp ├── NOTES.md └── README.md ├── 1373-maximum-sum-bst-in-binary-tree └── NOTES.md ├── 1374-generate-a-string-with-characters-that-have-odd-counts ├── 1374-generate-a-string-with-characters-that-have-odd-counts.cpp ├── NOTES.md └── README.md ├── 1376-time-needed-to-inform-all-employees ├── 1376-time-needed-to-inform-all-employees.cpp ├── NOTES.md └── README.md ├── 1378-replace-employee-id-with-the-unique-identifier ├── 1378-replace-employee-id-with-the-unique-identifier.sql ├── NOTES.md └── README.md ├── 1379-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree ├── 1379-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree.cpp ├── NOTES.md └── README.md ├── 138-copy-list-with-random-pointer ├── 138-copy-list-with-random-pointer.cpp ├── NOTES.md └── README.md ├── 1380-lucky-numbers-in-a-matrix ├── 1380-lucky-numbers-in-a-matrix.cpp └── NOTES.md ├── 1381-design-a-stack-with-increment-operation ├── 1381-design-a-stack-with-increment-operation.cpp ├── NOTES.md └── README.md ├── 1382-balance-a-binary-search-tree ├── 1382-balance-a-binary-search-tree.cpp ├── NOTES.md └── README.md ├── 1383-maximum-performance-of-a-team ├── 1383-maximum-performance-of-a-team.cpp ├── NOTES.md └── README.md ├── 1385-find-the-distance-value-between-two-arrays ├── 1385-find-the-distance-value-between-two-arrays.cpp ├── NOTES.md └── README.md ├── 1387-find-elements-in-a-contaminated-binary-tree ├── 1387-find-elements-in-a-contaminated-binary-tree.cpp └── README.md ├── 139-word-break ├── 139-word-break.cpp ├── NOTES.md └── README.md ├── 1393-capital-gain-loss ├── 1393-capital-gain-loss.sql ├── NOTES.md └── README.md ├── 1394-find-lucky-integer-in-an-array ├── 1394-find-lucky-integer-in-an-array.cpp ├── NOTES.md └── README.md ├── 1395-count-number-of-teams └── README.md ├── 1396-count-servers-that-communicate ├── 1396-count-servers-that-communicate.cpp └── README.md ├── 1396-design-underground-system ├── 1396-design-underground-system.cpp ├── NOTES.md └── README.md ├── 1399-count-largest-group ├── 1399-count-largest-group.cpp └── NOTES.md ├── 14-longest-common-prefix ├── 14-longest-common-prefix.cpp ├── NOTES.md └── README.md ├── 1402-reducing-dishes ├── 1402-reducing-dishes.cpp └── NOTES.md ├── 1403-minimum-subsequence-in-non-increasing-order ├── 1403-minimum-subsequence-in-non-increasing-order.cpp └── NOTES.md ├── 1404-number-of-steps-to-reduce-a-number-in-binary-representation-to-one ├── 1404-number-of-steps-to-reduce-a-number-in-binary-representation-to-one.cpp ├── NOTES.md └── README.md ├── 1405-longest-happy-string ├── 1405-longest-happy-string.cpp └── README.md ├── 1406-stone-game-iii ├── 1406-stone-game-iii.cpp ├── NOTES.md └── README.md ├── 1407-top-travellers ├── 1407-top-travellers.sql ├── NOTES.md └── README.md ├── 141-linked-list-cycle ├── 141-linked-list-cycle.cpp ├── NOTES.md └── README.md ├── 1416-restore-the-array └── NOTES.md ├── 142-linked-list-cycle-ii ├── 142-linked-list-cycle-ii.cpp └── NOTES.md ├── 1420-build-array-where-you-can-find-the-maximum-exactly-k-comparisons ├── NOTES.md └── README.md ├── 1421-find-numbers-with-even-number-of-digits ├── 1421-find-numbers-with-even-number-of-digits.cpp └── README.md ├── 1422-maximum-score-after-splitting-a-string ├── 1422-maximum-score-after-splitting-a-string.cpp ├── NOTES.md └── README.md ├── 1423-maximum-points-you-can-obtain-from-cards ├── 1423-maximum-points-you-can-obtain-from-cards.cpp └── NOTES.md ├── 1424-diagonal-traverse-ii ├── NOTES.md └── README.md ├── 1424-maximum-candies-you-can-get-from-boxes ├── 1424-maximum-candies-you-can-get-from-boxes.cpp └── README.md ├── 1425-constrained-subsequence-sum ├── 1425-constrained-subsequence-sum.cpp ├── NOTES.md └── README.md ├── 143-reorder-list ├── 143-reorder-list.cpp ├── NOTES.md └── README.md ├── 1431-kids-with-the-greatest-number-of-candies ├── 1431-kids-with-the-greatest-number-of-candies.cpp ├── NOTES.md └── README.md ├── 1436-destination-city ├── 1436-destination-city.cpp ├── NOTES.md └── README.md ├── 1438-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit ├── 1438-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit.cpp ├── NOTES.md └── README.md ├── 144-binary-tree-preorder-traversal ├── 144-binary-tree-preorder-traversal.cpp └── NOTES.md ├── 1441-build-an-array-with-stack-operations ├── 1441-build-an-array-with-stack-operations.cpp ├── NOTES.md └── README.md ├── 1442-count-triplets-that-can-form-two-arrays-of-equal-xor ├── 1442-count-triplets-that-can-form-two-arrays-of-equal-xor.cpp ├── NOTES.md └── README.md ├── 1443-minimum-time-to-collect-all-apples-in-a-tree ├── 1443-minimum-time-to-collect-all-apples-in-a-tree.cpp └── NOTES.md ├── 1444-number-of-ways-of-cutting-a-pizza └── NOTES.md ├── 1448-count-good-nodes-in-binary-tree ├── 1448-count-good-nodes-in-binary-tree.cpp ├── NOTES.md └── README.md ├── 145-binary-tree-postorder-traversal ├── 145-binary-tree-postorder-traversal.cpp └── README.md ├── 1450-number-of-students-doing-homework-at-a-given-time ├── 1450-number-of-students-doing-homework-at-a-given-time.cpp ├── NOTES.md └── README.md ├── 1456-maximum-number-of-vowels-in-a-substring-of-given-length ├── 1456-maximum-number-of-vowels-in-a-substring-of-given-length.cpp ├── NOTES.md └── README.md ├── 1457-pseudo-palindromic-paths-in-a-binary-tree ├── 1457-pseudo-palindromic-paths-in-a-binary-tree.cpp ├── NOTES.md └── README.md ├── 1458-max-dot-product-of-two-subsequences ├── 1458-max-dot-product-of-two-subsequences.cpp ├── NOTES.md └── README.md ├── 146-lru-cache ├── 146-lru-cache.cpp └── NOTES.md ├── 1460-make-two-arrays-equal-by-reversing-subarrays ├── 1460-make-two-arrays-equal-by-reversing-subarrays.cpp ├── NOTES.md └── README.md ├── 1460-number-of-substrings-containing-all-three-characters ├── 1460-number-of-substrings-containing-all-three-characters.cpp └── README.md ├── 1461-check-if-a-string-contains-all-binary-codes-of-size-k ├── 1461-check-if-a-string-contains-all-binary-codes-of-size-k.cpp └── NOTES.md ├── 1463-cherry-pickup-ii ├── 1463-cherry-pickup-ii.cpp ├── NOTES.md └── README.md ├── 1464-maximum-product-of-two-elements-in-an-array ├── 1464-maximum-product-of-two-elements-in-an-array.cpp ├── NOTES.md └── README.md ├── 1465-maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts ├── 1465-maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts.cpp └── NOTES.md ├── 1466-reorder-routes-to-make-all-paths-lead-to-the-city-zero ├── 1466-reorder-routes-to-make-all-paths-lead-to-the-city-zero.cpp ├── NOTES.md └── README.md ├── 1468-check-if-n-and-its-double-exist ├── 1468-check-if-n-and-its-double-exist.cpp └── README.md ├── 1470-shuffle-the-array ├── 1470-shuffle-the-array.cpp └── NOTES.md ├── 1472-design-browser-history ├── 1472-design-browser-history.cpp ├── NOTES.md └── README.md ├── 1473-paint-house-iii ├── 1473-paint-house-iii.cpp ├── NOTES.md └── README.md ├── 1475-final-prices-with-a-special-discount-in-a-shop ├── 1475-final-prices-with-a-special-discount-in-a-shop.cpp └── NOTES.md ├── 1477-product-of-the-last-k-numbers ├── 1477-product-of-the-last-k-numbers.cpp └── README.md ├── 148-sort-list ├── 148-sort-list.cpp ├── NOTES.md └── README.md ├── 1480-running-sum-of-1d-array ├── 1480-running-sum-of-1d-array.cpp ├── NOTES.md └── README.md ├── 1481-least-number-of-unique-integers-after-k-removals ├── 1481-least-number-of-unique-integers-after-k-removals.cpp ├── NOTES.md └── README.md ├── 1482-minimum-number-of-days-to-make-m-bouquets ├── 1482-minimum-number-of-days-to-make-m-bouquets.cpp ├── NOTES.md └── README.md ├── 1484-group-sold-products-by-the-date ├── 1484-group-sold-products-by-the-date.sql ├── NOTES.md └── README.md ├── 1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid ├── 1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid.cpp └── README.md ├── 1488-avoid-flood-in-the-city ├── 1488-avoid-flood-in-the-city.cpp ├── NOTES.md └── README.md ├── 1489-find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree ├── 1489-find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree.cpp ├── NOTES.md └── README.md ├── 1491-average-salary-excluding-the-minimum-and-maximum-salary ├── 1491-average-salary-excluding-the-minimum-and-maximum-salary.cpp ├── NOTES.md └── README.md ├── 1493-longest-subarray-of-1s-after-deleting-one-element ├── 1493-longest-subarray-of-1s-after-deleting-one-element.cpp ├── NOTES.md └── README.md ├── 1496-path-crossing ├── 1496-path-crossing.cpp ├── NOTES.md └── README.md ├── 1497-check-if-array-pairs-are-divisible-by-k ├── 1497-check-if-array-pairs-are-divisible-by-k.cpp ├── NOTES.md └── README.md ├── 1498-number-of-subsequences-that-satisfy-the-given-sum-condition ├── 1498-number-of-subsequences-that-satisfy-the-given-sum-condition.cpp ├── NOTES.md └── README.md ├── 150-evaluate-reverse-polish-notation ├── 150-evaluate-reverse-polish-notation.cpp └── NOTES.md ├── 1500-count-largest-group ├── 1500-count-largest-group.cpp └── README.md ├── 1502-can-make-arithmetic-progression-from-sequence ├── 1502-can-make-arithmetic-progression-from-sequence.cpp ├── NOTES.md └── README.md ├── 1502-construct-k-palindrome-strings ├── 1502-construct-k-palindrome-strings.cpp └── README.md ├── 1503-last-moment-before-all-ants-fall-out-of-a-plank ├── 1503-last-moment-before-all-ants-fall-out-of-a-plank.cpp ├── NOTES.md └── README.md ├── 1508-range-sum-of-sorted-subarray-sums ├── 1508-range-sum-of-sorted-subarray-sums.cpp ├── NOTES.md └── README.md ├── 1509-minimum-difference-between-largest-and-smallest-value-in-three-moves ├── 1509-minimum-difference-between-largest-and-smallest-value-in-three-moves.cpp ├── NOTES.md └── README.md ├── 1510-stone-game-iv ├── 1510-stone-game-iv.cpp └── NOTES.md ├── 1512-number-of-good-pairs ├── 1512-number-of-good-pairs.cpp ├── NOTES.md └── README.md ├── 1514-path-with-maximum-probability ├── 1514-path-with-maximum-probability.cpp └── NOTES.md ├── 1516-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n ├── 1516-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n.cpp └── README.md ├── 1518-water-bottles ├── 1518-water-bottles.cpp ├── NOTES.md └── README.md ├── 1519-number-of-nodes-in-the-sub-tree-with-the-same-label ├── 1519-number-of-nodes-in-the-sub-tree-with-the-same-label.cpp └── NOTES.md ├── 152-maximum-product-subarray ├── 152-maximum-product-subarray.cpp ├── NOTES.md └── README.md ├── 1523-count-odd-numbers-in-an-interval-range ├── 1523-count-odd-numbers-in-an-interval-range.cpp ├── NOTES.md └── README.md ├── 1524-string-matching-in-an-array ├── 1524-string-matching-in-an-array.cpp └── README.md ├── 1527-patients-with-a-condition ├── 1527-patients-with-a-condition.sql ├── NOTES.md └── README.md ├── 153-find-minimum-in-rotated-sorted-array ├── 153-find-minimum-in-rotated-sorted-array.cpp ├── NOTES.md └── README.md ├── 1530-number-of-good-leaf-nodes-pairs ├── NOTES.md └── README.md ├── 1531-string-compression-ii ├── 1531-string-compression-ii.cpp ├── NOTES.md └── README.md ├── 1534-count-good-triplets ├── 1534-count-good-triplets.cpp └── README.md ├── 1535-find-the-winner-of-an-array-game ├── 1535-find-the-winner-of-an-array-game.cpp ├── NOTES.md └── README.md ├── 1537-maximum-score-after-splitting-a-string ├── 1537-maximum-score-after-splitting-a-string.cpp └── README.md ├── 1539-kth-missing-positive-number ├── 1539-kth-missing-positive-number.cpp ├── NOTES.md └── README.md ├── 154-find-minimum-in-rotated-sorted-array-ii ├── 154-find-minimum-in-rotated-sorted-array-ii.cpp ├── NOTES.md └── README.md ├── 1544-make-the-string-great ├── 1544-make-the-string-great.cpp ├── NOTES.md └── README.md ├── 1545-find-kth-bit-in-nth-binary-string ├── 1545-find-kth-bit-in-nth-binary-string.cpp └── README.md ├── 1547-minimum-cost-to-cut-a-stick ├── 1547-minimum-cost-to-cut-a-stick.cpp └── NOTES.md ├── 155-min-stack ├── 155-min-stack.cpp ├── NOTES.md └── README.md ├── 1550-three-consecutive-odds ├── 1550-three-consecutive-odds.cpp └── NOTES.md ├── 1551-minimum-operations-to-make-array-equal ├── 1551-minimum-operations-to-make-array-equal.cpp └── NOTES.md ├── 1552-magnetic-force-between-two-balls ├── 1552-magnetic-force-between-two-balls.cpp ├── NOTES.md └── README.md ├── 1557-minimum-number-of-vertices-to-reach-all-nodes ├── 1557-minimum-number-of-vertices-to-reach-all-nodes.cpp ├── NOTES.md └── README.md ├── 1558-course-schedule-iv ├── 1558-course-schedule-iv.cpp └── README.md ├── 1561-maximum-number-of-coins-you-can-get ├── 1561-maximum-number-of-coins-you-can-get.cpp ├── NOTES.md └── README.md ├── 1562-find-latest-group-of-size-m ├── 1562-find-latest-group-of-size-m.cpp ├── NOTES.md └── README.md ├── 1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence ├── 1566-check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence.cpp └── README.md ├── 1568-minimum-number-of-days-to-disconnect-island ├── 1568-minimum-number-of-days-to-disconnect-island.cpp ├── NOTES.md └── README.md ├── 1570-final-prices-with-a-special-discount-in-a-shop ├── 1570-final-prices-with-a-special-discount-in-a-shop.cpp └── README.md ├── 1572-matrix-diagonal-sum ├── 1572-matrix-diagonal-sum.cpp ├── NOTES.md └── README.md ├── 1574-shortest-subarray-to-be-removed-to-make-array-sorted ├── 1574-shortest-subarray-to-be-removed-to-make-array-sorted.cpp ├── NOTES.md └── README.md ├── 1575-count-all-possible-routes ├── 1575-count-all-possible-routes.cpp └── NOTES.md ├── 1578-minimum-time-to-make-rope-colorful ├── 1578-minimum-time-to-make-rope-colorful.cpp ├── NOTES.md └── README.md ├── 1579-remove-max-number-of-edges-to-keep-graph-fully-traversable ├── 1579-remove-max-number-of-edges-to-keep-graph-fully-traversable.cpp ├── NOTES.md └── README.md ├── 1581-customer-who-visited-but-did-not-make-any-transactions ├── 1581-customer-who-visited-but-did-not-make-any-transactions.sql ├── NOTES.md └── README.md ├── 1582-special-positions-in-a-binary-matrix ├── 1582-special-positions-in-a-binary-matrix.cpp ├── NOTES.md └── README.md ├── 1584-min-cost-to-connect-all-points ├── 1584-min-cost-to-connect-all-points.cpp ├── NOTES.md └── README.md ├── 1587-bank-account-summary-ii ├── 1587-bank-account-summary-ii.sql ├── NOTES.md └── README.md ├── 1588-sum-of-all-odd-length-subarrays ├── 1588-sum-of-all-odd-length-subarrays.cpp ├── NOTES.md └── README.md ├── 1590-make-sum-divisible-by-p ├── 1590-make-sum-divisible-by-p.cpp ├── NOTES.md └── README.md ├── 1593-split-a-string-into-the-max-number-of-unique-substrings ├── 1593-split-a-string-into-the-max-number-of-unique-substrings.cpp └── README.md ├── 1598-crawler-log-folder ├── 1598-crawler-log-folder.cpp ├── NOTES.md └── README.md ├── 16-3sum-closest ├── NOTES.md └── README.md ├── 160-intersection-of-two-linked-lists ├── 160-intersection-of-two-linked-lists.cpp ├── NOTES.md └── README.md ├── 1601-maximum-number-of-achievable-transfer-requests ├── 1601-maximum-number-of-achievable-transfer-requests.cpp └── README.md ├── 1603-design-parking-system ├── 1603-design-parking-system.cpp ├── NOTES.md └── README.md ├── 1605-find-valid-matrix-given-row-and-column-sums ├── 1605-find-valid-matrix-given-row-and-column-sums.cpp ├── NOTES.md └── README.md ├── 1608-special-array-with-x-elements-greater-than-or-equal-x ├── 1608-special-array-with-x-elements-greater-than-or-equal-x.cpp ├── NOTES.md └── README.md ├── 1609-even-odd-tree ├── 1609-even-odd-tree.cpp ├── NOTES.md └── README.md ├── 1611-minimum-one-bit-operations-to-make-integers-zero ├── 1611-minimum-one-bit-operations-to-make-integers-zero.cpp ├── NOTES.md └── README.md ├── 1614-maximum-nesting-depth-of-the-parentheses ├── 1614-maximum-nesting-depth-of-the-parentheses.cpp ├── NOTES.md └── README.md ├── 1615-maximal-network-rank ├── 1615-maximal-network-rank.cpp ├── NOTES.md └── README.md ├── 1619-mean-of-array-after-removing-some-elements ├── 1619-mean-of-array-after-removing-some-elements.cpp ├── NOTES.md └── README.md ├── 162-find-peak-element ├── 162-find-peak-element.cpp ├── NOTES.md └── README.md ├── 1624-largest-substring-between-two-equal-characters ├── 1624-largest-substring-between-two-equal-characters.cpp ├── NOTES.md └── README.md ├── 1626-best-team-with-no-conflicts ├── 1626-best-team-with-no-conflicts.cpp └── README.md ├── 1630-arithmetic-subarrays ├── 1630-arithmetic-subarrays.cpp ├── NOTES.md └── README.md ├── 1631-number-of-sub-arrays-with-odd-sum ├── 1631-number-of-sub-arrays-with-odd-sum.cpp └── README.md ├── 1631-path-with-minimum-effort ├── 1631-path-with-minimum-effort.cpp ├── NOTES.md └── README.md ├── 1636-sort-array-by-increasing-frequency ├── 1636-sort-array-by-increasing-frequency.cpp └── NOTES.md ├── 1637-widest-vertical-area-between-two-points-containing-no-points ├── 1637-widest-vertical-area-between-two-points-containing-no-points.cpp ├── NOTES.md └── README.md ├── 1639-number-of-ways-to-form-a-target-string-given-a-dictionary ├── 1639-number-of-ways-to-form-a-target-string-given-a-dictionary.cpp └── NOTES.md ├── 1641-count-sorted-vowel-strings ├── NOTES.md └── README.md ├── 1642-furthest-building-you-can-reach ├── 1642-furthest-building-you-can-reach.cpp ├── NOTES.md └── README.md ├── 1647-minimum-deletions-to-make-character-frequencies-unique ├── 1647-minimum-deletions-to-make-character-frequencies-unique.cpp ├── NOTES.md └── README.md ├── 1648-sell-diminishing-valued-colored-balls ├── 1648-sell-diminishing-valued-colored-balls.cpp ├── NOTES.md └── README.md ├── 165-compare-version-numbers └── NOTES.md ├── 1653-minimum-deletions-to-make-string-balanced ├── 1653-minimum-deletions-to-make-string-balanced.cpp ├── NOTES.md └── README.md ├── 1654-minimum-jumps-to-reach-home ├── 1654-minimum-jumps-to-reach-home.cpp ├── NOTES.md └── README.md ├── 1656-count-good-triplets └── README.md ├── 1656-design-an-ordered-stream ├── 1656-design-an-ordered-stream.cpp ├── NOTES.md └── README.md ├── 1657-determine-if-two-strings-are-close ├── 1657-determine-if-two-strings-are-close.cpp ├── NOTES.md └── README.md ├── 1658-minimum-operations-to-reduce-x-to-zero ├── 1658-minimum-operations-to-reduce-x-to-zero.cpp ├── NOTES.md └── README.md ├── 1662-check-if-two-string-arrays-are-equivalent ├── 1662-check-if-two-string-arrays-are-equivalent.cpp ├── NOTES.md └── README.md ├── 1663-smallest-string-with-a-given-numeric-value ├── 1663-smallest-string-with-a-given-numeric-value.cpp ├── NOTES.md └── README.md ├── 1667-fix-names-in-a-table ├── 1667-fix-names-in-a-table.sql └── NOTES.md ├── 1669-merge-in-between-linked-lists ├── 1669-merge-in-between-linked-lists.cpp ├── NOTES.md └── README.md ├── 167-two-sum-ii-input-array-is-sorted ├── 167-two-sum-ii-input-array-is-sorted.cpp ├── NOTES.md └── README.md ├── 1671-minimum-number-of-removals-to-make-mountain-array ├── 1671-minimum-number-of-removals-to-make-mountain-array.cpp ├── NOTES.md └── README.md ├── 1672-richest-customer-wealth ├── 1672-richest-customer-wealth.cpp ├── NOTES.md └── README.md ├── 1675-minimize-deviation-in-array ├── 1675-minimize-deviation-in-array.cpp ├── NOTES.md └── README.md ├── 1678-goal-parser-interpretation ├── 1678-goal-parser-interpretation.cpp ├── NOTES.md └── README.md ├── 1679-max-number-of-k-sum-pairs ├── 1679-max-number-of-k-sum-pairs.cpp ├── NOTES.md └── README.md ├── 1679-shortest-subarray-to-be-removed-to-make-array-sorted ├── 1679-shortest-subarray-to-be-removed-to-make-array-sorted.cpp └── README.md ├── 1684-count-the-number-of-consistent-strings ├── 1684-count-the-number-of-consistent-strings.cpp ├── NOTES.md └── README.md ├── 1685-sum-of-absolute-differences-in-a-sorted-array ├── 1685-sum-of-absolute-differences-in-a-sorted-array.cpp ├── NOTES.md └── README.md ├── 1688-count-of-matches-in-tournament ├── 1688-count-of-matches-in-tournament.cpp ├── NOTES.md └── README.md ├── 1689-partitioning-into-minimum-number-of-deci-binary-numbers ├── 1689-partitioning-into-minimum-number-of-deci-binary-numbers.cpp ├── NOTES.md └── README.md ├── 169-majority-element ├── 169-majority-element.cpp └── NOTES.md ├── 1693-daily-leads-and-partners ├── 1693-daily-leads-and-partners.sql ├── NOTES.md └── README.md ├── 1695-maximum-erasure-value ├── 1695-maximum-erasure-value.cpp ├── NOTES.md └── README.md ├── 1696-jump-game-vi ├── 1696-jump-game-vi.cpp └── README.md ├── 1697-checking-existence-of-edge-length-limited-paths ├── 1697-checking-existence-of-edge-length-limited-paths.cpp └── NOTES.md ├── 17-letter-combinations-of-a-phone-number ├── 17-letter-combinations-of-a-phone-number.cpp ├── NOTES.md └── README.md ├── 1700-number-of-students-unable-to-eat-lunch ├── 1700-number-of-students-unable-to-eat-lunch.cpp ├── NOTES.md └── README.md ├── 1701-average-waiting-time ├── 1701-average-waiting-time.cpp ├── NOTES.md └── README.md ├── 1704-determine-if-string-halves-are-alike ├── 1704-determine-if-string-halves-are-alike.cpp ├── NOTES.md └── README.md ├── 1706-where-will-the-ball-fall ├── 1706-where-will-the-ball-fall.cpp ├── NOTES.md └── README.md ├── 171-excel-sheet-column-number └── 171-excel-sheet-column-number.cpp ├── 1710-maximum-units-on-a-truck ├── 1710-maximum-units-on-a-truck.cpp ├── NOTES.md └── README.md ├── 1712-ways-to-split-array-into-three-subarrays ├── 1712-ways-to-split-array-into-three-subarrays.cpp ├── NOTES.md └── README.md ├── 1716-calculate-money-in-leetcode-bank ├── 1716-calculate-money-in-leetcode-bank.cpp └── NOTES.md ├── 1717-maximum-score-from-removing-substrings └── README.md ├── 1721-swapping-nodes-in-a-linked-list ├── 1721-swapping-nodes-in-a-linked-list.cpp ├── NOTES.md └── README.md ├── 1725-number-of-rectangles-that-can-form-the-largest-square ├── NOTES.md └── README.md ├── 1727-largest-submatrix-with-rearrangements ├── 1727-largest-submatrix-with-rearrangements.cpp ├── NOTES.md └── README.md ├── 1729-find-followers-count ├── 1729-find-followers-count.sql ├── NOTES.md └── README.md ├── 173-binary-search-tree-iterator ├── 173-binary-search-tree-iterator.cpp ├── NOTES.md └── README.md ├── 1732-find-the-highest-altitude ├── 1732-find-the-highest-altitude.cpp └── NOTES.md ├── 1741-find-total-time-spent-by-each-employee ├── 1741-find-total-time-spent-by-each-employee.sql ├── NOTES.md └── README.md ├── 1742-maximum-number-of-balls-in-a-box ├── 1742-maximum-number-of-balls-in-a-box.cpp └── NOTES.md ├── 1743-restore-the-array-from-adjacent-pairs ├── 1743-restore-the-array-from-adjacent-pairs.cpp ├── NOTES.md └── README.md ├── 1744-number-of-ways-to-form-a-target-string-given-a-dictionary ├── 1744-number-of-ways-to-form-a-target-string-given-a-dictionary.cpp └── README.md ├── 175-combine-two-tables ├── 175-combine-two-tables.sql ├── NOTES.md └── README.md ├── 1750-minimum-length-of-string-after-deleting-similar-ends ├── 1750-minimum-length-of-string-after-deleting-similar-ends.cpp ├── NOTES.md └── README.md ├── 1751-maximum-number-of-events-that-can-be-attended-ii ├── 1751-maximum-number-of-events-that-can-be-attended-ii.cpp ├── NOTES.md └── README.md ├── 1753-maximum-score-from-removing-stones ├── 1753-maximum-score-from-removing-stones.cpp └── NOTES.md ├── 1755-defuse-the-bomb ├── 1755-defuse-the-bomb.cpp └── README.md ├── 1757-recyclable-and-low-fat-products ├── 1757-recyclable-and-low-fat-products.sql ├── NOTES.md └── README.md ├── 1758-minimum-changes-to-make-alternating-binary-string └── README.md ├── 1759-count-number-of-homogenous-substrings ├── 1759-count-number-of-homogenous-substrings.cpp ├── NOTES.md └── README.md ├── 176-second-highest-salary ├── 176-second-highest-salary.sql ├── NOTES.md └── README.md ├── 1760-minimum-limit-of-balls-in-a-bag ├── 1760-minimum-limit-of-balls-in-a-bag.cpp ├── NOTES.md └── README.md ├── 1768-merge-strings-alternately ├── 1768-merge-strings-alternately.cpp ├── NOTES.md └── README.md ├── 1769-minimum-number-of-operations-to-move-all-balls-to-each-box ├── 1769-minimum-number-of-operations-to-move-all-balls-to-each-box.cpp └── NOTES.md ├── 1773-count-items-matching-a-rule ├── 1773-count-items-matching-a-rule.cpp ├── NOTES.md └── README.md ├── 1779-find-nearest-point-that-has-the-same-x-or-y-coordinate ├── 1779-find-nearest-point-that-has-the-same-x-or-y-coordinate.cpp ├── NOTES.md └── README.md ├── 1790-check-if-one-string-swap-can-make-strings-equal ├── 1790-check-if-one-string-swap-can-make-strings-equal.cpp ├── NOTES.md └── README.md ├── 1791-find-center-of-star-graph ├── 1791-find-center-of-star-graph.cpp ├── NOTES.md └── README.md ├── 1793-maximum-score-of-a-good-subarray ├── 1793-maximum-score-of-a-good-subarray.cpp ├── NOTES.md └── README.md ├── 1795-rearrange-products-table ├── 1795-rearrange-products-table.sql ├── NOTES.md └── README.md ├── 1797-design-authentication-manager ├── 1797-design-authentication-manager.cpp ├── NOTES.md └── README.md ├── 1799-maximize-score-after-n-operations ├── 1799-maximize-score-after-n-operations.cpp └── NOTES.md ├── 18-4sum ├── NOTES.md └── README.md ├── 1800-maximum-ascending-subarray-sum ├── 1800-maximum-ascending-subarray-sum.cpp ├── NOTES.md └── README.md ├── 1802-maximum-value-at-a-given-index-in-a-bounded-array ├── 1802-maximum-value-at-a-given-index-in-a-bounded-array.cpp ├── NOTES.md └── README.md ├── 1812-determine-color-of-a-chessboard-square ├── 1812-determine-color-of-a-chessboard-square.cpp └── NOTES.md ├── 1813-sentence-similarity-iii ├── 1813-sentence-similarity-iii.cpp ├── NOTES.md └── README.md ├── 1818-minimum-absolute-sum-difference ├── 1818-minimum-absolute-sum-difference.cpp ├── NOTES.md └── README.md ├── 1819-construct-the-lexicographically-largest-valid-sequence └── README.md ├── 182-duplicate-emails ├── 182-duplicate-emails.sql ├── NOTES.md └── README.md ├── 1822-sign-of-the-product-of-an-array ├── 1822-sign-of-the-product-of-an-array.cpp ├── NOTES.md └── README.md ├── 1823-find-the-winner-of-the-circular-game ├── 1823-find-the-winner-of-the-circular-game.cpp ├── NOTES.md └── README.md ├── 1827-minimum-operations-to-make-the-array-increasing ├── 1827-minimum-operations-to-make-the-array-increasing.cpp └── NOTES.md ├── 183-customers-who-never-order ├── 183-customers-who-never-order.sql ├── NOTES.md └── README.md ├── 1832-check-if-the-sentence-is-pangram ├── 1832-check-if-the-sentence-is-pangram.cpp └── README.md ├── 1833-maximum-ice-cream-bars ├── 1833-maximum-ice-cream-bars.cpp └── NOTES.md ├── 1837-sum-of-digits-in-base-k ├── 1837-sum-of-digits-in-base-k.cpp ├── NOTES.md └── README.md ├── 1838-frequency-of-the-most-frequent-element ├── 1838-frequency-of-the-most-frequent-element.cpp ├── NOTES.md └── README.md ├── 1845-seat-reservation-manager ├── 1845-seat-reservation-manager.cpp ├── NOTES.md └── README.md ├── 1846-maximum-element-after-decreasing-and-rearranging ├── 1846-maximum-element-after-decreasing-and-rearranging.cpp ├── NOTES.md └── README.md ├── 1849-maximum-absolute-sum-of-any-subarray ├── 1849-maximum-absolute-sum-of-any-subarray.cpp └── README.md ├── 1855-maximum-distance-between-a-pair-of-values ├── 1855-maximum-distance-between-a-pair-of-values.cpp ├── NOTES.md └── README.md ├── 1857-largest-color-value-in-a-directed-graph ├── 1857-largest-color-value-in-a-directed-graph.cpp └── README.md ├── 1859-sorting-the-sentence ├── 1859-sorting-the-sentence.cpp └── NOTES.md ├── 1863-sum-of-all-subset-xor-totals ├── 1863-sum-of-all-subset-xor-totals.cpp ├── NOTES.md └── README.md ├── 1870-minimum-speed-to-arrive-on-time ├── 1870-minimum-speed-to-arrive-on-time.cpp ├── NOTES.md └── README.md ├── 1873-calculate-special-bonus ├── 1873-calculate-special-bonus.sql ├── NOTES.md └── README.md ├── 1876-map-of-highest-peak ├── 1876-map-of-highest-peak.cpp └── README.md ├── 1877-minimize-maximum-pair-sum-in-array ├── 1877-minimize-maximum-pair-sum-in-array.cpp ├── NOTES.md └── README.md ├── 1878-check-if-array-is-sorted-and-rotated ├── 1878-check-if-array-is-sorted-and-rotated.cpp └── README.md ├── 188-best-time-to-buy-and-sell-stock-iv ├── 188-best-time-to-buy-and-sell-stock-iv.cpp ├── NOTES.md └── README.md ├── 1880-check-if-word-equals-summation-of-two-words ├── 1880-check-if-word-equals-summation-of-two-words.cpp └── NOTES.md ├── 1886-determine-whether-matrix-can-be-obtained-by-rotation ├── 1886-determine-whether-matrix-can-be-obtained-by-rotation.cpp ├── NOTES.md └── README.md ├── 1886-minimum-limit-of-balls-in-a-bag ├── 1886-minimum-limit-of-balls-in-a-bag.cpp └── README.md ├── 1887-reduction-operations-to-make-the-array-elements-equal ├── 1887-reduction-operations-to-make-the-array-elements-equal.cpp ├── NOTES.md └── README.md ├── 189-rotate-array ├── 189-rotate-array.cpp └── README.md ├── 1890-the-latest-login-in-2020 ├── 1890-the-latest-login-in-2020.sql ├── NOTES.md └── README.md ├── 1894-find-the-student-that-will-replace-the-chalk ├── 1894-find-the-student-that-will-replace-the-chalk.cpp ├── NOTES.md └── README.md ├── 1895-minimum-number-of-operations-to-move-all-balls-to-each-box ├── 1895-minimum-number-of-operations-to-move-all-balls-to-each-box.cpp └── README.md ├── 1897-redistribute-characters-to-make-all-strings-equal ├── 1897-redistribute-characters-to-make-all-strings-equal.cpp ├── NOTES.md └── README.md ├── 1898-maximum-number-of-removable-characters ├── 1898-maximum-number-of-removable-characters.cpp ├── NOTES.md └── README.md ├── 19-remove-nth-node-from-end-of-list ├── 19-remove-nth-node-from-end-of-list.cpp ├── NOTES.md └── README.md ├── 190-reverse-bits ├── 190-reverse-bits.cpp └── NOTES.md ├── 1901-find-a-peak-element-ii ├── 1901-find-a-peak-element-ii.cpp ├── NOTES.md └── README.md ├── 1903-largest-odd-number-in-string ├── 1903-largest-odd-number-in-string.cpp ├── NOTES.md └── README.md ├── 1905-count-sub-islands ├── 1905-count-sub-islands.cpp ├── NOTES.md └── README.md ├── 191-number-of-1-bits ├── 191-number-of-1-bits.cpp ├── NOTES.md └── README.md ├── 1913-maximum-product-difference-between-two-pairs ├── 1913-maximum-product-difference-between-two-pairs.cpp ├── NOTES.md └── README.md ├── 1915-check-if-one-string-swap-can-make-strings-equal ├── 1915-check-if-one-string-swap-can-make-strings-equal.cpp └── README.md ├── 1915-number-of-wonderful-substrings ├── 1915-number-of-wonderful-substrings.cpp ├── NOTES.md └── README.md ├── 1917-maximum-average-pass-ratio ├── 1917-maximum-average-pass-ratio.cpp └── README.md ├── 1921-eliminate-maximum-number-of-monsters ├── 1921-eliminate-maximum-number-of-monsters.cpp ├── NOTES.md └── README.md ├── 1925-count-square-sum-triples ├── 1925-count-square-sum-triples.cpp └── NOTES.md ├── 1927-maximum-ascending-subarray-sum ├── 1927-maximum-ascending-subarray-sum.cpp └── README.md ├── 1930-unique-length-3-palindromic-subsequences ├── 1930-unique-length-3-palindromic-subsequences.cpp ├── NOTES.md └── README.md ├── 1935-maximum-number-of-words-you-can-type ├── 1935-maximum-number-of-words-you-can-type.cpp ├── NOTES.md └── README.md ├── 1937-maximum-number-of-points-with-cost ├── NOTES.md └── README.md ├── 1940-maximum-xor-for-each-query ├── 1940-maximum-xor-for-each-query.cpp └── README.md ├── 1941-check-if-all-characters-have-equal-number-of-occurrences ├── 1941-check-if-all-characters-have-equal-number-of-occurrences.cpp └── NOTES.md ├── 1942-the-number-of-the-smallest-unoccupied-chair ├── 1942-the-number-of-the-smallest-unoccupied-chair.cpp ├── NOTES.md └── README.md ├── 1945-sum-of-digits-of-string-after-convert ├── 1945-sum-of-digits-of-string-after-convert.cpp ├── NOTES.md └── README.md ├── 1953-maximum-number-of-weeks-for-which-you-can-work ├── 1953-maximum-number-of-weeks-for-which-you-can-work.cpp └── README.md ├── 1957-delete-characters-to-make-fancy-string ├── 1957-delete-characters-to-make-fancy-string.cpp └── README.md ├── 196-delete-duplicate-emails ├── 196-delete-duplicate-emails.sql ├── NOTES.md └── README.md ├── 1962-remove-stones-to-minimize-the-total └── README.md ├── 1963-minimum-number-of-swaps-to-make-the-string-balanced ├── 1963-minimum-number-of-swaps-to-make-the-string-balanced.cpp └── README.md ├── 1964-find-the-longest-valid-obstacle-course-at-each-position ├── 1964-find-the-longest-valid-obstacle-course-at-each-position.cpp └── NOTES.md ├── 1965-employees-with-missing-information ├── 1965-employees-with-missing-information.sql ├── NOTES.md └── README.md ├── 1967-number-of-strings-that-appear-as-substrings-in-word ├── 1967-number-of-strings-that-appear-as-substrings-in-word.cpp └── NOTES.md ├── 197-rising-temperature ├── 197-rising-temperature.sql ├── NOTES.md └── README.md ├── 1970-last-day-where-you-can-still-cross ├── 1970-last-day-where-you-can-still-cross.cpp └── README.md ├── 1972-rotating-the-box ├── 1972-rotating-the-box.cpp └── README.md ├── 1974-minimum-time-to-type-word-using-special-typewriter ├── 1974-minimum-time-to-type-word-using-special-typewriter.cpp └── README.md ├── 198-house-robber ├── 198-house-robber.cpp ├── NOTES.md └── README.md ├── 1980-find-unique-binary-string ├── 1980-find-unique-binary-string.cpp ├── NOTES.md └── README.md ├── 1986-largest-color-value-in-a-directed-graph ├── 1986-largest-color-value-in-a-directed-graph.cpp └── README.md ├── 199-binary-tree-right-side-view ├── 199-binary-tree-right-side-view.cpp ├── NOTES.md └── README.md ├── 1991-find-the-middle-index-in-array ├── 1991-find-the-middle-index-in-array.cpp ├── NOTES.md └── README.md ├── 1992-find-all-groups-of-farmland ├── 1992-find-all-groups-of-farmland.cpp ├── NOTES.md └── README.md ├── 1993-sum-of-all-subset-xor-totals ├── 1993-sum-of-all-subset-xor-totals.cpp └── README.md ├── 1996-the-number-of-weak-characters-in-the-game ├── 1996-the-number-of-weak-characters-in-the-game.cpp ├── NOTES.md └── README.md ├── 2-add-two-numbers ├── 2-add-two-numbers.cpp ├── NOTES.md └── README.md ├── 2. Trailing zeroes in factorial - GFG └── README.md ├── 20-valid-parentheses ├── 20-valid-parentheses.cpp └── README.md ├── 200-number-of-islands ├── 200-number-of-islands.cpp ├── NOTES.md └── README.md ├── 2000-reverse-prefix-of-word ├── 2000-reverse-prefix-of-word.cpp ├── NOTES.md └── README.md ├── 2006-count-number-of-pairs-with-absolute-difference-k ├── 2006-count-number-of-pairs-with-absolute-difference-k.cpp ├── NOTES.md └── README.md ├── 2007-find-original-array-from-doubled-array ├── 2007-find-original-array-from-doubled-array.cpp ├── NOTES.md └── README.md ├── 2009-minimum-number-of-operations-to-make-array-continuous ├── 2009-minimum-number-of-operations-to-make-array-continuous.cpp ├── NOTES.md └── README.md ├── 202-happy-number ├── 202-happy-number.cpp ├── NOTES.md └── README.md ├── 2021-remove-all-occurrences-of-a-substring ├── 2021-remove-all-occurrences-of-a-substring.cpp └── README.md ├── 2022-convert-1d-array-into-2d-array ├── NOTES.md └── README.md ├── 2024-maximize-the-confusion-of-an-exam ├── 2024-maximize-the-confusion-of-an-exam.cpp └── README.md ├── 2032-two-out-of-three ├── 2032-two-out-of-three.cpp ├── NOTES.md └── README.md ├── 2037-minimum-number-of-moves-to-seat-everyone ├── 2037-minimum-number-of-moves-to-seat-everyone.cpp ├── NOTES.md └── README.md ├── 2038-remove-colored-pieces-if-both-neighbors-are-the-same-color ├── 2038-remove-colored-pieces-if-both-neighbors-are-the-same-color.cpp ├── NOTES.md └── README.md ├── 2042-check-if-numbers-are-ascending-in-a-sentence ├── 2042-check-if-numbers-are-ascending-in-a-sentence.cpp ├── NOTES.md └── README.md ├── 2044-count-number-of-maximum-bitwise-or-subsets ├── 2044-count-number-of-maximum-bitwise-or-subsets.cpp ├── NOTES.md └── README.md ├── 2045-second-minimum-time-to-reach-destination ├── NOTES.md └── README.md ├── 2048-build-array-from-permutation ├── 2048-build-array-from-permutation.cpp └── README.md ├── 205-isomorphic-strings ├── 205-isomorphic-strings.cpp ├── NOTES.md └── README.md ├── 2050-count-good-numbers ├── 2050-count-good-numbers.cpp └── README.md ├── 2050-parallel-courses-iii ├── 2050-parallel-courses-iii.cpp ├── NOTES.md └── README.md ├── 2053-kth-distinct-string-in-an-array ├── 2053-kth-distinct-string-in-an-array.cpp ├── NOTES.md └── README.md ├── 2058-find-the-minimum-and-maximum-number-of-nodes-between-critical-points ├── 2058-find-the-minimum-and-maximum-number-of-nodes-between-critical-points.cpp ├── NOTES.md └── README.md ├── 206-reverse-linked-list ├── 206-reverse-linked-list.cpp ├── NOTES.md └── README.md ├── 2061-painting-a-grid-with-three-different-colors ├── 2061-painting-a-grid-with-three-different-colors.cpp └── README.md ├── 2068-check-whether-two-strings-are-almost-equivalent ├── 2068-check-whether-two-strings-are-almost-equivalent.cpp └── NOTES.md ├── 207-course-schedule ├── 207-course-schedule.cpp └── NOTES.md ├── 2073-time-needed-to-buy-tickets ├── 2073-time-needed-to-buy-tickets.cpp ├── NOTES.md └── README.md ├── 2078-two-furthest-houses-with-different-colors ├── 2078-two-furthest-houses-with-different-colors.cpp └── NOTES.md ├── 2079-watering-plants ├── 2079-watering-plants.cpp ├── NOTES.md └── README.md ├── 208-implement-trie-prefix-tree └── README.md ├── 2085-count-common-words-with-one-occurrence ├── 2085-count-common-words-with-one-occurrence.cpp └── NOTES.md ├── 2089-find-target-indices-after-sorting-array └── README.md ├── 209-minimum-size-subarray-sum ├── 209-minimum-size-subarray-sum.cpp ├── NOTES.md └── README.md ├── 2090-k-radius-subarray-averages ├── 2090-k-radius-subarray-averages.cpp └── NOTES.md ├── 2090-number-of-ways-to-arrive-at-destination ├── 2090-number-of-ways-to-arrive-at-destination.cpp └── README.md ├── 2092-find-all-people-with-secret ├── NOTES.md └── README.md ├── 2096-step-by-step-directions-from-a-binary-tree-node-to-another ├── 2096-step-by-step-directions-from-a-binary-tree-node-to-another.cpp ├── NOTES.md └── README.md ├── 21-merge-two-sorted-lists ├── 21-merge-two-sorted-lists.cpp ├── NOTES.md └── README.md ├── 210-course-schedule-ii ├── 210-course-schedule-ii.cpp ├── NOTES.md └── README.md ├── 2101-detonate-the-maximum-bombs ├── 2101-detonate-the-maximum-bombs.cpp └── README.md ├── 2103-rings-and-rods ├── 2103-rings-and-rods.cpp ├── NOTES.md └── README.md ├── 2107-find-unique-binary-string ├── 2107-find-unique-binary-string.cpp └── README.md ├── 2108-find-first-palindromic-string-in-the-array ├── 2108-find-first-palindromic-string-in-the-array.cpp ├── NOTES.md └── README.md ├── 211-design-add-and-search-words-data-structure ├── 211-design-add-and-search-words-data-structure.cpp ├── NOTES.md └── README.md ├── 2119-a-number-after-a-double-reversal ├── 2119-a-number-after-a-double-reversal.cpp ├── NOTES.md └── README.md ├── 212-word-search-ii ├── 212-word-search-ii.cpp ├── NOTES.md └── README.md ├── 2124-check-if-all-as-appears-before-all-bs ├── 2124-check-if-all-as-appears-before-all-bs.cpp └── NOTES.md ├── 2125-number-of-laser-beams-in-a-bank ├── 2125-number-of-laser-beams-in-a-bank.cpp ├── NOTES.md └── README.md ├── 213-house-robber-ii ├── 213-house-robber-ii.cpp └── NOTES.md ├── 2130-maximum-twin-sum-of-a-linked-list ├── 2130-maximum-twin-sum-of-a-linked-list.cpp ├── NOTES.md └── README.md ├── 2131-longest-palindrome-by-concatenating-two-letter-words ├── 2131-longest-palindrome-by-concatenating-two-letter-words.cpp ├── NOTES.md └── README.md ├── 2134-minimum-swaps-to-group-all-1s-together-ii ├── 2134-minimum-swaps-to-group-all-1s-together-ii.cpp └── README.md ├── 2138-divide-a-string-into-groups-of-size-k ├── 2138-divide-a-string-into-groups-of-size-k.cpp ├── NOTES.md └── README.md ├── 2140-solving-questions-with-brainpower ├── 2140-solving-questions-with-brainpower.cpp ├── NOTES.md └── README.md ├── 2141-maximum-running-time-of-n-computers ├── 2141-maximum-running-time-of-n-computers.cpp └── README.md ├── 2145-grid-game ├── 2145-grid-game.cpp └── README.md ├── 2147-number-of-ways-to-divide-a-long-corridor ├── 2147-number-of-ways-to-divide-a-long-corridor.cpp ├── NOTES.md └── README.md ├── 2149-rearrange-array-elements-by-sign ├── 2149-rearrange-array-elements-by-sign.cpp ├── NOTES.md └── README.md ├── 215-kth-largest-element-in-an-array ├── 215-kth-largest-element-in-an-array.cpp ├── NOTES.md └── README.md ├── 2154-keep-multiplying-found-values-by-two ├── 2154-keep-multiplying-found-values-by-two.cpp └── NOTES.md ├── 216-combination-sum-iii ├── 216-combination-sum-iii.cpp ├── NOTES.md └── README.md ├── 2160-minimum-operations-to-make-a-uni-value-grid ├── 2160-minimum-operations-to-make-a-uni-value-grid.cpp └── README.md ├── 2160-minimum-sum-of-four-digit-number-after-splitting-digits ├── 2160-minimum-sum-of-four-digit-number-after-splitting-digits.cpp └── NOTES.md ├── 2161-partition-array-according-to-given-pivot ├── 2161-partition-array-according-to-given-pivot.cpp ├── NOTES.md └── README.md ├── 2164-two-best-non-overlapping-events ├── 2164-two-best-non-overlapping-events.cpp └── README.md ├── 2169-count-operations-to-obtain-zero ├── 2169-count-operations-to-obtain-zero.cpp ├── NOTES.md └── README.md ├── 217-contains-duplicate ├── NOTES.md └── README.md ├── 2176-count-equal-and-divisible-pairs-in-an-array ├── 2176-count-equal-and-divisible-pairs-in-an-array.cpp ├── NOTES.md └── README.md ├── 2177-find-three-consecutive-integers-that-sum-to-a-given-number ├── 2177-find-three-consecutive-integers-that-sum-to-a-given-number.cpp ├── NOTES.md └── README.md ├── 2178-maximum-split-of-positive-even-integers ├── 2178-maximum-split-of-positive-even-integers.cpp └── NOTES.md ├── 2179-most-beautiful-item-for-each-query └── README.md ├── 2180-count-integers-with-even-digit-sum ├── 2180-count-integers-with-even-digit-sum.cpp ├── NOTES.md └── README.md ├── 2180-maximum-number-of-tasks-you-can-assign ├── 2180-maximum-number-of-tasks-you-can-assign.cpp └── README.md ├── 2181-merge-nodes-in-between-zeros ├── 2181-merge-nodes-in-between-zeros.cpp ├── NOTES.md └── README.md ├── 2182-construct-string-with-repeat-limit ├── 2182-construct-string-with-repeat-limit.cpp ├── NOTES.md └── README.md ├── 2185-counting-words-with-a-given-prefix ├── 2185-counting-words-with-a-given-prefix.cpp ├── NOTES.md └── README.md ├── 2186-minimum-number-of-steps-to-make-two-strings-anagram-ii ├── 2186-minimum-number-of-steps-to-make-two-strings-anagram-ii.cpp ├── NOTES.md └── README.md ├── 2187-minimum-time-to-complete-trips ├── 2187-minimum-time-to-complete-trips.cpp ├── NOTES.md └── README.md ├── 2188-minimized-maximum-of-products-distributed-to-any-store ├── 2188-minimized-maximum-of-products-distributed-to-any-store.cpp └── README.md ├── 2190-most-frequent-number-following-key-in-an-array ├── 2190-most-frequent-number-following-key-in-an-array.cpp ├── NOTES.md └── README.md ├── 2191-sort-the-jumbled-numbers ├── 2191-sort-the-jumbled-numbers.cpp ├── NOTES.md └── README.md ├── 2192-all-ancestors-of-a-node-in-a-directed-acyclic-graph ├── 2192-all-ancestors-of-a-node-in-a-directed-acyclic-graph.cpp ├── NOTES.md └── README.md ├── 2194-cells-in-a-range-on-an-excel-sheet ├── 2194-cells-in-a-range-on-an-excel-sheet.cpp ├── NOTES.md └── README.md ├── 2195-append-k-integers-with-minimal-sum ├── 2195-append-k-integers-with-minimal-sum.cpp ├── NOTES.md └── README.md ├── 2196-create-binary-tree-from-descriptions ├── 2196-create-binary-tree-from-descriptions.cpp ├── NOTES.md └── README.md ├── 2200-find-all-k-distant-indices-in-an-array ├── 2200-find-all-k-distant-indices-in-an-array.cpp ├── NOTES.md └── README.md ├── 2201-count-artifacts-that-can-be-extracted ├── 2201-count-artifacts-that-can-be-extracted.cpp ├── NOTES.md └── README.md ├── 2201-valid-arrangement-of-pairs ├── 2201-valid-arrangement-of-pairs.cpp └── README.md ├── 2202-maximize-the-topmost-element-after-k-moves ├── 2202-maximize-the-topmost-element-after-k-moves.cpp ├── NOTES.md └── README.md ├── 2206-divide-array-into-equal-pairs ├── 2206-divide-array-into-equal-pairs.cpp ├── NOTES.md └── README.md ├── 2207-maximize-number-of-subsequences-in-a-string ├── 2207-maximize-number-of-subsequences-in-a-string.cpp ├── NOTES.md └── README.md ├── 2208-minimum-operations-to-halve-array-sum ├── 2208-minimum-operations-to-halve-array-sum.cpp ├── NOTES.md └── README.md ├── 2209-minimum-white-tiles-after-covering-with-carpets ├── 2209-minimum-white-tiles-after-covering-with-carpets.cpp ├── NOTES.md └── README.md ├── 2210-count-hills-and-valleys-in-an-array ├── 2210-count-hills-and-valleys-in-an-array.cpp ├── NOTES.md └── README.md ├── 2211-count-collisions-on-a-road ├── 2211-count-collisions-on-a-road.cpp ├── NOTES.md └── README.md ├── 2212-maximum-points-in-an-archery-competition ├── 2212-maximum-points-in-an-archery-competition.cpp ├── NOTES.md └── README.md ├── 2215-find-the-difference-of-two-arrays ├── 2215-find-the-difference-of-two-arrays.cpp ├── NOTES.md └── README.md ├── 2215-finding-3-digit-even-numbers ├── 2215-finding-3-digit-even-numbers.cpp └── README.md ├── 2216-minimum-deletions-to-make-array-beautiful ├── 2216-minimum-deletions-to-make-array-beautiful.cpp └── NOTES.md ├── 2217-find-palindrome-with-fixed-length ├── 2217-find-palindrome-with-fixed-length.cpp ├── NOTES.md └── README.md ├── 2218-maximum-value-of-k-coins-from-piles ├── 2218-maximum-value-of-k-coins-from-piles.cpp ├── NOTES.md └── README.md ├── 222-count-complete-tree-nodes ├── 222-count-complete-tree-nodes.cpp ├── NOTES.md └── README.md ├── 2220-find-all-possible-recipes-from-given-supplies ├── 2220-find-all-possible-recipes-from-given-supplies.cpp └── README.md ├── 2220-minimum-bit-flips-to-convert-number ├── 2220-minimum-bit-flips-to-convert-number.cpp ├── NOTES.md └── README.md ├── 2221-check-if-a-parentheses-string-can-be-valid ├── 2221-check-if-a-parentheses-string-can-be-valid.cpp └── README.md ├── 2221-find-triangular-sum-of-an-array ├── 2221-find-triangular-sum-of-an-array.cpp ├── NOTES.md └── README.md ├── 2222-number-of-ways-to-select-buildings ├── 2222-number-of-ways-to-select-buildings.cpp ├── NOTES.md └── README.md ├── 2224-minimum-number-of-operations-to-convert-time ├── 2224-minimum-number-of-operations-to-convert-time.cpp ├── NOTES.md └── README.md ├── 2225-find-players-with-zero-or-one-losses ├── 2225-find-players-with-zero-or-one-losses.cpp ├── NOTES.md └── README.md ├── 2226-maximum-candies-allocated-to-k-children ├── 2226-maximum-candies-allocated-to-k-children.cpp ├── NOTES.md └── README.md ├── 2231-largest-number-after-digit-swaps-by-parity ├── 2231-largest-number-after-digit-swaps-by-parity.cpp ├── NOTES.md └── README.md ├── 2232-adding-spaces-to-a-string ├── 2232-adding-spaces-to-a-string.cpp └── README.md ├── 2232-minimize-result-by-adding-parentheses-to-expression ├── 2232-minimize-result-by-adding-parentheses-to-expression.cpp ├── NOTES.md └── README.md ├── 2233-maximum-product-after-k-increments ├── 2233-maximum-product-after-k-increments.cpp ├── NOTES.md └── README.md ├── 2235-add-two-integers ├── 2235-add-two-integers.cpp ├── NOTES.md └── README.md ├── 2236-root-equals-sum-of-children ├── 2236-root-equals-sum-of-children.cpp ├── NOTES.md └── README.md ├── 2237-longest-palindrome-by-concatenating-two-letter-words ├── 2237-longest-palindrome-by-concatenating-two-letter-words.cpp └── README.md ├── 2239-find-closest-number-to-zero ├── 2239-find-closest-number-to-zero.cpp ├── NOTES.md └── README.md ├── 2240-number-of-ways-to-buy-pens-and-pencils ├── 2240-number-of-ways-to-buy-pens-and-pencils.cpp ├── NOTES.md └── README.md ├── 2241-design-an-atm-machine ├── 2241-design-an-atm-machine.cpp ├── NOTES.md └── README.md ├── 2242-maximum-score-of-a-node-sequence ├── 2242-maximum-score-of-a-node-sequence.cpp ├── NOTES.md └── README.md ├── 2243-calculate-digit-sum-of-a-string ├── 2243-calculate-digit-sum-of-a-string.cpp ├── NOTES.md └── README.md ├── 2244-minimum-rounds-to-complete-all-tasks ├── 2244-minimum-rounds-to-complete-all-tasks.cpp ├── NOTES.md └── README.md ├── 2246-longest-path-with-different-adjacent-characters ├── 2246-longest-path-with-different-adjacent-characters.cpp ├── NOTES.md └── README.md ├── 2246-maximum-employees-to-be-invited-to-a-meeting ├── 2246-maximum-employees-to-be-invited-to-a-meeting.cpp └── README.md ├── 2248-intersection-of-multiple-arrays ├── 2248-intersection-of-multiple-arrays.cpp └── NOTES.md ├── 2249-count-the-hidden-sequences ├── 2249-count-the-hidden-sequences.cpp └── README.md ├── 225-implement-stack-using-queues ├── 225-implement-stack-using-queues.cpp ├── NOTES.md └── README.md ├── 2251-number-of-flowers-in-full-bloom ├── 2251-number-of-flowers-in-full-bloom.cpp ├── NOTES.md └── README.md ├── 2255-count-prefixes-of-a-given-string ├── 2255-count-prefixes-of-a-given-string.cpp ├── NOTES.md └── README.md ├── 2256-minimum-average-difference ├── 2256-minimum-average-difference.cpp ├── NOTES.md └── README.md ├── 2257-count-unguarded-cells-in-the-grid ├── 2257-count-unguarded-cells-in-the-grid.cpp ├── NOTES.md └── README.md ├── 2259-remove-digit-from-number-to-maximize-result ├── 2259-remove-digit-from-number-to-maximize-result.cpp └── NOTES.md ├── 226-invert-binary-tree ├── NOTES.md └── README.md ├── 2260-minimum-consecutive-cards-to-pick-up ├── 2260-minimum-consecutive-cards-to-pick-up.cpp ├── NOTES.md └── README.md ├── 2261-k-divisible-elements-subarrays ├── 2261-k-divisible-elements-subarrays.cpp ├── NOTES.md └── README.md ├── 2262-solving-questions-with-brainpower ├── 2262-solving-questions-with-brainpower.cpp └── README.md ├── 2264-largest-3-same-digit-number-in-string ├── 2264-largest-3-same-digit-number-in-string.cpp ├── NOTES.md └── README.md ├── 2265-count-nodes-equal-to-average-of-subtree ├── 2265-count-nodes-equal-to-average-of-subtree.cpp ├── NOTES.md └── README.md ├── 227-basic-calculator-ii └── README.md ├── 2272-substring-with-largest-variance ├── 2272-substring-with-largest-variance.cpp └── README.md ├── 2277-count-equal-and-divisible-pairs-in-an-array ├── 2277-count-equal-and-divisible-pairs-in-an-array.cpp └── README.md ├── 2278-percentage-of-letter-in-string ├── 2278-percentage-of-letter-in-string.cpp ├── NOTES.md └── README.md ├── 2279-maximum-bags-with-full-capacity-of-rocks ├── 2279-maximum-bags-with-full-capacity-of-rocks.cpp ├── NOTES.md └── README.md ├── 228-summary-ranges └── NOTES.md ├── 2280-count-good-triplets-in-an-array ├── 2280-count-good-triplets-in-an-array.cpp └── README.md ├── 2280-minimum-lines-to-represent-a-line-chart ├── 2280-minimum-lines-to-represent-a-line-chart.cpp ├── NOTES.md └── README.md ├── 2283-check-if-number-has-equal-digit-count-and-digit-value ├── 2283-check-if-number-has-equal-digit-count-and-digit-value.cpp └── NOTES.md ├── 2285-maximum-total-importance-of-roads ├── 2285-maximum-total-importance-of-roads.cpp ├── NOTES.md └── README.md ├── 229-majority-element-ii └── NOTES.md ├── 2292-counting-words-with-a-given-prefix ├── 2292-counting-words-with-a-given-prefix.cpp └── README.md ├── 2293-min-max-game ├── 2293-min-max-game.cpp └── NOTES.md ├── 2299-strong-password-checker-ii ├── NOTES.md └── README.md ├── 23-merge-k-sorted-lists ├── 23-merge-k-sorted-lists.cpp ├── NOTES.md └── README.md ├── 230-kth-smallest-element-in-a-bst ├── 230-kth-smallest-element-in-a-bst.cpp ├── NOTES.md └── README.md ├── 2300-construct-string-with-repeat-limit ├── 2300-construct-string-with-repeat-limit.cpp └── README.md ├── 2300-successful-pairs-of-spells-and-potions ├── 2300-successful-pairs-of-spells-and-potions.cpp ├── NOTES.md └── README.md ├── 2303-calculate-amount-paid-in-taxes ├── NOTES.md └── README.md ├── 2305-fair-distribution-of-cookies ├── 2305-fair-distribution-of-cookies.cpp └── NOTES.md ├── 2306-naming-a-company ├── 2306-naming-a-company.cpp └── README.md ├── 2308-divide-array-into-equal-pairs ├── 2308-divide-array-into-equal-pairs.cpp └── README.md ├── 2309-greatest-english-letter-in-upper-and-lower-case ├── 2309-greatest-english-letter-in-upper-and-lower-case.cpp └── README.md ├── 2310-sum-of-numbers-with-units-digit-k ├── 2310-sum-of-numbers-with-units-digit-k.cpp ├── NOTES.md └── README.md ├── 2315-count-asterisks ├── 2315-count-asterisks.cpp └── NOTES.md ├── 2316-count-unreachable-pairs-of-nodes-in-an-undirected-graph ├── 2316-count-unreachable-pairs-of-nodes-in-an-undirected-graph.cpp └── NOTES.md ├── 2319-check-if-matrix-is-x-matrix └── 2319-check-if-matrix-is-x-matrix.cpp ├── 232-implement-queue-using-stacks ├── 232-implement-queue-using-stacks.cpp ├── NOTES.md └── README.md ├── 2325-decode-the-message ├── 2325-decode-the-message.cpp └── NOTES.md ├── 2326-spiral-matrix-iv ├── 2326-spiral-matrix-iv.cpp ├── NOTES.md └── README.md ├── 2328-number-of-increasing-paths-in-a-grid ├── 2328-number-of-increasing-paths-in-a-grid.cpp └── README.md ├── 2331-evaluate-boolean-binary-tree ├── 2331-evaluate-boolean-binary-tree.cpp ├── NOTES.md └── README.md ├── 2336-smallest-number-in-infinite-set ├── 2336-smallest-number-in-infinite-set.cpp └── NOTES.md ├── 234-palindrome-linked-list ├── 234-palindrome-linked-list.cpp ├── NOTES.md └── README.md ├── 2341-maximum-number-of-pairs-in-array ├── 2341-maximum-number-of-pairs-in-array.cpp └── NOTES.md ├── 2342-max-sum-of-a-pair-with-equal-sum-of-digits ├── 2342-max-sum-of-a-pair-with-equal-sum-of-digits.cpp ├── NOTES.md └── README.md ├── 2343-count-unguarded-cells-in-the-grid ├── 2343-count-unguarded-cells-in-the-grid.cpp └── README.md ├── 2348-number-of-zero-filled-subarrays ├── 2348-number-of-zero-filled-subarrays.cpp └── NOTES.md ├── 235-lowest-common-ancestor-of-a-binary-search-tree ├── 235-lowest-common-ancestor-of-a-binary-search-tree.cpp ├── NOTES.md └── README.md ├── 2351-first-letter-to-appear-twice ├── 2351-first-letter-to-appear-twice.cpp └── NOTES.md ├── 2352-equal-row-and-column-pairs ├── 2352-equal-row-and-column-pairs.cpp └── NOTES.md ├── 2353-design-a-food-rating-system ├── 2353-design-a-food-rating-system.cpp ├── NOTES.md └── README.md ├── 2356-number-of-unique-subjects-taught-by-each-teacher └── 2356-number-of-unique-subjects-taught-by-each-teacher.sql ├── 2357-make-array-zero-by-subtracting-equal-amounts ├── 2357-make-array-zero-by-subtracting-equal-amounts.cpp ├── NOTES.md └── README.md ├── 2358-number-of-ways-to-split-array ├── 2358-number-of-ways-to-split-array.cpp └── README.md ├── 2359-find-closest-node-to-given-two-nodes ├── 2359-find-closest-node-to-given-two-nodes.cpp └── NOTES.md ├── 236-lowest-common-ancestor-of-a-binary-tree ├── 236-lowest-common-ancestor-of-a-binary-tree.cpp ├── NOTES.md └── README.md ├── 2360-longest-cycle-in-a-graph ├── 2360-longest-cycle-in-a-graph.cpp └── NOTES.md ├── 2363-merge-similar-items ├── 2363-merge-similar-items.cpp ├── NOTES.md └── README.md ├── 2366-minimum-replacements-to-sort-the-array ├── 2366-minimum-replacements-to-sort-the-array.cpp ├── NOTES.md └── README.md ├── 2367-number-of-arithmetic-triplets ├── 2367-number-of-arithmetic-triplets.cpp └── NOTES.md ├── 2369-check-if-there-is-a-valid-partition-for-the-array ├── 2369-check-if-there-is-a-valid-partition-for-the-array.cpp ├── NOTES.md └── README.md ├── 237-delete-node-in-a-linked-list ├── 237-delete-node-in-a-linked-list.cpp └── NOTES.md ├── 2370-longest-ideal-subsequence ├── 2370-longest-ideal-subsequence.cpp ├── NOTES.md └── README.md ├── 2373-largest-local-values-in-a-matrix ├── 2373-largest-local-values-in-a-matrix.cpp └── NOTES.md ├── 2375-minimum-obstacle-removal-to-reach-corner ├── 2375-minimum-obstacle-removal-to-reach-corner.cpp └── README.md ├── 238-product-of-array-except-self ├── 238-product-of-array-except-self.cpp └── NOTES.md ├── 2385-amount-of-time-for-binary-tree-to-be-infected ├── 2385-amount-of-time-for-binary-tree-to-be-infected.cpp ├── NOTES.md └── README.md ├── 2389-longest-subsequence-with-limited-sum ├── 2389-longest-subsequence-with-limited-sum.cpp ├── NOTES.md └── README.md ├── 239-sliding-window-maximum ├── 239-sliding-window-maximum.cpp └── NOTES.md ├── 2390-removing-stars-from-a-string ├── 2390-removing-stars-from-a-string.cpp ├── NOTES.md └── README.md ├── 2391-minimum-amount-of-time-to-collect-garbage ├── 2391-minimum-amount-of-time-to-collect-garbage.cpp ├── NOTES.md └── README.md ├── 2392-build-a-matrix-with-conditions ├── 2392-build-a-matrix-with-conditions.cpp ├── NOTES.md └── README.md ├── 2394-count-subarrays-with-score-less-than-k ├── 2394-count-subarrays-with-score-less-than-k.cpp └── README.md ├── 2395-find-subarrays-with-equal-sum ├── 2395-find-subarrays-with-equal-sum.cpp ├── NOTES.md └── README.md ├── 2396-strictly-palindromic-number ├── 2396-strictly-palindromic-number.cpp └── NOTES.md ├── 24-swap-nodes-in-pairs ├── 24-swap-nodes-in-pairs.cpp ├── NOTES.md └── README.md ├── 240-search-a-2d-matrix-ii ├── 240-search-a-2d-matrix-ii.cpp ├── NOTES.md └── README.md ├── 2402-meeting-rooms-iii ├── 2402-meeting-rooms-iii.cpp ├── NOTES.md └── README.md ├── 2405-optimal-partition-of-string ├── 2405-optimal-partition-of-string.cpp └── NOTES.md ├── 2406-divide-intervals-into-minimum-number-of-groups ├── 2406-divide-intervals-into-minimum-number-of-groups.cpp ├── NOTES.md └── README.md ├── 2413-smallest-even-multiple ├── 2413-smallest-even-multiple.cpp ├── NOTES.md └── README.md ├── 2414-move-pieces-to-obtain-a-string ├── 2414-move-pieces-to-obtain-a-string.cpp └── README.md ├── 2415-count-the-number-of-ideal-arrays ├── 2415-count-the-number-of-ideal-arrays.cpp └── README.md ├── 2415-reverse-odd-levels-of-binary-tree ├── 2415-reverse-odd-levels-of-binary-tree.cpp └── NOTES.md ├── 2416-sum-of-prefix-scores-of-strings ├── NOTES.md └── README.md ├── 2418-sort-the-people ├── 2418-sort-the-people.cpp ├── NOTES.md └── README.md ├── 2419-longest-subarray-with-maximum-bitwise-and ├── 2419-longest-subarray-with-maximum-bitwise-and.cpp ├── NOTES.md └── README.md ├── 242-valid-anagram ├── 242-valid-anagram.cpp ├── NOTES.md └── README.md ├── 2421-number-of-good-paths ├── 2421-number-of-good-paths.cpp └── NOTES.md ├── 2423-remove-letter-to-equalize-frequency ├── 2423-remove-letter-to-equalize-frequency.cpp ├── NOTES.md └── README.md ├── 2427-number-of-common-factors ├── 2427-number-of-common-factors.cpp └── NOTES.md ├── 2433-find-the-original-array-of-prefix-xor ├── 2433-find-the-original-array-of-prefix-xor.cpp ├── NOTES.md └── README.md ├── 2434-design-a-number-container-system ├── 2434-design-a-number-container-system.cpp └── README.md ├── 2438-find-closest-node-to-given-two-nodes ├── 2438-find-closest-node-to-given-two-nodes.cpp └── README.md ├── 2439-minimize-maximum-of-array ├── 2439-minimize-maximum-of-array.cpp └── README.md ├── 2441-largest-positive-integer-that-exists-with-its-negative ├── 2441-largest-positive-integer-that-exists-with-its-negative.cpp ├── NOTES.md └── README.md ├── 2444-count-subarrays-with-fixed-bounds ├── 2444-count-subarrays-with-fixed-bounds.cpp ├── NOTES.md └── README.md ├── 2448-count-number-of-bad-pairs ├── 2448-count-number-of-bad-pairs.cpp └── README.md ├── 2448-minimum-cost-to-make-array-equal ├── 2448-minimum-cost-to-make-array-equal.cpp ├── NOTES.md └── README.md ├── 2456-construct-smallest-number-from-di-string ├── 2456-construct-smallest-number-from-di-string.cpp └── README.md ├── 2458-height-of-binary-tree-after-subtree-removal-queries ├── 2458-height-of-binary-tree-after-subtree-removal-queries.cpp ├── NOTES.md └── README.md ├── 2460-apply-operations-to-an-array ├── 2460-apply-operations-to-an-array.cpp ├── NOTES.md └── README.md ├── 2462-total-cost-to-hire-k-workers ├── 2462-total-cost-to-hire-k-workers.cpp └── NOTES.md ├── 2463-minimum-recolors-to-get-k-consecutive-black-blocks └── README.md ├── 2463-minimum-total-distance-traveled ├── NOTES.md └── README.md ├── 2465-shifting-letters-ii ├── 2465-shifting-letters-ii.cpp └── README.md ├── 2466-count-ways-to-build-good-strings ├── 2466-count-ways-to-build-good-strings.cpp └── README.md ├── 2469-convert-the-temperature ├── 2469-convert-the-temperature.cpp ├── NOTES.md └── README.md ├── 2473-max-sum-of-a-pair-with-equal-sum-of-digits ├── 2473-max-sum-of-a-pair-with-equal-sum-of-digits.cpp └── README.md ├── 2475-number-of-unequal-triplets-in-array ├── 2475-number-of-unequal-triplets-in-array.cpp └── NOTES.md ├── 2477-minimum-fuel-cost-to-report-to-the-capital └── 2477-minimum-fuel-cost-to-report-to-the-capital.cpp ├── 2478-longest-nice-subarray ├── 2478-longest-nice-subarray.cpp └── README.md ├── 2482-difference-between-ones-and-zeros-in-row-and-column ├── 2482-difference-between-ones-and-zeros-in-row-and-column.cpp ├── NOTES.md └── README.md ├── 2483-minimum-penalty-for-a-shop ├── 2483-minimum-penalty-for-a-shop.cpp ├── NOTES.md └── README.md ├── 2485-find-the-pivot-integer ├── 2485-find-the-pivot-integer.cpp ├── NOTES.md └── README.md ├── 2486-append-characters-to-string-to-make-subsequence ├── 2486-append-characters-to-string-to-make-subsequence.cpp ├── NOTES.md └── README.md ├── 2487-remove-nodes-from-linked-list ├── 2487-remove-nodes-from-linked-list.cpp ├── NOTES.md └── README.md ├── 2490-circular-sentence ├── 2490-circular-sentence.cpp └── NOTES.md ├── 2492-minimum-score-of-a-path-between-two-cities └── 2492-minimum-score-of-a-path-between-two-cities.cpp ├── 2493-reverse-odd-levels-of-binary-tree ├── 2493-reverse-odd-levels-of-binary-tree.cpp └── README.md ├── 2496-maximum-value-of-a-string-in-an-array ├── 2496-maximum-value-of-a-string-in-an-array.cpp └── NOTES.md ├── 25-reverse-nodes-in-k-group ├── NOTES.md └── README.md ├── 2500-delete-greatest-value-in-each-row ├── 2500-delete-greatest-value-in-each-row.cpp ├── NOTES.md └── README.md ├── 2501-longest-square-streak-in-an-array ├── 2501-longest-square-streak-in-an-array.cpp ├── NOTES.md └── README.md ├── 2506-count-pairs-of-similar-strings ├── 2506-count-pairs-of-similar-strings.cpp ├── NOTES.md └── README.md ├── 2509-minimize-xor ├── 2509-minimize-xor.cpp └── README.md ├── 2515-shortest-distance-to-target-string-in-a-circular-array ├── 2515-shortest-distance-to-target-string-in-a-circular-array.cpp ├── NOTES.md └── README.md ├── 2520-count-the-digits-that-divide-a-number ├── 2520-count-the-digits-that-divide-a-number.cpp └── NOTES.md ├── 2520-using-a-robot-to-print-the-lexicographically-smallest-string ├── 2520-using-a-robot-to-print-the-lexicographically-smallest-string.cpp └── README.md ├── 2521-distinct-prime-factors-of-product-of-array ├── 2521-distinct-prime-factors-of-product-of-array.cpp ├── NOTES.md └── README.md ├── 2525-categorize-box-according-to-criteria └── 2525-categorize-box-according-to-criteria.cpp ├── 2527-count-subarrays-with-fixed-bounds ├── 2527-count-subarrays-with-fixed-bounds.cpp └── README.md ├── 2529-maximum-count-of-positive-integer-and-negative-integer ├── 2529-maximum-count-of-positive-integer-and-negative-integer.cpp ├── NOTES.md └── README.md ├── 2530-maximal-score-after-applying-k-operations └── README.md ├── 2533-bitwise-xor-of-all-pairings ├── 2533-bitwise-xor-of-all-pairings.cpp └── README.md ├── 2535-difference-between-element-sum-and-digit-sum-of-an-array └── NOTES.md ├── 2540-minimum-common-value ├── 2540-minimum-common-value.cpp ├── NOTES.md └── README.md ├── 2542-maximum-subsequence-score ├── NOTES.md └── README.md ├── 2544-alternating-digit-sum ├── 2544-alternating-digit-sum.cpp ├── NOTES.md └── README.md ├── 2545-sort-the-students-by-their-kth-score └── README.md ├── 2551-apply-operations-to-an-array ├── 2551-apply-operations-to-an-array.cpp └── README.md ├── 2551-put-marbles-in-bags ├── 2551-put-marbles-in-bags.cpp └── README.md ├── 2552-maximum-sum-of-distinct-subarrays-with-length-k ├── 2552-maximum-sum-of-distinct-subarrays-with-length-k.cpp └── README.md ├── 2553-separate-the-digits-in-an-array ├── NOTES.md └── README.md ├── 2558-minimum-number-of-operations-to-sort-a-binary-tree-by-level ├── 2558-minimum-number-of-operations-to-sort-a-binary-tree-by-level.cpp └── README.md ├── 2558-take-gifts-from-the-richest-pile ├── 2558-take-gifts-from-the-richest-pile.cpp └── NOTES.md ├── 2562-count-ways-to-build-good-strings └── README.md ├── 2562-find-the-array-concatenation-value ├── 2562-find-the-array-concatenation-value.cpp └── NOTES.md ├── 2564-most-profitable-path-in-a-tree ├── 2564-most-profitable-path-in-a-tree.cpp └── README.md ├── 2570-merge-two-2d-arrays-by-summing-values ├── 2570-merge-two-2d-arrays-by-summing-values.cpp ├── NOTES.md └── README.md ├── 2574-left-and-right-sum-differences ├── 2574-left-and-right-sum-differences.cpp ├── NOTES.md └── README.md ├── 2578-split-with-minimum-sum ├── 2578-split-with-minimum-sum.cpp ├── NOTES.md └── README.md ├── 258-add-digits ├── 258-add-digits.cpp ├── NOTES.md └── README.md ├── 2580-circular-sentence ├── 2580-circular-sentence.cpp └── README.md ├── 2582-pass-the-pillow ├── 2582-pass-the-pillow.cpp ├── NOTES.md └── README.md ├── 2583-divide-nodes-into-the-maximum-number-of-groups ├── 2583-divide-nodes-into-the-maximum-number-of-groups.cpp └── README.md ├── 2583-kth-largest-sum-in-a-binary-tree ├── 2583-kth-largest-sum-in-a-binary-tree.cpp ├── NOTES.md └── README.md ├── 2586-count-the-number-of-vowel-strings-in-range ├── 2586-count-the-number-of-vowel-strings-in-range.cpp └── NOTES.md ├── 2588-maximum-number-of-points-from-grid-queries ├── 2588-maximum-number-of-points-from-grid-queries.cpp └── README.md ├── 2595-number-of-even-and-odd-bits ├── 2595-number-of-even-and-odd-bits.cpp ├── NOTES.md └── README.md ├── 2597-the-number-of-beautiful-subsets ├── NOTES.md └── README.md ├── 2599-take-k-of-each-character-from-left-and-right ├── 2599-take-k-of-each-character-from-left-and-right.cpp └── README.md ├── 26-remove-duplicates-from-sorted-array ├── 26-remove-duplicates-from-sorted-array.cpp └── NOTES.md ├── 2600-k-items-with-the-maximum-sum ├── 2600-k-items-with-the-maximum-sum.cpp ├── NOTES.md └── README.md ├── 2605-form-smallest-number-from-two-digit-arrays ├── 2605-form-smallest-number-from-two-digit-arrays.cpp ├── NOTES.md └── README.md ├── 2609-find-the-longest-balanced-substring-of-a-binary-string ├── 2609-find-the-longest-balanced-substring-of-a-binary-string.cpp └── NOTES.md ├── 2610-convert-an-array-into-a-2d-array-with-conditions ├── 2610-convert-an-array-into-a-2d-array-with-conditions.cpp ├── NOTES.md └── README.md ├── 2614-maximum-count-of-positive-integer-and-negative-integer ├── 2614-maximum-count-of-positive-integer-and-negative-integer.cpp └── README.md ├── 2614-prime-in-diagonal ├── 2614-prime-in-diagonal.cpp ├── NOTES.md └── README.md ├── 2616-minimize-the-maximum-difference-of-pairs ├── 2616-minimize-the-maximum-difference-of-pairs.cpp ├── NOTES.md └── README.md ├── 2618-check-if-object-instance-of-class ├── 2618-check-if-object-instance-of-class.js ├── NOTES.md └── README.md ├── 2619-array-prototype-last ├── 2619-array-prototype-last.js └── NOTES.md ├── 2620-counter ├── 2620-counter.js ├── NOTES.md └── README.md ├── 2621-sleep ├── 2621-sleep.js ├── NOTES.md └── README.md ├── 2622-cache-with-time-limit ├── 2622-cache-with-time-limit.js └── NOTES.md ├── 2623-memoize ├── 2623-memoize.js └── NOTES.md ├── 2625-flatten-deeply-nested-array ├── 2625-flatten-deeply-nested-array.js ├── NOTES.md └── README.md ├── 2626-array-reduce-transformation ├── 2626-array-reduce-transformation.js ├── NOTES.md └── README.md ├── 2626-count-the-number-of-good-subarrays └── README.md ├── 2627-debounce ├── 2627-debounce.js ├── NOTES.md └── README.md ├── 2628-json-deep-equal ├── 2628-json-deep-equal.js ├── NOTES.md └── README.md ├── 2629-function-composition ├── 2629-function-composition.js ├── NOTES.md └── README.md ├── 2631-group-by ├── 2631-group-by.js └── NOTES.md ├── 2632-curry ├── 2632-curry.js ├── NOTES.md └── README.md ├── 2633-convert-object-to-json-string ├── 2633-convert-object-to-json-string.js └── NOTES.md ├── 2634-filter-elements-from-array ├── 2634-filter-elements-from-array.js ├── NOTES.md └── README.md ├── 2635-apply-transform-over-each-element-in-array ├── 2635-apply-transform-over-each-element-in-array.js ├── NOTES.md └── README.md ├── 2636-promise-pool ├── 2636-promise-pool.js ├── NOTES.md └── README.md ├── 2637-promise-time-limit ├── 2637-promise-time-limit.js ├── NOTES.md └── README.md ├── 2640-maximum-number-of-integers-to-choose-from-a-range-i ├── 2640-maximum-number-of-integers-to-choose-from-a-range-i.cpp └── README.md ├── 2641-cousins-in-binary-tree-ii ├── 2641-cousins-in-binary-tree-ii.cpp ├── NOTES.md └── README.md ├── 2642-design-graph-with-shortest-path-calculator ├── 2642-design-graph-with-shortest-path-calculator.cpp └── README.md ├── 2643-row-with-maximum-ones ├── 2643-row-with-maximum-ones.cpp └── NOTES.md ├── 2648-generate-fibonacci-sequence ├── 2648-generate-fibonacci-sequence.js └── NOTES.md ├── 2649-nested-array-generator ├── 2649-nested-array-generator.js ├── NOTES.md └── README.md ├── 2651-calculate-delayed-arrival-time ├── 2651-calculate-delayed-arrival-time.cpp └── NOTES.md ├── 2652-sum-multiples ├── 2652-sum-multiples.cpp └── NOTES.md ├── 2656-maximum-sum-with-exactly-k-elements ├── 2656-maximum-sum-with-exactly-k-elements.cpp ├── NOTES.md └── README.md ├── 2665-counter-ii ├── 2665-counter-ii.js └── NOTES.md ├── 2665-minimum-time-to-repair-cars ├── 2665-minimum-time-to-repair-cars.cpp └── README.md ├── 2666-allow-one-function-call ├── 2666-allow-one-function-call.js ├── NOTES.md └── README.md ├── 2667-create-hello-world-function ├── 2667-create-hello-world-function.js ├── NOTES.md └── README.md ├── 2675-array-of-objects-to-matrix ├── 2675-array-of-objects-to-matrix.js ├── NOTES.md └── README.md ├── 2676-throttle ├── 2676-throttle.js ├── NOTES.md └── README.md ├── 2677-chunk-array ├── 2677-chunk-array.js ├── NOTES.md └── README.md ├── 2678-number-of-senior-citizens └── README.md ├── 268-missing-number ├── 268-missing-number.cpp ├── NOTES.md └── README.md ├── 2684-maximum-number-of-moves-in-a-grid ├── 2684-maximum-number-of-moves-in-a-grid.cpp ├── NOTES.md └── README.md ├── 2685-first-completely-painted-row-or-column ├── 2685-first-completely-painted-row-or-column.cpp └── README.md ├── 2690-house-robber-iv ├── 2690-house-robber-iv.cpp └── README.md ├── 2691-count-vowel-strings-in-ranges ├── 2691-count-vowel-strings-in-ranges.cpp └── README.md ├── 2692-take-gifts-from-the-richest-pile ├── 2692-take-gifts-from-the-richest-pile.cpp └── README.md ├── 2693-call-function-with-custom-context ├── 2693-call-function-with-custom-context.js ├── NOTES.md └── README.md ├── 2694-event-emitter ├── 2694-event-emitter.js ├── NOTES.md └── README.md ├── 2695-array-wrapper ├── 2695-array-wrapper.js ├── NOTES.md └── README.md ├── 2695-find-score-of-an-array-after-marking-all-elements ├── 2695-find-score-of-an-array-after-marking-all-elements.cpp └── README.md ├── 2696-minimum-string-length-after-removing-substrings ├── 2696-minimum-string-length-after-removing-substrings.cpp ├── NOTES.md └── README.md ├── 2699-count-the-number-of-fair-pairs ├── 2699-count-the-number-of-fair-pairs.cpp └── README.md ├── 2699-modify-graph-edge-weights ├── 2699-modify-graph-edge-weights.cpp └── README.md ├── 2700-differences-between-two-objects ├── 2700-differences-between-two-objects.js ├── NOTES.md └── README.md ├── 2703-return-length-of-arguments-passed ├── 2703-return-length-of-arguments-passed.js └── README.md ├── 2704-to-be-or-not-to-be ├── 2704-to-be-or-not-to-be.js ├── NOTES.md └── README.md ├── 2706-buy-two-chocolates ├── 2706-buy-two-chocolates.cpp ├── NOTES.md └── README.md ├── 2707-extra-characters-in-a-string ├── NOTES.md └── README.md ├── 2709-greatest-common-divisor-traversal ├── 2709-greatest-common-divisor-traversal.cpp ├── NOTES.md └── README.md ├── 2711-minimum-time-to-visit-a-cell-in-a-grid ├── 2711-minimum-time-to-visit-a-cell-in-a-grid.cpp └── README.md ├── 2715-execute-cancellable-function-with-delay ├── 2715-execute-cancellable-function-with-delay.js └── NOTES.md ├── 2721-execute-asynchronous-functions-in-parallel ├── 2721-execute-asynchronous-functions-in-parallel.js ├── NOTES.md └── README.md ├── 2723-add-two-promises ├── 2723-add-two-promises.js ├── NOTES.md └── README.md ├── 2724-sort-by ├── 2724-sort-by.js ├── NOTES.md └── README.md ├── 2725-interval-cancellation ├── 2725-interval-cancellation.js ├── NOTES.md └── README.md ├── 2742-painting-the-walls ├── 2742-painting-the-walls.cpp ├── NOTES.md └── README.md ├── 275-h-index-ii ├── 275-h-index-ii.cpp ├── NOTES.md └── README.md ├── 2751-robot-collisions ├── 2751-robot-collisions.cpp ├── NOTES.md └── README.md ├── 2764-maximum-number-of-fish-in-a-grid ├── 2764-maximum-number-of-fish-in-a-grid.cpp └── README.md ├── 2766-find-the-prefix-common-array-of-two-arrays ├── 2766-find-the-prefix-common-array-of-two-arrays.cpp └── README.md ├── 2769-find-the-maximum-achievable-number ├── 2769-find-the-maximum-achievable-number.cpp ├── NOTES.md └── README.md ├── 278-first-bad-version ├── 278-first-bad-version.cpp ├── NOTES.md └── README.md ├── 2785-sort-vowels-in-a-string ├── 2785-sort-vowels-in-a-string.cpp ├── NOTES.md └── README.md ├── 2792-neighboring-bitwise-xor ├── 2792-neighboring-bitwise-xor.cpp └── README.md ├── 2793-count-the-number-of-complete-components ├── 2793-count-the-number-of-complete-components.cpp └── README.md ├── 2798-number-of-employees-who-met-the-target ├── 2798-number-of-employees-who-met-the-target.cpp ├── NOTES.md └── README.md ├── 28-implement-strstr ├── 28-implement-strstr.cpp ├── NOTES.md └── README.md ├── 2802-find-the-punishment-number-of-an-integer ├── 2802-find-the-punishment-number-of-an-integer.cpp └── README.md ├── 2807-insert-greatest-common-divisors-in-linked-list ├── NOTES.md └── README.md ├── 2810-faulty-keyboard ├── 2810-faulty-keyboard.cpp ├── NOTES.md └── README.md ├── 2812-find-the-safest-path-in-a-grid ├── 2812-find-the-safest-path-in-a-grid.cpp ├── NOTES.md └── README.md ├── 2816-double-a-number-represented-as-a-linked-list ├── 2816-double-a-number-represented-as-a-linked-list.cpp ├── NOTES.md └── README.md ├── 2824-count-pairs-whose-sum-is-less-than-target ├── 2824-count-pairs-whose-sum-is-less-than-target.cpp ├── NOTES.md └── README.md ├── 2828-check-if-a-string-is-an-acronym-of-words ├── 2828-check-if-a-string-is-an-acronym-of-words.cpp ├── NOTES.md └── README.md ├── 283-move-zeroes ├── 283-move-zeroes.cpp ├── NOTES.md └── README.md ├── 284-peeking-iterator ├── 284-peeking-iterator.cpp ├── NOTES.md └── README.md ├── 2849-determine-if-a-cell-is-reachable-at-a-given-time ├── 2849-determine-if-a-cell-is-reachable-at-a-given-time.cpp ├── NOTES.md └── README.md ├── 2856-count-complete-subarrays-in-an-array ├── 2856-count-complete-subarrays-in-an-array.cpp └── README.md ├── 2864-maximum-odd-binary-number ├── 2864-maximum-odd-binary-number.cpp ├── NOTES.md └── README.md ├── 2868-continuous-subarrays ├── 2868-continuous-subarrays.cpp └── README.md ├── 287-find-the-duplicate-number ├── 287-find-the-duplicate-number.cpp ├── NOTES.md └── README.md ├── 2870-minimum-number-of-operations-to-make-array-empty ├── 2870-minimum-number-of-operations-to-make-array-empty.cpp ├── NOTES.md └── README.md ├── 2888-minimum-index-of-a-valid-split ├── 2888-minimum-index-of-a-valid-split.cpp └── README.md ├── 289-game-of-life ├── 289-game-of-life.cpp ├── NOTES.md └── README.md ├── 2891-maximum-beauty-of-an-array-after-applying-operation ├── 2891-maximum-beauty-of-an-array-after-applying-operation.cpp └── README.md ├── 2894-divisible-and-non-divisible-sums-difference ├── 2894-divisible-and-non-divisible-sums-difference.cpp ├── NOTES.md └── README.md ├── 29-divide-two-integers ├── 29-divide-two-integers.cpp ├── NOTES.md └── README.md ├── 290-word-pattern ├── 290-word-pattern.cpp ├── NOTES.md └── README.md ├── 2915-count-of-interesting-subarrays ├── 2915-count-of-interesting-subarrays.cpp └── README.md ├── 2938-separate-black-and-white-balls ├── 2938-separate-black-and-white-balls.cpp ├── NOTES.md └── README.md ├── 2942-find-words-containing-character ├── NOTES.md └── README.md ├── 295-find-median-from-data-stream ├── 295-find-median-from-data-stream.cpp └── NOTES.md ├── 2958-length-of-longest-subarray-with-at-most-k-frequency ├── 2958-length-of-longest-subarray-with-at-most-k-frequency.cpp ├── NOTES.md └── README.md ├── 2962-count-subarrays-where-max-element-appears-at-least-k-times ├── 2962-count-subarrays-where-max-element-appears-at-least-k-times.cpp ├── NOTES.md └── README.md ├── 2966-divide-array-into-arrays-with-max-difference ├── 2966-divide-array-into-arrays-with-max-difference.cpp ├── NOTES.md └── README.md ├── 297-serialize-and-deserialize-binary-tree ├── 297-serialize-and-deserialize-binary-tree.cpp ├── NOTES.md └── README.md ├── 2971-find-polygon-with-the-largest-perimeter ├── 2971-find-polygon-with-the-largest-perimeter.cpp ├── NOTES.md └── README.md ├── 2976-minimum-cost-to-convert-string-i ├── 2976-minimum-cost-to-convert-string-i.cpp ├── NOTES.md └── README.md ├── 299-bulls-and-cows ├── 299-bulls-and-cows.cpp ├── NOTES.md └── README.md ├── 2997-minimum-number-of-operations-to-make-array-xor-equal-to-k ├── 2997-minimum-number-of-operations-to-make-array-xor-equal-to-k.cpp ├── NOTES.md └── README.md ├── 2998-count-symmetric-integers ├── 2998-count-symmetric-integers.cpp └── README.md ├── 3-longest-substring-without-repeating-characters ├── 3-longest-substring-without-repeating-characters.cpp ├── NOTES.md └── README.md ├── 30-substring-with-concatenation-of-all-words ├── 30-substring-with-concatenation-of-all-words.cpp ├── NOTES.md └── README.md ├── 300-longest-increasing-subsequence ├── 300-longest-increasing-subsequence.cpp ├── NOTES.md └── README.md ├── 3005-count-elements-with-maximum-frequency ├── 3005-count-elements-with-maximum-frequency.cpp ├── NOTES.md └── README.md ├── 3016-minimum-number-of-pushes-to-type-word-ii ├── 3016-minimum-number-of-pushes-to-type-word-ii.cpp ├── NOTES.md └── README.md ├── 303-range-sum-query-immutable └── README.md ├── 304-range-sum-query-2d-immutable ├── 304-range-sum-query-2d-immutable.cpp └── NOTES.md ├── 3043-find-the-length-of-the-longest-common-prefix ├── 3043-find-the-length-of-the-longest-common-prefix.cpp └── README.md ├── 3058-maximum-number-of-k-divisible-components ├── 3058-maximum-number-of-k-divisible-components.cpp └── README.md ├── 3068-find-the-maximum-sum-of-node-values ├── 3068-find-the-maximum-sum-of-node-values.cpp ├── NOTES.md └── README.md ├── 307-range-sum-query-mutable ├── 307-range-sum-query-mutable.cpp └── NOTES.md ├── 3075-maximize-happiness-of-selected-children ├── 3075-maximize-happiness-of-selected-children.cpp ├── NOTES.md └── README.md ├── 3099-harshad-number ├── 3099-harshad-number.cpp ├── NOTES.md └── README.md ├── 31-next-permutation ├── 31-next-permutation.cpp ├── NOTES.md └── README.md ├── 3110-score-of-a-string ├── 3110-score-of-a-string.cpp ├── NOTES.md └── README.md ├── 3143-longest-unequal-adjacent-groups-subsequence-i ├── 3143-longest-unequal-adjacent-groups-subsequence-i.cpp └── README.md ├── 3152-maximum-value-of-an-ordered-triplet-ii ├── 3152-maximum-value-of-an-ordered-triplet-ii.cpp └── README.md ├── 3154-maximum-value-of-an-ordered-triplet-i ├── 3154-maximum-value-of-an-ordered-triplet-i.cpp └── README.md ├── 316-remove-duplicate-letters ├── 316-remove-duplicate-letters.cpp └── NOTES.md ├── 3171-minimum-equal-sum-of-two-arrays-after-replacing-zeros ├── 3171-minimum-equal-sum-of-two-arrays-after-replacing-zeros.cpp └── README.md ├── 3172-divisible-and-non-divisible-sums-difference ├── 3172-divisible-and-non-divisible-sums-difference.cpp └── README.md ├── 3174-minimum-number-of-changes-to-make-binary-string-beautiful ├── 3174-minimum-number-of-changes-to-make-binary-string-beautiful.cpp └── README.md ├── 318-maximum-product-of-word-lengths ├── 318-maximum-product-of-word-lengths.cpp ├── NOTES.md └── README.md ├── 3181-find-building-where-alice-and-bob-can-meet ├── 3181-find-building-where-alice-and-bob-can-meet.cpp └── README.md ├── 3189-find-champion-ii ├── 3189-find-champion-ii.cpp └── README.md ├── 3190-find-minimum-operations-to-make-all-elements-divisible-by-three ├── 3190-find-minimum-operations-to-make-all-elements-divisible-by-three.cpp ├── NOTES.md └── README.md ├── 3194-find-words-containing-character ├── 3194-find-words-containing-character.cpp └── README.md ├── 32-longest-valid-parentheses ├── 32-longest-valid-parentheses.cpp ├── NOTES.md └── README.md ├── 3201-distribute-candies-among-children-ii ├── 3201-distribute-candies-among-children-ii.cpp └── README.md ├── 3213-count-subarrays-where-max-element-appears-at-least-k-times ├── 3213-count-subarrays-where-max-element-appears-at-least-k-times.cpp └── README.md ├── 3217-delete-nodes-from-linked-list-present-in-array ├── 3217-delete-nodes-from-linked-list-present-in-array.cpp ├── NOTES.md └── README.md ├── 3219-make-lexicographically-smallest-array-by-swapping-elements ├── 3219-make-lexicographically-smallest-array-by-swapping-elements.cpp └── README.md ├── 322-coin-change ├── 322-coin-change.cpp ├── NOTES.md └── README.md ├── 3243-count-the-number-of-powerful-integers ├── 3243-count-the-number-of-powerful-integers.cpp └── README.md ├── 326-power-of-three ├── 326-power-of-three.cpp ├── NOTES.md └── README.md ├── 3267-find-longest-special-substring-that-occurs-thrice-i ├── 3267-find-longest-special-substring-that-occurs-thrice-i.cpp └── README.md ├── 328-odd-even-linked-list ├── 328-odd-even-linked-list.cpp ├── NOTES.md └── README.md ├── 329-longest-increasing-path-in-a-matrix ├── 329-longest-increasing-path-in-a-matrix.cpp ├── NOTES.md └── README.md ├── 3291-find-if-array-can-be-sorted ├── 3291-find-if-array-can-be-sorted.cpp └── README.md ├── 33-search-in-rotated-sorted-array ├── 33-search-in-rotated-sorted-array.cpp ├── NOTES.md └── README.md ├── 3307-find-the-maximum-sum-of-node-values ├── 3307-find-the-maximum-sum-of-node-values.cpp └── README.md ├── 3309-count-prefix-and-suffix-pairs-i ├── 3309-count-prefix-and-suffix-pairs-i.cpp └── README.md ├── 3321-type-of-triangle ├── 3321-type-of-triangle.cpp └── README.md ├── 3332-minimum-operations-to-exceed-threshold-value-ii ├── 3332-minimum-operations-to-exceed-threshold-value-ii.cpp └── README.md ├── 3348-minimum-cost-walk-in-weighted-graph ├── 3348-minimum-cost-walk-in-weighted-graph.cpp └── README.md ├── 3372-longest-strictly-increasing-or-strictly-decreasing-subarray ├── 3372-longest-strictly-increasing-or-strictly-decreasing-subarray.cpp └── README.md ├── 338-counting-bits ├── 338-counting-bits.cpp ├── NOTES.md └── README.md ├── 3380-shortest-subarray-with-or-at-least-k-ii ├── 3380-shortest-subarray-with-or-at-least-k-ii.cpp └── README.md ├── 34-find-first-and-last-position-of-element-in-sorted-array ├── 34-find-first-and-last-position-of-element-in-sorted-array.cpp ├── NOTES.md └── README.md ├── 341-flatten-nested-list-iterator ├── 341-flatten-nested-list-iterator.cpp ├── NOTES.md └── README.md ├── 3412-permutation-difference-between-two-strings ├── 3412-permutation-difference-between-two-strings.cpp └── README.md ├── 342-power-of-four ├── 342-power-of-four.cpp ├── NOTES.md └── README.md ├── 3427-special-array-ii ├── 3427-special-array-ii.cpp └── README.md ├── 3429-special-array-i ├── 3429-special-array-i.cpp └── README.md ├── 3430-count-days-without-meetings ├── 3430-count-days-without-meetings.cpp └── README.md ├── 3434-find-the-number-of-distinct-colors-among-the-balls ├── 3434-find-the-number-of-distinct-colors-among-the-balls.cpp └── README.md ├── 3439-find-minimum-diameter-after-merging-two-trees ├── 3439-find-minimum-diameter-after-merging-two-trees.cpp └── README.md ├── 344-reverse-string ├── 344-reverse-string.cpp ├── NOTES.md └── README.md ├── 3445-lexicographically-minimum-string-after-removing-stars ├── 3445-lexicographically-minimum-string-after-removing-stars.cpp └── README.md ├── 3447-clear-digits ├── 3447-clear-digits.cpp └── README.md ├── 345-reverse-vowels-of-a-string ├── 345-reverse-vowels-of-a-string.cpp └── NOTES.md ├── 3451-string-compression-iii ├── 3451-string-compression-iii.cpp └── README.md ├── 3455-minimum-length-of-string-after-operations ├── 3455-minimum-length-of-string-after-operations.cpp └── README.md ├── 347-top-k-frequent-elements ├── 347-top-k-frequent-elements.cpp ├── NOTES.md └── README.md ├── 3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i ├── 3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i.cpp └── README.md ├── 3483-alternating-groups-ii └── README.md ├── 35-search-insert-position ├── 35-search-insert-position.cpp ├── NOTES.md └── README.md ├── 350-intersection-of-two-arrays-ii ├── 350-intersection-of-two-arrays-ii.cpp └── NOTES.md ├── 3517-shortest-distance-after-road-addition-queries-i ├── 3517-shortest-distance-after-road-addition-queries-i.cpp └── README.md ├── 3522-find-the-power-of-k-size-subarrays-i ├── 3522-find-the-power-of-k-size-subarrays-i.cpp └── README.md ├── 354-russian-doll-envelopes ├── 354-russian-doll-envelopes.cpp ├── NOTES.md └── README.md ├── 3548-find-the-count-of-good-integers ├── 3548-find-the-count-of-good-integers.cpp └── README.md ├── 3555-final-array-state-after-k-multiplication-operations-i ├── 3555-final-array-state-after-k-multiplication-operations-i.cpp └── README.md ├── 3569-count-of-substrings-containing-every-vowel-and-k-consonants-ii ├── 3569-count-of-substrings-containing-every-vowel-and-k-consonants-ii.cpp └── README.md ├── 3616-make-array-elements-equal-to-zero ├── 3616-make-array-elements-equal-to-zero.cpp └── README.md ├── 3627-find-minimum-time-to-reach-last-room-i ├── 3627-find-minimum-time-to-reach-last-room-i.cpp └── README.md ├── 3628-find-minimum-time-to-reach-last-room-ii ├── 3628-find-minimum-time-to-reach-last-room-ii.cpp └── README.md ├── 3629-total-characters-in-string-after-transformations-i ├── 3629-total-characters-in-string-after-transformations-i.cpp └── README.md ├── 363-max-sum-of-rectangle-no-larger-than-k ├── 363-max-sum-of-rectangle-no-larger-than-k.cpp ├── NOTES.md └── README.md ├── 3630-total-characters-in-string-after-transformations-ii ├── 3630-total-characters-in-string-after-transformations-ii.cpp └── README.md ├── 3633-maximize-the-number-of-target-nodes-after-connecting-trees-i ├── 3633-maximize-the-number-of-target-nodes-after-connecting-trees-i.cpp └── README.md ├── 3639-zero-array-transformation-i ├── 3639-zero-array-transformation-i.cpp └── README.md ├── 3643-zero-array-transformation-ii ├── 3643-zero-array-transformation-ii.cpp └── README.md ├── 3645-maximize-the-number-of-target-nodes-after-connecting-trees-ii ├── 3645-maximize-the-number-of-target-nodes-after-connecting-trees-ii.cpp └── README.md ├── 3647-zero-array-transformation-iii ├── 3647-zero-array-transformation-iii.cpp └── README.md ├── 365-water-and-jug-problem ├── 365-water-and-jug-problem.cpp └── README.md ├── 3656-minimum-number-of-operations-to-make-elements-in-array-distinct ├── 3656-minimum-number-of-operations-to-make-elements-in-array-distinct.cpp └── README.md ├── 3657-check-if-grid-can-be-cut-into-sections ├── 3657-check-if-grid-can-be-cut-into-sections.cpp └── README.md ├── 367-valid-perfect-square ├── 367-valid-perfect-square.cpp ├── NOTES.md └── README.md ├── 3683-find-the-lexicographically-largest-string-from-the-box-i └── README.md ├── 3685-count-subarrays-of-length-three-with-a-condition ├── 3685-count-subarrays-of-length-three-with-a-condition.cpp └── README.md ├── 37-sudoku-solver ├── 37-sudoku-solver.cpp └── README.md ├── 371-sum-of-two-integers └── 371-sum-of-two-integers.cpp ├── 374-guess-number-higher-or-lower ├── 374-guess-number-higher-or-lower.cpp ├── NOTES.md └── README.md ├── 376-wiggle-subsequence ├── 376-wiggle-subsequence.cpp ├── NOTES.md └── README.md ├── 377-combination-sum-iv ├── 377-combination-sum-iv.cpp ├── NOTES.md └── README.md ├── 378-kth-smallest-element-in-a-sorted-matrix ├── 378-kth-smallest-element-in-a-sorted-matrix.cpp ├── NOTES.md └── README.md ├── 380-insert-delete-getrandom-o1 ├── 380-insert-delete-getrandom-o1.cpp ├── NOTES.md └── README.md ├── 382-linked-list-random-node ├── 382-linked-list-random-node.cpp ├── NOTES.md └── README.md ├── 383-ransom-note ├── 383-ransom-note.cpp ├── NOTES.md └── README.md ├── 387-first-unique-character-in-a-string ├── 387-first-unique-character-in-a-string.cpp ├── NOTES.md └── README.md ├── 389-find-the-difference ├── 389-find-the-difference.cpp ├── NOTES.md └── README.md ├── 39-combination-sum ├── 39-combination-sum.cpp ├── NOTES.md └── README.md ├── 392-is-subsequence ├── 392-is-subsequence.cpp ├── NOTES.md └── README.md ├── 393-utf-8-validation ├── 393-utf-8-validation.cpp └── NOTES.md ├── 394-decode-string ├── NOTES.md └── README.md ├── 399-evaluate-division ├── 399-evaluate-division.cpp ├── NOTES.md └── README.md ├── 3sum-closest ├── 3sum-closest.cpp └── README.md ├── 3sum ├── 3sum.cpp └── README.md ├── 4-median-of-two-sorted-arrays ├── 4-median-of-two-sorted-arrays.cpp ├── NOTES.md └── README.md ├── 4. Nth Natural Number - GFG ├── 4.-nth-natural-number.cpp └── README.md ├── 40-combination-sum-ii ├── 40-combination-sum-ii.cpp └── NOTES.md ├── 402-remove-k-digits ├── 402-remove-k-digits.cpp ├── NOTES.md └── README.md ├── 404-sum-of-left-leaves ├── 404-sum-of-left-leaves.cpp └── NOTES.md ├── 406-queue-reconstruction-by-height ├── 406-queue-reconstruction-by-height.cpp ├── NOTES.md └── README.md ├── 409-longest-palindrome ├── NOTES.md └── README.md ├── 410-split-array-largest-sum ├── 410-split-array-largest-sum.cpp ├── NOTES.md └── README.md ├── 413-arithmetic-slices ├── 413-arithmetic-slices.cpp └── NOTES.md ├── 416-partition-equal-subset-sum ├── 416-partition-equal-subset-sum.cpp ├── NOTES.md └── README.md ├── 417-pacific-atlantic-water-flow ├── 417-pacific-atlantic-water-flow.cpp ├── NOTES.md └── README.md ├── 42-trapping-rain-water ├── 42-trapping-rain-water.cpp └── NOTES.md ├── 421-maximum-xor-of-two-numbers-in-an-array ├── 421-maximum-xor-of-two-numbers-in-an-array.cpp └── README.md ├── 424-longest-repeating-character-replacement ├── 424-longest-repeating-character-replacement.cpp ├── NOTES.md └── README.md ├── 429-n-ary-tree-level-order-traversal ├── 429-n-ary-tree-level-order-traversal.cpp └── NOTES.md ├── 43-multiply-strings ├── 43-multiply-strings.cpp ├── NOTES.md └── README.md ├── 433-minimum-genetic-mutation ├── 433-minimum-genetic-mutation.cpp ├── NOTES.md └── README.md ├── 434-number-of-segments-in-a-string ├── 434-number-of-segments-in-a-string.cpp ├── NOTES.md └── README.md ├── 435-non-overlapping-intervals └── README.md ├── 436-find-right-interval ├── 436-find-right-interval.cpp ├── NOTES.md └── README.md ├── 437-path-sum-iii ├── 437-path-sum-iii.cpp ├── NOTES.md └── README.md ├── 438-find-all-anagrams-in-a-string ├── 438-find-all-anagrams-in-a-string.cpp ├── NOTES.md └── README.md ├── 441-arranging-coins ├── 441-arranging-coins.cpp ├── NOTES.md └── README.md ├── 445-add-two-numbers-ii ├── 445-add-two-numbers-ii.cpp ├── NOTES.md └── README.md ├── 45-jump-game-ii ├── 45-jump-game-ii.cpp ├── NOTES.md └── README.md ├── 452-minimum-number-of-arrows-to-burst-balloons ├── 452-minimum-number-of-arrows-to-burst-balloons.cpp └── README.md ├── 454-4sum-ii ├── 454-4sum-ii.cpp ├── NOTES.md └── README.md ├── 456-132-pattern ├── 456-132-pattern.cpp └── NOTES.md ├── 458-poor-pigs ├── 458-poor-pigs.cpp ├── NOTES.md └── README.md ├── 459-repeated-substring-pattern ├── 459-repeated-substring-pattern.cpp ├── NOTES.md └── README.md ├── 46-permutations ├── 46-permutations.cpp ├── NOTES.md └── README.md ├── 462-minimum-moves-to-equal-array-elements-ii ├── 462-minimum-moves-to-equal-array-elements-ii.cpp └── NOTES.md ├── 47-permutations-ii ├── 47-permutations-ii.cpp ├── NOTES.md └── README.md ├── 473-matchsticks-to-square ├── 473-matchsticks-to-square.cpp ├── NOTES.md └── README.md ├── 474-ones-and-zeroes ├── 474-ones-and-zeroes.cpp ├── NOTES.md └── README.md ├── 48-rotate-image ├── 48-rotate-image.cpp ├── NOTES.md └── README.md ├── 485-max-consecutive-ones └── 485-max-consecutive-ones.cpp ├── 49-group-anagrams ├── 49-group-anagrams.cpp ├── NOTES.md └── README.md ├── 493-reverse-pairs ├── 493-reverse-pairs.cpp ├── NOTES.md └── README.md ├── 5-longest-palindromic-substring ├── 5-longest-palindromic-substring.cpp ├── NOTES.md └── README.md ├── 5. Smallest Positive Integer that can not be represented as Sum - GFG └── 5.-smallest-positive-integer-that-can-not-be-represented-as-sum.cpp ├── 50-powx-n └── NOTES.md ├── 503-next-greater-element-ii └── 503-next-greater-element-ii.cpp ├── 504-base-7 ├── 504-base-7.cpp └── NOTES.md ├── 509-fibonacci-number ├── 509-fibonacci-number.cpp ├── NOTES.md └── README.md ├── 51-n-queens ├── 51-n-queens.cpp ├── NOTES.md └── README.md ├── 511-game-play-analysis-i ├── 511-game-play-analysis-i.sql ├── NOTES.md └── README.md ├── 52-n-queens-ii ├── 52-n-queens-ii.cpp ├── NOTES.md └── README.md ├── 520-detect-capital └── 520-detect-capital.cpp ├── 525-contiguous-array ├── 525-contiguous-array.cpp ├── NOTES.md └── README.md ├── 528-random-pick-with-weight ├── 528-random-pick-with-weight.cpp ├── NOTES.md └── README.md ├── 53-maximum-subarray ├── 53-maximum-subarray.cpp ├── NOTES.md └── README.md ├── 532-k-diff-pairs-in-an-array ├── 532-k-diff-pairs-in-an-array.cpp ├── NOTES.md └── README.md ├── 535-encode-and-decode-tinyurl ├── 535-encode-and-decode-tinyurl.cpp ├── NOTES.md └── README.md ├── 538-convert-bst-to-greater-tree ├── 538-convert-bst-to-greater-tree.cpp ├── NOTES.md └── README.md ├── 54-spiral-matrix ├── 54-spiral-matrix.cpp ├── NOTES.md └── README.md ├── 540-single-element-in-a-sorted-array ├── 540-single-element-in-a-sorted-array.cpp ├── NOTES.md └── README.md ├── 542-01-matrix ├── 542-01-matrix.cpp └── README.md ├── 543-diameter-of-binary-tree ├── 543-diameter-of-binary-tree.cpp ├── NOTES.md └── README.md ├── 547-number-of-provinces ├── 547-number-of-provinces.cpp ├── NOTES.md └── README.md ├── 55-jump-game └── README.md ├── 556-next-greater-element-iii ├── 556-next-greater-element-iii.cpp └── NOTES.md ├── 56-merge-intervals ├── 56-merge-intervals.cpp ├── NOTES.md └── README.md ├── 560-subarray-sum-equals-k ├── 560-subarray-sum-equals-k.cpp └── NOTES.md ├── 561-array-partition-i ├── 561-array-partition-i.cpp └── NOTES.md ├── 566-reshape-the-matrix ├── 566-reshape-the-matrix.cpp ├── NOTES.md └── README.md ├── 567-permutation-in-string ├── 567-permutation-in-string.cpp └── NOTES.md ├── 57-insert-interval ├── 57-insert-interval.cpp ├── NOTES.md └── README.md ├── 572-subtree-of-another-tree └── README.md ├── 576-out-of-boundary-paths ├── 576-out-of-boundary-paths.cpp ├── NOTES.md └── README.md ├── 58-length-of-last-word ├── 58-length-of-last-word.cpp ├── NOTES.md └── README.md ├── 581-shortest-unsorted-continuous-subarray ├── 581-shortest-unsorted-continuous-subarray.cpp ├── NOTES.md └── README.md ├── 583-delete-operation-for-two-strings ├── 583-delete-operation-for-two-strings.cpp ├── NOTES.md └── README.md ├── 584-find-customer-referee ├── 584-find-customer-referee.sql ├── NOTES.md └── README.md ├── 586-customer-placing-the-largest-number-of-orders ├── 586-customer-placing-the-largest-number-of-orders.sql ├── NOTES.md └── README.md ├── 589-n-ary-tree-preorder-traversal ├── 589-n-ary-tree-preorder-traversal.cpp ├── NOTES.md └── README.md ├── 59-spiral-matrix-ii ├── 59-spiral-matrix-ii.cpp ├── NOTES.md └── README.md ├── 595-big-countries ├── 595-big-countries.sql ├── NOTES.md └── README.md ├── 60-permutation-sequence ├── 60-permutation-sequence.cpp └── NOTES.md ├── 605-can-place-flowers └── 605-can-place-flowers.cpp ├── 606-construct-string-from-binary-tree ├── 606-construct-string-from-binary-tree.cpp ├── NOTES.md └── README.md ├── 607-sales-person ├── 607-sales-person.sql └── NOTES.md ├── 608-tree-node ├── 608-tree-node.sql ├── NOTES.md └── README.md ├── 61-rotate-list ├── 61-rotate-list.cpp ├── NOTES.md └── README.md ├── 611-valid-triangle-number ├── 611-valid-triangle-number.cpp ├── NOTES.md └── README.md ├── 62-unique-paths ├── 62-unique-paths.cpp ├── NOTES.md └── README.md ├── 621-task-scheduler ├── NOTES.md └── README.md ├── 622-design-circular-queue ├── 622-design-circular-queue.cpp ├── NOTES.md └── README.md ├── 627-swap-salary ├── 627-swap-salary.sql ├── NOTES.md └── README.md ├── 629-k-inverse-pairs-array ├── 629-k-inverse-pairs-array.cpp └── NOTES.md ├── 63-unique-paths-ii ├── 63-unique-paths-ii.cpp ├── NOTES.md └── README.md ├── 630-course-schedule-iii ├── 630-course-schedule-iii.cpp └── NOTES.md ├── 633-sum-of-square-numbers ├── 633-sum-of-square-numbers.cpp ├── NOTES.md └── README.md ├── 637-average-of-levels-in-binary-tree ├── 637-average-of-levels-in-binary-tree.cpp └── NOTES.md ├── 647-palindromic-substrings ├── 647-palindromic-substrings.cpp ├── NOTES.md └── README.md ├── 653-two-sum-iv-input-is-a-bst └── README.md ├── 657-robot-return-to-origin ├── 657-robot-return-to-origin.cpp ├── NOTES.md └── README.md ├── 658-find-k-closest-elements ├── 658-find-k-closest-elements.cpp ├── NOTES.md └── README.md ├── 659-split-array-into-consecutive-subsequences ├── 659-split-array-into-consecutive-subsequences.cpp ├── NOTES.md └── README.md ├── 66-plus-one ├── 66-plus-one.cpp └── NOTES.md ├── 662-maximum-width-of-binary-tree ├── 662-maximum-width-of-binary-tree.cpp ├── NOTES.md └── README.md ├── 665-non-decreasing-array ├── 665-non-decreasing-array.cpp └── NOTES.md ├── 669-trim-a-binary-search-tree ├── 669-trim-a-binary-search-tree.cpp ├── NOTES.md └── README.md ├── 67-add-binary ├── 67-add-binary.cpp ├── NOTES.md └── README.md ├── 680-valid-palindrome-ii ├── 680-valid-palindrome-ii.cpp ├── NOTES.md └── README.md ├── 682-baseball-game ├── 682-baseball-game.cpp └── NOTES.md ├── 69-sqrtx ├── 69-sqrtx.cpp ├── NOTES.md └── README.md ├── 692-top-k-frequent-words ├── 692-top-k-frequent-words.cpp ├── NOTES.md └── README.md ├── 695-max-area-of-island ├── 695-max-area-of-island.cpp └── README.md ├── 697-degree-of-an-array └── NOTES.md ├── 70-climbing-stairs ├── 70-climbing-stairs.cpp ├── NOTES.md └── README.md ├── 700-search-in-a-binary-search-tree ├── 700-search-in-a-binary-search-tree.cpp ├── NOTES.md └── README.md ├── 701-insert-into-a-binary-search-tree ├── 701-insert-into-a-binary-search-tree.cpp ├── NOTES.md └── README.md ├── 703-kth-largest-element-in-a-stream ├── 703-kth-largest-element-in-a-stream.cpp └── NOTES.md ├── 704-binary-search ├── 704-binary-search.cpp ├── NOTES.md └── README.md ├── 705-design-hashset ├── 705-design-hashset.cpp ├── NOTES.md └── README.md ├── 706-design-hashmap ├── 706-design-hashmap.cpp ├── NOTES.md └── README.md ├── 707-design-linked-list ├── 707-design-linked-list.cpp ├── NOTES.md └── README.md ├── 709-to-lower-case ├── 709-to-lower-case.cpp └── NOTES.md ├── 71-simplify-path ├── 71-simplify-path.cpp ├── NOTES.md └── README.md ├── 713-subarray-product-less-than-k ├── 713-subarray-product-less-than-k.cpp ├── NOTES.md └── README.md ├── 717-1-bit-and-2-bit-characters ├── 717-1-bit-and-2-bit-characters.cpp ├── NOTES.md └── README.md ├── 72-edit-distance └── NOTES.md ├── 724-find-pivot-index ├── 724-find-pivot-index.cpp ├── NOTES.md └── README.md ├── 729-my-calendar-i ├── 729-my-calendar-i.cpp ├── NOTES.md └── README.md ├── 73-set-matrix-zeroes ├── 73-set-matrix-zeroes.cpp ├── NOTES.md └── README.md ├── 733-flood-fill ├── 733-flood-fill.cpp ├── NOTES.md └── README.md ├── 735-asteroid-collision ├── 735-asteroid-collision.cpp ├── NOTES.md └── README.md ├── 739-daily-temperatures ├── 739-daily-temperatures.cpp ├── NOTES.md └── README.md ├── 74-search-a-2d-matrix ├── 74-search-a-2d-matrix.cpp ├── NOTES.md └── README.md ├── 740-delete-and-earn ├── 740-delete-and-earn.cpp └── NOTES.md ├── 743-network-delay-time ├── 743-network-delay-time.cpp └── NOTES.md ├── 744-find-smallest-letter-greater-than-target ├── 744-find-smallest-letter-greater-than-target.cpp ├── NOTES.md └── README.md ├── 745-prefix-and-suffix-search └── NOTES.md ├── 746-min-cost-climbing-stairs ├── 746-min-cost-climbing-stairs.cpp └── NOTES.md ├── 75-sort-colors └── 75-sort-colors.cpp ├── 752-open-the-lock ├── 752-open-the-lock.cpp ├── NOTES.md └── README.md ├── 76-minimum-window-substring ├── NOTES.md └── README.md ├── 763-partition-labels ├── 763-partition-labels.cpp ├── NOTES.md └── README.md ├── 78-subsets └── README.md ├── 785-is-graph-bipartite ├── 785-is-graph-bipartite.cpp ├── NOTES.md └── README.md ├── 79-word-search └── README.md ├── 792-number-of-matching-subsequences └── 792-number-of-matching-subsequences.cpp ├── 797-all-paths-from-source-to-target ├── 797-all-paths-from-source-to-target.cpp └── README.md ├── 799-champagne-tower ├── 799-champagne-tower.cpp └── README.md ├── 8-string-to-integer-atoi ├── 8-string-to-integer-atoi.cpp ├── NOTES.md └── README.md ├── 80-remove-duplicates-from-sorted-array-ii ├── 80-remove-duplicates-from-sorted-array-ii.cpp ├── NOTES.md └── README.md ├── 802-find-eventual-safe-states ├── 802-find-eventual-safe-states.cpp └── NOTES.md ├── 804-unique-morse-code-words ├── 804-unique-morse-code-words.cpp ├── NOTES.md └── README.md ├── 81-search-in-rotated-sorted-array-ii ├── 81-search-in-rotated-sorted-array-ii.cpp ├── NOTES.md └── README.md ├── 814-binary-tree-pruning ├── 814-binary-tree-pruning.cpp ├── NOTES.md └── README.md ├── 815-bus-routes ├── 815-bus-routes.cpp ├── NOTES.md └── README.md ├── 82-remove-duplicates-from-sorted-list-ii ├── 82-remove-duplicates-from-sorted-list-ii.cpp ├── NOTES.md └── README.md ├── 820-short-encoding-of-words ├── 820-short-encoding-of-words.cpp ├── NOTES.md └── README.md ├── 823-binary-trees-with-factors ├── 823-binary-trees-with-factors.cpp ├── NOTES.md └── README.md ├── 826-most-profit-assigning-work ├── 826-most-profit-assigning-work.cpp ├── NOTES.md └── README.md ├── 84-largest-rectangle-in-histogram ├── 84-largest-rectangle-in-histogram.cpp └── README.md ├── 841-keys-and-rooms ├── 841-keys-and-rooms.cpp └── README.md ├── 844-backspace-string-compare ├── 844-backspace-string-compare.cpp ├── NOTES.md └── README.md ├── 847-shortest-path-visiting-all-nodes ├── 847-shortest-path-visiting-all-nodes.cpp └── NOTES.md ├── 849-maximize-distance-to-closest-person ├── 849-maximize-distance-to-closest-person.cpp ├── NOTES.md └── README.md ├── 852-peak-index-in-a-mountain-array ├── 852-peak-index-in-a-mountain-array.cpp ├── NOTES.md └── README.md ├── 856-score-of-parentheses ├── 856-score-of-parentheses.cpp └── NOTES.md ├── 858-mirror-reflection ├── 858-mirror-reflection.cpp ├── NOTES.md └── README.md ├── 86-partition-list ├── 86-partition-list.cpp └── README.md ├── 860-lemonade-change ├── 860-lemonade-change.cpp ├── NOTES.md └── README.md ├── 863-all-nodes-distance-k-in-binary-tree ├── 863-all-nodes-distance-k-in-binary-tree.cpp ├── NOTES.md └── README.md ├── 867-transpose-matrix ├── 867-transpose-matrix.cpp └── NOTES.md ├── 869-reordered-power-of-2 ├── 869-reordered-power-of-2.cpp ├── NOTES.md └── README.md ├── 871-minimum-number-of-refueling-stops ├── 871-minimum-number-of-refueling-stops.cpp ├── NOTES.md └── README.md ├── 875-koko-eating-bananas ├── 875-koko-eating-bananas.cpp ├── NOTES.md └── README.md ├── 876-middle-of-the-linked-list ├── 876-middle-of-the-linked-list.cpp ├── NOTES.md └── README.md ├── 88-merge-sorted-array ├── 88-merge-sorted-array.cpp ├── NOTES.md └── README.md ├── 881-boats-to-save-people ├── 881-boats-to-save-people.cpp ├── NOTES.md └── README.md ├── 886-possible-bipartition ├── 886-possible-bipartition.cpp ├── NOTES.md └── README.md ├── 890-find-and-replace-pattern ├── 890-find-and-replace-pattern.cpp ├── NOTES.md └── README.md ├── 895-maximum-frequency-stack ├── 895-maximum-frequency-stack.cpp ├── NOTES.md └── README.md ├── 896-monotonic-array ├── 896-monotonic-array.cpp ├── NOTES.md └── README.md ├── 897-increasing-order-search-tree ├── 897-increasing-order-search-tree.cpp ├── NOTES.md └── README.md ├── 90-subsets-ii ├── 90-subsets-ii.cpp ├── NOTES.md └── README.md ├── 901-online-stock-span ├── 901-online-stock-span.cpp └── NOTES.md ├── 905-sort-array-by-parity ├── 905-sort-array-by-parity.cpp ├── NOTES.md └── README.md ├── 91-decode-ways ├── 91-decode-ways.cpp └── NOTES.md ├── 910-smallest-range-ii ├── 910-smallest-range-ii.cpp ├── NOTES.md └── README.md ├── 911-online-election ├── 911-online-election.cpp ├── NOTES.md └── README.md ├── 916-word-subsets ├── 916-word-subsets.cpp └── NOTES.md ├── 92-reverse-linked-list-ii ├── NOTES.md └── README.md ├── 923-3sum-with-multiplicity ├── 923-3sum-with-multiplicity.cpp ├── NOTES.md └── README.md ├── 934-shortest-bridge └── README.md ├── 936-stamping-the-sequence ├── 936-stamping-the-sequence.cpp ├── NOTES.md └── README.md ├── 94-binary-tree-inorder-traversal ├── 94-binary-tree-inorder-traversal.cpp ├── NOTES.md └── README.md ├── 941-valid-mountain-array └── NOTES.md ├── 946-validate-stack-sequences ├── 946-validate-stack-sequences.cpp └── README.md ├── 947-most-stones-removed-with-same-row-or-column ├── 947-most-stones-removed-with-same-row-or-column.cpp └── NOTES.md ├── 948-bag-of-tokens └── NOTES.md ├── 953-verifying-an-alien-dictionary ├── 953-verifying-an-alien-dictionary.cpp └── NOTES.md ├── 967-numbers-with-same-consecutive-differences ├── 967-numbers-with-same-consecutive-differences.cpp ├── NOTES.md └── README.md ├── 968-binary-tree-cameras ├── 968-binary-tree-cameras.cpp ├── NOTES.md └── README.md ├── 97-interleaving-string ├── 97-interleaving-string.cpp └── README.md ├── 973-k-closest-points-to-origin ├── 973-k-closest-points-to-origin.cpp ├── NOTES.md └── README.md ├── 976-largest-perimeter-triangle ├── 976-largest-perimeter-triangle.cpp └── NOTES.md ├── 98-validate-binary-search-tree ├── 98-validate-binary-search-tree.cpp ├── NOTES.md └── README.md ├── 981-time-based-key-value-store ├── 981-time-based-key-value-store.cpp ├── NOTES.md └── README.md ├── 987-vertical-order-traversal-of-a-binary-tree ├── 987-vertical-order-traversal-of-a-binary-tree.cpp ├── NOTES.md └── README.md ├── 989-add-to-array-form-of-integer ├── 989-add-to-array-form-of-integer.cpp ├── NOTES.md └── README.md ├── 99-recover-binary-search-tree ├── 99-recover-binary-search-tree.cpp ├── NOTES.md └── README.md ├── 991-broken-calculator ├── 991-broken-calculator.cpp ├── NOTES.md └── README.md ├── 994-rotting-oranges ├── 994-rotting-oranges.cpp ├── NOTES.md └── README.md ├── 997-find-the-town-judge ├── 997-find-the-town-judge.cpp ├── NOTES.md └── README.md ├── Adding Ones - GFG ├── README.md └── adding-ones.cpp ├── BFS of graph - GFG ├── README.md └── bfs-of-graph.cpp ├── Bleak Numbers - GFG ├── README.md └── bleak-numbers.cpp ├── Bottom View of Binary Tree - GFG └── bottom-view-of-binary-tree.cpp ├── Check if Tree is Isomorphic - GFG ├── README.md └── check-if-tree-is-isomorphic.cpp ├── Check whether K-th bit is set or not - GFG ├── README.md └── check-whether-kth-bit-is-set-or-not.cpp ├── Circular tour - GFG └── README.md ├── Connect Nodes at Same Level - GFG └── README.md ├── Count Inversions - GFG ├── README.md └── count-inversions.cpp ├── Count Total Setbits - GFG └── README.md ├── Count number of hops - GFG ├── README.md └── count-number-of-hops.cpp ├── Delete a Node in Single Linked List - GFG ├── README.md └── delete-a-node-in-single-linked-list.cpp ├── Detect cycle in a directed graph - GFG └── detect-cycle-in-a-directed-graph.cpp ├── Detect cycle in an undirected graph - GFG ├── README.md └── detect-cycle-in-an-undirected-graph.cpp ├── Distance from the Source (Bellman-Ford Algorithm) - GFG └── distance-from-the-source-bellman-ford-algorithm.cpp ├── Eventual Safe States - GFG ├── README.md └── eventual-safe-states.cpp ├── Find Number - GFG └── find-number.cpp ├── Find first set bit - GFG ├── README.md └── find-first-set-bit.cpp ├── Flattening a Linked List - GFG └── README.md ├── Floyd Warshall - GFG └── floyd-warshall.cpp ├── Fractional Knapsack - GFG └── README.md ├── Friendly Array - GFG └── README.md ├── Height of Spiral Tree - GFG └── height-of-spiral-tree.cpp ├── Implementing Dijkstra Algorithm - GFG └── implementing-dijkstra-algorithm.cpp ├── Insert a node in a BST - GFG ├── README.md └── insert-a-node-in-a-bst.cpp ├── Job Sequencing Problem - GFG ├── README.md └── job-sequencing-problem.cpp ├── K-th element of two sorted Arrays - GFG ├── README.md └── kth-element-of-two-sorted-arrays.cpp ├── Kth largest element in BST - GFG ├── README.md └── kth-largest-element-in-bst.cpp ├── Largest subarray with 0 sum - GFG ├── README.md └── largest-subarray-with-0-sum.cpp ├── Leaders in an array - GFG ├── README.md └── leaders-in-an-array.cpp ├── Least Prime Factor - GFG └── README.md ├── Left View of Binary Tree - GFG └── README.md ├── Longest Common Subsequence - GFG ├── README.md └── longest-common-subsequence.cpp ├── Longest Increasing Subsequence - GFG ├── README.md └── longest-increasing-subsequence.cpp ├── Longest K unique characters substring - GFG ├── README.md └── longest-k-unique-characters-substring.cpp ├── Longest Repeating Subsequence - GFG └── longest-repeating-subsequence.cpp ├── M-Coloring Problem - GFG ├── README.md └── mcoloring-problem.cpp ├── Maximum Depth Of Binary Tree - GFG └── README.md ├── Maximum of minimum for every window size - GFG └── README.md ├── Maximum sum increasing subsequence - GFG ├── README.md └── maximum-sum-increasing-subsequence.cpp ├── Maximum sum of Non-adjacent nodes - GFG ├── README.md └── maximum-sum-of-nonadjacent-nodes.cpp ├── Minimum Cost of ropes - GFG ├── README.md └── minimum-cost-of-ropes.cpp ├── Minimum Platforms - GFG ├── README.md └── minimum-platforms.cpp ├── Minimum Spanning Tree - GFG ├── README.md └── minimum-spanning-tree.cpp ├── Mirror Tree - GFG └── mirror-tree.cpp ├── N meetings in one room - GFG └── n-meetings-in-one-room.cpp ├── Non Repeating Character - GFG └── non-repeating-character.cpp ├── Nth catalan number - GFG ├── README.md └── nth-catalan-number.cpp ├── Number of 1 Bits - GFG └── README.md ├── Number of Subarrays of 0's - GFG └── README.md ├── Palindromic Partitioning - GFG ├── README.md └── palindromic-partitioning.cpp ├── Palindromic patitioning - GFG ├── README.md └── palindromic-patitioning.cpp ├── Partition Equal Subset Sum - GFG ├── README.md └── partition-equal-subset-sum.cpp ├── Perfect Numbers - GFG ├── README.md └── perfect-numbers.cpp ├── Power of 2 - GFG ├── README.md └── power-of-2.cpp ├── Powerfull Integer - GFG ├── README.md └── powerfull-integer.cpp ├── Predecessor and Successor - GFG ├── README.md └── predecessor-and-successor.cpp ├── Print adjacency list - GFG ├── README.md └── print-adjacency-list.cpp ├── Print first n Fibonacci Numbers - GFG ├── README.md └── print-first-n-fibonacci-numbers.cpp ├── Queue Operations - GFG ├── README.md └── queue-operations.cpp ├── README.md ├── Rat in a Maze Problem - I - GFG ├── README.md └── rat-in-a-maze-problem-i.cpp ├── Rearrange an array with O(1) extra space - GFG ├── README.md └── rearrange-an-array-with-o1-extra-space.cpp ├── Reverse Coding - GFG ├── README.md └── reverse-coding.cpp ├── Seating Arrangement - GFG └── seating-arrangement.cpp ├── Subarray with given sum - GFG ├── README.md └── subarray-with-given-sum.cpp ├── Subset Sums - GFG ├── README.md └── subset-sums.cpp ├── The Celebrity Problem - GFG ├── README.md └── the-celebrity-problem.cpp ├── Ticket Counter - GFG └── ticket-counter.cpp ├── Top View of Binary Tree - GFG └── README.md ├── Wave Array - GFG ├── README.md └── wave-array.cpp ├── Word Break - GFG └── word-break.cpp ├── accounts-merge ├── README.md └── accounts-merge.cpp ├── add-strings ├── README.md └── add-strings.cpp ├── add-two-numbers ├── README.md └── add-two-numbers.cpp ├── airplane-seat-assignment-probability ├── README.md └── airplane-seat-assignment-probability.cpp ├── all-paths-from-source-to-target ├── README.md └── all-paths-from-source-to-target.cpp ├── arithmetic-slices ├── README.md └── arithmetic-slices.cpp ├── arranging-coins ├── README.md └── arranging-coins.cpp ├── backspace-string-compare ├── README.md └── backspace-string-compare.cpp ├── basic-calculator-ii ├── README.md └── basic-calculator-ii.cpp ├── basic-calculator ├── README.md └── basic-calculator.cpp ├── best-sightseeing-pair ├── README.md └── best-sightseeing-pair.cpp ├── best-time-to-buy-and-sell-stock-ii ├── README.md └── best-time-to-buy-and-sell-stock-ii.cpp ├── best-time-to-buy-and-sell-stock-iii ├── README.md └── best-time-to-buy-and-sell-stock-iii.cpp ├── best-time-to-buy-and-sell-stock-with-cooldown ├── README.md └── best-time-to-buy-and-sell-stock-with-cooldown.cpp ├── best-time-to-buy-and-sell-stock-with-transaction-fee ├── README.md └── best-time-to-buy-and-sell-stock-with-transaction-fee.cpp ├── best-time-to-buy-and-sell-stock ├── README.md └── best-time-to-buy-and-sell-stock.cpp ├── big-countries └── README.md ├── binary-search-tree-iterator ├── README.md └── binary-search-tree-iterator.cpp ├── binary-search ├── README.md └── binary-search.cpp ├── binary-tree-inorder-traversal └── README.md ├── binary-tree-level-order-traversal ├── README.md └── binary-tree-level-order-traversal.cpp ├── binary-tree-maximum-path-sum ├── README.md └── binary-tree-maximum-path-sum.cpp ├── binary-tree-paths ├── README.md └── binary-tree-paths.cpp ├── binary-tree-postorder-traversal └── README.md ├── binary-tree-preorder-traversal └── README.md ├── binary-tree-right-side-view ├── README.md └── binary-tree-right-side-view.cpp ├── binary-tree-tilt ├── README.md └── binary-tree-tilt.cpp ├── binary-tree-zigzag-level-order-traversal ├── README.md └── binary-tree-zigzag-level-order-traversal.cpp ├── bitwise-and-of-numbers-range ├── README.md └── bitwise-and-of-numbers-range.cpp ├── build-array-from-permutation ├── README.md └── build-array-from-permutation.cpp ├── burst-balloons ├── README.md └── burst-balloons.cpp ├── check-if-it-is-a-good-array ├── README.md └── check-if-it-is-a-good-array.cpp ├── check-if-two-string-arrays-are-equivalent ├── README.md └── check-if-two-string-arrays-are-equivalent.cpp ├── classes-more-than-5-students ├── README.md └── classes-more-than-5-students.sql ├── climbing-stairs ├── README.md └── climbing-stairs.cpp ├── clone-graph ├── README.md └── clone-graph.cpp ├── coin-change-2 ├── README.md └── coin-change-2.cpp ├── coin-change ├── README.md └── coin-change.cpp ├── combination-sum-ii ├── README.md └── combination-sum-ii.cpp ├── combination-sum-iv ├── README.md └── combination-sum-iv.cpp ├── combination-sum ├── README.md └── combination-sum.cpp ├── combinations ├── README.md └── combinations.cpp ├── complement-of-base-10-integer └── README.md ├── concatenation-of-array └── README.md ├── consecutive-characters ├── README.md └── consecutive-characters.cpp ├── construct-binary-search-tree-from-preorder-traversal ├── README.md └── construct-binary-search-tree-from-preorder-traversal.cpp ├── construct-binary-tree-from-inorder-and-postorder-traversal ├── README.md └── construct-binary-tree-from-inorder-and-postorder-traversal.cpp ├── construct-binary-tree-from-preorder-and-inorder-traversal ├── README.md └── construct-binary-tree-from-preorder-and-inorder-traversal.cpp ├── container-with-most-water ├── README.md └── container-with-most-water.cpp ├── contains-duplicate ├── README.md └── contains-duplicate.cpp ├── convert-1d-array-into-2d-array ├── README.md └── convert-1d-array-into-2d-array.cpp ├── convert-a-number-to-hexadecimal ├── README.md └── convert-a-number-to-hexadecimal.cpp ├── convert-binary-number-in-a-linked-list-to-integer ├── README.md └── convert-binary-number-in-a-linked-list-to-integer.cpp ├── count-complete-tree-nodes ├── README.md └── count-complete-tree-nodes.cpp ├── count-primes ├── README.md └── count-primes.cpp ├── counting-bits ├── README.md └── counting-bits.cpp ├── course-schedule-ii ├── README.md └── course-schedule-ii.cpp ├── course-schedule ├── README.md └── course-schedule.cpp ├── cousins-in-binary-tree ├── README.md └── cousins-in-binary-tree.cpp ├── customers-who-never-order └── README.md ├── daily-temperatures ├── README.md └── daily-temperatures.cpp ├── decode-string ├── README.md └── decode-string.cpp ├── decode-ways ├── README.md └── decode-ways.cpp ├── decode-xored-array ├── README.md └── decode-xored-array.cpp ├── decompress-run-length-encoded-list └── README.md ├── deepest-leaves-sum ├── README.md └── deepest-leaves-sum.cpp ├── defanging-an-ip-address └── README.md ├── delete-and-earn ├── README.md └── delete-and-earn.cpp ├── delete-duplicate-emails ├── README.md └── delete-duplicate-emails.sql ├── delete-node-in-a-bst ├── README.md └── delete-node-in-a-bst.cpp ├── delete-operation-for-two-strings ├── README.md └── delete-operation-for-two-strings.cpp ├── design-a-stack-with-increment-operation ├── README.md └── design-a-stack-with-increment-operation.cpp ├── design-add-and-search-words-data-structure ├── README.md └── design-add-and-search-words-data-structure.cpp ├── design-browser-history ├── README.md └── design-browser-history.cpp ├── design-hashmap ├── README.md └── design-hashmap.cpp ├── design-linked-list ├── README.md └── design-linked-list.cpp ├── design-parking-system ├── README.md └── design-parking-system.cpp ├── design-skiplist ├── README.md └── design-skiplist.cpp ├── diameter-of-binary-tree └── README.md ├── divisor-game ├── README.md └── divisor-game.cpp ├── domino-and-tromino-tiling ├── README.md └── domino-and-tromino-tiling.cpp ├── dungeon-game ├── README.md └── dungeon-game.cpp ├── duplicate-emails ├── README.md └── duplicate-emails.sql ├── edit-distance ├── README.md └── edit-distance.cpp ├── employees-earning-more-than-their-managers ├── README.md └── employees-earning-more-than-their-managers.sql ├── encode-and-decode-tinyurl ├── README.md └── encode-and-decode-tinyurl.cpp ├── excel-sheet-column-title ├── README.md └── excel-sheet-column-title.cpp ├── fibonacci-number └── README.md ├── final-value-of-variable-after-performing-operations ├── README.md └── final-value-of-variable-after-performing-operations.cpp ├── find-all-anagrams-in-a-string ├── README.md └── find-all-anagrams-in-a-string.cpp ├── find-all-duplicates-in-an-array ├── README.md └── find-all-duplicates-in-an-array.cpp ├── find-all-numbers-disappeared-in-an-array ├── README.md └── find-all-numbers-disappeared-in-an-array.cpp ├── find-first-and-last-position-of-element-in-sorted-array ├── README.md └── find-first-and-last-position-of-element-in-sorted-array.cpp ├── find-greatest-common-divisor-of-array └── README.md ├── find-median-from-data-stream ├── README.md └── find-median-from-data-stream.cpp ├── find-minimum-in-rotated-sorted-array-ii ├── README.md └── find-minimum-in-rotated-sorted-array-ii.cpp ├── find-minimum-in-rotated-sorted-array ├── README.md └── find-minimum-in-rotated-sorted-array.cpp ├── find-peak-element ├── README.md └── find-peak-element.cpp ├── find-the-difference ├── README.md └── find-the-difference.cpp ├── find-the-duplicate-number ├── README.md └── find-the-duplicate-number.cpp ├── find-the-highest-altitude ├── README.md └── find-the-highest-altitude.cpp ├── find-the-minimum-and-maximum-number-of-nodes-between-critical-points ├── README.md └── find-the-minimum-and-maximum-number-of-nodes-between-critical-points.cpp ├── find-the-town-judge ├── README.md └── find-the-town-judge.cpp ├── find-the-winner-of-the-circular-game └── README.md ├── first-bad-version ├── README.md └── first-bad-version.cpp ├── first-unique-character-in-a-string ├── README.md └── first-unique-character-in-a-string.cpp ├── flatten-a-multilevel-doubly-linked-list ├── README.md └── flatten-a-multilevel-doubly-linked-list.cpp ├── flipping-an-image ├── README.md └── flipping-an-image.cpp ├── flood-fill ├── README.md └── flood-fill.cpp ├── generate-parentheses ├── README.md └── generate-parentheses.cpp ├── get-maximum-in-generated-array ├── README.md └── get-maximum-in-generated-array.cpp ├── group-anagrams ├── README.md └── group-anagrams.cpp ├── guess-number-higher-or-lower ├── README.md └── guess-number-higher-or-lower.cpp ├── h-index ├── README.md └── h-index.cpp ├── hamming-distance ├── README.md └── hamming-distance.cpp ├── happy-number ├── README.md └── happy-number.cpp ├── house-robber-ii ├── README.md └── house-robber-ii.cpp ├── house-robber-iii ├── README.md └── house-robber-iii.cpp ├── house-robber ├── README.md └── house-robber.cpp ├── how-many-numbers-are-smaller-than-the-current-number ├── README.md └── how-many-numbers-are-smaller-than-the-current-number.cpp ├── implement-queue-using-stacks ├── README.md └── implement-queue-using-stacks.cpp ├── implement-rand10-using-rand7 ├── README.md └── implement-rand10-using-rand7.cpp ├── implement-stack-using-queues ├── README.md └── implement-stack-using-queues.cpp ├── implement-trie-prefix-tree ├── README.md └── implement-trie-prefix-tree.cpp ├── increasing-triplet-subsequence ├── README.md └── increasing-triplet-subsequence.cpp ├── insert-delete-getrandom-o1 ├── README.md └── insert-delete-getrandom-o1.cpp ├── insert-interval ├── README.md └── insert-interval.cpp ├── insert-into-a-binary-search-tree ├── README.md └── insert-into-a-binary-search-tree.cpp ├── insertion-sort-list ├── README.md └── insertion-sort-list.cpp ├── integer-break ├── README.md └── integer-break.cpp ├── intersection-of-two-arrays-ii ├── README.md └── intersection-of-two-arrays-ii.cpp ├── intersection-of-two-arrays ├── README.md └── intersection-of-two-arrays.cpp ├── intersection-of-two-linked-lists ├── README.md └── intersection-of-two-linked-lists.cpp ├── interval-list-intersections ├── README.md └── interval-list-intersections.cpp ├── invert-binary-tree ├── README.md └── invert-binary-tree.cpp ├── is-subsequence ├── README.md └── is-subsequence.cpp ├── island-perimeter ├── README.md └── island-perimeter.cpp ├── isomorphic-strings ├── README.md └── isomorphic-strings.cpp ├── iterator-for-combination ├── README.md └── iterator-for-combination.cpp ├── jewels-and-stones ├── README.md └── jewels-and-stones.cpp ├── jump-game-ii ├── README.md └── jump-game-ii.cpp ├── jump-game-iii ├── README.md └── jump-game-iii.cpp ├── jump-game ├── README.md └── jump-game.cpp ├── k largest elements - GFG ├── README.md └── k-largest-elements.cpp ├── k-closest-points-to-origin ├── README.md └── k-closest-points-to-origin.cpp ├── keys-and-rooms ├── README.md └── keys-and-rooms.cpp ├── kids-with-the-greatest-number-of-candies └── README.md ├── kth-largest-element-in-an-array ├── README.md └── kth-largest-element-in-an-array.cpp ├── kth-smallest-element-in-a-bst ├── README.md └── kth-smallest-element-in-a-bst.cpp ├── kth-smallest-number-in-multiplication-table ├── README.md └── kth-smallest-number-in-multiplication-table.cpp ├── largest-component-size-by-common-factor ├── README.md └── largest-component-size-by-common-factor.cpp ├── largest-divisible-subset ├── README.md └── largest-divisible-subset.cpp ├── largest-number ├── README.md └── largest-number.cpp ├── largest-rectangle-in-histogram ├── README.md └── largest-rectangle-in-histogram.cpp ├── letter-case-permutation ├── README.md └── letter-case-permutation.cpp ├── letter-combinations-of-a-phone-number └── README.md ├── linked-list-cycle-ii ├── README.md └── linked-list-cycle-ii.cpp ├── linked-list-cycle ├── README.md └── linked-list-cycle.cpp ├── longest-common-subsequence ├── README.md └── longest-common-subsequence.cpp ├── longest-consecutive-sequence ├── README.md └── longest-consecutive-sequence.cpp ├── longest-duplicate-substring ├── README.md └── longest-duplicate-substring.cpp ├── longest-increasing-subsequence ├── README.md └── longest-increasing-subsequence.cpp ├── longest-palindrome ├── README.md └── longest-palindrome.cpp ├── longest-palindromic-subsequence ├── README.md └── longest-palindromic-subsequence.cpp ├── longest-palindromic-substring ├── README.md └── longest-palindromic-substring.cpp ├── longest-repeating-character-replacement ├── README.md └── longest-repeating-character-replacement.cpp ├── longest-substring-without-repeating-characters ├── README.md └── longest-substring-without-repeating-characters.cpp ├── lowest-common-ancestor-of-a-binary-search-tree ├── README.md └── lowest-common-ancestor-of-a-binary-search-tree.cpp ├── lru-cache ├── README.md └── lru-cache.cpp ├── majority-element-ii ├── README.md └── majority-element-ii.cpp ├── majority-element ├── README.md └── majority-element.cpp ├── matrix-block-sum ├── README.md └── matrix-block-sum.cpp ├── max-area-of-island ├── README.md └── max-area-of-island.cpp ├── max-points-on-a-line ├── README.md └── max-points-on-a-line.cpp ├── maximal-rectangle ├── README.md └── maximal-rectangle.cpp ├── maximal-square ├── README.md └── maximal-square.cpp ├── maximum-depth-of-binary-tree ├── README.md └── maximum-depth-of-binary-tree.cpp ├── maximum-difference-between-node-and-ancestor ├── README.md └── maximum-difference-between-node-and-ancestor.cpp ├── maximum-length-of-subarray-with-positive-product ├── README.md └── maximum-length-of-subarray-with-positive-product.cpp ├── maximum-number-of-words-found-in-sentences ├── README.md ├── maximum-number-of-words-found-in-sentences.cpp └── maximum-number-of-words-found-in-sentences.py ├── maximum-product-difference-between-two-pairs ├── README.md └── maximum-product-difference-between-two-pairs.cpp ├── maximum-product-of-two-elements-in-an-array ├── README.md └── maximum-product-of-two-elements-in-an-array.cpp ├── maximum-product-subarray ├── README.md └── maximum-product-subarray.cpp ├── maximum-subarray ├── README.md └── maximum-subarray.cpp ├── maximum-sum-circular-subarray ├── README.md └── maximum-sum-circular-subarray.cpp ├── merge-intervals ├── README.md └── merge-intervals.cpp ├── merge-k-sorted-lists ├── README.md └── merge-k-sorted-lists.cpp ├── merge-sorted-array ├── README.md └── merge-sorted-array.cpp ├── merge-two-binary-trees ├── README.md └── merge-two-binary-trees.cpp ├── merge-two-sorted-lists ├── README.md └── merge-two-sorted-lists.cpp ├── middle-of-the-linked-list ├── README.md └── middle-of-the-linked-list.cpp ├── min-cost-climbing-stairs ├── README.md └── min-cost-climbing-stairs.cpp ├── min-stack ├── README.md └── min-stack.cpp ├── minimum-absolute-difference ├── README.md └── minimum-absolute-difference.cpp ├── minimum-cost-to-move-chips-to-the-same-position ├── README.md └── minimum-cost-to-move-chips-to-the-same-position.cpp ├── minimum-difference-between-highest-and-lowest-of-k-scores ├── README.md └── minimum-difference-between-highest-and-lowest-of-k-scores.cpp ├── minimum-falling-path-sum ├── README.md └── minimum-falling-path-sum.cpp ├── minimum-height-trees ├── README.md └── minimum-height-trees.cpp ├── minimum-number-of-vertices-to-reach-all-nodes └── README.md ├── minimum-operations-to-convert-number ├── README.md └── minimum-operations-to-convert-number.cpp ├── minimum-path-sum ├── README.md └── minimum-path-sum.cpp ├── minimum-remove-to-make-valid-parentheses └── README.md ├── minimum-size-subarray-sum ├── README.md └── minimum-size-subarray-sum.cpp ├── minimum-value-to-get-positive-step-by-step-sum ├── README.md └── minimum-value-to-get-positive-step-by-step-sum.cpp ├── minimum-window-substring ├── README.md └── minimum-window-substring.cpp ├── missing-number ├── README.md └── missing-number.cpp ├── move-zeroes ├── README.md └── move-zeroes.cpp ├── multiply-strings ├── README.md └── multiply-strings.cpp ├── n-th-tribonacci-number ├── README.md └── n-th-tribonacci-number.cpp ├── next-greater-element-i ├── README.md └── next-greater-element-i.cpp ├── next-permutation ├── README.md └── next-permutation.cpp ├── nim-game ├── README.md └── nim-game.cpp ├── non-overlapping-intervals ├── README.md └── non-overlapping-intervals.cpp ├── not-boring-movies └── README.md ├── nth-highest-salary ├── README.md └── nth-highest-salary.sql ├── nth-magical-number ├── README.md └── nth-magical-number.cpp ├── number-complement ├── README.md └── number-complement.cpp ├── number-of-1-bits ├── README.md └── number-of-1-bits.cpp ├── number-of-good-pairs ├── README.md └── number-of-good-pairs.cpp ├── number-of-islands ├── README.md └── number-of-islands.cpp ├── number-of-longest-increasing-subsequence ├── README.md └── number-of-longest-increasing-subsequence.cpp ├── number-of-provinces ├── README.md └── number-of-provinces.cpp ├── number-of-steps-to-reduce-a-number-to-zero └── README.md ├── number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold ├── README.md └── number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold.cpp ├── number-of-valid-words-for-each-puzzle ├── README.md └── number-of-valid-words-for-each-puzzle.cpp ├── numbers-at-most-n-given-digit-set ├── README.md └── numbers-at-most-n-given-digit-set.cpp ├── odd-even-jump ├── README.md └── odd-even-jump.cpp ├── odd-even-linked-list ├── README.md └── odd-even-linked-list.cpp ├── pacific-atlantic-water-flow ├── README.md └── pacific-atlantic-water-flow.cpp ├── pairs-of-songs-with-total-durations-divisible-by-60 ├── README.md └── pairs-of-songs-with-total-durations-divisible-by-60.cpp ├── palindromic-substrings ├── README.md └── palindromic-substrings.cpp ├── partition-equal-subset-sum ├── README.md └── partition-equal-subset-sum.cpp ├── partition-labels ├── README.md └── partition-labels.cpp ├── partitioning-into-minimum-number-of-deci-binary-numbers └── README.md ├── pascals-triangle-ii ├── README.md └── pascals-triangle-ii.cpp ├── pascals-triangle ├── README.md └── pascals-triangle.cpp ├── path-sum-ii ├── README.md └── path-sum-ii.cpp ├── path-sum-iii ├── README.md └── path-sum-iii.cpp ├── path-sum ├── README.md └── path-sum.cpp ├── perfect-number ├── README.md └── perfect-number.cpp ├── perfect-squares ├── README.md └── perfect-squares.cpp ├── permutation-in-string ├── README.md └── permutation-in-string.cpp ├── permutations-ii ├── README.md └── permutations-ii.cpp ├── permutations ├── README.md └── permutations.cpp ├── populating-next-right-pointers-in-each-node-ii ├── README.md └── populating-next-right-pointers-in-each-node-ii.cpp ├── populating-next-right-pointers-in-each-node ├── README.md └── populating-next-right-pointers-in-each-node.cpp ├── power-of-four ├── README.md └── power-of-four.cpp ├── power-of-three ├── README.md └── power-of-three.cpp ├── power-of-two ├── README.md └── power-of-two.cpp ├── product-of-array-except-self ├── README.md └── product-of-array-except-self.cpp ├── range-sum-of-bst ├── README.md └── range-sum-of-bst.cpp ├── range-sum-query-2d-immutable ├── README.md └── range-sum-query-2d-immutable.cpp ├── ransom-note ├── README.md └── ransom-note.cpp ├── reduce-array-size-to-the-half ├── README.md └── reduce-array-size-to-the-half.cpp ├── relative-sort-array ├── README.md └── relative-sort-array.cpp ├── remove-duplicates-from-sorted-list-ii ├── README.md └── remove-duplicates-from-sorted-list-ii.cpp ├── remove-duplicates-from-sorted-list └── README.md ├── remove-linked-list-elements ├── README.md └── remove-linked-list-elements.cpp ├── remove-nth-node-from-end-of-list ├── README.md └── remove-nth-node-from-end-of-list.cpp ├── reorder-list ├── README.md └── reorder-list.cpp ├── repeated-dna-sequences ├── README.md └── repeated-dna-sequences.cpp ├── replace-all-digits-with-characters └── README.md ├── reshape-the-matrix ├── README.md └── reshape-the-matrix.cpp ├── reverse-bits ├── README.md └── reverse-bits.cpp ├── reverse-linked-list ├── README.md └── reverse-linked-list.cpp ├── reverse-nodes-in-k-group ├── README.md └── reverse-nodes-in-k-group.cpp ├── reverse-string ├── README.md └── reverse-string.cpp ├── reverse-words-in-a-string-iii ├── README.md └── reverse-words-in-a-string-iii.cpp ├── reverse-words-in-a-string ├── README.md └── reverse-words-in-a-string.cpp ├── richest-customer-wealth └── README.md ├── rising-temperature ├── README.md └── rising-temperature.sql ├── rotate-array ├── README.md └── rotate-array.cpp ├── rotate-image ├── README.md └── rotate-image.cpp ├── rotting-oranges ├── README.md └── rotting-oranges.cpp ├── running-sum-of-1d-array ├── README.md └── running-sum-of-1d-array.cpp ├── same-tree ├── README.md └── same-tree.cpp ├── search-a-2d-matrix-ii ├── README.md └── search-a-2d-matrix-ii.cpp ├── search-a-2d-matrix ├── README.md └── search-a-2d-matrix.cpp ├── search-in-a-binary-search-tree └── README.md ├── search-in-rotated-sorted-array ├── README.md └── search-in-rotated-sorted-array.cpp ├── search-insert-position ├── README.md └── search-insert-position.cpp ├── serialize-and-deserialize-binary-tree ├── README.md └── serialize-and-deserialize-binary-tree.cpp ├── set-matrix-zeroes ├── README.md └── set-matrix-zeroes.cpp ├── shortest-path-in-binary-matrix ├── README.md └── shortest-path-in-binary-matrix.cpp ├── shuffle-an-array ├── README.md └── shuffle-an-array.cpp ├── shuffle-string └── README.md ├── shuffle-the-array └── README.md ├── single-element-in-a-sorted-array ├── README.md └── single-element-in-a-sorted-array.cpp ├── single-number-iii ├── README.md └── single-number-iii.cpp ├── single-number ├── README.md └── single-number.cpp ├── smallest-index-with-equal-value ├── README.md └── smallest-index-with-equal-value.cpp ├── smallest-integer-divisible-by-k ├── README.md └── smallest-integer-divisible-by-k.cpp ├── sort-an-array ├── README.md └── sort-an-array.cpp ├── sort-characters-by-frequency ├── README.md └── sort-characters-by-frequency.cpp ├── sort-colors ├── README.md └── sort-colors.cpp ├── spiral-matrix-ii ├── README.md └── spiral-matrix-ii.cpp ├── spiral-matrix ├── README.md └── spiral-matrix.cpp ├── squares-of-a-sorted-array ├── README.md └── squares-of-a-sorted-array.cpp ├── stats.json ├── stream-of-characters ├── README.md └── stream-of-characters.cpp ├── subarray-product-less-than-k ├── README.md └── subarray-product-less-than-k.cpp ├── subarray-sum-equals-k ├── README.md └── subarray-sum-equals-k.cpp ├── subrectangle-queries ├── README.md └── subrectangle-queries.cpp ├── subsets-ii ├── README.md └── subsets-ii.cpp ├── subsets ├── README.md └── subsets.cpp ├── substrings-of-size-three-with-distinct-characters ├── README.md └── substrings-of-size-three-with-distinct-characters.cpp ├── subtract-the-product-and-sum-of-digits-of-an-integer └── README.md ├── subtree-of-another-tree ├── README.md └── subtree-of-another-tree.cpp ├── sudoku-solver ├── README.md └── sudoku-solver.cpp ├── sum-of-all-subset-xor-totals ├── README.md └── sum-of-all-subset-xor-totals.cpp ├── sum-of-two-integers ├── README.md └── sum-of-two-integers.cpp ├── sum-of-unique-elements ├── README.md └── sum-of-unique-elements.cpp ├── sum-root-to-leaf-numbers ├── README.md └── sum-root-to-leaf-numbers.cpp ├── summary-ranges ├── README.md └── summary-ranges.cpp ├── surrounded-regions ├── README.md └── surrounded-regions.cpp ├── swap-nodes-in-pairs ├── README.md └── swap-nodes-in-pairs.cpp ├── swap-salary └── README.md ├── symmetric-tree ├── README.md └── symmetric-tree.cpp ├── third-maximum-number ├── README.md └── third-maximum-number.cpp ├── to-lower-case ├── README.md └── to-lower-case.cpp ├── top-k-frequent-elements ├── README.md └── top-k-frequent-elements.cpp ├── top-k-frequent-words ├── README.md └── top-k-frequent-words.cpp ├── trapping-rain-water ├── README.md └── trapping-rain-water.cpp ├── triangle ├── README.md └── triangle.cpp ├── truncate-sentence └── README.md ├── two-sum-ii-input-array-is-sorted ├── README.md └── two-sum-ii-input-array-is-sorted.cpp ├── two-sum-iv-input-is-a-bst ├── README.md └── two-sum-iv-input-is-a-bst.cpp ├── two-sum ├── README.md └── two-sum.cpp ├── ugly-number-ii ├── README.md └── ugly-number-ii.cpp ├── ugly-number ├── README.md └── ugly-number.cpp ├── unique-binary-search-trees ├── README.md └── unique-binary-search-trees.cpp ├── unique-morse-code-words ├── README.md └── unique-morse-code-words.cpp ├── unique-paths-ii ├── README.md └── unique-paths-ii.cpp ├── unique-paths-iii ├── README.md └── unique-paths-iii.cpp ├── unique-paths ├── README.md └── unique-paths.cpp ├── valid-anagram ├── README.md └── valid-anagram.cpp ├── valid-palindrome ├── README.md └── valid-palindrome.cpp ├── valid-parentheses ├── README.md └── valid-parentheses.cpp ├── valid-sudoku ├── README.md └── valid-sudoku.cpp ├── validate-binary-search-tree ├── README.md └── validate-binary-search-tree.cpp ├── wiggle-subsequence ├── README.md └── wiggle-subsequence.cpp ├── word-break ├── README.md └── word-break.cpp ├── word-pattern ├── README.md └── word-pattern.cpp ├── word-search-ii ├── README.md └── word-search-ii.cpp ├── word-search ├── README.md └── word-search.cpp └── xor-operation-in-an-array ├── README.md └── xor-operation-in-an-array.cpp /0001-two-sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0004-median-of-two-sorted-arrays/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0005-longest-palindromic-substring/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0006-zigzag-conversion/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0017-letter-combinations-of-a-phone-number/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0020-valid-parentheses/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0021-merge-two-sorted-lists/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0023-merge-k-sorted-lists/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0024-swap-nodes-in-pairs/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0028-find-the-index-of-the-first-occurrence-in-a-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0033-search-in-rotated-sorted-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0034-find-first-and-last-position-of-element-in-sorted-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0040-combination-sum-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0041-first-missing-positive/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0042-trapping-rain-water/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0049-group-anagrams/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0050-powx-n/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0057-insert-interval/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0058-length-of-last-word/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0062-unique-paths/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0063-unique-paths-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0064-minimum-path-sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0067-add-binary/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0068-text-justification/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0070-climbing-stairs/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0071-simplify-path/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0074-search-a-2d-matrix/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0075-sort-colors/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0076-minimum-window-substring/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0077-combinations/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0078-subsets/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0079-word-search/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0081-search-in-rotated-sorted-array-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0085-maximal-rectangle/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0086-partition-list/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0087-scramble-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0091-decode-ways/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0092-reverse-linked-list-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0093-restore-ip-addresses/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0094-binary-tree-inorder-traversal/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0097-interleaving-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0098-validate-binary-search-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0100-same-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0101-symmetric-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0102-binary-tree-level-order-traversal/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0104-maximum-depth-of-binary-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0106-construct-binary-tree-from-inorder-and-postorder-traversal/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0109-convert-sorted-list-to-binary-search-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0118-pascals-triangle/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0119-pascals-triangle-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0121-best-time-to-buy-and-sell-stock/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0128-longest-consecutive-sequence/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0129-sum-root-to-leaf-numbers/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0131-palindrome-partitioning/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0133-clone-graph/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0134-gas-station/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0135-candy/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0138-copy-list-with-random-pointer/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0139-word-break/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0140-word-break-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0141-linked-list-cycle/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0143-reorder-list/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0144-binary-tree-preorder-traversal/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0145-binary-tree-postorder-traversal/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0149-max-points-on-a-line/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0150-evaluate-reverse-polish-notation/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0165-compare-version-numbers/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0168-excel-sheet-column-title/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0169-majority-element/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0179-largest-number/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0191-number-of-1-bits/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0198-house-robber/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0200-number-of-islands/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0202-happy-number/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0205-isomorphic-strings/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0206-reverse-linked-list/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0208-implement-trie-prefix-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0211-design-add-and-search-words-data-structure/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0214-shortest-palindrome/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0215-kth-largest-element-in-an-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0217-contains-duplicate/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0225-implement-stack-using-queues/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0226-invert-binary-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0228-summary-ranges/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0229-majority-element-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0231-power-of-two/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0232-implement-queue-using-stacks/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0234-palindrome-linked-list/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0235-lowest-common-ancestor-of-a-binary-search-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0237-delete-node-in-a-linked-list/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0238-product-of-array-except-self/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0239-sliding-window-maximum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0241-different-ways-to-add-parentheses/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0242-valid-anagram/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0258-add-digits/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0260-single-number-iii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0264-ugly-number-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0268-missing-number/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0273-integer-to-english-words/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0278-first-bad-version/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0279-perfect-squares/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0287-find-the-duplicate-number/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0299-bulls-and-cows/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0300-longest-increasing-subsequence/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0303-range-sum-query-immutable/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0310-minimum-height-trees/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0316-remove-duplicate-letters/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0319-bulb-switcher/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0330-patching-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0332-reconstruct-itinerary/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0338-counting-bits/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0341-flatten-nested-list-iterator/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0342-power-of-four/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0343-integer-break/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0344-reverse-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0345-reverse-vowels-of-a-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0350-intersection-of-two-arrays-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0352-data-stream-as-disjoint-intervals/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0368-largest-divisible-subset/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0373-find-k-pairs-with-smallest-sums/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0377-combination-sum-iv/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0380-insert-delete-getrandom-o1/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0386-lexicographical-numbers/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0387-first-unique-character-in-a-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0392-is-subsequence/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0394-decode-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0399-evaluate-division/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0402-remove-k-digits/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0403-frog-jump/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0404-sum-of-left-leaves/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0409-longest-palindrome/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0424-longest-repeating-character-replacement/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0427-construct-quad-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0435-non-overlapping-intervals/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0438-find-all-anagrams-in-a-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0440-k-th-smallest-in-lexicographical-order/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0442-find-all-duplicates-in-an-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0445-add-two-numbers-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0446-arithmetic-slices-ii-subsequence/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0451-sort-characters-by-frequency/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0452-minimum-number-of-arrows-to-burst-balloons/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0455-assign-cookies/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0456-132-pattern/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0458-poor-pigs/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0459-repeated-substring-pattern/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0460-lfu-cache/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0463-island-perimeter/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0472-concatenated-words/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0491-non-decreasing-subsequences/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0496-next-greater-element-i/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0500-keyboard-row/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0501-find-mode-in-binary-search-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0502-ipo/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0506-relative-ranks/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0513-find-bottom-left-tree-value/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0514-freedom-trail/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0515-find-largest-value-in-each-tree-row/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0518-coin-change-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0520-detect-capital/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0523-continuous-subarray-sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0525-contiguous-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0530-minimum-absolute-difference-in-bst/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0540-single-element-in-a-sorted-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0542-01-matrix/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0543-diameter-of-binary-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0547-number-of-provinces/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0557-reverse-words-in-a-string-iii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0564-find-the-closest-palindrome/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0566-reshape-the-matrix/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0567-permutation-in-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0575-distribute-candies/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0576-out-of-boundary-paths/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0589-n-ary-tree-preorder-traversal/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0590-n-ary-tree-postorder-traversal/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0592-fraction-addition-and-subtraction/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0605-can-place-flowers/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0606-construct-string-from-binary-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0621-task-scheduler/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0623-add-one-row-to-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0624-maximum-distance-in-arrays/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0628-maximum-product-of-three-numbers/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0629-k-inverse-pairs-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0632-smallest-range-covering-elements-from-k-lists/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0641-design-circular-deque/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0646-maximum-length-of-pair-chain/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0647-palindromic-substrings/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0648-replace-words/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0649-dota2-senate/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0650-2-keys-keyboard/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0652-find-duplicate-subtrees/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0661-image-smoother/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0664-strange-printer/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0678-valid-parenthesis-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0692-top-k-frequent-words/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0703-kth-largest-element-in-a-stream/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0706-design-hashmap/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0709-to-lower-case/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0712-minimum-ascii-delete-sum-for-two-strings/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0713-subarray-product-less-than-k/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0724-find-pivot-index/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0725-split-linked-list-in-parts/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0726-number-of-atoms/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0728-self-dividing-numbers/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0729-my-calendar-i/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0731-my-calendar-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0733-flood-fill/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0739-daily-temperatures/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0744-find-smallest-letter-greater-than-target/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0746-min-cost-climbing-stairs/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0762-prime-number-of-set-bits-in-binary-representation/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0766-toeplitz-matrix/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0767-reorganize-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0779-k-th-symbol-in-grammar/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0785-is-graph-bipartite/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0787-cheapest-flights-within-k-stops/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0791-custom-sort-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0799-champagne-tower/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0806-number-of-lines-to-write-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0807-max-increase-to-keep-city-skyline/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0808-soup-servings/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0815-bus-routes/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0821-shortest-distance-to-a-character/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0823-binary-trees-with-factors/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0826-most-profit-assigning-work/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0834-sum-of-distances-in-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0837-new-21-game/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0839-similar-string-groups/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0840-magic-squares-in-grid/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0844-backspace-string-compare/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0845-longest-mountain-in-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0846-hand-of-straights/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0847-shortest-path-visiting-all-nodes/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0852-peak-index-in-a-mountain-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0857-minimum-cost-to-hire-k-workers/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0860-lemonade-change/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0861-score-after-flipping-matrix/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0863-all-nodes-distance-k-in-binary-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0867-transpose-matrix/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0872-leaf-similar-trees/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0876-middle-of-the-linked-list/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0879-profitable-schemes/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0881-boats-to-save-people/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0883-projection-area-of-3d-shapes/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0884-uncommon-words-from-two-sentences/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0885-spiral-matrix-iii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0894-all-possible-full-binary-trees/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0896-monotonic-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0904-fruit-into-baskets/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0905-sort-array-by-parity/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0907-sum-of-subarray-minimums/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0908-smallest-range-i/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0909-snakes-and-ladders/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0912-sort-an-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0918-maximum-sum-circular-subarray/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0920-number-of-music-playlists/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0921-minimum-add-to-make-parentheses-valid/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0922-sort-array-by-parity-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0926-flip-string-to-monotone-increasing/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0929-unique-email-addresses/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0930-binary-subarrays-with-sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0931-minimum-falling-path-sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0933-number-of-recent-calls/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0934-shortest-bridge/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0935-knight-dialer/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0938-range-sum-of-bst/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0942-di-string-match/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0945-minimum-increment-to-make-array-unique/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0946-validate-stack-sequences/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0947-most-stones-removed-with-same-row-or-column/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0950-reveal-cards-in-increasing-order/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0951-flip-equivalent-binary-trees/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0953-verifying-an-alien-dictionary/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0956-tallest-billboard/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0958-check-completeness-of-a-binary-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0959-regions-cut-by-slashes/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0961-n-repeated-element-in-size-2n-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0965-univalued-binary-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0974-subarray-sums-divisible-by-k/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0976-largest-perimeter-triangle/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0977-squares-of-a-sorted-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0979-distribute-coins-in-binary-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0983-minimum-cost-for-tickets/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0988-smallest-string-starting-from-leaf/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0992-subarrays-with-k-different-integers/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0995-minimum-number-of-k-consecutive-bit-flips/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0997-find-the-town-judge/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1-two-sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /100-same-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1002-find-common-characters/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1007-minimum-domino-rotations-for-equal-row/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1009-complement-of-base-10-integer/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /101-symmetric-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1011-capacity-to-ship-packages-within-d-days/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /102-binary-tree-level-order-traversal/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1020-number-of-enclaves/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1021-remove-outermost-parentheses/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1022-sum-of-root-to-leaf-binary-numbers/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1026-maximum-difference-between-node-and-ancestor/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1029-two-city-scheduling/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /103-binary-tree-zigzag-level-order-traversal/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1035-uncrossed-lines/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1038-binary-search-tree-to-greater-sum-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /104-maximum-depth-of-binary-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1041-robot-bounded-in-circle/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1043-partition-array-for-maximum-sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1046-last-stone-weight/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1047-remove-all-adjacent-duplicates-in-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /105-construct-binary-tree-from-preorder-and-inorder-traversal/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1050-actors-and-directors-who-cooperated-at-least-three-times/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1051-height-checker/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1052-grumpy-bookstore-owner/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1061-lexicographically-smallest-equivalent-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1074-number-of-submatrices-that-sum-to-target/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /108-convert-sorted-array-to-binary-search-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1084-sales-analysis-iii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1091-shortest-path-in-binary-matrix/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1094-car-pooling/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1095-find-in-mountain-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /11-container-with-most-water/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /110-balanced-binary-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1105-filling-bookcase-shelves/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1106-parsing-a-boolean-expression/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1110-delete-nodes-and-return-forest/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1114-print-in-order/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1122-relative-sort-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1125-smallest-sufficient-team/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1129-shortest-path-with-alternating-colors/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1137-n-th-tribonacci-number/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /114-flatten-binary-tree-to-linked-list/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1140-stone-game-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1141-user-activity-for-the-past-30-days-i/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1143-longest-common-subsequence/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1146-snapshot-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1148-article-views-i/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1155-number-of-dice-rolls-with-target-sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1158-market-analysis-i/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1160-find-words-that-can-be-formed-by-characters/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1162-as-far-from-land-as-possible/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /117-populating-next-right-pointers-in-each-node-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1171-remove-zero-sum-consecutive-nodes-from-linked-list/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1179-reformat-department-table/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /118-pascals-triangle/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1187-make-array-strictly-increasing/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1189-maximum-number-of-balloons/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1190-reverse-substrings-between-each-pair-of-parentheses/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1192-critical-connections-in-a-network/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1201-ugly-number-iii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1202-smallest-string-with-swaps/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1203-sort-items-by-groups-respecting-dependencies/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1207-unique-number-of-occurrences/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1208-get-equal-substrings-within-budget/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1209-remove-all-adjacent-duplicates-in-string-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /121-best-time-to-buy-and-sell-stock/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1219-path-with-maximum-gold/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1220-count-vowels-permutation/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1221-split-a-string-in-balanced-strings/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1232-check-if-it-is-a-straight-line/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1233-remove-sub-folders-from-the-filesystem/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1235-maximum-profit-in-job-scheduling/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /124-binary-tree-maximum-path-sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1248-count-number-of-nice-subarrays/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1249-minimum-remove-to-make-valid-parentheses/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1252-cells-with-odd-values-in-a-matrix/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1254-number-of-closed-islands/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1255-maximum-score-words-formed-by-letters/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1260-shift-2d-grid/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1261-find-elements-in-a-contaminated-binary-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1266-minimum-time-visiting-all-points/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1268-search-suggestions-system/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1269-number-of-ways-to-stay-in-the-same-place-after-some-steps/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /127-word-ladder/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /128-longest-consecutive-sequence/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1281-subtract-the-product-and-sum-of-digits-of-an-integer/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1282-group-the-people-given-the-group-size-they-belong-to/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1283-find-the-smallest-divisor-given-a-threshold/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1287-element-appearing-more-than-25-in-sorted-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1288-remove-covered-intervals/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1289-minimum-falling-path-sum-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1290-convert-binary-number-in-a-linked-list-to-integer/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1291-sequential-digits/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1295-find-numbers-with-even-number-of-digits/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1299-replace-elements-with-greatest-element-on-right-side/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /13-roman-to-integer/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1300-sum-of-mutated-array-closest-to-target/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1302-deepest-leaves-sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1304-find-n-unique-integers-sum-up-to-zero/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1305-all-elements-in-two-binary-search-trees/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1306-jump-game-iii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1309-decrypt-string-from-alphabet-to-integer-mapping/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /131-palindrome-partitioning/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1310-xor-queries-of-a-subarray/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1312-minimum-insertion-steps-to-make-a-string-palindrome/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1315-sum-of-nodes-with-even-valued-grandparent/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1318-minimum-flips-to-make-a-or-b-equal-to-c/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1319-number-of-operations-to-make-network-connected/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1323-maximum-69-number/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1325-delete-leaves-with-a-given-value/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /133-clone-graph/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1331-rank-transform-of-an-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1332-remove-palindromic-subsequences/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1335-minimum-difficulty-of-a-job-schedule/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1337-the-k-weakest-rows-in-a-matrix/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1338-reduce-array-size-to-the-half/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /134-gas-station/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1342-number-of-steps-to-reduce-a-number-to-zero/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1345-jump-game-iv/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1346-check-if-n-and-its-double-exist/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1347-minimum-number-of-steps-to-make-two-strings-anagram/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /135-candy/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1351-count-negative-numbers-in-a-sorted-matrix/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1356-sort-integers-by-the-number-of-1-bits/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1359-count-all-valid-pickup-and-delivery-options/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /136-single-number/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1361-validate-binary-tree-nodes/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1367-linked-list-in-binary-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1372-longest-zigzag-path-in-a-binary-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1373-maximum-sum-bst-in-binary-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1374-generate-a-string-with-characters-that-have-odd-counts/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1376-time-needed-to-inform-all-employees/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1378-replace-employee-id-with-the-unique-identifier/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /138-copy-list-with-random-pointer/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1380-lucky-numbers-in-a-matrix/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1381-design-a-stack-with-increment-operation/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1382-balance-a-binary-search-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1383-maximum-performance-of-a-team/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1385-find-the-distance-value-between-two-arrays/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /139-word-break/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1393-capital-gain-loss/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1394-find-lucky-integer-in-an-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1396-design-underground-system/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1399-count-largest-group/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /14-longest-common-prefix/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1402-reducing-dishes/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1403-minimum-subsequence-in-non-increasing-order/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1406-stone-game-iii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1407-top-travellers/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /141-linked-list-cycle/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1416-restore-the-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /142-linked-list-cycle-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1422-maximum-score-after-splitting-a-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1423-maximum-points-you-can-obtain-from-cards/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1424-diagonal-traverse-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1425-constrained-subsequence-sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /143-reorder-list/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1431-kids-with-the-greatest-number-of-candies/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1436-destination-city/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /144-binary-tree-preorder-traversal/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1441-build-an-array-with-stack-operations/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1442-count-triplets-that-can-form-two-arrays-of-equal-xor/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1443-minimum-time-to-collect-all-apples-in-a-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1444-number-of-ways-of-cutting-a-pizza/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1448-count-good-nodes-in-binary-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1450-number-of-students-doing-homework-at-a-given-time/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1457-pseudo-palindromic-paths-in-a-binary-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1458-max-dot-product-of-two-subsequences/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /146-lru-cache/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1460-make-two-arrays-equal-by-reversing-subarrays/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1461-check-if-a-string-contains-all-binary-codes-of-size-k/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1463-cherry-pickup-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1464-maximum-product-of-two-elements-in-an-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1470-shuffle-the-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1472-design-browser-history/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1473-paint-house-iii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1475-final-prices-with-a-special-discount-in-a-shop/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /148-sort-list/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1480-running-sum-of-1d-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1481-least-number-of-unique-integers-after-k-removals/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1482-minimum-number-of-days-to-make-m-bouquets/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1484-group-sold-products-by-the-date/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1488-avoid-flood-in-the-city/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1493-longest-subarray-of-1s-after-deleting-one-element/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1496-path-crossing/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1497-check-if-array-pairs-are-divisible-by-k/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /150-evaluate-reverse-polish-notation/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1502-can-make-arithmetic-progression-from-sequence/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1503-last-moment-before-all-ants-fall-out-of-a-plank/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1508-range-sum-of-sorted-subarray-sums/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1510-stone-game-iv/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1512-number-of-good-pairs/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1514-path-with-maximum-probability/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1518-water-bottles/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1519-number-of-nodes-in-the-sub-tree-with-the-same-label/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /152-maximum-product-subarray/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1523-count-odd-numbers-in-an-interval-range/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1527-patients-with-a-condition/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /153-find-minimum-in-rotated-sorted-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1530-number-of-good-leaf-nodes-pairs/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1531-string-compression-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1535-find-the-winner-of-an-array-game/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1539-kth-missing-positive-number/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /154-find-minimum-in-rotated-sorted-array-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1544-make-the-string-great/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1547-minimum-cost-to-cut-a-stick/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /155-min-stack/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1550-three-consecutive-odds/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1551-minimum-operations-to-make-array-equal/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1552-magnetic-force-between-two-balls/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1557-minimum-number-of-vertices-to-reach-all-nodes/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1561-maximum-number-of-coins-you-can-get/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1562-find-latest-group-of-size-m/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1568-minimum-number-of-days-to-disconnect-island/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1572-matrix-diagonal-sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1574-shortest-subarray-to-be-removed-to-make-array-sorted/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1575-count-all-possible-routes/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1578-minimum-time-to-make-rope-colorful/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1582-special-positions-in-a-binary-matrix/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1584-min-cost-to-connect-all-points/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1587-bank-account-summary-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1588-sum-of-all-odd-length-subarrays/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1590-make-sum-divisible-by-p/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1598-crawler-log-folder/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /16-3sum-closest/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /160-intersection-of-two-linked-lists/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1603-design-parking-system/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1605-find-valid-matrix-given-row-and-column-sums/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1608-special-array-with-x-elements-greater-than-or-equal-x/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1609-even-odd-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1611-minimum-one-bit-operations-to-make-integers-zero/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1614-maximum-nesting-depth-of-the-parentheses/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1615-maximal-network-rank/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1619-mean-of-array-after-removing-some-elements/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /162-find-peak-element/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1624-largest-substring-between-two-equal-characters/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1630-arithmetic-subarrays/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1631-path-with-minimum-effort/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1636-sort-array-by-increasing-frequency/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1641-count-sorted-vowel-strings/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1642-furthest-building-you-can-reach/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1648-sell-diminishing-valued-colored-balls/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /165-compare-version-numbers/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1653-minimum-deletions-to-make-string-balanced/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1654-minimum-jumps-to-reach-home/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1656-design-an-ordered-stream/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1657-determine-if-two-strings-are-close/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1658-minimum-operations-to-reduce-x-to-zero/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1662-check-if-two-string-arrays-are-equivalent/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1663-smallest-string-with-a-given-numeric-value/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1667-fix-names-in-a-table/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1669-merge-in-between-linked-lists/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /167-two-sum-ii-input-array-is-sorted/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1671-minimum-number-of-removals-to-make-mountain-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1672-richest-customer-wealth/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1675-minimize-deviation-in-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1678-goal-parser-interpretation/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1679-max-number-of-k-sum-pairs/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1684-count-the-number-of-consistent-strings/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1685-sum-of-absolute-differences-in-a-sorted-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1688-count-of-matches-in-tournament/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /169-majority-element/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1693-daily-leads-and-partners/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1695-maximum-erasure-value/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1697-checking-existence-of-edge-length-limited-paths/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /17-letter-combinations-of-a-phone-number/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1700-number-of-students-unable-to-eat-lunch/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1701-average-waiting-time/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1704-determine-if-string-halves-are-alike/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1706-where-will-the-ball-fall/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1710-maximum-units-on-a-truck/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1712-ways-to-split-array-into-three-subarrays/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1716-calculate-money-in-leetcode-bank/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1721-swapping-nodes-in-a-linked-list/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1725-number-of-rectangles-that-can-form-the-largest-square/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1727-largest-submatrix-with-rearrangements/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1729-find-followers-count/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /173-binary-search-tree-iterator/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1732-find-the-highest-altitude/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1741-find-total-time-spent-by-each-employee/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1742-maximum-number-of-balls-in-a-box/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1743-restore-the-array-from-adjacent-pairs/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /175-combine-two-tables/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1750-minimum-length-of-string-after-deleting-similar-ends/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1751-maximum-number-of-events-that-can-be-attended-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1753-maximum-score-from-removing-stones/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1757-recyclable-and-low-fat-products/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1759-count-number-of-homogenous-substrings/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /176-second-highest-salary/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1760-minimum-limit-of-balls-in-a-bag/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1768-merge-strings-alternately/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1773-count-items-matching-a-rule/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1790-check-if-one-string-swap-can-make-strings-equal/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1791-find-center-of-star-graph/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1793-maximum-score-of-a-good-subarray/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1795-rearrange-products-table/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1797-design-authentication-manager/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1799-maximize-score-after-n-operations/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /18-4sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1800-maximum-ascending-subarray-sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1802-maximum-value-at-a-given-index-in-a-bounded-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1812-determine-color-of-a-chessboard-square/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1813-sentence-similarity-iii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1818-minimum-absolute-sum-difference/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /182-duplicate-emails/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1822-sign-of-the-product-of-an-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1823-find-the-winner-of-the-circular-game/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1827-minimum-operations-to-make-the-array-increasing/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /183-customers-who-never-order/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1833-maximum-ice-cream-bars/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1837-sum-of-digits-in-base-k/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1838-frequency-of-the-most-frequent-element/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1845-seat-reservation-manager/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1846-maximum-element-after-decreasing-and-rearranging/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1855-maximum-distance-between-a-pair-of-values/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1859-sorting-the-sentence/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1863-sum-of-all-subset-xor-totals/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1870-minimum-speed-to-arrive-on-time/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1873-calculate-special-bonus/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1877-minimize-maximum-pair-sum-in-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /188-best-time-to-buy-and-sell-stock-iv/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1880-check-if-word-equals-summation-of-two-words/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1886-determine-whether-matrix-can-be-obtained-by-rotation/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1887-reduction-operations-to-make-the-array-elements-equal/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1890-the-latest-login-in-2020/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1894-find-the-student-that-will-replace-the-chalk/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1897-redistribute-characters-to-make-all-strings-equal/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1898-maximum-number-of-removable-characters/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /19-remove-nth-node-from-end-of-list/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /190-reverse-bits/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1901-find-a-peak-element-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1903-largest-odd-number-in-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1905-count-sub-islands/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /191-number-of-1-bits/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1913-maximum-product-difference-between-two-pairs/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1915-number-of-wonderful-substrings/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1921-eliminate-maximum-number-of-monsters/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1925-count-square-sum-triples/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1930-unique-length-3-palindromic-subsequences/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1935-maximum-number-of-words-you-can-type/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1937-maximum-number-of-points-with-cost/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1942-the-number-of-the-smallest-unoccupied-chair/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1945-sum-of-digits-of-string-after-convert/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /196-delete-duplicate-emails/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1965-employees-with-missing-information/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1967-number-of-strings-that-appear-as-substrings-in-word/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /197-rising-temperature/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /198-house-robber/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1980-find-unique-binary-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /199-binary-tree-right-side-view/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1991-find-the-middle-index-in-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1992-find-all-groups-of-farmland/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1996-the-number-of-weak-characters-in-the-game/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2-add-two-numbers/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /200-number-of-islands/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2000-reverse-prefix-of-word/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2006-count-number-of-pairs-with-absolute-difference-k/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2007-find-original-array-from-doubled-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2009-minimum-number-of-operations-to-make-array-continuous/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /202-happy-number/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2022-convert-1d-array-into-2d-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2032-two-out-of-three/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2037-minimum-number-of-moves-to-seat-everyone/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2042-check-if-numbers-are-ascending-in-a-sentence/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2044-count-number-of-maximum-bitwise-or-subsets/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2045-second-minimum-time-to-reach-destination/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /205-isomorphic-strings/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2050-parallel-courses-iii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2053-kth-distinct-string-in-an-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /206-reverse-linked-list/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2068-check-whether-two-strings-are-almost-equivalent/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /207-course-schedule/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2073-time-needed-to-buy-tickets/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2078-two-furthest-houses-with-different-colors/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2079-watering-plants/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2085-count-common-words-with-one-occurrence/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /209-minimum-size-subarray-sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2090-k-radius-subarray-averages/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2092-find-all-people-with-secret/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /21-merge-two-sorted-lists/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /210-course-schedule-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2103-rings-and-rods/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2108-find-first-palindromic-string-in-the-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /211-design-add-and-search-words-data-structure/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2119-a-number-after-a-double-reversal/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /212-word-search-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2124-check-if-all-as-appears-before-all-bs/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2125-number-of-laser-beams-in-a-bank/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /213-house-robber-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2130-maximum-twin-sum-of-a-linked-list/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2131-longest-palindrome-by-concatenating-two-letter-words/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2138-divide-a-string-into-groups-of-size-k/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2140-solving-questions-with-brainpower/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2147-number-of-ways-to-divide-a-long-corridor/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2149-rearrange-array-elements-by-sign/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /215-kth-largest-element-in-an-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2154-keep-multiplying-found-values-by-two/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /216-combination-sum-iii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2161-partition-array-according-to-given-pivot/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2169-count-operations-to-obtain-zero/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /217-contains-duplicate/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2176-count-equal-and-divisible-pairs-in-an-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2178-maximum-split-of-positive-even-integers/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2180-count-integers-with-even-digit-sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2181-merge-nodes-in-between-zeros/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2182-construct-string-with-repeat-limit/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2185-counting-words-with-a-given-prefix/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2187-minimum-time-to-complete-trips/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2190-most-frequent-number-following-key-in-an-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2191-sort-the-jumbled-numbers/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2192-all-ancestors-of-a-node-in-a-directed-acyclic-graph/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2194-cells-in-a-range-on-an-excel-sheet/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2195-append-k-integers-with-minimal-sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2196-create-binary-tree-from-descriptions/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2200-find-all-k-distant-indices-in-an-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2201-count-artifacts-that-can-be-extracted/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2202-maximize-the-topmost-element-after-k-moves/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2206-divide-array-into-equal-pairs/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2207-maximize-number-of-subsequences-in-a-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2208-minimum-operations-to-halve-array-sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2209-minimum-white-tiles-after-covering-with-carpets/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2210-count-hills-and-valleys-in-an-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2211-count-collisions-on-a-road/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2212-maximum-points-in-an-archery-competition/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2215-find-the-difference-of-two-arrays/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2216-minimum-deletions-to-make-array-beautiful/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2217-find-palindrome-with-fixed-length/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2218-maximum-value-of-k-coins-from-piles/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /222-count-complete-tree-nodes/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2220-minimum-bit-flips-to-convert-number/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2221-find-triangular-sum-of-an-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2222-number-of-ways-to-select-buildings/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2224-minimum-number-of-operations-to-convert-time/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2225-find-players-with-zero-or-one-losses/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2226-maximum-candies-allocated-to-k-children/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2231-largest-number-after-digit-swaps-by-parity/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2232-minimize-result-by-adding-parentheses-to-expression/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2233-maximum-product-after-k-increments/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2235-add-two-integers/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2236-root-equals-sum-of-children/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2239-find-closest-number-to-zero/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2240-number-of-ways-to-buy-pens-and-pencils/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2241-design-an-atm-machine/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2242-maximum-score-of-a-node-sequence/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2243-calculate-digit-sum-of-a-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2244-minimum-rounds-to-complete-all-tasks/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2246-longest-path-with-different-adjacent-characters/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2248-intersection-of-multiple-arrays/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /225-implement-stack-using-queues/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2251-number-of-flowers-in-full-bloom/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2255-count-prefixes-of-a-given-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2256-minimum-average-difference/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2257-count-unguarded-cells-in-the-grid/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2259-remove-digit-from-number-to-maximize-result/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /226-invert-binary-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2260-minimum-consecutive-cards-to-pick-up/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2261-k-divisible-elements-subarrays/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2264-largest-3-same-digit-number-in-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2265-count-nodes-equal-to-average-of-subtree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2278-percentage-of-letter-in-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2279-maximum-bags-with-full-capacity-of-rocks/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /228-summary-ranges/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2280-minimum-lines-to-represent-a-line-chart/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2283-check-if-number-has-equal-digit-count-and-digit-value/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2285-maximum-total-importance-of-roads/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /229-majority-element-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2293-min-max-game/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2299-strong-password-checker-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /23-merge-k-sorted-lists/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /230-kth-smallest-element-in-a-bst/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2300-successful-pairs-of-spells-and-potions/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2303-calculate-amount-paid-in-taxes/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2305-fair-distribution-of-cookies/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2310-sum-of-numbers-with-units-digit-k/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2315-count-asterisks/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /232-implement-queue-using-stacks/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2325-decode-the-message/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2326-spiral-matrix-iv/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2331-evaluate-boolean-binary-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2336-smallest-number-in-infinite-set/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /234-palindrome-linked-list/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2341-maximum-number-of-pairs-in-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2342-max-sum-of-a-pair-with-equal-sum-of-digits/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2348-number-of-zero-filled-subarrays/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /235-lowest-common-ancestor-of-a-binary-search-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2351-first-letter-to-appear-twice/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2352-equal-row-and-column-pairs/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2353-design-a-food-rating-system/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2357-make-array-zero-by-subtracting-equal-amounts/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2359-find-closest-node-to-given-two-nodes/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /236-lowest-common-ancestor-of-a-binary-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2360-longest-cycle-in-a-graph/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2363-merge-similar-items/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2366-minimum-replacements-to-sort-the-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2367-number-of-arithmetic-triplets/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2369-check-if-there-is-a-valid-partition-for-the-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /237-delete-node-in-a-linked-list/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2370-longest-ideal-subsequence/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2373-largest-local-values-in-a-matrix/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /238-product-of-array-except-self/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2385-amount-of-time-for-binary-tree-to-be-infected/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2389-longest-subsequence-with-limited-sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /239-sliding-window-maximum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2390-removing-stars-from-a-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2391-minimum-amount-of-time-to-collect-garbage/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2392-build-a-matrix-with-conditions/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2395-find-subarrays-with-equal-sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2396-strictly-palindromic-number/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /24-swap-nodes-in-pairs/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /240-search-a-2d-matrix-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2402-meeting-rooms-iii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2405-optimal-partition-of-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2406-divide-intervals-into-minimum-number-of-groups/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2413-smallest-even-multiple/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2415-reverse-odd-levels-of-binary-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2416-sum-of-prefix-scores-of-strings/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2418-sort-the-people/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2419-longest-subarray-with-maximum-bitwise-and/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /242-valid-anagram/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2421-number-of-good-paths/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2423-remove-letter-to-equalize-frequency/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2427-number-of-common-factors/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2433-find-the-original-array-of-prefix-xor/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2444-count-subarrays-with-fixed-bounds/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2448-minimum-cost-to-make-array-equal/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2458-height-of-binary-tree-after-subtree-removal-queries/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2460-apply-operations-to-an-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2462-total-cost-to-hire-k-workers/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2463-minimum-total-distance-traveled/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2469-convert-the-temperature/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2475-number-of-unequal-triplets-in-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2482-difference-between-ones-and-zeros-in-row-and-column/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2483-minimum-penalty-for-a-shop/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2485-find-the-pivot-integer/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2486-append-characters-to-string-to-make-subsequence/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2487-remove-nodes-from-linked-list/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2490-circular-sentence/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2496-maximum-value-of-a-string-in-an-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /25-reverse-nodes-in-k-group/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2500-delete-greatest-value-in-each-row/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2501-longest-square-streak-in-an-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2506-count-pairs-of-similar-strings/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2520-count-the-digits-that-divide-a-number/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2521-distinct-prime-factors-of-product-of-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2540-minimum-common-value/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2542-maximum-subsequence-score/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2544-alternating-digit-sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2553-separate-the-digits-in-an-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2558-take-gifts-from-the-richest-pile/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2562-find-the-array-concatenation-value/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2570-merge-two-2d-arrays-by-summing-values/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2574-left-and-right-sum-differences/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2578-split-with-minimum-sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /258-add-digits/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2582-pass-the-pillow/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2583-kth-largest-sum-in-a-binary-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2586-count-the-number-of-vowel-strings-in-range/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2595-number-of-even-and-odd-bits/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2597-the-number-of-beautiful-subsets/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /26-remove-duplicates-from-sorted-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2600-k-items-with-the-maximum-sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2605-form-smallest-number-from-two-digit-arrays/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2610-convert-an-array-into-a-2d-array-with-conditions/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2614-prime-in-diagonal/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2616-minimize-the-maximum-difference-of-pairs/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2618-check-if-object-instance-of-class/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2619-array-prototype-last/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2620-counter/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2621-sleep/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2622-cache-with-time-limit/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2623-memoize/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2625-flatten-deeply-nested-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2626-array-reduce-transformation/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2627-debounce/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2628-json-deep-equal/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2629-function-composition/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2631-group-by/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2632-curry/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2633-convert-object-to-json-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2634-filter-elements-from-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2635-apply-transform-over-each-element-in-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2636-promise-pool/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2637-promise-time-limit/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2641-cousins-in-binary-tree-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2643-row-with-maximum-ones/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2648-generate-fibonacci-sequence/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2649-nested-array-generator/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2651-calculate-delayed-arrival-time/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2652-sum-multiples/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2656-maximum-sum-with-exactly-k-elements/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2665-counter-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2666-allow-one-function-call/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2667-create-hello-world-function/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2675-array-of-objects-to-matrix/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2676-throttle/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2677-chunk-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /268-missing-number/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2684-maximum-number-of-moves-in-a-grid/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2693-call-function-with-custom-context/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2694-event-emitter/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2695-array-wrapper/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2696-minimum-string-length-after-removing-substrings/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2700-differences-between-two-objects/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2704-to-be-or-not-to-be/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2706-buy-two-chocolates/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2707-extra-characters-in-a-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2709-greatest-common-divisor-traversal/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2715-execute-cancellable-function-with-delay/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2721-execute-asynchronous-functions-in-parallel/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2723-add-two-promises/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2724-sort-by/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2725-interval-cancellation/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2742-painting-the-walls/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /275-h-index-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2751-robot-collisions/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2769-find-the-maximum-achievable-number/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /278-first-bad-version/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2785-sort-vowels-in-a-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2798-number-of-employees-who-met-the-target/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /28-implement-strstr/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2807-insert-greatest-common-divisors-in-linked-list/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2810-faulty-keyboard/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2812-find-the-safest-path-in-a-grid/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2816-double-a-number-represented-as-a-linked-list/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2824-count-pairs-whose-sum-is-less-than-target/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2828-check-if-a-string-is-an-acronym-of-words/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /283-move-zeroes/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /284-peeking-iterator/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2849-determine-if-a-cell-is-reachable-at-a-given-time/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2864-maximum-odd-binary-number/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /287-find-the-duplicate-number/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2870-minimum-number-of-operations-to-make-array-empty/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /289-game-of-life/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2894-divisible-and-non-divisible-sums-difference/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /29-divide-two-integers/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /290-word-pattern/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2938-separate-black-and-white-balls/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2942-find-words-containing-character/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /295-find-median-from-data-stream/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2958-length-of-longest-subarray-with-at-most-k-frequency/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2966-divide-array-into-arrays-with-max-difference/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /297-serialize-and-deserialize-binary-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2971-find-polygon-with-the-largest-perimeter/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2976-minimum-cost-to-convert-string-i/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /299-bulls-and-cows/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /3-longest-substring-without-repeating-characters/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /30-substring-with-concatenation-of-all-words/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /300-longest-increasing-subsequence/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /3005-count-elements-with-maximum-frequency/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /3016-minimum-number-of-pushes-to-type-word-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /304-range-sum-query-2d-immutable/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /3068-find-the-maximum-sum-of-node-values/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /307-range-sum-query-mutable/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /3075-maximize-happiness-of-selected-children/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /3099-harshad-number/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /31-next-permutation/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /3110-score-of-a-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /316-remove-duplicate-letters/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /318-maximum-product-of-word-lengths/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /32-longest-valid-parentheses/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /3217-delete-nodes-from-linked-list-present-in-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /322-coin-change/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /326-power-of-three/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /328-odd-even-linked-list/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /329-longest-increasing-path-in-a-matrix/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /33-search-in-rotated-sorted-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /338-counting-bits/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /34-find-first-and-last-position-of-element-in-sorted-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /341-flatten-nested-list-iterator/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /342-power-of-four/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /344-reverse-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /345-reverse-vowels-of-a-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /347-top-k-frequent-elements/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /35-search-insert-position/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /350-intersection-of-two-arrays-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /354-russian-doll-envelopes/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /363-max-sum-of-rectangle-no-larger-than-k/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /367-valid-perfect-square/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /374-guess-number-higher-or-lower/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /376-wiggle-subsequence/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /377-combination-sum-iv/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /378-kth-smallest-element-in-a-sorted-matrix/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /380-insert-delete-getrandom-o1/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /382-linked-list-random-node/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /383-ransom-note/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /387-first-unique-character-in-a-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /389-find-the-difference/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /39-combination-sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /392-is-subsequence/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /393-utf-8-validation/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /394-decode-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /399-evaluate-division/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /4-median-of-two-sorted-arrays/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /40-combination-sum-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /402-remove-k-digits/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /404-sum-of-left-leaves/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /406-queue-reconstruction-by-height/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /409-longest-palindrome/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /410-split-array-largest-sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /413-arithmetic-slices/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /416-partition-equal-subset-sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /417-pacific-atlantic-water-flow/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /42-trapping-rain-water/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /424-longest-repeating-character-replacement/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /429-n-ary-tree-level-order-traversal/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /43-multiply-strings/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /433-minimum-genetic-mutation/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /434-number-of-segments-in-a-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /436-find-right-interval/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /437-path-sum-iii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /438-find-all-anagrams-in-a-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /441-arranging-coins/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /445-add-two-numbers-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /45-jump-game-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /454-4sum-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /456-132-pattern/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /458-poor-pigs/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /459-repeated-substring-pattern/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /46-permutations/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /462-minimum-moves-to-equal-array-elements-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /47-permutations-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /473-matchsticks-to-square/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /474-ones-and-zeroes/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /48-rotate-image/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /49-group-anagrams/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /493-reverse-pairs/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /5-longest-palindromic-substring/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /50-powx-n/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /504-base-7/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /509-fibonacci-number/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /51-n-queens/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /511-game-play-analysis-i/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /52-n-queens-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /525-contiguous-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /528-random-pick-with-weight/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /53-maximum-subarray/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /532-k-diff-pairs-in-an-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /535-encode-and-decode-tinyurl/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /538-convert-bst-to-greater-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /54-spiral-matrix/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /540-single-element-in-a-sorted-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /543-diameter-of-binary-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /547-number-of-provinces/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /556-next-greater-element-iii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /56-merge-intervals/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /560-subarray-sum-equals-k/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /561-array-partition-i/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /566-reshape-the-matrix/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /567-permutation-in-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /57-insert-interval/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /576-out-of-boundary-paths/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /58-length-of-last-word/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /581-shortest-unsorted-continuous-subarray/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /583-delete-operation-for-two-strings/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /584-find-customer-referee/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /586-customer-placing-the-largest-number-of-orders/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /589-n-ary-tree-preorder-traversal/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /59-spiral-matrix-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /595-big-countries/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /60-permutation-sequence/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /606-construct-string-from-binary-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /607-sales-person/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /608-tree-node/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /61-rotate-list/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /611-valid-triangle-number/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /62-unique-paths/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /621-task-scheduler/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /622-design-circular-queue/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /627-swap-salary/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /629-k-inverse-pairs-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /63-unique-paths-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /630-course-schedule-iii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /633-sum-of-square-numbers/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /637-average-of-levels-in-binary-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /647-palindromic-substrings/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /657-robot-return-to-origin/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /658-find-k-closest-elements/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /659-split-array-into-consecutive-subsequences/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /66-plus-one/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /662-maximum-width-of-binary-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /665-non-decreasing-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /669-trim-a-binary-search-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /67-add-binary/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /680-valid-palindrome-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /682-baseball-game/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /69-sqrtx/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /692-top-k-frequent-words/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /697-degree-of-an-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /70-climbing-stairs/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /700-search-in-a-binary-search-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /701-insert-into-a-binary-search-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /703-kth-largest-element-in-a-stream/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /704-binary-search/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /705-design-hashset/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /706-design-hashmap/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /707-design-linked-list/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /709-to-lower-case/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /71-simplify-path/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /713-subarray-product-less-than-k/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /717-1-bit-and-2-bit-characters/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /72-edit-distance/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /724-find-pivot-index/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /729-my-calendar-i/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /73-set-matrix-zeroes/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /733-flood-fill/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /735-asteroid-collision/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /739-daily-temperatures/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /74-search-a-2d-matrix/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /740-delete-and-earn/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /743-network-delay-time/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /744-find-smallest-letter-greater-than-target/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /745-prefix-and-suffix-search/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /746-min-cost-climbing-stairs/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /752-open-the-lock/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /76-minimum-window-substring/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /763-partition-labels/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /785-is-graph-bipartite/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /8-string-to-integer-atoi/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /80-remove-duplicates-from-sorted-array-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /802-find-eventual-safe-states/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /804-unique-morse-code-words/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /81-search-in-rotated-sorted-array-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /814-binary-tree-pruning/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /815-bus-routes/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /82-remove-duplicates-from-sorted-list-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /820-short-encoding-of-words/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /823-binary-trees-with-factors/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /826-most-profit-assigning-work/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /844-backspace-string-compare/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /847-shortest-path-visiting-all-nodes/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /849-maximize-distance-to-closest-person/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /852-peak-index-in-a-mountain-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /856-score-of-parentheses/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /858-mirror-reflection/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /860-lemonade-change/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /863-all-nodes-distance-k-in-binary-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /867-transpose-matrix/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /869-reordered-power-of-2/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /871-minimum-number-of-refueling-stops/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /875-koko-eating-bananas/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /876-middle-of-the-linked-list/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /88-merge-sorted-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /881-boats-to-save-people/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /886-possible-bipartition/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /890-find-and-replace-pattern/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /895-maximum-frequency-stack/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /896-monotonic-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /897-increasing-order-search-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /90-subsets-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /901-online-stock-span/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /905-sort-array-by-parity/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /91-decode-ways/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /910-smallest-range-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /911-online-election/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /916-word-subsets/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /92-reverse-linked-list-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /923-3sum-with-multiplicity/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /936-stamping-the-sequence/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /94-binary-tree-inorder-traversal/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /941-valid-mountain-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /947-most-stones-removed-with-same-row-or-column/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /948-bag-of-tokens/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /953-verifying-an-alien-dictionary/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /967-numbers-with-same-consecutive-differences/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /968-binary-tree-cameras/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /973-k-closest-points-to-origin/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /976-largest-perimeter-triangle/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /98-validate-binary-search-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /981-time-based-key-value-store/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /987-vertical-order-traversal-of-a-binary-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /989-add-to-array-form-of-integer/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /99-recover-binary-search-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /991-broken-calculator/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /994-rotting-oranges/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /997-find-the-town-judge/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ --------------------------------------------------------------------------------