├── 0 - 1 Knapsack Problem - GFG ├── 0-1-knapsack-problem.java └── README.md ├── 0001-two-sum ├── 0001-two-sum.java └── README.md ├── 0003-longest-substring-without-repeating-characters ├── 0003-longest-substring-without-repeating-characters.java └── README.md ├── 0004-median-of-two-sorted-arrays ├── 0004-median-of-two-sorted-arrays.java ├── NOTES.md └── README.md ├── 0007-reverse-integer ├── 0007-reverse-integer.java ├── NOTES.md └── README.md ├── 0013-roman-to-integer ├── 0013-roman-to-integer.java └── README.md ├── 0017-letter-combinations-of-a-phone-number ├── 0017-letter-combinations-of-a-phone-number.java └── README.md ├── 0019-remove-nth-node-from-end-of-list ├── 0019-remove-nth-node-from-end-of-list.java ├── NOTES.md └── README.md ├── 0020-valid-parentheses ├── 0020-valid-parentheses.java ├── NOTES.md └── README.md ├── 0022-generate-parentheses ├── 0022-generate-parentheses.java └── README.md ├── 0026-remove-duplicates-from-sorted-array ├── 0026-remove-duplicates-from-sorted-array.java └── README.md ├── 0033-search-in-rotated-sorted-array ├── 0033-search-in-rotated-sorted-array.java └── README.md ├── 0034-find-first-and-last-position-of-element-in-sorted-array ├── 0034-find-first-and-last-position-of-element-in-sorted-array.java └── README.md ├── 0035-search-insert-position ├── 0035-search-insert-position.java └── README.md ├── 0036-valid-sudoku ├── 0036-valid-sudoku.java └── README.md ├── 0038-count-and-say ├── 0038-count-and-say.java └── README.md ├── 0040-combination-sum-ii ├── 0040-combination-sum-ii.java └── README.md ├── 0042-trapping-rain-water ├── 0042-trapping-rain-water.java └── README.md ├── 0046-permutations ├── 0046-permutations.java └── README.md ├── 0048-rotate-image ├── 0048-rotate-image.java └── README.md ├── 0049-group-anagrams ├── 0049-group-anagrams.java └── README.md ├── 0050-powx-n ├── 0050-powx-n.java └── README.md ├── 0053-maximum-subarray ├── 0053-maximum-subarray.java └── README.md ├── 0054-spiral-matrix ├── 0054-spiral-matrix.java └── README.md ├── 0055-jump-game ├── 0055-jump-game.java └── README.md ├── 0061-rotate-list ├── 0061-rotate-list.java └── README.md ├── 0062-unique-paths ├── 0062-unique-paths.java └── README.md ├── 0063-unique-paths-ii ├── 0063-unique-paths-ii.java └── README.md ├── 0064-minimum-path-sum ├── 0064-minimum-path-sum.java └── README.md ├── 0066-plus-one ├── 0066-plus-one.java └── README.md ├── 0068-text-justification └── README.md ├── 0070-climbing-stairs ├── 0070-climbing-stairs.java └── README.md ├── 0072-edit-distance ├── 0072-edit-distance.java └── README.md ├── 0073-set-matrix-zeroes ├── 0073-set-matrix-zeroes.java └── README.md ├── 0074-search-a-2d-matrix ├── 0074-search-a-2d-matrix.java └── README.md ├── 0075-sort-colors ├── 0075-sort-colors.java └── README.md ├── 0076-minimum-window-substring ├── 0076-minimum-window-substring.java └── README.md ├── 0077-combinations ├── 0077-combinations.java └── README.md ├── 0081-search-in-rotated-sorted-array-ii ├── 0081-search-in-rotated-sorted-array-ii.java └── README.md ├── 0086-partition-list └── README.md ├── 0088-merge-sorted-array ├── 0088-merge-sorted-array.java ├── NOTES.md └── README.md ├── 0090-subsets-ii ├── 0090-subsets-ii.java └── README.md ├── 0091-decode-ways ├── 0091-decode-ways.java └── README.md ├── 0094-binary-tree-inorder-traversal ├── 0094-binary-tree-inorder-traversal.java └── README.md ├── 0095-unique-binary-search-trees-ii └── README.md ├── 0097-interleaving-string ├── 0097-interleaving-string.java └── README.md ├── 0110-balanced-binary-tree ├── 0110-balanced-binary-tree.java └── README.md ├── 0118-pascals-triangle ├── 0118-pascals-triangle.java └── README.md ├── 0121-best-time-to-buy-and-sell-stock ├── 0121-best-time-to-buy-and-sell-stock.java └── README.md ├── 0122-best-time-to-buy-and-sell-stock-ii ├── 0122-best-time-to-buy-and-sell-stock-ii.java └── README.md ├── 0125-valid-palindrome ├── 0125-valid-palindrome.java └── README.md ├── 0128-longest-consecutive-sequence ├── 0128-longest-consecutive-sequence.java └── README.md ├── 0131-palindrome-partitioning ├── 0131-palindrome-partitioning.java └── README.md ├── 0135-candy ├── 0135-candy.java └── README.md ├── 0141-linked-list-cycle ├── 0141-linked-list-cycle.java └── README.md ├── 0142-linked-list-cycle-ii ├── 0142-linked-list-cycle-ii.java ├── NOTES.md └── README.md ├── 0145-binary-tree-postorder-traversal ├── 0145-binary-tree-postorder-traversal.java └── README.md ├── 0151-reverse-words-in-a-string ├── 0151-reverse-words-in-a-string.java └── README.md ├── 0153-find-minimum-in-rotated-sorted-array ├── 0153-find-minimum-in-rotated-sorted-array.java └── README.md ├── 0160-intersection-of-two-linked-lists ├── 0160-intersection-of-two-linked-lists.java └── README.md ├── 0162-find-peak-element ├── 0162-find-peak-element.java └── README.md ├── 0168-excel-sheet-column-title └── README.md ├── 0179-largest-number ├── 0179-largest-number.java └── README.md ├── 0198-house-robber ├── 0198-house-robber.java └── README.md ├── 0200-number-of-islands ├── 0200-number-of-islands.java └── README.md ├── 0206-reverse-linked-list ├── 0206-reverse-linked-list.java ├── NOTES.md └── README.md ├── 0213-house-robber-ii ├── 0213-house-robber-ii.java └── README.md ├── 0214-shortest-palindrome ├── 0214-shortest-palindrome.java └── README.md ├── 0215-kth-largest-element-in-an-array ├── 0215-kth-largest-element-in-an-array.java └── README.md ├── 0217-contains-duplicate ├── 0217-contains-duplicate.java └── README.md ├── 0228-summary-ranges ├── 0228-summary-ranges.java └── README.md ├── 0234-palindrome-linked-list ├── 0234-palindrome-linked-list.java ├── NOTES.md └── README.md ├── 0239-sliding-window-maximum ├── 0239-sliding-window-maximum.java └── README.md ├── 0240-search-a-2d-matrix-ii ├── 0240-search-a-2d-matrix-ii.java └── README.md ├── 0242-valid-anagram ├── 0242-valid-anagram.java └── README.md ├── 0264-ugly-number-ii ├── 0264-ugly-number-ii.java └── README.md ├── 0273-integer-to-english-words ├── 0273-integer-to-english-words.java └── README.md ├── 0283-move-zeroes ├── 0283-move-zeroes.java └── README.md ├── 0287-find-the-duplicate-number ├── 0287-find-the-duplicate-number.java └── README.md ├── 0300-longest-increasing-subsequence ├── 0300-longest-increasing-subsequence.java └── README.md ├── 0322-coin-change ├── 0322-coin-change.java └── README.md ├── 0330-patching-array ├── 0330-patching-array.java └── README.md ├── 0332-reconstruct-itinerary └── README.md ├── 0338-counting-bits ├── 0338-counting-bits.java └── README.md ├── 0344-reverse-string ├── 0344-reverse-string.java └── README.md ├── 0347-top-k-frequent-elements ├── 0347-top-k-frequent-elements.java └── README.md ├── 0350-intersection-of-two-arrays-ii ├── 0350-intersection-of-two-arrays-ii.java └── README.md ├── 0368-largest-divisible-subset ├── 0368-largest-divisible-subset.java └── README.md ├── 0383-ransom-note ├── 0383-ransom-note.java └── README.md ├── 0386-lexicographical-numbers ├── 0386-lexicographical-numbers.java └── README.md ├── 0392-is-subsequence ├── 0392-is-subsequence.java └── README.md ├── 0403-frog-jump └── README.md ├── 0407-trapping-rain-water-ii ├── 0407-trapping-rain-water-ii.java └── README.md ├── 0410-split-array-largest-sum ├── 0410-split-array-largest-sum.java └── README.md ├── 0416-partition-equal-subset-sum ├── 0416-partition-equal-subset-sum.java └── README.md ├── 0432-all-oone-data-structure └── README.md ├── 0440-k-th-smallest-in-lexicographical-order ├── 0440-k-th-smallest-in-lexicographical-order.java └── README.md ├── 0451-sort-characters-by-frequency ├── 0451-sort-characters-by-frequency.java └── README.md ├── 0455-assign-cookies ├── 0455-assign-cookies.java └── README.md ├── 0476-number-complement ├── 0476-number-complement.java └── README.md ├── 0485-max-consecutive-ones ├── 0485-max-consecutive-ones.java └── README.md ├── 0486-predict-the-winner ├── 0486-predict-the-winner.java └── README.md ├── 0494-target-sum ├── 0494-target-sum.java └── README.md ├── 0502-ipo ├── 0502-ipo.java └── README.md ├── 0515-find-largest-value-in-each-tree-row ├── 0515-find-largest-value-in-each-tree-row.java └── README.md ├── 0516-longest-palindromic-subsequence ├── 0516-longest-palindromic-subsequence.java └── README.md ├── 0518-coin-change-ii └── README.md ├── 0523-continuous-subarray-sum ├── 0523-continuous-subarray-sum.java └── README.md ├── 0539-minimum-time-difference ├── 0539-minimum-time-difference.java └── README.md ├── 0540-single-element-in-a-sorted-array ├── 0540-single-element-in-a-sorted-array.java └── README.md ├── 0542-01-matrix ├── 0542-01-matrix.java └── README.md ├── 0547-number-of-provinces ├── 0547-number-of-provinces.java └── README.md ├── 0567-permutation-in-string ├── 0567-permutation-in-string.java └── README.md ├── 0583-delete-operation-for-two-strings ├── 0583-delete-operation-for-two-strings.java └── README.md ├── 0592-fraction-addition-and-subtraction └── README.md ├── 0624-maximum-distance-in-arrays ├── 0624-maximum-distance-in-arrays.java └── README.md ├── 0633-sum-of-square-numbers ├── 0633-sum-of-square-numbers.java └── README.md ├── 0646-maximum-length-of-pair-chain ├── 0646-maximum-length-of-pair-chain.java └── README.md ├── 0647-palindromic-substrings ├── 0647-palindromic-substrings.java └── README.md ├── 0648-replace-words ├── 0648-replace-words.java └── README.md ├── 0650-2-keys-keyboard ├── 0650-2-keys-keyboard.java └── README.md ├── 0664-strange-printer ├── 0664-strange-printer.java └── README.md ├── 0670-maximum-swap └── README.md ├── 0684-redundant-connection ├── 0684-redundant-connection.java └── README.md ├── 0689-maximum-sum-of-3-non-overlapping-subarrays ├── 0689-maximum-sum-of-3-non-overlapping-subarrays.java └── README.md ├── 0695-max-area-of-island ├── 0695-max-area-of-island.java └── README.md ├── 0712-minimum-ascii-delete-sum-for-two-strings ├── 0712-minimum-ascii-delete-sum-for-two-strings.java └── README.md ├── 0714-best-time-to-buy-and-sell-stock-with-transaction-fee ├── 0714-best-time-to-buy-and-sell-stock-with-transaction-fee.java └── README.md ├── 0719-find-k-th-smallest-pair-distance ├── 0719-find-k-th-smallest-pair-distance.java └── README.md ├── 0724-find-pivot-index ├── 0724-find-pivot-index.java └── README.md ├── 0725-split-linked-list-in-parts ├── 0725-split-linked-list-in-parts.java └── README.md ├── 0726-number-of-atoms ├── 0726-number-of-atoms.java └── README.md ├── 0729-my-calendar-i ├── 0729-my-calendar-i.java └── README.md ├── 0731-my-calendar-ii ├── 0731-my-calendar-ii.java └── README.md ├── 0740-delete-and-earn ├── 0740-delete-and-earn.java └── README.md ├── 0745-find-smallest-letter-greater-than-target ├── 0745-find-smallest-letter-greater-than-target.java └── README.md ├── 0747-min-cost-climbing-stairs ├── 0747-min-cost-climbing-stairs.java └── README.md ├── 0768-partition-labels ├── 0768-partition-labels.java └── README.md ├── 0776-n-ary-tree-postorder-traversal ├── 0776-n-ary-tree-postorder-traversal.java └── README.md ├── 0778-reorganize-string ├── 0778-reorganize-string.java └── README.md ├── 0780-max-chunks-to-make-sorted ├── 0780-max-chunks-to-make-sorted.java └── README.md ├── 0787-sliding-puzzle ├── 0787-sliding-puzzle.java └── README.md ├── 0789-kth-largest-element-in-a-stream ├── 0789-kth-largest-element-in-a-stream.java └── README.md ├── 0797-rabbits-in-forest ├── 0797-rabbits-in-forest.java └── README.md ├── 0806-domino-and-tromino-tiling ├── 0806-domino-and-tromino-tiling.java └── README.md ├── 0812-rotate-string ├── 0812-rotate-string.java └── README.md ├── 0820-find-eventual-safe-states ├── 0820-find-eventual-safe-states.java └── README.md ├── 0826-soup-servings ├── 0826-soup-servings.java └── README.md ├── 0853-most-profit-assigning-work ├── 0853-most-profit-assigning-work.java └── README.md ├── 0854-making-a-large-island ├── 0854-making-a-large-island.java └── README.md ├── 0859-design-circular-deque ├── 0859-design-circular-deque.java └── README.md ├── 0868-push-dominoes ├── 0868-push-dominoes.java └── README.md ├── 0870-magic-squares-in-grid ├── 0870-magic-squares-in-grid.java └── README.md ├── 0876-middle-of-the-linked-list ├── 0876-middle-of-the-linked-list.java ├── NOTES.md └── README.md ├── 0882-peak-index-in-a-mountain-array ├── 0882-peak-index-in-a-mountain-array.java └── README.md ├── 0890-lemonade-change ├── 0890-lemonade-change.java └── README.md ├── 0892-shortest-subarray-with-sum-at-least-k └── README.md ├── 0905-length-of-longest-fibonacci-subsequence ├── 0905-length-of-longest-fibonacci-subsequence.java └── README.md ├── 0906-walking-robot-simulation ├── 0906-walking-robot-simulation.java └── README.md ├── 0907-koko-eating-bananas ├── 0907-koko-eating-bananas.java └── README.md ├── 0920-uncommon-words-from-two-sentences ├── 0920-uncommon-words-from-two-sentences.java └── README.md ├── 0921-spiral-matrix-iii ├── 0921-spiral-matrix-iii.java └── README.md ├── 0925-construct-binary-tree-from-preorder-and-postorder-traversal ├── 0925-construct-binary-tree-from-preorder-and-postorder-traversal.java └── README.md ├── 0945-snakes-and-ladders ├── 0945-snakes-and-ladders.java └── README.md ├── 0952-word-subsets ├── 0952-word-subsets.java └── README.md ├── 0956-number-of-music-playlists ├── 0956-number-of-music-playlists.java └── README.md ├── 0957-minimum-add-to-make-parentheses-valid ├── 0957-minimum-add-to-make-parentheses-valid.java └── README.md ├── 0971-shortest-bridge ├── 0971-shortest-bridge.java └── README.md ├── 0982-minimum-increment-to-make-array-unique ├── 0982-minimum-increment-to-make-array-unique.java └── README.md ├── 0984-most-stones-removed-with-same-row-or-column ├── 0984-most-stones-removed-with-same-row-or-column.java └── README.md ├── 0988-flip-equivalent-binary-trees ├── 0988-flip-equivalent-binary-trees.java └── README.md ├── 1-two-sum ├── 1-two-sum.java ├── NOTES.md └── README.md ├── 1002-maximum-width-ramp └── README.md ├── 1013-fibonacci-number ├── 1013-fibonacci-number.java └── README.md ├── 1016-subarray-sums-divisible-by-k ├── 1016-subarray-sums-divisible-by-k.java └── README.md ├── 1025-minimum-cost-for-tickets ├── 1025-minimum-cost-for-tickets.java └── README.md ├── 1044-find-common-characters ├── 1044-find-common-characters.java └── README.md ├── 1049-minimum-domino-rotations-for-equal-row ├── 1049-minimum-domino-rotations-for-equal-row.java └── README.md ├── 1056-capacity-to-ship-packages-within-d-days ├── 1056-capacity-to-ship-packages-within-d-days.java └── README.md ├── 1058-lexicographically-smallest-equivalent-string ├── 1058-lexicographically-smallest-equivalent-string.java └── README.md ├── 1063-best-sightseeing-pair ├── 1063-best-sightseeing-pair.java └── README.md ├── 1073-number-of-enclaves ├── 1073-number-of-enclaves.java └── README.md ├── 1087-longest-arithmetic-subsequence ├── 1087-longest-arithmetic-subsequence.java └── README.md ├── 1093-recover-a-tree-from-preorder-traversal ├── 1093-recover-a-tree-from-preorder-traversal.java └── README.md ├── 1114-binary-search-tree-to-greater-sum-tree ├── 1114-binary-search-tree-to-greater-sum-tree.java └── README.md ├── 1129-longest-string-chain ├── 1129-longest-string-chain.java └── README.md ├── 1138-grumpy-bookstore-owner ├── 1138-grumpy-bookstore-owner.java └── README.md ├── 1147-flip-columns-for-maximum-number-of-equal-rows └── README.md ├── 1160-letter-tile-possibilities ├── 1160-letter-tile-possibilities.java └── README.md ├── 1170-shortest-common-supersequence ├── 1170-shortest-common-supersequence.java └── README.md ├── 1196-filling-bookcase-shelves ├── 1196-filling-bookcase-shelves.java └── README.md ├── 1197-parsing-a-boolean-expression ├── 1197-parsing-a-boolean-expression.java └── README.md ├── 1218-lowest-common-ancestor-of-deepest-leaves ├── 1218-lowest-common-ancestor-of-deepest-leaves.java └── README.md ├── 1227-number-of-equivalent-domino-pairs ├── 1227-number-of-equivalent-domino-pairs.java └── README.md ├── 1236-n-th-tribonacci-number ├── 1236-n-th-tribonacci-number.java └── README.md ├── 1240-stone-game-ii ├── 1240-stone-game-ii.java └── README.md ├── 1249-snapshot-array ├── 1249-snapshot-array.java └── README.md ├── 1250-longest-common-subsequence ├── 1250-longest-common-subsequence.java └── README.md ├── 1256-rank-transform-of-an-array ├── 1256-rank-transform-of-an-array.java └── README.md ├── 1293-three-consecutive-odds ├── 1293-three-consecutive-odds.java └── README.md ├── 1298-reverse-substrings-between-each-pair-of-parentheses └── README.md ├── 13-roman-to-integer ├── 13-roman-to-integer.java ├── NOTES.md └── README.md ├── 1302-delete-characters-to-make-fancy-string ├── 1302-delete-characters-to-make-fancy-string.java └── README.md ├── 1304-longest-happy-string ├── 1304-longest-happy-string.java └── README.md ├── 1305-number-of-visible-people-in-a-queue ├── 1305-number-of-visible-people-in-a-queue.java └── README.md ├── 1325-path-with-maximum-probability ├── 1325-path-with-maximum-probability.java └── README.md ├── 1333-sort-the-jumbled-numbers ├── 1333-sort-the-jumbled-numbers.java └── README.md ├── 1335-maximum-candies-allocated-to-k-children ├── 1335-maximum-candies-allocated-to-k-children.java └── README.md ├── 1350-remove-sub-folders-from-the-filesystem ├── 1350-remove-sub-folders-from-the-filesystem.java └── README.md ├── 1364-tuple-with-same-product ├── 1364-tuple-with-same-product.java └── README.md ├── 1370-count-number-of-nice-subarrays ├── 1370-count-number-of-nice-subarrays.java └── README.md ├── 1380-number-of-closed-islands ├── 1380-number-of-closed-islands.java └── README.md ├── 1387-find-elements-in-a-contaminated-binary-tree ├── 1387-find-elements-in-a-contaminated-binary-tree.java └── README.md ├── 1392-find-the-difference-of-two-arrays ├── 1392-find-the-difference-of-two-arrays.java └── README.md ├── 1396-count-servers-that-communicate ├── 1396-count-servers-that-communicate.java └── README.md ├── 14-longest-common-prefix ├── 14-longest-common-prefix.java ├── NOTES.md └── README.md ├── 1402-count-square-submatrices-with-all-ones ├── 1402-count-square-submatrices-with-all-ones.java └── README.md ├── 1407-group-the-people-given-the-group-size-they-belong-to ├── 1407-group-the-people-given-the-group-size-they-belong-to.java └── README.md ├── 1408-find-the-smallest-divisor-given-a-threshold ├── 1408-find-the-smallest-divisor-given-a-threshold.java └── README.md ├── 1421-find-numbers-with-even-number-of-digits ├── 1421-find-numbers-with-even-number-of-digits.java └── README.md ├── 1424-maximum-candies-you-can-get-from-boxes ├── 1424-maximum-candies-you-can-get-from-boxes.java └── README.md ├── 1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph ├── 1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph.java └── README.md ├── 1435-xor-queries-of-a-subarray ├── 1435-xor-queries-of-a-subarray.java └── README.md ├── 1437-minimum-insertion-steps-to-make-a-string-palindrome ├── 1437-minimum-insertion-steps-to-make-a-string-palindrome.java └── README.md ├── 1451-minimum-number-of-taps-to-open-to-water-a-garden ├── 1451-minimum-number-of-taps-to-open-to-water-a-garden.java └── README.md ├── 1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance ├── 1456-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance.java └── README.md ├── 1460-number-of-substrings-containing-all-three-characters ├── 1460-number-of-substrings-containing-all-three-characters.java └── README.md ├── 1461-count-all-valid-pickup-and-delivery-options ├── 1461-count-all-valid-pickup-and-delivery-options.java └── README.md ├── 1473-find-the-longest-substring-containing-vowels-in-even-counts ├── 1473-find-the-longest-substring-containing-vowels-in-even-counts.java └── README.md ├── 1477-product-of-the-last-k-numbers ├── 1477-product-of-the-last-k-numbers.java └── README.md ├── 1484-linked-list-in-binary-tree ├── 1484-linked-list-in-binary-tree.java └── README.md ├── 1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid ├── 1485-minimum-cost-to-make-at-least-one-valid-path-in-a-grid.java └── README.md ├── 1496-lucky-numbers-in-a-matrix ├── 1496-lucky-numbers-in-a-matrix.java └── README.md ├── 1497-design-a-stack-with-increment-operation ├── 1497-design-a-stack-with-increment-operation.java └── README.md ├── 1500-count-largest-group ├── 1500-count-largest-group.java └── README.md ├── 1502-construct-k-palindrome-strings └── README.md ├── 1511-count-number-of-teams ├── 1511-count-number-of-teams.java └── README.md ├── 1516-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n ├── 1516-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n.java └── README.md ├── 1524-string-matching-in-an-array ├── 1524-string-matching-in-an-array.java └── README.md ├── 1529-max-difference-you-can-get-from-changing-an-integer ├── 1529-max-difference-you-can-get-from-changing-an-integer.java └── README.md ├── 1537-maximum-score-after-splitting-a-string ├── 1537-maximum-score-after-splitting-a-string.java └── README.md ├── 1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit ├── 1549-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit.java └── README.md ├── 1556-make-two-arrays-equal-by-reversing-subarrays ├── 1556-make-two-arrays-equal-by-reversing-subarrays.java └── README.md ├── 1558-course-schedule-iv └── README.md ├── 1570-final-prices-with-a-special-discount-in-a-shop ├── 1570-final-prices-with-a-special-discount-in-a-shop.java └── README.md ├── 1605-minimum-number-of-days-to-make-m-bouquets ├── 1605-minimum-number-of-days-to-make-m-bouquets.java └── README.md ├── 1615-range-sum-of-sorted-subarray-sums ├── 1615-range-sum-of-sorted-subarray-sums.java └── README.md ├── 1620-check-if-array-pairs-are-divisible-by-k ├── 1620-check-if-array-pairs-are-divisible-by-k.java └── README.md ├── 1631-number-of-sub-arrays-with-odd-sum ├── 1631-number-of-sub-arrays-with-odd-sum.java └── README.md ├── 1642-water-bottles ├── 1642-water-bottles.java └── README.md ├── 1646-kth-missing-positive-number ├── 1646-kth-missing-positive-number.java └── README.md ├── 1653-number-of-good-leaf-nodes-pairs ├── 1653-number-of-good-leaf-nodes-pairs.java └── README.md ├── 1656-count-good-triplets ├── 1656-count-good-triplets.java └── README.md ├── 1667-find-kth-bit-in-nth-binary-string ├── 1667-find-kth-bit-in-nth-binary-string.java └── README.md ├── 1675-magnetic-force-between-two-balls ├── 1675-magnetic-force-between-two-balls.java └── README.md ├── 1679-shortest-subarray-to-be-removed-to-make-array-sorted └── README.md ├── 1691-minimum-number-of-days-to-disconnect-island └── README.md ├── 1694-make-sum-divisible-by-p ├── 1694-make-sum-divisible-by-p.java └── README.md ├── 1701-remove-max-number-of-edges-to-keep-graph-fully-traversable ├── 1701-remove-max-number-of-edges-to-keep-graph-fully-traversable.java └── README.md ├── 1706-min-cost-to-connect-all-points ├── 1706-min-cost-to-connect-all-points.java └── README.md ├── 1711-find-valid-matrix-given-row-and-column-sums ├── 1711-find-valid-matrix-given-row-and-column-sums.java └── README.md ├── 1715-split-a-string-into-the-max-number-of-unique-substrings └── README.md ├── 1720-crawler-log-folder ├── 1720-crawler-log-folder.java └── README.md ├── 1741-sort-array-by-increasing-frequency ├── 1741-sort-array-by-increasing-frequency.java └── README.md ├── 1744-number-of-ways-to-form-a-target-string-given-a-dictionary ├── 1744-number-of-ways-to-form-a-target-string-given-a-dictionary.java └── README.md ├── 1753-path-with-minimum-effort ├── 1753-path-with-minimum-effort.java └── README.md ├── 1755-defuse-the-bomb ├── 1755-defuse-the-bomb.java └── README.md ├── 1756-minimum-deletions-to-make-string-balanced ├── 1756-minimum-deletions-to-make-string-balanced.java └── README.md ├── 1766-minimum-number-of-removals-to-make-mountain-array ├── 1766-minimum-number-of-removals-to-make-mountain-array.java └── README.md ├── 1770-minimum-deletions-to-make-character-frequencies-unique └── README.md ├── 1775-design-an-ordered-stream ├── 1775-design-an-ordered-stream.java └── README.md ├── 1776-minimum-operations-to-reduce-x-to-zero ├── 1776-minimum-operations-to-reduce-x-to-zero.java └── README.md ├── 1786-count-the-number-of-consistent-strings ├── 1786-count-the-number-of-consistent-strings.java └── README.md ├── 1803-average-waiting-time ├── 1803-average-waiting-time.java └── README.md ├── 1818-maximum-score-from-removing-substrings ├── 1818-maximum-score-from-removing-substrings.java └── README.md ├── 1833-find-the-highest-altitude ├── 1833-find-the-highest-altitude.java └── README.md ├── 1849-maximum-absolute-sum-of-any-subarray ├── 1849-maximum-absolute-sum-of-any-subarray.java └── README.md ├── 1876-map-of-highest-peak ├── 1876-map-of-highest-peak.java └── README.md ├── 1878-check-if-array-is-sorted-and-rotated ├── 1878-check-if-array-is-sorted-and-rotated.java └── README.md ├── 1886-minimum-limit-of-balls-in-a-bag ├── 1886-minimum-limit-of-balls-in-a-bag.java └── README.md ├── 1889-check-if-number-is-a-sum-of-powers-of-three ├── 1889-check-if-number-is-a-sum-of-powers-of-three.java └── README.md ├── 1890-sum-of-beauty-of-all-substrings ├── 1890-sum-of-beauty-of-all-substrings.java └── README.md ├── 1895-minimum-number-of-operations-to-move-all-balls-to-each-box ├── 1895-minimum-number-of-operations-to-move-all-balls-to-each-box.java └── README.md ├── 1915-check-if-one-string-swap-can-make-strings-equal ├── 1915-check-if-one-string-swap-can-make-strings-equal.java └── README.md ├── 1917-maximum-average-pass-ratio └── README.md ├── 1923-sentence-similarity-iii ├── 1923-sentence-similarity-iii.java └── README.md ├── 1927-maximum-ascending-subarray-sum ├── 1927-maximum-ascending-subarray-sum.java └── README.md ├── 1929-maximum-value-at-a-given-index-in-a-bounded-array ├── 1929-maximum-value-at-a-given-index-in-a-bounded-array.java └── README.md ├── 1940-maximum-xor-for-each-query ├── 1940-maximum-xor-for-each-query.java └── README.md ├── 1951-find-the-winner-of-the-circular-game ├── 1951-find-the-winner-of-the-circular-game.java └── README.md ├── 1972-rotating-the-box ├── 1972-rotating-the-box.java └── README.md ├── 1975-minimum-distance-to-the-target-element └── README.md ├── 1986-largest-color-value-in-a-directed-graph ├── 1986-largest-color-value-in-a-directed-graph.java └── README.md ├── 1993-sum-of-all-subset-xor-totals ├── 1993-sum-of-all-subset-xor-totals.java └── README.md ├── 2-add-two-numbers ├── 2-add-two-numbers.java ├── NOTES.md └── README.md ├── 20-valid-parentheses ├── 20-valid-parentheses.java ├── NOTES.md └── README.md ├── 2000-minimum-speed-to-arrive-on-time ├── 2000-minimum-speed-to-arrive-on-time.java └── README.md ├── 2006-find-the-student-that-will-replace-the-chalk ├── 2006-find-the-student-that-will-replace-the-chalk.java └── README.md ├── 2021-remove-all-occurrences-of-a-substring ├── 2021-remove-all-occurrences-of-a-substring.java └── README.md ├── 2035-count-sub-islands ├── 2035-count-sub-islands.java └── README.md ├── 2038-nearest-exit-from-entrance-in-maze ├── 2038-nearest-exit-from-entrance-in-maze.java └── README.md ├── 2047-find-a-peak-element-ii ├── 2047-find-a-peak-element-ii.java └── README.md ├── 2048-build-array-from-permutation ├── 2048-build-array-from-permutation.java └── README.md ├── 2050-count-good-numbers ├── 2050-count-good-numbers.java └── README.md ├── 2054-the-number-of-the-smallest-unoccupied-chair ├── 2054-the-number-of-the-smallest-unoccupied-chair.java └── README.md ├── 2057-smallest-index-with-equal-value ├── 2057-smallest-index-with-equal-value.java ├── NOTES.md └── README.md ├── 2059-unique-length-3-palindromic-subsequences └── README.md ├── 2061-painting-a-grid-with-three-different-colors ├── 2061-painting-a-grid-with-three-different-colors.java └── README.md ├── 2067-maximum-number-of-points-with-cost ├── 2067-maximum-number-of-points-with-cost.java └── README.md ├── 2076-sum-of-digits-of-string-after-convert ├── 2076-sum-of-digits-of-string-after-convert.java └── README.md ├── 2089-maximum-matrix-sum ├── 2089-maximum-matrix-sum.java └── README.md ├── 2090-number-of-ways-to-arrive-at-destination ├── 2090-number-of-ways-to-arrive-at-destination.java └── README.md ├── 2095-minimum-number-of-swaps-to-make-the-string-balanced ├── 2095-minimum-number-of-swaps-to-make-the-string-balanced.java └── README.md ├── 21-merge-two-sorted-lists ├── 21-merge-two-sorted-lists.java ├── NOTES.md └── README.md ├── 2107-find-unique-binary-string └── README.md ├── 2132-convert-1d-array-into-2d-array ├── 2132-convert-1d-array-into-2d-array.java └── README.md ├── 2144-maximum-difference-between-increasing-elements ├── 2144-maximum-difference-between-increasing-elements.java └── README.md ├── 2145-grid-game ├── 2145-grid-game.java └── README.md ├── 2148-minimum-number-of-moves-to-seat-everyone └── README.md ├── 2149-remove-colored-pieces-if-both-neighbors-are-the-same-color ├── 2149-remove-colored-pieces-if-both-neighbors-are-the-same-color.java └── README.md ├── 2155-find-missing-observations └── README.md ├── 2160-minimum-operations-to-make-a-uni-value-grid ├── 2160-minimum-operations-to-make-a-uni-value-grid.java └── README.md ├── 2163-kth-distinct-string-in-an-array ├── 2163-kth-distinct-string-in-an-array.java └── README.md ├── 2164-two-best-non-overlapping-events └── README.md ├── 2170-count-number-of-maximum-bitwise-or-subsets ├── 2170-count-number-of-maximum-bitwise-or-subsets.java └── README.md ├── 2171-second-minimum-time-to-reach-destination ├── 2171-second-minimum-time-to-reach-destination.java └── README.md ├── 2179-most-beautiful-item-for-each-query ├── 2179-most-beautiful-item-for-each-query.java └── README.md ├── 2180-maximum-number-of-tasks-you-can-assign ├── 2180-maximum-number-of-tasks-you-can-assign.java └── README.md ├── 2181-smallest-index-with-equal-value ├── 2181-smallest-index-with-equal-value.java └── README.md ├── 2182-find-the-minimum-and-maximum-number-of-nodes-between-critical-points ├── 2182-find-the-minimum-and-maximum-number-of-nodes-between-critical-points.java └── README.md ├── 2188-minimized-maximum-of-products-distributed-to-any-store ├── 2188-minimized-maximum-of-products-distributed-to-any-store.java └── README.md ├── 2201-valid-arrangement-of-pairs ├── 2201-valid-arrangement-of-pairs.java └── README.md ├── 2211-k-radius-subarray-averages ├── 2211-k-radius-subarray-averages.java └── README.md ├── 2215-finding-3-digit-even-numbers ├── 2215-finding-3-digit-even-numbers.java └── README.md ├── 2216-delete-the-middle-node-of-a-linked-list ├── 2216-delete-the-middle-node-of-a-linked-list.java └── README.md ├── 2220-find-all-possible-recipes-from-given-supplies ├── 2220-find-all-possible-recipes-from-given-supplies.java └── README.md ├── 2221-check-if-a-parentheses-string-can-be-valid ├── 2221-check-if-a-parentheses-string-can-be-valid.java └── README.md ├── 2237-longest-palindrome-by-concatenating-two-letter-words ├── 2237-longest-palindrome-by-concatenating-two-letter-words.java └── README.md ├── 2246-maximum-employees-to-be-invited-to-a-meeting ├── 2246-maximum-employees-to-be-invited-to-a-meeting.java └── README.md ├── 2248-minimum-cost-of-buying-candies-with-discount ├── 2248-minimum-cost-of-buying-candies-with-discount.java └── README.md ├── 2249-count-the-hidden-sequences ├── 2249-count-the-hidden-sequences.java └── README.md ├── 2255-minimum-swaps-to-group-all-1s-together-ii ├── 2255-minimum-swaps-to-group-all-1s-together-ii.java └── README.md ├── 2262-solving-questions-with-brainpower ├── 2262-solving-questions-with-brainpower.java └── README.md ├── 2263-maximum-running-time-of-n-computers ├── 2263-maximum-running-time-of-n-computers.java └── README.md ├── 2265-partition-array-according-to-given-pivot ├── 2265-partition-array-according-to-given-pivot.java └── README.md ├── 2277-count-equal-and-divisible-pairs-in-an-array ├── 2277-count-equal-and-divisible-pairs-in-an-array.java └── README.md ├── 2280-count-good-triplets-in-an-array ├── 2280-count-good-triplets-in-an-array.java └── README.md ├── 2292-counting-words-with-a-given-prefix ├── 2292-counting-words-with-a-given-prefix.java └── README.md ├── 2300-construct-string-with-repeat-limit ├── 2300-construct-string-with-repeat-limit.java └── README.md ├── 2306-create-binary-tree-from-descriptions ├── 2306-create-binary-tree-from-descriptions.java └── README.md ├── 2308-divide-array-into-equal-pairs ├── 2308-divide-array-into-equal-pairs.java └── README.md ├── 2323-minimum-bit-flips-to-convert-number └── README.md ├── 2343-count-unguarded-cells-in-the-grid ├── 2343-count-unguarded-cells-in-the-grid.java └── README.md ├── 2356-largest-combination-with-bitwise-and-greater-than-zero ├── 2356-largest-combination-with-bitwise-and-greater-than-zero.java └── README.md ├── 2358-number-of-ways-to-split-array ├── 2358-number-of-ways-to-split-array.java └── README.md ├── 2375-minimum-obstacle-removal-to-reach-corner ├── 2375-minimum-obstacle-removal-to-reach-corner.java └── README.md ├── 2394-count-subarrays-with-score-less-than-k ├── 2394-count-subarrays-with-score-less-than-k.java └── README.md ├── 2409-number-of-increasing-paths-in-a-grid ├── 2409-number-of-increasing-paths-in-a-grid.java └── README.md ├── 2411-spiral-matrix-iv ├── 2411-spiral-matrix-iv.java └── README.md ├── 2414-move-pieces-to-obtain-a-string └── README.md ├── 2415-count-the-number-of-ideal-arrays ├── 2415-count-the-number-of-ideal-arrays.java └── README.md ├── 2428-equal-row-and-column-pairs ├── 2428-equal-row-and-column-pairs.java └── README.md ├── 2434-design-a-number-container-system ├── 2434-design-a-number-container-system.java └── README.md ├── 2438-find-closest-node-to-given-two-nodes ├── 2438-find-closest-node-to-given-two-nodes.java └── README.md ├── 2442-number-of-arithmetic-triplets ├── 2442-number-of-arithmetic-triplets.java └── README.md ├── 2443-check-if-there-is-a-valid-partition-for-the-array ├── 2443-check-if-there-is-a-valid-partition-for-the-array.java └── README.md ├── 2448-count-number-of-bad-pairs ├── 2448-count-number-of-bad-pairs.java └── README.md ├── 2450-minimum-replacements-to-sort-the-array ├── 2450-minimum-replacements-to-sort-the-array.java └── README.md ├── 2456-construct-smallest-number-from-di-string ├── 2456-construct-smallest-number-from-di-string.java └── README.md ├── 2463-minimum-recolors-to-get-k-consecutive-black-blocks ├── 2463-minimum-recolors-to-get-k-consecutive-black-blocks.java └── README.md ├── 2465-shifting-letters-ii ├── 2465-shifting-letters-ii.java └── README.md ├── 2472-build-a-matrix-with-conditions ├── 2472-build-a-matrix-with-conditions.java └── README.md ├── 2473-max-sum-of-a-pair-with-equal-sum-of-digits ├── 2473-max-sum-of-a-pair-with-equal-sum-of-digits.java └── README.md ├── 2478-longest-nice-subarray ├── 2478-longest-nice-subarray.java └── README.md ├── 2488-divide-intervals-into-minimum-number-of-groups ├── 2488-divide-intervals-into-minimum-number-of-groups.java └── README.md ├── 2493-reverse-odd-levels-of-binary-tree ├── 2493-reverse-odd-levels-of-binary-tree.java └── README.md ├── 2494-sum-of-prefix-scores-of-strings └── README.md ├── 2502-sort-the-people ├── 2502-sort-the-people.java └── README.md ├── 2503-longest-subarray-with-maximum-bitwise-and ├── 2503-longest-subarray-with-maximum-bitwise-and.java └── README.md ├── 2509-minimize-xor ├── 2509-minimize-xor.java └── README.md ├── 2520-using-a-robot-to-print-the-lexicographically-smallest-string ├── 2520-using-a-robot-to-print-the-lexicographically-smallest-string.java └── README.md ├── 2527-count-subarrays-with-fixed-bounds ├── 2527-count-subarrays-with-fixed-bounds.java └── README.md ├── 2533-bitwise-xor-of-all-pairings ├── 2533-bitwise-xor-of-all-pairings.java └── README.md ├── 2538-minimum-cost-to-make-array-equal ├── 2538-minimum-cost-to-make-array-equal.java └── README.md ├── 2545-height-of-binary-tree-after-subtree-removal-queries ├── 2545-height-of-binary-tree-after-subtree-removal-queries.java └── README.md ├── 2551-apply-operations-to-an-array ├── 2551-apply-operations-to-an-array.java └── README.md ├── 2552-maximum-sum-of-distinct-subarrays-with-length-k ├── 2552-maximum-sum-of-distinct-subarrays-with-length-k.java └── README.md ├── 2554-minimum-total-distance-traveled ├── 2554-minimum-total-distance-traveled.java └── README.md ├── 2558-minimum-number-of-operations-to-sort-a-binary-tree-by-level ├── 2558-minimum-number-of-operations-to-sort-a-binary-tree-by-level.java └── README.md ├── 2562-count-ways-to-build-good-strings ├── 2562-count-ways-to-build-good-strings.java └── README.md ├── 2564-most-profitable-path-in-a-tree ├── 2564-most-profitable-path-in-a-tree.java └── README.md ├── 2580-circular-sentence └── README.md ├── 2581-divide-players-into-teams-of-equal-skill ├── 2581-divide-players-into-teams-of-equal-skill.java └── README.md ├── 2583-divide-nodes-into-the-maximum-number-of-groups ├── 2583-divide-nodes-into-the-maximum-number-of-groups.java └── README.md ├── 2586-longest-square-streak-in-an-array ├── 2586-longest-square-streak-in-an-array.java └── README.md ├── 2588-maximum-number-of-points-from-grid-queries ├── 2588-maximum-number-of-points-from-grid-queries.java └── README.md ├── 2599-take-k-of-each-character-from-left-and-right └── README.md ├── 26-remove-duplicates-from-sorted-array ├── 26-remove-duplicates-from-sorted-array.java ├── NOTES.md └── README.md ├── 2610-closest-prime-numbers-in-range ├── 2610-closest-prime-numbers-in-range.java └── README.md ├── 2616-maximal-score-after-applying-k-operations ├── 2616-maximal-score-after-applying-k-operations.java └── README.md ├── 2626-count-the-number-of-good-subarrays ├── 2626-count-the-number-of-good-subarrays.java └── README.md ├── 2640-maximum-number-of-integers-to-choose-from-a-range-i ├── 2640-maximum-number-of-integers-to-choose-from-a-range-i.java └── README.md ├── 2645-pass-the-pillow ├── 2645-pass-the-pillow.java └── README.md ├── 2646-kth-largest-sum-in-a-binary-tree ├── 2646-kth-largest-sum-in-a-binary-tree.java └── README.md ├── 2649-count-total-number-of-colored-cells ├── 2649-count-total-number-of-colored-cells.java └── README.md ├── 2654-count-the-number-of-vowel-strings-in-range ├── 2654-count-the-number-of-vowel-strings-in-range.java └── README.md ├── 2665-minimum-time-to-repair-cars ├── 2665-minimum-time-to-repair-cars.java └── README.md ├── 2673-maximize-win-from-two-segments ├── 2673-maximize-win-from-two-segments.java └── README.md ├── 2677-cousins-in-binary-tree-ii ├── 2677-cousins-in-binary-tree-ii.java └── README.md ├── 2681-put-marbles-in-bags ├── 2681-put-marbles-in-bags.java └── README.md ├── 2685-first-completely-painted-row-or-column ├── 2685-first-completely-painted-row-or-column.java └── README.md ├── 2690-house-robber-iv └── README.md ├── 2691-count-vowel-strings-in-ranges ├── 2691-count-vowel-strings-in-ranges.java └── README.md ├── 2692-take-gifts-from-the-richest-pile ├── 2692-take-gifts-from-the-richest-pile.java └── README.md ├── 2695-find-score-of-an-array-after-marking-all-elements ├── 2695-find-score-of-an-array-after-marking-all-elements.java └── README.md ├── 2699-count-the-number-of-fair-pairs ├── 2699-count-the-number-of-fair-pairs.java └── README.md ├── 2704-maximum-difference-by-remapping-a-digit ├── 2704-maximum-difference-by-remapping-a-digit.java └── README.md ├── 2707-merge-two-2d-arrays-by-summing-values ├── 2707-merge-two-2d-arrays-by-summing-values.java └── README.md ├── 2711-minimum-time-to-visit-a-cell-in-a-grid ├── 2711-minimum-time-to-visit-a-cell-in-a-grid.java └── README.md ├── 2716-prime-subtraction-operation ├── 2716-prime-subtraction-operation.java └── README.md ├── 2720-minimize-the-maximum-difference-of-pairs ├── 2720-minimize-the-maximum-difference-of-pairs.java └── README.md ├── 2727-number-of-senior-citizens ├── 2727-number-of-senior-citizens.java └── README.md ├── 2728-sum-in-a-matrix ├── 2728-sum-in-a-matrix.java └── README.md ├── 2755-extra-characters-in-a-string ├── 2755-extra-characters-in-a-string.java └── README.md ├── 2764-maximum-number-of-fish-in-a-grid ├── 2764-maximum-number-of-fish-in-a-grid.java └── README.md ├── 2766-find-the-prefix-common-array-of-two-arrays ├── 2766-find-the-prefix-common-array-of-two-arrays.java └── README.md ├── 2785-semi-ordered-permutation ├── 2785-semi-ordered-permutation.java └── README.md ├── 2786-find-the-longest-semi-repetitive-substring └── README.md ├── 2792-neighboring-bitwise-xor ├── 2792-neighboring-bitwise-xor.java └── README.md ├── 2793-count-the-number-of-complete-components ├── 2793-count-the-number-of-complete-components.java └── README.md ├── 2794-maximum-number-of-moves-in-a-grid ├── 2794-maximum-number-of-moves-in-a-grid.java └── README.md ├── 2800-minimum-string-length-after-removing-substrings ├── 2800-minimum-string-length-after-removing-substrings.java └── README.md ├── 2803-modify-graph-edge-weights ├── 2803-modify-graph-edge-weights.java └── README.md ├── 2811-determine-the-minimum-sum-of-a-k-avoiding-array ├── 2811-determine-the-minimum-sum-of-a-k-avoiding-array.java └── README.md ├── 2812-find-the-maximum-achievable-number ├── 2812-find-the-maximum-achievable-number.java └── README.md ├── 2825-minimize-string-length ├── 2825-minimize-string-length.java └── README.md ├── 2831-number-of-beautiful-pairs ├── 2831-number-of-beautiful-pairs.java └── README.md ├── 2832-find-the-longest-equal-subarray ├── 2832-find-the-longest-equal-subarray.java └── README.md ├── 2836-neither-minimum-nor-maximum ├── 2836-neither-minimum-nor-maximum.java └── README.md ├── 2838-sum-of-matrix-after-queries ├── 2838-sum-of-matrix-after-queries.java └── README.md ├── 2845-find-the-value-of-the-partition ├── 2845-find-the-value-of-the-partition.java └── README.md ├── 2846-robot-collisions ├── 2846-robot-collisions.java └── README.md ├── 2847-find-maximum-number-of-string-pairs ├── 2847-find-maximum-number-of-string-pairs.java └── README.md ├── 2850-construct-the-longest-new-string ├── 2850-construct-the-longest-new-string.java └── README.md ├── 2856-count-complete-subarrays-in-an-array ├── 2856-count-complete-subarrays-in-an-array.java └── README.md ├── 2857-total-distance-traveled ├── 2857-total-distance-traveled.java └── README.md ├── 2867-ways-to-split-array-into-good-subarrays ├── 2867-ways-to-split-array-into-good-subarrays.java └── README.md ├── 2868-continuous-subarrays ├── 2868-continuous-subarrays.java └── README.md ├── 2871-double-a-number-represented-as-a-linked-list ├── 2871-double-a-number-represented-as-a-linked-list.java └── README.md ├── 2872-largest-element-in-an-array-after-merge-operations ├── 2872-largest-element-in-an-array-after-merge-operations.java └── README.md ├── 2876-number-of-employees-who-met-the-target ├── 2876-number-of-employees-who-met-the-target.java └── README.md ├── 2877-shortest-string-that-contains-three-strings ├── 2877-shortest-string-that-contains-three-strings.java └── README.md ├── 2881-split-strings-by-separator ├── 2881-split-strings-by-separator.java └── README.md ├── 2886-faulty-keyboard ├── 2886-faulty-keyboard.java └── README.md ├── 2888-minimum-index-of-a-valid-split ├── 2888-minimum-index-of-a-valid-split.java └── README.md ├── 2891-maximum-beauty-of-an-array-after-applying-operation ├── 2891-maximum-beauty-of-an-array-after-applying-operation.java └── README.md ├── 2902-max-pair-sum-in-an-array ├── 2902-max-pair-sum-in-an-array.java └── README.md ├── 2903-insert-greatest-common-divisors-in-linked-list ├── 2903-insert-greatest-common-divisors-in-linked-list.java └── README.md ├── 2904-sorting-three-groups ├── 2904-sorting-three-groups.java └── README.md ├── 2915-count-of-interesting-subarrays ├── 2915-count-of-interesting-subarrays.java └── README.md ├── 2916-check-if-it-is-possible-to-split-array ├── 2916-check-if-it-is-possible-to-split-array.java └── README.md ├── 2917-count-pairs-whose-sum-is-less-than-target ├── 2917-count-pairs-whose-sum-is-less-than-target.java └── README.md ├── 2920-minimum-seconds-to-equalize-a-circular-array ├── 2920-minimum-seconds-to-equalize-a-circular-array.java └── README.md ├── 2955-account-balance-after-rounded-purchase ├── 2955-account-balance-after-rounded-purchase.java └── README.md ├── 2998-count-symmetric-integers ├── 2998-count-symmetric-integers.java └── README.md ├── 3-longest-substring-without-repeating-characters ├── 3-longest-substring-without-repeating-characters.java ├── NOTES.md └── README.md ├── 3000-minimum-absolute-difference-between-elements-with-constraint ├── 3000-minimum-absolute-difference-between-elements-with-constraint.java └── README.md ├── 3001-apply-operations-to-maximize-score ├── 3001-apply-operations-to-maximize-score.java └── README.md ├── 3018-make-string-a-subsequence-using-cyclic-increments ├── 3018-make-string-a-subsequence-using-cyclic-increments.java └── README.md ├── 3019-furthest-point-from-origin ├── 3019-furthest-point-from-origin.java └── README.md ├── 3026-find-the-minimum-possible-sum-of-a-beautiful-array ├── 3026-find-the-minimum-possible-sum-of-a-beautiful-array.java └── README.md ├── 3046-minimum-operations-to-make-a-special-number ├── 3046-minimum-operations-to-make-a-special-number.java └── README.md ├── 3142-longest-unequal-adjacent-groups-subsequence-ii ├── 3142-longest-unequal-adjacent-groups-subsequence-ii.java └── README.md ├── 3143-longest-unequal-adjacent-groups-subsequence-i ├── 3143-longest-unequal-adjacent-groups-subsequence-i.java └── README.md ├── 3152-maximum-value-of-an-ordered-triplet-ii ├── 3152-maximum-value-of-an-ordered-triplet-ii.java └── README.md ├── 3154-maximum-value-of-an-ordered-triplet-i ├── 3154-maximum-value-of-an-ordered-triplet-i.java └── README.md ├── 3171-minimum-equal-sum-of-two-arrays-after-replacing-zeros ├── 3171-minimum-equal-sum-of-two-arrays-after-replacing-zeros.java └── README.md ├── 3172-divisible-and-non-divisible-sums-difference ├── 3172-divisible-and-non-divisible-sums-difference.java └── README.md ├── 3174-minimum-number-of-changes-to-make-binary-string-beautiful └── README.md ├── 3181-find-building-where-alice-and-bob-can-meet └── README.md ├── 3189-find-champion-ii ├── 3189-find-champion-ii.java └── README.md ├── 3194-find-words-containing-character ├── 3194-find-words-containing-character.java └── README.md ├── 3195-separate-black-and-white-balls ├── 3195-separate-black-and-white-balls.java └── README.md ├── 3213-count-subarrays-where-max-element-appears-at-least-k-times ├── 3213-count-subarrays-where-max-element-appears-at-least-k-times.java └── README.md ├── 3219-make-lexicographically-smallest-array-by-swapping-elements ├── 3219-make-lexicographically-smallest-array-by-swapping-elements.java └── README.md ├── 3227-find-missing-and-repeated-values ├── 3227-find-missing-and-repeated-values.java └── README.md ├── 3235-minimum-cost-to-convert-string-i ├── 3235-minimum-cost-to-convert-string-i.java └── README.md ├── 3243-count-the-number-of-powerful-integers ├── 3243-count-the-number-of-powerful-integers.java └── README.md ├── 3267-find-longest-special-substring-that-occurs-thrice-i ├── 3267-find-longest-special-substring-that-occurs-thrice-i.java └── README.md ├── 3276-minimum-number-of-pushes-to-type-word-ii ├── 3276-minimum-number-of-pushes-to-type-word-ii.java └── README.md ├── 3291-find-if-array-can-be-sorted ├── 3291-find-if-array-can-be-sorted.java └── README.md ├── 3307-find-the-maximum-sum-of-node-values ├── 3307-find-the-maximum-sum-of-node-values.java └── README.md ├── 3309-count-prefix-and-suffix-pairs-i ├── 3309-count-prefix-and-suffix-pairs-i.java └── README.md ├── 3321-type-of-triangle ├── 3321-type-of-triangle.java └── README.md ├── 3329-find-the-length-of-the-longest-common-prefix ├── 3329-find-the-length-of-the-longest-common-prefix.java └── README.md ├── 3332-minimum-operations-to-exceed-threshold-value-ii ├── 3332-minimum-operations-to-exceed-threshold-value-ii.java └── README.md ├── 3348-minimum-cost-walk-in-weighted-graph ├── 3348-minimum-cost-walk-in-weighted-graph.java └── README.md ├── 3372-longest-strictly-increasing-or-strictly-decreasing-subarray ├── 3372-longest-strictly-increasing-or-strictly-decreasing-subarray.java └── README.md ├── 3379-score-of-a-string ├── 3379-score-of-a-string.java └── README.md ├── 3380-shortest-subarray-with-or-at-least-k-ii ├── 3380-shortest-subarray-with-or-at-least-k-ii.java └── README.md ├── 3394-minimum-array-end ├── 3394-minimum-array-end.java └── README.md ├── 3427-special-array-ii ├── 3427-special-array-ii.java └── README.md ├── 3429-special-array-i ├── 3429-special-array-i.java └── README.md ├── 3430-count-days-without-meetings ├── 3430-count-days-without-meetings.java └── README.md ├── 3434-find-the-number-of-distinct-colors-among-the-balls ├── 3434-find-the-number-of-distinct-colors-among-the-balls.java └── README.md ├── 3439-find-minimum-diameter-after-merging-two-trees ├── 3439-find-minimum-diameter-after-merging-two-trees.java └── README.md ├── 3445-lexicographically-minimum-string-after-removing-stars ├── 3445-lexicographically-minimum-string-after-removing-stars.java └── README.md ├── 3447-clear-digits └── README.md ├── 3451-string-compression-iii ├── 3451-string-compression-iii.java └── README.md ├── 3455-minimum-length-of-string-after-operations ├── 3455-minimum-length-of-string-after-operations.java └── README.md ├── 3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i ├── 3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i.java └── README.md ├── 3483-alternating-groups-ii ├── 3483-alternating-groups-ii.java └── README.md ├── 3501-delete-nodes-from-linked-list-present-in-array ├── 3501-delete-nodes-from-linked-list-present-in-array.java └── README.md ├── 3517-shortest-distance-after-road-addition-queries-i ├── 3517-shortest-distance-after-road-addition-queries-i.java └── README.md ├── 3522-find-the-power-of-k-size-subarrays-i ├── 3522-find-the-power-of-k-size-subarrays-i.java └── README.md ├── 3548-find-the-count-of-good-integers ├── 3548-find-the-count-of-good-integers.java └── README.md ├── 3555-final-array-state-after-k-multiplication-operations-i ├── 3555-final-array-state-after-k-multiplication-operations-i.java └── README.md ├── 3569-count-of-substrings-containing-every-vowel-and-k-consonants-ii ├── 3569-count-of-substrings-containing-every-vowel-and-k-consonants-ii.java └── README.md ├── 3621-minimum-operations-to-make-array-values-equal-to-k ├── 3621-minimum-operations-to-make-array-values-equal-to-k.java └── README.md ├── 3627-find-minimum-time-to-reach-last-room-i ├── 3627-find-minimum-time-to-reach-last-room-i.java └── README.md ├── 3628-find-minimum-time-to-reach-last-room-ii ├── 3628-find-minimum-time-to-reach-last-room-ii.java └── README.md ├── 3629-total-characters-in-string-after-transformations-i ├── 3629-total-characters-in-string-after-transformations-i.java └── README.md ├── 3630-total-characters-in-string-after-transformations-ii ├── 3630-total-characters-in-string-after-transformations-ii.java └── README.md ├── 3633-maximize-the-number-of-target-nodes-after-connecting-trees-i ├── 3633-maximize-the-number-of-target-nodes-after-connecting-trees-i.java └── README.md ├── 3637-count-number-of-balanced-permutations ├── 3637-count-number-of-balanced-permutations.java └── README.md ├── 3639-zero-array-transformation-i ├── 3639-zero-array-transformation-i.java └── README.md ├── 3645-maximize-the-number-of-target-nodes-after-connecting-trees-ii ├── 3645-maximize-the-number-of-target-nodes-after-connecting-trees-ii.java └── README.md ├── 3647-zero-array-transformation-iii ├── 3647-zero-array-transformation-iii.java └── README.md ├── 3656-minimum-number-of-operations-to-make-elements-in-array-distinct ├── 3656-minimum-number-of-operations-to-make-elements-in-array-distinct.java └── README.md ├── 3657-check-if-grid-can-be-cut-into-sections ├── 3657-check-if-grid-can-be-cut-into-sections.java └── README.md ├── 3682-count-the-number-of-arrays-with-k-matching-adjacent-elements ├── 3682-count-the-number-of-arrays-with-k-matching-adjacent-elements.java └── README.md ├── 3683-find-the-lexicographically-largest-string-from-the-box-i ├── 3683-find-the-lexicographically-largest-string-from-the-box-i.java └── README.md ├── 3685-count-subarrays-of-length-three-with-a-condition ├── 3685-count-subarrays-of-length-three-with-a-condition.java └── README.md ├── 3747-maximum-difference-between-adjacent-elements-in-a-circular-array ├── 3747-maximum-difference-between-adjacent-elements-in-a-circular-array.java └── README.md ├── 3753-maximum-difference-between-even-and-odd-frequency-i ├── 3753-maximum-difference-between-even-and-odd-frequency-i.java └── README.md ├── 3761-maximum-difference-between-even-and-odd-frequency-ii ├── 3761-maximum-difference-between-even-and-odd-frequency-ii.java └── README.md ├── 4-median-of-two-sorted-arrays ├── 4-median-of-two-sorted-arrays.java ├── NOTES.md └── README.md ├── 9-palindrome-number ├── 9-palindrome-number.java └── NOTES.md ├── Bottom View of Binary Tree - GFG ├── README.md └── bottom-view-of-binary-tree.java ├── LICENSE ├── Largest subarray with 0 sum - GFG ├── README.md └── largest-subarray-with-0-sum.java ├── Left View of Binary Tree - GFG ├── README.md └── left-view-of-binary-tree.java ├── Minimum Platforms - GFG ├── README.md └── minimum-platforms.java ├── Power Set - GFG ├── README.md └── power-set.java ├── README.md └── stats.json /0 - 1 Knapsack Problem - GFG/0-1-knapsack-problem.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0 - 1 Knapsack Problem - GFG/0-1-knapsack-problem.java -------------------------------------------------------------------------------- /0 - 1 Knapsack Problem - GFG/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0 - 1 Knapsack Problem - GFG/README.md -------------------------------------------------------------------------------- /0001-two-sum/0001-two-sum.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0001-two-sum/0001-two-sum.java -------------------------------------------------------------------------------- /0001-two-sum/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0001-two-sum/README.md -------------------------------------------------------------------------------- /0003-longest-substring-without-repeating-characters/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0003-longest-substring-without-repeating-characters/README.md -------------------------------------------------------------------------------- /0004-median-of-two-sorted-arrays/0004-median-of-two-sorted-arrays.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0004-median-of-two-sorted-arrays/0004-median-of-two-sorted-arrays.java -------------------------------------------------------------------------------- /0004-median-of-two-sorted-arrays/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0004-median-of-two-sorted-arrays/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0004-median-of-two-sorted-arrays/README.md -------------------------------------------------------------------------------- /0007-reverse-integer/0007-reverse-integer.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0007-reverse-integer/0007-reverse-integer.java -------------------------------------------------------------------------------- /0007-reverse-integer/NOTES.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0007-reverse-integer/NOTES.md -------------------------------------------------------------------------------- /0007-reverse-integer/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0007-reverse-integer/README.md -------------------------------------------------------------------------------- /0013-roman-to-integer/0013-roman-to-integer.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0013-roman-to-integer/0013-roman-to-integer.java -------------------------------------------------------------------------------- /0013-roman-to-integer/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0013-roman-to-integer/README.md -------------------------------------------------------------------------------- /0017-letter-combinations-of-a-phone-number/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0017-letter-combinations-of-a-phone-number/README.md -------------------------------------------------------------------------------- /0019-remove-nth-node-from-end-of-list/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0019-remove-nth-node-from-end-of-list/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0019-remove-nth-node-from-end-of-list/README.md -------------------------------------------------------------------------------- /0020-valid-parentheses/0020-valid-parentheses.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0020-valid-parentheses/0020-valid-parentheses.java -------------------------------------------------------------------------------- /0020-valid-parentheses/NOTES.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0020-valid-parentheses/NOTES.md -------------------------------------------------------------------------------- /0020-valid-parentheses/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0020-valid-parentheses/README.md -------------------------------------------------------------------------------- /0022-generate-parentheses/0022-generate-parentheses.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0022-generate-parentheses/0022-generate-parentheses.java -------------------------------------------------------------------------------- /0022-generate-parentheses/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0022-generate-parentheses/README.md -------------------------------------------------------------------------------- /0026-remove-duplicates-from-sorted-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0026-remove-duplicates-from-sorted-array/README.md -------------------------------------------------------------------------------- /0033-search-in-rotated-sorted-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0033-search-in-rotated-sorted-array/README.md -------------------------------------------------------------------------------- /0035-search-insert-position/0035-search-insert-position.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0035-search-insert-position/0035-search-insert-position.java -------------------------------------------------------------------------------- /0035-search-insert-position/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0035-search-insert-position/README.md -------------------------------------------------------------------------------- /0036-valid-sudoku/0036-valid-sudoku.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0036-valid-sudoku/0036-valid-sudoku.java -------------------------------------------------------------------------------- /0036-valid-sudoku/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0036-valid-sudoku/README.md -------------------------------------------------------------------------------- /0038-count-and-say/0038-count-and-say.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0038-count-and-say/0038-count-and-say.java -------------------------------------------------------------------------------- /0038-count-and-say/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0038-count-and-say/README.md -------------------------------------------------------------------------------- /0040-combination-sum-ii/0040-combination-sum-ii.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0040-combination-sum-ii/0040-combination-sum-ii.java -------------------------------------------------------------------------------- /0040-combination-sum-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0040-combination-sum-ii/README.md -------------------------------------------------------------------------------- /0042-trapping-rain-water/0042-trapping-rain-water.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0042-trapping-rain-water/0042-trapping-rain-water.java -------------------------------------------------------------------------------- /0042-trapping-rain-water/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0042-trapping-rain-water/README.md -------------------------------------------------------------------------------- /0046-permutations/0046-permutations.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0046-permutations/0046-permutations.java -------------------------------------------------------------------------------- /0046-permutations/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0046-permutations/README.md -------------------------------------------------------------------------------- /0048-rotate-image/0048-rotate-image.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0048-rotate-image/0048-rotate-image.java -------------------------------------------------------------------------------- /0048-rotate-image/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0048-rotate-image/README.md -------------------------------------------------------------------------------- /0049-group-anagrams/0049-group-anagrams.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0049-group-anagrams/0049-group-anagrams.java -------------------------------------------------------------------------------- /0049-group-anagrams/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0049-group-anagrams/README.md -------------------------------------------------------------------------------- /0050-powx-n/0050-powx-n.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0050-powx-n/0050-powx-n.java -------------------------------------------------------------------------------- /0050-powx-n/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0050-powx-n/README.md -------------------------------------------------------------------------------- /0053-maximum-subarray/0053-maximum-subarray.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0053-maximum-subarray/0053-maximum-subarray.java -------------------------------------------------------------------------------- /0053-maximum-subarray/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0053-maximum-subarray/README.md -------------------------------------------------------------------------------- /0054-spiral-matrix/0054-spiral-matrix.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0054-spiral-matrix/0054-spiral-matrix.java -------------------------------------------------------------------------------- /0054-spiral-matrix/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0054-spiral-matrix/README.md -------------------------------------------------------------------------------- /0055-jump-game/0055-jump-game.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0055-jump-game/0055-jump-game.java -------------------------------------------------------------------------------- /0055-jump-game/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0055-jump-game/README.md -------------------------------------------------------------------------------- /0061-rotate-list/0061-rotate-list.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0061-rotate-list/0061-rotate-list.java -------------------------------------------------------------------------------- /0061-rotate-list/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0061-rotate-list/README.md -------------------------------------------------------------------------------- /0062-unique-paths/0062-unique-paths.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0062-unique-paths/0062-unique-paths.java -------------------------------------------------------------------------------- /0062-unique-paths/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0062-unique-paths/README.md -------------------------------------------------------------------------------- /0063-unique-paths-ii/0063-unique-paths-ii.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0063-unique-paths-ii/0063-unique-paths-ii.java -------------------------------------------------------------------------------- /0063-unique-paths-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0063-unique-paths-ii/README.md -------------------------------------------------------------------------------- /0064-minimum-path-sum/0064-minimum-path-sum.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0064-minimum-path-sum/0064-minimum-path-sum.java -------------------------------------------------------------------------------- /0064-minimum-path-sum/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0064-minimum-path-sum/README.md -------------------------------------------------------------------------------- /0066-plus-one/0066-plus-one.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0066-plus-one/0066-plus-one.java -------------------------------------------------------------------------------- /0066-plus-one/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0066-plus-one/README.md -------------------------------------------------------------------------------- /0068-text-justification/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0068-text-justification/README.md -------------------------------------------------------------------------------- /0070-climbing-stairs/0070-climbing-stairs.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0070-climbing-stairs/0070-climbing-stairs.java -------------------------------------------------------------------------------- /0070-climbing-stairs/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0070-climbing-stairs/README.md -------------------------------------------------------------------------------- /0072-edit-distance/0072-edit-distance.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0072-edit-distance/0072-edit-distance.java -------------------------------------------------------------------------------- /0072-edit-distance/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0072-edit-distance/README.md -------------------------------------------------------------------------------- /0073-set-matrix-zeroes/0073-set-matrix-zeroes.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0073-set-matrix-zeroes/0073-set-matrix-zeroes.java -------------------------------------------------------------------------------- /0073-set-matrix-zeroes/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0073-set-matrix-zeroes/README.md -------------------------------------------------------------------------------- /0074-search-a-2d-matrix/0074-search-a-2d-matrix.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0074-search-a-2d-matrix/0074-search-a-2d-matrix.java -------------------------------------------------------------------------------- /0074-search-a-2d-matrix/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0074-search-a-2d-matrix/README.md -------------------------------------------------------------------------------- /0075-sort-colors/0075-sort-colors.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0075-sort-colors/0075-sort-colors.java -------------------------------------------------------------------------------- /0075-sort-colors/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0075-sort-colors/README.md -------------------------------------------------------------------------------- /0076-minimum-window-substring/0076-minimum-window-substring.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0076-minimum-window-substring/0076-minimum-window-substring.java -------------------------------------------------------------------------------- /0076-minimum-window-substring/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0076-minimum-window-substring/README.md -------------------------------------------------------------------------------- /0077-combinations/0077-combinations.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0077-combinations/0077-combinations.java -------------------------------------------------------------------------------- /0077-combinations/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0077-combinations/README.md -------------------------------------------------------------------------------- /0081-search-in-rotated-sorted-array-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0081-search-in-rotated-sorted-array-ii/README.md -------------------------------------------------------------------------------- /0086-partition-list/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0086-partition-list/README.md -------------------------------------------------------------------------------- /0088-merge-sorted-array/0088-merge-sorted-array.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0088-merge-sorted-array/0088-merge-sorted-array.java -------------------------------------------------------------------------------- /0088-merge-sorted-array/NOTES.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0088-merge-sorted-array/NOTES.md -------------------------------------------------------------------------------- /0088-merge-sorted-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0088-merge-sorted-array/README.md -------------------------------------------------------------------------------- /0090-subsets-ii/0090-subsets-ii.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0090-subsets-ii/0090-subsets-ii.java -------------------------------------------------------------------------------- /0090-subsets-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0090-subsets-ii/README.md -------------------------------------------------------------------------------- /0091-decode-ways/0091-decode-ways.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0091-decode-ways/0091-decode-ways.java -------------------------------------------------------------------------------- /0091-decode-ways/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0091-decode-ways/README.md -------------------------------------------------------------------------------- /0094-binary-tree-inorder-traversal/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0094-binary-tree-inorder-traversal/README.md -------------------------------------------------------------------------------- /0095-unique-binary-search-trees-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0095-unique-binary-search-trees-ii/README.md -------------------------------------------------------------------------------- /0097-interleaving-string/0097-interleaving-string.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0097-interleaving-string/0097-interleaving-string.java -------------------------------------------------------------------------------- /0097-interleaving-string/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0097-interleaving-string/README.md -------------------------------------------------------------------------------- /0110-balanced-binary-tree/0110-balanced-binary-tree.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0110-balanced-binary-tree/0110-balanced-binary-tree.java -------------------------------------------------------------------------------- /0110-balanced-binary-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0110-balanced-binary-tree/README.md -------------------------------------------------------------------------------- /0118-pascals-triangle/0118-pascals-triangle.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0118-pascals-triangle/0118-pascals-triangle.java -------------------------------------------------------------------------------- /0118-pascals-triangle/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0118-pascals-triangle/README.md -------------------------------------------------------------------------------- /0121-best-time-to-buy-and-sell-stock/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0121-best-time-to-buy-and-sell-stock/README.md -------------------------------------------------------------------------------- /0122-best-time-to-buy-and-sell-stock-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0122-best-time-to-buy-and-sell-stock-ii/README.md -------------------------------------------------------------------------------- /0125-valid-palindrome/0125-valid-palindrome.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0125-valid-palindrome/0125-valid-palindrome.java -------------------------------------------------------------------------------- /0125-valid-palindrome/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0125-valid-palindrome/README.md -------------------------------------------------------------------------------- /0128-longest-consecutive-sequence/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0128-longest-consecutive-sequence/README.md -------------------------------------------------------------------------------- /0131-palindrome-partitioning/0131-palindrome-partitioning.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0131-palindrome-partitioning/0131-palindrome-partitioning.java -------------------------------------------------------------------------------- /0131-palindrome-partitioning/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0131-palindrome-partitioning/README.md -------------------------------------------------------------------------------- /0135-candy/0135-candy.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0135-candy/0135-candy.java -------------------------------------------------------------------------------- /0135-candy/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0135-candy/README.md -------------------------------------------------------------------------------- /0141-linked-list-cycle/0141-linked-list-cycle.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0141-linked-list-cycle/0141-linked-list-cycle.java -------------------------------------------------------------------------------- /0141-linked-list-cycle/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0141-linked-list-cycle/README.md -------------------------------------------------------------------------------- /0142-linked-list-cycle-ii/0142-linked-list-cycle-ii.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0142-linked-list-cycle-ii/0142-linked-list-cycle-ii.java -------------------------------------------------------------------------------- /0142-linked-list-cycle-ii/NOTES.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0142-linked-list-cycle-ii/NOTES.md -------------------------------------------------------------------------------- /0142-linked-list-cycle-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0142-linked-list-cycle-ii/README.md -------------------------------------------------------------------------------- /0145-binary-tree-postorder-traversal/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0145-binary-tree-postorder-traversal/README.md -------------------------------------------------------------------------------- /0151-reverse-words-in-a-string/0151-reverse-words-in-a-string.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0151-reverse-words-in-a-string/0151-reverse-words-in-a-string.java -------------------------------------------------------------------------------- /0151-reverse-words-in-a-string/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0151-reverse-words-in-a-string/README.md -------------------------------------------------------------------------------- /0153-find-minimum-in-rotated-sorted-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0153-find-minimum-in-rotated-sorted-array/README.md -------------------------------------------------------------------------------- /0160-intersection-of-two-linked-lists/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0160-intersection-of-two-linked-lists/README.md -------------------------------------------------------------------------------- /0162-find-peak-element/0162-find-peak-element.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0162-find-peak-element/0162-find-peak-element.java -------------------------------------------------------------------------------- /0162-find-peak-element/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0162-find-peak-element/README.md -------------------------------------------------------------------------------- /0168-excel-sheet-column-title/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0168-excel-sheet-column-title/README.md -------------------------------------------------------------------------------- /0179-largest-number/0179-largest-number.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0179-largest-number/0179-largest-number.java -------------------------------------------------------------------------------- /0179-largest-number/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0179-largest-number/README.md -------------------------------------------------------------------------------- /0198-house-robber/0198-house-robber.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0198-house-robber/0198-house-robber.java -------------------------------------------------------------------------------- /0198-house-robber/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0198-house-robber/README.md -------------------------------------------------------------------------------- /0200-number-of-islands/0200-number-of-islands.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0200-number-of-islands/0200-number-of-islands.java -------------------------------------------------------------------------------- /0200-number-of-islands/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0200-number-of-islands/README.md -------------------------------------------------------------------------------- /0206-reverse-linked-list/0206-reverse-linked-list.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0206-reverse-linked-list/0206-reverse-linked-list.java -------------------------------------------------------------------------------- /0206-reverse-linked-list/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0206-reverse-linked-list/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0206-reverse-linked-list/README.md -------------------------------------------------------------------------------- /0213-house-robber-ii/0213-house-robber-ii.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0213-house-robber-ii/0213-house-robber-ii.java -------------------------------------------------------------------------------- /0213-house-robber-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0213-house-robber-ii/README.md -------------------------------------------------------------------------------- /0214-shortest-palindrome/0214-shortest-palindrome.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0214-shortest-palindrome/0214-shortest-palindrome.java -------------------------------------------------------------------------------- /0214-shortest-palindrome/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0214-shortest-palindrome/README.md -------------------------------------------------------------------------------- /0215-kth-largest-element-in-an-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0215-kth-largest-element-in-an-array/README.md -------------------------------------------------------------------------------- /0217-contains-duplicate/0217-contains-duplicate.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0217-contains-duplicate/0217-contains-duplicate.java -------------------------------------------------------------------------------- /0217-contains-duplicate/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0217-contains-duplicate/README.md -------------------------------------------------------------------------------- /0228-summary-ranges/0228-summary-ranges.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0228-summary-ranges/0228-summary-ranges.java -------------------------------------------------------------------------------- /0228-summary-ranges/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0228-summary-ranges/README.md -------------------------------------------------------------------------------- /0234-palindrome-linked-list/0234-palindrome-linked-list.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0234-palindrome-linked-list/0234-palindrome-linked-list.java -------------------------------------------------------------------------------- /0234-palindrome-linked-list/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0234-palindrome-linked-list/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0234-palindrome-linked-list/README.md -------------------------------------------------------------------------------- /0239-sliding-window-maximum/0239-sliding-window-maximum.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0239-sliding-window-maximum/0239-sliding-window-maximum.java -------------------------------------------------------------------------------- /0239-sliding-window-maximum/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0239-sliding-window-maximum/README.md -------------------------------------------------------------------------------- /0240-search-a-2d-matrix-ii/0240-search-a-2d-matrix-ii.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0240-search-a-2d-matrix-ii/0240-search-a-2d-matrix-ii.java -------------------------------------------------------------------------------- /0240-search-a-2d-matrix-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0240-search-a-2d-matrix-ii/README.md -------------------------------------------------------------------------------- /0242-valid-anagram/0242-valid-anagram.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0242-valid-anagram/0242-valid-anagram.java -------------------------------------------------------------------------------- /0242-valid-anagram/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0242-valid-anagram/README.md -------------------------------------------------------------------------------- /0264-ugly-number-ii/0264-ugly-number-ii.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0264-ugly-number-ii/0264-ugly-number-ii.java -------------------------------------------------------------------------------- /0264-ugly-number-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0264-ugly-number-ii/README.md -------------------------------------------------------------------------------- /0273-integer-to-english-words/0273-integer-to-english-words.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0273-integer-to-english-words/0273-integer-to-english-words.java -------------------------------------------------------------------------------- /0273-integer-to-english-words/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0273-integer-to-english-words/README.md -------------------------------------------------------------------------------- /0283-move-zeroes/0283-move-zeroes.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0283-move-zeroes/0283-move-zeroes.java -------------------------------------------------------------------------------- /0283-move-zeroes/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0283-move-zeroes/README.md -------------------------------------------------------------------------------- /0287-find-the-duplicate-number/0287-find-the-duplicate-number.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0287-find-the-duplicate-number/0287-find-the-duplicate-number.java -------------------------------------------------------------------------------- /0287-find-the-duplicate-number/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0287-find-the-duplicate-number/README.md -------------------------------------------------------------------------------- /0300-longest-increasing-subsequence/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0300-longest-increasing-subsequence/README.md -------------------------------------------------------------------------------- /0322-coin-change/0322-coin-change.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0322-coin-change/0322-coin-change.java -------------------------------------------------------------------------------- /0322-coin-change/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0322-coin-change/README.md -------------------------------------------------------------------------------- /0330-patching-array/0330-patching-array.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0330-patching-array/0330-patching-array.java -------------------------------------------------------------------------------- /0330-patching-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0330-patching-array/README.md -------------------------------------------------------------------------------- /0332-reconstruct-itinerary/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0332-reconstruct-itinerary/README.md -------------------------------------------------------------------------------- /0338-counting-bits/0338-counting-bits.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0338-counting-bits/0338-counting-bits.java -------------------------------------------------------------------------------- /0338-counting-bits/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0338-counting-bits/README.md -------------------------------------------------------------------------------- /0344-reverse-string/0344-reverse-string.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0344-reverse-string/0344-reverse-string.java -------------------------------------------------------------------------------- /0344-reverse-string/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0344-reverse-string/README.md -------------------------------------------------------------------------------- /0347-top-k-frequent-elements/0347-top-k-frequent-elements.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0347-top-k-frequent-elements/0347-top-k-frequent-elements.java -------------------------------------------------------------------------------- /0347-top-k-frequent-elements/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0347-top-k-frequent-elements/README.md -------------------------------------------------------------------------------- /0350-intersection-of-two-arrays-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0350-intersection-of-two-arrays-ii/README.md -------------------------------------------------------------------------------- /0368-largest-divisible-subset/0368-largest-divisible-subset.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0368-largest-divisible-subset/0368-largest-divisible-subset.java -------------------------------------------------------------------------------- /0368-largest-divisible-subset/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0368-largest-divisible-subset/README.md -------------------------------------------------------------------------------- /0383-ransom-note/0383-ransom-note.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0383-ransom-note/0383-ransom-note.java -------------------------------------------------------------------------------- /0383-ransom-note/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0383-ransom-note/README.md -------------------------------------------------------------------------------- /0386-lexicographical-numbers/0386-lexicographical-numbers.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0386-lexicographical-numbers/0386-lexicographical-numbers.java -------------------------------------------------------------------------------- /0386-lexicographical-numbers/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0386-lexicographical-numbers/README.md -------------------------------------------------------------------------------- /0392-is-subsequence/0392-is-subsequence.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0392-is-subsequence/0392-is-subsequence.java -------------------------------------------------------------------------------- /0392-is-subsequence/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0392-is-subsequence/README.md -------------------------------------------------------------------------------- /0403-frog-jump/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0403-frog-jump/README.md -------------------------------------------------------------------------------- /0407-trapping-rain-water-ii/0407-trapping-rain-water-ii.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0407-trapping-rain-water-ii/0407-trapping-rain-water-ii.java -------------------------------------------------------------------------------- /0407-trapping-rain-water-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0407-trapping-rain-water-ii/README.md -------------------------------------------------------------------------------- /0410-split-array-largest-sum/0410-split-array-largest-sum.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0410-split-array-largest-sum/0410-split-array-largest-sum.java -------------------------------------------------------------------------------- /0410-split-array-largest-sum/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0410-split-array-largest-sum/README.md -------------------------------------------------------------------------------- /0416-partition-equal-subset-sum/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0416-partition-equal-subset-sum/README.md -------------------------------------------------------------------------------- /0432-all-oone-data-structure/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0432-all-oone-data-structure/README.md -------------------------------------------------------------------------------- /0440-k-th-smallest-in-lexicographical-order/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0440-k-th-smallest-in-lexicographical-order/README.md -------------------------------------------------------------------------------- /0451-sort-characters-by-frequency/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0451-sort-characters-by-frequency/README.md -------------------------------------------------------------------------------- /0455-assign-cookies/0455-assign-cookies.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0455-assign-cookies/0455-assign-cookies.java -------------------------------------------------------------------------------- /0455-assign-cookies/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0455-assign-cookies/README.md -------------------------------------------------------------------------------- /0476-number-complement/0476-number-complement.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0476-number-complement/0476-number-complement.java -------------------------------------------------------------------------------- /0476-number-complement/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0476-number-complement/README.md -------------------------------------------------------------------------------- /0485-max-consecutive-ones/0485-max-consecutive-ones.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0485-max-consecutive-ones/0485-max-consecutive-ones.java -------------------------------------------------------------------------------- /0485-max-consecutive-ones/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0485-max-consecutive-ones/README.md -------------------------------------------------------------------------------- /0486-predict-the-winner/0486-predict-the-winner.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0486-predict-the-winner/0486-predict-the-winner.java -------------------------------------------------------------------------------- /0486-predict-the-winner/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0486-predict-the-winner/README.md -------------------------------------------------------------------------------- /0494-target-sum/0494-target-sum.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0494-target-sum/0494-target-sum.java -------------------------------------------------------------------------------- /0494-target-sum/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0494-target-sum/README.md -------------------------------------------------------------------------------- /0502-ipo/0502-ipo.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0502-ipo/0502-ipo.java -------------------------------------------------------------------------------- /0502-ipo/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0502-ipo/README.md -------------------------------------------------------------------------------- /0515-find-largest-value-in-each-tree-row/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0515-find-largest-value-in-each-tree-row/README.md -------------------------------------------------------------------------------- /0516-longest-palindromic-subsequence/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0516-longest-palindromic-subsequence/README.md -------------------------------------------------------------------------------- /0518-coin-change-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0518-coin-change-ii/README.md -------------------------------------------------------------------------------- /0523-continuous-subarray-sum/0523-continuous-subarray-sum.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0523-continuous-subarray-sum/0523-continuous-subarray-sum.java -------------------------------------------------------------------------------- /0523-continuous-subarray-sum/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0523-continuous-subarray-sum/README.md -------------------------------------------------------------------------------- /0539-minimum-time-difference/0539-minimum-time-difference.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0539-minimum-time-difference/0539-minimum-time-difference.java -------------------------------------------------------------------------------- /0539-minimum-time-difference/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0539-minimum-time-difference/README.md -------------------------------------------------------------------------------- /0540-single-element-in-a-sorted-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0540-single-element-in-a-sorted-array/README.md -------------------------------------------------------------------------------- /0542-01-matrix/0542-01-matrix.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0542-01-matrix/0542-01-matrix.java -------------------------------------------------------------------------------- /0542-01-matrix/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0542-01-matrix/README.md -------------------------------------------------------------------------------- /0547-number-of-provinces/0547-number-of-provinces.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0547-number-of-provinces/0547-number-of-provinces.java -------------------------------------------------------------------------------- /0547-number-of-provinces/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0547-number-of-provinces/README.md -------------------------------------------------------------------------------- /0567-permutation-in-string/0567-permutation-in-string.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0567-permutation-in-string/0567-permutation-in-string.java -------------------------------------------------------------------------------- /0567-permutation-in-string/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0567-permutation-in-string/README.md -------------------------------------------------------------------------------- /0583-delete-operation-for-two-strings/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0583-delete-operation-for-two-strings/README.md -------------------------------------------------------------------------------- /0592-fraction-addition-and-subtraction/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0592-fraction-addition-and-subtraction/README.md -------------------------------------------------------------------------------- /0624-maximum-distance-in-arrays/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0624-maximum-distance-in-arrays/README.md -------------------------------------------------------------------------------- /0633-sum-of-square-numbers/0633-sum-of-square-numbers.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0633-sum-of-square-numbers/0633-sum-of-square-numbers.java -------------------------------------------------------------------------------- /0633-sum-of-square-numbers/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0633-sum-of-square-numbers/README.md -------------------------------------------------------------------------------- /0646-maximum-length-of-pair-chain/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0646-maximum-length-of-pair-chain/README.md -------------------------------------------------------------------------------- /0647-palindromic-substrings/0647-palindromic-substrings.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0647-palindromic-substrings/0647-palindromic-substrings.java -------------------------------------------------------------------------------- /0647-palindromic-substrings/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0647-palindromic-substrings/README.md -------------------------------------------------------------------------------- /0648-replace-words/0648-replace-words.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0648-replace-words/0648-replace-words.java -------------------------------------------------------------------------------- /0648-replace-words/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0648-replace-words/README.md -------------------------------------------------------------------------------- /0650-2-keys-keyboard/0650-2-keys-keyboard.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0650-2-keys-keyboard/0650-2-keys-keyboard.java -------------------------------------------------------------------------------- /0650-2-keys-keyboard/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0650-2-keys-keyboard/README.md -------------------------------------------------------------------------------- /0664-strange-printer/0664-strange-printer.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0664-strange-printer/0664-strange-printer.java -------------------------------------------------------------------------------- /0664-strange-printer/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0664-strange-printer/README.md -------------------------------------------------------------------------------- /0670-maximum-swap/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0670-maximum-swap/README.md -------------------------------------------------------------------------------- /0684-redundant-connection/0684-redundant-connection.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0684-redundant-connection/0684-redundant-connection.java -------------------------------------------------------------------------------- /0684-redundant-connection/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0684-redundant-connection/README.md -------------------------------------------------------------------------------- /0689-maximum-sum-of-3-non-overlapping-subarrays/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0689-maximum-sum-of-3-non-overlapping-subarrays/README.md -------------------------------------------------------------------------------- /0695-max-area-of-island/0695-max-area-of-island.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0695-max-area-of-island/0695-max-area-of-island.java -------------------------------------------------------------------------------- /0695-max-area-of-island/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0695-max-area-of-island/README.md -------------------------------------------------------------------------------- /0712-minimum-ascii-delete-sum-for-two-strings/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0712-minimum-ascii-delete-sum-for-two-strings/README.md -------------------------------------------------------------------------------- /0714-best-time-to-buy-and-sell-stock-with-transaction-fee/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0714-best-time-to-buy-and-sell-stock-with-transaction-fee/README.md -------------------------------------------------------------------------------- /0719-find-k-th-smallest-pair-distance/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0719-find-k-th-smallest-pair-distance/README.md -------------------------------------------------------------------------------- /0724-find-pivot-index/0724-find-pivot-index.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0724-find-pivot-index/0724-find-pivot-index.java -------------------------------------------------------------------------------- /0724-find-pivot-index/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0724-find-pivot-index/README.md -------------------------------------------------------------------------------- /0725-split-linked-list-in-parts/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0725-split-linked-list-in-parts/README.md -------------------------------------------------------------------------------- /0726-number-of-atoms/0726-number-of-atoms.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0726-number-of-atoms/0726-number-of-atoms.java -------------------------------------------------------------------------------- /0726-number-of-atoms/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0726-number-of-atoms/README.md -------------------------------------------------------------------------------- /0729-my-calendar-i/0729-my-calendar-i.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0729-my-calendar-i/0729-my-calendar-i.java -------------------------------------------------------------------------------- /0729-my-calendar-i/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0729-my-calendar-i/README.md -------------------------------------------------------------------------------- /0731-my-calendar-ii/0731-my-calendar-ii.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0731-my-calendar-ii/0731-my-calendar-ii.java -------------------------------------------------------------------------------- /0731-my-calendar-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0731-my-calendar-ii/README.md -------------------------------------------------------------------------------- /0740-delete-and-earn/0740-delete-and-earn.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0740-delete-and-earn/0740-delete-and-earn.java -------------------------------------------------------------------------------- /0740-delete-and-earn/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0740-delete-and-earn/README.md -------------------------------------------------------------------------------- /0745-find-smallest-letter-greater-than-target/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0745-find-smallest-letter-greater-than-target/README.md -------------------------------------------------------------------------------- /0747-min-cost-climbing-stairs/0747-min-cost-climbing-stairs.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0747-min-cost-climbing-stairs/0747-min-cost-climbing-stairs.java -------------------------------------------------------------------------------- /0747-min-cost-climbing-stairs/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0747-min-cost-climbing-stairs/README.md -------------------------------------------------------------------------------- /0768-partition-labels/0768-partition-labels.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0768-partition-labels/0768-partition-labels.java -------------------------------------------------------------------------------- /0768-partition-labels/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0768-partition-labels/README.md -------------------------------------------------------------------------------- /0776-n-ary-tree-postorder-traversal/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0776-n-ary-tree-postorder-traversal/README.md -------------------------------------------------------------------------------- /0778-reorganize-string/0778-reorganize-string.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0778-reorganize-string/0778-reorganize-string.java -------------------------------------------------------------------------------- /0778-reorganize-string/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0778-reorganize-string/README.md -------------------------------------------------------------------------------- /0780-max-chunks-to-make-sorted/0780-max-chunks-to-make-sorted.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0780-max-chunks-to-make-sorted/0780-max-chunks-to-make-sorted.java -------------------------------------------------------------------------------- /0780-max-chunks-to-make-sorted/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0780-max-chunks-to-make-sorted/README.md -------------------------------------------------------------------------------- /0787-sliding-puzzle/0787-sliding-puzzle.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0787-sliding-puzzle/0787-sliding-puzzle.java -------------------------------------------------------------------------------- /0787-sliding-puzzle/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0787-sliding-puzzle/README.md -------------------------------------------------------------------------------- /0789-kth-largest-element-in-a-stream/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0789-kth-largest-element-in-a-stream/README.md -------------------------------------------------------------------------------- /0797-rabbits-in-forest/0797-rabbits-in-forest.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0797-rabbits-in-forest/0797-rabbits-in-forest.java -------------------------------------------------------------------------------- /0797-rabbits-in-forest/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0797-rabbits-in-forest/README.md -------------------------------------------------------------------------------- /0806-domino-and-tromino-tiling/0806-domino-and-tromino-tiling.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0806-domino-and-tromino-tiling/0806-domino-and-tromino-tiling.java -------------------------------------------------------------------------------- /0806-domino-and-tromino-tiling/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0806-domino-and-tromino-tiling/README.md -------------------------------------------------------------------------------- /0812-rotate-string/0812-rotate-string.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0812-rotate-string/0812-rotate-string.java -------------------------------------------------------------------------------- /0812-rotate-string/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0812-rotate-string/README.md -------------------------------------------------------------------------------- /0820-find-eventual-safe-states/0820-find-eventual-safe-states.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0820-find-eventual-safe-states/0820-find-eventual-safe-states.java -------------------------------------------------------------------------------- /0820-find-eventual-safe-states/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0820-find-eventual-safe-states/README.md -------------------------------------------------------------------------------- /0826-soup-servings/0826-soup-servings.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0826-soup-servings/0826-soup-servings.java -------------------------------------------------------------------------------- /0826-soup-servings/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0826-soup-servings/README.md -------------------------------------------------------------------------------- /0853-most-profit-assigning-work/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0853-most-profit-assigning-work/README.md -------------------------------------------------------------------------------- /0854-making-a-large-island/0854-making-a-large-island.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0854-making-a-large-island/0854-making-a-large-island.java -------------------------------------------------------------------------------- /0854-making-a-large-island/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0854-making-a-large-island/README.md -------------------------------------------------------------------------------- /0859-design-circular-deque/0859-design-circular-deque.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0859-design-circular-deque/0859-design-circular-deque.java -------------------------------------------------------------------------------- /0859-design-circular-deque/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0859-design-circular-deque/README.md -------------------------------------------------------------------------------- /0868-push-dominoes/0868-push-dominoes.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0868-push-dominoes/0868-push-dominoes.java -------------------------------------------------------------------------------- /0868-push-dominoes/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0868-push-dominoes/README.md -------------------------------------------------------------------------------- /0870-magic-squares-in-grid/0870-magic-squares-in-grid.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0870-magic-squares-in-grid/0870-magic-squares-in-grid.java -------------------------------------------------------------------------------- /0870-magic-squares-in-grid/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0870-magic-squares-in-grid/README.md -------------------------------------------------------------------------------- /0876-middle-of-the-linked-list/0876-middle-of-the-linked-list.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0876-middle-of-the-linked-list/0876-middle-of-the-linked-list.java -------------------------------------------------------------------------------- /0876-middle-of-the-linked-list/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /0876-middle-of-the-linked-list/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0876-middle-of-the-linked-list/README.md -------------------------------------------------------------------------------- /0882-peak-index-in-a-mountain-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0882-peak-index-in-a-mountain-array/README.md -------------------------------------------------------------------------------- /0890-lemonade-change/0890-lemonade-change.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0890-lemonade-change/0890-lemonade-change.java -------------------------------------------------------------------------------- /0890-lemonade-change/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0890-lemonade-change/README.md -------------------------------------------------------------------------------- /0892-shortest-subarray-with-sum-at-least-k/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0892-shortest-subarray-with-sum-at-least-k/README.md -------------------------------------------------------------------------------- /0905-length-of-longest-fibonacci-subsequence/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0905-length-of-longest-fibonacci-subsequence/README.md -------------------------------------------------------------------------------- /0906-walking-robot-simulation/0906-walking-robot-simulation.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0906-walking-robot-simulation/0906-walking-robot-simulation.java -------------------------------------------------------------------------------- /0906-walking-robot-simulation/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0906-walking-robot-simulation/README.md -------------------------------------------------------------------------------- /0907-koko-eating-bananas/0907-koko-eating-bananas.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0907-koko-eating-bananas/0907-koko-eating-bananas.java -------------------------------------------------------------------------------- /0907-koko-eating-bananas/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0907-koko-eating-bananas/README.md -------------------------------------------------------------------------------- /0920-uncommon-words-from-two-sentences/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0920-uncommon-words-from-two-sentences/README.md -------------------------------------------------------------------------------- /0921-spiral-matrix-iii/0921-spiral-matrix-iii.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0921-spiral-matrix-iii/0921-spiral-matrix-iii.java -------------------------------------------------------------------------------- /0921-spiral-matrix-iii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0921-spiral-matrix-iii/README.md -------------------------------------------------------------------------------- /0945-snakes-and-ladders/0945-snakes-and-ladders.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0945-snakes-and-ladders/0945-snakes-and-ladders.java -------------------------------------------------------------------------------- /0945-snakes-and-ladders/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0945-snakes-and-ladders/README.md -------------------------------------------------------------------------------- /0952-word-subsets/0952-word-subsets.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0952-word-subsets/0952-word-subsets.java -------------------------------------------------------------------------------- /0952-word-subsets/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0952-word-subsets/README.md -------------------------------------------------------------------------------- /0956-number-of-music-playlists/0956-number-of-music-playlists.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0956-number-of-music-playlists/0956-number-of-music-playlists.java -------------------------------------------------------------------------------- /0956-number-of-music-playlists/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0956-number-of-music-playlists/README.md -------------------------------------------------------------------------------- /0957-minimum-add-to-make-parentheses-valid/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0957-minimum-add-to-make-parentheses-valid/README.md -------------------------------------------------------------------------------- /0971-shortest-bridge/0971-shortest-bridge.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0971-shortest-bridge/0971-shortest-bridge.java -------------------------------------------------------------------------------- /0971-shortest-bridge/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0971-shortest-bridge/README.md -------------------------------------------------------------------------------- /0982-minimum-increment-to-make-array-unique/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0982-minimum-increment-to-make-array-unique/README.md -------------------------------------------------------------------------------- /0984-most-stones-removed-with-same-row-or-column/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0984-most-stones-removed-with-same-row-or-column/README.md -------------------------------------------------------------------------------- /0988-flip-equivalent-binary-trees/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/0988-flip-equivalent-binary-trees/README.md -------------------------------------------------------------------------------- /1-two-sum/1-two-sum.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1-two-sum/1-two-sum.java -------------------------------------------------------------------------------- /1-two-sum/NOTES.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1-two-sum/NOTES.md -------------------------------------------------------------------------------- /1-two-sum/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1-two-sum/README.md -------------------------------------------------------------------------------- /1002-maximum-width-ramp/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1002-maximum-width-ramp/README.md -------------------------------------------------------------------------------- /1013-fibonacci-number/1013-fibonacci-number.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1013-fibonacci-number/1013-fibonacci-number.java -------------------------------------------------------------------------------- /1013-fibonacci-number/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1013-fibonacci-number/README.md -------------------------------------------------------------------------------- /1016-subarray-sums-divisible-by-k/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1016-subarray-sums-divisible-by-k/README.md -------------------------------------------------------------------------------- /1025-minimum-cost-for-tickets/1025-minimum-cost-for-tickets.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1025-minimum-cost-for-tickets/1025-minimum-cost-for-tickets.java -------------------------------------------------------------------------------- /1025-minimum-cost-for-tickets/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1025-minimum-cost-for-tickets/README.md -------------------------------------------------------------------------------- /1044-find-common-characters/1044-find-common-characters.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1044-find-common-characters/1044-find-common-characters.java -------------------------------------------------------------------------------- /1044-find-common-characters/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1044-find-common-characters/README.md -------------------------------------------------------------------------------- /1049-minimum-domino-rotations-for-equal-row/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1049-minimum-domino-rotations-for-equal-row/README.md -------------------------------------------------------------------------------- /1056-capacity-to-ship-packages-within-d-days/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1056-capacity-to-ship-packages-within-d-days/README.md -------------------------------------------------------------------------------- /1058-lexicographically-smallest-equivalent-string/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1058-lexicographically-smallest-equivalent-string/README.md -------------------------------------------------------------------------------- /1063-best-sightseeing-pair/1063-best-sightseeing-pair.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1063-best-sightseeing-pair/1063-best-sightseeing-pair.java -------------------------------------------------------------------------------- /1063-best-sightseeing-pair/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1063-best-sightseeing-pair/README.md -------------------------------------------------------------------------------- /1073-number-of-enclaves/1073-number-of-enclaves.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1073-number-of-enclaves/1073-number-of-enclaves.java -------------------------------------------------------------------------------- /1073-number-of-enclaves/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1073-number-of-enclaves/README.md -------------------------------------------------------------------------------- /1087-longest-arithmetic-subsequence/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1087-longest-arithmetic-subsequence/README.md -------------------------------------------------------------------------------- /1093-recover-a-tree-from-preorder-traversal/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1093-recover-a-tree-from-preorder-traversal/README.md -------------------------------------------------------------------------------- /1114-binary-search-tree-to-greater-sum-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1114-binary-search-tree-to-greater-sum-tree/README.md -------------------------------------------------------------------------------- /1129-longest-string-chain/1129-longest-string-chain.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1129-longest-string-chain/1129-longest-string-chain.java -------------------------------------------------------------------------------- /1129-longest-string-chain/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1129-longest-string-chain/README.md -------------------------------------------------------------------------------- /1138-grumpy-bookstore-owner/1138-grumpy-bookstore-owner.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1138-grumpy-bookstore-owner/1138-grumpy-bookstore-owner.java -------------------------------------------------------------------------------- /1138-grumpy-bookstore-owner/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1138-grumpy-bookstore-owner/README.md -------------------------------------------------------------------------------- /1147-flip-columns-for-maximum-number-of-equal-rows/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1147-flip-columns-for-maximum-number-of-equal-rows/README.md -------------------------------------------------------------------------------- /1160-letter-tile-possibilities/1160-letter-tile-possibilities.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1160-letter-tile-possibilities/1160-letter-tile-possibilities.java -------------------------------------------------------------------------------- /1160-letter-tile-possibilities/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1160-letter-tile-possibilities/README.md -------------------------------------------------------------------------------- /1170-shortest-common-supersequence/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1170-shortest-common-supersequence/README.md -------------------------------------------------------------------------------- /1196-filling-bookcase-shelves/1196-filling-bookcase-shelves.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1196-filling-bookcase-shelves/1196-filling-bookcase-shelves.java -------------------------------------------------------------------------------- /1196-filling-bookcase-shelves/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1196-filling-bookcase-shelves/README.md -------------------------------------------------------------------------------- /1197-parsing-a-boolean-expression/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1197-parsing-a-boolean-expression/README.md -------------------------------------------------------------------------------- /1218-lowest-common-ancestor-of-deepest-leaves/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1218-lowest-common-ancestor-of-deepest-leaves/README.md -------------------------------------------------------------------------------- /1227-number-of-equivalent-domino-pairs/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1227-number-of-equivalent-domino-pairs/README.md -------------------------------------------------------------------------------- /1236-n-th-tribonacci-number/1236-n-th-tribonacci-number.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1236-n-th-tribonacci-number/1236-n-th-tribonacci-number.java -------------------------------------------------------------------------------- /1236-n-th-tribonacci-number/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1236-n-th-tribonacci-number/README.md -------------------------------------------------------------------------------- /1240-stone-game-ii/1240-stone-game-ii.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1240-stone-game-ii/1240-stone-game-ii.java -------------------------------------------------------------------------------- /1240-stone-game-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1240-stone-game-ii/README.md -------------------------------------------------------------------------------- /1249-snapshot-array/1249-snapshot-array.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1249-snapshot-array/1249-snapshot-array.java -------------------------------------------------------------------------------- /1249-snapshot-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1249-snapshot-array/README.md -------------------------------------------------------------------------------- /1250-longest-common-subsequence/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1250-longest-common-subsequence/README.md -------------------------------------------------------------------------------- /1256-rank-transform-of-an-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1256-rank-transform-of-an-array/README.md -------------------------------------------------------------------------------- /1293-three-consecutive-odds/1293-three-consecutive-odds.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1293-three-consecutive-odds/1293-three-consecutive-odds.java -------------------------------------------------------------------------------- /1293-three-consecutive-odds/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1293-three-consecutive-odds/README.md -------------------------------------------------------------------------------- /1298-reverse-substrings-between-each-pair-of-parentheses/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1298-reverse-substrings-between-each-pair-of-parentheses/README.md -------------------------------------------------------------------------------- /13-roman-to-integer/13-roman-to-integer.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/13-roman-to-integer/13-roman-to-integer.java -------------------------------------------------------------------------------- /13-roman-to-integer/NOTES.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/13-roman-to-integer/NOTES.md -------------------------------------------------------------------------------- /13-roman-to-integer/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/13-roman-to-integer/README.md -------------------------------------------------------------------------------- /1302-delete-characters-to-make-fancy-string/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1302-delete-characters-to-make-fancy-string/README.md -------------------------------------------------------------------------------- /1304-longest-happy-string/1304-longest-happy-string.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1304-longest-happy-string/1304-longest-happy-string.java -------------------------------------------------------------------------------- /1304-longest-happy-string/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1304-longest-happy-string/README.md -------------------------------------------------------------------------------- /1305-number-of-visible-people-in-a-queue/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1305-number-of-visible-people-in-a-queue/README.md -------------------------------------------------------------------------------- /1325-path-with-maximum-probability/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1325-path-with-maximum-probability/README.md -------------------------------------------------------------------------------- /1333-sort-the-jumbled-numbers/1333-sort-the-jumbled-numbers.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1333-sort-the-jumbled-numbers/1333-sort-the-jumbled-numbers.java -------------------------------------------------------------------------------- /1333-sort-the-jumbled-numbers/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1333-sort-the-jumbled-numbers/README.md -------------------------------------------------------------------------------- /1335-maximum-candies-allocated-to-k-children/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1335-maximum-candies-allocated-to-k-children/README.md -------------------------------------------------------------------------------- /1350-remove-sub-folders-from-the-filesystem/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1350-remove-sub-folders-from-the-filesystem/README.md -------------------------------------------------------------------------------- /1364-tuple-with-same-product/1364-tuple-with-same-product.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1364-tuple-with-same-product/1364-tuple-with-same-product.java -------------------------------------------------------------------------------- /1364-tuple-with-same-product/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1364-tuple-with-same-product/README.md -------------------------------------------------------------------------------- /1370-count-number-of-nice-subarrays/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1370-count-number-of-nice-subarrays/README.md -------------------------------------------------------------------------------- /1380-number-of-closed-islands/1380-number-of-closed-islands.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1380-number-of-closed-islands/1380-number-of-closed-islands.java -------------------------------------------------------------------------------- /1380-number-of-closed-islands/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1380-number-of-closed-islands/README.md -------------------------------------------------------------------------------- /1387-find-elements-in-a-contaminated-binary-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1387-find-elements-in-a-contaminated-binary-tree/README.md -------------------------------------------------------------------------------- /1392-find-the-difference-of-two-arrays/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1392-find-the-difference-of-two-arrays/README.md -------------------------------------------------------------------------------- /1396-count-servers-that-communicate/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1396-count-servers-that-communicate/README.md -------------------------------------------------------------------------------- /14-longest-common-prefix/14-longest-common-prefix.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/14-longest-common-prefix/14-longest-common-prefix.java -------------------------------------------------------------------------------- /14-longest-common-prefix/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /14-longest-common-prefix/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/14-longest-common-prefix/README.md -------------------------------------------------------------------------------- /1402-count-square-submatrices-with-all-ones/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1402-count-square-submatrices-with-all-ones/README.md -------------------------------------------------------------------------------- /1407-group-the-people-given-the-group-size-they-belong-to/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1407-group-the-people-given-the-group-size-they-belong-to/README.md -------------------------------------------------------------------------------- /1408-find-the-smallest-divisor-given-a-threshold/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1408-find-the-smallest-divisor-given-a-threshold/README.md -------------------------------------------------------------------------------- /1421-find-numbers-with-even-number-of-digits/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1421-find-numbers-with-even-number-of-digits/README.md -------------------------------------------------------------------------------- /1424-maximum-candies-you-can-get-from-boxes/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1424-maximum-candies-you-can-get-from-boxes/README.md -------------------------------------------------------------------------------- /1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1431-all-ancestors-of-a-node-in-a-directed-acyclic-graph/README.md -------------------------------------------------------------------------------- /1435-xor-queries-of-a-subarray/1435-xor-queries-of-a-subarray.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1435-xor-queries-of-a-subarray/1435-xor-queries-of-a-subarray.java -------------------------------------------------------------------------------- /1435-xor-queries-of-a-subarray/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1435-xor-queries-of-a-subarray/README.md -------------------------------------------------------------------------------- /1437-minimum-insertion-steps-to-make-a-string-palindrome/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1437-minimum-insertion-steps-to-make-a-string-palindrome/README.md -------------------------------------------------------------------------------- /1451-minimum-number-of-taps-to-open-to-water-a-garden/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1451-minimum-number-of-taps-to-open-to-water-a-garden/README.md -------------------------------------------------------------------------------- /1460-number-of-substrings-containing-all-three-characters/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1460-number-of-substrings-containing-all-three-characters/README.md -------------------------------------------------------------------------------- /1461-count-all-valid-pickup-and-delivery-options/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1461-count-all-valid-pickup-and-delivery-options/README.md -------------------------------------------------------------------------------- /1477-product-of-the-last-k-numbers/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1477-product-of-the-last-k-numbers/README.md -------------------------------------------------------------------------------- /1484-linked-list-in-binary-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1484-linked-list-in-binary-tree/README.md -------------------------------------------------------------------------------- /1496-lucky-numbers-in-a-matrix/1496-lucky-numbers-in-a-matrix.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1496-lucky-numbers-in-a-matrix/1496-lucky-numbers-in-a-matrix.java -------------------------------------------------------------------------------- /1496-lucky-numbers-in-a-matrix/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1496-lucky-numbers-in-a-matrix/README.md -------------------------------------------------------------------------------- /1497-design-a-stack-with-increment-operation/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1497-design-a-stack-with-increment-operation/README.md -------------------------------------------------------------------------------- /1500-count-largest-group/1500-count-largest-group.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1500-count-largest-group/1500-count-largest-group.java -------------------------------------------------------------------------------- /1500-count-largest-group/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1500-count-largest-group/README.md -------------------------------------------------------------------------------- /1502-construct-k-palindrome-strings/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1502-construct-k-palindrome-strings/README.md -------------------------------------------------------------------------------- /1511-count-number-of-teams/1511-count-number-of-teams.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1511-count-number-of-teams/1511-count-number-of-teams.java -------------------------------------------------------------------------------- /1511-count-number-of-teams/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1511-count-number-of-teams/README.md -------------------------------------------------------------------------------- /1524-string-matching-in-an-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1524-string-matching-in-an-array/README.md -------------------------------------------------------------------------------- /1529-max-difference-you-can-get-from-changing-an-integer/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1529-max-difference-you-can-get-from-changing-an-integer/README.md -------------------------------------------------------------------------------- /1537-maximum-score-after-splitting-a-string/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1537-maximum-score-after-splitting-a-string/README.md -------------------------------------------------------------------------------- /1556-make-two-arrays-equal-by-reversing-subarrays/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1556-make-two-arrays-equal-by-reversing-subarrays/README.md -------------------------------------------------------------------------------- /1558-course-schedule-iv/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1558-course-schedule-iv/README.md -------------------------------------------------------------------------------- /1570-final-prices-with-a-special-discount-in-a-shop/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1570-final-prices-with-a-special-discount-in-a-shop/README.md -------------------------------------------------------------------------------- /1605-minimum-number-of-days-to-make-m-bouquets/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1605-minimum-number-of-days-to-make-m-bouquets/README.md -------------------------------------------------------------------------------- /1615-range-sum-of-sorted-subarray-sums/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1615-range-sum-of-sorted-subarray-sums/README.md -------------------------------------------------------------------------------- /1620-check-if-array-pairs-are-divisible-by-k/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1620-check-if-array-pairs-are-divisible-by-k/README.md -------------------------------------------------------------------------------- /1631-number-of-sub-arrays-with-odd-sum/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1631-number-of-sub-arrays-with-odd-sum/README.md -------------------------------------------------------------------------------- /1642-water-bottles/1642-water-bottles.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1642-water-bottles/1642-water-bottles.java -------------------------------------------------------------------------------- /1642-water-bottles/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1642-water-bottles/README.md -------------------------------------------------------------------------------- /1646-kth-missing-positive-number/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1646-kth-missing-positive-number/README.md -------------------------------------------------------------------------------- /1653-number-of-good-leaf-nodes-pairs/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1653-number-of-good-leaf-nodes-pairs/README.md -------------------------------------------------------------------------------- /1656-count-good-triplets/1656-count-good-triplets.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1656-count-good-triplets/1656-count-good-triplets.java -------------------------------------------------------------------------------- /1656-count-good-triplets/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1656-count-good-triplets/README.md -------------------------------------------------------------------------------- /1667-find-kth-bit-in-nth-binary-string/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1667-find-kth-bit-in-nth-binary-string/README.md -------------------------------------------------------------------------------- /1675-magnetic-force-between-two-balls/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1675-magnetic-force-between-two-balls/README.md -------------------------------------------------------------------------------- /1679-shortest-subarray-to-be-removed-to-make-array-sorted/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1679-shortest-subarray-to-be-removed-to-make-array-sorted/README.md -------------------------------------------------------------------------------- /1691-minimum-number-of-days-to-disconnect-island/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1691-minimum-number-of-days-to-disconnect-island/README.md -------------------------------------------------------------------------------- /1694-make-sum-divisible-by-p/1694-make-sum-divisible-by-p.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1694-make-sum-divisible-by-p/1694-make-sum-divisible-by-p.java -------------------------------------------------------------------------------- /1694-make-sum-divisible-by-p/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1694-make-sum-divisible-by-p/README.md -------------------------------------------------------------------------------- /1706-min-cost-to-connect-all-points/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1706-min-cost-to-connect-all-points/README.md -------------------------------------------------------------------------------- /1711-find-valid-matrix-given-row-and-column-sums/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1711-find-valid-matrix-given-row-and-column-sums/README.md -------------------------------------------------------------------------------- /1720-crawler-log-folder/1720-crawler-log-folder.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1720-crawler-log-folder/1720-crawler-log-folder.java -------------------------------------------------------------------------------- /1720-crawler-log-folder/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1720-crawler-log-folder/README.md -------------------------------------------------------------------------------- /1741-sort-array-by-increasing-frequency/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1741-sort-array-by-increasing-frequency/README.md -------------------------------------------------------------------------------- /1753-path-with-minimum-effort/1753-path-with-minimum-effort.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1753-path-with-minimum-effort/1753-path-with-minimum-effort.java -------------------------------------------------------------------------------- /1753-path-with-minimum-effort/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1753-path-with-minimum-effort/README.md -------------------------------------------------------------------------------- /1755-defuse-the-bomb/1755-defuse-the-bomb.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1755-defuse-the-bomb/1755-defuse-the-bomb.java -------------------------------------------------------------------------------- /1755-defuse-the-bomb/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1755-defuse-the-bomb/README.md -------------------------------------------------------------------------------- /1756-minimum-deletions-to-make-string-balanced/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1756-minimum-deletions-to-make-string-balanced/README.md -------------------------------------------------------------------------------- /1766-minimum-number-of-removals-to-make-mountain-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1766-minimum-number-of-removals-to-make-mountain-array/README.md -------------------------------------------------------------------------------- /1775-design-an-ordered-stream/1775-design-an-ordered-stream.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1775-design-an-ordered-stream/1775-design-an-ordered-stream.java -------------------------------------------------------------------------------- /1775-design-an-ordered-stream/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1775-design-an-ordered-stream/README.md -------------------------------------------------------------------------------- /1776-minimum-operations-to-reduce-x-to-zero/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1776-minimum-operations-to-reduce-x-to-zero/README.md -------------------------------------------------------------------------------- /1786-count-the-number-of-consistent-strings/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1786-count-the-number-of-consistent-strings/README.md -------------------------------------------------------------------------------- /1803-average-waiting-time/1803-average-waiting-time.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1803-average-waiting-time/1803-average-waiting-time.java -------------------------------------------------------------------------------- /1803-average-waiting-time/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1803-average-waiting-time/README.md -------------------------------------------------------------------------------- /1818-maximum-score-from-removing-substrings/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1818-maximum-score-from-removing-substrings/README.md -------------------------------------------------------------------------------- /1833-find-the-highest-altitude/1833-find-the-highest-altitude.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1833-find-the-highest-altitude/1833-find-the-highest-altitude.java -------------------------------------------------------------------------------- /1833-find-the-highest-altitude/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1833-find-the-highest-altitude/README.md -------------------------------------------------------------------------------- /1849-maximum-absolute-sum-of-any-subarray/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1849-maximum-absolute-sum-of-any-subarray/README.md -------------------------------------------------------------------------------- /1876-map-of-highest-peak/1876-map-of-highest-peak.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1876-map-of-highest-peak/1876-map-of-highest-peak.java -------------------------------------------------------------------------------- /1876-map-of-highest-peak/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1876-map-of-highest-peak/README.md -------------------------------------------------------------------------------- /1878-check-if-array-is-sorted-and-rotated/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1878-check-if-array-is-sorted-and-rotated/README.md -------------------------------------------------------------------------------- /1886-minimum-limit-of-balls-in-a-bag/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1886-minimum-limit-of-balls-in-a-bag/README.md -------------------------------------------------------------------------------- /1889-check-if-number-is-a-sum-of-powers-of-three/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1889-check-if-number-is-a-sum-of-powers-of-three/README.md -------------------------------------------------------------------------------- /1890-sum-of-beauty-of-all-substrings/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1890-sum-of-beauty-of-all-substrings/README.md -------------------------------------------------------------------------------- /1915-check-if-one-string-swap-can-make-strings-equal/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1915-check-if-one-string-swap-can-make-strings-equal/README.md -------------------------------------------------------------------------------- /1917-maximum-average-pass-ratio/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1917-maximum-average-pass-ratio/README.md -------------------------------------------------------------------------------- /1923-sentence-similarity-iii/1923-sentence-similarity-iii.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1923-sentence-similarity-iii/1923-sentence-similarity-iii.java -------------------------------------------------------------------------------- /1923-sentence-similarity-iii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1923-sentence-similarity-iii/README.md -------------------------------------------------------------------------------- /1927-maximum-ascending-subarray-sum/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1927-maximum-ascending-subarray-sum/README.md -------------------------------------------------------------------------------- /1929-maximum-value-at-a-given-index-in-a-bounded-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1929-maximum-value-at-a-given-index-in-a-bounded-array/README.md -------------------------------------------------------------------------------- /1940-maximum-xor-for-each-query/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1940-maximum-xor-for-each-query/README.md -------------------------------------------------------------------------------- /1951-find-the-winner-of-the-circular-game/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1951-find-the-winner-of-the-circular-game/README.md -------------------------------------------------------------------------------- /1972-rotating-the-box/1972-rotating-the-box.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1972-rotating-the-box/1972-rotating-the-box.java -------------------------------------------------------------------------------- /1972-rotating-the-box/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1972-rotating-the-box/README.md -------------------------------------------------------------------------------- /1975-minimum-distance-to-the-target-element/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1975-minimum-distance-to-the-target-element/README.md -------------------------------------------------------------------------------- /1986-largest-color-value-in-a-directed-graph/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1986-largest-color-value-in-a-directed-graph/README.md -------------------------------------------------------------------------------- /1993-sum-of-all-subset-xor-totals/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/1993-sum-of-all-subset-xor-totals/README.md -------------------------------------------------------------------------------- /2-add-two-numbers/2-add-two-numbers.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2-add-two-numbers/2-add-two-numbers.java -------------------------------------------------------------------------------- /2-add-two-numbers/NOTES.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2-add-two-numbers/NOTES.md -------------------------------------------------------------------------------- /2-add-two-numbers/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2-add-two-numbers/README.md -------------------------------------------------------------------------------- /20-valid-parentheses/20-valid-parentheses.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/20-valid-parentheses/20-valid-parentheses.java -------------------------------------------------------------------------------- /20-valid-parentheses/NOTES.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/20-valid-parentheses/NOTES.md -------------------------------------------------------------------------------- /20-valid-parentheses/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/20-valid-parentheses/README.md -------------------------------------------------------------------------------- /2000-minimum-speed-to-arrive-on-time/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2000-minimum-speed-to-arrive-on-time/README.md -------------------------------------------------------------------------------- /2006-find-the-student-that-will-replace-the-chalk/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2006-find-the-student-that-will-replace-the-chalk/README.md -------------------------------------------------------------------------------- /2021-remove-all-occurrences-of-a-substring/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2021-remove-all-occurrences-of-a-substring/README.md -------------------------------------------------------------------------------- /2035-count-sub-islands/2035-count-sub-islands.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2035-count-sub-islands/2035-count-sub-islands.java -------------------------------------------------------------------------------- /2035-count-sub-islands/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2035-count-sub-islands/README.md -------------------------------------------------------------------------------- /2038-nearest-exit-from-entrance-in-maze/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2038-nearest-exit-from-entrance-in-maze/README.md -------------------------------------------------------------------------------- /2047-find-a-peak-element-ii/2047-find-a-peak-element-ii.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2047-find-a-peak-element-ii/2047-find-a-peak-element-ii.java -------------------------------------------------------------------------------- /2047-find-a-peak-element-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2047-find-a-peak-element-ii/README.md -------------------------------------------------------------------------------- /2048-build-array-from-permutation/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2048-build-array-from-permutation/README.md -------------------------------------------------------------------------------- /2050-count-good-numbers/2050-count-good-numbers.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2050-count-good-numbers/2050-count-good-numbers.java -------------------------------------------------------------------------------- /2050-count-good-numbers/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2050-count-good-numbers/README.md -------------------------------------------------------------------------------- /2054-the-number-of-the-smallest-unoccupied-chair/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2054-the-number-of-the-smallest-unoccupied-chair/README.md -------------------------------------------------------------------------------- /2057-smallest-index-with-equal-value/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /2057-smallest-index-with-equal-value/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2057-smallest-index-with-equal-value/README.md -------------------------------------------------------------------------------- /2059-unique-length-3-palindromic-subsequences/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2059-unique-length-3-palindromic-subsequences/README.md -------------------------------------------------------------------------------- /2061-painting-a-grid-with-three-different-colors/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2061-painting-a-grid-with-three-different-colors/README.md -------------------------------------------------------------------------------- /2067-maximum-number-of-points-with-cost/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2067-maximum-number-of-points-with-cost/README.md -------------------------------------------------------------------------------- /2076-sum-of-digits-of-string-after-convert/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2076-sum-of-digits-of-string-after-convert/README.md -------------------------------------------------------------------------------- /2089-maximum-matrix-sum/2089-maximum-matrix-sum.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2089-maximum-matrix-sum/2089-maximum-matrix-sum.java -------------------------------------------------------------------------------- /2089-maximum-matrix-sum/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2089-maximum-matrix-sum/README.md -------------------------------------------------------------------------------- /2090-number-of-ways-to-arrive-at-destination/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2090-number-of-ways-to-arrive-at-destination/README.md -------------------------------------------------------------------------------- /2095-minimum-number-of-swaps-to-make-the-string-balanced/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2095-minimum-number-of-swaps-to-make-the-string-balanced/README.md -------------------------------------------------------------------------------- /21-merge-two-sorted-lists/21-merge-two-sorted-lists.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/21-merge-two-sorted-lists/21-merge-two-sorted-lists.java -------------------------------------------------------------------------------- /21-merge-two-sorted-lists/NOTES.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/21-merge-two-sorted-lists/NOTES.md -------------------------------------------------------------------------------- /21-merge-two-sorted-lists/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/21-merge-two-sorted-lists/README.md -------------------------------------------------------------------------------- /2107-find-unique-binary-string/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2107-find-unique-binary-string/README.md -------------------------------------------------------------------------------- /2132-convert-1d-array-into-2d-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2132-convert-1d-array-into-2d-array/README.md -------------------------------------------------------------------------------- /2144-maximum-difference-between-increasing-elements/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2144-maximum-difference-between-increasing-elements/README.md -------------------------------------------------------------------------------- /2145-grid-game/2145-grid-game.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2145-grid-game/2145-grid-game.java -------------------------------------------------------------------------------- /2145-grid-game/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2145-grid-game/README.md -------------------------------------------------------------------------------- /2148-minimum-number-of-moves-to-seat-everyone/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2148-minimum-number-of-moves-to-seat-everyone/README.md -------------------------------------------------------------------------------- /2155-find-missing-observations/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2155-find-missing-observations/README.md -------------------------------------------------------------------------------- /2160-minimum-operations-to-make-a-uni-value-grid/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2160-minimum-operations-to-make-a-uni-value-grid/README.md -------------------------------------------------------------------------------- /2163-kth-distinct-string-in-an-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2163-kth-distinct-string-in-an-array/README.md -------------------------------------------------------------------------------- /2164-two-best-non-overlapping-events/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2164-two-best-non-overlapping-events/README.md -------------------------------------------------------------------------------- /2170-count-number-of-maximum-bitwise-or-subsets/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2170-count-number-of-maximum-bitwise-or-subsets/README.md -------------------------------------------------------------------------------- /2171-second-minimum-time-to-reach-destination/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2171-second-minimum-time-to-reach-destination/README.md -------------------------------------------------------------------------------- /2179-most-beautiful-item-for-each-query/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2179-most-beautiful-item-for-each-query/README.md -------------------------------------------------------------------------------- /2180-maximum-number-of-tasks-you-can-assign/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2180-maximum-number-of-tasks-you-can-assign/README.md -------------------------------------------------------------------------------- /2181-smallest-index-with-equal-value/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2181-smallest-index-with-equal-value/README.md -------------------------------------------------------------------------------- /2201-valid-arrangement-of-pairs/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2201-valid-arrangement-of-pairs/README.md -------------------------------------------------------------------------------- /2211-k-radius-subarray-averages/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2211-k-radius-subarray-averages/README.md -------------------------------------------------------------------------------- /2215-finding-3-digit-even-numbers/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2215-finding-3-digit-even-numbers/README.md -------------------------------------------------------------------------------- /2216-delete-the-middle-node-of-a-linked-list/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2216-delete-the-middle-node-of-a-linked-list/README.md -------------------------------------------------------------------------------- /2220-find-all-possible-recipes-from-given-supplies/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2220-find-all-possible-recipes-from-given-supplies/README.md -------------------------------------------------------------------------------- /2221-check-if-a-parentheses-string-can-be-valid/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2221-check-if-a-parentheses-string-can-be-valid/README.md -------------------------------------------------------------------------------- /2237-longest-palindrome-by-concatenating-two-letter-words/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2237-longest-palindrome-by-concatenating-two-letter-words/README.md -------------------------------------------------------------------------------- /2246-maximum-employees-to-be-invited-to-a-meeting/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2246-maximum-employees-to-be-invited-to-a-meeting/README.md -------------------------------------------------------------------------------- /2248-minimum-cost-of-buying-candies-with-discount/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2248-minimum-cost-of-buying-candies-with-discount/README.md -------------------------------------------------------------------------------- /2249-count-the-hidden-sequences/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2249-count-the-hidden-sequences/README.md -------------------------------------------------------------------------------- /2255-minimum-swaps-to-group-all-1s-together-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2255-minimum-swaps-to-group-all-1s-together-ii/README.md -------------------------------------------------------------------------------- /2262-solving-questions-with-brainpower/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2262-solving-questions-with-brainpower/README.md -------------------------------------------------------------------------------- /2263-maximum-running-time-of-n-computers/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2263-maximum-running-time-of-n-computers/README.md -------------------------------------------------------------------------------- /2265-partition-array-according-to-given-pivot/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2265-partition-array-according-to-given-pivot/README.md -------------------------------------------------------------------------------- /2277-count-equal-and-divisible-pairs-in-an-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2277-count-equal-and-divisible-pairs-in-an-array/README.md -------------------------------------------------------------------------------- /2280-count-good-triplets-in-an-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2280-count-good-triplets-in-an-array/README.md -------------------------------------------------------------------------------- /2292-counting-words-with-a-given-prefix/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2292-counting-words-with-a-given-prefix/README.md -------------------------------------------------------------------------------- /2300-construct-string-with-repeat-limit/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2300-construct-string-with-repeat-limit/README.md -------------------------------------------------------------------------------- /2306-create-binary-tree-from-descriptions/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2306-create-binary-tree-from-descriptions/README.md -------------------------------------------------------------------------------- /2308-divide-array-into-equal-pairs/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2308-divide-array-into-equal-pairs/README.md -------------------------------------------------------------------------------- /2323-minimum-bit-flips-to-convert-number/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2323-minimum-bit-flips-to-convert-number/README.md -------------------------------------------------------------------------------- /2343-count-unguarded-cells-in-the-grid/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2343-count-unguarded-cells-in-the-grid/README.md -------------------------------------------------------------------------------- /2358-number-of-ways-to-split-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2358-number-of-ways-to-split-array/README.md -------------------------------------------------------------------------------- /2375-minimum-obstacle-removal-to-reach-corner/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2375-minimum-obstacle-removal-to-reach-corner/README.md -------------------------------------------------------------------------------- /2394-count-subarrays-with-score-less-than-k/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2394-count-subarrays-with-score-less-than-k/README.md -------------------------------------------------------------------------------- /2409-number-of-increasing-paths-in-a-grid/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2409-number-of-increasing-paths-in-a-grid/README.md -------------------------------------------------------------------------------- /2411-spiral-matrix-iv/2411-spiral-matrix-iv.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2411-spiral-matrix-iv/2411-spiral-matrix-iv.java -------------------------------------------------------------------------------- /2411-spiral-matrix-iv/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2411-spiral-matrix-iv/README.md -------------------------------------------------------------------------------- /2414-move-pieces-to-obtain-a-string/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2414-move-pieces-to-obtain-a-string/README.md -------------------------------------------------------------------------------- /2415-count-the-number-of-ideal-arrays/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2415-count-the-number-of-ideal-arrays/README.md -------------------------------------------------------------------------------- /2428-equal-row-and-column-pairs/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2428-equal-row-and-column-pairs/README.md -------------------------------------------------------------------------------- /2434-design-a-number-container-system/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2434-design-a-number-container-system/README.md -------------------------------------------------------------------------------- /2438-find-closest-node-to-given-two-nodes/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2438-find-closest-node-to-given-two-nodes/README.md -------------------------------------------------------------------------------- /2442-number-of-arithmetic-triplets/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2442-number-of-arithmetic-triplets/README.md -------------------------------------------------------------------------------- /2443-check-if-there-is-a-valid-partition-for-the-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2443-check-if-there-is-a-valid-partition-for-the-array/README.md -------------------------------------------------------------------------------- /2448-count-number-of-bad-pairs/2448-count-number-of-bad-pairs.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2448-count-number-of-bad-pairs/2448-count-number-of-bad-pairs.java -------------------------------------------------------------------------------- /2448-count-number-of-bad-pairs/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2448-count-number-of-bad-pairs/README.md -------------------------------------------------------------------------------- /2450-minimum-replacements-to-sort-the-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2450-minimum-replacements-to-sort-the-array/README.md -------------------------------------------------------------------------------- /2456-construct-smallest-number-from-di-string/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2456-construct-smallest-number-from-di-string/README.md -------------------------------------------------------------------------------- /2463-minimum-recolors-to-get-k-consecutive-black-blocks/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2463-minimum-recolors-to-get-k-consecutive-black-blocks/README.md -------------------------------------------------------------------------------- /2465-shifting-letters-ii/2465-shifting-letters-ii.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2465-shifting-letters-ii/2465-shifting-letters-ii.java -------------------------------------------------------------------------------- /2465-shifting-letters-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2465-shifting-letters-ii/README.md -------------------------------------------------------------------------------- /2472-build-a-matrix-with-conditions/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2472-build-a-matrix-with-conditions/README.md -------------------------------------------------------------------------------- /2473-max-sum-of-a-pair-with-equal-sum-of-digits/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2473-max-sum-of-a-pair-with-equal-sum-of-digits/README.md -------------------------------------------------------------------------------- /2478-longest-nice-subarray/2478-longest-nice-subarray.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2478-longest-nice-subarray/2478-longest-nice-subarray.java -------------------------------------------------------------------------------- /2478-longest-nice-subarray/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2478-longest-nice-subarray/README.md -------------------------------------------------------------------------------- /2488-divide-intervals-into-minimum-number-of-groups/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2488-divide-intervals-into-minimum-number-of-groups/README.md -------------------------------------------------------------------------------- /2493-reverse-odd-levels-of-binary-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2493-reverse-odd-levels-of-binary-tree/README.md -------------------------------------------------------------------------------- /2494-sum-of-prefix-scores-of-strings/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2494-sum-of-prefix-scores-of-strings/README.md -------------------------------------------------------------------------------- /2502-sort-the-people/2502-sort-the-people.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2502-sort-the-people/2502-sort-the-people.java -------------------------------------------------------------------------------- /2502-sort-the-people/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2502-sort-the-people/README.md -------------------------------------------------------------------------------- /2503-longest-subarray-with-maximum-bitwise-and/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2503-longest-subarray-with-maximum-bitwise-and/README.md -------------------------------------------------------------------------------- /2509-minimize-xor/2509-minimize-xor.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2509-minimize-xor/2509-minimize-xor.java -------------------------------------------------------------------------------- /2509-minimize-xor/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2509-minimize-xor/README.md -------------------------------------------------------------------------------- /2527-count-subarrays-with-fixed-bounds/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2527-count-subarrays-with-fixed-bounds/README.md -------------------------------------------------------------------------------- /2533-bitwise-xor-of-all-pairings/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2533-bitwise-xor-of-all-pairings/README.md -------------------------------------------------------------------------------- /2538-minimum-cost-to-make-array-equal/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2538-minimum-cost-to-make-array-equal/README.md -------------------------------------------------------------------------------- /2545-height-of-binary-tree-after-subtree-removal-queries/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2545-height-of-binary-tree-after-subtree-removal-queries/README.md -------------------------------------------------------------------------------- /2551-apply-operations-to-an-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2551-apply-operations-to-an-array/README.md -------------------------------------------------------------------------------- /2552-maximum-sum-of-distinct-subarrays-with-length-k/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2552-maximum-sum-of-distinct-subarrays-with-length-k/README.md -------------------------------------------------------------------------------- /2554-minimum-total-distance-traveled/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2554-minimum-total-distance-traveled/README.md -------------------------------------------------------------------------------- /2562-count-ways-to-build-good-strings/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2562-count-ways-to-build-good-strings/README.md -------------------------------------------------------------------------------- /2564-most-profitable-path-in-a-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2564-most-profitable-path-in-a-tree/README.md -------------------------------------------------------------------------------- /2580-circular-sentence/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2580-circular-sentence/README.md -------------------------------------------------------------------------------- /2581-divide-players-into-teams-of-equal-skill/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2581-divide-players-into-teams-of-equal-skill/README.md -------------------------------------------------------------------------------- /2583-divide-nodes-into-the-maximum-number-of-groups/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2583-divide-nodes-into-the-maximum-number-of-groups/README.md -------------------------------------------------------------------------------- /2586-longest-square-streak-in-an-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2586-longest-square-streak-in-an-array/README.md -------------------------------------------------------------------------------- /2588-maximum-number-of-points-from-grid-queries/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2588-maximum-number-of-points-from-grid-queries/README.md -------------------------------------------------------------------------------- /2599-take-k-of-each-character-from-left-and-right/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2599-take-k-of-each-character-from-left-and-right/README.md -------------------------------------------------------------------------------- /26-remove-duplicates-from-sorted-array/NOTES.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/26-remove-duplicates-from-sorted-array/NOTES.md -------------------------------------------------------------------------------- /26-remove-duplicates-from-sorted-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/26-remove-duplicates-from-sorted-array/README.md -------------------------------------------------------------------------------- /2610-closest-prime-numbers-in-range/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2610-closest-prime-numbers-in-range/README.md -------------------------------------------------------------------------------- /2616-maximal-score-after-applying-k-operations/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2616-maximal-score-after-applying-k-operations/README.md -------------------------------------------------------------------------------- /2626-count-the-number-of-good-subarrays/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2626-count-the-number-of-good-subarrays/README.md -------------------------------------------------------------------------------- /2640-maximum-number-of-integers-to-choose-from-a-range-i/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2640-maximum-number-of-integers-to-choose-from-a-range-i/README.md -------------------------------------------------------------------------------- /2645-pass-the-pillow/2645-pass-the-pillow.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2645-pass-the-pillow/2645-pass-the-pillow.java -------------------------------------------------------------------------------- /2645-pass-the-pillow/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2645-pass-the-pillow/README.md -------------------------------------------------------------------------------- /2646-kth-largest-sum-in-a-binary-tree/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2646-kth-largest-sum-in-a-binary-tree/README.md -------------------------------------------------------------------------------- /2649-count-total-number-of-colored-cells/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2649-count-total-number-of-colored-cells/README.md -------------------------------------------------------------------------------- /2654-count-the-number-of-vowel-strings-in-range/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2654-count-the-number-of-vowel-strings-in-range/README.md -------------------------------------------------------------------------------- /2665-minimum-time-to-repair-cars/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2665-minimum-time-to-repair-cars/README.md -------------------------------------------------------------------------------- /2673-maximize-win-from-two-segments/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2673-maximize-win-from-two-segments/README.md -------------------------------------------------------------------------------- /2677-cousins-in-binary-tree-ii/2677-cousins-in-binary-tree-ii.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2677-cousins-in-binary-tree-ii/2677-cousins-in-binary-tree-ii.java -------------------------------------------------------------------------------- /2677-cousins-in-binary-tree-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2677-cousins-in-binary-tree-ii/README.md -------------------------------------------------------------------------------- /2681-put-marbles-in-bags/2681-put-marbles-in-bags.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2681-put-marbles-in-bags/2681-put-marbles-in-bags.java -------------------------------------------------------------------------------- /2681-put-marbles-in-bags/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2681-put-marbles-in-bags/README.md -------------------------------------------------------------------------------- /2685-first-completely-painted-row-or-column/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2685-first-completely-painted-row-or-column/README.md -------------------------------------------------------------------------------- /2690-house-robber-iv/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2690-house-robber-iv/README.md -------------------------------------------------------------------------------- /2691-count-vowel-strings-in-ranges/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2691-count-vowel-strings-in-ranges/README.md -------------------------------------------------------------------------------- /2692-take-gifts-from-the-richest-pile/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2692-take-gifts-from-the-richest-pile/README.md -------------------------------------------------------------------------------- /2695-find-score-of-an-array-after-marking-all-elements/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2695-find-score-of-an-array-after-marking-all-elements/README.md -------------------------------------------------------------------------------- /2699-count-the-number-of-fair-pairs/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2699-count-the-number-of-fair-pairs/README.md -------------------------------------------------------------------------------- /2704-maximum-difference-by-remapping-a-digit/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2704-maximum-difference-by-remapping-a-digit/README.md -------------------------------------------------------------------------------- /2707-merge-two-2d-arrays-by-summing-values/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2707-merge-two-2d-arrays-by-summing-values/README.md -------------------------------------------------------------------------------- /2711-minimum-time-to-visit-a-cell-in-a-grid/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2711-minimum-time-to-visit-a-cell-in-a-grid/README.md -------------------------------------------------------------------------------- /2716-prime-subtraction-operation/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2716-prime-subtraction-operation/README.md -------------------------------------------------------------------------------- /2720-minimize-the-maximum-difference-of-pairs/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2720-minimize-the-maximum-difference-of-pairs/README.md -------------------------------------------------------------------------------- /2727-number-of-senior-citizens/2727-number-of-senior-citizens.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2727-number-of-senior-citizens/2727-number-of-senior-citizens.java -------------------------------------------------------------------------------- /2727-number-of-senior-citizens/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2727-number-of-senior-citizens/README.md -------------------------------------------------------------------------------- /2728-sum-in-a-matrix/2728-sum-in-a-matrix.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2728-sum-in-a-matrix/2728-sum-in-a-matrix.java -------------------------------------------------------------------------------- /2728-sum-in-a-matrix/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2728-sum-in-a-matrix/README.md -------------------------------------------------------------------------------- /2755-extra-characters-in-a-string/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2755-extra-characters-in-a-string/README.md -------------------------------------------------------------------------------- /2764-maximum-number-of-fish-in-a-grid/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2764-maximum-number-of-fish-in-a-grid/README.md -------------------------------------------------------------------------------- /2766-find-the-prefix-common-array-of-two-arrays/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2766-find-the-prefix-common-array-of-two-arrays/README.md -------------------------------------------------------------------------------- /2785-semi-ordered-permutation/2785-semi-ordered-permutation.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2785-semi-ordered-permutation/2785-semi-ordered-permutation.java -------------------------------------------------------------------------------- /2785-semi-ordered-permutation/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2785-semi-ordered-permutation/README.md -------------------------------------------------------------------------------- /2786-find-the-longest-semi-repetitive-substring/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2786-find-the-longest-semi-repetitive-substring/README.md -------------------------------------------------------------------------------- /2792-neighboring-bitwise-xor/2792-neighboring-bitwise-xor.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2792-neighboring-bitwise-xor/2792-neighboring-bitwise-xor.java -------------------------------------------------------------------------------- /2792-neighboring-bitwise-xor/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2792-neighboring-bitwise-xor/README.md -------------------------------------------------------------------------------- /2793-count-the-number-of-complete-components/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2793-count-the-number-of-complete-components/README.md -------------------------------------------------------------------------------- /2794-maximum-number-of-moves-in-a-grid/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2794-maximum-number-of-moves-in-a-grid/README.md -------------------------------------------------------------------------------- /2800-minimum-string-length-after-removing-substrings/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2800-minimum-string-length-after-removing-substrings/README.md -------------------------------------------------------------------------------- /2803-modify-graph-edge-weights/2803-modify-graph-edge-weights.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2803-modify-graph-edge-weights/2803-modify-graph-edge-weights.java -------------------------------------------------------------------------------- /2803-modify-graph-edge-weights/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2803-modify-graph-edge-weights/README.md -------------------------------------------------------------------------------- /2811-determine-the-minimum-sum-of-a-k-avoiding-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2811-determine-the-minimum-sum-of-a-k-avoiding-array/README.md -------------------------------------------------------------------------------- /2812-find-the-maximum-achievable-number/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2812-find-the-maximum-achievable-number/README.md -------------------------------------------------------------------------------- /2825-minimize-string-length/2825-minimize-string-length.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2825-minimize-string-length/2825-minimize-string-length.java -------------------------------------------------------------------------------- /2825-minimize-string-length/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2825-minimize-string-length/README.md -------------------------------------------------------------------------------- /2831-number-of-beautiful-pairs/2831-number-of-beautiful-pairs.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2831-number-of-beautiful-pairs/2831-number-of-beautiful-pairs.java -------------------------------------------------------------------------------- /2831-number-of-beautiful-pairs/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2831-number-of-beautiful-pairs/README.md -------------------------------------------------------------------------------- /2832-find-the-longest-equal-subarray/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2832-find-the-longest-equal-subarray/README.md -------------------------------------------------------------------------------- /2836-neither-minimum-nor-maximum/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2836-neither-minimum-nor-maximum/README.md -------------------------------------------------------------------------------- /2838-sum-of-matrix-after-queries/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2838-sum-of-matrix-after-queries/README.md -------------------------------------------------------------------------------- /2845-find-the-value-of-the-partition/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2845-find-the-value-of-the-partition/README.md -------------------------------------------------------------------------------- /2846-robot-collisions/2846-robot-collisions.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2846-robot-collisions/2846-robot-collisions.java -------------------------------------------------------------------------------- /2846-robot-collisions/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2846-robot-collisions/README.md -------------------------------------------------------------------------------- /2847-find-maximum-number-of-string-pairs/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2847-find-maximum-number-of-string-pairs/README.md -------------------------------------------------------------------------------- /2850-construct-the-longest-new-string/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2850-construct-the-longest-new-string/README.md -------------------------------------------------------------------------------- /2856-count-complete-subarrays-in-an-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2856-count-complete-subarrays-in-an-array/README.md -------------------------------------------------------------------------------- /2857-total-distance-traveled/2857-total-distance-traveled.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2857-total-distance-traveled/2857-total-distance-traveled.java -------------------------------------------------------------------------------- /2857-total-distance-traveled/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2857-total-distance-traveled/README.md -------------------------------------------------------------------------------- /2867-ways-to-split-array-into-good-subarrays/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2867-ways-to-split-array-into-good-subarrays/README.md -------------------------------------------------------------------------------- /2868-continuous-subarrays/2868-continuous-subarrays.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2868-continuous-subarrays/2868-continuous-subarrays.java -------------------------------------------------------------------------------- /2868-continuous-subarrays/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2868-continuous-subarrays/README.md -------------------------------------------------------------------------------- /2871-double-a-number-represented-as-a-linked-list/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2871-double-a-number-represented-as-a-linked-list/README.md -------------------------------------------------------------------------------- /2872-largest-element-in-an-array-after-merge-operations/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2872-largest-element-in-an-array-after-merge-operations/README.md -------------------------------------------------------------------------------- /2876-number-of-employees-who-met-the-target/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2876-number-of-employees-who-met-the-target/README.md -------------------------------------------------------------------------------- /2877-shortest-string-that-contains-three-strings/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2877-shortest-string-that-contains-three-strings/README.md -------------------------------------------------------------------------------- /2881-split-strings-by-separator/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2881-split-strings-by-separator/README.md -------------------------------------------------------------------------------- /2886-faulty-keyboard/2886-faulty-keyboard.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2886-faulty-keyboard/2886-faulty-keyboard.java -------------------------------------------------------------------------------- /2886-faulty-keyboard/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2886-faulty-keyboard/README.md -------------------------------------------------------------------------------- /2888-minimum-index-of-a-valid-split/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2888-minimum-index-of-a-valid-split/README.md -------------------------------------------------------------------------------- /2891-maximum-beauty-of-an-array-after-applying-operation/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2891-maximum-beauty-of-an-array-after-applying-operation/README.md -------------------------------------------------------------------------------- /2902-max-pair-sum-in-an-array/2902-max-pair-sum-in-an-array.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2902-max-pair-sum-in-an-array/2902-max-pair-sum-in-an-array.java -------------------------------------------------------------------------------- /2902-max-pair-sum-in-an-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2902-max-pair-sum-in-an-array/README.md -------------------------------------------------------------------------------- /2903-insert-greatest-common-divisors-in-linked-list/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2903-insert-greatest-common-divisors-in-linked-list/README.md -------------------------------------------------------------------------------- /2904-sorting-three-groups/2904-sorting-three-groups.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2904-sorting-three-groups/2904-sorting-three-groups.java -------------------------------------------------------------------------------- /2904-sorting-three-groups/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2904-sorting-three-groups/README.md -------------------------------------------------------------------------------- /2915-count-of-interesting-subarrays/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2915-count-of-interesting-subarrays/README.md -------------------------------------------------------------------------------- /2916-check-if-it-is-possible-to-split-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2916-check-if-it-is-possible-to-split-array/README.md -------------------------------------------------------------------------------- /2917-count-pairs-whose-sum-is-less-than-target/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2917-count-pairs-whose-sum-is-less-than-target/README.md -------------------------------------------------------------------------------- /2920-minimum-seconds-to-equalize-a-circular-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2920-minimum-seconds-to-equalize-a-circular-array/README.md -------------------------------------------------------------------------------- /2955-account-balance-after-rounded-purchase/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2955-account-balance-after-rounded-purchase/README.md -------------------------------------------------------------------------------- /2998-count-symmetric-integers/2998-count-symmetric-integers.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2998-count-symmetric-integers/2998-count-symmetric-integers.java -------------------------------------------------------------------------------- /2998-count-symmetric-integers/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/2998-count-symmetric-integers/README.md -------------------------------------------------------------------------------- /3-longest-substring-without-repeating-characters/NOTES.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3-longest-substring-without-repeating-characters/NOTES.md -------------------------------------------------------------------------------- /3-longest-substring-without-repeating-characters/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3-longest-substring-without-repeating-characters/README.md -------------------------------------------------------------------------------- /3001-apply-operations-to-maximize-score/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3001-apply-operations-to-maximize-score/README.md -------------------------------------------------------------------------------- /3018-make-string-a-subsequence-using-cyclic-increments/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3018-make-string-a-subsequence-using-cyclic-increments/README.md -------------------------------------------------------------------------------- /3019-furthest-point-from-origin/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3019-furthest-point-from-origin/README.md -------------------------------------------------------------------------------- /3026-find-the-minimum-possible-sum-of-a-beautiful-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3026-find-the-minimum-possible-sum-of-a-beautiful-array/README.md -------------------------------------------------------------------------------- /3046-minimum-operations-to-make-a-special-number/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3046-minimum-operations-to-make-a-special-number/README.md -------------------------------------------------------------------------------- /3142-longest-unequal-adjacent-groups-subsequence-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3142-longest-unequal-adjacent-groups-subsequence-ii/README.md -------------------------------------------------------------------------------- /3143-longest-unequal-adjacent-groups-subsequence-i/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3143-longest-unequal-adjacent-groups-subsequence-i/README.md -------------------------------------------------------------------------------- /3152-maximum-value-of-an-ordered-triplet-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3152-maximum-value-of-an-ordered-triplet-ii/README.md -------------------------------------------------------------------------------- /3154-maximum-value-of-an-ordered-triplet-i/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3154-maximum-value-of-an-ordered-triplet-i/README.md -------------------------------------------------------------------------------- /3172-divisible-and-non-divisible-sums-difference/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3172-divisible-and-non-divisible-sums-difference/README.md -------------------------------------------------------------------------------- /3181-find-building-where-alice-and-bob-can-meet/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3181-find-building-where-alice-and-bob-can-meet/README.md -------------------------------------------------------------------------------- /3189-find-champion-ii/3189-find-champion-ii.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3189-find-champion-ii/3189-find-champion-ii.java -------------------------------------------------------------------------------- /3189-find-champion-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3189-find-champion-ii/README.md -------------------------------------------------------------------------------- /3194-find-words-containing-character/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3194-find-words-containing-character/README.md -------------------------------------------------------------------------------- /3195-separate-black-and-white-balls/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3195-separate-black-and-white-balls/README.md -------------------------------------------------------------------------------- /3227-find-missing-and-repeated-values/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3227-find-missing-and-repeated-values/README.md -------------------------------------------------------------------------------- /3235-minimum-cost-to-convert-string-i/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3235-minimum-cost-to-convert-string-i/README.md -------------------------------------------------------------------------------- /3243-count-the-number-of-powerful-integers/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3243-count-the-number-of-powerful-integers/README.md -------------------------------------------------------------------------------- /3267-find-longest-special-substring-that-occurs-thrice-i/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3267-find-longest-special-substring-that-occurs-thrice-i/README.md -------------------------------------------------------------------------------- /3276-minimum-number-of-pushes-to-type-word-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3276-minimum-number-of-pushes-to-type-word-ii/README.md -------------------------------------------------------------------------------- /3291-find-if-array-can-be-sorted/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3291-find-if-array-can-be-sorted/README.md -------------------------------------------------------------------------------- /3307-find-the-maximum-sum-of-node-values/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3307-find-the-maximum-sum-of-node-values/README.md -------------------------------------------------------------------------------- /3309-count-prefix-and-suffix-pairs-i/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3309-count-prefix-and-suffix-pairs-i/README.md -------------------------------------------------------------------------------- /3321-type-of-triangle/3321-type-of-triangle.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3321-type-of-triangle/3321-type-of-triangle.java -------------------------------------------------------------------------------- /3321-type-of-triangle/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3321-type-of-triangle/README.md -------------------------------------------------------------------------------- /3329-find-the-length-of-the-longest-common-prefix/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3329-find-the-length-of-the-longest-common-prefix/README.md -------------------------------------------------------------------------------- /3332-minimum-operations-to-exceed-threshold-value-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3332-minimum-operations-to-exceed-threshold-value-ii/README.md -------------------------------------------------------------------------------- /3348-minimum-cost-walk-in-weighted-graph/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3348-minimum-cost-walk-in-weighted-graph/README.md -------------------------------------------------------------------------------- /3379-score-of-a-string/3379-score-of-a-string.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3379-score-of-a-string/3379-score-of-a-string.java -------------------------------------------------------------------------------- /3379-score-of-a-string/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3379-score-of-a-string/README.md -------------------------------------------------------------------------------- /3380-shortest-subarray-with-or-at-least-k-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3380-shortest-subarray-with-or-at-least-k-ii/README.md -------------------------------------------------------------------------------- /3394-minimum-array-end/3394-minimum-array-end.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3394-minimum-array-end/3394-minimum-array-end.java -------------------------------------------------------------------------------- /3394-minimum-array-end/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3394-minimum-array-end/README.md -------------------------------------------------------------------------------- /3427-special-array-ii/3427-special-array-ii.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3427-special-array-ii/3427-special-array-ii.java -------------------------------------------------------------------------------- /3427-special-array-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3427-special-array-ii/README.md -------------------------------------------------------------------------------- /3429-special-array-i/3429-special-array-i.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3429-special-array-i/3429-special-array-i.java -------------------------------------------------------------------------------- /3429-special-array-i/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3429-special-array-i/README.md -------------------------------------------------------------------------------- /3430-count-days-without-meetings/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3430-count-days-without-meetings/README.md -------------------------------------------------------------------------------- /3434-find-the-number-of-distinct-colors-among-the-balls/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3434-find-the-number-of-distinct-colors-among-the-balls/README.md -------------------------------------------------------------------------------- /3439-find-minimum-diameter-after-merging-two-trees/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3439-find-minimum-diameter-after-merging-two-trees/README.md -------------------------------------------------------------------------------- /3447-clear-digits/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3447-clear-digits/README.md -------------------------------------------------------------------------------- /3451-string-compression-iii/3451-string-compression-iii.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3451-string-compression-iii/3451-string-compression-iii.java -------------------------------------------------------------------------------- /3451-string-compression-iii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3451-string-compression-iii/README.md -------------------------------------------------------------------------------- /3455-minimum-length-of-string-after-operations/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3455-minimum-length-of-string-after-operations/README.md -------------------------------------------------------------------------------- /3483-alternating-groups-ii/3483-alternating-groups-ii.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3483-alternating-groups-ii/3483-alternating-groups-ii.java -------------------------------------------------------------------------------- /3483-alternating-groups-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3483-alternating-groups-ii/README.md -------------------------------------------------------------------------------- /3501-delete-nodes-from-linked-list-present-in-array/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3501-delete-nodes-from-linked-list-present-in-array/README.md -------------------------------------------------------------------------------- /3517-shortest-distance-after-road-addition-queries-i/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3517-shortest-distance-after-road-addition-queries-i/README.md -------------------------------------------------------------------------------- /3522-find-the-power-of-k-size-subarrays-i/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3522-find-the-power-of-k-size-subarrays-i/README.md -------------------------------------------------------------------------------- /3548-find-the-count-of-good-integers/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3548-find-the-count-of-good-integers/README.md -------------------------------------------------------------------------------- /3621-minimum-operations-to-make-array-values-equal-to-k/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3621-minimum-operations-to-make-array-values-equal-to-k/README.md -------------------------------------------------------------------------------- /3627-find-minimum-time-to-reach-last-room-i/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3627-find-minimum-time-to-reach-last-room-i/README.md -------------------------------------------------------------------------------- /3628-find-minimum-time-to-reach-last-room-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3628-find-minimum-time-to-reach-last-room-ii/README.md -------------------------------------------------------------------------------- /3629-total-characters-in-string-after-transformations-i/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3629-total-characters-in-string-after-transformations-i/README.md -------------------------------------------------------------------------------- /3630-total-characters-in-string-after-transformations-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3630-total-characters-in-string-after-transformations-ii/README.md -------------------------------------------------------------------------------- /3637-count-number-of-balanced-permutations/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3637-count-number-of-balanced-permutations/README.md -------------------------------------------------------------------------------- /3639-zero-array-transformation-i/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3639-zero-array-transformation-i/README.md -------------------------------------------------------------------------------- /3647-zero-array-transformation-iii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3647-zero-array-transformation-iii/README.md -------------------------------------------------------------------------------- /3657-check-if-grid-can-be-cut-into-sections/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3657-check-if-grid-can-be-cut-into-sections/README.md -------------------------------------------------------------------------------- /3685-count-subarrays-of-length-three-with-a-condition/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3685-count-subarrays-of-length-three-with-a-condition/README.md -------------------------------------------------------------------------------- /3753-maximum-difference-between-even-and-odd-frequency-i/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3753-maximum-difference-between-even-and-odd-frequency-i/README.md -------------------------------------------------------------------------------- /3761-maximum-difference-between-even-and-odd-frequency-ii/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/3761-maximum-difference-between-even-and-odd-frequency-ii/README.md -------------------------------------------------------------------------------- /4-median-of-two-sorted-arrays/4-median-of-two-sorted-arrays.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/4-median-of-two-sorted-arrays/4-median-of-two-sorted-arrays.java -------------------------------------------------------------------------------- /4-median-of-two-sorted-arrays/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /4-median-of-two-sorted-arrays/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/4-median-of-two-sorted-arrays/README.md -------------------------------------------------------------------------------- /9-palindrome-number/9-palindrome-number.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/9-palindrome-number/9-palindrome-number.java -------------------------------------------------------------------------------- /9-palindrome-number/NOTES.md: -------------------------------------------------------------------------------- 1 | ​ -------------------------------------------------------------------------------- /Bottom View of Binary Tree - GFG/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/Bottom View of Binary Tree - GFG/README.md -------------------------------------------------------------------------------- /Bottom View of Binary Tree - GFG/bottom-view-of-binary-tree.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/Bottom View of Binary Tree - GFG/bottom-view-of-binary-tree.java -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/LICENSE -------------------------------------------------------------------------------- /Largest subarray with 0 sum - GFG/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/Largest subarray with 0 sum - GFG/README.md -------------------------------------------------------------------------------- /Largest subarray with 0 sum - GFG/largest-subarray-with-0-sum.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/Largest subarray with 0 sum - GFG/largest-subarray-with-0-sum.java -------------------------------------------------------------------------------- /Left View of Binary Tree - GFG/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/Left View of Binary Tree - GFG/README.md -------------------------------------------------------------------------------- /Left View of Binary Tree - GFG/left-view-of-binary-tree.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/Left View of Binary Tree - GFG/left-view-of-binary-tree.java -------------------------------------------------------------------------------- /Minimum Platforms - GFG/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/Minimum Platforms - GFG/README.md -------------------------------------------------------------------------------- /Minimum Platforms - GFG/minimum-platforms.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/Minimum Platforms - GFG/minimum-platforms.java -------------------------------------------------------------------------------- /Power Set - GFG/README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/Power Set - GFG/README.md -------------------------------------------------------------------------------- /Power Set - GFG/power-set.java: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/Power Set - GFG/power-set.java -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/README.md -------------------------------------------------------------------------------- /stats.json: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/sagnikghoshcr7/LeetCode-Practice_Solutions/HEAD/stats.json --------------------------------------------------------------------------------