├── 0001-two-sum ├── 0001-two-sum.py ├── NOTES.md └── README.md ├── 0002-add-two-numbers ├── 0002-add-two-numbers.py └── README.md ├── 0003-longest-substring-without-repeating-characters ├── 0003-longest-substring-without-repeating-characters.py ├── NOTES.md └── README.md ├── 0004-median-of-two-sorted-arrays ├── 0004-median-of-two-sorted-arrays.py ├── NOTES.md └── README.md ├── 0005-longest-palindromic-substring ├── 0005-longest-palindromic-substring.py ├── NOTES.md └── README.md ├── 0006-zigzag-conversion ├── 0006-zigzag-conversion.py ├── NOTES.md └── README.md ├── 0014-longest-common-prefix ├── 0014-longest-common-prefix.py ├── NOTES.md └── README.md ├── 0017-letter-combinations-of-a-phone-number ├── 0017-letter-combinations-of-a-phone-number.py ├── NOTES.md └── README.md ├── 0018-4sum ├── 0018-4sum.py ├── NOTES.md └── README.md ├── 0019-remove-nth-node-from-end-of-list ├── 0019-remove-nth-node-from-end-of-list.py ├── NOTES.md └── README.md ├── 0020-valid-parentheses ├── 0020-valid-parentheses.py ├── NOTES.md └── README.md ├── 0021-merge-two-sorted-lists ├── 0021-merge-two-sorted-lists.py ├── NOTES.md └── README.md ├── 0022-generate-parentheses ├── 0022-generate-parentheses.py └── NOTES.md ├── 0023-merge-k-sorted-lists ├── 0023-merge-k-sorted-lists.py └── README.md ├── 0024-swap-nodes-in-pairs ├── 0024-swap-nodes-in-pairs.py ├── NOTES.md └── README.md ├── 0025-reverse-nodes-in-k-group ├── 0025-reverse-nodes-in-k-group.py ├── NOTES.md └── README.md ├── 0026-remove-duplicates-from-sorted-array ├── NOTES.md └── README.md ├── 0028-find-the-index-of-the-first-occurrence-in-a-string ├── 0028-find-the-index-of-the-first-occurrence-in-a-string.py ├── NOTES.md └── README.md ├── 0031-next-permutation ├── 0031-next-permutation.py ├── NOTES.md └── README.md ├── 0033-search-in-rotated-sorted-array ├── 0033-search-in-rotated-sorted-array.cpp ├── 0033-search-in-rotated-sorted-array.py ├── NOTES.md └── README.md ├── 0034-find-first-and-last-position-of-element-in-sorted-array ├── 0034-find-first-and-last-position-of-element-in-sorted-array.py ├── NOTES.md └── README.md ├── 0035-search-insert-position ├── 0035-search-insert-position.py ├── NOTES.md └── README.md ├── 0037-sudoku-solver ├── 0037-sudoku-solver.py └── README.md ├── 0039-combination-sum ├── 0039-combination-sum.py ├── NOTES.md └── README.md ├── 0041-first-missing-positive ├── 0041-first-missing-positive.py └── README.md ├── 0042-trapping-rain-water ├── 0042-trapping-rain-water.py ├── NOTES.md └── README.md ├── 0045-jump-game-ii ├── 0045-jump-game-ii.py ├── NOTES.md └── README.md ├── 0048-rotate-image ├── 0048-rotate-image.py ├── NOTES.md └── README.md ├── 0049-group-anagrams ├── 0049-group-anagrams.py ├── NOTES.md └── README.md ├── 0050-powx-n ├── 0050-powx-n.py └── NOTES.md ├── 0051-n-queens ├── 0051-n-queens.py ├── NOTES.md └── README.md ├── 0053-maximum-subarray ├── 0053-maximum-subarray.py ├── NOTES.md └── README.md ├── 0054-spiral-matrix ├── 0054-spiral-matrix.py ├── NOTES.md └── README.md ├── 0055-jump-game ├── 0055-jump-game.py ├── NOTES.md └── README.md ├── 0056-merge-intervals ├── 0056-merge-intervals.py ├── NOTES.md └── README.md ├── 0057-insert-interval ├── 0057-insert-interval.py ├── NOTES.md └── README.md ├── 0059-spiral-matrix-ii ├── 0059-spiral-matrix-ii.py ├── NOTES.md └── README.md ├── 0060-permutation-sequence ├── 0060-permutation-sequence.py ├── NOTES.md └── README.md ├── 0063-unique-paths-ii ├── 0063-unique-paths-ii.py └── README.md ├── 0064-minimum-path-sum ├── 0064-minimum-path-sum.py ├── NOTES.md └── README.md ├── 0067-add-binary ├── 0067-add-binary.py └── README.md ├── 0070-climbing-stairs ├── 0070-climbing-stairs.py └── README.md ├── 0071-simplify-path ├── 0071-simplify-path.py ├── NOTES.md └── README.md ├── 0072-edit-distance ├── 0072-edit-distance.py └── NOTES.md ├── 0073-set-matrix-zeroes ├── 0073-set-matrix-zeroes.py ├── NOTES.md └── README.md ├── 0074-search-a-2d-matrix ├── 0074-search-a-2d-matrix.py └── NOTES.md ├── 0075-sort-colors ├── 0075-sort-colors.py └── README.md ├── 0076-minimum-window-substring ├── 0076-minimum-window-substring.py ├── NOTES.md └── README.md ├── 0077-combinations ├── 0077-combinations.py ├── NOTES.md └── README.md ├── 0078-subsets ├── 0078-subsets.py ├── NOTES.md └── README.md ├── 0079-word-search ├── 0079-word-search.py ├── NOTES.md └── README.md ├── 0081-search-in-rotated-sorted-array-ii ├── 0081-search-in-rotated-sorted-array-ii.py ├── NOTES.md └── README.md ├── 0084-largest-rectangle-in-histogram ├── 0084-largest-rectangle-in-histogram.py └── README.md ├── 0085-maximal-rectangle ├── 0085-maximal-rectangle.py └── NOTES.md ├── 0086-partition-list ├── 0086-partition-list.py ├── NOTES.md └── README.md ├── 0087-scramble-string ├── 0087-scramble-string.py ├── NOTES.md └── README.md ├── 0088-merge-sorted-array ├── 0088-merge-sorted-array.py ├── NOTES.md └── README.md ├── 0090-subsets-ii ├── 0090-subsets-ii.py ├── NOTES.md └── README.md ├── 0093-restore-ip-addresses ├── 0093-restore-ip-addresses.py └── NOTES.md ├── 0094-binary-tree-inorder-traversal ├── 0094-binary-tree-inorder-traversal.py ├── NOTES.md └── README.md ├── 0095-unique-binary-search-trees-ii ├── 0095-unique-binary-search-trees-ii.py ├── NOTES.md └── README.md ├── 0098-validate-binary-search-tree ├── 0098-validate-binary-search-tree.py ├── NOTES.md └── README.md ├── 0100-same-tree ├── 0100-same-tree.py ├── NOTES.md └── README.md ├── 0101-symmetric-tree ├── 0101-symmetric-tree.py ├── NOTES.md └── README.md ├── 0102-binary-tree-level-order-traversal ├── 0102-binary-tree-level-order-traversal.py ├── NOTES.md └── README.md ├── 0103-binary-tree-zigzag-level-order-traversal ├── 0103-binary-tree-zigzag-level-order-traversal.py ├── NOTES.md └── README.md ├── 0104-maximum-depth-of-binary-tree ├── 0104-maximum-depth-of-binary-tree.py ├── NOTES.md └── README.md ├── 0105-construct-binary-tree-from-preorder-and-inorder-traversal ├── 0105-construct-binary-tree-from-preorder-and-inorder-traversal.py ├── NOTES.md └── README.md ├── 0106-construct-binary-tree-from-inorder-and-postorder-traversal ├── 0106-construct-binary-tree-from-inorder-and-postorder-traversal.py ├── NOTES.md └── README.md ├── 0109-convert-sorted-list-to-binary-search-tree ├── 0109-convert-sorted-list-to-binary-search-tree.py ├── NOTES.md └── README.md ├── 0110-balanced-binary-tree ├── 0110-balanced-binary-tree.py ├── NOTES.md └── README.md ├── 0111-minimum-depth-of-binary-tree ├── 0111-minimum-depth-of-binary-tree.py ├── NOTES.md └── README.md ├── 0114-flatten-binary-tree-to-linked-list ├── 0114-flatten-binary-tree-to-linked-list.py ├── NOTES.md └── README.md ├── 0118-pascals-triangle ├── 0118-pascals-triangle.py ├── NOTES.md └── README.md ├── 0119-pascals-triangle-ii ├── 0119-pascals-triangle-ii.py ├── NOTES.md └── README.md ├── 0121-best-time-to-buy-and-sell-stock ├── 0121-best-time-to-buy-and-sell-stock.py ├── NOTES.md └── README.md ├── 0124-binary-tree-maximum-path-sum ├── 0124-binary-tree-maximum-path-sum.py ├── NOTES.md └── README.md ├── 0128-longest-consecutive-sequence ├── 0128-longest-consecutive-sequence.py └── NOTES.md ├── 0129-sum-root-to-leaf-numbers ├── 0129-sum-root-to-leaf-numbers.py ├── NOTES.md └── README.md ├── 0131-palindrome-partitioning ├── 0131-palindrome-partitioning.py └── NOTES.md ├── 0133-clone-graph ├── 0133-clone-graph.py ├── NOTES.md └── README.md ├── 0134-gas-station ├── 0134-gas-station.py └── README.md ├── 0135-candy ├── 0135-candy.py ├── NOTES.md └── README.md ├── 0136-single-number ├── 0136-single-number.py ├── NOTES.md └── README.md ├── 0137-single-number-ii ├── 0137-single-number-ii.py └── NOTES.md ├── 0139-word-break ├── 0139-word-break.py └── NOTES.md ├── 0141-linked-list-cycle ├── 0141-linked-list-cycle.py ├── NOTES.md └── README.md ├── 0142-linked-list-cycle-ii ├── 0142-linked-list-cycle-ii.py └── NOTES.md ├── 0144-binary-tree-preorder-traversal ├── 0144-binary-tree-preorder-traversal.py ├── NOTES.md └── README.md ├── 0146-lru-cache ├── 0146-lru-cache.py └── NOTES.md ├── 0149-max-points-on-a-line ├── 0149-max-points-on-a-line.py └── NOTES.md ├── 0150-evaluate-reverse-polish-notation ├── 0150-evaluate-reverse-polish-notation.py ├── NOTES.md └── README.md ├── 0151-reverse-words-in-a-string ├── 0151-reverse-words-in-a-string.py ├── NOTES.md └── README.md ├── 0152-maximum-product-subarray ├── 0152-maximum-product-subarray.py ├── NOTES.md └── README.md ├── 0153-find-minimum-in-rotated-sorted-array ├── 0153-find-minimum-in-rotated-sorted-array.py ├── NOTES.md └── README.md ├── 0155-min-stack ├── 0155-min-stack.py ├── NOTES.md └── README.md ├── 0160-intersection-of-two-linked-lists ├── 0160-intersection-of-two-linked-lists.py └── NOTES.md ├── 0165-compare-version-numbers ├── 0165-compare-version-numbers.py ├── NOTES.md └── README.md ├── 0168-excel-sheet-column-title ├── 0168-excel-sheet-column-title.py └── README.md ├── 0189-rotate-array ├── 0189-rotate-array.py ├── NOTES.md └── README.md ├── 0197-rising-temperature └── NOTES.md ├── 0198-house-robber ├── 0198-house-robber.py ├── NOTES.md └── README.md ├── 0199-binary-tree-right-side-view ├── 0199-binary-tree-right-side-view.py ├── NOTES.md └── README.md ├── 0200-number-of-islands ├── 0200-number-of-islands.py ├── NOTES.md └── README.md ├── 0205-isomorphic-strings ├── 0205-isomorphic-strings.py ├── NOTES.md └── README.md ├── 0206-reverse-linked-list ├── 0206-reverse-linked-list.py ├── NOTES.md └── README.md ├── 0207-course-schedule ├── 0207-course-schedule.py ├── NOTES.md └── README.md ├── 0208-implement-trie-prefix-tree ├── 0208-implement-trie-prefix-tree.py └── README.md ├── 0209-minimum-size-subarray-sum ├── 0209-minimum-size-subarray-sum.py ├── NOTES.md └── README.md ├── 0211-design-add-and-search-words-data-structure ├── 0211-design-add-and-search-words-data-structure.py ├── NOTES.md └── README.md ├── 0212-word-search-ii ├── 0212-word-search-ii.py ├── NOTES.md └── README.md ├── 0221-maximal-square ├── 0221-maximal-square.py └── README.md ├── 0222-count-complete-tree-nodes ├── 0222-count-complete-tree-nodes.py ├── NOTES.md └── README.md ├── 0223-rectangle-area ├── 0223-rectangle-area.py ├── NOTES.md └── README.md ├── 0226-invert-binary-tree ├── 0226-invert-binary-tree.py ├── NOTES.md └── README.md ├── 0228-summary-ranges ├── 0228-summary-ranges.py ├── NOTES.md └── README.md ├── 0229-majority-element-ii ├── 0229-majority-element-ii.py ├── NOTES.md └── README.md ├── 0232-implement-queue-using-stacks ├── 0232-implement-queue-using-stacks.py ├── NOTES.md └── README.md ├── 0234-palindrome-linked-list ├── 0234-palindrome-linked-list.py └── NOTES.md ├── 0235-lowest-common-ancestor-of-a-binary-search-tree ├── 0235-lowest-common-ancestor-of-a-binary-search-tree.py ├── NOTES.md └── README.md ├── 0236-lowest-common-ancestor-of-a-binary-tree ├── 0236-lowest-common-ancestor-of-a-binary-tree.py ├── NOTES.md └── README.md ├── 0237-delete-node-in-a-linked-list ├── 0237-delete-node-in-a-linked-list.py ├── NOTES.md └── README.md ├── 0242-valid-anagram ├── 0242-valid-anagram.py ├── NOTES.md └── README.md ├── 0257-binary-tree-paths ├── 0257-binary-tree-paths.py ├── NOTES.md └── README.md ├── 0258-add-digits ├── 0258-add-digits.py ├── NOTES.md └── README.md ├── 0268-missing-number ├── 0268-missing-number.py ├── NOTES.md └── README.md ├── 0279-perfect-squares ├── 0279-perfect-squares.py ├── NOTES.md └── README.md ├── 0283-move-zeroes ├── 0283-move-zeroes.py ├── NOTES.md └── README.md ├── 0287-find-the-duplicate-number ├── 0287-find-the-duplicate-number.py ├── NOTES.md └── README.md ├── 0290-word-pattern ├── 0290-word-pattern.py └── NOTES.md ├── 0300-longest-increasing-subsequence ├── 0300-longest-increasing-subsequence.py ├── NOTES.md └── README.md ├── 0309-best-time-to-buy-and-sell-stock-with-cooldown ├── 0309-best-time-to-buy-and-sell-stock-with-cooldown.py ├── NOTES.md └── README.md ├── 0316-remove-duplicate-letters ├── 0316-remove-duplicate-letters.py ├── NOTES.md └── README.md ├── 0319-bulb-switcher ├── 0319-bulb-switcher.py ├── NOTES.md └── README.md ├── 0328-odd-even-linked-list ├── 0328-odd-even-linked-list.py ├── NOTES.md └── README.md ├── 0332-reconstruct-itinerary ├── 0332-reconstruct-itinerary.py └── README.md ├── 0341-flatten-nested-list-iterator ├── 0341-flatten-nested-list-iterator.py ├── NOTES.md └── README.md ├── 0342-power-of-four ├── 0342-power-of-four.py └── README.md ├── 0344-reverse-string ├── 0344-reverse-string.py ├── NOTES.md └── README.md ├── 0345-reverse-vowels-of-a-string ├── 0345-reverse-vowels-of-a-string.py ├── NOTES.md └── README.md ├── 0347-top-k-frequent-elements ├── 0347-top-k-frequent-elements.py ├── NOTES.md └── README.md ├── 0352-data-stream-as-disjoint-intervals ├── 0352-data-stream-as-disjoint-intervals.py └── NOTES.md ├── 0367-valid-perfect-square ├── 0367-valid-perfect-square.py ├── NOTES.md └── README.md ├── 0373-find-k-pairs-with-smallest-sums ├── NOTES.md └── README.md ├── 0374-guess-number-higher-or-lower ├── 0374-guess-number-higher-or-lower.py └── NOTES.md ├── 0376-wiggle-subsequence ├── 0376-wiggle-subsequence.py └── README.md ├── 0380-insert-delete-getrandom-o1 ├── 0380-insert-delete-getrandom-o1.py ├── NOTES.md └── README.md ├── 0389-find-the-difference ├── 0389-find-the-difference.py ├── NOTES.md └── README.md ├── 0392-is-subsequence ├── 0392-is-subsequence.py ├── NOTES.md └── README.md ├── 0399-evaluate-division ├── 0399-evaluate-division.py ├── NOTES.md └── README.md ├── 0402-remove-k-digits ├── 0402-remove-k-digits.py └── NOTES.md ├── 0403-frog-jump ├── 0403-frog-jump.py └── NOTES.md ├── 0404-sum-of-left-leaves └── README.md ├── 0416-partition-equal-subset-sum ├── 0416-partition-equal-subset-sum.py ├── NOTES.md └── README.md ├── 0424-longest-repeating-character-replacement ├── 0424-longest-repeating-character-replacement.py ├── NOTES.md └── README.md ├── 0427-construct-quad-tree ├── 0427-construct-quad-tree.py └── README.md ├── 0433-minimum-genetic-mutation ├── 0433-minimum-genetic-mutation.py ├── NOTES.md └── README.md ├── 0435-non-overlapping-intervals ├── 0435-non-overlapping-intervals.py └── README.md ├── 0438-find-all-anagrams-in-a-string ├── 0438-find-all-anagrams-in-a-string.py ├── NOTES.md └── README.md ├── 0441-arranging-coins ├── 0441-arranging-coins.py ├── NOTES.md └── README.md ├── 0443-string-compression ├── 0443-string-compression.py ├── NOTES.md └── README.md ├── 0445-add-two-numbers-ii ├── 0445-add-two-numbers-ii.py └── README.md ├── 0446-arithmetic-slices-ii-subsequence ├── 0446-arithmetic-slices-ii-subsequence.py ├── NOTES.md └── README.md ├── 0451-sort-characters-by-frequency ├── 0451-sort-characters-by-frequency.py ├── NOTES.md └── README.md ├── 0452-minimum-number-of-arrows-to-burst-balloons ├── 0452-minimum-number-of-arrows-to-burst-balloons.py ├── NOTES.md └── README.md ├── 0455-assign-cookies ├── 0455-assign-cookies.py ├── NOTES.md └── README.md ├── 0456-132-pattern ├── 0456-132-pattern.py ├── NOTES.md └── README.md ├── 0458-poor-pigs ├── 0458-poor-pigs.py └── README.md ├── 0460-lfu-cache ├── 0460-lfu-cache.py └── README.md ├── 0463-island-perimeter ├── 0463-island-perimeter.py ├── NOTES.md └── README.md ├── 0472-concatenated-words ├── 0472-concatenated-words.py ├── NOTES.md └── README.md ├── 0473-matchsticks-to-square ├── 0473-matchsticks-to-square.py ├── NOTES.md └── README.md ├── 0474-ones-and-zeroes ├── 0474-ones-and-zeroes.py ├── NOTES.md └── README.md ├── 0485-max-consecutive-ones ├── 0485-max-consecutive-ones.py ├── NOTES.md └── README.md ├── 0486-predict-the-winner ├── 0486-predict-the-winner.py ├── NOTES.md └── README.md ├── 0491-non-decreasing-subsequences ├── 0491-non-decreasing-subsequences.py └── README.md ├── 0493-reverse-pairs ├── 0493-reverse-pairs.py └── README.md ├── 0494-target-sum ├── 0494-target-sum.py └── NOTES.md ├── 0496-next-greater-element-i ├── 0496-next-greater-element-i.py ├── NOTES.md └── README.md ├── 0502-ipo ├── 0502-ipo.py └── README.md ├── 0503-next-greater-element-ii ├── 0503-next-greater-element-ii.py └── README.md ├── 0513-find-bottom-left-tree-value ├── NOTES.md └── README.md ├── 0514-freedom-trail ├── 0514-freedom-trail.py └── README.md ├── 0515-find-largest-value-in-each-tree-row ├── 0515-find-largest-value-in-each-tree-row.py ├── NOTES.md └── README.md ├── 0516-longest-palindromic-subsequence ├── 0516-longest-palindromic-subsequence.py └── NOTES.md ├── 0518-coin-change-ii ├── 0518-coin-change-ii.py └── README.md ├── 0520-detect-capital ├── 0520-detect-capital.py ├── NOTES.md └── README.md ├── 0530-minimum-absolute-difference-in-bst ├── 0530-minimum-absolute-difference-in-bst.py ├── NOTES.md └── README.md ├── 0540-single-element-in-a-sorted-array ├── 0540-single-element-in-a-sorted-array.py ├── NOTES.md └── README.md ├── 0542-01-matrix ├── 0542-01-matrix.py ├── NOTES.md └── README.md ├── 0543-diameter-of-binary-tree ├── 0543-diameter-of-binary-tree.py ├── NOTES.md └── README.md ├── 0547-number-of-provinces ├── 0547-number-of-provinces.py └── NOTES.md ├── 0557-reverse-words-in-a-string-iii ├── 0557-reverse-words-in-a-string-iii.py └── NOTES.md ├── 0560-subarray-sum-equals-k ├── 0560-subarray-sum-equals-k.py ├── NOTES.md └── README.md ├── 0567-permutation-in-string ├── 0567-permutation-in-string.py └── README.md ├── 0572-subtree-of-another-tree ├── 0572-subtree-of-another-tree.py ├── NOTES.md └── README.md ├── 0576-out-of-boundary-paths ├── 0576-out-of-boundary-paths.py └── README.md ├── 0584-find-customer-referee ├── 0584-find-customer-referee.sql ├── NOTES.md └── README.md ├── 0587-erect-the-fence ├── 0587-erect-the-fence.py └── NOTES.md ├── 0595-big-countries ├── 0595-big-countries.sql ├── NOTES.md └── README.md ├── 0596-classes-more-than-5-students ├── 0596-classes-more-than-5-students.sql ├── NOTES.md └── README.md ├── 0605-can-place-flowers ├── 0605-can-place-flowers.py └── README.md ├── 0619-biggest-single-number ├── 0619-biggest-single-number.sql ├── NOTES.md └── README.md ├── 0620-not-boring-movies ├── 0620-not-boring-movies.sql ├── NOTES.md └── README.md ├── 0623-add-one-row-to-tree ├── 0623-add-one-row-to-tree.py ├── NOTES.md └── README.md ├── 0628-maximum-product-of-three-numbers ├── 0628-maximum-product-of-three-numbers.py ├── NOTES.md └── README.md ├── 0629-k-inverse-pairs-array ├── 0629-k-inverse-pairs-array.py ├── NOTES.md └── README.md ├── 0645-set-mismatch ├── 0645-set-mismatch.py ├── NOTES.md └── README.md ├── 0646-maximum-length-of-pair-chain ├── 0646-maximum-length-of-pair-chain.py ├── NOTES.md └── README.md ├── 0649-dota2-senate ├── 0649-dota2-senate.py └── NOTES.md ├── 0652-find-duplicate-subtrees ├── 0652-find-duplicate-subtrees.py └── README.md ├── 0658-find-k-closest-elements ├── 0658-find-k-closest-elements.py └── README.md ├── 0661-image-smoother ├── 0661-image-smoother.py └── README.md ├── 0662-maximum-width-of-binary-tree ├── 0662-maximum-width-of-binary-tree.py ├── NOTES.md └── README.md ├── 0664-strange-printer ├── 0664-strange-printer.py └── NOTES.md ├── 0673-number-of-longest-increasing-subsequence ├── 0673-number-of-longest-increasing-subsequence.py └── NOTES.md ├── 0674-longest-continuous-increasing-subsequence ├── 0674-longest-continuous-increasing-subsequence.py ├── NOTES.md └── README.md ├── 0678-valid-parenthesis-string ├── 0678-valid-parenthesis-string.py ├── NOTES.md └── README.md ├── 0688-knight-probability-in-chessboard ├── 0688-knight-probability-in-chessboard.py └── README.md ├── 0698-partition-to-k-equal-sum-subsets ├── 0698-partition-to-k-equal-sum-subsets.py ├── NOTES.md └── README.md ├── 0700-search-in-a-binary-search-tree ├── 0700-search-in-a-binary-search-tree.py ├── NOTES.md └── README.md ├── 0703-kth-largest-element-in-a-stream ├── 0703-kth-largest-element-in-a-stream.py ├── NOTES.md └── README.md ├── 0704-binary-search ├── 0704-binary-search.py ├── NOTES.md └── README.md ├── 0705-design-hashset ├── 0705-design-hashset.py ├── NOTES.md └── README.md ├── 0706-design-hashmap ├── 0706-design-hashmap.py ├── NOTES.md └── README.md ├── 0712-minimum-ascii-delete-sum-for-two-strings ├── 0712-minimum-ascii-delete-sum-for-two-strings.py ├── NOTES.md └── README.md ├── 0714-best-time-to-buy-and-sell-stock-with-transaction-fee ├── 0714-best-time-to-buy-and-sell-stock-with-transaction-fee.py ├── NOTES.md └── README.md ├── 0718-maximum-length-of-repeated-subarray ├── 0718-maximum-length-of-repeated-subarray.py └── README.md ├── 0730-count-different-palindromic-subsequences ├── 0730-count-different-palindromic-subsequences.py ├── NOTES.md └── README.md ├── 0733-flood-fill ├── 0733-flood-fill.py ├── NOTES.md └── README.md ├── 0735-asteroid-collision ├── 0735-asteroid-collision.py └── README.md ├── 0739-daily-temperatures ├── 0739-daily-temperatures.py ├── NOTES.md └── README.md ├── 0744-find-smallest-letter-greater-than-target ├── 0744-find-smallest-letter-greater-than-target.py ├── NOTES.md └── README.md ├── 0746-min-cost-climbing-stairs ├── 0746-min-cost-climbing-stairs.py ├── NOTES.md └── README.md ├── 0752-open-the-lock └── README.md ├── 0766-toeplitz-matrix ├── 0766-toeplitz-matrix.py ├── NOTES.md └── README.md ├── 0767-reorganize-string ├── 0767-reorganize-string.py ├── NOTES.md └── README.md ├── 0779-k-th-symbol-in-grammar ├── 0779-k-th-symbol-in-grammar.py ├── NOTES.md └── README.md ├── 0783-minimum-distance-between-bst-nodes ├── 0783-minimum-distance-between-bst-nodes.py ├── NOTES.md └── README.md ├── 0785-is-graph-bipartite ├── 0785-is-graph-bipartite.py ├── NOTES.md └── README.md ├── 0787-cheapest-flights-within-k-stops ├── 0787-cheapest-flights-within-k-stops.cpp ├── NOTES.md └── README.md ├── 0796-rotate-string ├── 0796-rotate-string.py ├── NOTES.md └── README.md ├── 0799-champagne-tower ├── 0799-champagne-tower.py ├── NOTES.md └── README.md ├── 0802-find-eventual-safe-states └── README.md ├── 0808-soup-servings ├── 0808-soup-servings.py ├── NOTES.md └── README.md ├── 0815-bus-routes ├── 0815-bus-routes.py └── README.md ├── 0823-binary-trees-with-factors ├── 0823-binary-trees-with-factors.py ├── NOTES.md └── README.md ├── 0834-sum-of-distances-in-tree ├── 0834-sum-of-distances-in-tree.py └── NOTES.md ├── 0837-new-21-game ├── 0837-new-21-game.py ├── NOTES.md └── README.md ├── 0844-backspace-string-compare ├── 0844-backspace-string-compare.py ├── NOTES.md └── README.md ├── 0847-shortest-path-visiting-all-nodes ├── 0847-shortest-path-visiting-all-nodes.py ├── NOTES.md └── README.md ├── 0852-peak-index-in-a-mountain-array ├── 0852-peak-index-in-a-mountain-array.py ├── NOTES.md └── README.md ├── 0859-buddy-strings ├── 0859-buddy-strings.py ├── NOTES.md └── README.md ├── 0860-lemonade-change ├── 0860-lemonade-change.py └── README.md ├── 0861-score-after-flipping-matrix ├── 0861-score-after-flipping-matrix.py ├── NOTES.md └── README.md ├── 0863-all-nodes-distance-k-in-binary-tree ├── 0863-all-nodes-distance-k-in-binary-tree.py ├── NOTES.md └── README.md ├── 0864-shortest-path-to-get-all-keys ├── 0864-shortest-path-to-get-all-keys.py ├── NOTES.md └── README.md ├── 0867-transpose-matrix ├── 0867-transpose-matrix.py └── README.md ├── 0872-leaf-similar-trees ├── 0872-leaf-similar-trees.py ├── NOTES.md └── README.md ├── 0875-koko-eating-bananas ├── 0875-koko-eating-bananas.py └── README.md ├── 0876-middle-of-the-linked-list ├── 0876-middle-of-the-linked-list.py ├── NOTES.md └── README.md ├── 0879-profitable-schemes ├── 0879-profitable-schemes.py └── README.md ├── 0880-decoded-string-at-index ├── 0880-decoded-string-at-index.py ├── NOTES.md └── README.md ├── 0881-boats-to-save-people ├── 0881-boats-to-save-people.py ├── NOTES.md └── README.md ├── 0887-super-egg-drop ├── 0887-super-egg-drop.py └── README.md ├── 0894-all-possible-full-binary-trees ├── 0894-all-possible-full-binary-trees.py └── README.md ├── 0896-monotonic-array ├── 0896-monotonic-array.py ├── NOTES.md └── README.md ├── 0899-orderly-queue ├── 0899-orderly-queue.py ├── NOTES.md └── README.md ├── 0901-online-stock-span ├── 0901-online-stock-span.py ├── NOTES.md └── README.md ├── 0904-fruit-into-baskets ├── 0904-fruit-into-baskets.py ├── NOTES.md └── README.md ├── 0905-sort-array-by-parity ├── 0905-sort-array-by-parity.py └── NOTES.md ├── 0907-sum-of-subarray-minimums ├── 0907-sum-of-subarray-minimums.py ├── NOTES.md └── README.md ├── 0909-snakes-and-ladders ├── 0909-snakes-and-ladders.py ├── NOTES.md └── README.md ├── 0912-sort-an-array ├── 0912-sort-an-array.py ├── NOTES.md └── README.md ├── 0918-maximum-sum-circular-subarray ├── 0918-maximum-sum-circular-subarray.py └── README.md ├── 0920-number-of-music-playlists ├── 0920-number-of-music-playlists.py ├── NOTES.md └── README.md ├── 0926-flip-string-to-monotone-increasing ├── 0926-flip-string-to-monotone-increasing.py ├── NOTES.md └── README.md ├── 0930-binary-subarrays-with-sum ├── 0930-binary-subarrays-with-sum.py ├── NOTES.md └── README.md ├── 0932-beautiful-array ├── 0932-beautiful-array.py ├── NOTES.md └── README.md ├── 0934-shortest-bridge ├── NOTES.md └── README.md ├── 0935-knight-dialer ├── 0935-knight-dialer.py ├── NOTES.md └── README.md ├── 0938-range-sum-of-bst ├── 0938-range-sum-of-bst.py ├── NOTES.md └── README.md ├── 0944-delete-columns-to-make-sorted ├── 0944-delete-columns-to-make-sorted.py └── NOTES.md ├── 0946-validate-stack-sequences ├── 0946-validate-stack-sequences.py ├── NOTES.md └── README.md ├── 0947-most-stones-removed-with-same-row-or-column ├── 0947-most-stones-removed-with-same-row-or-column.py └── README.md ├── 0948-bag-of-tokens ├── 0948-bag-of-tokens.py ├── NOTES.md └── README.md ├── 0953-verifying-an-alien-dictionary ├── 0953-verifying-an-alien-dictionary.py ├── NOTES.md └── README.md ├── 0956-tallest-billboard ├── 0956-tallest-billboard.py ├── NOTES.md └── README.md ├── 0974-subarray-sums-divisible-by-k ├── 0974-subarray-sums-divisible-by-k.py └── README.md ├── 0977-squares-of-a-sorted-array ├── 0977-squares-of-a-sorted-array.py └── README.md ├── 0979-distribute-coins-in-binary-tree └── NOTES.md ├── 0981-time-based-key-value-store ├── 0981-time-based-key-value-store.py └── README.md ├── 0983-minimum-cost-for-tickets ├── 0983-minimum-cost-for-tickets.py └── NOTES.md ├── 0988-smallest-string-starting-from-leaf ├── 0988-smallest-string-starting-from-leaf.py ├── NOTES.md └── README.md ├── 0989-add-to-array-form-of-integer ├── 0989-add-to-array-form-of-integer.py ├── NOTES.md └── README.md ├── 0992-subarrays-with-k-different-integers ├── 0992-subarrays-with-k-different-integers.py └── NOTES.md ├── 0994-rotting-oranges ├── 0994-rotting-oranges.py ├── NOTES.md └── README.md ├── 1004-max-consecutive-ones-iii ├── 1004-max-consecutive-ones-iii.py ├── NOTES.md └── README.md ├── 1011-capacity-to-ship-packages-within-d-days ├── 1011-capacity-to-ship-packages-within-d-days.py ├── NOTES.md └── README.md ├── 1020-number-of-enclaves ├── 1020-number-of-enclaves.py └── NOTES.md ├── 1021-remove-outermost-parentheses ├── 1021-remove-outermost-parentheses.py ├── NOTES.md └── README.md ├── 1026-maximum-difference-between-node-and-ancestor ├── 1026-maximum-difference-between-node-and-ancestor.py ├── NOTES.md └── README.md ├── 1027-longest-arithmetic-subsequence ├── 1027-longest-arithmetic-subsequence.py ├── NOTES.md └── README.md ├── 1035-uncrossed-lines ├── 1035-uncrossed-lines.py ├── NOTES.md └── README.md ├── 1043-partition-array-for-maximum-sum ├── 1043-partition-array-for-maximum-sum.py ├── NOTES.md └── README.md ├── 1045-customers-who-bought-all-products ├── 1045-customers-who-bought-all-products.sql ├── NOTES.md └── README.md ├── 1046-last-stone-weight ├── 1046-last-stone-weight.py ├── NOTES.md └── README.md ├── 1047-remove-all-adjacent-duplicates-in-string ├── 1047-remove-all-adjacent-duplicates-in-string.py ├── NOTES.md └── README.md ├── 1048-longest-string-chain ├── 1048-longest-string-chain.py ├── NOTES.md └── README.md ├── 1061-lexicographically-smallest-equivalent-string ├── 1061-lexicographically-smallest-equivalent-string.py ├── NOTES.md └── README.md ├── 1068-product-sales-analysis-i ├── 1068-product-sales-analysis-i.sql ├── NOTES.md └── README.md ├── 1071-greatest-common-divisor-of-strings ├── 1071-greatest-common-divisor-of-strings.py ├── NOTES.md └── README.md ├── 1074-number-of-submatrices-that-sum-to-target ├── 1074-number-of-submatrices-that-sum-to-target.py └── NOTES.md ├── 1075-project-employees-i ├── 1075-project-employees-i.sql ├── NOTES.md └── README.md ├── 1091-shortest-path-in-binary-matrix ├── 1091-shortest-path-in-binary-matrix.py └── README.md ├── 1095-find-in-mountain-array ├── 1095-find-in-mountain-array.py ├── NOTES.md └── README.md ├── 1125-smallest-sufficient-team ├── 1125-smallest-sufficient-team.py └── NOTES.md ├── 1129-shortest-path-with-alternating-colors ├── 1129-shortest-path-with-alternating-colors.py ├── NOTES.md └── README.md ├── 1137-n-th-tribonacci-number ├── 1137-n-th-tribonacci-number.py ├── NOTES.md └── README.md ├── 1140-stone-game-ii ├── 1140-stone-game-ii.py ├── NOTES.md └── README.md ├── 1141-user-activity-for-the-past-30-days-i ├── 1141-user-activity-for-the-past-30-days-i.sql ├── NOTES.md └── README.md ├── 1143-longest-common-subsequence ├── 1143-longest-common-subsequence.py ├── NOTES.md └── README.md ├── 1146-snapshot-array ├── 1146-snapshot-array.py └── README.md ├── 1148-article-views-i ├── 1148-article-views-i.sql ├── NOTES.md └── README.md ├── 1162-as-far-from-land-as-possible ├── 1162-as-far-from-land-as-possible.py ├── NOTES.md └── README.md ├── 1187-make-array-strictly-increasing ├── 1187-make-array-strictly-increasing.py ├── NOTES.md └── README.md ├── 1207-unique-number-of-occurrences ├── 1207-unique-number-of-occurrences.py ├── NOTES.md └── README.md ├── 1209-remove-all-adjacent-duplicates-in-string-ii ├── 1209-remove-all-adjacent-duplicates-in-string-ii.py ├── NOTES.md └── README.md ├── 1218-longest-arithmetic-subsequence-of-given-difference ├── 1218-longest-arithmetic-subsequence-of-given-difference.py └── README.md ├── 1219-path-with-maximum-gold ├── 1219-path-with-maximum-gold.py ├── NOTES.md └── README.md ├── 1220-count-vowels-permutation ├── 1220-count-vowels-permutation.py ├── NOTES.md └── README.md ├── 1232-check-if-it-is-a-straight-line ├── 1232-check-if-it-is-a-straight-line.py └── README.md ├── 1235-maximum-profit-in-job-scheduling ├── 1235-maximum-profit-in-job-scheduling.py ├── NOTES.md └── README.md ├── 1239-maximum-length-of-a-concatenated-string-with-unique-characters ├── 1239-maximum-length-of-a-concatenated-string-with-unique-characters.py ├── NOTES.md └── README.md ├── 1248-count-number-of-nice-subarrays ├── 1248-count-number-of-nice-subarrays.py ├── NOTES.md └── README.md ├── 1249-minimum-remove-to-make-valid-parentheses ├── 1249-minimum-remove-to-make-valid-parentheses.py ├── NOTES.md └── README.md ├── 1251-average-selling-price ├── 1251-average-selling-price.sql ├── NOTES.md └── README.md ├── 1254-number-of-closed-islands ├── 1254-number-of-closed-islands.py ├── NOTES.md └── README.md ├── 1255-maximum-score-words-formed-by-letters ├── 1255-maximum-score-words-formed-by-letters.py ├── NOTES.md └── README.md ├── 1266-minimum-time-visiting-all-points ├── 1266-minimum-time-visiting-all-points.py ├── NOTES.md └── README.md ├── 1269-number-of-ways-to-stay-in-the-same-place-after-some-steps ├── 1269-number-of-ways-to-stay-in-the-same-place-after-some-steps.py ├── NOTES.md └── README.md ├── 1282-group-the-people-given-the-group-size-they-belong-to ├── 1282-group-the-people-given-the-group-size-they-belong-to.py ├── NOTES.md └── README.md ├── 1287-element-appearing-more-than-25-in-sorted-array ├── NOTES.md └── README.md ├── 1289-minimum-falling-path-sum-ii ├── 1289-minimum-falling-path-sum-ii.py └── NOTES.md ├── 1293-shortest-path-in-a-grid-with-obstacles-elimination ├── 1293-shortest-path-in-a-grid-with-obstacles-elimination.py ├── NOTES.md └── README.md ├── 1312-minimum-insertion-steps-to-make-a-string-palindrome ├── 1312-minimum-insertion-steps-to-make-a-string-palindrome.py ├── NOTES.md └── README.md ├── 1318-minimum-flips-to-make-a-or-b-equal-to-c ├── 1318-minimum-flips-to-make-a-or-b-equal-to-c.py ├── NOTES.md └── README.md ├── 1319-number-of-operations-to-make-network-connected ├── 1319-number-of-operations-to-make-network-connected.py ├── NOTES.md └── README.md ├── 1335-minimum-difficulty-of-a-job-schedule ├── 1335-minimum-difficulty-of-a-job-schedule.py ├── NOTES.md └── README.md ├── 1337-the-k-weakest-rows-in-a-matrix ├── 1337-the-k-weakest-rows-in-a-matrix.py └── README.md ├── 1345-jump-game-iv ├── 1345-jump-game-iv.py ├── NOTES.md └── README.md ├── 1347-minimum-number-of-steps-to-make-two-strings-anagram ├── 1347-minimum-number-of-steps-to-make-two-strings-anagram.py └── README.md ├── 1351-count-negative-numbers-in-a-sorted-matrix ├── 1351-count-negative-numbers-in-a-sorted-matrix.py ├── NOTES.md └── README.md ├── 1356-sort-integers-by-the-number-of-1-bits ├── 1356-sort-integers-by-the-number-of-1-bits.py ├── NOTES.md └── README.md ├── 1358-number-of-substrings-containing-all-three-characters ├── 1358-number-of-substrings-containing-all-three-characters.py ├── NOTES.md └── README.md ├── 1359-count-all-valid-pickup-and-delivery-options ├── 1359-count-all-valid-pickup-and-delivery-options.py └── README.md ├── 1361-validate-binary-tree-nodes ├── 1361-validate-binary-tree-nodes.py ├── NOTES.md └── README.md ├── 1376-time-needed-to-inform-all-employees ├── 1376-time-needed-to-inform-all-employees.py └── README.md ├── 1378-replace-employee-id-with-the-unique-identifier ├── 1378-replace-employee-id-with-the-unique-identifier.sql ├── NOTES.md └── README.md ├── 1396-design-underground-system ├── 1396-design-underground-system.py ├── NOTES.md └── README.md ├── 1402-reducing-dishes ├── 1402-reducing-dishes.py └── README.md ├── 1406-stone-game-iii ├── 1406-stone-game-iii.py ├── NOTES.md └── README.md ├── 1420-build-array-where-you-can-find-the-maximum-exactly-k-comparisons ├── 1420-build-array-where-you-can-find-the-maximum-exactly-k-comparisons.py ├── NOTES.md └── README.md ├── 1423-maximum-points-you-can-obtain-from-cards ├── 1423-maximum-points-you-can-obtain-from-cards.py ├── NOTES.md └── README.md ├── 1424-diagonal-traverse-ii ├── 1424-diagonal-traverse-ii.py ├── NOTES.md └── README.md ├── 1425-constrained-subsequence-sum ├── 1425-constrained-subsequence-sum.py ├── NOTES.md └── README.md ├── 1431-kids-with-the-greatest-number-of-candies ├── 1431-kids-with-the-greatest-number-of-candies.py ├── NOTES.md └── README.md ├── 1436-destination-city ├── 1436-destination-city.py ├── NOTES.md └── README.md ├── 1441-build-an-array-with-stack-operations ├── 1441-build-an-array-with-stack-operations.py ├── NOTES.md └── README.md ├── 1442-count-triplets-that-can-form-two-arrays-of-equal-xor ├── 1442-count-triplets-that-can-form-two-arrays-of-equal-xor.py ├── NOTES.md └── README.md ├── 1443-minimum-time-to-collect-all-apples-in-a-tree ├── 1443-minimum-time-to-collect-all-apples-in-a-tree.py └── NOTES.md ├── 1444-number-of-ways-of-cutting-a-pizza ├── 1444-number-of-ways-of-cutting-a-pizza.py └── README.md ├── 1446-consecutive-characters ├── 1446-consecutive-characters.py ├── NOTES.md └── README.md ├── 1448-count-good-nodes-in-binary-tree ├── 1448-count-good-nodes-in-binary-tree.py ├── NOTES.md └── README.md ├── 1456-maximum-number-of-vowels-in-a-substring-of-given-length ├── 1456-maximum-number-of-vowels-in-a-substring-of-given-length.py ├── NOTES.md └── README.md ├── 1458-max-dot-product-of-two-subsequences ├── 1458-max-dot-product-of-two-subsequences.py ├── NOTES.md └── README.md ├── 1460-make-two-arrays-equal-by-reversing-subarrays ├── 1460-make-two-arrays-equal-by-reversing-subarrays.py └── README.md ├── 1466-reorder-routes-to-make-all-paths-lead-to-the-city-zero ├── 1466-reorder-routes-to-make-all-paths-lead-to-the-city-zero.py ├── NOTES.md └── README.md ├── 1470-shuffle-the-array ├── 1470-shuffle-the-array.py ├── NOTES.md └── README.md ├── 1472-design-browser-history ├── 1472-design-browser-history.py ├── NOTES.md └── README.md ├── 1481-least-number-of-unique-integers-after-k-removals ├── 1481-least-number-of-unique-integers-after-k-removals.py └── README.md ├── 1489-find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree ├── 1489-find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree.py ├── NOTES.md └── README.md ├── 1491-average-salary-excluding-the-minimum-and-maximum-salary ├── 1491-average-salary-excluding-the-minimum-and-maximum-salary.py ├── NOTES.md └── README.md ├── 1493-longest-subarray-of-1s-after-deleting-one-element ├── 1493-longest-subarray-of-1s-after-deleting-one-element.py ├── NOTES.md └── README.md ├── 1498-number-of-subsequences-that-satisfy-the-given-sum-condition ├── 1498-number-of-subsequences-that-satisfy-the-given-sum-condition.py ├── NOTES.md └── README.md ├── 1502-can-make-arithmetic-progression-from-sequence ├── 1502-can-make-arithmetic-progression-from-sequence.py ├── NOTES.md └── README.md ├── 1512-number-of-good-pairs ├── 1512-number-of-good-pairs.py └── README.md ├── 1514-path-with-maximum-probability ├── 1514-path-with-maximum-probability.py ├── NOTES.md └── README.md ├── 1519-number-of-nodes-in-the-sub-tree-with-the-same-label ├── 1519-number-of-nodes-in-the-sub-tree-with-the-same-label.py ├── NOTES.md └── README.md ├── 1523-count-odd-numbers-in-an-interval-range ├── 1523-count-odd-numbers-in-an-interval-range.py ├── NOTES.md └── README.md ├── 1535-find-the-winner-of-an-array-game ├── 1535-find-the-winner-of-an-array-game.py └── NOTES.md ├── 1539-kth-missing-positive-number ├── 1539-kth-missing-positive-number.py └── NOTES.md ├── 1544-make-the-string-great ├── 1544-make-the-string-great.py ├── NOTES.md └── README.md ├── 1547-minimum-cost-to-cut-a-stick ├── 1547-minimum-cost-to-cut-a-stick.py ├── NOTES.md └── README.md ├── 1550-three-consecutive-odds ├── 1550-three-consecutive-odds.py ├── NOTES.md └── README.md ├── 1557-minimum-number-of-vertices-to-reach-all-nodes ├── 1557-minimum-number-of-vertices-to-reach-all-nodes.py ├── NOTES.md └── README.md ├── 1569-number-of-ways-to-reorder-array-to-get-same-bst ├── 1569-number-of-ways-to-reorder-array-to-get-same-bst.py ├── NOTES.md └── README.md ├── 1572-matrix-diagonal-sum ├── 1572-matrix-diagonal-sum.py ├── NOTES.md └── README.md ├── 1575-count-all-possible-routes ├── 1575-count-all-possible-routes.py ├── NOTES.md └── README.md ├── 1578-minimum-time-to-make-rope-colorful ├── NOTES.md └── README.md ├── 1579-remove-max-number-of-edges-to-keep-graph-fully-traversable ├── 1579-remove-max-number-of-edges-to-keep-graph-fully-traversable.py ├── NOTES.md └── README.md ├── 1581-customer-who-visited-but-did-not-make-any-transactions ├── 1581-customer-who-visited-but-did-not-make-any-transactions.sql └── NOTES.md ├── 1583-count-unhappy-friends ├── 1583-count-unhappy-friends.py ├── NOTES.md └── README.md ├── 1584-min-cost-to-connect-all-points ├── 1584-min-cost-to-connect-all-points.py └── README.md ├── 1601-maximum-number-of-achievable-transfer-requests ├── NOTES.md └── README.md ├── 1603-design-parking-system ├── 1603-design-parking-system.py ├── NOTES.md └── README.md ├── 1611-minimum-one-bit-operations-to-make-integers-zero ├── 1611-minimum-one-bit-operations-to-make-integers-zero.py └── README.md ├── 1614-maximum-nesting-depth-of-the-parentheses ├── 1614-maximum-nesting-depth-of-the-parentheses.py ├── NOTES.md └── README.md ├── 1615-maximal-network-rank ├── 1615-maximal-network-rank.py ├── NOTES.md └── README.md ├── 1626-best-team-with-no-conflicts ├── 1626-best-team-with-no-conflicts.py ├── NOTES.md └── README.md ├── 1630-arithmetic-subarrays ├── 1630-arithmetic-subarrays.py ├── NOTES.md └── README.md ├── 1631-path-with-minimum-effort ├── 1631-path-with-minimum-effort.py └── README.md ├── 1633-percentage-of-users-attended-a-contest ├── 1633-percentage-of-users-attended-a-contest.sql ├── NOTES.md └── README.md ├── 1637-widest-vertical-area-between-two-points-containing-no-points └── README.md ├── 1639-number-of-ways-to-form-a-target-string-given-a-dictionary ├── 1639-number-of-ways-to-form-a-target-string-given-a-dictionary.py └── NOTES.md ├── 1642-furthest-building-you-can-reach ├── 1642-furthest-building-you-can-reach.py └── NOTES.md ├── 1647-minimum-deletions-to-make-character-frequencies-unique ├── 1647-minimum-deletions-to-make-character-frequencies-unique.py ├── NOTES.md └── README.md ├── 1657-determine-if-two-strings-are-close ├── 1657-determine-if-two-strings-are-close.py └── README.md ├── 1658-minimum-operations-to-reduce-x-to-zero ├── 1658-minimum-operations-to-reduce-x-to-zero.py └── README.md ├── 1675-minimize-deviation-in-array ├── 1675-minimize-deviation-in-array.py ├── NOTES.md └── README.md ├── 1683-invalid-tweets ├── 1683-invalid-tweets.sql ├── NOTES.md └── README.md ├── 1685-sum-of-absolute-differences-in-a-sorted-array ├── 1685-sum-of-absolute-differences-in-a-sorted-array.py ├── NOTES.md └── README.md ├── 1688-count-of-matches-in-tournament ├── 1688-count-of-matches-in-tournament.py ├── NOTES.md └── README.md ├── 1697-checking-existence-of-edge-length-limited-paths ├── 1697-checking-existence-of-edge-length-limited-paths.py ├── NOTES.md └── README.md ├── 1704-determine-if-string-halves-are-alike ├── 1704-determine-if-string-halves-are-alike.py ├── NOTES.md └── README.md ├── 1706-where-will-the-ball-fall ├── 1706-where-will-the-ball-fall.py ├── NOTES.md └── README.md ├── 1721-swapping-nodes-in-a-linked-list ├── 1721-swapping-nodes-in-a-linked-list.py ├── NOTES.md └── README.md ├── 1727-largest-submatrix-with-rearrangements ├── 1727-largest-submatrix-with-rearrangements.py └── README.md ├── 1729-find-followers-count ├── 1729-find-followers-count.sql ├── NOTES.md └── README.md ├── 1731-the-number-of-employees-which-report-to-each-employee ├── 1731-the-number-of-employees-which-report-to-each-employee.sql ├── NOTES.md └── README.md ├── 1743-restore-the-array-from-adjacent-pairs ├── 1743-restore-the-array-from-adjacent-pairs.py ├── NOTES.md └── README.md ├── 1751-maximum-number-of-events-that-can-be-attended-ii ├── 1751-maximum-number-of-events-that-can-be-attended-ii.py ├── NOTES.md └── README.md ├── 1752-check-if-array-is-sorted-and-rotated ├── 1752-check-if-array-is-sorted-and-rotated.py ├── NOTES.md └── README.md ├── 1757-recyclable-and-low-fat-products ├── 1757-recyclable-and-low-fat-products.sql ├── NOTES.md └── README.md ├── 1759-count-number-of-homogenous-substrings ├── 1759-count-number-of-homogenous-substrings.py ├── NOTES.md └── README.md ├── 1768-merge-strings-alternately ├── 1768-merge-strings-alternately.py ├── NOTES.md └── README.md ├── 1781-sum-of-beauty-of-all-substrings ├── NOTES.md └── README.md ├── 1793-maximum-score-of-a-good-subarray ├── 1793-maximum-score-of-a-good-subarray.py ├── NOTES.md └── README.md ├── 1799-maximize-score-after-n-operations ├── 1799-maximize-score-after-n-operations.py ├── NOTES.md └── README.md ├── 1802-maximum-value-at-a-given-index-in-a-bounded-array ├── 1802-maximum-value-at-a-given-index-in-a-bounded-array.py ├── NOTES.md └── README.md ├── 1814-count-nice-pairs-in-an-array ├── NOTES.md └── README.md ├── 1822-sign-of-the-product-of-an-array ├── 1822-sign-of-the-product-of-an-array.py ├── NOTES.md └── README.md ├── 1833-maximum-ice-cream-bars ├── 1833-maximum-ice-cream-bars.py └── NOTES.md ├── 1838-frequency-of-the-most-frequent-element ├── 1838-frequency-of-the-most-frequent-element.py ├── NOTES.md └── README.md ├── 1839-longest-substring-of-all-vowels-in-order ├── 1839-longest-substring-of-all-vowels-in-order.py ├── NOTES.md └── README.md ├── 1845-seat-reservation-manager ├── 1845-seat-reservation-manager.py ├── NOTES.md └── README.md ├── 1846-maximum-element-after-decreasing-and-rearranging ├── 1846-maximum-element-after-decreasing-and-rearranging.py └── NOTES.md ├── 1849-splitting-a-string-into-descending-consecutive-values ├── 1849-splitting-a-string-into-descending-consecutive-values.py ├── NOTES.md └── README.md ├── 1857-largest-color-value-in-a-directed-graph ├── 1857-largest-color-value-in-a-directed-graph.py ├── NOTES.md └── README.md ├── 1870-minimum-speed-to-arrive-on-time ├── 1870-minimum-speed-to-arrive-on-time.py ├── NOTES.md └── README.md ├── 1887-reduction-operations-to-make-the-array-elements-equal ├── NOTES.md └── README.md ├── 1888-minimum-number-of-flips-to-make-the-binary-string-alternating ├── 1888-minimum-number-of-flips-to-make-the-binary-string-alternating.py ├── NOTES.md └── README.md ├── 1897-redistribute-characters-to-make-all-strings-equal ├── 1897-redistribute-characters-to-make-all-strings-equal.py ├── NOTES.md └── README.md ├── 1903-largest-odd-number-in-string ├── 1903-largest-odd-number-in-string.py ├── NOTES.md └── README.md ├── 1913-maximum-product-difference-between-two-pairs ├── 1913-maximum-product-difference-between-two-pairs.py ├── NOTES.md └── README.md ├── 1915-number-of-wonderful-substrings ├── 1915-number-of-wonderful-substrings.py ├── NOTES.md └── README.md ├── 1930-unique-length-3-palindromic-subsequences ├── 1930-unique-length-3-palindromic-subsequences.py ├── NOTES.md └── README.md ├── 1952-three-divisors ├── 1952-three-divisors.py ├── NOTES.md └── README.md ├── 1964-find-the-longest-valid-obstacle-course-at-each-position ├── 1964-find-the-longest-valid-obstacle-course-at-each-position.py └── NOTES.md ├── 1970-last-day-where-you-can-still-cross ├── 1970-last-day-where-you-can-still-cross.py ├── NOTES.md └── README.md ├── 1971-find-if-path-exists-in-graph ├── 1971-find-if-path-exists-in-graph.py ├── NOTES.md └── README.md ├── 1979-find-greatest-common-divisor-of-array ├── 1979-find-greatest-common-divisor-of-array.py ├── NOTES.md └── README.md ├── 1980-find-unique-binary-string ├── 1980-find-unique-binary-string.py ├── NOTES.md └── README.md ├── 1986-minimum-number-of-work-sessions-to-finish-the-tasks ├── 1986-minimum-number-of-work-sessions-to-finish-the-tasks.py └── README.md ├── 2009-minimum-number-of-operations-to-make-array-continuous ├── 2009-minimum-number-of-operations-to-make-array-continuous.py └── README.md ├── 2024-maximize-the-confusion-of-an-exam ├── 2024-maximize-the-confusion-of-an-exam.py ├── NOTES.md └── README.md ├── 2037-minimum-number-of-moves-to-seat-everyone ├── 2037-minimum-number-of-moves-to-seat-everyone.py └── README.md ├── 2038-remove-colored-pieces-if-both-neighbors-are-the-same-color ├── 2038-remove-colored-pieces-if-both-neighbors-are-the-same-color.py └── README.md ├── 2050-parallel-courses-iii ├── 2050-parallel-courses-iii.py ├── NOTES.md └── README.md ├── 2073-time-needed-to-buy-tickets ├── 2073-time-needed-to-buy-tickets.py ├── NOTES.md └── README.md ├── 2090-k-radius-subarray-averages ├── 2090-k-radius-subarray-averages.py ├── NOTES.md └── README.md ├── 2092-find-all-people-with-secret ├── 2092-find-all-people-with-secret.py └── README.md ├── 2095-delete-the-middle-node-of-a-linked-list ├── 2095-delete-the-middle-node-of-a-linked-list.py ├── NOTES.md └── README.md ├── 2099-find-subsequence-of-length-k-with-the-largest-sum └── README.md ├── 2101-detonate-the-maximum-bombs ├── 2101-detonate-the-maximum-bombs.py └── README.md ├── 2125-number-of-laser-beams-in-a-bank ├── 2125-number-of-laser-beams-in-a-bank.py ├── NOTES.md └── README.md ├── 2130-maximum-twin-sum-of-a-linked-list ├── 2130-maximum-twin-sum-of-a-linked-list.py ├── NOTES.md └── README.md ├── 2131-longest-palindrome-by-concatenating-two-letter-words ├── 2131-longest-palindrome-by-concatenating-two-letter-words.py └── NOTES.md ├── 2133-check-if-every-row-and-column-contains-all-numbers ├── 2133-check-if-every-row-and-column-contains-all-numbers.py └── NOTES.md ├── 2139-minimum-moves-to-reach-target-score ├── 2139-minimum-moves-to-reach-target-score.py └── README.md ├── 2140-solving-questions-with-brainpower ├── 2140-solving-questions-with-brainpower.py ├── NOTES.md └── README.md ├── 2141-maximum-running-time-of-n-computers ├── 2141-maximum-running-time-of-n-computers.py ├── NOTES.md └── README.md ├── 2147-number-of-ways-to-divide-a-long-corridor ├── 2147-number-of-ways-to-divide-a-long-corridor.py └── NOTES.md ├── 2187-minimum-time-to-complete-trips ├── 2187-minimum-time-to-complete-trips.py ├── NOTES.md └── README.md ├── 2218-maximum-value-of-k-coins-from-piles ├── 2218-maximum-value-of-k-coins-from-piles.py ├── NOTES.md └── README.md ├── 2225-find-players-with-zero-or-one-losses ├── 2225-find-players-with-zero-or-one-losses.py ├── NOTES.md └── README.md ├── 2244-minimum-rounds-to-complete-all-tasks ├── 2244-minimum-rounds-to-complete-all-tasks.py ├── NOTES.md └── README.md ├── 2246-longest-path-with-different-adjacent-characters ├── 2246-longest-path-with-different-adjacent-characters.py ├── NOTES.md └── README.md ├── 2251-number-of-flowers-in-full-bloom ├── 2251-number-of-flowers-in-full-bloom.py └── NOTES.md ├── 2256-minimum-average-difference ├── 2256-minimum-average-difference.py ├── NOTES.md └── README.md ├── 2264-largest-3-same-digit-number-in-string ├── 2264-largest-3-same-digit-number-in-string.py └── README.md ├── 2265-count-nodes-equal-to-average-of-subtree ├── 2265-count-nodes-equal-to-average-of-subtree.py ├── NOTES.md └── README.md ├── 2272-substring-with-largest-variance ├── 2272-substring-with-largest-variance.py ├── NOTES.md └── README.md ├── 2294-partition-array-such-that-maximum-difference-is-k ├── 2294-partition-array-such-that-maximum-difference-is-k.py ├── NOTES.md └── README.md ├── 2300-successful-pairs-of-spells-and-potions ├── 2300-successful-pairs-of-spells-and-potions.py └── README.md ├── 2305-fair-distribution-of-cookies ├── 2305-fair-distribution-of-cookies.py ├── NOTES.md └── README.md ├── 2306-naming-a-company ├── 2306-naming-a-company.py ├── NOTES.md └── README.md ├── 2316-count-unreachable-pairs-of-nodes-in-an-undirected-graph ├── 2316-count-unreachable-pairs-of-nodes-in-an-undirected-graph.py ├── NOTES.md └── README.md ├── 2328-number-of-increasing-paths-in-a-grid ├── 2328-number-of-increasing-paths-in-a-grid.py ├── NOTES.md └── README.md ├── 2331-evaluate-boolean-binary-tree └── NOTES.md ├── 2336-smallest-number-in-infinite-set ├── 2336-smallest-number-in-infinite-set.py └── NOTES.md ├── 2352-equal-row-and-column-pairs ├── 2352-equal-row-and-column-pairs.py ├── NOTES.md └── README.md ├── 2353-design-a-food-rating-system ├── 2353-design-a-food-rating-system.py └── README.md ├── 2356-number-of-unique-subjects-taught-by-each-teacher ├── 2356-number-of-unique-subjects-taught-by-each-teacher.sql ├── NOTES.md └── README.md ├── 2359-find-closest-node-to-given-two-nodes ├── 2359-find-closest-node-to-given-two-nodes.py ├── NOTES.md └── README.md ├── 2369-check-if-there-is-a-valid-partition-for-the-array ├── 2369-check-if-there-is-a-valid-partition-for-the-array.py ├── NOTES.md └── README.md ├── 2370-longest-ideal-subsequence ├── 2370-longest-ideal-subsequence.py ├── NOTES.md └── README.md ├── 2379-minimum-recolors-to-get-k-consecutive-black-blocks ├── 2379-minimum-recolors-to-get-k-consecutive-black-blocks.py ├── NOTES.md └── README.md ├── 2385-amount-of-time-for-binary-tree-to-be-infected ├── 2385-amount-of-time-for-binary-tree-to-be-infected.py ├── NOTES.md └── README.md ├── 2390-removing-stars-from-a-string ├── 2390-removing-stars-from-a-string.py ├── NOTES.md └── README.md ├── 2391-minimum-amount-of-time-to-collect-garbage ├── 2391-minimum-amount-of-time-to-collect-garbage.py ├── NOTES.md └── README.md ├── 2401-longest-nice-subarray ├── 2401-longest-nice-subarray.py ├── NOTES.md └── README.md ├── 2402-meeting-rooms-iii ├── 2402-meeting-rooms-iii.py ├── NOTES.md └── README.md ├── 2405-optimal-partition-of-string ├── 2405-optimal-partition-of-string.py └── README.md ├── 2413-smallest-even-multiple ├── 2413-smallest-even-multiple.py ├── NOTES.md └── README.md ├── 2415-reverse-odd-levels-of-binary-tree ├── 2415-reverse-odd-levels-of-binary-tree.py └── NOTES.md ├── 2421-number-of-good-paths ├── 2421-number-of-good-paths.py ├── NOTES.md └── README.md ├── 2433-find-the-original-array-of-prefix-xor ├── 2433-find-the-original-array-of-prefix-xor.py └── README.md ├── 2439-minimize-maximum-of-array └── README.md ├── 2441-largest-positive-integer-that-exists-with-its-negative ├── 2441-largest-positive-integer-that-exists-with-its-negative.py ├── NOTES.md └── README.md ├── 2444-count-subarrays-with-fixed-bounds ├── 2444-count-subarrays-with-fixed-bounds.py ├── NOTES.md └── README.md ├── 2448-minimum-cost-to-make-array-equal ├── 2448-minimum-cost-to-make-array-equal.py └── README.md ├── 2457-minimum-addition-to-make-integer-beautiful ├── 2457-minimum-addition-to-make-integer-beautiful.py ├── NOTES.md └── README.md ├── 2462-total-cost-to-hire-k-workers ├── 2462-total-cost-to-hire-k-workers.py ├── NOTES.md └── README.md ├── 2466-count-ways-to-build-good-strings ├── 2466-count-ways-to-build-good-strings.py ├── NOTES.md └── README.md ├── 2477-minimum-fuel-cost-to-report-to-the-capital └── README.md ├── 2482-difference-between-ones-and-zeros-in-row-and-column ├── 2482-difference-between-ones-and-zeros-in-row-and-column.py ├── NOTES.md └── README.md ├── 2487-remove-nodes-from-linked-list ├── 2487-remove-nodes-from-linked-list.py └── README.md ├── 2506-count-pairs-of-similar-strings ├── 2506-count-pairs-of-similar-strings.py ├── NOTES.md └── README.md ├── 2529-maximum-count-of-positive-integer-and-negative-integer ├── 2529-maximum-count-of-positive-integer-and-negative-integer.py └── NOTES.md ├── 2542-maximum-subsequence-score ├── 2542-maximum-subsequence-score.py ├── NOTES.md └── README.md ├── 2551-put-marbles-in-bags ├── 2551-put-marbles-in-bags.py ├── NOTES.md └── README.md ├── 2582-pass-the-pillow ├── 2582-pass-the-pillow.py ├── NOTES.md └── README.md ├── 2603-collect-coins-in-a-tree ├── 2603-collect-coins-in-a-tree.py ├── NOTES.md └── README.md ├── 2607-make-k-subarray-sums-equal ├── 2607-make-k-subarray-sums-equal.py ├── NOTES.md └── README.md ├── 2608-shortest-cycle-in-a-graph ├── 2608-shortest-cycle-in-a-graph.py ├── NOTES.md └── README.md ├── 2609-find-the-longest-balanced-substring-of-a-binary-string ├── 2609-find-the-longest-balanced-substring-of-a-binary-string.py └── NOTES.md ├── 2610-convert-an-array-into-a-2d-array-with-conditions ├── 2610-convert-an-array-into-a-2d-array-with-conditions.py ├── NOTES.md └── README.md ├── 2611-mice-and-cheese ├── 2611-mice-and-cheese.py └── README.md ├── 2614-prime-in-diagonal ├── 2614-prime-in-diagonal.py ├── NOTES.md └── README.md ├── 2615-sum-of-distances ├── 2615-sum-of-distances.py ├── NOTES.md └── README.md ├── 2616-minimize-the-maximum-difference-of-pairs ├── 2616-minimize-the-maximum-difference-of-pairs.py ├── NOTES.md └── README.md ├── 2639-find-the-width-of-columns-of-a-grid ├── 2639-find-the-width-of-columns-of-a-grid.py ├── NOTES.md └── README.md ├── 2640-find-the-score-of-all-prefixes-of-an-array ├── 2640-find-the-score-of-all-prefixes-of-an-array.py └── README.md ├── 2642-design-graph-with-shortest-path-calculator ├── 2642-design-graph-with-shortest-path-calculator.py └── NOTES.md ├── 2644-find-the-maximum-divisibility-score ├── 2644-find-the-maximum-divisibility-score.py └── NOTES.md ├── 2645-minimum-additions-to-make-valid-string ├── 2645-minimum-additions-to-make-valid-string.py └── NOTES.md ├── 2660-determine-the-winner-of-a-bowling-game ├── 2660-determine-the-winner-of-a-bowling-game.py ├── NOTES.md └── README.md ├── 2661-first-completely-painted-row-or-column ├── 2661-first-completely-painted-row-or-column.py ├── NOTES.md └── README.md ├── 2681-power-of-heroes ├── 2681-power-of-heroes.py ├── NOTES.md └── README.md ├── 2682-find-the-losers-of-the-circular-game ├── 2682-find-the-losers-of-the-circular-game.py ├── NOTES.md └── README.md ├── 2696-minimum-string-length-after-removing-substrings ├── 2696-minimum-string-length-after-removing-substrings.py ├── NOTES.md └── README.md ├── 2697-lexicographically-smallest-palindrome ├── 2697-lexicographically-smallest-palindrome.py ├── NOTES.md └── README.md ├── 2698-find-the-punishment-number-of-an-integer ├── 2698-find-the-punishment-number-of-an-integer.py ├── NOTES.md └── README.md ├── 2709-greatest-common-divisor-traversal ├── 2709-greatest-common-divisor-traversal.py └── NOTES.md ├── 2730-find-the-longest-semi-repetitive-substring ├── 2730-find-the-longest-semi-repetitive-substring.py ├── NOTES.md └── README.md ├── 2739-total-distance-traveled ├── 2739-total-distance-traveled.py ├── NOTES.md └── README.md ├── 2740-find-the-value-of-the-partition ├── 2740-find-the-value-of-the-partition.py └── README.md ├── 2742-painting-the-walls ├── 2742-painting-the-walls.py ├── NOTES.md └── README.md ├── 2744-find-maximum-number-of-string-pairs ├── 2744-find-maximum-number-of-string-pairs.py ├── NOTES.md └── README.md ├── 2745-construct-the-longest-new-string ├── 2745-construct-the-longest-new-string.py ├── NOTES.md └── README.md ├── 2748-number-of-beautiful-pairs ├── 2748-number-of-beautiful-pairs.py ├── NOTES.md └── README.md ├── 2750-ways-to-split-array-into-good-subarrays ├── 2750-ways-to-split-array-into-good-subarrays.py └── README.md ├── 2785-sort-vowels-in-a-string ├── 2785-sort-vowels-in-a-string.py └── README.md ├── 2816-double-a-number-represented-as-a-linked-list ├── 2816-double-a-number-represented-as-a-linked-list.py ├── NOTES.md └── README.md ├── 2833-furthest-point-from-origin ├── 2833-furthest-point-from-origin.py ├── NOTES.md └── README.md ├── 2834-find-the-minimum-possible-sum-of-a-beautiful-array ├── 2834-find-the-minimum-possible-sum-of-a-beautiful-array.py └── README.md ├── 2849-determine-if-a-cell-is-reachable-at-a-given-time ├── 2849-determine-if-a-cell-is-reachable-at-a-given-time.py ├── NOTES.md └── README.md ├── 2870-minimum-number-of-operations-to-make-array-empty ├── 2870-minimum-number-of-operations-to-make-array-empty.py ├── NOTES.md └── README.md ├── 2997-minimum-number-of-operations-to-make-array-xor-equal-to-k ├── 2997-minimum-number-of-operations-to-make-array-xor-equal-to-k.py ├── NOTES.md └── README.md ├── 3068-find-the-maximum-sum-of-node-values ├── 3068-find-the-maximum-sum-of-node-values.py ├── NOTES.md └── README.md ├── Array Removals - GFG ├── README.md └── array-removals.py ├── BFS of graph - GFG ├── README.md └── bfs-of-graph.py ├── Binary subarray with sum - GFG ├── README.md └── binary-subarray-with-sum.py ├── Bottom View of Binary Tree - GFG ├── README.md └── bottom-view-of-binary-tree.py ├── Common elements - GFG ├── README.md └── common-elements.py ├── Construct Tree from Inorder & Preorder - GFG ├── README.md └── construct-tree-from-inorder-preorder.py ├── Count Digits - GFG ├── README.md └── count-digits.py ├── Count Number of Nodes in a Binary Tree - GFG ├── README.md └── count-number-of-nodes-in-a-binary-tree.py ├── Count Palindromic Subsequences - GFG ├── README.md └── count-palindromic-subsequences.py ├── Count Subarray with k odds - GFG ├── README.md └── count-subarray-with-k-odds.py ├── Count pairs with given sum - GFG ├── README.md └── count-pairs-with-given-sum.py ├── Count the subarrays having product less than k - GFG ├── README.md └── count-the-subarrays-having-product-less-than-k.py ├── Cyclically rotate an array by one - GFG ├── README.md └── cyclically-rotate-an-array-by-one.py ├── DFS of Graph - GFG ├── README.md └── dfs-of-graph.py ├── Data Type - GFG ├── README.md └── data-type.py ├── Determine if Two Trees are Identical - GFG ├── README.md └── determine-if-two-trees-are-identical.py ├── Disarrangement of balls - GFG └── README.md ├── Duplicate subtree in Binary Tree - GFG ├── README.md └── duplicate-subtree-in-binary-tree.java ├── Factorials of large numbers - GFG └── README.md ├── For Loop- primeCheck - Java - GFG ├── README.md └── for-loop-prime-check-java.java ├── Fractional Knapsack - GFG ├── README.md └── fractional-knapsack.py ├── Frequencies of Limited Range Array Elements - GFG ├── README.md └── frequencies-of-limited-range-array-elements.py ├── Height of Binary Tree - GFG ├── README.md └── height-of-binary-tree.py ├── Immediate Smaller Element - GFG ├── README.md └── immediate-smaller-element.py ├── Inorder Traversal - GFG ├── README.md └── inorder-traversal.py ├── Job Sequencing Problem - GFG ├── README.md └── job-sequencing-problem.py ├── Kadane's Algorithm - GFG ├── README.md └── kadanes-algorithm.py ├── Kth smallest element - GFG ├── README.md └── kth-smallest-element.py ├── LCS of three strings - GFG ├── README.md └── lcs-of-three-strings.py ├── LICENSE ├── Largest square formed in a matrix - GFG ├── README.md └── largest-square-formed-in-a-matrix.py ├── Largest subarray with 0 sum - GFG ├── README.md └── largest-subarray-with-0-sum.py ├── Left View of Binary Tree - GFG ├── README.md └── left-view-of-binary-tree.py ├── Length of the longest substring - GFG ├── README.md └── length-of-the-longest-substring.py ├── Longest Common Subsequence - GFG ├── README.md └── longest-common-subsequence.py ├── Longest Palindromic Subsequence - GFG ├── README.md └── longest-palindromic-subsequence.py ├── Longest Repeating Character Replacement - GFG ├── README.md └── longest-repeating-character-replacement.py ├── Longest Repeating Subsequence - GFG ├── README.md └── longest-repeating-subsequence.py ├── Longest Sub-Array with Sum K - GFG ├── README.md └── longest-sub-array-with-sum-k.py ├── Longest alternating subsequence - GFG ├── README.md └── longest-alternating-subsequence.py ├── M-Coloring Problem - GFG ├── README.md └── mcoloring-problem.py ├── Maximize Number of 1's - GFG ├── README.md └── maximize-number-of-1s.py ├── Maximum Product Subarray - GFG ├── README.md └── maximum-product-subarray.py ├── Minimize the Heights II - GFG ├── README.md └── minimize-the-heights-ii.py ├── N meetings in one room - GFG ├── README.md └── n-meetings-in-one-room.py ├── Nodes at given distance in binary tree - GFG ├── README.md └── nodes-at-given-distance-in-binary-tree.py ├── Number of Coins - GFG ├── README.md └── number-of-coins.cpp ├── Number of occurrence - GFG ├── README.md └── number-of-occurrence.py ├── Overlapping Intervals - GFG ├── README.md └── overlapping-intervals.py ├── Parenthesis Checker - GFG ├── README.md └── parenthesis-checker.py ├── Pattern 1 - GFG ├── README.md └── pattern-1.py ├── Pattern 13 - GFG ├── README.md └── pattern-13.py ├── Pattern 2 - GFG ├── README.md └── pattern-2.py ├── Pattern 3 - GFG ├── README.md └── pattern-3.py ├── Pattern 4 - GFG ├── README.md └── pattern-4.py ├── Pattern 5 - GFG └── README.md ├── Postorder Traversal (Iterative) - GFG ├── README.md └── postorder-traversal-iterative.py ├── Prefix to Postfix Conversion - GFG ├── README.md └── prefix-to-postfix-conversion.py ├── Preorder Traversal - GFG ├── README.md └── preorder-traversal.py ├── Print N to 1 without loop - GFG ├── README.md └── print-n-to-1-without-loop.py ├── README.md ├── Reverse a String - GFG ├── README.md └── reverse-a-string.py ├── Smallest subarray with sum greater than x - GFG ├── README.md └── smallest-subarray-with-sum-greater-than-x.py ├── Smallest sum contiguous subarray - GFG ├── README.md └── smallest-sum-contiguous-subarray.py ├── Sort an array of 0s, 1s and 2s - GFG ├── README.md └── sort-an-array-of-0s-1s-and-2s.py ├── Subset Sums - GFG ├── README.md └── subset-sums.py ├── Symmetric Tree - GFG ├── README.md └── symmetric-tree.py ├── Three way partitioning - GFG ├── README.md └── three-way-partitioning.py ├── Top K Frequent Elements in Array - | - GFG ├── README.md └── top-k-frequent-elements-in-array-.py ├── Top View of Binary Tree - GFG ├── README.md └── top-view-of-binary-tree.py ├── Triplet Sum in Array - GFG ├── README.md └── triplet-sum-in-array.py ├── Union of two arrays - GFG ├── README.md └── union-of-two-arrays.py ├── ZigZag Tree Traversal - GFG ├── README.md └── zig-zag-tree-traversal.py └── if-else (Decision Making) - GFG ├── README.md └── ifelse-decision-making.py /0001-two-sum/0001-two-sum.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0001-two-sum/0001-two-sum.py -------------------------------------------------------------------------------- /0001-two-sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0001-two-sum/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0001-two-sum/README.md -------------------------------------------------------------------------------- /0002-add-two-numbers/0002-add-two-numbers.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0002-add-two-numbers/0002-add-two-numbers.py -------------------------------------------------------------------------------- /0002-add-two-numbers/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0002-add-two-numbers/README.md -------------------------------------------------------------------------------- /0003-longest-substring-without-repeating-characters/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0004-median-of-two-sorted-arrays/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0004-median-of-two-sorted-arrays/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0004-median-of-two-sorted-arrays/README.md -------------------------------------------------------------------------------- /0005-longest-palindromic-substring/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0005-longest-palindromic-substring/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0005-longest-palindromic-substring/README.md -------------------------------------------------------------------------------- /0006-zigzag-conversion/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0006-zigzag-conversion/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0006-zigzag-conversion/README.md -------------------------------------------------------------------------------- /0014-longest-common-prefix/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0014-longest-common-prefix/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0014-longest-common-prefix/README.md -------------------------------------------------------------------------------- /0017-letter-combinations-of-a-phone-number/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0018-4sum/0018-4sum.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0018-4sum/0018-4sum.py -------------------------------------------------------------------------------- /0018-4sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0018-4sum/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0018-4sum/README.md -------------------------------------------------------------------------------- /0019-remove-nth-node-from-end-of-list/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0020-valid-parentheses/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0020-valid-parentheses/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0020-valid-parentheses/README.md -------------------------------------------------------------------------------- /0021-merge-two-sorted-lists/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0021-merge-two-sorted-lists/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0021-merge-two-sorted-lists/README.md -------------------------------------------------------------------------------- /0022-generate-parentheses/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0023-merge-k-sorted-lists/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0023-merge-k-sorted-lists/README.md -------------------------------------------------------------------------------- /0024-swap-nodes-in-pairs/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0024-swap-nodes-in-pairs/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0024-swap-nodes-in-pairs/README.md -------------------------------------------------------------------------------- /0025-reverse-nodes-in-k-group/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0025-reverse-nodes-in-k-group/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0025-reverse-nodes-in-k-group/README.md -------------------------------------------------------------------------------- /0026-remove-duplicates-from-sorted-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0028-find-the-index-of-the-first-occurrence-in-a-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0031-next-permutation/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0031-next-permutation/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0031-next-permutation/README.md -------------------------------------------------------------------------------- /0033-search-in-rotated-sorted-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0033-search-in-rotated-sorted-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0033-search-in-rotated-sorted-array/README.md -------------------------------------------------------------------------------- /0034-find-first-and-last-position-of-element-in-sorted-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0035-search-insert-position/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0035-search-insert-position/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0035-search-insert-position/README.md -------------------------------------------------------------------------------- /0037-sudoku-solver/0037-sudoku-solver.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0037-sudoku-solver/0037-sudoku-solver.py -------------------------------------------------------------------------------- /0037-sudoku-solver/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0037-sudoku-solver/README.md -------------------------------------------------------------------------------- /0039-combination-sum/0039-combination-sum.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0039-combination-sum/0039-combination-sum.py -------------------------------------------------------------------------------- /0039-combination-sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0039-combination-sum/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0039-combination-sum/README.md -------------------------------------------------------------------------------- /0041-first-missing-positive/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0041-first-missing-positive/README.md -------------------------------------------------------------------------------- /0042-trapping-rain-water/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0042-trapping-rain-water/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0042-trapping-rain-water/README.md -------------------------------------------------------------------------------- /0045-jump-game-ii/0045-jump-game-ii.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0045-jump-game-ii/0045-jump-game-ii.py -------------------------------------------------------------------------------- /0045-jump-game-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0045-jump-game-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0045-jump-game-ii/README.md -------------------------------------------------------------------------------- /0048-rotate-image/0048-rotate-image.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0048-rotate-image/0048-rotate-image.py -------------------------------------------------------------------------------- /0048-rotate-image/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0048-rotate-image/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0048-rotate-image/README.md -------------------------------------------------------------------------------- /0049-group-anagrams/0049-group-anagrams.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0049-group-anagrams/0049-group-anagrams.py -------------------------------------------------------------------------------- /0049-group-anagrams/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0049-group-anagrams/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0049-group-anagrams/README.md -------------------------------------------------------------------------------- /0050-powx-n/0050-powx-n.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0050-powx-n/0050-powx-n.py -------------------------------------------------------------------------------- /0050-powx-n/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0051-n-queens/0051-n-queens.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0051-n-queens/0051-n-queens.py -------------------------------------------------------------------------------- /0051-n-queens/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0051-n-queens/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0051-n-queens/README.md -------------------------------------------------------------------------------- /0053-maximum-subarray/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0053-maximum-subarray/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0053-maximum-subarray/README.md -------------------------------------------------------------------------------- /0054-spiral-matrix/0054-spiral-matrix.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0054-spiral-matrix/0054-spiral-matrix.py -------------------------------------------------------------------------------- /0054-spiral-matrix/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0054-spiral-matrix/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0054-spiral-matrix/README.md -------------------------------------------------------------------------------- /0055-jump-game/0055-jump-game.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0055-jump-game/0055-jump-game.py -------------------------------------------------------------------------------- /0055-jump-game/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0055-jump-game/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0055-jump-game/README.md -------------------------------------------------------------------------------- /0056-merge-intervals/0056-merge-intervals.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0056-merge-intervals/0056-merge-intervals.py -------------------------------------------------------------------------------- /0056-merge-intervals/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0056-merge-intervals/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0056-merge-intervals/README.md -------------------------------------------------------------------------------- /0057-insert-interval/0057-insert-interval.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0057-insert-interval/0057-insert-interval.py -------------------------------------------------------------------------------- /0057-insert-interval/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0057-insert-interval/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0057-insert-interval/README.md -------------------------------------------------------------------------------- /0059-spiral-matrix-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0059-spiral-matrix-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0059-spiral-matrix-ii/README.md -------------------------------------------------------------------------------- /0060-permutation-sequence/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0060-permutation-sequence/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0060-permutation-sequence/README.md -------------------------------------------------------------------------------- /0063-unique-paths-ii/0063-unique-paths-ii.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0063-unique-paths-ii/0063-unique-paths-ii.py -------------------------------------------------------------------------------- /0063-unique-paths-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0063-unique-paths-ii/README.md -------------------------------------------------------------------------------- /0064-minimum-path-sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0064-minimum-path-sum/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0064-minimum-path-sum/README.md -------------------------------------------------------------------------------- /0067-add-binary/0067-add-binary.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0067-add-binary/0067-add-binary.py -------------------------------------------------------------------------------- /0067-add-binary/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0067-add-binary/README.md -------------------------------------------------------------------------------- /0070-climbing-stairs/0070-climbing-stairs.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0070-climbing-stairs/0070-climbing-stairs.py -------------------------------------------------------------------------------- /0070-climbing-stairs/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0070-climbing-stairs/README.md -------------------------------------------------------------------------------- /0071-simplify-path/0071-simplify-path.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0071-simplify-path/0071-simplify-path.py -------------------------------------------------------------------------------- /0071-simplify-path/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0071-simplify-path/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0071-simplify-path/README.md -------------------------------------------------------------------------------- /0072-edit-distance/0072-edit-distance.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0072-edit-distance/0072-edit-distance.py -------------------------------------------------------------------------------- /0072-edit-distance/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0073-set-matrix-zeroes/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0073-set-matrix-zeroes/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0073-set-matrix-zeroes/README.md -------------------------------------------------------------------------------- /0074-search-a-2d-matrix/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0075-sort-colors/0075-sort-colors.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0075-sort-colors/0075-sort-colors.py -------------------------------------------------------------------------------- /0075-sort-colors/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0075-sort-colors/README.md -------------------------------------------------------------------------------- /0076-minimum-window-substring/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0076-minimum-window-substring/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0076-minimum-window-substring/README.md -------------------------------------------------------------------------------- /0077-combinations/0077-combinations.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0077-combinations/0077-combinations.py -------------------------------------------------------------------------------- /0077-combinations/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0077-combinations/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0077-combinations/README.md -------------------------------------------------------------------------------- /0078-subsets/0078-subsets.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0078-subsets/0078-subsets.py -------------------------------------------------------------------------------- /0078-subsets/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0078-subsets/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0078-subsets/README.md -------------------------------------------------------------------------------- /0079-word-search/0079-word-search.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0079-word-search/0079-word-search.py -------------------------------------------------------------------------------- /0079-word-search/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0079-word-search/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0079-word-search/README.md -------------------------------------------------------------------------------- /0081-search-in-rotated-sorted-array-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0084-largest-rectangle-in-histogram/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0084-largest-rectangle-in-histogram/README.md -------------------------------------------------------------------------------- /0085-maximal-rectangle/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0086-partition-list/0086-partition-list.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0086-partition-list/0086-partition-list.py -------------------------------------------------------------------------------- /0086-partition-list/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0086-partition-list/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0086-partition-list/README.md -------------------------------------------------------------------------------- /0087-scramble-string/0087-scramble-string.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0087-scramble-string/0087-scramble-string.py -------------------------------------------------------------------------------- /0087-scramble-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0087-scramble-string/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0087-scramble-string/README.md -------------------------------------------------------------------------------- /0088-merge-sorted-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0088-merge-sorted-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0088-merge-sorted-array/README.md -------------------------------------------------------------------------------- /0090-subsets-ii/0090-subsets-ii.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0090-subsets-ii/0090-subsets-ii.py -------------------------------------------------------------------------------- /0090-subsets-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0090-subsets-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0090-subsets-ii/README.md -------------------------------------------------------------------------------- /0093-restore-ip-addresses/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0094-binary-tree-inorder-traversal/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0094-binary-tree-inorder-traversal/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0094-binary-tree-inorder-traversal/README.md -------------------------------------------------------------------------------- /0095-unique-binary-search-trees-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0095-unique-binary-search-trees-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0095-unique-binary-search-trees-ii/README.md -------------------------------------------------------------------------------- /0098-validate-binary-search-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0098-validate-binary-search-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0098-validate-binary-search-tree/README.md -------------------------------------------------------------------------------- /0100-same-tree/0100-same-tree.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0100-same-tree/0100-same-tree.py -------------------------------------------------------------------------------- /0100-same-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0100-same-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0100-same-tree/README.md -------------------------------------------------------------------------------- /0101-symmetric-tree/0101-symmetric-tree.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0101-symmetric-tree/0101-symmetric-tree.py -------------------------------------------------------------------------------- /0101-symmetric-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0101-symmetric-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0101-symmetric-tree/README.md -------------------------------------------------------------------------------- /0102-binary-tree-level-order-traversal/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0103-binary-tree-zigzag-level-order-traversal/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0104-maximum-depth-of-binary-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0104-maximum-depth-of-binary-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0104-maximum-depth-of-binary-tree/README.md -------------------------------------------------------------------------------- /0105-construct-binary-tree-from-preorder-and-inorder-traversal/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0106-construct-binary-tree-from-inorder-and-postorder-traversal/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0109-convert-sorted-list-to-binary-search-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0110-balanced-binary-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0110-balanced-binary-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0110-balanced-binary-tree/README.md -------------------------------------------------------------------------------- /0111-minimum-depth-of-binary-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0111-minimum-depth-of-binary-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0111-minimum-depth-of-binary-tree/README.md -------------------------------------------------------------------------------- /0114-flatten-binary-tree-to-linked-list/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0118-pascals-triangle/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0118-pascals-triangle/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0118-pascals-triangle/README.md -------------------------------------------------------------------------------- /0119-pascals-triangle-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0119-pascals-triangle-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0119-pascals-triangle-ii/README.md -------------------------------------------------------------------------------- /0121-best-time-to-buy-and-sell-stock/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0124-binary-tree-maximum-path-sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0124-binary-tree-maximum-path-sum/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0124-binary-tree-maximum-path-sum/README.md -------------------------------------------------------------------------------- /0128-longest-consecutive-sequence/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0129-sum-root-to-leaf-numbers/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0129-sum-root-to-leaf-numbers/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0129-sum-root-to-leaf-numbers/README.md -------------------------------------------------------------------------------- /0131-palindrome-partitioning/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0133-clone-graph/0133-clone-graph.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0133-clone-graph/0133-clone-graph.py -------------------------------------------------------------------------------- /0133-clone-graph/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0133-clone-graph/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0133-clone-graph/README.md -------------------------------------------------------------------------------- /0134-gas-station/0134-gas-station.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0134-gas-station/0134-gas-station.py -------------------------------------------------------------------------------- /0134-gas-station/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0134-gas-station/README.md -------------------------------------------------------------------------------- /0135-candy/0135-candy.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0135-candy/0135-candy.py -------------------------------------------------------------------------------- /0135-candy/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0135-candy/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0135-candy/README.md -------------------------------------------------------------------------------- /0136-single-number/0136-single-number.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0136-single-number/0136-single-number.py -------------------------------------------------------------------------------- /0136-single-number/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0136-single-number/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0136-single-number/README.md -------------------------------------------------------------------------------- /0137-single-number-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0139-word-break/0139-word-break.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0139-word-break/0139-word-break.py -------------------------------------------------------------------------------- /0139-word-break/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0141-linked-list-cycle/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0141-linked-list-cycle/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0141-linked-list-cycle/README.md -------------------------------------------------------------------------------- /0142-linked-list-cycle-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0144-binary-tree-preorder-traversal/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0144-binary-tree-preorder-traversal/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0144-binary-tree-preorder-traversal/README.md -------------------------------------------------------------------------------- /0146-lru-cache/0146-lru-cache.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0146-lru-cache/0146-lru-cache.py -------------------------------------------------------------------------------- /0146-lru-cache/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0149-max-points-on-a-line/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0150-evaluate-reverse-polish-notation/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0151-reverse-words-in-a-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0151-reverse-words-in-a-string/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0151-reverse-words-in-a-string/README.md -------------------------------------------------------------------------------- /0152-maximum-product-subarray/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0152-maximum-product-subarray/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0152-maximum-product-subarray/README.md -------------------------------------------------------------------------------- /0153-find-minimum-in-rotated-sorted-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0155-min-stack/0155-min-stack.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0155-min-stack/0155-min-stack.py -------------------------------------------------------------------------------- /0155-min-stack/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0155-min-stack/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0155-min-stack/README.md -------------------------------------------------------------------------------- /0160-intersection-of-two-linked-lists/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0165-compare-version-numbers/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0165-compare-version-numbers/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0165-compare-version-numbers/README.md -------------------------------------------------------------------------------- /0168-excel-sheet-column-title/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0168-excel-sheet-column-title/README.md -------------------------------------------------------------------------------- /0189-rotate-array/0189-rotate-array.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0189-rotate-array/0189-rotate-array.py -------------------------------------------------------------------------------- /0189-rotate-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0189-rotate-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0189-rotate-array/README.md -------------------------------------------------------------------------------- /0197-rising-temperature/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0198-house-robber/0198-house-robber.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0198-house-robber/0198-house-robber.py -------------------------------------------------------------------------------- /0198-house-robber/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0198-house-robber/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0198-house-robber/README.md -------------------------------------------------------------------------------- /0199-binary-tree-right-side-view/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0199-binary-tree-right-side-view/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0199-binary-tree-right-side-view/README.md -------------------------------------------------------------------------------- /0200-number-of-islands/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0200-number-of-islands/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0200-number-of-islands/README.md -------------------------------------------------------------------------------- /0205-isomorphic-strings/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0205-isomorphic-strings/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0205-isomorphic-strings/README.md -------------------------------------------------------------------------------- /0206-reverse-linked-list/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0206-reverse-linked-list/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0206-reverse-linked-list/README.md -------------------------------------------------------------------------------- /0207-course-schedule/0207-course-schedule.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0207-course-schedule/0207-course-schedule.py -------------------------------------------------------------------------------- /0207-course-schedule/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0207-course-schedule/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0207-course-schedule/README.md -------------------------------------------------------------------------------- /0208-implement-trie-prefix-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0208-implement-trie-prefix-tree/README.md -------------------------------------------------------------------------------- /0209-minimum-size-subarray-sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0209-minimum-size-subarray-sum/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0209-minimum-size-subarray-sum/README.md -------------------------------------------------------------------------------- /0211-design-add-and-search-words-data-structure/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0212-word-search-ii/0212-word-search-ii.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0212-word-search-ii/0212-word-search-ii.py -------------------------------------------------------------------------------- /0212-word-search-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0212-word-search-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0212-word-search-ii/README.md -------------------------------------------------------------------------------- /0221-maximal-square/0221-maximal-square.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0221-maximal-square/0221-maximal-square.py -------------------------------------------------------------------------------- /0221-maximal-square/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0221-maximal-square/README.md -------------------------------------------------------------------------------- /0222-count-complete-tree-nodes/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0222-count-complete-tree-nodes/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0222-count-complete-tree-nodes/README.md -------------------------------------------------------------------------------- /0223-rectangle-area/0223-rectangle-area.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0223-rectangle-area/0223-rectangle-area.py -------------------------------------------------------------------------------- /0223-rectangle-area/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0223-rectangle-area/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0223-rectangle-area/README.md -------------------------------------------------------------------------------- /0226-invert-binary-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0226-invert-binary-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0226-invert-binary-tree/README.md -------------------------------------------------------------------------------- /0228-summary-ranges/0228-summary-ranges.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0228-summary-ranges/0228-summary-ranges.py -------------------------------------------------------------------------------- /0228-summary-ranges/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0228-summary-ranges/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0228-summary-ranges/README.md -------------------------------------------------------------------------------- /0229-majority-element-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0229-majority-element-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0229-majority-element-ii/README.md -------------------------------------------------------------------------------- /0232-implement-queue-using-stacks/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0232-implement-queue-using-stacks/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0232-implement-queue-using-stacks/README.md -------------------------------------------------------------------------------- /0234-palindrome-linked-list/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0235-lowest-common-ancestor-of-a-binary-search-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0236-lowest-common-ancestor-of-a-binary-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0237-delete-node-in-a-linked-list/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0237-delete-node-in-a-linked-list/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0237-delete-node-in-a-linked-list/README.md -------------------------------------------------------------------------------- /0242-valid-anagram/0242-valid-anagram.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0242-valid-anagram/0242-valid-anagram.py -------------------------------------------------------------------------------- /0242-valid-anagram/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0242-valid-anagram/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0242-valid-anagram/README.md -------------------------------------------------------------------------------- /0257-binary-tree-paths/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0257-binary-tree-paths/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0257-binary-tree-paths/README.md -------------------------------------------------------------------------------- /0258-add-digits/0258-add-digits.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0258-add-digits/0258-add-digits.py -------------------------------------------------------------------------------- /0258-add-digits/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0258-add-digits/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0258-add-digits/README.md -------------------------------------------------------------------------------- /0268-missing-number/0268-missing-number.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0268-missing-number/0268-missing-number.py -------------------------------------------------------------------------------- /0268-missing-number/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0268-missing-number/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0268-missing-number/README.md -------------------------------------------------------------------------------- /0279-perfect-squares/0279-perfect-squares.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0279-perfect-squares/0279-perfect-squares.py -------------------------------------------------------------------------------- /0279-perfect-squares/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0279-perfect-squares/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0279-perfect-squares/README.md -------------------------------------------------------------------------------- /0283-move-zeroes/0283-move-zeroes.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0283-move-zeroes/0283-move-zeroes.py -------------------------------------------------------------------------------- /0283-move-zeroes/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0283-move-zeroes/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0283-move-zeroes/README.md -------------------------------------------------------------------------------- /0287-find-the-duplicate-number/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0287-find-the-duplicate-number/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0287-find-the-duplicate-number/README.md -------------------------------------------------------------------------------- /0290-word-pattern/0290-word-pattern.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0290-word-pattern/0290-word-pattern.py -------------------------------------------------------------------------------- /0290-word-pattern/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0300-longest-increasing-subsequence/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0300-longest-increasing-subsequence/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0300-longest-increasing-subsequence/README.md -------------------------------------------------------------------------------- /0309-best-time-to-buy-and-sell-stock-with-cooldown/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0316-remove-duplicate-letters/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0316-remove-duplicate-letters/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0316-remove-duplicate-letters/README.md -------------------------------------------------------------------------------- /0319-bulb-switcher/0319-bulb-switcher.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0319-bulb-switcher/0319-bulb-switcher.py -------------------------------------------------------------------------------- /0319-bulb-switcher/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0319-bulb-switcher/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0319-bulb-switcher/README.md -------------------------------------------------------------------------------- /0328-odd-even-linked-list/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0328-odd-even-linked-list/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0328-odd-even-linked-list/README.md -------------------------------------------------------------------------------- /0332-reconstruct-itinerary/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0332-reconstruct-itinerary/README.md -------------------------------------------------------------------------------- /0341-flatten-nested-list-iterator/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0341-flatten-nested-list-iterator/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0341-flatten-nested-list-iterator/README.md -------------------------------------------------------------------------------- /0342-power-of-four/0342-power-of-four.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0342-power-of-four/0342-power-of-four.py -------------------------------------------------------------------------------- /0342-power-of-four/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0342-power-of-four/README.md -------------------------------------------------------------------------------- /0344-reverse-string/0344-reverse-string.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0344-reverse-string/0344-reverse-string.py -------------------------------------------------------------------------------- /0344-reverse-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0344-reverse-string/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0344-reverse-string/README.md -------------------------------------------------------------------------------- /0345-reverse-vowels-of-a-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0345-reverse-vowels-of-a-string/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0345-reverse-vowels-of-a-string/README.md -------------------------------------------------------------------------------- /0347-top-k-frequent-elements/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0347-top-k-frequent-elements/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0347-top-k-frequent-elements/README.md -------------------------------------------------------------------------------- /0352-data-stream-as-disjoint-intervals/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0367-valid-perfect-square/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0367-valid-perfect-square/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0367-valid-perfect-square/README.md -------------------------------------------------------------------------------- /0373-find-k-pairs-with-smallest-sums/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0374-guess-number-higher-or-lower/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0376-wiggle-subsequence/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0376-wiggle-subsequence/README.md -------------------------------------------------------------------------------- /0380-insert-delete-getrandom-o1/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0380-insert-delete-getrandom-o1/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0380-insert-delete-getrandom-o1/README.md -------------------------------------------------------------------------------- /0389-find-the-difference/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0389-find-the-difference/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0389-find-the-difference/README.md -------------------------------------------------------------------------------- /0392-is-subsequence/0392-is-subsequence.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0392-is-subsequence/0392-is-subsequence.py -------------------------------------------------------------------------------- /0392-is-subsequence/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0392-is-subsequence/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0392-is-subsequence/README.md -------------------------------------------------------------------------------- /0399-evaluate-division/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0399-evaluate-division/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0399-evaluate-division/README.md -------------------------------------------------------------------------------- /0402-remove-k-digits/0402-remove-k-digits.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0402-remove-k-digits/0402-remove-k-digits.py -------------------------------------------------------------------------------- /0402-remove-k-digits/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0403-frog-jump/0403-frog-jump.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0403-frog-jump/0403-frog-jump.py -------------------------------------------------------------------------------- /0403-frog-jump/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0404-sum-of-left-leaves/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0404-sum-of-left-leaves/README.md -------------------------------------------------------------------------------- /0416-partition-equal-subset-sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0416-partition-equal-subset-sum/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0416-partition-equal-subset-sum/README.md -------------------------------------------------------------------------------- /0424-longest-repeating-character-replacement/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0427-construct-quad-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0427-construct-quad-tree/README.md -------------------------------------------------------------------------------- /0433-minimum-genetic-mutation/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0433-minimum-genetic-mutation/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0433-minimum-genetic-mutation/README.md -------------------------------------------------------------------------------- /0435-non-overlapping-intervals/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0435-non-overlapping-intervals/README.md -------------------------------------------------------------------------------- /0438-find-all-anagrams-in-a-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0438-find-all-anagrams-in-a-string/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0438-find-all-anagrams-in-a-string/README.md -------------------------------------------------------------------------------- /0441-arranging-coins/0441-arranging-coins.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0441-arranging-coins/0441-arranging-coins.py -------------------------------------------------------------------------------- /0441-arranging-coins/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0441-arranging-coins/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0441-arranging-coins/README.md -------------------------------------------------------------------------------- /0443-string-compression/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0443-string-compression/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0443-string-compression/README.md -------------------------------------------------------------------------------- /0445-add-two-numbers-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0445-add-two-numbers-ii/README.md -------------------------------------------------------------------------------- /0446-arithmetic-slices-ii-subsequence/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0451-sort-characters-by-frequency/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0451-sort-characters-by-frequency/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0451-sort-characters-by-frequency/README.md -------------------------------------------------------------------------------- /0452-minimum-number-of-arrows-to-burst-balloons/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0455-assign-cookies/0455-assign-cookies.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0455-assign-cookies/0455-assign-cookies.py -------------------------------------------------------------------------------- /0455-assign-cookies/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0455-assign-cookies/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0455-assign-cookies/README.md -------------------------------------------------------------------------------- /0456-132-pattern/0456-132-pattern.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0456-132-pattern/0456-132-pattern.py -------------------------------------------------------------------------------- /0456-132-pattern/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0456-132-pattern/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0456-132-pattern/README.md -------------------------------------------------------------------------------- /0458-poor-pigs/0458-poor-pigs.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0458-poor-pigs/0458-poor-pigs.py -------------------------------------------------------------------------------- /0458-poor-pigs/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0458-poor-pigs/README.md -------------------------------------------------------------------------------- /0460-lfu-cache/0460-lfu-cache.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0460-lfu-cache/0460-lfu-cache.py -------------------------------------------------------------------------------- /0460-lfu-cache/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0460-lfu-cache/README.md -------------------------------------------------------------------------------- /0463-island-perimeter/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0463-island-perimeter/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0463-island-perimeter/README.md -------------------------------------------------------------------------------- /0472-concatenated-words/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0472-concatenated-words/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0472-concatenated-words/README.md -------------------------------------------------------------------------------- /0473-matchsticks-to-square/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0473-matchsticks-to-square/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0473-matchsticks-to-square/README.md -------------------------------------------------------------------------------- /0474-ones-and-zeroes/0474-ones-and-zeroes.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0474-ones-and-zeroes/0474-ones-and-zeroes.py -------------------------------------------------------------------------------- /0474-ones-and-zeroes/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0474-ones-and-zeroes/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0474-ones-and-zeroes/README.md -------------------------------------------------------------------------------- /0485-max-consecutive-ones/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0485-max-consecutive-ones/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0485-max-consecutive-ones/README.md -------------------------------------------------------------------------------- /0486-predict-the-winner/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0486-predict-the-winner/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0486-predict-the-winner/README.md -------------------------------------------------------------------------------- /0491-non-decreasing-subsequences/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0491-non-decreasing-subsequences/README.md -------------------------------------------------------------------------------- /0493-reverse-pairs/0493-reverse-pairs.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0493-reverse-pairs/0493-reverse-pairs.py -------------------------------------------------------------------------------- /0493-reverse-pairs/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0493-reverse-pairs/README.md -------------------------------------------------------------------------------- /0494-target-sum/0494-target-sum.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0494-target-sum/0494-target-sum.py -------------------------------------------------------------------------------- /0494-target-sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0496-next-greater-element-i/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0496-next-greater-element-i/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0496-next-greater-element-i/README.md -------------------------------------------------------------------------------- /0502-ipo/0502-ipo.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0502-ipo/0502-ipo.py -------------------------------------------------------------------------------- /0502-ipo/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0502-ipo/README.md -------------------------------------------------------------------------------- /0503-next-greater-element-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0503-next-greater-element-ii/README.md -------------------------------------------------------------------------------- /0513-find-bottom-left-tree-value/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0513-find-bottom-left-tree-value/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0513-find-bottom-left-tree-value/README.md -------------------------------------------------------------------------------- /0514-freedom-trail/0514-freedom-trail.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0514-freedom-trail/0514-freedom-trail.py -------------------------------------------------------------------------------- /0514-freedom-trail/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0514-freedom-trail/README.md -------------------------------------------------------------------------------- /0515-find-largest-value-in-each-tree-row/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0516-longest-palindromic-subsequence/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0518-coin-change-ii/0518-coin-change-ii.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0518-coin-change-ii/0518-coin-change-ii.py -------------------------------------------------------------------------------- /0518-coin-change-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0518-coin-change-ii/README.md -------------------------------------------------------------------------------- /0520-detect-capital/0520-detect-capital.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0520-detect-capital/0520-detect-capital.py -------------------------------------------------------------------------------- /0520-detect-capital/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0520-detect-capital/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0520-detect-capital/README.md -------------------------------------------------------------------------------- /0530-minimum-absolute-difference-in-bst/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0540-single-element-in-a-sorted-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0542-01-matrix/0542-01-matrix.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0542-01-matrix/0542-01-matrix.py -------------------------------------------------------------------------------- /0542-01-matrix/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0542-01-matrix/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0542-01-matrix/README.md -------------------------------------------------------------------------------- /0543-diameter-of-binary-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0543-diameter-of-binary-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0543-diameter-of-binary-tree/README.md -------------------------------------------------------------------------------- /0547-number-of-provinces/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0557-reverse-words-in-a-string-iii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0560-subarray-sum-equals-k/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0560-subarray-sum-equals-k/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0560-subarray-sum-equals-k/README.md -------------------------------------------------------------------------------- /0567-permutation-in-string/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0567-permutation-in-string/README.md -------------------------------------------------------------------------------- /0572-subtree-of-another-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0572-subtree-of-another-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0572-subtree-of-another-tree/README.md -------------------------------------------------------------------------------- /0576-out-of-boundary-paths/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0576-out-of-boundary-paths/README.md -------------------------------------------------------------------------------- /0584-find-customer-referee/0584-find-customer-referee.sql: -------------------------------------------------------------------------------- 1 | select name from Customer where COALESCE(referee_id,0)<>2; -------------------------------------------------------------------------------- /0584-find-customer-referee/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0584-find-customer-referee/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0584-find-customer-referee/README.md -------------------------------------------------------------------------------- /0587-erect-the-fence/0587-erect-the-fence.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0587-erect-the-fence/0587-erect-the-fence.py -------------------------------------------------------------------------------- /0587-erect-the-fence/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0595-big-countries/0595-big-countries.sql: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0595-big-countries/0595-big-countries.sql -------------------------------------------------------------------------------- /0595-big-countries/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0595-big-countries/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0595-big-countries/README.md -------------------------------------------------------------------------------- /0596-classes-more-than-5-students/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0605-can-place-flowers/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0605-can-place-flowers/README.md -------------------------------------------------------------------------------- /0619-biggest-single-number/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0619-biggest-single-number/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0619-biggest-single-number/README.md -------------------------------------------------------------------------------- /0620-not-boring-movies/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0620-not-boring-movies/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0620-not-boring-movies/README.md -------------------------------------------------------------------------------- /0623-add-one-row-to-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0623-add-one-row-to-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0623-add-one-row-to-tree/README.md -------------------------------------------------------------------------------- /0628-maximum-product-of-three-numbers/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0629-k-inverse-pairs-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0629-k-inverse-pairs-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0629-k-inverse-pairs-array/README.md -------------------------------------------------------------------------------- /0645-set-mismatch/0645-set-mismatch.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0645-set-mismatch/0645-set-mismatch.py -------------------------------------------------------------------------------- /0645-set-mismatch/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0645-set-mismatch/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0645-set-mismatch/README.md -------------------------------------------------------------------------------- /0646-maximum-length-of-pair-chain/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0649-dota2-senate/0649-dota2-senate.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0649-dota2-senate/0649-dota2-senate.py -------------------------------------------------------------------------------- /0649-dota2-senate/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0652-find-duplicate-subtrees/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0652-find-duplicate-subtrees/README.md -------------------------------------------------------------------------------- /0658-find-k-closest-elements/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0658-find-k-closest-elements/README.md -------------------------------------------------------------------------------- /0661-image-smoother/0661-image-smoother.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0661-image-smoother/0661-image-smoother.py -------------------------------------------------------------------------------- /0661-image-smoother/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0661-image-smoother/README.md -------------------------------------------------------------------------------- /0662-maximum-width-of-binary-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0664-strange-printer/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0673-number-of-longest-increasing-subsequence/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0674-longest-continuous-increasing-subsequence/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0678-valid-parenthesis-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0678-valid-parenthesis-string/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0678-valid-parenthesis-string/README.md -------------------------------------------------------------------------------- /0698-partition-to-k-equal-sum-subsets/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0700-search-in-a-binary-search-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0703-kth-largest-element-in-a-stream/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0704-binary-search/0704-binary-search.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0704-binary-search/0704-binary-search.py -------------------------------------------------------------------------------- /0704-binary-search/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0704-binary-search/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0704-binary-search/README.md -------------------------------------------------------------------------------- /0705-design-hashset/0705-design-hashset.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0705-design-hashset/0705-design-hashset.py -------------------------------------------------------------------------------- /0705-design-hashset/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0705-design-hashset/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0705-design-hashset/README.md -------------------------------------------------------------------------------- /0706-design-hashmap/0706-design-hashmap.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0706-design-hashmap/0706-design-hashmap.py -------------------------------------------------------------------------------- /0706-design-hashmap/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0706-design-hashmap/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0706-design-hashmap/README.md -------------------------------------------------------------------------------- /0712-minimum-ascii-delete-sum-for-two-strings/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0714-best-time-to-buy-and-sell-stock-with-transaction-fee/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0730-count-different-palindromic-subsequences/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0733-flood-fill/0733-flood-fill.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0733-flood-fill/0733-flood-fill.py -------------------------------------------------------------------------------- /0733-flood-fill/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0733-flood-fill/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0733-flood-fill/README.md -------------------------------------------------------------------------------- /0735-asteroid-collision/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0735-asteroid-collision/README.md -------------------------------------------------------------------------------- /0739-daily-temperatures/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0739-daily-temperatures/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0739-daily-temperatures/README.md -------------------------------------------------------------------------------- /0744-find-smallest-letter-greater-than-target/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0746-min-cost-climbing-stairs/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0746-min-cost-climbing-stairs/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0746-min-cost-climbing-stairs/README.md -------------------------------------------------------------------------------- /0752-open-the-lock/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0752-open-the-lock/README.md -------------------------------------------------------------------------------- /0766-toeplitz-matrix/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0766-toeplitz-matrix/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0766-toeplitz-matrix/README.md -------------------------------------------------------------------------------- /0767-reorganize-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0767-reorganize-string/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0767-reorganize-string/README.md -------------------------------------------------------------------------------- /0779-k-th-symbol-in-grammar/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0779-k-th-symbol-in-grammar/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0779-k-th-symbol-in-grammar/README.md -------------------------------------------------------------------------------- /0783-minimum-distance-between-bst-nodes/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0785-is-graph-bipartite/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0785-is-graph-bipartite/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0785-is-graph-bipartite/README.md -------------------------------------------------------------------------------- /0787-cheapest-flights-within-k-stops/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0796-rotate-string/0796-rotate-string.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0796-rotate-string/0796-rotate-string.py -------------------------------------------------------------------------------- /0796-rotate-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0796-rotate-string/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0796-rotate-string/README.md -------------------------------------------------------------------------------- /0799-champagne-tower/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0799-champagne-tower/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0799-champagne-tower/README.md -------------------------------------------------------------------------------- /0802-find-eventual-safe-states/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0802-find-eventual-safe-states/README.md -------------------------------------------------------------------------------- /0808-soup-servings/0808-soup-servings.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0808-soup-servings/0808-soup-servings.py -------------------------------------------------------------------------------- /0808-soup-servings/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0808-soup-servings/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0808-soup-servings/README.md -------------------------------------------------------------------------------- /0815-bus-routes/0815-bus-routes.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0815-bus-routes/0815-bus-routes.py -------------------------------------------------------------------------------- /0815-bus-routes/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0815-bus-routes/README.md -------------------------------------------------------------------------------- /0823-binary-trees-with-factors/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0823-binary-trees-with-factors/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0823-binary-trees-with-factors/README.md -------------------------------------------------------------------------------- /0834-sum-of-distances-in-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0837-new-21-game/0837-new-21-game.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0837-new-21-game/0837-new-21-game.py -------------------------------------------------------------------------------- /0837-new-21-game/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0837-new-21-game/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0837-new-21-game/README.md -------------------------------------------------------------------------------- /0844-backspace-string-compare/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0844-backspace-string-compare/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0844-backspace-string-compare/README.md -------------------------------------------------------------------------------- /0847-shortest-path-visiting-all-nodes/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0852-peak-index-in-a-mountain-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0859-buddy-strings/0859-buddy-strings.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0859-buddy-strings/0859-buddy-strings.py -------------------------------------------------------------------------------- /0859-buddy-strings/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0859-buddy-strings/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0859-buddy-strings/README.md -------------------------------------------------------------------------------- /0860-lemonade-change/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0860-lemonade-change/README.md -------------------------------------------------------------------------------- /0861-score-after-flipping-matrix/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0861-score-after-flipping-matrix/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0861-score-after-flipping-matrix/README.md -------------------------------------------------------------------------------- /0863-all-nodes-distance-k-in-binary-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0864-shortest-path-to-get-all-keys/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0867-transpose-matrix/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0867-transpose-matrix/README.md -------------------------------------------------------------------------------- /0872-leaf-similar-trees/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0872-leaf-similar-trees/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0872-leaf-similar-trees/README.md -------------------------------------------------------------------------------- /0875-koko-eating-bananas/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0875-koko-eating-bananas/README.md -------------------------------------------------------------------------------- /0876-middle-of-the-linked-list/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0876-middle-of-the-linked-list/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0876-middle-of-the-linked-list/README.md -------------------------------------------------------------------------------- /0879-profitable-schemes/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0879-profitable-schemes/README.md -------------------------------------------------------------------------------- /0880-decoded-string-at-index/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0880-decoded-string-at-index/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0880-decoded-string-at-index/README.md -------------------------------------------------------------------------------- /0881-boats-to-save-people/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0881-boats-to-save-people/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0881-boats-to-save-people/README.md -------------------------------------------------------------------------------- /0887-super-egg-drop/0887-super-egg-drop.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0887-super-egg-drop/0887-super-egg-drop.py -------------------------------------------------------------------------------- /0887-super-egg-drop/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0887-super-egg-drop/README.md -------------------------------------------------------------------------------- /0896-monotonic-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0896-monotonic-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0896-monotonic-array/README.md -------------------------------------------------------------------------------- /0899-orderly-queue/0899-orderly-queue.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0899-orderly-queue/0899-orderly-queue.py -------------------------------------------------------------------------------- /0899-orderly-queue/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0899-orderly-queue/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0899-orderly-queue/README.md -------------------------------------------------------------------------------- /0901-online-stock-span/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0901-online-stock-span/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0901-online-stock-span/README.md -------------------------------------------------------------------------------- /0904-fruit-into-baskets/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0904-fruit-into-baskets/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0904-fruit-into-baskets/README.md -------------------------------------------------------------------------------- /0905-sort-array-by-parity/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0907-sum-of-subarray-minimums/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0907-sum-of-subarray-minimums/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0907-sum-of-subarray-minimums/README.md -------------------------------------------------------------------------------- /0909-snakes-and-ladders/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0909-snakes-and-ladders/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0909-snakes-and-ladders/README.md -------------------------------------------------------------------------------- /0912-sort-an-array/0912-sort-an-array.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0912-sort-an-array/0912-sort-an-array.py -------------------------------------------------------------------------------- /0912-sort-an-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0912-sort-an-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0912-sort-an-array/README.md -------------------------------------------------------------------------------- /0920-number-of-music-playlists/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0920-number-of-music-playlists/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0920-number-of-music-playlists/README.md -------------------------------------------------------------------------------- /0926-flip-string-to-monotone-increasing/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0930-binary-subarrays-with-sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0930-binary-subarrays-with-sum/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0930-binary-subarrays-with-sum/README.md -------------------------------------------------------------------------------- /0932-beautiful-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0932-beautiful-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0932-beautiful-array/README.md -------------------------------------------------------------------------------- /0934-shortest-bridge/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0934-shortest-bridge/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0934-shortest-bridge/README.md -------------------------------------------------------------------------------- /0935-knight-dialer/0935-knight-dialer.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0935-knight-dialer/0935-knight-dialer.py -------------------------------------------------------------------------------- /0935-knight-dialer/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0935-knight-dialer/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0935-knight-dialer/README.md -------------------------------------------------------------------------------- /0938-range-sum-of-bst/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0938-range-sum-of-bst/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0938-range-sum-of-bst/README.md -------------------------------------------------------------------------------- /0944-delete-columns-to-make-sorted/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0946-validate-stack-sequences/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0946-validate-stack-sequences/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0946-validate-stack-sequences/README.md -------------------------------------------------------------------------------- /0948-bag-of-tokens/0948-bag-of-tokens.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0948-bag-of-tokens/0948-bag-of-tokens.py -------------------------------------------------------------------------------- /0948-bag-of-tokens/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0948-bag-of-tokens/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0948-bag-of-tokens/README.md -------------------------------------------------------------------------------- /0953-verifying-an-alien-dictionary/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0956-tallest-billboard/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0956-tallest-billboard/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0956-tallest-billboard/README.md -------------------------------------------------------------------------------- /0977-squares-of-a-sorted-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0977-squares-of-a-sorted-array/README.md -------------------------------------------------------------------------------- /0979-distribute-coins-in-binary-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0981-time-based-key-value-store/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0981-time-based-key-value-store/README.md -------------------------------------------------------------------------------- /0983-minimum-cost-for-tickets/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0988-smallest-string-starting-from-leaf/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0989-add-to-array-form-of-integer/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0992-subarrays-with-k-different-integers/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0994-rotting-oranges/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0994-rotting-oranges/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/0994-rotting-oranges/README.md -------------------------------------------------------------------------------- /1004-max-consecutive-ones-iii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1004-max-consecutive-ones-iii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/1004-max-consecutive-ones-iii/README.md -------------------------------------------------------------------------------- /1011-capacity-to-ship-packages-within-d-days/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1020-number-of-enclaves/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1021-remove-outermost-parentheses/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1026-maximum-difference-between-node-and-ancestor/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1027-longest-arithmetic-subsequence/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1035-uncrossed-lines/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1035-uncrossed-lines/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/1035-uncrossed-lines/README.md -------------------------------------------------------------------------------- /1043-partition-array-for-maximum-sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1045-customers-who-bought-all-products/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1046-last-stone-weight/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1046-last-stone-weight/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/1046-last-stone-weight/README.md -------------------------------------------------------------------------------- /1047-remove-all-adjacent-duplicates-in-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1048-longest-string-chain/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1048-longest-string-chain/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/1048-longest-string-chain/README.md -------------------------------------------------------------------------------- /1061-lexicographically-smallest-equivalent-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1068-product-sales-analysis-i/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1068-product-sales-analysis-i/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/1068-product-sales-analysis-i/README.md -------------------------------------------------------------------------------- /1071-greatest-common-divisor-of-strings/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1074-number-of-submatrices-that-sum-to-target/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1075-project-employees-i/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1075-project-employees-i/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/1075-project-employees-i/README.md -------------------------------------------------------------------------------- /1095-find-in-mountain-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1095-find-in-mountain-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/1095-find-in-mountain-array/README.md -------------------------------------------------------------------------------- /1125-smallest-sufficient-team/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1129-shortest-path-with-alternating-colors/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1137-n-th-tribonacci-number/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1137-n-th-tribonacci-number/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/1137-n-th-tribonacci-number/README.md -------------------------------------------------------------------------------- /1140-stone-game-ii/1140-stone-game-ii.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/1140-stone-game-ii/1140-stone-game-ii.py -------------------------------------------------------------------------------- /1140-stone-game-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1140-stone-game-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/1140-stone-game-ii/README.md -------------------------------------------------------------------------------- /1141-user-activity-for-the-past-30-days-i/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1143-longest-common-subsequence/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1143-longest-common-subsequence/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/1143-longest-common-subsequence/README.md -------------------------------------------------------------------------------- /1146-snapshot-array/1146-snapshot-array.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/1146-snapshot-array/1146-snapshot-array.py -------------------------------------------------------------------------------- /1146-snapshot-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/1146-snapshot-array/README.md -------------------------------------------------------------------------------- /1148-article-views-i/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1148-article-views-i/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/1148-article-views-i/README.md -------------------------------------------------------------------------------- /1162-as-far-from-land-as-possible/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1187-make-array-strictly-increasing/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1207-unique-number-of-occurrences/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1209-remove-all-adjacent-duplicates-in-string-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1219-path-with-maximum-gold/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1219-path-with-maximum-gold/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/1219-path-with-maximum-gold/README.md -------------------------------------------------------------------------------- /1220-count-vowels-permutation/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1220-count-vowels-permutation/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/1220-count-vowels-permutation/README.md -------------------------------------------------------------------------------- /1235-maximum-profit-in-job-scheduling/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1239-maximum-length-of-a-concatenated-string-with-unique-characters/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1248-count-number-of-nice-subarrays/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1249-minimum-remove-to-make-valid-parentheses/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1251-average-selling-price/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1251-average-selling-price/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/1251-average-selling-price/README.md -------------------------------------------------------------------------------- /1254-number-of-closed-islands/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1254-number-of-closed-islands/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/1254-number-of-closed-islands/README.md -------------------------------------------------------------------------------- /1255-maximum-score-words-formed-by-letters/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1266-minimum-time-visiting-all-points/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1269-number-of-ways-to-stay-in-the-same-place-after-some-steps/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1282-group-the-people-given-the-group-size-they-belong-to/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1287-element-appearing-more-than-25-in-sorted-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1289-minimum-falling-path-sum-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1293-shortest-path-in-a-grid-with-obstacles-elimination/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1312-minimum-insertion-steps-to-make-a-string-palindrome/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1318-minimum-flips-to-make-a-or-b-equal-to-c/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1319-number-of-operations-to-make-network-connected/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1335-minimum-difficulty-of-a-job-schedule/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1345-jump-game-iv/1345-jump-game-iv.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/1345-jump-game-iv/1345-jump-game-iv.py -------------------------------------------------------------------------------- /1345-jump-game-iv/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1345-jump-game-iv/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/1345-jump-game-iv/README.md -------------------------------------------------------------------------------- /1351-count-negative-numbers-in-a-sorted-matrix/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1356-sort-integers-by-the-number-of-1-bits/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1358-number-of-substrings-containing-all-three-characters/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1361-validate-binary-tree-nodes/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1361-validate-binary-tree-nodes/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/1361-validate-binary-tree-nodes/README.md -------------------------------------------------------------------------------- /1378-replace-employee-id-with-the-unique-identifier/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1396-design-underground-system/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1396-design-underground-system/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/1396-design-underground-system/README.md -------------------------------------------------------------------------------- /1402-reducing-dishes/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/1402-reducing-dishes/README.md -------------------------------------------------------------------------------- /1406-stone-game-iii/1406-stone-game-iii.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/1406-stone-game-iii/1406-stone-game-iii.py -------------------------------------------------------------------------------- /1406-stone-game-iii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1406-stone-game-iii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/1406-stone-game-iii/README.md -------------------------------------------------------------------------------- /1420-build-array-where-you-can-find-the-maximum-exactly-k-comparisons/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1423-maximum-points-you-can-obtain-from-cards/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1424-diagonal-traverse-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1424-diagonal-traverse-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/1424-diagonal-traverse-ii/README.md -------------------------------------------------------------------------------- /1425-constrained-subsequence-sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1425-constrained-subsequence-sum/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/1425-constrained-subsequence-sum/README.md -------------------------------------------------------------------------------- /1431-kids-with-the-greatest-number-of-candies/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1436-destination-city/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1436-destination-city/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/1436-destination-city/README.md -------------------------------------------------------------------------------- /1441-build-an-array-with-stack-operations/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1442-count-triplets-that-can-form-two-arrays-of-equal-xor/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1443-minimum-time-to-collect-all-apples-in-a-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1446-consecutive-characters/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1446-consecutive-characters/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/1446-consecutive-characters/README.md -------------------------------------------------------------------------------- /1448-count-good-nodes-in-binary-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1456-maximum-number-of-vowels-in-a-substring-of-given-length/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1458-max-dot-product-of-two-subsequences/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1466-reorder-routes-to-make-all-paths-lead-to-the-city-zero/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1470-shuffle-the-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1470-shuffle-the-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/1470-shuffle-the-array/README.md -------------------------------------------------------------------------------- /1472-design-browser-history/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1472-design-browser-history/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/1472-design-browser-history/README.md -------------------------------------------------------------------------------- /1489-find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1491-average-salary-excluding-the-minimum-and-maximum-salary/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1493-longest-subarray-of-1s-after-deleting-one-element/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1498-number-of-subsequences-that-satisfy-the-given-sum-condition/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1502-can-make-arithmetic-progression-from-sequence/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1512-number-of-good-pairs/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/1512-number-of-good-pairs/README.md -------------------------------------------------------------------------------- /1514-path-with-maximum-probability/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1519-number-of-nodes-in-the-sub-tree-with-the-same-label/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1523-count-odd-numbers-in-an-interval-range/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1535-find-the-winner-of-an-array-game/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1539-kth-missing-positive-number/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1544-make-the-string-great/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1544-make-the-string-great/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/1544-make-the-string-great/README.md -------------------------------------------------------------------------------- /1547-minimum-cost-to-cut-a-stick/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1547-minimum-cost-to-cut-a-stick/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/1547-minimum-cost-to-cut-a-stick/README.md -------------------------------------------------------------------------------- /1550-three-consecutive-odds/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1550-three-consecutive-odds/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/1550-three-consecutive-odds/README.md -------------------------------------------------------------------------------- /1557-minimum-number-of-vertices-to-reach-all-nodes/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1569-number-of-ways-to-reorder-array-to-get-same-bst/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1572-matrix-diagonal-sum/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1572-matrix-diagonal-sum/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/1572-matrix-diagonal-sum/README.md -------------------------------------------------------------------------------- /1575-count-all-possible-routes/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1575-count-all-possible-routes/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/1575-count-all-possible-routes/README.md -------------------------------------------------------------------------------- /1578-minimum-time-to-make-rope-colorful/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1579-remove-max-number-of-edges-to-keep-graph-fully-traversable/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1581-customer-who-visited-but-did-not-make-any-transactions/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1583-count-unhappy-friends/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1583-count-unhappy-friends/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/1583-count-unhappy-friends/README.md -------------------------------------------------------------------------------- /1601-maximum-number-of-achievable-transfer-requests/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1603-design-parking-system/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1603-design-parking-system/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/1603-design-parking-system/README.md -------------------------------------------------------------------------------- /1614-maximum-nesting-depth-of-the-parentheses/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1615-maximal-network-rank/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1615-maximal-network-rank/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/1615-maximal-network-rank/README.md -------------------------------------------------------------------------------- /1626-best-team-with-no-conflicts/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1626-best-team-with-no-conflicts/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/1626-best-team-with-no-conflicts/README.md -------------------------------------------------------------------------------- /1630-arithmetic-subarrays/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1630-arithmetic-subarrays/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/1630-arithmetic-subarrays/README.md -------------------------------------------------------------------------------- /1631-path-with-minimum-effort/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/1631-path-with-minimum-effort/README.md -------------------------------------------------------------------------------- /1633-percentage-of-users-attended-a-contest/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1639-number-of-ways-to-form-a-target-string-given-a-dictionary/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1642-furthest-building-you-can-reach/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1647-minimum-deletions-to-make-character-frequencies-unique/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1675-minimize-deviation-in-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1675-minimize-deviation-in-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/1675-minimize-deviation-in-array/README.md -------------------------------------------------------------------------------- /1683-invalid-tweets/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1683-invalid-tweets/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/1683-invalid-tweets/README.md -------------------------------------------------------------------------------- /1685-sum-of-absolute-differences-in-a-sorted-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1688-count-of-matches-in-tournament/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1697-checking-existence-of-edge-length-limited-paths/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1704-determine-if-string-halves-are-alike/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1706-where-will-the-ball-fall/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1706-where-will-the-ball-fall/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/1706-where-will-the-ball-fall/README.md -------------------------------------------------------------------------------- /1721-swapping-nodes-in-a-linked-list/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1729-find-followers-count/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1729-find-followers-count/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/1729-find-followers-count/README.md -------------------------------------------------------------------------------- /1731-the-number-of-employees-which-report-to-each-employee/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1743-restore-the-array-from-adjacent-pairs/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1751-maximum-number-of-events-that-can-be-attended-ii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1752-check-if-array-is-sorted-and-rotated/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1757-recyclable-and-low-fat-products/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1759-count-number-of-homogenous-substrings/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1768-merge-strings-alternately/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1768-merge-strings-alternately/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/1768-merge-strings-alternately/README.md -------------------------------------------------------------------------------- /1781-sum-of-beauty-of-all-substrings/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1793-maximum-score-of-a-good-subarray/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1799-maximize-score-after-n-operations/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1802-maximum-value-at-a-given-index-in-a-bounded-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1814-count-nice-pairs-in-an-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1822-sign-of-the-product-of-an-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1833-maximum-ice-cream-bars/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1838-frequency-of-the-most-frequent-element/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1839-longest-substring-of-all-vowels-in-order/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1845-seat-reservation-manager/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1845-seat-reservation-manager/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/1845-seat-reservation-manager/README.md -------------------------------------------------------------------------------- /1846-maximum-element-after-decreasing-and-rearranging/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1849-splitting-a-string-into-descending-consecutive-values/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1857-largest-color-value-in-a-directed-graph/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1870-minimum-speed-to-arrive-on-time/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1887-reduction-operations-to-make-the-array-elements-equal/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1888-minimum-number-of-flips-to-make-the-binary-string-alternating/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1897-redistribute-characters-to-make-all-strings-equal/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1903-largest-odd-number-in-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1913-maximum-product-difference-between-two-pairs/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1915-number-of-wonderful-substrings/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1930-unique-length-3-palindromic-subsequences/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1952-three-divisors/1952-three-divisors.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/1952-three-divisors/1952-three-divisors.py -------------------------------------------------------------------------------- /1952-three-divisors/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1952-three-divisors/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/1952-three-divisors/README.md -------------------------------------------------------------------------------- /1964-find-the-longest-valid-obstacle-course-at-each-position/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1970-last-day-where-you-can-still-cross/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1971-find-if-path-exists-in-graph/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1979-find-greatest-common-divisor-of-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1980-find-unique-binary-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /1980-find-unique-binary-string/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/1980-find-unique-binary-string/README.md -------------------------------------------------------------------------------- /2024-maximize-the-confusion-of-an-exam/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2050-parallel-courses-iii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2050-parallel-courses-iii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/2050-parallel-courses-iii/README.md -------------------------------------------------------------------------------- /2073-time-needed-to-buy-tickets/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2073-time-needed-to-buy-tickets/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/2073-time-needed-to-buy-tickets/README.md -------------------------------------------------------------------------------- /2090-k-radius-subarray-averages/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2090-k-radius-subarray-averages/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/2090-k-radius-subarray-averages/README.md -------------------------------------------------------------------------------- /2092-find-all-people-with-secret/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/2092-find-all-people-with-secret/README.md -------------------------------------------------------------------------------- /2095-delete-the-middle-node-of-a-linked-list/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2101-detonate-the-maximum-bombs/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/2101-detonate-the-maximum-bombs/README.md -------------------------------------------------------------------------------- /2125-number-of-laser-beams-in-a-bank/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2130-maximum-twin-sum-of-a-linked-list/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2131-longest-palindrome-by-concatenating-two-letter-words/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2133-check-if-every-row-and-column-contains-all-numbers/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2140-solving-questions-with-brainpower/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2141-maximum-running-time-of-n-computers/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2147-number-of-ways-to-divide-a-long-corridor/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2187-minimum-time-to-complete-trips/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2218-maximum-value-of-k-coins-from-piles/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2225-find-players-with-zero-or-one-losses/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2244-minimum-rounds-to-complete-all-tasks/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2246-longest-path-with-different-adjacent-characters/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2251-number-of-flowers-in-full-bloom/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2256-minimum-average-difference/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2256-minimum-average-difference/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/2256-minimum-average-difference/README.md -------------------------------------------------------------------------------- /2265-count-nodes-equal-to-average-of-subtree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2272-substring-with-largest-variance/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2294-partition-array-such-that-maximum-difference-is-k/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2305-fair-distribution-of-cookies/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2306-naming-a-company/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2306-naming-a-company/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/2306-naming-a-company/README.md -------------------------------------------------------------------------------- /2316-count-unreachable-pairs-of-nodes-in-an-undirected-graph/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2328-number-of-increasing-paths-in-a-grid/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2331-evaluate-boolean-binary-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2336-smallest-number-in-infinite-set/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2352-equal-row-and-column-pairs/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2352-equal-row-and-column-pairs/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/2352-equal-row-and-column-pairs/README.md -------------------------------------------------------------------------------- /2353-design-a-food-rating-system/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/2353-design-a-food-rating-system/README.md -------------------------------------------------------------------------------- /2356-number-of-unique-subjects-taught-by-each-teacher/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2359-find-closest-node-to-given-two-nodes/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2369-check-if-there-is-a-valid-partition-for-the-array/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2370-longest-ideal-subsequence/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2370-longest-ideal-subsequence/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/2370-longest-ideal-subsequence/README.md -------------------------------------------------------------------------------- /2379-minimum-recolors-to-get-k-consecutive-black-blocks/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2385-amount-of-time-for-binary-tree-to-be-infected/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2390-removing-stars-from-a-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2391-minimum-amount-of-time-to-collect-garbage/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2401-longest-nice-subarray/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2401-longest-nice-subarray/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/2401-longest-nice-subarray/README.md -------------------------------------------------------------------------------- /2402-meeting-rooms-iii/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2402-meeting-rooms-iii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/2402-meeting-rooms-iii/README.md -------------------------------------------------------------------------------- /2405-optimal-partition-of-string/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/2405-optimal-partition-of-string/README.md -------------------------------------------------------------------------------- /2413-smallest-even-multiple/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2413-smallest-even-multiple/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/2413-smallest-even-multiple/README.md -------------------------------------------------------------------------------- /2415-reverse-odd-levels-of-binary-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2421-number-of-good-paths/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2421-number-of-good-paths/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/2421-number-of-good-paths/README.md -------------------------------------------------------------------------------- /2439-minimize-maximum-of-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/2439-minimize-maximum-of-array/README.md -------------------------------------------------------------------------------- /2441-largest-positive-integer-that-exists-with-its-negative/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2444-count-subarrays-with-fixed-bounds/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2457-minimum-addition-to-make-integer-beautiful/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2462-total-cost-to-hire-k-workers/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2466-count-ways-to-build-good-strings/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2482-difference-between-ones-and-zeros-in-row-and-column/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2506-count-pairs-of-similar-strings/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2529-maximum-count-of-positive-integer-and-negative-integer/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2542-maximum-subsequence-score/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2542-maximum-subsequence-score/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/2542-maximum-subsequence-score/README.md -------------------------------------------------------------------------------- /2551-put-marbles-in-bags/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2551-put-marbles-in-bags/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/2551-put-marbles-in-bags/README.md -------------------------------------------------------------------------------- /2582-pass-the-pillow/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2582-pass-the-pillow/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/2582-pass-the-pillow/README.md -------------------------------------------------------------------------------- /2603-collect-coins-in-a-tree/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2603-collect-coins-in-a-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/2603-collect-coins-in-a-tree/README.md -------------------------------------------------------------------------------- /2607-make-k-subarray-sums-equal/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2607-make-k-subarray-sums-equal/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/2607-make-k-subarray-sums-equal/README.md -------------------------------------------------------------------------------- /2608-shortest-cycle-in-a-graph/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2608-shortest-cycle-in-a-graph/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/2608-shortest-cycle-in-a-graph/README.md -------------------------------------------------------------------------------- /2609-find-the-longest-balanced-substring-of-a-binary-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2610-convert-an-array-into-a-2d-array-with-conditions/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2611-mice-and-cheese/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/2611-mice-and-cheese/README.md -------------------------------------------------------------------------------- /2614-prime-in-diagonal/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2614-prime-in-diagonal/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/2614-prime-in-diagonal/README.md -------------------------------------------------------------------------------- /2615-sum-of-distances/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2615-sum-of-distances/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/2615-sum-of-distances/README.md -------------------------------------------------------------------------------- /2616-minimize-the-maximum-difference-of-pairs/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2639-find-the-width-of-columns-of-a-grid/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2642-design-graph-with-shortest-path-calculator/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2644-find-the-maximum-divisibility-score/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2645-minimum-additions-to-make-valid-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2660-determine-the-winner-of-a-bowling-game/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2661-first-completely-painted-row-or-column/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2681-power-of-heroes/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2681-power-of-heroes/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/2681-power-of-heroes/README.md -------------------------------------------------------------------------------- /2682-find-the-losers-of-the-circular-game/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2696-minimum-string-length-after-removing-substrings/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2697-lexicographically-smallest-palindrome/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2698-find-the-punishment-number-of-an-integer/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2709-greatest-common-divisor-traversal/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2730-find-the-longest-semi-repetitive-substring/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2739-total-distance-traveled/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2739-total-distance-traveled/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/2739-total-distance-traveled/README.md -------------------------------------------------------------------------------- /2742-painting-the-walls/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2742-painting-the-walls/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/2742-painting-the-walls/README.md -------------------------------------------------------------------------------- /2744-find-maximum-number-of-string-pairs/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2745-construct-the-longest-new-string/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2748-number-of-beautiful-pairs/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2748-number-of-beautiful-pairs/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/2748-number-of-beautiful-pairs/README.md -------------------------------------------------------------------------------- /2785-sort-vowels-in-a-string/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/2785-sort-vowels-in-a-string/README.md -------------------------------------------------------------------------------- /2816-double-a-number-represented-as-a-linked-list/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2833-furthest-point-from-origin/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2833-furthest-point-from-origin/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/2833-furthest-point-from-origin/README.md -------------------------------------------------------------------------------- /2849-determine-if-a-cell-is-reachable-at-a-given-time/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2870-minimum-number-of-operations-to-make-array-empty/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2997-minimum-number-of-operations-to-make-array-xor-equal-to-k/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /3068-find-the-maximum-sum-of-node-values/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /Array Removals - GFG/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/Array Removals - GFG/README.md -------------------------------------------------------------------------------- /Array Removals - GFG/array-removals.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/Array Removals - GFG/array-removals.py -------------------------------------------------------------------------------- /BFS of graph - GFG/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/BFS of graph - GFG/README.md -------------------------------------------------------------------------------- /BFS of graph - GFG/bfs-of-graph.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/BFS of graph - GFG/bfs-of-graph.py -------------------------------------------------------------------------------- /Binary subarray with sum - GFG/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/Binary subarray with sum - GFG/README.md -------------------------------------------------------------------------------- /Bottom View of Binary Tree - GFG/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/Bottom View of Binary Tree - GFG/README.md -------------------------------------------------------------------------------- /Common elements - GFG/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/Common elements - GFG/README.md -------------------------------------------------------------------------------- /Common elements - GFG/common-elements.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/Common elements - GFG/common-elements.py -------------------------------------------------------------------------------- /Count Digits - GFG/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/Count Digits - GFG/README.md -------------------------------------------------------------------------------- /Count Digits - GFG/count-digits.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/Count Digits - GFG/count-digits.py -------------------------------------------------------------------------------- /Count Subarray with k odds - GFG/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/Count Subarray with k odds - GFG/README.md -------------------------------------------------------------------------------- /Count pairs with given sum - GFG/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/Count pairs with given sum - GFG/README.md -------------------------------------------------------------------------------- /DFS of Graph - GFG/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/DFS of Graph - GFG/README.md -------------------------------------------------------------------------------- /DFS of Graph - GFG/dfs-of-graph.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/DFS of Graph - GFG/dfs-of-graph.py -------------------------------------------------------------------------------- /Data Type - GFG/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/Data Type - GFG/README.md -------------------------------------------------------------------------------- /Data Type - GFG/data-type.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/Data Type - GFG/data-type.py -------------------------------------------------------------------------------- /Disarrangement of balls - GFG/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/Disarrangement of balls - GFG/README.md -------------------------------------------------------------------------------- /Fractional Knapsack - GFG/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/Fractional Knapsack - GFG/README.md -------------------------------------------------------------------------------- /Height of Binary Tree - GFG/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/Height of Binary Tree - GFG/README.md -------------------------------------------------------------------------------- /Immediate Smaller Element - GFG/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/Immediate Smaller Element - GFG/README.md -------------------------------------------------------------------------------- /Inorder Traversal - GFG/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/Inorder Traversal - GFG/README.md -------------------------------------------------------------------------------- /Job Sequencing Problem - GFG/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/Job Sequencing Problem - GFG/README.md -------------------------------------------------------------------------------- /Kadane's Algorithm - GFG/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/Kadane's Algorithm - GFG/README.md -------------------------------------------------------------------------------- /Kth smallest element - GFG/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/Kth smallest element - GFG/README.md -------------------------------------------------------------------------------- /LCS of three strings - GFG/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/LCS of three strings - GFG/README.md -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/LICENSE -------------------------------------------------------------------------------- /Left View of Binary Tree - GFG/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/Left View of Binary Tree - GFG/README.md -------------------------------------------------------------------------------- /Longest Common Subsequence - GFG/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/Longest Common Subsequence - GFG/README.md -------------------------------------------------------------------------------- /M-Coloring Problem - GFG/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/M-Coloring Problem - GFG/README.md -------------------------------------------------------------------------------- /Maximize Number of 1's - GFG/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/Maximize Number of 1's - GFG/README.md -------------------------------------------------------------------------------- /Maximum Product Subarray - GFG/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/Maximum Product Subarray - GFG/README.md -------------------------------------------------------------------------------- /Minimize the Heights II - GFG/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/Minimize the Heights II - GFG/README.md -------------------------------------------------------------------------------- /N meetings in one room - GFG/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/N meetings in one room - GFG/README.md -------------------------------------------------------------------------------- /Number of Coins - GFG/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/Number of Coins - GFG/README.md -------------------------------------------------------------------------------- /Number of Coins - GFG/number-of-coins.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/Number of Coins - GFG/number-of-coins.cpp -------------------------------------------------------------------------------- /Number of occurrence - GFG/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/Number of occurrence - GFG/README.md -------------------------------------------------------------------------------- /Overlapping Intervals - GFG/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/Overlapping Intervals - GFG/README.md -------------------------------------------------------------------------------- /Parenthesis Checker - GFG/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/Parenthesis Checker - GFG/README.md -------------------------------------------------------------------------------- /Pattern 1 - GFG/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/Pattern 1 - GFG/README.md -------------------------------------------------------------------------------- /Pattern 1 - GFG/pattern-1.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/Pattern 1 - GFG/pattern-1.py -------------------------------------------------------------------------------- /Pattern 13 - GFG/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/Pattern 13 - GFG/README.md -------------------------------------------------------------------------------- /Pattern 13 - GFG/pattern-13.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/Pattern 13 - GFG/pattern-13.py -------------------------------------------------------------------------------- /Pattern 2 - GFG/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/Pattern 2 - GFG/README.md -------------------------------------------------------------------------------- /Pattern 2 - GFG/pattern-2.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/Pattern 2 - GFG/pattern-2.py -------------------------------------------------------------------------------- /Pattern 3 - GFG/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/Pattern 3 - GFG/README.md -------------------------------------------------------------------------------- /Pattern 3 - GFG/pattern-3.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/Pattern 3 - GFG/pattern-3.py -------------------------------------------------------------------------------- /Pattern 4 - GFG/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/Pattern 4 - GFG/README.md -------------------------------------------------------------------------------- /Pattern 4 - GFG/pattern-4.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/Pattern 4 - GFG/pattern-4.py -------------------------------------------------------------------------------- /Pattern 5 - GFG/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/Pattern 5 - GFG/README.md -------------------------------------------------------------------------------- /Preorder Traversal - GFG/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/Preorder Traversal - GFG/README.md -------------------------------------------------------------------------------- /Print N to 1 without loop - GFG/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/Print N to 1 without loop - GFG/README.md -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/README.md -------------------------------------------------------------------------------- /Reverse a String - GFG/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/Reverse a String - GFG/README.md -------------------------------------------------------------------------------- /Reverse a String - GFG/reverse-a-string.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/Reverse a String - GFG/reverse-a-string.py -------------------------------------------------------------------------------- /Subset Sums - GFG/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/Subset Sums - GFG/README.md -------------------------------------------------------------------------------- /Subset Sums - GFG/subset-sums.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/Subset Sums - GFG/subset-sums.py -------------------------------------------------------------------------------- /Symmetric Tree - GFG/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/Symmetric Tree - GFG/README.md -------------------------------------------------------------------------------- /Symmetric Tree - GFG/symmetric-tree.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/Symmetric Tree - GFG/symmetric-tree.py -------------------------------------------------------------------------------- /Three way partitioning - GFG/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/Three way partitioning - GFG/README.md -------------------------------------------------------------------------------- /Top View of Binary Tree - GFG/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/Top View of Binary Tree - GFG/README.md -------------------------------------------------------------------------------- /Triplet Sum in Array - GFG/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/Triplet Sum in Array - GFG/README.md -------------------------------------------------------------------------------- /Union of two arrays - GFG/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/Union of two arrays - GFG/README.md -------------------------------------------------------------------------------- /ZigZag Tree Traversal - GFG/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/ZigZag Tree Traversal - GFG/README.md -------------------------------------------------------------------------------- /if-else (Decision Making) - GFG/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/shivang257/LeetCode-Daily-Practice-Problem-Solutions/HEAD/if-else (Decision Making) - GFG/README.md --------------------------------------------------------------------------------