├── 0945-snakes-and-ladders ├── 0945-snakes-and-ladders.cpp └── README.md ├── 1007-minimum-domino-rotations-for-equal-row ├── 1007-minimum-domino-rotations-for-equal-row.cpp ├── NOTES.md └── README.md ├── 1008-construct-binary-search-tree-from-preorder-traversal ├── 1008-construct-binary-search-tree-from-preorder-traversal.cpp ├── NOTES.md └── README.md ├── 1010-pairs-of-songs-with-total-durations-divisible-by-60 ├── NOTES.md └── README.md ├── 1013-partition-array-into-three-parts-with-equal-sum ├── 1013-partition-array-into-three-parts-with-equal-sum.cpp ├── NOTES.md └── README.md ├── 102-binary-tree-level-order-traversal ├── 102-binary-tree-level-order-traversal.cpp ├── NOTES.md └── README.md ├── 1029-two-city-scheduling ├── 1029-two-city-scheduling.cpp ├── NOTES.md └── README.md ├── 1046-last-stone-weight ├── 1046-last-stone-weight.cpp ├── NOTES.md └── README.md ├── 108-convert-sorted-array-to-binary-search-tree ├── 108-convert-sorted-array-to-binary-search-tree.cpp ├── NOTES.md └── README.md ├── 109-convert-sorted-list-to-binary-search-tree ├── 109-convert-sorted-list-to-binary-search-tree.cpp ├── NOTES.md └── README.md ├── 1091-shortest-path-in-binary-matrix ├── 1091-shortest-path-in-binary-matrix.cpp ├── NOTES.md └── README.md ├── 1094-car-pooling ├── 1094-car-pooling.cpp ├── NOTES.md └── README.md ├── 11-container-with-most-water ├── 11-container-with-most-water.cpp ├── NOTES.md └── README.md ├── 110-balanced-binary-tree ├── 110-balanced-binary-tree.cpp ├── NOTES.md └── README.md ├── 1131-maximum-of-absolute-value-expression ├── 1131-maximum-of-absolute-value-expression.cpp ├── NOTES.md └── README.md ├── 1143-longest-common-subsequence ├── 1143-longest-common-subsequence.cpp ├── NOTES.md └── README.md ├── 1146-snapshot-array ├── 1146-snapshot-array.cpp ├── NOTES.md └── README.md ├── 115-distinct-subsequences ├── 115-distinct-subsequences.cpp ├── NOTES.md └── README.md ├── 116-populating-next-right-pointers-in-each-node ├── 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 ├── 119-pascals-triangle-ii ├── 119-pascals-triangle-ii.cpp ├── NOTES.md └── README.md ├── 1192-critical-connections-in-a-network ├── 1192-critical-connections-in-a-network.cpp ├── NOTES.md └── README.md ├── 1202-smallest-string-with-swaps ├── 1202-smallest-string-with-swaps.cpp ├── NOTES.md └── README.md ├── 1207-unique-number-of-occurrences ├── 1207-unique-number-of-occurrences.cpp ├── NOTES.md └── README.md ├── 1209-remove-all-adjacent-duplicates-in-string-ii ├── 1209-remove-all-adjacent-duplicates-in-string-ii.cpp ├── NOTES.md └── README.md ├── 121-best-time-to-buy-and-sell-stock ├── 121-best-time-to-buy-and-sell-stock.cpp ├── NOTES.md └── README.md ├── 1249-minimum-remove-to-make-valid-parentheses ├── 1249-minimum-remove-to-make-valid-parentheses.cpp ├── NOTES.md └── README.md ├── 125-valid-palindrome ├── 125-valid-palindrome.cpp ├── NOTES.md └── README.md ├── 1260-shift-2d-grid ├── 1260-shift-2d-grid.cpp ├── NOTES.md └── README.md ├── 1266-minimum-time-visiting-all-points ├── 1266-minimum-time-visiting-all-points.cpp ├── NOTES.md └── README.md ├── 1275-find-winner-on-a-tic-tac-toe-game ├── NOTES.md └── README.md ├── 128-longest-consecutive-sequence ├── 128-longest-consecutive-sequence.cpp ├── NOTES.md └── README.md ├── 130-surrounded-regions ├── 130-surrounded-regions.cpp ├── NOTES.md └── README.md ├── 1326-minimum-number-of-taps-to-open-to-water-a-garden ├── 1326-minimum-number-of-taps-to-open-to-water-a-garden.cpp └── README.md ├── 133-clone-graph ├── NOTES.md └── README.md ├── 1331-rank-transform-of-an-array ├── 1331-rank-transform-of-an-array.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 ├── 1342-number-of-steps-to-reduce-a-number-to-zero ├── 1342-number-of-steps-to-reduce-a-number-to-zero.cpp ├── NOTES.md └── README.md ├── 135-candy ├── 135-candy.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 ├── 1396-design-underground-system ├── 1396-design-underground-system.cpp ├── NOTES.md └── README.md ├── 14-longest-common-prefix ├── 14-longest-common-prefix.cpp ├── NOTES.md └── README.md ├── 1423-maximum-points-you-can-obtain-from-cards ├── 1423-maximum-points-you-can-obtain-from-cards.cpp ├── NOTES.md └── README.md ├── 1424-diagonal-traverse-ii ├── 1424-diagonal-traverse-ii.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 ├── 1473-paint-house-iii ├── 1473-paint-house-iii.cpp ├── NOTES.md └── README.md ├── 1477-find-two-non-overlapping-sub-arrays-each-with-target-sum ├── 1477-find-two-non-overlapping-sub-arrays-each-with-target-sum.cpp ├── NOTES.md └── README.md ├── 1480-running-sum-of-1d-array ├── 1480-running-sum-of-1d-array.cpp └── README.md ├── 1482-minimum-number-of-days-to-make-m-bouquets └── README.md ├── 15-3sum ├── 15-3sum.cpp ├── NOTES.md └── README.md ├── 151-reverse-words-in-a-string ├── 151-reverse-words-in-a-string.cpp ├── NOTES.md └── README.md ├── 152-maximum-product-subarray ├── 152-maximum-product-subarray.cpp ├── NOTES.md └── README.md ├── 1525-number-of-good-ways-to-split-a-string ├── 1525-number-of-good-ways-to-split-a-string.cpp ├── NOTES.md └── README.md ├── 153-find-minimum-in-rotated-sorted-array ├── 153-find-minimum-in-rotated-sorted-array.cpp ├── NOTES.md └── README.md ├── 1539-kth-missing-positive-number ├── 1539-kth-missing-positive-number.cpp ├── NOTES.md └── README.md ├── 1584-min-cost-to-connect-all-points ├── 1584-min-cost-to-connect-all-points.cpp ├── NOTES.md └── README.md ├── 1588-sum-of-all-odd-length-subarrays ├── 1588-sum-of-all-odd-length-subarrays.cpp ├── NOTES.md └── README.md ├── 16-3sum-closest ├── NOTES.md └── README.md ├── 1631-path-with-minimum-effort ├── 1631-path-with-minimum-effort.cpp ├── NOTES.md └── README.md ├── 164-maximum-gap ├── 164-maximum-gap.cpp ├── NOTES.md └── README.md ├── 1641-count-sorted-vowel-strings ├── 1641-count-sorted-vowel-strings.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 ├── 1679-max-number-of-k-sum-pairs ├── 1679-max-number-of-k-sum-pairs.cpp ├── NOTES.md └── README.md ├── 168-excel-sheet-column-title ├── 168-excel-sheet-column-title.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 ├── 172-factorial-trailing-zeroes ├── 172-factorial-trailing-zeroes.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 ├── 179-largest-number ├── 179-largest-number.cpp ├── NOTES.md └── README.md ├── 1793-maximum-score-of-a-good-subarray ├── 1793-maximum-score-of-a-good-subarray.cpp ├── NOTES.md └── README.md ├── 18-4sum ├── 18-4sum.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 ├── 2-add-two-numbers ├── 2-add-two-numbers.cpp ├── NOTES.md └── README.md ├── 2007-find-original-array-from-doubled-array ├── 2007-find-original-array-from-doubled-array.cpp ├── NOTES.md └── README.md ├── 2013-detect-squares ├── 2013-detect-squares.cpp ├── NOTES.md └── README.md ├── 207-course-schedule ├── 207-course-schedule.cpp ├── NOTES.md └── README.md ├── 210-course-schedule-ii ├── 210-course-schedule-ii.cpp ├── NOTES.md └── README.md ├── 2115-find-all-possible-recipes-from-given-supplies ├── 2115-find-all-possible-recipes-from-given-supplies.cpp ├── NOTES.md └── README.md ├── 212-word-search-ii ├── 212-word-search-ii.cpp ├── NOTES.md └── README.md ├── 2135-count-words-obtained-after-adding-a-letter ├── 2135-count-words-obtained-after-adding-a-letter.cpp ├── NOTES.md └── README.md ├── 215-kth-largest-element-in-an-array ├── 215-kth-largest-element-in-an-array.cpp ├── NOTES.md └── README.md ├── 216-combination-sum-iii ├── 216-combination-sum-iii.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 ├── 229-majority-element-ii ├── NOTES.md └── README.md ├── 23-merge-k-sorted-lists ├── 23-merge-k-sorted-lists.cpp ├── NOTES.md └── README.md ├── 230-kth-smallest-element-in-a-bst ├── 230-kth-smallest-element-in-a-bst.cpp ├── NOTES.md └── README.md ├── 231-power-of-two ├── 231-power-of-two.cpp ├── NOTES.md └── README.md ├── 235-lowest-common-ancestor-of-a-binary-search-tree ├── NOTES.md └── README.md ├── 238-product-of-array-except-self ├── NOTES.md └── README.md ├── 239-sliding-window-maximum ├── 239-sliding-window-maximum.cpp ├── NOTES.md └── README.md ├── 25-reverse-nodes-in-k-group ├── 25-reverse-nodes-in-k-group.cpp ├── NOTES.md └── README.md ├── 26-remove-duplicates-from-sorted-array ├── NOTES.md └── README.md ├── 268-missing-number ├── 268-missing-number.cpp ├── NOTES.md └── README.md ├── 28-implement-strstr ├── 28-implement-strstr.cpp ├── NOTES.md └── README.md ├── 283-move-zeroes ├── NOTES.md └── README.md ├── 284-peeking-iterator ├── 284-peeking-iterator.cpp ├── NOTES.md └── README.md ├── 287-find-the-duplicate-number ├── 287-find-the-duplicate-number.cpp ├── NOTES.md └── README.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 ├── 3-longest-substring-without-repeating-characters ├── 3-longest-substring-without-repeating-characters.cpp ├── NOTES.md └── README.md ├── 30-substring-with-concatenation-of-all-words ├── 30-substring-with-concatenation-of-all-words.cpp ├── NOTES.md └── README.md ├── 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 ├── 329-longest-increasing-path-in-a-matrix ├── 329-longest-increasing-path-in-a-matrix.cpp ├── NOTES.md └── README.md ├── 33-search-in-rotated-sorted-array ├── 33-search-in-rotated-sorted-array.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 ├── 347-top-k-frequent-elements ├── 347-top-k-frequent-elements.cpp ├── NOTES.md └── README.md ├── 354-russian-doll-envelopes ├── 354-russian-doll-envelopes.cpp └── README.md ├── 37-sudoku-solver ├── 37-sudoku-solver.cpp ├── NOTES.md └── README.md ├── 38-count-and-say ├── 38-count-and-say.cpp ├── NOTES.md └── README.md ├── 381-insert-delete-getrandom-o1-duplicates-allowed ├── 381-insert-delete-getrandom-o1-duplicates-allowed.cpp ├── NOTES.md └── README.md ├── 394-decode-string ├── 394-decode-string.cpp ├── NOTES.md └── README.md ├── 399-evaluate-division ├── 399-evaluate-division.cpp ├── NOTES.md └── README.md ├── 4-median-of-two-sorted-arrays ├── NOTES.md └── README.md ├── 404-sum-of-left-leaves ├── 404-sum-of-left-leaves.cpp ├── NOTES.md └── README.md ├── 41-first-missing-positive ├── 41-first-missing-positive.cpp ├── NOTES.md └── README.md ├── 410-split-array-largest-sum ├── 410-split-array-largest-sum.cpp ├── NOTES.md └── README.md ├── 412-fizz-buzz ├── 412-fizz-buzz.cpp ├── NOTES.md └── README.md ├── 42-trapping-rain-water ├── 42-trapping-rain-water.cpp ├── NOTES.md └── README.md ├── 44-wildcard-matching ├── 44-wildcard-matching.cpp ├── NOTES.md └── README.md ├── 456-132-pattern ├── 456-132-pattern.cpp ├── NOTES.md └── README.md ├── 47-permutations-ii ├── 47-permutations-ii.cpp └── README.md ├── 474-ones-and-zeroes ├── 474-ones-and-zeroes.cpp ├── NOTES.md └── README.md ├── 477-total-hamming-distance ├── 477-total-hamming-distance.cpp ├── NOTES.md └── README.md ├── 48-rotate-image ├── 48-rotate-image.cpp ├── NOTES.md └── README.md ├── 5-longest-palindromic-substring ├── 5-longest-palindromic-substring.cpp ├── NOTES.md └── README.md ├── 509-fibonacci-number ├── 509-fibonacci-number.cpp ├── NOTES.md └── README.md ├── 51-n-queens ├── 51-n-queens.cpp ├── NOTES.md └── README.md ├── 53-maximum-subarray ├── 53-maximum-subarray.cpp ├── NOTES.md └── README.md ├── 532-k-diff-pairs-in-an-array ├── 532-k-diff-pairs-in-an-array.cpp ├── NOTES.md └── README.md ├── 535-encode-and-decode-tinyurl ├── 535-encode-and-decode-tinyurl.cpp ├── NOTES.md └── README.md ├── 538-convert-bst-to-greater-tree ├── 538-convert-bst-to-greater-tree.cpp ├── NOTES.md └── README.md ├── 547-number-of-provinces ├── 547-number-of-provinces.cpp ├── NOTES.md └── README.md ├── 55-jump-game ├── 55-jump-game.cpp ├── NOTES.md └── README.md ├── 56-merge-intervals ├── 56-merge-intervals.cpp ├── NOTES.md └── README.md ├── 560-subarray-sum-equals-k ├── NOTES.md └── README.md ├── 57-insert-interval ├── 57-insert-interval.cpp ├── NOTES.md └── README.md ├── 572-subtree-of-another-tree ├── NOTES.md └── README.md ├── 58-length-of-last-word ├── 58-length-of-last-word.cpp ├── NOTES.md └── README.md ├── 581-shortest-unsorted-continuous-subarray ├── 581-shortest-unsorted-continuous-subarray.cpp ├── NOTES.md └── README.md ├── 59-spiral-matrix-ii ├── 59-spiral-matrix-ii.cpp ├── NOTES.md └── README.md ├── 617-merge-two-binary-trees ├── NOTES.md └── README.md ├── 62-unique-paths ├── 62-unique-paths.cpp ├── NOTES.md └── README.md ├── 63-unique-paths-ii ├── 63-unique-paths-ii.cpp ├── NOTES.md └── README.md ├── 632-smallest-range-covering-elements-from-k-lists ├── 632-smallest-range-covering-elements-from-k-lists.cpp ├── NOTES.md └── README.md ├── 66-plus-one ├── 66-plus-one.cpp ├── NOTES.md └── README.md ├── 662-maximum-width-of-binary-tree ├── 662-maximum-width-of-binary-tree.cpp ├── NOTES.md └── README.md ├── 669-trim-a-binary-search-tree ├── 669-trim-a-binary-search-tree.cpp ├── NOTES.md └── README.md ├── 680-valid-palindrome-ii ├── 680-valid-palindrome-ii.cpp ├── NOTES.md └── README.md ├── 682-baseball-game ├── 682-baseball-game.cpp ├── NOTES.md └── README.md ├── 7-reverse-integer ├── 7-reverse-integer.cpp ├── NOTES.md └── README.md ├── 700-search-in-a-binary-search-tree ├── 700-search-in-a-binary-search-tree.cpp ├── NOTES.md └── README.md ├── 703-kth-largest-element-in-a-stream ├── 703-kth-largest-element-in-a-stream.cpp └── README.md ├── 704-binary-search ├── 704-binary-search.cpp ├── NOTES.md └── README.md ├── 705-design-hashset ├── 705-design-hashset.cpp ├── NOTES.md └── README.md ├── 706-design-hashmap ├── 706-design-hashmap.cpp ├── NOTES.md └── README.md ├── 71-simplify-path ├── 71-simplify-path.cpp ├── NOTES.md └── README.md ├── 72-edit-distance ├── 72-edit-distance.cpp ├── NOTES.md └── README.md ├── 724-find-pivot-index ├── NOTES.md └── README.md ├── 73-set-matrix-zeroes ├── 73-set-matrix-zeroes.cpp ├── NOTES.md └── README.md ├── 74-search-a-2d-matrix ├── 74-search-a-2d-matrix.cpp ├── NOTES.md └── README.md ├── 743-network-delay-time ├── 743-network-delay-time.cpp ├── NOTES.md └── README.md ├── 754-reach-a-number ├── 754-reach-a-number.cpp ├── NOTES.md └── README.md ├── 76-minimum-window-substring ├── 76-minimum-window-substring.cpp ├── NOTES.md └── README.md ├── 763-partition-labels ├── 763-partition-labels.cpp ├── NOTES.md └── README.md ├── 78-subsets ├── NOTES.md └── README.md ├── 785-is-graph-bipartite ├── 785-is-graph-bipartite.cpp └── README.md ├── 79-word-search ├── 79-word-search.cpp ├── NOTES.md └── README.md ├── 81-search-in-rotated-sorted-array-ii ├── 81-search-in-rotated-sorted-array-ii.cpp ├── NOTES.md └── README.md ├── 844-backspace-string-compare ├── 844-backspace-string-compare.cpp ├── NOTES.md └── README.md ├── 852-peak-index-in-a-mountain-array ├── 852-peak-index-in-a-mountain-array.cpp ├── NOTES.md └── README.md ├── 856-score-of-parentheses ├── 856-score-of-parentheses.cpp ├── NOTES.md └── README.md ├── 867-transpose-matrix ├── 867-transpose-matrix.cpp ├── NOTES.md └── README.md ├── 881-boats-to-save-people ├── 881-boats-to-save-people.cpp ├── NOTES.md └── README.md ├── 889-construct-binary-tree-from-preorder-and-postorder-traversal ├── 889-construct-binary-tree-from-preorder-and-postorder-traversal.cpp ├── NOTES.md └── README.md ├── 895-maximum-frequency-stack ├── 895-maximum-frequency-stack.cpp ├── NOTES.md └── README.md ├── 897-increasing-order-search-tree ├── 897-increasing-order-search-tree.cpp ├── NOTES.md └── README.md ├── 9-palindrome-number ├── 9-palindrome-number.cpp ├── NOTES.md └── README.md ├── 905-sort-array-by-parity ├── 905-sort-array-by-parity.cpp ├── NOTES.md └── README.md ├── 909-snakes-and-ladders ├── 909-snakes-and-ladders.cpp ├── NOTES.md └── README.md ├── 923-3sum-with-multiplicity ├── 923-3sum-with-multiplicity.cpp ├── NOTES.md └── README.md ├── 934-shortest-bridge ├── 934-shortest-bridge.cpp ├── NOTES.md └── README.md ├── 938-range-sum-of-bst ├── 938-range-sum-of-bst.cpp ├── NOTES.md └── README.md ├── 946-validate-stack-sequences ├── 946-validate-stack-sequences.cpp ├── NOTES.md └── README.md ├── 95-unique-binary-search-trees-ii ├── 95-unique-binary-search-trees-ii.cpp ├── NOTES.md └── README.md ├── 96-unique-binary-search-trees ├── 96-unique-binary-search-trees.cpp ├── NOTES.md └── README.md ├── 97-interleaving-string ├── 97-interleaving-string.cpp ├── NOTES.md └── README.md ├── 977-squares-of-a-sorted-array ├── 977-squares-of-a-sorted-array.cpp ├── NOTES.md └── README.md ├── 98-validate-binary-search-tree ├── 98-validate-binary-search-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 /0945-snakes-and-ladders/0945-snakes-and-ladders.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/0945-snakes-and-ladders/0945-snakes-and-ladders.cpp -------------------------------------------------------------------------------- /0945-snakes-and-ladders/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/0945-snakes-and-ladders/README.md -------------------------------------------------------------------------------- /1007-minimum-domino-rotations-for-equal-row/1007-minimum-domino-rotations-for-equal-row.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1007-minimum-domino-rotations-for-equal-row/1007-minimum-domino-rotations-for-equal-row.cpp -------------------------------------------------------------------------------- /1007-minimum-domino-rotations-for-equal-row/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1007-minimum-domino-rotations-for-equal-row/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1007-minimum-domino-rotations-for-equal-row/README.md -------------------------------------------------------------------------------- /1008-construct-binary-search-tree-from-preorder-traversal/1008-construct-binary-search-tree-from-preorder-traversal.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1008-construct-binary-search-tree-from-preorder-traversal/1008-construct-binary-search-tree-from-preorder-traversal.cpp -------------------------------------------------------------------------------- /1008-construct-binary-search-tree-from-preorder-traversal/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1008-construct-binary-search-tree-from-preorder-traversal/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1008-construct-binary-search-tree-from-preorder-traversal/README.md -------------------------------------------------------------------------------- /1010-pairs-of-songs-with-total-durations-divisible-by-60/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1010-pairs-of-songs-with-total-durations-divisible-by-60/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1010-pairs-of-songs-with-total-durations-divisible-by-60/README.md -------------------------------------------------------------------------------- /1013-partition-array-into-three-parts-with-equal-sum/1013-partition-array-into-three-parts-with-equal-sum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1013-partition-array-into-three-parts-with-equal-sum/1013-partition-array-into-three-parts-with-equal-sum.cpp -------------------------------------------------------------------------------- /1013-partition-array-into-three-parts-with-equal-sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1013-partition-array-into-three-parts-with-equal-sum/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1013-partition-array-into-three-parts-with-equal-sum/README.md -------------------------------------------------------------------------------- /102-binary-tree-level-order-traversal/102-binary-tree-level-order-traversal.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/102-binary-tree-level-order-traversal/102-binary-tree-level-order-traversal.cpp -------------------------------------------------------------------------------- /102-binary-tree-level-order-traversal/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /102-binary-tree-level-order-traversal/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/102-binary-tree-level-order-traversal/README.md -------------------------------------------------------------------------------- /1029-two-city-scheduling/1029-two-city-scheduling.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/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/pawan2806/LeetCode/HEAD/1029-two-city-scheduling/README.md -------------------------------------------------------------------------------- /1046-last-stone-weight/1046-last-stone-weight.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1046-last-stone-weight/1046-last-stone-weight.cpp -------------------------------------------------------------------------------- /1046-last-stone-weight/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1046-last-stone-weight/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1046-last-stone-weight/README.md -------------------------------------------------------------------------------- /108-convert-sorted-array-to-binary-search-tree/108-convert-sorted-array-to-binary-search-tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/108-convert-sorted-array-to-binary-search-tree/108-convert-sorted-array-to-binary-search-tree.cpp -------------------------------------------------------------------------------- /108-convert-sorted-array-to-binary-search-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /108-convert-sorted-array-to-binary-search-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/108-convert-sorted-array-to-binary-search-tree/README.md -------------------------------------------------------------------------------- /109-convert-sorted-list-to-binary-search-tree/109-convert-sorted-list-to-binary-search-tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/109-convert-sorted-list-to-binary-search-tree/109-convert-sorted-list-to-binary-search-tree.cpp -------------------------------------------------------------------------------- /109-convert-sorted-list-to-binary-search-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /109-convert-sorted-list-to-binary-search-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/109-convert-sorted-list-to-binary-search-tree/README.md -------------------------------------------------------------------------------- /1091-shortest-path-in-binary-matrix/1091-shortest-path-in-binary-matrix.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1091-shortest-path-in-binary-matrix/1091-shortest-path-in-binary-matrix.cpp -------------------------------------------------------------------------------- /1091-shortest-path-in-binary-matrix/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1091-shortest-path-in-binary-matrix/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1091-shortest-path-in-binary-matrix/README.md -------------------------------------------------------------------------------- /1094-car-pooling/1094-car-pooling.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1094-car-pooling/1094-car-pooling.cpp -------------------------------------------------------------------------------- /1094-car-pooling/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1094-car-pooling/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1094-car-pooling/README.md -------------------------------------------------------------------------------- /11-container-with-most-water/11-container-with-most-water.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/11-container-with-most-water/11-container-with-most-water.cpp -------------------------------------------------------------------------------- /11-container-with-most-water/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /11-container-with-most-water/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/11-container-with-most-water/README.md -------------------------------------------------------------------------------- /110-balanced-binary-tree/110-balanced-binary-tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/110-balanced-binary-tree/110-balanced-binary-tree.cpp -------------------------------------------------------------------------------- /110-balanced-binary-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /110-balanced-binary-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/110-balanced-binary-tree/README.md -------------------------------------------------------------------------------- /1131-maximum-of-absolute-value-expression/1131-maximum-of-absolute-value-expression.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1131-maximum-of-absolute-value-expression/1131-maximum-of-absolute-value-expression.cpp -------------------------------------------------------------------------------- /1131-maximum-of-absolute-value-expression/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1131-maximum-of-absolute-value-expression/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1131-maximum-of-absolute-value-expression/README.md -------------------------------------------------------------------------------- /1143-longest-common-subsequence/1143-longest-common-subsequence.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1143-longest-common-subsequence/1143-longest-common-subsequence.cpp -------------------------------------------------------------------------------- /1143-longest-common-subsequence/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1143-longest-common-subsequence/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1143-longest-common-subsequence/README.md -------------------------------------------------------------------------------- /1146-snapshot-array/1146-snapshot-array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1146-snapshot-array/1146-snapshot-array.cpp -------------------------------------------------------------------------------- /1146-snapshot-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1146-snapshot-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1146-snapshot-array/README.md -------------------------------------------------------------------------------- /115-distinct-subsequences/115-distinct-subsequences.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/115-distinct-subsequences/115-distinct-subsequences.cpp -------------------------------------------------------------------------------- /115-distinct-subsequences/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /115-distinct-subsequences/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/115-distinct-subsequences/README.md -------------------------------------------------------------------------------- /116-populating-next-right-pointers-in-each-node/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /116-populating-next-right-pointers-in-each-node/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/116-populating-next-right-pointers-in-each-node/README.md -------------------------------------------------------------------------------- /117-populating-next-right-pointers-in-each-node-ii/117-populating-next-right-pointers-in-each-node-ii.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/117-populating-next-right-pointers-in-each-node-ii/117-populating-next-right-pointers-in-each-node-ii.cpp -------------------------------------------------------------------------------- /117-populating-next-right-pointers-in-each-node-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /117-populating-next-right-pointers-in-each-node-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/117-populating-next-right-pointers-in-each-node-ii/README.md -------------------------------------------------------------------------------- /119-pascals-triangle-ii/119-pascals-triangle-ii.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/119-pascals-triangle-ii/119-pascals-triangle-ii.cpp -------------------------------------------------------------------------------- /119-pascals-triangle-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /119-pascals-triangle-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/119-pascals-triangle-ii/README.md -------------------------------------------------------------------------------- /1192-critical-connections-in-a-network/1192-critical-connections-in-a-network.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1192-critical-connections-in-a-network/1192-critical-connections-in-a-network.cpp -------------------------------------------------------------------------------- /1192-critical-connections-in-a-network/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1192-critical-connections-in-a-network/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1192-critical-connections-in-a-network/README.md -------------------------------------------------------------------------------- /1202-smallest-string-with-swaps/1202-smallest-string-with-swaps.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1202-smallest-string-with-swaps/1202-smallest-string-with-swaps.cpp -------------------------------------------------------------------------------- /1202-smallest-string-with-swaps/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1202-smallest-string-with-swaps/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1202-smallest-string-with-swaps/README.md -------------------------------------------------------------------------------- /1207-unique-number-of-occurrences/1207-unique-number-of-occurrences.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1207-unique-number-of-occurrences/1207-unique-number-of-occurrences.cpp -------------------------------------------------------------------------------- /1207-unique-number-of-occurrences/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1207-unique-number-of-occurrences/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1207-unique-number-of-occurrences/README.md -------------------------------------------------------------------------------- /1209-remove-all-adjacent-duplicates-in-string-ii/1209-remove-all-adjacent-duplicates-in-string-ii.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1209-remove-all-adjacent-duplicates-in-string-ii/1209-remove-all-adjacent-duplicates-in-string-ii.cpp -------------------------------------------------------------------------------- /1209-remove-all-adjacent-duplicates-in-string-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1209-remove-all-adjacent-duplicates-in-string-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1209-remove-all-adjacent-duplicates-in-string-ii/README.md -------------------------------------------------------------------------------- /121-best-time-to-buy-and-sell-stock/121-best-time-to-buy-and-sell-stock.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/121-best-time-to-buy-and-sell-stock/121-best-time-to-buy-and-sell-stock.cpp -------------------------------------------------------------------------------- /121-best-time-to-buy-and-sell-stock/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /121-best-time-to-buy-and-sell-stock/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/121-best-time-to-buy-and-sell-stock/README.md -------------------------------------------------------------------------------- /1249-minimum-remove-to-make-valid-parentheses/1249-minimum-remove-to-make-valid-parentheses.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1249-minimum-remove-to-make-valid-parentheses/1249-minimum-remove-to-make-valid-parentheses.cpp -------------------------------------------------------------------------------- /1249-minimum-remove-to-make-valid-parentheses/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1249-minimum-remove-to-make-valid-parentheses/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1249-minimum-remove-to-make-valid-parentheses/README.md -------------------------------------------------------------------------------- /125-valid-palindrome/125-valid-palindrome.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/125-valid-palindrome/125-valid-palindrome.cpp -------------------------------------------------------------------------------- /125-valid-palindrome/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /125-valid-palindrome/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/125-valid-palindrome/README.md -------------------------------------------------------------------------------- /1260-shift-2d-grid/1260-shift-2d-grid.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/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/pawan2806/LeetCode/HEAD/1260-shift-2d-grid/README.md -------------------------------------------------------------------------------- /1266-minimum-time-visiting-all-points/1266-minimum-time-visiting-all-points.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1266-minimum-time-visiting-all-points/1266-minimum-time-visiting-all-points.cpp -------------------------------------------------------------------------------- /1266-minimum-time-visiting-all-points/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1266-minimum-time-visiting-all-points/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1266-minimum-time-visiting-all-points/README.md -------------------------------------------------------------------------------- /1275-find-winner-on-a-tic-tac-toe-game/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1275-find-winner-on-a-tic-tac-toe-game/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1275-find-winner-on-a-tic-tac-toe-game/README.md -------------------------------------------------------------------------------- /128-longest-consecutive-sequence/128-longest-consecutive-sequence.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/128-longest-consecutive-sequence/128-longest-consecutive-sequence.cpp -------------------------------------------------------------------------------- /128-longest-consecutive-sequence/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /128-longest-consecutive-sequence/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/128-longest-consecutive-sequence/README.md -------------------------------------------------------------------------------- /130-surrounded-regions/130-surrounded-regions.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/130-surrounded-regions/130-surrounded-regions.cpp -------------------------------------------------------------------------------- /130-surrounded-regions/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /130-surrounded-regions/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/130-surrounded-regions/README.md -------------------------------------------------------------------------------- /1326-minimum-number-of-taps-to-open-to-water-a-garden/1326-minimum-number-of-taps-to-open-to-water-a-garden.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1326-minimum-number-of-taps-to-open-to-water-a-garden/1326-minimum-number-of-taps-to-open-to-water-a-garden.cpp -------------------------------------------------------------------------------- /1326-minimum-number-of-taps-to-open-to-water-a-garden/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1326-minimum-number-of-taps-to-open-to-water-a-garden/README.md -------------------------------------------------------------------------------- /133-clone-graph/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /133-clone-graph/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/133-clone-graph/README.md -------------------------------------------------------------------------------- /1331-rank-transform-of-an-array/1331-rank-transform-of-an-array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1331-rank-transform-of-an-array/1331-rank-transform-of-an-array.cpp -------------------------------------------------------------------------------- /1331-rank-transform-of-an-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1331-rank-transform-of-an-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1331-rank-transform-of-an-array/README.md -------------------------------------------------------------------------------- /1337-the-k-weakest-rows-in-a-matrix/1337-the-k-weakest-rows-in-a-matrix.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1337-the-k-weakest-rows-in-a-matrix/1337-the-k-weakest-rows-in-a-matrix.cpp -------------------------------------------------------------------------------- /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/pawan2806/LeetCode/HEAD/1337-the-k-weakest-rows-in-a-matrix/README.md -------------------------------------------------------------------------------- /1342-number-of-steps-to-reduce-a-number-to-zero/1342-number-of-steps-to-reduce-a-number-to-zero.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1342-number-of-steps-to-reduce-a-number-to-zero/1342-number-of-steps-to-reduce-a-number-to-zero.cpp -------------------------------------------------------------------------------- /1342-number-of-steps-to-reduce-a-number-to-zero/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1342-number-of-steps-to-reduce-a-number-to-zero/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1342-number-of-steps-to-reduce-a-number-to-zero/README.md -------------------------------------------------------------------------------- /135-candy/135-candy.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/135-candy/135-candy.cpp -------------------------------------------------------------------------------- /135-candy/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /135-candy/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/135-candy/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: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/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 -------------------------------------------------------------------------------- /1379-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1379-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1379-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree/README.md -------------------------------------------------------------------------------- /1396-design-underground-system/1396-design-underground-system.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1396-design-underground-system/1396-design-underground-system.cpp -------------------------------------------------------------------------------- /1396-design-underground-system/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1396-design-underground-system/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1396-design-underground-system/README.md -------------------------------------------------------------------------------- /14-longest-common-prefix/14-longest-common-prefix.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/14-longest-common-prefix/14-longest-common-prefix.cpp -------------------------------------------------------------------------------- /14-longest-common-prefix/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /14-longest-common-prefix/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/14-longest-common-prefix/README.md -------------------------------------------------------------------------------- /1423-maximum-points-you-can-obtain-from-cards/1423-maximum-points-you-can-obtain-from-cards.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1423-maximum-points-you-can-obtain-from-cards/1423-maximum-points-you-can-obtain-from-cards.cpp -------------------------------------------------------------------------------- /1423-maximum-points-you-can-obtain-from-cards/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1423-maximum-points-you-can-obtain-from-cards/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1423-maximum-points-you-can-obtain-from-cards/README.md -------------------------------------------------------------------------------- /1424-diagonal-traverse-ii/1424-diagonal-traverse-ii.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1424-diagonal-traverse-ii/1424-diagonal-traverse-ii.cpp -------------------------------------------------------------------------------- /1424-diagonal-traverse-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1424-diagonal-traverse-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1424-diagonal-traverse-ii/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: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/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 -------------------------------------------------------------------------------- /1461-check-if-a-string-contains-all-binary-codes-of-size-k/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1461-check-if-a-string-contains-all-binary-codes-of-size-k/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1461-check-if-a-string-contains-all-binary-codes-of-size-k/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: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/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 -------------------------------------------------------------------------------- /1465-maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1465-maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1465-maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts/README.md -------------------------------------------------------------------------------- /1473-paint-house-iii/1473-paint-house-iii.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1473-paint-house-iii/1473-paint-house-iii.cpp -------------------------------------------------------------------------------- /1473-paint-house-iii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1473-paint-house-iii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1473-paint-house-iii/README.md -------------------------------------------------------------------------------- /1477-find-two-non-overlapping-sub-arrays-each-with-target-sum/1477-find-two-non-overlapping-sub-arrays-each-with-target-sum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1477-find-two-non-overlapping-sub-arrays-each-with-target-sum/1477-find-two-non-overlapping-sub-arrays-each-with-target-sum.cpp -------------------------------------------------------------------------------- /1477-find-two-non-overlapping-sub-arrays-each-with-target-sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1477-find-two-non-overlapping-sub-arrays-each-with-target-sum/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1477-find-two-non-overlapping-sub-arrays-each-with-target-sum/README.md -------------------------------------------------------------------------------- /1480-running-sum-of-1d-array/1480-running-sum-of-1d-array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1480-running-sum-of-1d-array/1480-running-sum-of-1d-array.cpp -------------------------------------------------------------------------------- /1480-running-sum-of-1d-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1480-running-sum-of-1d-array/README.md -------------------------------------------------------------------------------- /1482-minimum-number-of-days-to-make-m-bouquets/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1482-minimum-number-of-days-to-make-m-bouquets/README.md -------------------------------------------------------------------------------- /15-3sum/15-3sum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/15-3sum/15-3sum.cpp -------------------------------------------------------------------------------- /15-3sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /15-3sum/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/15-3sum/README.md -------------------------------------------------------------------------------- /151-reverse-words-in-a-string/151-reverse-words-in-a-string.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/151-reverse-words-in-a-string/151-reverse-words-in-a-string.cpp -------------------------------------------------------------------------------- /151-reverse-words-in-a-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /151-reverse-words-in-a-string/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/151-reverse-words-in-a-string/README.md -------------------------------------------------------------------------------- /152-maximum-product-subarray/152-maximum-product-subarray.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/152-maximum-product-subarray/152-maximum-product-subarray.cpp -------------------------------------------------------------------------------- /152-maximum-product-subarray/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /152-maximum-product-subarray/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/152-maximum-product-subarray/README.md -------------------------------------------------------------------------------- /1525-number-of-good-ways-to-split-a-string/1525-number-of-good-ways-to-split-a-string.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1525-number-of-good-ways-to-split-a-string/1525-number-of-good-ways-to-split-a-string.cpp -------------------------------------------------------------------------------- /1525-number-of-good-ways-to-split-a-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1525-number-of-good-ways-to-split-a-string/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1525-number-of-good-ways-to-split-a-string/README.md -------------------------------------------------------------------------------- /153-find-minimum-in-rotated-sorted-array/153-find-minimum-in-rotated-sorted-array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/153-find-minimum-in-rotated-sorted-array/153-find-minimum-in-rotated-sorted-array.cpp -------------------------------------------------------------------------------- /153-find-minimum-in-rotated-sorted-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /153-find-minimum-in-rotated-sorted-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/153-find-minimum-in-rotated-sorted-array/README.md -------------------------------------------------------------------------------- /1539-kth-missing-positive-number/1539-kth-missing-positive-number.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1539-kth-missing-positive-number/1539-kth-missing-positive-number.cpp -------------------------------------------------------------------------------- /1539-kth-missing-positive-number/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1539-kth-missing-positive-number/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1539-kth-missing-positive-number/README.md -------------------------------------------------------------------------------- /1584-min-cost-to-connect-all-points/1584-min-cost-to-connect-all-points.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1584-min-cost-to-connect-all-points/1584-min-cost-to-connect-all-points.cpp -------------------------------------------------------------------------------- /1584-min-cost-to-connect-all-points/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1584-min-cost-to-connect-all-points/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1584-min-cost-to-connect-all-points/README.md -------------------------------------------------------------------------------- /1588-sum-of-all-odd-length-subarrays/1588-sum-of-all-odd-length-subarrays.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1588-sum-of-all-odd-length-subarrays/1588-sum-of-all-odd-length-subarrays.cpp -------------------------------------------------------------------------------- /1588-sum-of-all-odd-length-subarrays/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1588-sum-of-all-odd-length-subarrays/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1588-sum-of-all-odd-length-subarrays/README.md -------------------------------------------------------------------------------- /16-3sum-closest/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /16-3sum-closest/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/16-3sum-closest/README.md -------------------------------------------------------------------------------- /1631-path-with-minimum-effort/1631-path-with-minimum-effort.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1631-path-with-minimum-effort/1631-path-with-minimum-effort.cpp -------------------------------------------------------------------------------- /1631-path-with-minimum-effort/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1631-path-with-minimum-effort/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1631-path-with-minimum-effort/README.md -------------------------------------------------------------------------------- /164-maximum-gap/164-maximum-gap.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/164-maximum-gap/164-maximum-gap.cpp -------------------------------------------------------------------------------- /164-maximum-gap/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /164-maximum-gap/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/164-maximum-gap/README.md -------------------------------------------------------------------------------- /1641-count-sorted-vowel-strings/1641-count-sorted-vowel-strings.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1641-count-sorted-vowel-strings/1641-count-sorted-vowel-strings.cpp -------------------------------------------------------------------------------- /1641-count-sorted-vowel-strings/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1641-count-sorted-vowel-strings/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1641-count-sorted-vowel-strings/README.md -------------------------------------------------------------------------------- /1663-smallest-string-with-a-given-numeric-value/1663-smallest-string-with-a-given-numeric-value.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1663-smallest-string-with-a-given-numeric-value/1663-smallest-string-with-a-given-numeric-value.cpp -------------------------------------------------------------------------------- /1663-smallest-string-with-a-given-numeric-value/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1663-smallest-string-with-a-given-numeric-value/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1663-smallest-string-with-a-given-numeric-value/README.md -------------------------------------------------------------------------------- /1679-max-number-of-k-sum-pairs/1679-max-number-of-k-sum-pairs.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1679-max-number-of-k-sum-pairs/1679-max-number-of-k-sum-pairs.cpp -------------------------------------------------------------------------------- /1679-max-number-of-k-sum-pairs/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1679-max-number-of-k-sum-pairs/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1679-max-number-of-k-sum-pairs/README.md -------------------------------------------------------------------------------- /168-excel-sheet-column-title/168-excel-sheet-column-title.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/168-excel-sheet-column-title/168-excel-sheet-column-title.cpp -------------------------------------------------------------------------------- /168-excel-sheet-column-title/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /168-excel-sheet-column-title/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/168-excel-sheet-column-title/README.md -------------------------------------------------------------------------------- /17-letter-combinations-of-a-phone-number/17-letter-combinations-of-a-phone-number.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/17-letter-combinations-of-a-phone-number/17-letter-combinations-of-a-phone-number.cpp -------------------------------------------------------------------------------- /17-letter-combinations-of-a-phone-number/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /17-letter-combinations-of-a-phone-number/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/17-letter-combinations-of-a-phone-number/README.md -------------------------------------------------------------------------------- /171-excel-sheet-column-number/171-excel-sheet-column-number.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/171-excel-sheet-column-number/171-excel-sheet-column-number.cpp -------------------------------------------------------------------------------- /171-excel-sheet-column-number/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /171-excel-sheet-column-number/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/171-excel-sheet-column-number/README.md -------------------------------------------------------------------------------- /172-factorial-trailing-zeroes/172-factorial-trailing-zeroes.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/172-factorial-trailing-zeroes/172-factorial-trailing-zeroes.cpp -------------------------------------------------------------------------------- /172-factorial-trailing-zeroes/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /172-factorial-trailing-zeroes/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/172-factorial-trailing-zeroes/README.md -------------------------------------------------------------------------------- /1721-swapping-nodes-in-a-linked-list/1721-swapping-nodes-in-a-linked-list.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1721-swapping-nodes-in-a-linked-list/1721-swapping-nodes-in-a-linked-list.cpp -------------------------------------------------------------------------------- /1721-swapping-nodes-in-a-linked-list/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1721-swapping-nodes-in-a-linked-list/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1721-swapping-nodes-in-a-linked-list/README.md -------------------------------------------------------------------------------- /173-binary-search-tree-iterator/173-binary-search-tree-iterator.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/173-binary-search-tree-iterator/173-binary-search-tree-iterator.cpp -------------------------------------------------------------------------------- /173-binary-search-tree-iterator/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /173-binary-search-tree-iterator/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/173-binary-search-tree-iterator/README.md -------------------------------------------------------------------------------- /179-largest-number/179-largest-number.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/179-largest-number/179-largest-number.cpp -------------------------------------------------------------------------------- /179-largest-number/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /179-largest-number/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/179-largest-number/README.md -------------------------------------------------------------------------------- /1793-maximum-score-of-a-good-subarray/1793-maximum-score-of-a-good-subarray.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1793-maximum-score-of-a-good-subarray/1793-maximum-score-of-a-good-subarray.cpp -------------------------------------------------------------------------------- /1793-maximum-score-of-a-good-subarray/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1793-maximum-score-of-a-good-subarray/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/1793-maximum-score-of-a-good-subarray/README.md -------------------------------------------------------------------------------- /18-4sum/18-4sum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/18-4sum/18-4sum.cpp -------------------------------------------------------------------------------- /18-4sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /18-4sum/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/18-4sum/README.md -------------------------------------------------------------------------------- /189-rotate-array/189-rotate-array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/189-rotate-array/189-rotate-array.cpp -------------------------------------------------------------------------------- /189-rotate-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /189-rotate-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/189-rotate-array/README.md -------------------------------------------------------------------------------- /191-number-of-1-bits/191-number-of-1-bits.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/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/pawan2806/LeetCode/HEAD/191-number-of-1-bits/README.md -------------------------------------------------------------------------------- /2-add-two-numbers/2-add-two-numbers.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/2-add-two-numbers/2-add-two-numbers.cpp -------------------------------------------------------------------------------- /2-add-two-numbers/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2-add-two-numbers/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/2-add-two-numbers/README.md -------------------------------------------------------------------------------- /2007-find-original-array-from-doubled-array/2007-find-original-array-from-doubled-array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/2007-find-original-array-from-doubled-array/2007-find-original-array-from-doubled-array.cpp -------------------------------------------------------------------------------- /2007-find-original-array-from-doubled-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2007-find-original-array-from-doubled-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/2007-find-original-array-from-doubled-array/README.md -------------------------------------------------------------------------------- /2013-detect-squares/2013-detect-squares.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/2013-detect-squares/2013-detect-squares.cpp -------------------------------------------------------------------------------- /2013-detect-squares/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2013-detect-squares/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/2013-detect-squares/README.md -------------------------------------------------------------------------------- /207-course-schedule/207-course-schedule.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/207-course-schedule/207-course-schedule.cpp -------------------------------------------------------------------------------- /207-course-schedule/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /207-course-schedule/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/207-course-schedule/README.md -------------------------------------------------------------------------------- /210-course-schedule-ii/210-course-schedule-ii.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/210-course-schedule-ii/210-course-schedule-ii.cpp -------------------------------------------------------------------------------- /210-course-schedule-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /210-course-schedule-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/210-course-schedule-ii/README.md -------------------------------------------------------------------------------- /2115-find-all-possible-recipes-from-given-supplies/2115-find-all-possible-recipes-from-given-supplies.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/2115-find-all-possible-recipes-from-given-supplies/2115-find-all-possible-recipes-from-given-supplies.cpp -------------------------------------------------------------------------------- /2115-find-all-possible-recipes-from-given-supplies/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2115-find-all-possible-recipes-from-given-supplies/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/2115-find-all-possible-recipes-from-given-supplies/README.md -------------------------------------------------------------------------------- /212-word-search-ii/212-word-search-ii.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/212-word-search-ii/212-word-search-ii.cpp -------------------------------------------------------------------------------- /212-word-search-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /212-word-search-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/212-word-search-ii/README.md -------------------------------------------------------------------------------- /2135-count-words-obtained-after-adding-a-letter/2135-count-words-obtained-after-adding-a-letter.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/2135-count-words-obtained-after-adding-a-letter/2135-count-words-obtained-after-adding-a-letter.cpp -------------------------------------------------------------------------------- /2135-count-words-obtained-after-adding-a-letter/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2135-count-words-obtained-after-adding-a-letter/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/2135-count-words-obtained-after-adding-a-letter/README.md -------------------------------------------------------------------------------- /215-kth-largest-element-in-an-array/215-kth-largest-element-in-an-array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/215-kth-largest-element-in-an-array/215-kth-largest-element-in-an-array.cpp -------------------------------------------------------------------------------- /215-kth-largest-element-in-an-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /215-kth-largest-element-in-an-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/215-kth-largest-element-in-an-array/README.md -------------------------------------------------------------------------------- /216-combination-sum-iii/216-combination-sum-iii.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/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/pawan2806/LeetCode/HEAD/216-combination-sum-iii/README.md -------------------------------------------------------------------------------- /225-implement-stack-using-queues/225-implement-stack-using-queues.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/225-implement-stack-using-queues/225-implement-stack-using-queues.cpp -------------------------------------------------------------------------------- /225-implement-stack-using-queues/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /225-implement-stack-using-queues/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/225-implement-stack-using-queues/README.md -------------------------------------------------------------------------------- /226-invert-binary-tree/226-invert-binary-tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/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/pawan2806/LeetCode/HEAD/226-invert-binary-tree/README.md -------------------------------------------------------------------------------- /229-majority-element-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /229-majority-element-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/229-majority-element-ii/README.md -------------------------------------------------------------------------------- /23-merge-k-sorted-lists/23-merge-k-sorted-lists.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/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/pawan2806/LeetCode/HEAD/23-merge-k-sorted-lists/README.md -------------------------------------------------------------------------------- /230-kth-smallest-element-in-a-bst/230-kth-smallest-element-in-a-bst.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/230-kth-smallest-element-in-a-bst/230-kth-smallest-element-in-a-bst.cpp -------------------------------------------------------------------------------- /230-kth-smallest-element-in-a-bst/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /230-kth-smallest-element-in-a-bst/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/230-kth-smallest-element-in-a-bst/README.md -------------------------------------------------------------------------------- /231-power-of-two/231-power-of-two.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/231-power-of-two/231-power-of-two.cpp -------------------------------------------------------------------------------- /231-power-of-two/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /231-power-of-two/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/231-power-of-two/README.md -------------------------------------------------------------------------------- /235-lowest-common-ancestor-of-a-binary-search-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /235-lowest-common-ancestor-of-a-binary-search-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/235-lowest-common-ancestor-of-a-binary-search-tree/README.md -------------------------------------------------------------------------------- /238-product-of-array-except-self/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /238-product-of-array-except-self/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/238-product-of-array-except-self/README.md -------------------------------------------------------------------------------- /239-sliding-window-maximum/239-sliding-window-maximum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/239-sliding-window-maximum/239-sliding-window-maximum.cpp -------------------------------------------------------------------------------- /239-sliding-window-maximum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /239-sliding-window-maximum/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/239-sliding-window-maximum/README.md -------------------------------------------------------------------------------- /25-reverse-nodes-in-k-group/25-reverse-nodes-in-k-group.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/25-reverse-nodes-in-k-group/25-reverse-nodes-in-k-group.cpp -------------------------------------------------------------------------------- /25-reverse-nodes-in-k-group/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /25-reverse-nodes-in-k-group/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/25-reverse-nodes-in-k-group/README.md -------------------------------------------------------------------------------- /26-remove-duplicates-from-sorted-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /26-remove-duplicates-from-sorted-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/26-remove-duplicates-from-sorted-array/README.md -------------------------------------------------------------------------------- /268-missing-number/268-missing-number.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/268-missing-number/268-missing-number.cpp -------------------------------------------------------------------------------- /268-missing-number/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /268-missing-number/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/268-missing-number/README.md -------------------------------------------------------------------------------- /28-implement-strstr/28-implement-strstr.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/28-implement-strstr/28-implement-strstr.cpp -------------------------------------------------------------------------------- /28-implement-strstr/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /28-implement-strstr/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/28-implement-strstr/README.md -------------------------------------------------------------------------------- /283-move-zeroes/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /283-move-zeroes/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/283-move-zeroes/README.md -------------------------------------------------------------------------------- /284-peeking-iterator/284-peeking-iterator.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/284-peeking-iterator/284-peeking-iterator.cpp -------------------------------------------------------------------------------- /284-peeking-iterator/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /284-peeking-iterator/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/284-peeking-iterator/README.md -------------------------------------------------------------------------------- /287-find-the-duplicate-number/287-find-the-duplicate-number.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/287-find-the-duplicate-number/287-find-the-duplicate-number.cpp -------------------------------------------------------------------------------- /287-find-the-duplicate-number/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /287-find-the-duplicate-number/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/287-find-the-duplicate-number/README.md -------------------------------------------------------------------------------- /289-game-of-life/289-game-of-life.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/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/pawan2806/LeetCode/HEAD/289-game-of-life/README.md -------------------------------------------------------------------------------- /29-divide-two-integers/29-divide-two-integers.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/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/pawan2806/LeetCode/HEAD/29-divide-two-integers/README.md -------------------------------------------------------------------------------- /3-longest-substring-without-repeating-characters/3-longest-substring-without-repeating-characters.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/3-longest-substring-without-repeating-characters/3-longest-substring-without-repeating-characters.cpp -------------------------------------------------------------------------------- /3-longest-substring-without-repeating-characters/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /3-longest-substring-without-repeating-characters/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/3-longest-substring-without-repeating-characters/README.md -------------------------------------------------------------------------------- /30-substring-with-concatenation-of-all-words/30-substring-with-concatenation-of-all-words.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/30-substring-with-concatenation-of-all-words/30-substring-with-concatenation-of-all-words.cpp -------------------------------------------------------------------------------- /30-substring-with-concatenation-of-all-words/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /30-substring-with-concatenation-of-all-words/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/30-substring-with-concatenation-of-all-words/README.md -------------------------------------------------------------------------------- /304-range-sum-query-2d-immutable/304-range-sum-query-2d-immutable.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/304-range-sum-query-2d-immutable/304-range-sum-query-2d-immutable.cpp -------------------------------------------------------------------------------- /304-range-sum-query-2d-immutable/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /304-range-sum-query-2d-immutable/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/304-range-sum-query-2d-immutable/README.md -------------------------------------------------------------------------------- /31-next-permutation/31-next-permutation.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/31-next-permutation/31-next-permutation.cpp -------------------------------------------------------------------------------- /31-next-permutation/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /31-next-permutation/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/31-next-permutation/README.md -------------------------------------------------------------------------------- /316-remove-duplicate-letters/316-remove-duplicate-letters.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/316-remove-duplicate-letters/316-remove-duplicate-letters.cpp -------------------------------------------------------------------------------- /316-remove-duplicate-letters/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /316-remove-duplicate-letters/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/316-remove-duplicate-letters/README.md -------------------------------------------------------------------------------- /318-maximum-product-of-word-lengths/318-maximum-product-of-word-lengths.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/318-maximum-product-of-word-lengths/318-maximum-product-of-word-lengths.cpp -------------------------------------------------------------------------------- /318-maximum-product-of-word-lengths/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /318-maximum-product-of-word-lengths/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/318-maximum-product-of-word-lengths/README.md -------------------------------------------------------------------------------- /32-longest-valid-parentheses/32-longest-valid-parentheses.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/32-longest-valid-parentheses/32-longest-valid-parentheses.cpp -------------------------------------------------------------------------------- /32-longest-valid-parentheses/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /32-longest-valid-parentheses/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/32-longest-valid-parentheses/README.md -------------------------------------------------------------------------------- /322-coin-change/322-coin-change.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/322-coin-change/322-coin-change.cpp -------------------------------------------------------------------------------- /322-coin-change/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /322-coin-change/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/322-coin-change/README.md -------------------------------------------------------------------------------- /329-longest-increasing-path-in-a-matrix/329-longest-increasing-path-in-a-matrix.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/329-longest-increasing-path-in-a-matrix/329-longest-increasing-path-in-a-matrix.cpp -------------------------------------------------------------------------------- /329-longest-increasing-path-in-a-matrix/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /329-longest-increasing-path-in-a-matrix/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/329-longest-increasing-path-in-a-matrix/README.md -------------------------------------------------------------------------------- /33-search-in-rotated-sorted-array/33-search-in-rotated-sorted-array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/33-search-in-rotated-sorted-array/33-search-in-rotated-sorted-array.cpp -------------------------------------------------------------------------------- /33-search-in-rotated-sorted-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /33-search-in-rotated-sorted-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/33-search-in-rotated-sorted-array/README.md -------------------------------------------------------------------------------- /341-flatten-nested-list-iterator/341-flatten-nested-list-iterator.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/341-flatten-nested-list-iterator/341-flatten-nested-list-iterator.cpp -------------------------------------------------------------------------------- /341-flatten-nested-list-iterator/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /341-flatten-nested-list-iterator/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/341-flatten-nested-list-iterator/README.md -------------------------------------------------------------------------------- /344-reverse-string/344-reverse-string.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/344-reverse-string/344-reverse-string.cpp -------------------------------------------------------------------------------- /344-reverse-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /344-reverse-string/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/344-reverse-string/README.md -------------------------------------------------------------------------------- /347-top-k-frequent-elements/347-top-k-frequent-elements.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/347-top-k-frequent-elements/347-top-k-frequent-elements.cpp -------------------------------------------------------------------------------- /347-top-k-frequent-elements/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /347-top-k-frequent-elements/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/347-top-k-frequent-elements/README.md -------------------------------------------------------------------------------- /354-russian-doll-envelopes/354-russian-doll-envelopes.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/354-russian-doll-envelopes/354-russian-doll-envelopes.cpp -------------------------------------------------------------------------------- /354-russian-doll-envelopes/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/354-russian-doll-envelopes/README.md -------------------------------------------------------------------------------- /37-sudoku-solver/37-sudoku-solver.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/37-sudoku-solver/37-sudoku-solver.cpp -------------------------------------------------------------------------------- /37-sudoku-solver/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /37-sudoku-solver/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/37-sudoku-solver/README.md -------------------------------------------------------------------------------- /38-count-and-say/38-count-and-say.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/38-count-and-say/38-count-and-say.cpp -------------------------------------------------------------------------------- /38-count-and-say/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /38-count-and-say/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/38-count-and-say/README.md -------------------------------------------------------------------------------- /381-insert-delete-getrandom-o1-duplicates-allowed/381-insert-delete-getrandom-o1-duplicates-allowed.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/381-insert-delete-getrandom-o1-duplicates-allowed/381-insert-delete-getrandom-o1-duplicates-allowed.cpp -------------------------------------------------------------------------------- /381-insert-delete-getrandom-o1-duplicates-allowed/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /381-insert-delete-getrandom-o1-duplicates-allowed/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/381-insert-delete-getrandom-o1-duplicates-allowed/README.md -------------------------------------------------------------------------------- /394-decode-string/394-decode-string.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/394-decode-string/394-decode-string.cpp -------------------------------------------------------------------------------- /394-decode-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /394-decode-string/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/394-decode-string/README.md -------------------------------------------------------------------------------- /399-evaluate-division/399-evaluate-division.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/399-evaluate-division/399-evaluate-division.cpp -------------------------------------------------------------------------------- /399-evaluate-division/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /399-evaluate-division/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/399-evaluate-division/README.md -------------------------------------------------------------------------------- /4-median-of-two-sorted-arrays/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /4-median-of-two-sorted-arrays/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/4-median-of-two-sorted-arrays/README.md -------------------------------------------------------------------------------- /404-sum-of-left-leaves/404-sum-of-left-leaves.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/404-sum-of-left-leaves/404-sum-of-left-leaves.cpp -------------------------------------------------------------------------------- /404-sum-of-left-leaves/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /404-sum-of-left-leaves/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/404-sum-of-left-leaves/README.md -------------------------------------------------------------------------------- /41-first-missing-positive/41-first-missing-positive.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/41-first-missing-positive/41-first-missing-positive.cpp -------------------------------------------------------------------------------- /41-first-missing-positive/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /41-first-missing-positive/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/41-first-missing-positive/README.md -------------------------------------------------------------------------------- /410-split-array-largest-sum/410-split-array-largest-sum.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/410-split-array-largest-sum/410-split-array-largest-sum.cpp -------------------------------------------------------------------------------- /410-split-array-largest-sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /410-split-array-largest-sum/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/410-split-array-largest-sum/README.md -------------------------------------------------------------------------------- /412-fizz-buzz/412-fizz-buzz.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/412-fizz-buzz/412-fizz-buzz.cpp -------------------------------------------------------------------------------- /412-fizz-buzz/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /412-fizz-buzz/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/412-fizz-buzz/README.md -------------------------------------------------------------------------------- /42-trapping-rain-water/42-trapping-rain-water.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/42-trapping-rain-water/42-trapping-rain-water.cpp -------------------------------------------------------------------------------- /42-trapping-rain-water/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /42-trapping-rain-water/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/42-trapping-rain-water/README.md -------------------------------------------------------------------------------- /44-wildcard-matching/44-wildcard-matching.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/44-wildcard-matching/44-wildcard-matching.cpp -------------------------------------------------------------------------------- /44-wildcard-matching/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /44-wildcard-matching/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/44-wildcard-matching/README.md -------------------------------------------------------------------------------- /456-132-pattern/456-132-pattern.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/456-132-pattern/456-132-pattern.cpp -------------------------------------------------------------------------------- /456-132-pattern/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /456-132-pattern/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/456-132-pattern/README.md -------------------------------------------------------------------------------- /47-permutations-ii/47-permutations-ii.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/47-permutations-ii/47-permutations-ii.cpp -------------------------------------------------------------------------------- /47-permutations-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/47-permutations-ii/README.md -------------------------------------------------------------------------------- /474-ones-and-zeroes/474-ones-and-zeroes.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/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/pawan2806/LeetCode/HEAD/474-ones-and-zeroes/README.md -------------------------------------------------------------------------------- /477-total-hamming-distance/477-total-hamming-distance.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/477-total-hamming-distance/477-total-hamming-distance.cpp -------------------------------------------------------------------------------- /477-total-hamming-distance/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /477-total-hamming-distance/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/477-total-hamming-distance/README.md -------------------------------------------------------------------------------- /48-rotate-image/48-rotate-image.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/48-rotate-image/48-rotate-image.cpp -------------------------------------------------------------------------------- /48-rotate-image/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /48-rotate-image/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/48-rotate-image/README.md -------------------------------------------------------------------------------- /5-longest-palindromic-substring/5-longest-palindromic-substring.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/5-longest-palindromic-substring/5-longest-palindromic-substring.cpp -------------------------------------------------------------------------------- /5-longest-palindromic-substring/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /5-longest-palindromic-substring/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/5-longest-palindromic-substring/README.md -------------------------------------------------------------------------------- /509-fibonacci-number/509-fibonacci-number.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/509-fibonacci-number/509-fibonacci-number.cpp -------------------------------------------------------------------------------- /509-fibonacci-number/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /509-fibonacci-number/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/509-fibonacci-number/README.md -------------------------------------------------------------------------------- /51-n-queens/51-n-queens.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/51-n-queens/51-n-queens.cpp -------------------------------------------------------------------------------- /51-n-queens/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /51-n-queens/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/51-n-queens/README.md -------------------------------------------------------------------------------- /53-maximum-subarray/53-maximum-subarray.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/53-maximum-subarray/53-maximum-subarray.cpp -------------------------------------------------------------------------------- /53-maximum-subarray/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /53-maximum-subarray/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/53-maximum-subarray/README.md -------------------------------------------------------------------------------- /532-k-diff-pairs-in-an-array/532-k-diff-pairs-in-an-array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/532-k-diff-pairs-in-an-array/532-k-diff-pairs-in-an-array.cpp -------------------------------------------------------------------------------- /532-k-diff-pairs-in-an-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /532-k-diff-pairs-in-an-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/532-k-diff-pairs-in-an-array/README.md -------------------------------------------------------------------------------- /535-encode-and-decode-tinyurl/535-encode-and-decode-tinyurl.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/535-encode-and-decode-tinyurl/535-encode-and-decode-tinyurl.cpp -------------------------------------------------------------------------------- /535-encode-and-decode-tinyurl/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /535-encode-and-decode-tinyurl/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/535-encode-and-decode-tinyurl/README.md -------------------------------------------------------------------------------- /538-convert-bst-to-greater-tree/538-convert-bst-to-greater-tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/538-convert-bst-to-greater-tree/538-convert-bst-to-greater-tree.cpp -------------------------------------------------------------------------------- /538-convert-bst-to-greater-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /538-convert-bst-to-greater-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/538-convert-bst-to-greater-tree/README.md -------------------------------------------------------------------------------- /547-number-of-provinces/547-number-of-provinces.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/547-number-of-provinces/547-number-of-provinces.cpp -------------------------------------------------------------------------------- /547-number-of-provinces/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /547-number-of-provinces/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/547-number-of-provinces/README.md -------------------------------------------------------------------------------- /55-jump-game/55-jump-game.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/55-jump-game/55-jump-game.cpp -------------------------------------------------------------------------------- /55-jump-game/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /55-jump-game/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/55-jump-game/README.md -------------------------------------------------------------------------------- /56-merge-intervals/56-merge-intervals.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/56-merge-intervals/56-merge-intervals.cpp -------------------------------------------------------------------------------- /56-merge-intervals/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /56-merge-intervals/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/56-merge-intervals/README.md -------------------------------------------------------------------------------- /560-subarray-sum-equals-k/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /560-subarray-sum-equals-k/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/560-subarray-sum-equals-k/README.md -------------------------------------------------------------------------------- /57-insert-interval/57-insert-interval.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/57-insert-interval/57-insert-interval.cpp -------------------------------------------------------------------------------- /57-insert-interval/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /57-insert-interval/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/57-insert-interval/README.md -------------------------------------------------------------------------------- /572-subtree-of-another-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /572-subtree-of-another-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/572-subtree-of-another-tree/README.md -------------------------------------------------------------------------------- /58-length-of-last-word/58-length-of-last-word.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/58-length-of-last-word/58-length-of-last-word.cpp -------------------------------------------------------------------------------- /58-length-of-last-word/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /58-length-of-last-word/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/58-length-of-last-word/README.md -------------------------------------------------------------------------------- /581-shortest-unsorted-continuous-subarray/581-shortest-unsorted-continuous-subarray.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/581-shortest-unsorted-continuous-subarray/581-shortest-unsorted-continuous-subarray.cpp -------------------------------------------------------------------------------- /581-shortest-unsorted-continuous-subarray/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /581-shortest-unsorted-continuous-subarray/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/581-shortest-unsorted-continuous-subarray/README.md -------------------------------------------------------------------------------- /59-spiral-matrix-ii/59-spiral-matrix-ii.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/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/pawan2806/LeetCode/HEAD/59-spiral-matrix-ii/README.md -------------------------------------------------------------------------------- /617-merge-two-binary-trees/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /617-merge-two-binary-trees/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/617-merge-two-binary-trees/README.md -------------------------------------------------------------------------------- /62-unique-paths/62-unique-paths.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/62-unique-paths/62-unique-paths.cpp -------------------------------------------------------------------------------- /62-unique-paths/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /62-unique-paths/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/62-unique-paths/README.md -------------------------------------------------------------------------------- /63-unique-paths-ii/63-unique-paths-ii.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/63-unique-paths-ii/63-unique-paths-ii.cpp -------------------------------------------------------------------------------- /63-unique-paths-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /63-unique-paths-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/63-unique-paths-ii/README.md -------------------------------------------------------------------------------- /632-smallest-range-covering-elements-from-k-lists/632-smallest-range-covering-elements-from-k-lists.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/632-smallest-range-covering-elements-from-k-lists/632-smallest-range-covering-elements-from-k-lists.cpp -------------------------------------------------------------------------------- /632-smallest-range-covering-elements-from-k-lists/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /632-smallest-range-covering-elements-from-k-lists/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/632-smallest-range-covering-elements-from-k-lists/README.md -------------------------------------------------------------------------------- /66-plus-one/66-plus-one.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/66-plus-one/66-plus-one.cpp -------------------------------------------------------------------------------- /66-plus-one/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /66-plus-one/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/66-plus-one/README.md -------------------------------------------------------------------------------- /662-maximum-width-of-binary-tree/662-maximum-width-of-binary-tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/662-maximum-width-of-binary-tree/662-maximum-width-of-binary-tree.cpp -------------------------------------------------------------------------------- /662-maximum-width-of-binary-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /662-maximum-width-of-binary-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/662-maximum-width-of-binary-tree/README.md -------------------------------------------------------------------------------- /669-trim-a-binary-search-tree/669-trim-a-binary-search-tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/669-trim-a-binary-search-tree/669-trim-a-binary-search-tree.cpp -------------------------------------------------------------------------------- /669-trim-a-binary-search-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /669-trim-a-binary-search-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/669-trim-a-binary-search-tree/README.md -------------------------------------------------------------------------------- /680-valid-palindrome-ii/680-valid-palindrome-ii.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/680-valid-palindrome-ii/680-valid-palindrome-ii.cpp -------------------------------------------------------------------------------- /680-valid-palindrome-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /680-valid-palindrome-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/680-valid-palindrome-ii/README.md -------------------------------------------------------------------------------- /682-baseball-game/682-baseball-game.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/682-baseball-game/682-baseball-game.cpp -------------------------------------------------------------------------------- /682-baseball-game/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /682-baseball-game/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/682-baseball-game/README.md -------------------------------------------------------------------------------- /7-reverse-integer/7-reverse-integer.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/7-reverse-integer/7-reverse-integer.cpp -------------------------------------------------------------------------------- /7-reverse-integer/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /7-reverse-integer/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/7-reverse-integer/README.md -------------------------------------------------------------------------------- /700-search-in-a-binary-search-tree/700-search-in-a-binary-search-tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/700-search-in-a-binary-search-tree/700-search-in-a-binary-search-tree.cpp -------------------------------------------------------------------------------- /700-search-in-a-binary-search-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /700-search-in-a-binary-search-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/700-search-in-a-binary-search-tree/README.md -------------------------------------------------------------------------------- /703-kth-largest-element-in-a-stream/703-kth-largest-element-in-a-stream.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/703-kth-largest-element-in-a-stream/703-kth-largest-element-in-a-stream.cpp -------------------------------------------------------------------------------- /703-kth-largest-element-in-a-stream/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/703-kth-largest-element-in-a-stream/README.md -------------------------------------------------------------------------------- /704-binary-search/704-binary-search.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/704-binary-search/704-binary-search.cpp -------------------------------------------------------------------------------- /704-binary-search/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /704-binary-search/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/704-binary-search/README.md -------------------------------------------------------------------------------- /705-design-hashset/705-design-hashset.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/705-design-hashset/705-design-hashset.cpp -------------------------------------------------------------------------------- /705-design-hashset/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /705-design-hashset/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/705-design-hashset/README.md -------------------------------------------------------------------------------- /706-design-hashmap/706-design-hashmap.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/706-design-hashmap/706-design-hashmap.cpp -------------------------------------------------------------------------------- /706-design-hashmap/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /706-design-hashmap/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/706-design-hashmap/README.md -------------------------------------------------------------------------------- /71-simplify-path/71-simplify-path.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/71-simplify-path/71-simplify-path.cpp -------------------------------------------------------------------------------- /71-simplify-path/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /71-simplify-path/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/71-simplify-path/README.md -------------------------------------------------------------------------------- /72-edit-distance/72-edit-distance.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/72-edit-distance/72-edit-distance.cpp -------------------------------------------------------------------------------- /72-edit-distance/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /72-edit-distance/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/72-edit-distance/README.md -------------------------------------------------------------------------------- /724-find-pivot-index/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /724-find-pivot-index/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/724-find-pivot-index/README.md -------------------------------------------------------------------------------- /73-set-matrix-zeroes/73-set-matrix-zeroes.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/73-set-matrix-zeroes/73-set-matrix-zeroes.cpp -------------------------------------------------------------------------------- /73-set-matrix-zeroes/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /73-set-matrix-zeroes/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/73-set-matrix-zeroes/README.md -------------------------------------------------------------------------------- /74-search-a-2d-matrix/74-search-a-2d-matrix.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/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/pawan2806/LeetCode/HEAD/74-search-a-2d-matrix/README.md -------------------------------------------------------------------------------- /743-network-delay-time/743-network-delay-time.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/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/pawan2806/LeetCode/HEAD/743-network-delay-time/README.md -------------------------------------------------------------------------------- /754-reach-a-number/754-reach-a-number.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/754-reach-a-number/754-reach-a-number.cpp -------------------------------------------------------------------------------- /754-reach-a-number/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /754-reach-a-number/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/754-reach-a-number/README.md -------------------------------------------------------------------------------- /76-minimum-window-substring/76-minimum-window-substring.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/76-minimum-window-substring/76-minimum-window-substring.cpp -------------------------------------------------------------------------------- /76-minimum-window-substring/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /76-minimum-window-substring/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/76-minimum-window-substring/README.md -------------------------------------------------------------------------------- /763-partition-labels/763-partition-labels.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/763-partition-labels/763-partition-labels.cpp -------------------------------------------------------------------------------- /763-partition-labels/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /763-partition-labels/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/763-partition-labels/README.md -------------------------------------------------------------------------------- /78-subsets/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /78-subsets/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/78-subsets/README.md -------------------------------------------------------------------------------- /785-is-graph-bipartite/785-is-graph-bipartite.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/785-is-graph-bipartite/785-is-graph-bipartite.cpp -------------------------------------------------------------------------------- /785-is-graph-bipartite/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/785-is-graph-bipartite/README.md -------------------------------------------------------------------------------- /79-word-search/79-word-search.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/79-word-search/79-word-search.cpp -------------------------------------------------------------------------------- /79-word-search/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /79-word-search/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/79-word-search/README.md -------------------------------------------------------------------------------- /81-search-in-rotated-sorted-array-ii/81-search-in-rotated-sorted-array-ii.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/81-search-in-rotated-sorted-array-ii/81-search-in-rotated-sorted-array-ii.cpp -------------------------------------------------------------------------------- /81-search-in-rotated-sorted-array-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /81-search-in-rotated-sorted-array-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/81-search-in-rotated-sorted-array-ii/README.md -------------------------------------------------------------------------------- /844-backspace-string-compare/844-backspace-string-compare.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/844-backspace-string-compare/844-backspace-string-compare.cpp -------------------------------------------------------------------------------- /844-backspace-string-compare/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /844-backspace-string-compare/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/844-backspace-string-compare/README.md -------------------------------------------------------------------------------- /852-peak-index-in-a-mountain-array/852-peak-index-in-a-mountain-array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/852-peak-index-in-a-mountain-array/852-peak-index-in-a-mountain-array.cpp -------------------------------------------------------------------------------- /852-peak-index-in-a-mountain-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /852-peak-index-in-a-mountain-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/852-peak-index-in-a-mountain-array/README.md -------------------------------------------------------------------------------- /856-score-of-parentheses/856-score-of-parentheses.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/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/pawan2806/LeetCode/HEAD/856-score-of-parentheses/README.md -------------------------------------------------------------------------------- /867-transpose-matrix/867-transpose-matrix.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/867-transpose-matrix/867-transpose-matrix.cpp -------------------------------------------------------------------------------- /867-transpose-matrix/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /867-transpose-matrix/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/867-transpose-matrix/README.md -------------------------------------------------------------------------------- /881-boats-to-save-people/881-boats-to-save-people.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/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/pawan2806/LeetCode/HEAD/881-boats-to-save-people/README.md -------------------------------------------------------------------------------- /889-construct-binary-tree-from-preorder-and-postorder-traversal/889-construct-binary-tree-from-preorder-and-postorder-traversal.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/889-construct-binary-tree-from-preorder-and-postorder-traversal/889-construct-binary-tree-from-preorder-and-postorder-traversal.cpp -------------------------------------------------------------------------------- /889-construct-binary-tree-from-preorder-and-postorder-traversal/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /889-construct-binary-tree-from-preorder-and-postorder-traversal/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/889-construct-binary-tree-from-preorder-and-postorder-traversal/README.md -------------------------------------------------------------------------------- /895-maximum-frequency-stack/895-maximum-frequency-stack.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/895-maximum-frequency-stack/895-maximum-frequency-stack.cpp -------------------------------------------------------------------------------- /895-maximum-frequency-stack/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /895-maximum-frequency-stack/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/895-maximum-frequency-stack/README.md -------------------------------------------------------------------------------- /897-increasing-order-search-tree/897-increasing-order-search-tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/897-increasing-order-search-tree/897-increasing-order-search-tree.cpp -------------------------------------------------------------------------------- /897-increasing-order-search-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /897-increasing-order-search-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/897-increasing-order-search-tree/README.md -------------------------------------------------------------------------------- /9-palindrome-number/9-palindrome-number.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/9-palindrome-number/9-palindrome-number.cpp -------------------------------------------------------------------------------- /9-palindrome-number/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /9-palindrome-number/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/9-palindrome-number/README.md -------------------------------------------------------------------------------- /905-sort-array-by-parity/905-sort-array-by-parity.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/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/pawan2806/LeetCode/HEAD/905-sort-array-by-parity/README.md -------------------------------------------------------------------------------- /909-snakes-and-ladders/909-snakes-and-ladders.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/909-snakes-and-ladders/909-snakes-and-ladders.cpp -------------------------------------------------------------------------------- /909-snakes-and-ladders/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /909-snakes-and-ladders/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/909-snakes-and-ladders/README.md -------------------------------------------------------------------------------- /923-3sum-with-multiplicity/923-3sum-with-multiplicity.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/923-3sum-with-multiplicity/923-3sum-with-multiplicity.cpp -------------------------------------------------------------------------------- /923-3sum-with-multiplicity/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /923-3sum-with-multiplicity/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/923-3sum-with-multiplicity/README.md -------------------------------------------------------------------------------- /934-shortest-bridge/934-shortest-bridge.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/934-shortest-bridge/934-shortest-bridge.cpp -------------------------------------------------------------------------------- /934-shortest-bridge/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /934-shortest-bridge/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/934-shortest-bridge/README.md -------------------------------------------------------------------------------- /938-range-sum-of-bst/938-range-sum-of-bst.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/938-range-sum-of-bst/938-range-sum-of-bst.cpp -------------------------------------------------------------------------------- /938-range-sum-of-bst/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /938-range-sum-of-bst/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/938-range-sum-of-bst/README.md -------------------------------------------------------------------------------- /946-validate-stack-sequences/946-validate-stack-sequences.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/946-validate-stack-sequences/946-validate-stack-sequences.cpp -------------------------------------------------------------------------------- /946-validate-stack-sequences/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /946-validate-stack-sequences/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/946-validate-stack-sequences/README.md -------------------------------------------------------------------------------- /95-unique-binary-search-trees-ii/95-unique-binary-search-trees-ii.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/95-unique-binary-search-trees-ii/95-unique-binary-search-trees-ii.cpp -------------------------------------------------------------------------------- /95-unique-binary-search-trees-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /95-unique-binary-search-trees-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/95-unique-binary-search-trees-ii/README.md -------------------------------------------------------------------------------- /96-unique-binary-search-trees/96-unique-binary-search-trees.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/96-unique-binary-search-trees/96-unique-binary-search-trees.cpp -------------------------------------------------------------------------------- /96-unique-binary-search-trees/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /96-unique-binary-search-trees/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/96-unique-binary-search-trees/README.md -------------------------------------------------------------------------------- /97-interleaving-string/97-interleaving-string.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/97-interleaving-string/97-interleaving-string.cpp -------------------------------------------------------------------------------- /97-interleaving-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /97-interleaving-string/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/97-interleaving-string/README.md -------------------------------------------------------------------------------- /977-squares-of-a-sorted-array/977-squares-of-a-sorted-array.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/977-squares-of-a-sorted-array/977-squares-of-a-sorted-array.cpp -------------------------------------------------------------------------------- /977-squares-of-a-sorted-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /977-squares-of-a-sorted-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/977-squares-of-a-sorted-array/README.md -------------------------------------------------------------------------------- /98-validate-binary-search-tree/98-validate-binary-search-tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/98-validate-binary-search-tree/98-validate-binary-search-tree.cpp -------------------------------------------------------------------------------- /98-validate-binary-search-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /98-validate-binary-search-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/98-validate-binary-search-tree/README.md -------------------------------------------------------------------------------- /99-recover-binary-search-tree/99-recover-binary-search-tree.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/99-recover-binary-search-tree/99-recover-binary-search-tree.cpp -------------------------------------------------------------------------------- /99-recover-binary-search-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /99-recover-binary-search-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/99-recover-binary-search-tree/README.md -------------------------------------------------------------------------------- /991-broken-calculator/991-broken-calculator.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/991-broken-calculator/991-broken-calculator.cpp -------------------------------------------------------------------------------- /991-broken-calculator/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /991-broken-calculator/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/991-broken-calculator/README.md -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/pawan2806/LeetCode/HEAD/README.md --------------------------------------------------------------------------------