├── 1-two-sum ├── NOTES.md └── README.md ├── 1006-clumsy-factorial ├── NOTES.md └── README.md ├── 1007-minimum-domino-rotations-for-equal-row ├── 1007-minimum-domino-rotations-for-equal-row.cpp ├── NOTES.md └── README.md ├── 1009-complement-of-base-10-integer ├── 1009-complement-of-base-10-integer.cpp ├── NOTES.md └── README.md ├── 1019-next-greater-node-in-linked-list ├── 1019-next-greater-node-in-linked-list.cpp ├── NOTES.md └── README.md ├── 1022-sum-of-root-to-leaf-binary-numbers ├── 1022-sum-of-root-to-leaf-binary-numbers.cpp ├── NOTES.md └── README.md ├── 1029-two-city-scheduling ├── 1029-two-city-scheduling.cpp ├── NOTES.md └── README.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 ├── 104-maximum-depth-of-binary-tree.cpp ├── NOTES.md └── README.md ├── 1046-last-stone-weight ├── 1046-last-stone-weight.cpp └── 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 ├── NOTES.md └── README.md ├── 1074-number-of-submatrices-that-sum-to-target ├── 1074-number-of-submatrices-that-sum-to-target.cpp ├── NOTES.md └── README.md ├── 1081-smallest-subsequence-of-distinct-characters ├── 1081-smallest-subsequence-of-distinct-characters.cpp ├── NOTES.md └── README.md ├── 1091-shortest-path-in-binary-matrix ├── 1091-shortest-path-in-binary-matrix.cpp ├── NOTES.md └── README.md ├── 11-container-with-most-water ├── 11-container-with-most-water.cpp ├── NOTES.md └── README.md ├── 1103-distribute-candies-to-people ├── 1103-distribute-candies-to-people.cpp ├── NOTES.md └── README.md ├── 1110-delete-nodes-and-return-forest ├── 1110-delete-nodes-and-return-forest.cpp ├── NOTES.md └── README.md ├── 1123-lowest-common-ancestor-of-deepest-leaves ├── 1123-lowest-common-ancestor-of-deepest-leaves.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 ├── 1184-distance-between-bus-stops ├── 1184-distance-between-bus-stops.cpp ├── NOTES.md └── README.md ├── 1192-critical-connections-in-a-network ├── 1192-critical-connections-in-a-network.cpp ├── NOTES.md └── README.md ├── 120-triangle ├── 120-triangle.cpp ├── NOTES.md └── README.md ├── 1202-smallest-string-with-swaps ├── 1202-smallest-string-with-swaps.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 └── README.md ├── 1221-split-a-string-in-balanced-strings ├── 1221-split-a-string-in-balanced-strings.cpp ├── NOTES.md └── README.md ├── 124-binary-tree-maximum-path-sum ├── 124-binary-tree-maximum-path-sum.cpp └── README.md ├── 1249-minimum-remove-to-make-valid-parentheses ├── 1249-minimum-remove-to-make-valid-parentheses.cpp └── README.md ├── 1260-shift-2d-grid ├── 1260-shift-2d-grid.cpp ├── NOTES.md └── README.md ├── 1261-find-elements-in-a-contaminated-binary-tree ├── 1261-find-elements-in-a-contaminated-binary-tree.cpp ├── NOTES.md └── README.md ├── 1268-search-suggestions-system ├── 1268-search-suggestions-system.cpp ├── NOTES.md └── README.md ├── 127-word-ladder ├── 127-word-ladder.cpp ├── NOTES.md └── README.md ├── 128-longest-consecutive-sequence ├── 128-longest-consecutive-sequence.cpp ├── NOTES.md └── README.md ├── 1288-remove-covered-intervals ├── 1288-remove-covered-intervals.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 ├── 1302-deepest-leaves-sum ├── 1302-deepest-leaves-sum.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 ├── 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 └── README.md ├── 1332-remove-palindromic-subsequences ├── 1332-remove-palindromic-subsequences.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 ├── 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 ├── 1354-construct-target-array-with-multiple-sums ├── 1354-construct-target-array-with-multiple-sums.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 ├── 1370-increasing-decreasing-string ├── 1370-increasing-decreasing-string.cpp ├── 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 ├── 1396-design-underground-system ├── 1396-design-underground-system.cpp ├── NOTES.md └── README.md ├── 1413-minimum-value-to-get-positive-step-by-step-sum ├── 1413-minimum-value-to-get-positive-step-by-step-sum.cpp ├── NOTES.md └── README.md ├── 142-linked-list-cycle-ii ├── 142-linked-list-cycle-ii.cpp ├── NOTES.md └── README.md ├── 1441-build-an-array-with-stack-operations ├── 1441-build-an-array-with-stack-operations.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 ├── 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 └── 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 └── README.md ├── 148-sort-list ├── 148-sort-list.cpp └── NOTES.md ├── 1480-running-sum-of-1d-array ├── 1480-running-sum-of-1d-array.cpp ├── NOTES.md └── README.md ├── 1487-making-file-names-unique ├── 1487-making-file-names-unique.cpp ├── NOTES.md └── README.md ├── 15-3sum ├── NOTES.md └── README.md ├── 1502-can-make-arithmetic-progression-from-sequence ├── NOTES.md └── README.md ├── 152-maximum-product-subarray ├── 152-maximum-product-subarray.cpp ├── NOTES.md └── README.md ├── 153-find-minimum-in-rotated-sorted-array ├── 153-find-minimum-in-rotated-sorted-array.cpp ├── NOTES.md └── README.md ├── 155-min-stack ├── 155-min-stack.cpp ├── NOTES.md └── README.md ├── 1561-maximum-number-of-coins-you-can-get ├── 1561-maximum-number-of-coins-you-can-get.cpp ├── NOTES.md └── README.md ├── 1584-min-cost-to-connect-all-points ├── 1584-min-cost-to-connect-all-points.cpp ├── NOTES.md └── README.md ├── 160-intersection-of-two-linked-lists ├── 160-intersection-of-two-linked-lists.cpp ├── NOTES.md └── README.md ├── 1630-arithmetic-subarrays ├── 1630-arithmetic-subarrays.cpp ├── NOTES.md └── README.md ├── 1631-path-with-minimum-effort ├── 1631-path-with-minimum-effort.cpp ├── NOTES.md └── README.md ├── 1641-count-sorted-vowel-strings ├── 1641-count-sorted-vowel-strings.cpp ├── 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 ├── 165-compare-version-numbers ├── 165-compare-version-numbers.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 ├── 1663-smallest-string-with-a-given-numeric-value ├── 1663-smallest-string-with-a-given-numeric-value.cpp ├── NOTES.md └── README.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 ├── 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 ├── 168-excel-sheet-column-title └── README.md ├── 1684-count-the-number-of-consistent-strings ├── 1684-count-the-number-of-consistent-strings.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 └── README.md ├── 1695-maximum-erasure-value ├── 1695-maximum-erasure-value.cpp ├── NOTES.md └── README.md ├── 1696-jump-game-vi ├── 1696-jump-game-vi.cpp ├── NOTES.md └── README.md ├── 17-letter-combinations-of-a-phone-number ├── 17-letter-combinations-of-a-phone-number.cpp ├── NOTES.md └── README.md ├── 171-excel-sheet-column-number ├── 171-excel-sheet-column-number.cpp ├── NOTES.md └── README.md ├── 1721-swapping-nodes-in-a-linked-list ├── 1721-swapping-nodes-in-a-linked-list.cpp ├── NOTES.md └── README.md ├── 173-binary-search-tree-iterator ├── 173-binary-search-tree-iterator.cpp ├── NOTES.md └── README.md ├── 1742-maximum-number-of-balls-in-a-box ├── 1742-maximum-number-of-balls-in-a-box.cpp ├── NOTES.md └── README.md ├── 1812-determine-color-of-a-chessboard-square ├── 1812-determine-color-of-a-chessboard-square.cpp ├── NOTES.md └── README.md ├── 1814-count-nice-pairs-in-an-array ├── 1814-count-nice-pairs-in-an-array.cpp ├── NOTES.md └── README.md ├── 1877-minimize-maximum-pair-sum-in-array ├── 1877-minimize-maximum-pair-sum-in-array.cpp ├── NOTES.md └── README.md ├── 189-rotate-array ├── 189-rotate-array.cpp ├── NOTES.md └── README.md ├── 191-number-of-1-bits ├── 191-number-of-1-bits.cpp ├── NOTES.md └── README.md ├── 198-house-robber ├── 198-house-robber.cpp ├── NOTES.md └── README.md ├── 1984-minimum-difference-between-highest-and-lowest-of-k-scores ├── 1984-minimum-difference-between-highest-and-lowest-of-k-scores.cpp ├── NOTES.md └── README.md ├── 1985-find-the-kth-largest-integer-in-the-array ├── 1985-find-the-kth-largest-integer-in-the-array.py ├── NOTES.md └── README.md ├── 20-valid-parentheses ├── 20-valid-parentheses.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 ├── 2037-minimum-number-of-moves-to-seat-everyone ├── 2037-minimum-number-of-moves-to-seat-everyone.cpp ├── NOTES.md └── README.md ├── 2047-number-of-valid-words-in-a-sentence ├── 2047-number-of-valid-words-in-a-sentence.cpp ├── NOTES.md └── README.md ├── 205-isomorphic-strings ├── 205-isomorphic-strings.cpp ├── NOTES.md └── README.md ├── 206-reverse-linked-list ├── 206-reverse-linked-list.cpp ├── NOTES.md └── README.md ├── 2079-watering-plants ├── 2079-watering-plants.cpp ├── NOTES.md └── README.md ├── 209-minimum-size-subarray-sum ├── 209-minimum-size-subarray-sum.cpp ├── NOTES.md └── README.md ├── 2095-delete-the-middle-node-of-a-linked-list ├── 2095-delete-the-middle-node-of-a-linked-list.cpp ├── NOTES.md └── README.md ├── 21-merge-two-sorted-lists ├── 21-merge-two-sorted-lists.cpp ├── NOTES.md └── README.md ├── 2104-sum-of-subarray-ranges ├── 2104-sum-of-subarray-ranges.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 ├── 2114-maximum-number-of-words-found-in-sentences ├── 2114-maximum-number-of-words-found-in-sentences.cpp ├── NOTES.md └── README.md ├── 2129-capitalize-the-title ├── 2129-capitalize-the-title.cpp ├── NOTES.md └── README.md ├── 2130-maximum-twin-sum-of-a-linked-list ├── 2130-maximum-twin-sum-of-a-linked-list.cpp ├── NOTES.md └── 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 ├── 2145-count-the-hidden-sequences ├── 2145-count-the-hidden-sequences.cpp ├── NOTES.md └── README.md ├── 2148-count-elements-with-strictly-smaller-and-greater-elements ├── 2148-count-elements-with-strictly-smaller-and-greater-elements.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 └── README.md ├── 216-combination-sum-iii ├── 216-combination-sum-iii.cpp ├── NOTES.md └── 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 └── README.md ├── 2162-minimum-cost-to-set-cooking-time ├── 2162-minimum-cost-to-set-cooking-time.cpp ├── NOTES.md └── README.md ├── 2164-sort-even-and-odd-indices-independently ├── 2164-sort-even-and-odd-indices-independently.cpp ├── NOTES.md └── 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 ├── 2180-count-integers-with-even-digit-sum ├── 2180-count-integers-with-even-digit-sum.cpp ├── NOTES.md └── README.md ├── 2181-merge-nodes-in-between-zeros ├── 2181-merge-nodes-in-between-zeros.cpp ├── NOTES.md └── README.md ├── 2185-counting-words-with-a-given-prefix ├── 2185-counting-words-with-a-given-prefix.cpp ├── NOTES.md └── README.md ├── 225-implement-stack-using-queues ├── 225-implement-stack-using-queues.cpp ├── NOTES.md └── README.md ├── 226-invert-binary-tree ├── 226-invert-binary-tree.cpp ├── NOTES.md └── README.md ├── 228-summary-ranges ├── 228-summary-ranges.cpp ├── NOTES.md └── README.md ├── 229-majority-element-ii ├── 229-majority-element-ii.cpp ├── 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 ├── 237-delete-node-in-a-linked-list ├── 237-delete-node-in-a-linked-list.cpp ├── NOTES.md └── README.md ├── 24-swap-nodes-in-pairs ├── 24-swap-nodes-in-pairs.cpp ├── NOTES.md └── README.md ├── 258-add-digits ├── 258-add-digits.cpp ├── NOTES.md └── README.md ├── 268-missing-number ├── 268-missing-number.cpp ├── NOTES.md └── README.md ├── 284-peeking-iterator ├── NOTES.md └── README.md ├── 287-find-the-duplicate-number ├── 287-find-the-duplicate-number.cpp └── NOTES.md ├── 289-game-of-life ├── 289-game-of-life.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 ├── 3-longest-substring-without-repeating-characters ├── 3-longest-substring-without-repeating-characters.cpp ├── NOTES.md └── README.md ├── 304-range-sum-query-2d-immutable ├── 304-range-sum-query-2d-immutable.cpp ├── NOTES.md └── README.md ├── 31-next-permutation ├── 31-next-permutation.cpp ├── NOTES.md └── README.md ├── 316-remove-duplicate-letters ├── 316-remove-duplicate-letters.cpp ├── NOTES.md └── README.md ├── 318-maximum-product-of-word-lengths ├── 318-maximum-product-of-word-lengths.cpp ├── NOTES.md └── README.md ├── 32-longest-valid-parentheses ├── 32-longest-valid-parentheses.cpp ├── NOTES.md └── README.md ├── 322-coin-change ├── 322-coin-change.cpp ├── NOTES.md └── 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 └── README.md ├── 338-counting-bits ├── 338-counting-bits.cpp ├── NOTES.md └── README.md ├── 341-flatten-nested-list-iterator ├── 341-flatten-nested-list-iterator.cpp ├── NOTES.md └── README.md ├── 344-reverse-string ├── 344-reverse-string.cpp ├── NOTES.md └── README.md ├── 345-reverse-vowels-of-a-string ├── 345-reverse-vowels-of-a-string.cpp ├── NOTES.md └── README.md ├── 347-top-k-frequent-elements └── NOTES.md ├── 354-russian-doll-envelopes ├── 354-russian-doll-envelopes.cpp ├── NOTES.md └── README.md ├── 371-sum-of-two-integers ├── 371-sum-of-two-integers.cpp ├── NOTES.md └── README.md ├── 382-linked-list-random-node ├── 382-linked-list-random-node.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 ├── 399-evaluate-division ├── 399-evaluate-division.cpp ├── NOTES.md └── README.md ├── 402-remove-k-digits ├── 402-remove-k-digits.cpp ├── NOTES.md └── README.md ├── 406-queue-reconstruction-by-height ├── 406-queue-reconstruction-by-height.cpp ├── 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 └── README.md ├── 421-maximum-xor-of-two-numbers-in-an-array ├── 421-maximum-xor-of-two-numbers-in-an-array.cpp ├── NOTES.md └── README.md ├── 43-multiply-strings ├── 43-multiply-strings.py ├── NOTES.md └── README.md ├── 438-find-all-anagrams-in-a-string ├── 438-find-all-anagrams-in-a-string.cpp ├── NOTES.md └── README.md ├── 445-add-two-numbers-ii ├── 445-add-two-numbers-ii.cpp ├── NOTES.md └── README.md ├── 454-4sum-ii ├── 454-4sum-ii.cpp ├── NOTES.md └── README.md ├── 456-132-pattern ├── 456-132-pattern.cpp ├── NOTES.md └── README.md ├── 47-permutations-ii ├── 47-permutations-ii.cpp ├── NOTES.md └── README.md ├── 474-ones-and-zeroes ├── 474-ones-and-zeroes.cpp ├── NOTES.md └── README.md ├── 496-next-greater-element-i ├── 496-next-greater-element-i.cpp └── NOTES.md ├── 5-longest-palindromic-substring ├── 5-longest-palindromic-substring.cpp ├── NOTES.md └── README.md ├── 503-next-greater-element-ii ├── 503-next-greater-element-ii.cpp └── NOTES.md ├── 504-base-7 ├── 504-base-7.cpp ├── NOTES.md └── README.md ├── 509-fibonacci-number ├── 509-fibonacci-number.cpp ├── NOTES.md └── README.md ├── 51-n-queens ├── NOTES.md └── README.md ├── 513-find-bottom-left-tree-value ├── 513-find-bottom-left-tree-value.cpp ├── NOTES.md └── README.md ├── 52-n-queens-ii ├── 52-n-queens-ii.cpp ├── NOTES.md └── README.md ├── 520-detect-capital ├── 520-detect-capital.cpp ├── NOTES.md └── README.md ├── 525-contiguous-array ├── 525-contiguous-array.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 └── 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 ├── 556-next-greater-element-iii ├── 556-next-greater-element-iii.cpp ├── NOTES.md └── README.md ├── 560-subarray-sum-equals-k ├── 560-subarray-sum-equals-k.cpp ├── NOTES.md └── README.md ├── 561-array-partition-i ├── NOTES.md └── README.md ├── 567-permutation-in-string ├── 567-permutation-in-string.cpp ├── NOTES.md └── README.md ├── 572-subtree-of-another-tree ├── 572-subtree-of-another-tree.cpp ├── NOTES.md └── README.md ├── 576-out-of-boundary-paths ├── 576-out-of-boundary-paths.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 ├── 59-spiral-matrix-ii ├── 59-spiral-matrix-ii.cpp ├── NOTES.md └── README.md ├── 605-can-place-flowers ├── 605-can-place-flowers.cpp ├── NOTES.md └── README.md ├── 63-unique-paths-ii ├── NOTES.md └── README.md ├── 630-course-schedule-iii ├── 630-course-schedule-iii.cpp ├── NOTES.md └── README.md ├── 647-palindromic-substrings ├── 647-palindromic-substrings.cpp ├── NOTES.md └── README.md ├── 654-maximum-binary-tree ├── 654-maximum-binary-tree.cpp ├── NOTES.md └── README.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 └── README.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 └── README.md ├── 682-baseball-game ├── 682-baseball-game.cpp ├── NOTES.md └── README.md ├── 695-max-area-of-island ├── 695-max-area-of-island.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 └── README.md ├── 704-binary-search ├── 704-binary-search.cpp └── 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 └── README.md ├── 71-simplify-path ├── 71-simplify-path.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 └── README.md ├── 743-network-delay-time ├── 743-network-delay-time.cpp ├── NOTES.md └── README.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 ├── 745-prefix-and-suffix-search.cpp ├── NOTES.md └── README.md ├── 747-largest-number-at-least-twice-of-others ├── 747-largest-number-at-least-twice-of-others.cpp └── README.md ├── 75-sort-colors ├── 75-sort-colors.cpp ├── NOTES.md └── README.md ├── 763-partition-labels ├── 763-partition-labels.cpp ├── NOTES.md └── README.md ├── 771-jewels-and-stones ├── 771-jewels-and-stones.cpp ├── NOTES.md └── README.md ├── 78-subsets ├── NOTES.md └── README.md ├── 785-is-graph-bipartite ├── 785-is-graph-bipartite.cpp ├── NOTES.md └── README.md ├── 792-number-of-matching-subsequences ├── 792-number-of-matching-subsequences.cpp ├── NOTES.md └── README.md ├── 799-champagne-tower ├── 799-champagne-tower.cpp ├── NOTES.md └── README.md ├── 80-remove-duplicates-from-sorted-array-ii ├── 80-remove-duplicates-from-sorted-array-ii.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 ├── 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 ├── 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 └── README.md ├── 856-score-of-parentheses ├── 856-score-of-parentheses.cpp ├── NOTES.md └── README.md ├── 86-partition-list ├── 86-partition-list.cpp ├── NOTES.md └── README.md ├── 867-transpose-matrix ├── 867-transpose-matrix.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 ├── 895-maximum-frequency-stack ├── 895-maximum-frequency-stack.cpp ├── NOTES.md └── README.md ├── 896-monotonic-array ├── NOTES.md └── README.md ├── 897-increasing-order-search-tree ├── 897-increasing-order-search-tree.cpp ├── NOTES.md └── README.md ├── 905-sort-array-by-parity ├── 905-sort-array-by-parity.cpp ├── NOTES.md └── README.md ├── 923-3sum-with-multiplicity ├── 923-3sum-with-multiplicity.cpp ├── NOTES.md └── README.md ├── 94-binary-tree-inorder-traversal ├── 94-binary-tree-inorder-traversal.cpp ├── NOTES.md └── README.md ├── 941-valid-mountain-array ├── 941-valid-mountain-array.cpp ├── NOTES.md └── README.md ├── 946-validate-stack-sequences ├── 946-validate-stack-sequences.cpp └── README.md ├── 965-univalued-binary-tree ├── 965-univalued-binary-tree.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 ├── 971-flip-binary-tree-to-match-preorder-traversal ├── 971-flip-binary-tree-to-match-preorder-traversal.cpp ├── NOTES.md └── README.md ├── 979-distribute-coins-in-binary-tree ├── 979-distribute-coins-in-binary-tree.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 ├── README.md ├── Split a Circular Linked List into two halves - GFG ├── README.md └── split-a-circular-linked-list-into-two-halves.cpp ├── add-digits ├── README.md └── add-digits.cpp ├── add-strings ├── README.md └── add-strings.cpp ├── add-two-numbers-ii ├── README.md └── add-two-numbers-ii.cpp ├── add-two-numbers ├── README.md └── add-two-numbers.cpp ├── adding-spaces-to-a-string ├── README.md └── adding-spaces-to-a-string.cpp ├── all-elements-in-two-binary-search-trees ├── README.md └── all-elements-in-two-binary-search-trees.cpp ├── all-nodes-distance-k-in-binary-tree ├── README.md └── all-nodes-distance-k-in-binary-tree.cpp ├── average-salary-excluding-the-minimum-and-maximum-salary ├── README.md └── average-salary-excluding-the-minimum-and-maximum-salary.cpp ├── balance-a-binary-search-tree ├── README.md └── balance-a-binary-search-tree.cpp ├── balanced-binary-tree ├── README.md └── balanced-binary-tree.cpp ├── baseball-game ├── README.md └── baseball-game.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 ├── README.md └── best-time-to-buy-and-sell-stock.cpp ├── binary-search-tree-to-greater-sum-tree ├── README.md └── binary-search-tree-to-greater-sum-tree.cpp ├── binary-search ├── README.md └── binary-search.cpp ├── binary-tree-inorder-traversal ├── README.md └── binary-tree-inorder-traversal.cpp ├── binary-tree-level-order-traversal-ii ├── README.md └── binary-tree-level-order-traversal-ii.cpp ├── binary-tree-level-order-traversal ├── README.md ├── binary-tree-level-order-traversal.cpp └── binary-tree-level-order-traversal.py ├── binary-tree-paths ├── README.md └── binary-tree-paths.cpp ├── binary-tree-postorder-traversal └── README.md ├── binary-tree-preorder-traversal ├── README.md └── binary-tree-preorder-traversal.cpp ├── binary-tree-right-side-view ├── README.md └── binary-tree-right-side-view.cpp ├── binary-tree-zigzag-level-order-traversal ├── README.md └── binary-tree-zigzag-level-order-traversal.cpp ├── check-completeness-of-a-binary-tree ├── README.md └── check-completeness-of-a-binary-tree.cpp ├── check-if-word-equals-summation-of-two-words ├── README.md └── check-if-word-equals-summation-of-two-words.cpp ├── coin-change-2 ├── README.md └── coin-change-2.cpp ├── coin-change ├── README.md └── coin-change.cpp ├── complement-of-base-10-integer ├── README.md └── complement-of-base-10-integer.cpp ├── concatenation-of-array ├── README.md └── concatenation-of-array.cpp ├── consecutive-characters ├── README.md └── consecutive-characters.cpp ├── construct-binary-search-tree-from-preorder-traversal ├── README.md └── construct-binary-search-tree-from-preorder-traversal.cpp ├── contains-duplicate ├── README.md └── contains-duplicate.cpp ├── convert-binary-number-in-a-linked-list-to-integer ├── README.md └── convert-binary-number-in-a-linked-list-to-integer.cpp ├── convert-sorted-array-to-binary-search-tree ├── README.md └── convert-sorted-array-to-binary-search-tree.cpp ├── convert-sorted-list-to-binary-search-tree ├── README.md └── convert-sorted-list-to-binary-search-tree.cpp ├── copy-list-with-random-pointer ├── README.md └── copy-list-with-random-pointer.cpp ├── count-complete-tree-nodes ├── README.md └── count-complete-tree-nodes.cpp ├── count-primes ├── README.md └── count-primes.cpp ├── cousins-in-binary-tree ├── README.md └── cousins-in-binary-tree.cpp ├── daily-temperatures └── README.md ├── deepest-leaves-sum ├── README.md └── deepest-leaves-sum.cpp ├── defanging-an-ip-address └── README.md ├── delete-node-in-a-bst ├── README.md └── delete-node-in-a-bst.cpp ├── delete-node-in-a-linked-list ├── README.md └── delete-node-in-a-linked-list.cpp ├── design-hashset ├── README.md └── design-hashset.cpp ├── design-parking-system ├── README.md └── design-parking-system.cpp ├── detect-capital ├── README.md └── detect-capital.cpp ├── determine-if-string-halves-are-alike ├── README.md └── determine-if-string-halves-are-alike.cpp ├── diameter-of-binary-tree ├── README.md └── diameter-of-binary-tree.cpp ├── divisor-game ├── README.md └── divisor-game.cpp ├── evaluate-reverse-polish-notation ├── README.md └── evaluate-reverse-polish-notation.java ├── excel-sheet-column-number ├── README.md └── excel-sheet-column-number.cpp ├── find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree ├── README.md └── find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree.cpp ├── find-all-numbers-disappeared-in-an-array ├── README.md └── find-all-numbers-disappeared-in-an-array.cpp ├── find-center-of-star-graph └── README.md ├── 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-k-pairs-with-smallest-sums ├── README.md └── find-k-pairs-with-smallest-sums.cpp ├── find-mode-in-binary-search-tree ├── README.md └── find-mode-in-binary-search-tree.cpp ├── find-nearest-point-that-has-the-same-x-or-y-coordinate ├── README.md └── find-nearest-point-that-has-the-same-x-or-y-coordinate.cpp ├── find-pivot-index ├── README.md └── find-pivot-index.cpp ├── find-the-difference ├── README.md └── find-the-difference.cpp ├── find-the-middle-index-in-array ├── README.md └── find-the-middle-index-in-array.cpp ├── first-bad-version ├── README.md └── first-bad-version.cpp ├── flatten-a-multilevel-doubly-linked-list ├── README.md └── flatten-a-multilevel-doubly-linked-list.cpp ├── flatten-binary-tree-to-linked-list ├── README.md └── flatten-binary-tree-to-linked-list.cpp ├── group-anagrams ├── README.md └── group-anagrams.cpp ├── guess-number-higher-or-lower ├── README.md └── guess-number-higher-or-lower.cpp ├── hamming-distance ├── README.md └── hamming-distance.cpp ├── implement-queue-using-stacks ├── README.md └── implement-queue-using-stacks.cpp ├── implement-stack-using-queues ├── README.md └── implement-stack-using-queues.cpp ├── increasing-order-search-tree ├── README.md └── increasing-order-search-tree.cpp ├── insert-interval ├── README.md └── insert-interval.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 ├── invert-binary-tree ├── README.md └── invert-binary-tree.cpp ├── jewels-and-stones ├── README.md └── jewels-and-stones.cpp ├── k-closest-points-to-origin ├── README.md └── k-closest-points-to-origin.cpp ├── k-diff-pairs-in-an-array ├── README.md └── k-diff-pairs-in-an-array.cpp ├── keyboard-row ├── README.md └── keyboard-row.cpp ├── kth-largest-element-in-a-stream ├── README.md └── kth-largest-element-in-a-stream.cpp ├── kth-smallest-element-in-a-bst ├── README.md └── kth-smallest-element-in-a-bst.cpp ├── kth-smallest-element-in-a-sorted-matrix ├── README.md └── kth-smallest-element-in-a-sorted-matrix.cpp ├── last-stone-weight-ii ├── README.md └── last-stone-weight-ii.cpp ├── last-stone-weight ├── README.md └── last-stone-weight.cpp ├── length-of-last-word ├── README.md └── length-of-last-word.cpp ├── linked-list-components ├── README.md └── linked-list-components.cpp ├── linked-list-cycle-ii ├── README.md └── linked-list-cycle-ii.cpp ├── linked-list-cycle ├── README.md └── linked-list-cycle.cpp ├── linked-list-in-binary-tree ├── README.md └── linked-list-in-binary-tree.cpp ├── linked-list-random-node ├── README.md └── linked-list-random-node.cpp ├── longest-common-prefix ├── README.md └── longest-common-prefix.cpp ├── longest-common-subsequence ├── README.md └── longest-common-subsequence.cpp ├── lowest-common-ancestor-of-a-binary-search-tree ├── README.md └── lowest-common-ancestor-of-a-binary-search-tree.cpp ├── lowest-common-ancestor-of-a-binary-tree ├── README.md └── lowest-common-ancestor-of-a-binary-tree.cpp ├── max-chunks-to-make-sorted ├── README.md └── max-chunks-to-make-sorted.cpp ├── maximize-sum-of-array-after-k-negations ├── README.md └── maximize-sum-of-array-after-k-negations.cpp ├── maximum-69-number ├── README.md └── maximum-69-number.cpp ├── maximum-binary-tree └── README.md ├── maximum-depth-of-binary-tree ├── README.md └── maximum-depth-of-binary-tree.cpp ├── maximum-depth-of-n-ary-tree ├── README.md └── maximum-depth-of-n-ary-tree.cpp ├── maximum-difference-between-node-and-ancestor ├── README.md └── maximum-difference-between-node-and-ancestor.cpp ├── maximum-length-of-repeated-subarray ├── README.md └── maximum-length-of-repeated-subarray.cpp ├── maximum-subarray ├── README.md └── maximum-subarray.cpp ├── merge-in-between-linked-lists ├── README.md └── merge-in-between-linked-lists.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-strings-alternately └── README.md ├── 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 ├── minimum-absolute-difference-in-bst ├── README.md └── minimum-absolute-difference-in-bst.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-depth-of-binary-tree ├── README.md └── minimum-depth-of-binary-tree.cpp ├── minimum-distance-between-bst-nodes ├── README.md └── minimum-distance-between-bst-nodes.cpp ├── minimum-operations-to-make-array-equal ├── README.md └── minimum-operations-to-make-array-equal.cpp ├── my-calendar-i ├── README.md └── my-calendar-i.cpp ├── my-calendar-ii ├── README.md └── my-calendar-ii.cpp ├── n-ary-tree-level-order-traversal ├── README.md └── n-ary-tree-level-order-traversal.cpp ├── n-ary-tree-preorder-traversal ├── README.md └── n-ary-tree-preorder-traversal.cpp ├── n-repeated-element-in-size-2n-array ├── README.md └── n-repeated-element-in-size-2n-array.cpp ├── next-greater-node-in-linked-list ├── README.md └── next-greater-node-in-linked-list.cpp ├── non-overlapping-intervals ├── README.md └── non-overlapping-intervals.cpp ├── number-complement ├── README.md └── number-complement.cpp ├── number-of-rectangles-that-can-form-the-largest-square ├── README.md └── number-of-rectangles-that-can-form-the-largest-square.cpp ├── number-of-steps-to-reduce-a-number-to-zero ├── README.md └── number-of-steps-to-reduce-a-number-to-zero.cpp ├── odd-even-linked-list ├── README.md └── odd-even-linked-list.cpp ├── pairs-of-songs-with-total-durations-divisible-by-60 ├── README.md └── pairs-of-songs-with-total-durations-divisible-by-60.cpp ├── palindrome-linked-list ├── README.md └── palindrome-linked-list.cpp ├── palindrome-number ├── README.md └── palindrome-number.cpp ├── partition-equal-subset-sum ├── README.md └── partition-equal-subset-sum.cpp ├── partition-list ├── README.md └── partition-list.cpp ├── pascals-triangle ├── README.md └── pascals-triangle.cpp ├── path-in-zigzag-labelled-binary-tree ├── README.md └── path-in-zigzag-labelled-binary-tree.cpp ├── path-sum-ii ├── README.md └── path-sum-ii.cpp ├── path-sum ├── README.md └── path-sum.cpp ├── permutations ├── README.md └── permutations.cpp ├── populating-next-right-pointers-in-each-node ├── README.md └── populating-next-right-pointers-in-each-node.cpp ├── power-of-three ├── README.md └── power-of-three.cpp ├── power-of-two ├── README.md └── power-of-two.cpp ├── powx-n ├── README.md └── powx-n.cpp ├── product-of-array-except-self ├── README.md └── product-of-array-except-self.cpp ├── queries-on-number-of-points-inside-a-circle └── README.md ├── random-pick-index ├── README.md └── random-pick-index.cpp ├── random-pick-with-blacklist ├── README.md └── random-pick-with-blacklist.cpp ├── random-pick-with-weight ├── README.md └── random-pick-with-weight.cpp ├── random-point-in-non-overlapping-rectangles ├── README.md └── random-point-in-non-overlapping-rectangles.cpp ├── range-sum-of-bst ├── README.md └── range-sum-of-bst.cpp ├── range-sum-of-sorted-subarray-sums ├── README.md └── range-sum-of-sorted-subarray-sums.cpp ├── range-sum-query-immutable ├── README.md └── range-sum-query-immutable.cpp ├── ransom-note ├── README.md └── ransom-note.cpp ├── reformat-date ├── README.md └── reformat-date.cpp ├── relative-ranks ├── README.md └── relative-ranks.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-duplicates-from-sorted-list.cpp ├── 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 ├── remove-outermost-parentheses ├── README.md └── remove-outermost-parentheses.cpp ├── remove-zero-sum-consecutive-nodes-from-linked-list ├── README.md └── remove-zero-sum-consecutive-nodes-from-linked-list.cpp ├── reorder-list ├── README.md └── reorder-list.cpp ├── reverse-integer ├── README.md └── reverse-integer.cpp ├── reverse-linked-list-ii ├── README.md └── reverse-linked-list-ii.cpp ├── reverse-linked-list ├── README.md └── reverse-linked-list.cpp ├── reverse-nodes-in-k-group ├── README.md └── reverse-nodes-in-k-group.cpp ├── reverse-words-in-a-string ├── README.md └── reverse-words-in-a-string.py ├── roman-to-integer ├── README.md └── roman-to-integer.cpp ├── rotate-array ├── README.md ├── rotate-array.cpp └── rotate-array.java ├── rotate-list ├── README.md └── rotate-list.cpp ├── same-tree ├── README.md └── same-tree.cpp ├── search-in-a-binary-search-tree ├── README.md └── search-in-a-binary-search-tree.cpp ├── search-in-rotated-sorted-array ├── README.md └── search-in-rotated-sorted-array.cpp ├── search-insert-position ├── README.md └── search-insert-position.cpp ├── second-minimum-node-in-a-binary-tree ├── README.md └── second-minimum-node-in-a-binary-tree.cpp ├── self-dividing-numbers ├── README.md └── self-dividing-numbers.cpp ├── set-matrix-zeroes ├── README.md └── set-matrix-zeroes.cpp ├── shortest-common-supersequence ├── README.md └── shortest-common-supersequence.cpp ├── shuffle-string ├── README.md └── shuffle-string.cpp ├── shuffle-the-array ├── README.md └── shuffle-the-array.cpp ├── single-element-in-a-sorted-array ├── README.md └── single-element-in-a-sorted-array.cpp ├── smallest-index-with-equal-value ├── README.md └── smallest-index-with-equal-value.cpp ├── sort-an-array ├── README.md └── sort-an-array.cpp ├── sort-array-by-increasing-frequency ├── README.md └── sort-array-by-increasing-frequency.cpp ├── sort-characters-by-frequency ├── README.md └── sort-characters-by-frequency.cpp ├── sort-list ├── README.md └── sort-list.cpp ├── sorting-the-sentence ├── README.md └── sorting-the-sentence.cpp ├── special-positions-in-a-binary-matrix ├── README.md └── special-positions-in-a-binary-matrix.cpp ├── spiral-matrix ├── README.md └── spiral-matrix.cpp ├── split-linked-list-in-parts ├── README.md └── split-linked-list-in-parts.cpp ├── sqrtx ├── README.md └── sqrtx.cpp ├── squares-of-a-sorted-array ├── README.md └── squares-of-a-sorted-array.cpp ├── stone-game ├── README.md └── stone-game.cpp ├── student-attendance-record-i ├── README.md └── student-attendance-record-i.cpp ├── subarray-sum-equals-k ├── README.md └── subarray-sum-equals-k.cpp ├── subrectangle-queries ├── README.md └── subrectangle-queries.cpp ├── subtract-the-product-and-sum-of-digits-of-an-integer └── README.md ├── sum-of-digits-in-base-k ├── README.md └── sum-of-digits-in-base-k.cpp ├── sum-of-left-leaves ├── README.md └── sum-of-left-leaves.cpp ├── sum-of-nodes-with-even-valued-grandparent ├── README.md └── sum-of-nodes-with-even-valued-grandparent.cpp ├── sum-root-to-leaf-numbers ├── README.md └── sum-root-to-leaf-numbers.cpp ├── swap-nodes-in-pairs ├── README.md └── swap-nodes-in-pairs.cpp ├── swapping-nodes-in-a-linked-list ├── README.md └── swapping-nodes-in-a-linked-list.cpp ├── symmetric-tree ├── README.md └── symmetric-tree.cpp ├── target-sum ├── README.md └── target-sum.cpp ├── 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 ├── valid-mountain-array ├── README.md └── valid-mountain-array.cpp └── validate-binary-search-tree ├── README.md └── validate-binary-search-tree.cpp /1-two-sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1-two-sum/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1-two-sum/README.md -------------------------------------------------------------------------------- /1006-clumsy-factorial/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1006-clumsy-factorial/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1006-clumsy-factorial/README.md -------------------------------------------------------------------------------- /1007-minimum-domino-rotations-for-equal-row/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1007-minimum-domino-rotations-for-equal-row/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1007-minimum-domino-rotations-for-equal-row/README.md -------------------------------------------------------------------------------- /1009-complement-of-base-10-integer/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1009-complement-of-base-10-integer/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1009-complement-of-base-10-integer/README.md -------------------------------------------------------------------------------- /1019-next-greater-node-in-linked-list/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1019-next-greater-node-in-linked-list/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1019-next-greater-node-in-linked-list/README.md -------------------------------------------------------------------------------- /1022-sum-of-root-to-leaf-binary-numbers/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1022-sum-of-root-to-leaf-binary-numbers/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1022-sum-of-root-to-leaf-binary-numbers/README.md -------------------------------------------------------------------------------- /1029-two-city-scheduling/1029-two-city-scheduling.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1029-two-city-scheduling/1029-two-city-scheduling.cpp -------------------------------------------------------------------------------- /1029-two-city-scheduling/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1029-two-city-scheduling/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1029-two-city-scheduling/README.md -------------------------------------------------------------------------------- /1038-binary-search-tree-to-greater-sum-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1038-binary-search-tree-to-greater-sum-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1038-binary-search-tree-to-greater-sum-tree/README.md -------------------------------------------------------------------------------- /104-maximum-depth-of-binary-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /104-maximum-depth-of-binary-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/104-maximum-depth-of-binary-tree/README.md -------------------------------------------------------------------------------- /1046-last-stone-weight/1046-last-stone-weight.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1046-last-stone-weight/1046-last-stone-weight.cpp -------------------------------------------------------------------------------- /1046-last-stone-weight/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1046-last-stone-weight/README.md -------------------------------------------------------------------------------- /1047-remove-all-adjacent-duplicates-in-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1047-remove-all-adjacent-duplicates-in-string/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1047-remove-all-adjacent-duplicates-in-string/README.md -------------------------------------------------------------------------------- /1048-longest-string-chain/1048-longest-string-chain.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1048-longest-string-chain/1048-longest-string-chain.cpp -------------------------------------------------------------------------------- /1048-longest-string-chain/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1048-longest-string-chain/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1048-longest-string-chain/README.md -------------------------------------------------------------------------------- /1074-number-of-submatrices-that-sum-to-target/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1074-number-of-submatrices-that-sum-to-target/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1074-number-of-submatrices-that-sum-to-target/README.md -------------------------------------------------------------------------------- /1081-smallest-subsequence-of-distinct-characters/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1091-shortest-path-in-binary-matrix/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1091-shortest-path-in-binary-matrix/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1091-shortest-path-in-binary-matrix/README.md -------------------------------------------------------------------------------- /11-container-with-most-water/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /11-container-with-most-water/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/11-container-with-most-water/README.md -------------------------------------------------------------------------------- /1103-distribute-candies-to-people/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1103-distribute-candies-to-people/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1103-distribute-candies-to-people/README.md -------------------------------------------------------------------------------- /1110-delete-nodes-and-return-forest/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1110-delete-nodes-and-return-forest/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1110-delete-nodes-and-return-forest/README.md -------------------------------------------------------------------------------- /1123-lowest-common-ancestor-of-deepest-leaves/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1123-lowest-common-ancestor-of-deepest-leaves/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1123-lowest-common-ancestor-of-deepest-leaves/README.md -------------------------------------------------------------------------------- /117-populating-next-right-pointers-in-each-node-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1184-distance-between-bus-stops/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1184-distance-between-bus-stops/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1184-distance-between-bus-stops/README.md -------------------------------------------------------------------------------- /1192-critical-connections-in-a-network/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1192-critical-connections-in-a-network/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1192-critical-connections-in-a-network/README.md -------------------------------------------------------------------------------- /120-triangle/120-triangle.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/120-triangle/120-triangle.cpp -------------------------------------------------------------------------------- /120-triangle/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /120-triangle/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/120-triangle/README.md -------------------------------------------------------------------------------- /1202-smallest-string-with-swaps/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1202-smallest-string-with-swaps/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1202-smallest-string-with-swaps/README.md -------------------------------------------------------------------------------- /1209-remove-all-adjacent-duplicates-in-string-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /121-best-time-to-buy-and-sell-stock/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/121-best-time-to-buy-and-sell-stock/README.md -------------------------------------------------------------------------------- /1221-split-a-string-in-balanced-strings/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1221-split-a-string-in-balanced-strings/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1221-split-a-string-in-balanced-strings/README.md -------------------------------------------------------------------------------- /124-binary-tree-maximum-path-sum/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/124-binary-tree-maximum-path-sum/README.md -------------------------------------------------------------------------------- /1249-minimum-remove-to-make-valid-parentheses/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1249-minimum-remove-to-make-valid-parentheses/README.md -------------------------------------------------------------------------------- /1260-shift-2d-grid/1260-shift-2d-grid.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1260-shift-2d-grid/1260-shift-2d-grid.cpp -------------------------------------------------------------------------------- /1260-shift-2d-grid/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1260-shift-2d-grid/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1260-shift-2d-grid/README.md -------------------------------------------------------------------------------- /1261-find-elements-in-a-contaminated-binary-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1268-search-suggestions-system/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1268-search-suggestions-system/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1268-search-suggestions-system/README.md -------------------------------------------------------------------------------- /127-word-ladder/127-word-ladder.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/127-word-ladder/127-word-ladder.cpp -------------------------------------------------------------------------------- /127-word-ladder/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /127-word-ladder/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/127-word-ladder/README.md -------------------------------------------------------------------------------- /128-longest-consecutive-sequence/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /128-longest-consecutive-sequence/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/128-longest-consecutive-sequence/README.md -------------------------------------------------------------------------------- /1288-remove-covered-intervals/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1288-remove-covered-intervals/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1288-remove-covered-intervals/README.md -------------------------------------------------------------------------------- /1290-convert-binary-number-in-a-linked-list-to-integer/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1291-sequential-digits/1291-sequential-digits.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1291-sequential-digits/1291-sequential-digits.cpp -------------------------------------------------------------------------------- /1291-sequential-digits/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1291-sequential-digits/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1291-sequential-digits/README.md -------------------------------------------------------------------------------- /1302-deepest-leaves-sum/1302-deepest-leaves-sum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1302-deepest-leaves-sum/1302-deepest-leaves-sum.cpp -------------------------------------------------------------------------------- /1302-deepest-leaves-sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1302-deepest-leaves-sum/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1302-deepest-leaves-sum/README.md -------------------------------------------------------------------------------- /1305-all-elements-in-two-binary-search-trees/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1305-all-elements-in-two-binary-search-trees/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1305-all-elements-in-two-binary-search-trees/README.md -------------------------------------------------------------------------------- /1325-delete-leaves-with-a-given-value/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1325-delete-leaves-with-a-given-value/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1325-delete-leaves-with-a-given-value/README.md -------------------------------------------------------------------------------- /133-clone-graph/133-clone-graph.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/133-clone-graph/133-clone-graph.cpp -------------------------------------------------------------------------------- /133-clone-graph/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/133-clone-graph/README.md -------------------------------------------------------------------------------- /1332-remove-palindromic-subsequences/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1332-remove-palindromic-subsequences/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1332-remove-palindromic-subsequences/README.md -------------------------------------------------------------------------------- /1337-the-k-weakest-rows-in-a-matrix/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1337-the-k-weakest-rows-in-a-matrix/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1337-the-k-weakest-rows-in-a-matrix/README.md -------------------------------------------------------------------------------- /134-gas-station/134-gas-station.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/134-gas-station/134-gas-station.cpp -------------------------------------------------------------------------------- /134-gas-station/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /134-gas-station/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/134-gas-station/README.md -------------------------------------------------------------------------------- /1354-construct-target-array-with-multiple-sums/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1354-construct-target-array-with-multiple-sums/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1354-construct-target-array-with-multiple-sums/README.md -------------------------------------------------------------------------------- /1359-count-all-valid-pickup-and-delivery-options/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /136-single-number/136-single-number.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/136-single-number/136-single-number.cpp -------------------------------------------------------------------------------- /136-single-number/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /136-single-number/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/136-single-number/README.md -------------------------------------------------------------------------------- /1370-increasing-decreasing-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1370-increasing-decreasing-string/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1370-increasing-decreasing-string/README.md -------------------------------------------------------------------------------- /1379-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /138-copy-list-with-random-pointer/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /138-copy-list-with-random-pointer/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/138-copy-list-with-random-pointer/README.md -------------------------------------------------------------------------------- /1396-design-underground-system/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1396-design-underground-system/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1396-design-underground-system/README.md -------------------------------------------------------------------------------- /1413-minimum-value-to-get-positive-step-by-step-sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /142-linked-list-cycle-ii/142-linked-list-cycle-ii.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/142-linked-list-cycle-ii/142-linked-list-cycle-ii.cpp -------------------------------------------------------------------------------- /142-linked-list-cycle-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /142-linked-list-cycle-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/142-linked-list-cycle-ii/README.md -------------------------------------------------------------------------------- /1441-build-an-array-with-stack-operations/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1441-build-an-array-with-stack-operations/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1441-build-an-array-with-stack-operations/README.md -------------------------------------------------------------------------------- /1457-pseudo-palindromic-paths-in-a-binary-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1457-pseudo-palindromic-paths-in-a-binary-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1457-pseudo-palindromic-paths-in-a-binary-tree/README.md -------------------------------------------------------------------------------- /1461-check-if-a-string-contains-all-binary-codes-of-size-k/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1465-maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /148-sort-list/148-sort-list.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/148-sort-list/148-sort-list.cpp -------------------------------------------------------------------------------- /148-sort-list/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1480-running-sum-of-1d-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1480-running-sum-of-1d-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1480-running-sum-of-1d-array/README.md -------------------------------------------------------------------------------- /1487-making-file-names-unique/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1487-making-file-names-unique/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1487-making-file-names-unique/README.md -------------------------------------------------------------------------------- /15-3sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /15-3sum/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/15-3sum/README.md -------------------------------------------------------------------------------- /1502-can-make-arithmetic-progression-from-sequence/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /152-maximum-product-subarray/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /152-maximum-product-subarray/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/152-maximum-product-subarray/README.md -------------------------------------------------------------------------------- /153-find-minimum-in-rotated-sorted-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /153-find-minimum-in-rotated-sorted-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/153-find-minimum-in-rotated-sorted-array/README.md -------------------------------------------------------------------------------- /155-min-stack/155-min-stack.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/155-min-stack/155-min-stack.cpp -------------------------------------------------------------------------------- /155-min-stack/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /155-min-stack/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/155-min-stack/README.md -------------------------------------------------------------------------------- /1561-maximum-number-of-coins-you-can-get/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1561-maximum-number-of-coins-you-can-get/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1561-maximum-number-of-coins-you-can-get/README.md -------------------------------------------------------------------------------- /1584-min-cost-to-connect-all-points/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1584-min-cost-to-connect-all-points/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1584-min-cost-to-connect-all-points/README.md -------------------------------------------------------------------------------- /160-intersection-of-two-linked-lists/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /160-intersection-of-two-linked-lists/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/160-intersection-of-two-linked-lists/README.md -------------------------------------------------------------------------------- /1630-arithmetic-subarrays/1630-arithmetic-subarrays.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1630-arithmetic-subarrays/1630-arithmetic-subarrays.cpp -------------------------------------------------------------------------------- /1630-arithmetic-subarrays/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1630-arithmetic-subarrays/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1630-arithmetic-subarrays/README.md -------------------------------------------------------------------------------- /1631-path-with-minimum-effort/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1631-path-with-minimum-effort/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1631-path-with-minimum-effort/README.md -------------------------------------------------------------------------------- /1641-count-sorted-vowel-strings/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1641-count-sorted-vowel-strings/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1641-count-sorted-vowel-strings/README.md -------------------------------------------------------------------------------- /1642-furthest-building-you-can-reach/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1642-furthest-building-you-can-reach/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1642-furthest-building-you-can-reach/README.md -------------------------------------------------------------------------------- /1647-minimum-deletions-to-make-character-frequencies-unique/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /165-compare-version-numbers/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /165-compare-version-numbers/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/165-compare-version-numbers/README.md -------------------------------------------------------------------------------- /1658-minimum-operations-to-reduce-x-to-zero/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1658-minimum-operations-to-reduce-x-to-zero/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1658-minimum-operations-to-reduce-x-to-zero/README.md -------------------------------------------------------------------------------- /1663-smallest-string-with-a-given-numeric-value/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1669-merge-in-between-linked-lists/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1669-merge-in-between-linked-lists/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1669-merge-in-between-linked-lists/README.md -------------------------------------------------------------------------------- /167-two-sum-ii-input-array-is-sorted/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /167-two-sum-ii-input-array-is-sorted/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/167-two-sum-ii-input-array-is-sorted/README.md -------------------------------------------------------------------------------- /1672-richest-customer-wealth/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1672-richest-customer-wealth/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1672-richest-customer-wealth/README.md -------------------------------------------------------------------------------- /1675-minimize-deviation-in-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1675-minimize-deviation-in-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1675-minimize-deviation-in-array/README.md -------------------------------------------------------------------------------- /1678-goal-parser-interpretation/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1678-goal-parser-interpretation/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1678-goal-parser-interpretation/README.md -------------------------------------------------------------------------------- /1679-max-number-of-k-sum-pairs/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1679-max-number-of-k-sum-pairs/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1679-max-number-of-k-sum-pairs/README.md -------------------------------------------------------------------------------- /168-excel-sheet-column-title/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/168-excel-sheet-column-title/README.md -------------------------------------------------------------------------------- /1684-count-the-number-of-consistent-strings/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1684-count-the-number-of-consistent-strings/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1684-count-the-number-of-consistent-strings/README.md -------------------------------------------------------------------------------- /1689-partitioning-into-minimum-number-of-deci-binary-numbers/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /169-majority-element/169-majority-element.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/169-majority-element/169-majority-element.cpp -------------------------------------------------------------------------------- /169-majority-element/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /169-majority-element/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/169-majority-element/README.md -------------------------------------------------------------------------------- /1695-maximum-erasure-value/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1695-maximum-erasure-value/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1695-maximum-erasure-value/README.md -------------------------------------------------------------------------------- /1696-jump-game-vi/1696-jump-game-vi.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1696-jump-game-vi/1696-jump-game-vi.cpp -------------------------------------------------------------------------------- /1696-jump-game-vi/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1696-jump-game-vi/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1696-jump-game-vi/README.md -------------------------------------------------------------------------------- /17-letter-combinations-of-a-phone-number/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /17-letter-combinations-of-a-phone-number/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/17-letter-combinations-of-a-phone-number/README.md -------------------------------------------------------------------------------- /171-excel-sheet-column-number/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /171-excel-sheet-column-number/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/171-excel-sheet-column-number/README.md -------------------------------------------------------------------------------- /1721-swapping-nodes-in-a-linked-list/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1721-swapping-nodes-in-a-linked-list/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1721-swapping-nodes-in-a-linked-list/README.md -------------------------------------------------------------------------------- /173-binary-search-tree-iterator/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /173-binary-search-tree-iterator/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/173-binary-search-tree-iterator/README.md -------------------------------------------------------------------------------- /1742-maximum-number-of-balls-in-a-box/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1742-maximum-number-of-balls-in-a-box/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1742-maximum-number-of-balls-in-a-box/README.md -------------------------------------------------------------------------------- /1812-determine-color-of-a-chessboard-square/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1812-determine-color-of-a-chessboard-square/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1812-determine-color-of-a-chessboard-square/README.md -------------------------------------------------------------------------------- /1814-count-nice-pairs-in-an-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1814-count-nice-pairs-in-an-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1814-count-nice-pairs-in-an-array/README.md -------------------------------------------------------------------------------- /1877-minimize-maximum-pair-sum-in-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1877-minimize-maximum-pair-sum-in-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1877-minimize-maximum-pair-sum-in-array/README.md -------------------------------------------------------------------------------- /189-rotate-array/189-rotate-array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/189-rotate-array/189-rotate-array.cpp -------------------------------------------------------------------------------- /189-rotate-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /189-rotate-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/189-rotate-array/README.md -------------------------------------------------------------------------------- /191-number-of-1-bits/191-number-of-1-bits.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/191-number-of-1-bits/191-number-of-1-bits.cpp -------------------------------------------------------------------------------- /191-number-of-1-bits/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /191-number-of-1-bits/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/191-number-of-1-bits/README.md -------------------------------------------------------------------------------- /198-house-robber/198-house-robber.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/198-house-robber/198-house-robber.cpp -------------------------------------------------------------------------------- /198-house-robber/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /198-house-robber/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/198-house-robber/README.md -------------------------------------------------------------------------------- /1984-minimum-difference-between-highest-and-lowest-of-k-scores/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1985-find-the-kth-largest-integer-in-the-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1985-find-the-kth-largest-integer-in-the-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/1985-find-the-kth-largest-integer-in-the-array/README.md -------------------------------------------------------------------------------- /20-valid-parentheses/20-valid-parentheses.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/20-valid-parentheses/20-valid-parentheses.cpp -------------------------------------------------------------------------------- /20-valid-parentheses/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /20-valid-parentheses/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/20-valid-parentheses/README.md -------------------------------------------------------------------------------- /2006-count-number-of-pairs-with-absolute-difference-k/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2037-minimum-number-of-moves-to-seat-everyone/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2037-minimum-number-of-moves-to-seat-everyone/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/2037-minimum-number-of-moves-to-seat-everyone/README.md -------------------------------------------------------------------------------- /2047-number-of-valid-words-in-a-sentence/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2047-number-of-valid-words-in-a-sentence/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/2047-number-of-valid-words-in-a-sentence/README.md -------------------------------------------------------------------------------- /205-isomorphic-strings/205-isomorphic-strings.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/205-isomorphic-strings/205-isomorphic-strings.cpp -------------------------------------------------------------------------------- /205-isomorphic-strings/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /205-isomorphic-strings/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/205-isomorphic-strings/README.md -------------------------------------------------------------------------------- /206-reverse-linked-list/206-reverse-linked-list.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/206-reverse-linked-list/206-reverse-linked-list.cpp -------------------------------------------------------------------------------- /206-reverse-linked-list/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /206-reverse-linked-list/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/206-reverse-linked-list/README.md -------------------------------------------------------------------------------- /2079-watering-plants/2079-watering-plants.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/2079-watering-plants/2079-watering-plants.cpp -------------------------------------------------------------------------------- /2079-watering-plants/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2079-watering-plants/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/2079-watering-plants/README.md -------------------------------------------------------------------------------- /209-minimum-size-subarray-sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /209-minimum-size-subarray-sum/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/209-minimum-size-subarray-sum/README.md -------------------------------------------------------------------------------- /2095-delete-the-middle-node-of-a-linked-list/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2095-delete-the-middle-node-of-a-linked-list/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/2095-delete-the-middle-node-of-a-linked-list/README.md -------------------------------------------------------------------------------- /21-merge-two-sorted-lists/21-merge-two-sorted-lists.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/21-merge-two-sorted-lists/21-merge-two-sorted-lists.cpp -------------------------------------------------------------------------------- /21-merge-two-sorted-lists/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /21-merge-two-sorted-lists/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/21-merge-two-sorted-lists/README.md -------------------------------------------------------------------------------- /2104-sum-of-subarray-ranges/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2104-sum-of-subarray-ranges/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/2104-sum-of-subarray-ranges/README.md -------------------------------------------------------------------------------- /211-design-add-and-search-words-data-structure/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /211-design-add-and-search-words-data-structure/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/211-design-add-and-search-words-data-structure/README.md -------------------------------------------------------------------------------- /2114-maximum-number-of-words-found-in-sentences/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2129-capitalize-the-title/2129-capitalize-the-title.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/2129-capitalize-the-title/2129-capitalize-the-title.cpp -------------------------------------------------------------------------------- /2129-capitalize-the-title/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2129-capitalize-the-title/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/2129-capitalize-the-title/README.md -------------------------------------------------------------------------------- /2130-maximum-twin-sum-of-a-linked-list/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2130-maximum-twin-sum-of-a-linked-list/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/2130-maximum-twin-sum-of-a-linked-list/README.md -------------------------------------------------------------------------------- /2138-divide-a-string-into-groups-of-size-k/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2138-divide-a-string-into-groups-of-size-k/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/2138-divide-a-string-into-groups-of-size-k/README.md -------------------------------------------------------------------------------- /2145-count-the-hidden-sequences/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2145-count-the-hidden-sequences/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/2145-count-the-hidden-sequences/README.md -------------------------------------------------------------------------------- /2148-count-elements-with-strictly-smaller-and-greater-elements/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /215-kth-largest-element-in-an-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /215-kth-largest-element-in-an-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/215-kth-largest-element-in-an-array/README.md -------------------------------------------------------------------------------- /2154-keep-multiplying-found-values-by-two/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2154-keep-multiplying-found-values-by-two/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/2154-keep-multiplying-found-values-by-two/README.md -------------------------------------------------------------------------------- /216-combination-sum-iii/216-combination-sum-iii.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/216-combination-sum-iii/216-combination-sum-iii.cpp -------------------------------------------------------------------------------- /216-combination-sum-iii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /216-combination-sum-iii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/216-combination-sum-iii/README.md -------------------------------------------------------------------------------- /2160-minimum-sum-of-four-digit-number-after-splitting-digits/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2162-minimum-cost-to-set-cooking-time/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2162-minimum-cost-to-set-cooking-time/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/2162-minimum-cost-to-set-cooking-time/README.md -------------------------------------------------------------------------------- /2164-sort-even-and-odd-indices-independently/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2164-sort-even-and-odd-indices-independently/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/2164-sort-even-and-odd-indices-independently/README.md -------------------------------------------------------------------------------- /2169-count-operations-to-obtain-zero/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2169-count-operations-to-obtain-zero/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/2169-count-operations-to-obtain-zero/README.md -------------------------------------------------------------------------------- /217-contains-duplicate/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /217-contains-duplicate/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/217-contains-duplicate/README.md -------------------------------------------------------------------------------- /2180-count-integers-with-even-digit-sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2180-count-integers-with-even-digit-sum/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/2180-count-integers-with-even-digit-sum/README.md -------------------------------------------------------------------------------- /2181-merge-nodes-in-between-zeros/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2181-merge-nodes-in-between-zeros/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/2181-merge-nodes-in-between-zeros/README.md -------------------------------------------------------------------------------- /2185-counting-words-with-a-given-prefix/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2185-counting-words-with-a-given-prefix/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/2185-counting-words-with-a-given-prefix/README.md -------------------------------------------------------------------------------- /225-implement-stack-using-queues/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /225-implement-stack-using-queues/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/225-implement-stack-using-queues/README.md -------------------------------------------------------------------------------- /226-invert-binary-tree/226-invert-binary-tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/226-invert-binary-tree/226-invert-binary-tree.cpp -------------------------------------------------------------------------------- /226-invert-binary-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /226-invert-binary-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/226-invert-binary-tree/README.md -------------------------------------------------------------------------------- /228-summary-ranges/228-summary-ranges.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/228-summary-ranges/228-summary-ranges.cpp -------------------------------------------------------------------------------- /228-summary-ranges/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /228-summary-ranges/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/228-summary-ranges/README.md -------------------------------------------------------------------------------- /229-majority-element-ii/229-majority-element-ii.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/229-majority-element-ii/229-majority-element-ii.cpp -------------------------------------------------------------------------------- /229-majority-element-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /229-majority-element-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/229-majority-element-ii/README.md -------------------------------------------------------------------------------- /23-merge-k-sorted-lists/23-merge-k-sorted-lists.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/23-merge-k-sorted-lists/23-merge-k-sorted-lists.cpp -------------------------------------------------------------------------------- /23-merge-k-sorted-lists/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /23-merge-k-sorted-lists/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/23-merge-k-sorted-lists/README.md -------------------------------------------------------------------------------- /230-kth-smallest-element-in-a-bst/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /230-kth-smallest-element-in-a-bst/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/230-kth-smallest-element-in-a-bst/README.md -------------------------------------------------------------------------------- /237-delete-node-in-a-linked-list/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /237-delete-node-in-a-linked-list/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/237-delete-node-in-a-linked-list/README.md -------------------------------------------------------------------------------- /24-swap-nodes-in-pairs/24-swap-nodes-in-pairs.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/24-swap-nodes-in-pairs/24-swap-nodes-in-pairs.cpp -------------------------------------------------------------------------------- /24-swap-nodes-in-pairs/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /24-swap-nodes-in-pairs/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/24-swap-nodes-in-pairs/README.md -------------------------------------------------------------------------------- /258-add-digits/258-add-digits.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/258-add-digits/258-add-digits.cpp -------------------------------------------------------------------------------- /258-add-digits/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /258-add-digits/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/258-add-digits/README.md -------------------------------------------------------------------------------- /268-missing-number/268-missing-number.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/268-missing-number/268-missing-number.cpp -------------------------------------------------------------------------------- /268-missing-number/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /268-missing-number/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/268-missing-number/README.md -------------------------------------------------------------------------------- /284-peeking-iterator/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /284-peeking-iterator/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/284-peeking-iterator/README.md -------------------------------------------------------------------------------- /287-find-the-duplicate-number/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /289-game-of-life/289-game-of-life.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/289-game-of-life/289-game-of-life.cpp -------------------------------------------------------------------------------- /289-game-of-life/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /289-game-of-life/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/289-game-of-life/README.md -------------------------------------------------------------------------------- /29-divide-two-integers/29-divide-two-integers.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/29-divide-two-integers/29-divide-two-integers.cpp -------------------------------------------------------------------------------- /29-divide-two-integers/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /29-divide-two-integers/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/29-divide-two-integers/README.md -------------------------------------------------------------------------------- /290-word-pattern/290-word-pattern.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/290-word-pattern/290-word-pattern.cpp -------------------------------------------------------------------------------- /290-word-pattern/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /290-word-pattern/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/290-word-pattern/README.md -------------------------------------------------------------------------------- /3-longest-substring-without-repeating-characters/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /304-range-sum-query-2d-immutable/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /304-range-sum-query-2d-immutable/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/304-range-sum-query-2d-immutable/README.md -------------------------------------------------------------------------------- /31-next-permutation/31-next-permutation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/31-next-permutation/31-next-permutation.cpp -------------------------------------------------------------------------------- /31-next-permutation/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /31-next-permutation/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/31-next-permutation/README.md -------------------------------------------------------------------------------- /316-remove-duplicate-letters/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /316-remove-duplicate-letters/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/316-remove-duplicate-letters/README.md -------------------------------------------------------------------------------- /318-maximum-product-of-word-lengths/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /318-maximum-product-of-word-lengths/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/318-maximum-product-of-word-lengths/README.md -------------------------------------------------------------------------------- /32-longest-valid-parentheses/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /32-longest-valid-parentheses/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/32-longest-valid-parentheses/README.md -------------------------------------------------------------------------------- /322-coin-change/322-coin-change.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/322-coin-change/322-coin-change.cpp -------------------------------------------------------------------------------- /322-coin-change/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /322-coin-change/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/322-coin-change/README.md -------------------------------------------------------------------------------- /328-odd-even-linked-list/328-odd-even-linked-list.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/328-odd-even-linked-list/328-odd-even-linked-list.cpp -------------------------------------------------------------------------------- /328-odd-even-linked-list/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /328-odd-even-linked-list/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/328-odd-even-linked-list/README.md -------------------------------------------------------------------------------- /329-longest-increasing-path-in-a-matrix/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/329-longest-increasing-path-in-a-matrix/README.md -------------------------------------------------------------------------------- /338-counting-bits/338-counting-bits.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/338-counting-bits/338-counting-bits.cpp -------------------------------------------------------------------------------- /338-counting-bits/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /338-counting-bits/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/338-counting-bits/README.md -------------------------------------------------------------------------------- /341-flatten-nested-list-iterator/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /341-flatten-nested-list-iterator/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/341-flatten-nested-list-iterator/README.md -------------------------------------------------------------------------------- /344-reverse-string/344-reverse-string.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/344-reverse-string/344-reverse-string.cpp -------------------------------------------------------------------------------- /344-reverse-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /344-reverse-string/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/344-reverse-string/README.md -------------------------------------------------------------------------------- /345-reverse-vowels-of-a-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /345-reverse-vowels-of-a-string/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/345-reverse-vowels-of-a-string/README.md -------------------------------------------------------------------------------- /347-top-k-frequent-elements/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /354-russian-doll-envelopes/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /354-russian-doll-envelopes/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/354-russian-doll-envelopes/README.md -------------------------------------------------------------------------------- /371-sum-of-two-integers/371-sum-of-two-integers.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/371-sum-of-two-integers/371-sum-of-two-integers.cpp -------------------------------------------------------------------------------- /371-sum-of-two-integers/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /371-sum-of-two-integers/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/371-sum-of-two-integers/README.md -------------------------------------------------------------------------------- /382-linked-list-random-node/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /382-linked-list-random-node/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/382-linked-list-random-node/README.md -------------------------------------------------------------------------------- /39-combination-sum/39-combination-sum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/39-combination-sum/39-combination-sum.cpp -------------------------------------------------------------------------------- /39-combination-sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /39-combination-sum/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/39-combination-sum/README.md -------------------------------------------------------------------------------- /392-is-subsequence/392-is-subsequence.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/392-is-subsequence/392-is-subsequence.cpp -------------------------------------------------------------------------------- /392-is-subsequence/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /392-is-subsequence/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/392-is-subsequence/README.md -------------------------------------------------------------------------------- /399-evaluate-division/399-evaluate-division.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/399-evaluate-division/399-evaluate-division.cpp -------------------------------------------------------------------------------- /399-evaluate-division/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /399-evaluate-division/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/399-evaluate-division/README.md -------------------------------------------------------------------------------- /402-remove-k-digits/402-remove-k-digits.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/402-remove-k-digits/402-remove-k-digits.cpp -------------------------------------------------------------------------------- /402-remove-k-digits/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /402-remove-k-digits/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/402-remove-k-digits/README.md -------------------------------------------------------------------------------- /406-queue-reconstruction-by-height/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /406-queue-reconstruction-by-height/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/406-queue-reconstruction-by-height/README.md -------------------------------------------------------------------------------- /410-split-array-largest-sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /410-split-array-largest-sum/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/410-split-array-largest-sum/README.md -------------------------------------------------------------------------------- /413-arithmetic-slices/413-arithmetic-slices.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/413-arithmetic-slices/413-arithmetic-slices.cpp -------------------------------------------------------------------------------- /413-arithmetic-slices/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /413-arithmetic-slices/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/413-arithmetic-slices/README.md -------------------------------------------------------------------------------- /421-maximum-xor-of-two-numbers-in-an-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /421-maximum-xor-of-two-numbers-in-an-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/421-maximum-xor-of-two-numbers-in-an-array/README.md -------------------------------------------------------------------------------- /43-multiply-strings/43-multiply-strings.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/43-multiply-strings/43-multiply-strings.py -------------------------------------------------------------------------------- /43-multiply-strings/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /43-multiply-strings/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/43-multiply-strings/README.md -------------------------------------------------------------------------------- /438-find-all-anagrams-in-a-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /438-find-all-anagrams-in-a-string/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/438-find-all-anagrams-in-a-string/README.md -------------------------------------------------------------------------------- /445-add-two-numbers-ii/445-add-two-numbers-ii.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/445-add-two-numbers-ii/445-add-two-numbers-ii.cpp -------------------------------------------------------------------------------- /445-add-two-numbers-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /445-add-two-numbers-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/445-add-two-numbers-ii/README.md -------------------------------------------------------------------------------- /454-4sum-ii/454-4sum-ii.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/454-4sum-ii/454-4sum-ii.cpp -------------------------------------------------------------------------------- /454-4sum-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /454-4sum-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/454-4sum-ii/README.md -------------------------------------------------------------------------------- /456-132-pattern/456-132-pattern.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/456-132-pattern/456-132-pattern.cpp -------------------------------------------------------------------------------- /456-132-pattern/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /456-132-pattern/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/456-132-pattern/README.md -------------------------------------------------------------------------------- /47-permutations-ii/47-permutations-ii.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/47-permutations-ii/47-permutations-ii.cpp -------------------------------------------------------------------------------- /47-permutations-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /47-permutations-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/47-permutations-ii/README.md -------------------------------------------------------------------------------- /474-ones-and-zeroes/474-ones-and-zeroes.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/474-ones-and-zeroes/474-ones-and-zeroes.cpp -------------------------------------------------------------------------------- /474-ones-and-zeroes/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /474-ones-and-zeroes/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/474-ones-and-zeroes/README.md -------------------------------------------------------------------------------- /496-next-greater-element-i/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /5-longest-palindromic-substring/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /5-longest-palindromic-substring/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/5-longest-palindromic-substring/README.md -------------------------------------------------------------------------------- /503-next-greater-element-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /504-base-7/504-base-7.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/504-base-7/504-base-7.cpp -------------------------------------------------------------------------------- /504-base-7/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /504-base-7/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/504-base-7/README.md -------------------------------------------------------------------------------- /509-fibonacci-number/509-fibonacci-number.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/509-fibonacci-number/509-fibonacci-number.cpp -------------------------------------------------------------------------------- /509-fibonacci-number/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /509-fibonacci-number/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/509-fibonacci-number/README.md -------------------------------------------------------------------------------- /51-n-queens/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /51-n-queens/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/51-n-queens/README.md -------------------------------------------------------------------------------- /513-find-bottom-left-tree-value/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /513-find-bottom-left-tree-value/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/513-find-bottom-left-tree-value/README.md -------------------------------------------------------------------------------- /52-n-queens-ii/52-n-queens-ii.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/52-n-queens-ii/52-n-queens-ii.cpp -------------------------------------------------------------------------------- /52-n-queens-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /52-n-queens-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/52-n-queens-ii/README.md -------------------------------------------------------------------------------- /520-detect-capital/520-detect-capital.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/520-detect-capital/520-detect-capital.cpp -------------------------------------------------------------------------------- /520-detect-capital/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /520-detect-capital/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/520-detect-capital/README.md -------------------------------------------------------------------------------- /525-contiguous-array/525-contiguous-array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/525-contiguous-array/525-contiguous-array.cpp -------------------------------------------------------------------------------- /525-contiguous-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /525-contiguous-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/525-contiguous-array/README.md -------------------------------------------------------------------------------- /53-maximum-subarray/53-maximum-subarray.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/53-maximum-subarray/53-maximum-subarray.cpp -------------------------------------------------------------------------------- /53-maximum-subarray/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /53-maximum-subarray/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/53-maximum-subarray/README.md -------------------------------------------------------------------------------- /532-k-diff-pairs-in-an-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/532-k-diff-pairs-in-an-array/README.md -------------------------------------------------------------------------------- /535-encode-and-decode-tinyurl/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /535-encode-and-decode-tinyurl/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/535-encode-and-decode-tinyurl/README.md -------------------------------------------------------------------------------- /538-convert-bst-to-greater-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /538-convert-bst-to-greater-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/538-convert-bst-to-greater-tree/README.md -------------------------------------------------------------------------------- /556-next-greater-element-iii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /556-next-greater-element-iii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/556-next-greater-element-iii/README.md -------------------------------------------------------------------------------- /560-subarray-sum-equals-k/560-subarray-sum-equals-k.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/560-subarray-sum-equals-k/560-subarray-sum-equals-k.cpp -------------------------------------------------------------------------------- /560-subarray-sum-equals-k/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /560-subarray-sum-equals-k/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/560-subarray-sum-equals-k/README.md -------------------------------------------------------------------------------- /561-array-partition-i/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /561-array-partition-i/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/561-array-partition-i/README.md -------------------------------------------------------------------------------- /567-permutation-in-string/567-permutation-in-string.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/567-permutation-in-string/567-permutation-in-string.cpp -------------------------------------------------------------------------------- /567-permutation-in-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /567-permutation-in-string/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/567-permutation-in-string/README.md -------------------------------------------------------------------------------- /572-subtree-of-another-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /572-subtree-of-another-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/572-subtree-of-another-tree/README.md -------------------------------------------------------------------------------- /576-out-of-boundary-paths/576-out-of-boundary-paths.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/576-out-of-boundary-paths/576-out-of-boundary-paths.cpp -------------------------------------------------------------------------------- /576-out-of-boundary-paths/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /576-out-of-boundary-paths/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/576-out-of-boundary-paths/README.md -------------------------------------------------------------------------------- /581-shortest-unsorted-continuous-subarray/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /581-shortest-unsorted-continuous-subarray/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/581-shortest-unsorted-continuous-subarray/README.md -------------------------------------------------------------------------------- /583-delete-operation-for-two-strings/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /583-delete-operation-for-two-strings/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/583-delete-operation-for-two-strings/README.md -------------------------------------------------------------------------------- /59-spiral-matrix-ii/59-spiral-matrix-ii.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/59-spiral-matrix-ii/59-spiral-matrix-ii.cpp -------------------------------------------------------------------------------- /59-spiral-matrix-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /59-spiral-matrix-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/59-spiral-matrix-ii/README.md -------------------------------------------------------------------------------- /605-can-place-flowers/605-can-place-flowers.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/605-can-place-flowers/605-can-place-flowers.cpp -------------------------------------------------------------------------------- /605-can-place-flowers/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /605-can-place-flowers/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/605-can-place-flowers/README.md -------------------------------------------------------------------------------- /63-unique-paths-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /63-unique-paths-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/63-unique-paths-ii/README.md -------------------------------------------------------------------------------- /630-course-schedule-iii/630-course-schedule-iii.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/630-course-schedule-iii/630-course-schedule-iii.cpp -------------------------------------------------------------------------------- /630-course-schedule-iii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /630-course-schedule-iii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/630-course-schedule-iii/README.md -------------------------------------------------------------------------------- /647-palindromic-substrings/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /647-palindromic-substrings/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/647-palindromic-substrings/README.md -------------------------------------------------------------------------------- /654-maximum-binary-tree/654-maximum-binary-tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/654-maximum-binary-tree/654-maximum-binary-tree.cpp -------------------------------------------------------------------------------- /654-maximum-binary-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /654-maximum-binary-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/654-maximum-binary-tree/README.md -------------------------------------------------------------------------------- /662-maximum-width-of-binary-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /662-maximum-width-of-binary-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/662-maximum-width-of-binary-tree/README.md -------------------------------------------------------------------------------- /665-non-decreasing-array/665-non-decreasing-array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/665-non-decreasing-array/665-non-decreasing-array.cpp -------------------------------------------------------------------------------- /665-non-decreasing-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /665-non-decreasing-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/665-non-decreasing-array/README.md -------------------------------------------------------------------------------- /669-trim-a-binary-search-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /669-trim-a-binary-search-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/669-trim-a-binary-search-tree/README.md -------------------------------------------------------------------------------- /67-add-binary/67-add-binary.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/67-add-binary/67-add-binary.cpp -------------------------------------------------------------------------------- /67-add-binary/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /67-add-binary/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/67-add-binary/README.md -------------------------------------------------------------------------------- /680-valid-palindrome-ii/680-valid-palindrome-ii.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/680-valid-palindrome-ii/680-valid-palindrome-ii.cpp -------------------------------------------------------------------------------- /680-valid-palindrome-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/680-valid-palindrome-ii/README.md -------------------------------------------------------------------------------- /682-baseball-game/682-baseball-game.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/682-baseball-game/682-baseball-game.cpp -------------------------------------------------------------------------------- /682-baseball-game/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /682-baseball-game/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/682-baseball-game/README.md -------------------------------------------------------------------------------- /695-max-area-of-island/695-max-area-of-island.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/695-max-area-of-island/695-max-area-of-island.cpp -------------------------------------------------------------------------------- /695-max-area-of-island/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /695-max-area-of-island/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/695-max-area-of-island/README.md -------------------------------------------------------------------------------- /700-search-in-a-binary-search-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /700-search-in-a-binary-search-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/700-search-in-a-binary-search-tree/README.md -------------------------------------------------------------------------------- /701-insert-into-a-binary-search-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /701-insert-into-a-binary-search-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/701-insert-into-a-binary-search-tree/README.md -------------------------------------------------------------------------------- /703-kth-largest-element-in-a-stream/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /703-kth-largest-element-in-a-stream/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/703-kth-largest-element-in-a-stream/README.md -------------------------------------------------------------------------------- /704-binary-search/704-binary-search.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/704-binary-search/704-binary-search.cpp -------------------------------------------------------------------------------- /704-binary-search/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/704-binary-search/README.md -------------------------------------------------------------------------------- /705-design-hashset/705-design-hashset.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/705-design-hashset/705-design-hashset.cpp -------------------------------------------------------------------------------- /705-design-hashset/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /705-design-hashset/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/705-design-hashset/README.md -------------------------------------------------------------------------------- /706-design-hashmap/706-design-hashmap.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/706-design-hashmap/706-design-hashmap.cpp -------------------------------------------------------------------------------- /706-design-hashmap/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /706-design-hashmap/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/706-design-hashmap/README.md -------------------------------------------------------------------------------- /707-design-linked-list/707-design-linked-list.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/707-design-linked-list/707-design-linked-list.cpp -------------------------------------------------------------------------------- /707-design-linked-list/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /707-design-linked-list/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/707-design-linked-list/README.md -------------------------------------------------------------------------------- /709-to-lower-case/709-to-lower-case.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/709-to-lower-case/709-to-lower-case.cpp -------------------------------------------------------------------------------- /709-to-lower-case/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /709-to-lower-case/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/709-to-lower-case/README.md -------------------------------------------------------------------------------- /71-simplify-path/71-simplify-path.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/71-simplify-path/71-simplify-path.cpp -------------------------------------------------------------------------------- /71-simplify-path/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /71-simplify-path/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/71-simplify-path/README.md -------------------------------------------------------------------------------- /74-search-a-2d-matrix/74-search-a-2d-matrix.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/74-search-a-2d-matrix/74-search-a-2d-matrix.cpp -------------------------------------------------------------------------------- /74-search-a-2d-matrix/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /74-search-a-2d-matrix/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/74-search-a-2d-matrix/README.md -------------------------------------------------------------------------------- /740-delete-and-earn/740-delete-and-earn.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/740-delete-and-earn/740-delete-and-earn.cpp -------------------------------------------------------------------------------- /740-delete-and-earn/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /740-delete-and-earn/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/740-delete-and-earn/README.md -------------------------------------------------------------------------------- /743-network-delay-time/743-network-delay-time.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/743-network-delay-time/743-network-delay-time.cpp -------------------------------------------------------------------------------- /743-network-delay-time/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /743-network-delay-time/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/743-network-delay-time/README.md -------------------------------------------------------------------------------- /744-find-smallest-letter-greater-than-target/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /745-prefix-and-suffix-search/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /745-prefix-and-suffix-search/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/745-prefix-and-suffix-search/README.md -------------------------------------------------------------------------------- /747-largest-number-at-least-twice-of-others/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/747-largest-number-at-least-twice-of-others/README.md -------------------------------------------------------------------------------- /75-sort-colors/75-sort-colors.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/75-sort-colors/75-sort-colors.cpp -------------------------------------------------------------------------------- /75-sort-colors/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /75-sort-colors/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/75-sort-colors/README.md -------------------------------------------------------------------------------- /763-partition-labels/763-partition-labels.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/763-partition-labels/763-partition-labels.cpp -------------------------------------------------------------------------------- /763-partition-labels/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /763-partition-labels/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/763-partition-labels/README.md -------------------------------------------------------------------------------- /771-jewels-and-stones/771-jewels-and-stones.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/771-jewels-and-stones/771-jewels-and-stones.cpp -------------------------------------------------------------------------------- /771-jewels-and-stones/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /771-jewels-and-stones/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/771-jewels-and-stones/README.md -------------------------------------------------------------------------------- /78-subsets/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /78-subsets/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/78-subsets/README.md -------------------------------------------------------------------------------- /785-is-graph-bipartite/785-is-graph-bipartite.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/785-is-graph-bipartite/785-is-graph-bipartite.cpp -------------------------------------------------------------------------------- /785-is-graph-bipartite/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /785-is-graph-bipartite/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/785-is-graph-bipartite/README.md -------------------------------------------------------------------------------- /792-number-of-matching-subsequences/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /792-number-of-matching-subsequences/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/792-number-of-matching-subsequences/README.md -------------------------------------------------------------------------------- /799-champagne-tower/799-champagne-tower.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/799-champagne-tower/799-champagne-tower.cpp -------------------------------------------------------------------------------- /799-champagne-tower/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /799-champagne-tower/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/799-champagne-tower/README.md -------------------------------------------------------------------------------- /80-remove-duplicates-from-sorted-array-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /80-remove-duplicates-from-sorted-array-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/80-remove-duplicates-from-sorted-array-ii/README.md -------------------------------------------------------------------------------- /81-search-in-rotated-sorted-array-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /81-search-in-rotated-sorted-array-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/81-search-in-rotated-sorted-array-ii/README.md -------------------------------------------------------------------------------- /814-binary-tree-pruning/814-binary-tree-pruning.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/814-binary-tree-pruning/814-binary-tree-pruning.cpp -------------------------------------------------------------------------------- /814-binary-tree-pruning/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /814-binary-tree-pruning/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/814-binary-tree-pruning/README.md -------------------------------------------------------------------------------- /82-remove-duplicates-from-sorted-list-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /82-remove-duplicates-from-sorted-list-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/82-remove-duplicates-from-sorted-list-ii/README.md -------------------------------------------------------------------------------- /820-short-encoding-of-words/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /820-short-encoding-of-words/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/820-short-encoding-of-words/README.md -------------------------------------------------------------------------------- /844-backspace-string-compare/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /844-backspace-string-compare/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/844-backspace-string-compare/README.md -------------------------------------------------------------------------------- /847-shortest-path-visiting-all-nodes/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/847-shortest-path-visiting-all-nodes/README.md -------------------------------------------------------------------------------- /856-score-of-parentheses/856-score-of-parentheses.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/856-score-of-parentheses/856-score-of-parentheses.cpp -------------------------------------------------------------------------------- /856-score-of-parentheses/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /856-score-of-parentheses/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/856-score-of-parentheses/README.md -------------------------------------------------------------------------------- /86-partition-list/86-partition-list.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/86-partition-list/86-partition-list.cpp -------------------------------------------------------------------------------- /86-partition-list/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /86-partition-list/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/86-partition-list/README.md -------------------------------------------------------------------------------- /867-transpose-matrix/867-transpose-matrix.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/867-transpose-matrix/867-transpose-matrix.cpp -------------------------------------------------------------------------------- /867-transpose-matrix/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /867-transpose-matrix/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/867-transpose-matrix/README.md -------------------------------------------------------------------------------- /875-koko-eating-bananas/875-koko-eating-bananas.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/875-koko-eating-bananas/875-koko-eating-bananas.cpp -------------------------------------------------------------------------------- /875-koko-eating-bananas/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /875-koko-eating-bananas/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/875-koko-eating-bananas/README.md -------------------------------------------------------------------------------- /876-middle-of-the-linked-list/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /876-middle-of-the-linked-list/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/876-middle-of-the-linked-list/README.md -------------------------------------------------------------------------------- /88-merge-sorted-array/88-merge-sorted-array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/88-merge-sorted-array/88-merge-sorted-array.cpp -------------------------------------------------------------------------------- /88-merge-sorted-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /88-merge-sorted-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/88-merge-sorted-array/README.md -------------------------------------------------------------------------------- /881-boats-to-save-people/881-boats-to-save-people.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/881-boats-to-save-people/881-boats-to-save-people.cpp -------------------------------------------------------------------------------- /881-boats-to-save-people/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /881-boats-to-save-people/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/881-boats-to-save-people/README.md -------------------------------------------------------------------------------- /886-possible-bipartition/886-possible-bipartition.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/886-possible-bipartition/886-possible-bipartition.cpp -------------------------------------------------------------------------------- /886-possible-bipartition/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /886-possible-bipartition/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/886-possible-bipartition/README.md -------------------------------------------------------------------------------- /895-maximum-frequency-stack/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /895-maximum-frequency-stack/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/895-maximum-frequency-stack/README.md -------------------------------------------------------------------------------- /896-monotonic-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /896-monotonic-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/896-monotonic-array/README.md -------------------------------------------------------------------------------- /897-increasing-order-search-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /897-increasing-order-search-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/897-increasing-order-search-tree/README.md -------------------------------------------------------------------------------- /905-sort-array-by-parity/905-sort-array-by-parity.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/905-sort-array-by-parity/905-sort-array-by-parity.cpp -------------------------------------------------------------------------------- /905-sort-array-by-parity/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /905-sort-array-by-parity/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/905-sort-array-by-parity/README.md -------------------------------------------------------------------------------- /923-3sum-with-multiplicity/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /923-3sum-with-multiplicity/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/923-3sum-with-multiplicity/README.md -------------------------------------------------------------------------------- /94-binary-tree-inorder-traversal/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /94-binary-tree-inorder-traversal/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/94-binary-tree-inorder-traversal/README.md -------------------------------------------------------------------------------- /941-valid-mountain-array/941-valid-mountain-array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/941-valid-mountain-array/941-valid-mountain-array.cpp -------------------------------------------------------------------------------- /941-valid-mountain-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /941-valid-mountain-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/941-valid-mountain-array/README.md -------------------------------------------------------------------------------- /946-validate-stack-sequences/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/946-validate-stack-sequences/README.md -------------------------------------------------------------------------------- /965-univalued-binary-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /965-univalued-binary-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/965-univalued-binary-tree/README.md -------------------------------------------------------------------------------- /968-binary-tree-cameras/968-binary-tree-cameras.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/968-binary-tree-cameras/968-binary-tree-cameras.cpp -------------------------------------------------------------------------------- /968-binary-tree-cameras/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /968-binary-tree-cameras/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/968-binary-tree-cameras/README.md -------------------------------------------------------------------------------- /97-interleaving-string/97-interleaving-string.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/97-interleaving-string/97-interleaving-string.cpp -------------------------------------------------------------------------------- /97-interleaving-string/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/97-interleaving-string/README.md -------------------------------------------------------------------------------- /971-flip-binary-tree-to-match-preorder-traversal/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /979-distribute-coins-in-binary-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /979-distribute-coins-in-binary-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/979-distribute-coins-in-binary-tree/README.md -------------------------------------------------------------------------------- /99-recover-binary-search-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /99-recover-binary-search-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/99-recover-binary-search-tree/README.md -------------------------------------------------------------------------------- /991-broken-calculator/991-broken-calculator.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/991-broken-calculator/991-broken-calculator.cpp -------------------------------------------------------------------------------- /991-broken-calculator/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /991-broken-calculator/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/991-broken-calculator/README.md -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/README.md -------------------------------------------------------------------------------- /add-digits/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/add-digits/README.md -------------------------------------------------------------------------------- /add-digits/add-digits.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/add-digits/add-digits.cpp -------------------------------------------------------------------------------- /add-strings/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/add-strings/README.md -------------------------------------------------------------------------------- /add-strings/add-strings.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/add-strings/add-strings.cpp -------------------------------------------------------------------------------- /add-two-numbers-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/add-two-numbers-ii/README.md -------------------------------------------------------------------------------- /add-two-numbers-ii/add-two-numbers-ii.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/add-two-numbers-ii/add-two-numbers-ii.cpp -------------------------------------------------------------------------------- /add-two-numbers/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/add-two-numbers/README.md -------------------------------------------------------------------------------- /add-two-numbers/add-two-numbers.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/add-two-numbers/add-two-numbers.cpp -------------------------------------------------------------------------------- /adding-spaces-to-a-string/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/adding-spaces-to-a-string/README.md -------------------------------------------------------------------------------- /all-elements-in-two-binary-search-trees/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/all-elements-in-two-binary-search-trees/README.md -------------------------------------------------------------------------------- /all-nodes-distance-k-in-binary-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/all-nodes-distance-k-in-binary-tree/README.md -------------------------------------------------------------------------------- /balance-a-binary-search-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/balance-a-binary-search-tree/README.md -------------------------------------------------------------------------------- /balanced-binary-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/balanced-binary-tree/README.md -------------------------------------------------------------------------------- /balanced-binary-tree/balanced-binary-tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/balanced-binary-tree/balanced-binary-tree.cpp -------------------------------------------------------------------------------- /baseball-game/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/baseball-game/README.md -------------------------------------------------------------------------------- /baseball-game/baseball-game.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/baseball-game/baseball-game.cpp -------------------------------------------------------------------------------- /best-time-to-buy-and-sell-stock-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/best-time-to-buy-and-sell-stock-ii/README.md -------------------------------------------------------------------------------- /best-time-to-buy-and-sell-stock/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/best-time-to-buy-and-sell-stock/README.md -------------------------------------------------------------------------------- /binary-search-tree-to-greater-sum-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/binary-search-tree-to-greater-sum-tree/README.md -------------------------------------------------------------------------------- /binary-search/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/binary-search/README.md -------------------------------------------------------------------------------- /binary-search/binary-search.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/binary-search/binary-search.cpp -------------------------------------------------------------------------------- /binary-tree-inorder-traversal/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/binary-tree-inorder-traversal/README.md -------------------------------------------------------------------------------- /binary-tree-level-order-traversal-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/binary-tree-level-order-traversal-ii/README.md -------------------------------------------------------------------------------- /binary-tree-level-order-traversal/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/binary-tree-level-order-traversal/README.md -------------------------------------------------------------------------------- /binary-tree-paths/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/binary-tree-paths/README.md -------------------------------------------------------------------------------- /binary-tree-paths/binary-tree-paths.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/binary-tree-paths/binary-tree-paths.cpp -------------------------------------------------------------------------------- /binary-tree-postorder-traversal/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/binary-tree-postorder-traversal/README.md -------------------------------------------------------------------------------- /binary-tree-preorder-traversal/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/binary-tree-preorder-traversal/README.md -------------------------------------------------------------------------------- /binary-tree-right-side-view/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/binary-tree-right-side-view/README.md -------------------------------------------------------------------------------- /binary-tree-zigzag-level-order-traversal/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/binary-tree-zigzag-level-order-traversal/README.md -------------------------------------------------------------------------------- /check-completeness-of-a-binary-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/check-completeness-of-a-binary-tree/README.md -------------------------------------------------------------------------------- /check-if-word-equals-summation-of-two-words/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/check-if-word-equals-summation-of-two-words/README.md -------------------------------------------------------------------------------- /coin-change-2/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/coin-change-2/README.md -------------------------------------------------------------------------------- /coin-change-2/coin-change-2.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/coin-change-2/coin-change-2.cpp -------------------------------------------------------------------------------- /coin-change/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/coin-change/README.md -------------------------------------------------------------------------------- /coin-change/coin-change.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/coin-change/coin-change.cpp -------------------------------------------------------------------------------- /complement-of-base-10-integer/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/complement-of-base-10-integer/README.md -------------------------------------------------------------------------------- /concatenation-of-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/concatenation-of-array/README.md -------------------------------------------------------------------------------- /concatenation-of-array/concatenation-of-array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/concatenation-of-array/concatenation-of-array.cpp -------------------------------------------------------------------------------- /consecutive-characters/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/consecutive-characters/README.md -------------------------------------------------------------------------------- /consecutive-characters/consecutive-characters.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/consecutive-characters/consecutive-characters.cpp -------------------------------------------------------------------------------- /contains-duplicate/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/contains-duplicate/README.md -------------------------------------------------------------------------------- /contains-duplicate/contains-duplicate.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/contains-duplicate/contains-duplicate.cpp -------------------------------------------------------------------------------- /convert-sorted-array-to-binary-search-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/convert-sorted-array-to-binary-search-tree/README.md -------------------------------------------------------------------------------- /convert-sorted-list-to-binary-search-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/convert-sorted-list-to-binary-search-tree/README.md -------------------------------------------------------------------------------- /copy-list-with-random-pointer/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/copy-list-with-random-pointer/README.md -------------------------------------------------------------------------------- /count-complete-tree-nodes/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/count-complete-tree-nodes/README.md -------------------------------------------------------------------------------- /count-primes/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/count-primes/README.md -------------------------------------------------------------------------------- /count-primes/count-primes.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/count-primes/count-primes.cpp -------------------------------------------------------------------------------- /cousins-in-binary-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/cousins-in-binary-tree/README.md -------------------------------------------------------------------------------- /cousins-in-binary-tree/cousins-in-binary-tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/cousins-in-binary-tree/cousins-in-binary-tree.cpp -------------------------------------------------------------------------------- /daily-temperatures/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/daily-temperatures/README.md -------------------------------------------------------------------------------- /deepest-leaves-sum/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/deepest-leaves-sum/README.md -------------------------------------------------------------------------------- /deepest-leaves-sum/deepest-leaves-sum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/deepest-leaves-sum/deepest-leaves-sum.cpp -------------------------------------------------------------------------------- /defanging-an-ip-address/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/defanging-an-ip-address/README.md -------------------------------------------------------------------------------- /delete-node-in-a-bst/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/delete-node-in-a-bst/README.md -------------------------------------------------------------------------------- /delete-node-in-a-bst/delete-node-in-a-bst.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/delete-node-in-a-bst/delete-node-in-a-bst.cpp -------------------------------------------------------------------------------- /delete-node-in-a-linked-list/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/delete-node-in-a-linked-list/README.md -------------------------------------------------------------------------------- /design-hashset/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/design-hashset/README.md -------------------------------------------------------------------------------- /design-hashset/design-hashset.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/design-hashset/design-hashset.cpp -------------------------------------------------------------------------------- /design-parking-system/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/design-parking-system/README.md -------------------------------------------------------------------------------- /design-parking-system/design-parking-system.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/design-parking-system/design-parking-system.cpp -------------------------------------------------------------------------------- /detect-capital/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/detect-capital/README.md -------------------------------------------------------------------------------- /detect-capital/detect-capital.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/detect-capital/detect-capital.cpp -------------------------------------------------------------------------------- /determine-if-string-halves-are-alike/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/determine-if-string-halves-are-alike/README.md -------------------------------------------------------------------------------- /diameter-of-binary-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/diameter-of-binary-tree/README.md -------------------------------------------------------------------------------- /diameter-of-binary-tree/diameter-of-binary-tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/diameter-of-binary-tree/diameter-of-binary-tree.cpp -------------------------------------------------------------------------------- /divisor-game/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/divisor-game/README.md -------------------------------------------------------------------------------- /divisor-game/divisor-game.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/divisor-game/divisor-game.cpp -------------------------------------------------------------------------------- /evaluate-reverse-polish-notation/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/evaluate-reverse-polish-notation/README.md -------------------------------------------------------------------------------- /excel-sheet-column-number/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/excel-sheet-column-number/README.md -------------------------------------------------------------------------------- /find-all-numbers-disappeared-in-an-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/find-all-numbers-disappeared-in-an-array/README.md -------------------------------------------------------------------------------- /find-center-of-star-graph/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/find-center-of-star-graph/README.md -------------------------------------------------------------------------------- /find-greatest-common-divisor-of-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/find-greatest-common-divisor-of-array/README.md -------------------------------------------------------------------------------- /find-k-pairs-with-smallest-sums/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/find-k-pairs-with-smallest-sums/README.md -------------------------------------------------------------------------------- /find-mode-in-binary-search-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/find-mode-in-binary-search-tree/README.md -------------------------------------------------------------------------------- /find-pivot-index/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/find-pivot-index/README.md -------------------------------------------------------------------------------- /find-pivot-index/find-pivot-index.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/find-pivot-index/find-pivot-index.cpp -------------------------------------------------------------------------------- /find-the-difference/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/find-the-difference/README.md -------------------------------------------------------------------------------- /find-the-difference/find-the-difference.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/find-the-difference/find-the-difference.cpp -------------------------------------------------------------------------------- /find-the-middle-index-in-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/find-the-middle-index-in-array/README.md -------------------------------------------------------------------------------- /first-bad-version/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/first-bad-version/README.md -------------------------------------------------------------------------------- /first-bad-version/first-bad-version.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/first-bad-version/first-bad-version.cpp -------------------------------------------------------------------------------- /flatten-a-multilevel-doubly-linked-list/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/flatten-a-multilevel-doubly-linked-list/README.md -------------------------------------------------------------------------------- /flatten-binary-tree-to-linked-list/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/flatten-binary-tree-to-linked-list/README.md -------------------------------------------------------------------------------- /group-anagrams/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/group-anagrams/README.md -------------------------------------------------------------------------------- /group-anagrams/group-anagrams.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/group-anagrams/group-anagrams.cpp -------------------------------------------------------------------------------- /guess-number-higher-or-lower/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/guess-number-higher-or-lower/README.md -------------------------------------------------------------------------------- /hamming-distance/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/hamming-distance/README.md -------------------------------------------------------------------------------- /hamming-distance/hamming-distance.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/hamming-distance/hamming-distance.cpp -------------------------------------------------------------------------------- /implement-queue-using-stacks/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/implement-queue-using-stacks/README.md -------------------------------------------------------------------------------- /implement-stack-using-queues/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/implement-stack-using-queues/README.md -------------------------------------------------------------------------------- /increasing-order-search-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/increasing-order-search-tree/README.md -------------------------------------------------------------------------------- /insert-interval/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/insert-interval/README.md -------------------------------------------------------------------------------- /insert-interval/insert-interval.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/insert-interval/insert-interval.cpp -------------------------------------------------------------------------------- /insertion-sort-list/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/insertion-sort-list/README.md -------------------------------------------------------------------------------- /insertion-sort-list/insertion-sort-list.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/insertion-sort-list/insertion-sort-list.cpp -------------------------------------------------------------------------------- /integer-break/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/integer-break/README.md -------------------------------------------------------------------------------- /integer-break/integer-break.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/integer-break/integer-break.cpp -------------------------------------------------------------------------------- /intersection-of-two-arrays-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/intersection-of-two-arrays-ii/README.md -------------------------------------------------------------------------------- /intersection-of-two-arrays/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/intersection-of-two-arrays/README.md -------------------------------------------------------------------------------- /intersection-of-two-linked-lists/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/intersection-of-two-linked-lists/README.md -------------------------------------------------------------------------------- /invert-binary-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/invert-binary-tree/README.md -------------------------------------------------------------------------------- /invert-binary-tree/invert-binary-tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/invert-binary-tree/invert-binary-tree.cpp -------------------------------------------------------------------------------- /jewels-and-stones/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/jewels-and-stones/README.md -------------------------------------------------------------------------------- /jewels-and-stones/jewels-and-stones.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/jewels-and-stones/jewels-and-stones.cpp -------------------------------------------------------------------------------- /k-closest-points-to-origin/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/k-closest-points-to-origin/README.md -------------------------------------------------------------------------------- /k-diff-pairs-in-an-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/k-diff-pairs-in-an-array/README.md -------------------------------------------------------------------------------- /k-diff-pairs-in-an-array/k-diff-pairs-in-an-array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/k-diff-pairs-in-an-array/k-diff-pairs-in-an-array.cpp -------------------------------------------------------------------------------- /keyboard-row/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/keyboard-row/README.md -------------------------------------------------------------------------------- /keyboard-row/keyboard-row.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/keyboard-row/keyboard-row.cpp -------------------------------------------------------------------------------- /kth-largest-element-in-a-stream/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/kth-largest-element-in-a-stream/README.md -------------------------------------------------------------------------------- /kth-smallest-element-in-a-bst/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/kth-smallest-element-in-a-bst/README.md -------------------------------------------------------------------------------- /kth-smallest-element-in-a-sorted-matrix/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/kth-smallest-element-in-a-sorted-matrix/README.md -------------------------------------------------------------------------------- /last-stone-weight-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/last-stone-weight-ii/README.md -------------------------------------------------------------------------------- /last-stone-weight-ii/last-stone-weight-ii.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/last-stone-weight-ii/last-stone-weight-ii.cpp -------------------------------------------------------------------------------- /last-stone-weight/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/last-stone-weight/README.md -------------------------------------------------------------------------------- /last-stone-weight/last-stone-weight.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/last-stone-weight/last-stone-weight.cpp -------------------------------------------------------------------------------- /length-of-last-word/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/length-of-last-word/README.md -------------------------------------------------------------------------------- /length-of-last-word/length-of-last-word.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/length-of-last-word/length-of-last-word.cpp -------------------------------------------------------------------------------- /linked-list-components/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/linked-list-components/README.md -------------------------------------------------------------------------------- /linked-list-components/linked-list-components.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/linked-list-components/linked-list-components.cpp -------------------------------------------------------------------------------- /linked-list-cycle-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/linked-list-cycle-ii/README.md -------------------------------------------------------------------------------- /linked-list-cycle-ii/linked-list-cycle-ii.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/linked-list-cycle-ii/linked-list-cycle-ii.cpp -------------------------------------------------------------------------------- /linked-list-cycle/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/linked-list-cycle/README.md -------------------------------------------------------------------------------- /linked-list-cycle/linked-list-cycle.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/linked-list-cycle/linked-list-cycle.cpp -------------------------------------------------------------------------------- /linked-list-in-binary-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/linked-list-in-binary-tree/README.md -------------------------------------------------------------------------------- /linked-list-random-node/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/linked-list-random-node/README.md -------------------------------------------------------------------------------- /linked-list-random-node/linked-list-random-node.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/linked-list-random-node/linked-list-random-node.cpp -------------------------------------------------------------------------------- /longest-common-prefix/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/longest-common-prefix/README.md -------------------------------------------------------------------------------- /longest-common-prefix/longest-common-prefix.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/longest-common-prefix/longest-common-prefix.cpp -------------------------------------------------------------------------------- /longest-common-subsequence/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/longest-common-subsequence/README.md -------------------------------------------------------------------------------- /lowest-common-ancestor-of-a-binary-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/lowest-common-ancestor-of-a-binary-tree/README.md -------------------------------------------------------------------------------- /max-chunks-to-make-sorted/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/max-chunks-to-make-sorted/README.md -------------------------------------------------------------------------------- /maximize-sum-of-array-after-k-negations/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/maximize-sum-of-array-after-k-negations/README.md -------------------------------------------------------------------------------- /maximum-69-number/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/maximum-69-number/README.md -------------------------------------------------------------------------------- /maximum-69-number/maximum-69-number.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/maximum-69-number/maximum-69-number.cpp -------------------------------------------------------------------------------- /maximum-binary-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/maximum-binary-tree/README.md -------------------------------------------------------------------------------- /maximum-depth-of-binary-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/maximum-depth-of-binary-tree/README.md -------------------------------------------------------------------------------- /maximum-depth-of-n-ary-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/maximum-depth-of-n-ary-tree/README.md -------------------------------------------------------------------------------- /maximum-length-of-repeated-subarray/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/maximum-length-of-repeated-subarray/README.md -------------------------------------------------------------------------------- /maximum-subarray/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/maximum-subarray/README.md -------------------------------------------------------------------------------- /maximum-subarray/maximum-subarray.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/maximum-subarray/maximum-subarray.cpp -------------------------------------------------------------------------------- /merge-in-between-linked-lists/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/merge-in-between-linked-lists/README.md -------------------------------------------------------------------------------- /merge-intervals/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/merge-intervals/README.md -------------------------------------------------------------------------------- /merge-intervals/merge-intervals.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/merge-intervals/merge-intervals.cpp -------------------------------------------------------------------------------- /merge-k-sorted-lists/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/merge-k-sorted-lists/README.md -------------------------------------------------------------------------------- /merge-k-sorted-lists/merge-k-sorted-lists.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/merge-k-sorted-lists/merge-k-sorted-lists.cpp -------------------------------------------------------------------------------- /merge-sorted-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/merge-sorted-array/README.md -------------------------------------------------------------------------------- /merge-sorted-array/merge-sorted-array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/merge-sorted-array/merge-sorted-array.cpp -------------------------------------------------------------------------------- /merge-strings-alternately/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/merge-strings-alternately/README.md -------------------------------------------------------------------------------- /merge-two-binary-trees/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/merge-two-binary-trees/README.md -------------------------------------------------------------------------------- /merge-two-binary-trees/merge-two-binary-trees.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/merge-two-binary-trees/merge-two-binary-trees.cpp -------------------------------------------------------------------------------- /merge-two-sorted-lists/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/merge-two-sorted-lists/README.md -------------------------------------------------------------------------------- /merge-two-sorted-lists/merge-two-sorted-lists.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/merge-two-sorted-lists/merge-two-sorted-lists.cpp -------------------------------------------------------------------------------- /middle-of-the-linked-list/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/middle-of-the-linked-list/README.md -------------------------------------------------------------------------------- /minimum-absolute-difference-in-bst/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/minimum-absolute-difference-in-bst/README.md -------------------------------------------------------------------------------- /minimum-absolute-difference/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/minimum-absolute-difference/README.md -------------------------------------------------------------------------------- /minimum-depth-of-binary-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/minimum-depth-of-binary-tree/README.md -------------------------------------------------------------------------------- /minimum-distance-between-bst-nodes/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/minimum-distance-between-bst-nodes/README.md -------------------------------------------------------------------------------- /minimum-operations-to-make-array-equal/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/minimum-operations-to-make-array-equal/README.md -------------------------------------------------------------------------------- /my-calendar-i/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/my-calendar-i/README.md -------------------------------------------------------------------------------- /my-calendar-i/my-calendar-i.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/my-calendar-i/my-calendar-i.cpp -------------------------------------------------------------------------------- /my-calendar-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/my-calendar-ii/README.md -------------------------------------------------------------------------------- /my-calendar-ii/my-calendar-ii.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/my-calendar-ii/my-calendar-ii.cpp -------------------------------------------------------------------------------- /n-ary-tree-level-order-traversal/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/n-ary-tree-level-order-traversal/README.md -------------------------------------------------------------------------------- /n-ary-tree-preorder-traversal/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/n-ary-tree-preorder-traversal/README.md -------------------------------------------------------------------------------- /n-repeated-element-in-size-2n-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/n-repeated-element-in-size-2n-array/README.md -------------------------------------------------------------------------------- /next-greater-node-in-linked-list/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/next-greater-node-in-linked-list/README.md -------------------------------------------------------------------------------- /non-overlapping-intervals/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/non-overlapping-intervals/README.md -------------------------------------------------------------------------------- /number-complement/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/number-complement/README.md -------------------------------------------------------------------------------- /number-complement/number-complement.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/number-complement/number-complement.cpp -------------------------------------------------------------------------------- /number-of-steps-to-reduce-a-number-to-zero/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/number-of-steps-to-reduce-a-number-to-zero/README.md -------------------------------------------------------------------------------- /odd-even-linked-list/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/odd-even-linked-list/README.md -------------------------------------------------------------------------------- /odd-even-linked-list/odd-even-linked-list.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/odd-even-linked-list/odd-even-linked-list.cpp -------------------------------------------------------------------------------- /palindrome-linked-list/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/palindrome-linked-list/README.md -------------------------------------------------------------------------------- /palindrome-linked-list/palindrome-linked-list.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/palindrome-linked-list/palindrome-linked-list.cpp -------------------------------------------------------------------------------- /palindrome-number/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/palindrome-number/README.md -------------------------------------------------------------------------------- /palindrome-number/palindrome-number.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/palindrome-number/palindrome-number.cpp -------------------------------------------------------------------------------- /partition-equal-subset-sum/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/partition-equal-subset-sum/README.md -------------------------------------------------------------------------------- /partition-list/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/partition-list/README.md -------------------------------------------------------------------------------- /partition-list/partition-list.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/partition-list/partition-list.cpp -------------------------------------------------------------------------------- /pascals-triangle/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/pascals-triangle/README.md -------------------------------------------------------------------------------- /pascals-triangle/pascals-triangle.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/pascals-triangle/pascals-triangle.cpp -------------------------------------------------------------------------------- /path-in-zigzag-labelled-binary-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/path-in-zigzag-labelled-binary-tree/README.md -------------------------------------------------------------------------------- /path-sum-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/path-sum-ii/README.md -------------------------------------------------------------------------------- /path-sum-ii/path-sum-ii.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/path-sum-ii/path-sum-ii.cpp -------------------------------------------------------------------------------- /path-sum/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/path-sum/README.md -------------------------------------------------------------------------------- /path-sum/path-sum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/path-sum/path-sum.cpp -------------------------------------------------------------------------------- /permutations/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/permutations/README.md -------------------------------------------------------------------------------- /permutations/permutations.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/permutations/permutations.cpp -------------------------------------------------------------------------------- /populating-next-right-pointers-in-each-node/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/populating-next-right-pointers-in-each-node/README.md -------------------------------------------------------------------------------- /power-of-three/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/power-of-three/README.md -------------------------------------------------------------------------------- /power-of-three/power-of-three.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/power-of-three/power-of-three.cpp -------------------------------------------------------------------------------- /power-of-two/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/power-of-two/README.md -------------------------------------------------------------------------------- /power-of-two/power-of-two.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/power-of-two/power-of-two.cpp -------------------------------------------------------------------------------- /powx-n/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/powx-n/README.md -------------------------------------------------------------------------------- /powx-n/powx-n.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/powx-n/powx-n.cpp -------------------------------------------------------------------------------- /product-of-array-except-self/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/product-of-array-except-self/README.md -------------------------------------------------------------------------------- /queries-on-number-of-points-inside-a-circle/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/queries-on-number-of-points-inside-a-circle/README.md -------------------------------------------------------------------------------- /random-pick-index/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/random-pick-index/README.md -------------------------------------------------------------------------------- /random-pick-index/random-pick-index.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/random-pick-index/random-pick-index.cpp -------------------------------------------------------------------------------- /random-pick-with-blacklist/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/random-pick-with-blacklist/README.md -------------------------------------------------------------------------------- /random-pick-with-weight/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/random-pick-with-weight/README.md -------------------------------------------------------------------------------- /random-pick-with-weight/random-pick-with-weight.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/random-pick-with-weight/random-pick-with-weight.cpp -------------------------------------------------------------------------------- /random-point-in-non-overlapping-rectangles/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/random-point-in-non-overlapping-rectangles/README.md -------------------------------------------------------------------------------- /range-sum-of-bst/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/range-sum-of-bst/README.md -------------------------------------------------------------------------------- /range-sum-of-bst/range-sum-of-bst.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/range-sum-of-bst/range-sum-of-bst.cpp -------------------------------------------------------------------------------- /range-sum-of-sorted-subarray-sums/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/range-sum-of-sorted-subarray-sums/README.md -------------------------------------------------------------------------------- /range-sum-query-immutable/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/range-sum-query-immutable/README.md -------------------------------------------------------------------------------- /ransom-note/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/ransom-note/README.md -------------------------------------------------------------------------------- /ransom-note/ransom-note.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/ransom-note/ransom-note.cpp -------------------------------------------------------------------------------- /reformat-date/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/reformat-date/README.md -------------------------------------------------------------------------------- /reformat-date/reformat-date.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/reformat-date/reformat-date.cpp -------------------------------------------------------------------------------- /relative-ranks/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/relative-ranks/README.md -------------------------------------------------------------------------------- /relative-ranks/relative-ranks.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/relative-ranks/relative-ranks.cpp -------------------------------------------------------------------------------- /relative-sort-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/relative-sort-array/README.md -------------------------------------------------------------------------------- /relative-sort-array/relative-sort-array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/relative-sort-array/relative-sort-array.cpp -------------------------------------------------------------------------------- /remove-duplicates-from-sorted-list-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/remove-duplicates-from-sorted-list-ii/README.md -------------------------------------------------------------------------------- /remove-duplicates-from-sorted-list/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/remove-duplicates-from-sorted-list/README.md -------------------------------------------------------------------------------- /remove-linked-list-elements/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/remove-linked-list-elements/README.md -------------------------------------------------------------------------------- /remove-nth-node-from-end-of-list/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/remove-nth-node-from-end-of-list/README.md -------------------------------------------------------------------------------- /remove-outermost-parentheses/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/remove-outermost-parentheses/README.md -------------------------------------------------------------------------------- /reorder-list/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/reorder-list/README.md -------------------------------------------------------------------------------- /reorder-list/reorder-list.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/reorder-list/reorder-list.cpp -------------------------------------------------------------------------------- /reverse-integer/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/reverse-integer/README.md -------------------------------------------------------------------------------- /reverse-integer/reverse-integer.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/reverse-integer/reverse-integer.cpp -------------------------------------------------------------------------------- /reverse-linked-list-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/reverse-linked-list-ii/README.md -------------------------------------------------------------------------------- /reverse-linked-list-ii/reverse-linked-list-ii.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/reverse-linked-list-ii/reverse-linked-list-ii.cpp -------------------------------------------------------------------------------- /reverse-linked-list/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/reverse-linked-list/README.md -------------------------------------------------------------------------------- /reverse-linked-list/reverse-linked-list.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/reverse-linked-list/reverse-linked-list.cpp -------------------------------------------------------------------------------- /reverse-nodes-in-k-group/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/reverse-nodes-in-k-group/README.md -------------------------------------------------------------------------------- /reverse-nodes-in-k-group/reverse-nodes-in-k-group.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/reverse-nodes-in-k-group/reverse-nodes-in-k-group.cpp -------------------------------------------------------------------------------- /reverse-words-in-a-string/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/reverse-words-in-a-string/README.md -------------------------------------------------------------------------------- /roman-to-integer/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/roman-to-integer/README.md -------------------------------------------------------------------------------- /roman-to-integer/roman-to-integer.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/roman-to-integer/roman-to-integer.cpp -------------------------------------------------------------------------------- /rotate-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/rotate-array/README.md -------------------------------------------------------------------------------- /rotate-array/rotate-array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/rotate-array/rotate-array.cpp -------------------------------------------------------------------------------- /rotate-array/rotate-array.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/rotate-array/rotate-array.java -------------------------------------------------------------------------------- /rotate-list/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/rotate-list/README.md -------------------------------------------------------------------------------- /rotate-list/rotate-list.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/rotate-list/rotate-list.cpp -------------------------------------------------------------------------------- /same-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/same-tree/README.md -------------------------------------------------------------------------------- /same-tree/same-tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/same-tree/same-tree.cpp -------------------------------------------------------------------------------- /search-in-a-binary-search-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/search-in-a-binary-search-tree/README.md -------------------------------------------------------------------------------- /search-in-rotated-sorted-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/search-in-rotated-sorted-array/README.md -------------------------------------------------------------------------------- /search-insert-position/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/search-insert-position/README.md -------------------------------------------------------------------------------- /search-insert-position/search-insert-position.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/search-insert-position/search-insert-position.cpp -------------------------------------------------------------------------------- /second-minimum-node-in-a-binary-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/second-minimum-node-in-a-binary-tree/README.md -------------------------------------------------------------------------------- /self-dividing-numbers/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/self-dividing-numbers/README.md -------------------------------------------------------------------------------- /self-dividing-numbers/self-dividing-numbers.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/self-dividing-numbers/self-dividing-numbers.cpp -------------------------------------------------------------------------------- /set-matrix-zeroes/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/set-matrix-zeroes/README.md -------------------------------------------------------------------------------- /set-matrix-zeroes/set-matrix-zeroes.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/set-matrix-zeroes/set-matrix-zeroes.cpp -------------------------------------------------------------------------------- /shortest-common-supersequence/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/shortest-common-supersequence/README.md -------------------------------------------------------------------------------- /shuffle-string/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/shuffle-string/README.md -------------------------------------------------------------------------------- /shuffle-string/shuffle-string.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/shuffle-string/shuffle-string.cpp -------------------------------------------------------------------------------- /shuffle-the-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/shuffle-the-array/README.md -------------------------------------------------------------------------------- /shuffle-the-array/shuffle-the-array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/shuffle-the-array/shuffle-the-array.cpp -------------------------------------------------------------------------------- /single-element-in-a-sorted-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/single-element-in-a-sorted-array/README.md -------------------------------------------------------------------------------- /smallest-index-with-equal-value/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/smallest-index-with-equal-value/README.md -------------------------------------------------------------------------------- /sort-an-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/sort-an-array/README.md -------------------------------------------------------------------------------- /sort-an-array/sort-an-array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/sort-an-array/sort-an-array.cpp -------------------------------------------------------------------------------- /sort-array-by-increasing-frequency/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/sort-array-by-increasing-frequency/README.md -------------------------------------------------------------------------------- /sort-characters-by-frequency/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/sort-characters-by-frequency/README.md -------------------------------------------------------------------------------- /sort-list/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/sort-list/README.md -------------------------------------------------------------------------------- /sort-list/sort-list.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/sort-list/sort-list.cpp -------------------------------------------------------------------------------- /sorting-the-sentence/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/sorting-the-sentence/README.md -------------------------------------------------------------------------------- /sorting-the-sentence/sorting-the-sentence.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/sorting-the-sentence/sorting-the-sentence.cpp -------------------------------------------------------------------------------- /special-positions-in-a-binary-matrix/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/special-positions-in-a-binary-matrix/README.md -------------------------------------------------------------------------------- /spiral-matrix/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/spiral-matrix/README.md -------------------------------------------------------------------------------- /spiral-matrix/spiral-matrix.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/spiral-matrix/spiral-matrix.cpp -------------------------------------------------------------------------------- /split-linked-list-in-parts/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/split-linked-list-in-parts/README.md -------------------------------------------------------------------------------- /sqrtx/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/sqrtx/README.md -------------------------------------------------------------------------------- /sqrtx/sqrtx.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/sqrtx/sqrtx.cpp -------------------------------------------------------------------------------- /squares-of-a-sorted-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/squares-of-a-sorted-array/README.md -------------------------------------------------------------------------------- /stone-game/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/stone-game/README.md -------------------------------------------------------------------------------- /stone-game/stone-game.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/stone-game/stone-game.cpp -------------------------------------------------------------------------------- /student-attendance-record-i/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/student-attendance-record-i/README.md -------------------------------------------------------------------------------- /subarray-sum-equals-k/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/subarray-sum-equals-k/README.md -------------------------------------------------------------------------------- /subarray-sum-equals-k/subarray-sum-equals-k.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/subarray-sum-equals-k/subarray-sum-equals-k.cpp -------------------------------------------------------------------------------- /subrectangle-queries/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/subrectangle-queries/README.md -------------------------------------------------------------------------------- /subrectangle-queries/subrectangle-queries.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/subrectangle-queries/subrectangle-queries.cpp -------------------------------------------------------------------------------- /sum-of-digits-in-base-k/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/sum-of-digits-in-base-k/README.md -------------------------------------------------------------------------------- /sum-of-digits-in-base-k/sum-of-digits-in-base-k.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/sum-of-digits-in-base-k/sum-of-digits-in-base-k.cpp -------------------------------------------------------------------------------- /sum-of-left-leaves/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/sum-of-left-leaves/README.md -------------------------------------------------------------------------------- /sum-of-left-leaves/sum-of-left-leaves.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/sum-of-left-leaves/sum-of-left-leaves.cpp -------------------------------------------------------------------------------- /sum-of-nodes-with-even-valued-grandparent/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/sum-of-nodes-with-even-valued-grandparent/README.md -------------------------------------------------------------------------------- /sum-root-to-leaf-numbers/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/sum-root-to-leaf-numbers/README.md -------------------------------------------------------------------------------- /sum-root-to-leaf-numbers/sum-root-to-leaf-numbers.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/sum-root-to-leaf-numbers/sum-root-to-leaf-numbers.cpp -------------------------------------------------------------------------------- /swap-nodes-in-pairs/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/swap-nodes-in-pairs/README.md -------------------------------------------------------------------------------- /swap-nodes-in-pairs/swap-nodes-in-pairs.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/swap-nodes-in-pairs/swap-nodes-in-pairs.cpp -------------------------------------------------------------------------------- /swapping-nodes-in-a-linked-list/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/swapping-nodes-in-a-linked-list/README.md -------------------------------------------------------------------------------- /symmetric-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/symmetric-tree/README.md -------------------------------------------------------------------------------- /symmetric-tree/symmetric-tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/symmetric-tree/symmetric-tree.cpp -------------------------------------------------------------------------------- /target-sum/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/target-sum/README.md -------------------------------------------------------------------------------- /target-sum/target-sum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/target-sum/target-sum.cpp -------------------------------------------------------------------------------- /two-sum-ii-input-array-is-sorted/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/two-sum-ii-input-array-is-sorted/README.md -------------------------------------------------------------------------------- /two-sum-iv-input-is-a-bst/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/two-sum-iv-input-is-a-bst/README.md -------------------------------------------------------------------------------- /two-sum/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/two-sum/README.md -------------------------------------------------------------------------------- /two-sum/two-sum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/two-sum/two-sum.cpp -------------------------------------------------------------------------------- /ugly-number-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/ugly-number-ii/README.md -------------------------------------------------------------------------------- /ugly-number-ii/ugly-number-ii.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/ugly-number-ii/ugly-number-ii.cpp -------------------------------------------------------------------------------- /ugly-number/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/ugly-number/README.md -------------------------------------------------------------------------------- /ugly-number/ugly-number.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/ugly-number/ugly-number.cpp -------------------------------------------------------------------------------- /unique-binary-search-trees/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/unique-binary-search-trees/README.md -------------------------------------------------------------------------------- /valid-mountain-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/valid-mountain-array/README.md -------------------------------------------------------------------------------- /valid-mountain-array/valid-mountain-array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/valid-mountain-array/valid-mountain-array.cpp -------------------------------------------------------------------------------- /validate-binary-search-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Apurva-tech/LeetCode/HEAD/validate-binary-search-tree/README.md --------------------------------------------------------------------------------