Repository navigation

LeetCodePro

Public

About

Test repository for codespace creation

0 stars

0 watching

Report repository

Name		Name	Last commit message	Last commit date
1.two-sum.py		1.two-sum.py
1206.design-skiplist.cpp		1206.design-skiplist.cpp
1206.design-skiplist.java		1206.design-skiplist.java
1206.design-skiplist.py		1206.design-skiplist.py
1367.linked-list-in-binary-tree.cpp		1367.linked-list-in-binary-tree.cpp
1367.linked-list-in-binary-tree.java		1367.linked-list-in-binary-tree.java
1367.linked-list-in-binary-tree.py		1367.linked-list-in-binary-tree.py
1670.design-front-middle-back-queue.cpp		1670.design-front-middle-back-queue.cpp
1670.design-front-middle-back-queue.py		1670.design-front-middle-back-queue.py
2.add-two-numbers.py		2.add-two-numbers.py
2058.find-the-minimum-and-maximum-number-of-nodes-between-critical-points.cpp		2058.find-the-minimum-and-maximum-number-of-nodes-between-critical-points.cpp
2058.find-the-minimum-and-maximum-number-of-nodes-between-critical-points.py		2058.find-the-minimum-and-maximum-number-of-nodes-between-critical-points.py
2074.reverse-nodes-in-even-length-groups.cpp		2074.reverse-nodes-in-even-length-groups.cpp
2074.reverse-nodes-in-even-length-groups.py		2074.reverse-nodes-in-even-length-groups.py
2289.steps-to-make-array-non-decreasing.cpp		2289.steps-to-make-array-non-decreasing.cpp
2289.steps-to-make-array-non-decreasing.py		2289.steps-to-make-array-non-decreasing.py
2296.design-a-text-editor.cpp		2296.design-a-text-editor.cpp
2296.design-a-text-editor.py		2296.design-a-text-editor.py
2807.insert-greatest-common-divisors-in-linked-list.cpp		2807.insert-greatest-common-divisors-in-linked-list.cpp
2807.insert-greatest-common-divisors-in-linked-list.py		2807.insert-greatest-common-divisors-in-linked-list.py
2816.double-a-number-represented-as-a-linked-list.cpp		2816.double-a-number-represented-as-a-linked-list.cpp
2816.double-a-number-represented-as-a-linked-list.py		2816.double-a-number-represented-as-a-linked-list.py
3217.delete-nodes-from-linked-list-present-in-array.cpp		3217.delete-nodes-from-linked-list-present-in-array.cpp
3217.delete-nodes-from-linked-list-present-in-array.py		3217.delete-nodes-from-linked-list-present-in-array.py
3310.remove-methods-from-project.cpp		3310.remove-methods-from-project.cpp
3310.remove-methods-from-project.py		3310.remove-methods-from-project.py
3327.check-if-dfs-strings-are-palindromes.cpp		3327.check-if-dfs-strings-are-palindromes.cpp
3327.check-if-dfs-strings-are-palindromes.py		3327.check-if-dfs-strings-are-palindromes.py
3331.find-subtree-sizes-after-changes.cpp		3331.find-subtree-sizes-after-changes.cpp
3331.find-subtree-sizes-after-changes.py		3331.find-subtree-sizes-after-changes.py
3341.find-minimum-time-to-reach-last-room-i.cpp		3341.find-minimum-time-to-reach-last-room-i.cpp
3341.find-minimum-time-to-reach-last-room-i.py		3341.find-minimum-time-to-reach-last-room-i.py
3367.maximize-sum-of-weights-after-edge-removals.cpp		3367.maximize-sum-of-weights-after-edge-removals.cpp
3367.maximize-sum-of-weights-after-edge-removals.py		3367.maximize-sum-of-weights-after-edge-removals.py
3373.maximize-the-number-of-target-nodes-after-connecting-trees-ii.cpp		3373.maximize-the-number-of-target-nodes-after-connecting-trees-ii.cpp
3373.maximize-the-number-of-target-nodes-after-connecting-trees-ii.py		3373.maximize-the-number-of-target-nodes-after-connecting-trees-ii.py
3382.maximum-area-rectangle-with-point-constraints-ii.cpp		3382.maximum-area-rectangle-with-point-constraints-ii.cpp
3382.maximum-area-rectangle-with-point-constraints-ii.py		3382.maximum-area-rectangle-with-point-constraints-ii.py
3387.maximize-amount-after-two-days-of-conversions.cpp		3387.maximize-amount-after-two-days-of-conversions.cpp
3387.maximize-amount-after-two-days-of-conversions.py		3387.maximize-amount-after-two-days-of-conversions.py
3398.smallest-substring-with-identical-characters-i.cpp		3398.smallest-substring-with-identical-characters-i.cpp
3398.smallest-substring-with-identical-characters-i.py		3398.smallest-substring-with-identical-characters-i.py
3399.smallest-substring-with-identical-characters-ii.cpp		3399.smallest-substring-with-identical-characters-ii.cpp
3399.smallest-substring-with-identical-characters-ii.py		3399.smallest-substring-with-identical-characters-ii.py
3413.maximum-coins-from-k-consecutive-bags.cpp		3413.maximum-coins-from-k-consecutive-bags.cpp
3413.maximum-coins-from-k-consecutive-bags.py		3413.maximum-coins-from-k-consecutive-bags.py
3414.maximum-score-of-non-overlapping-intervals.cpp		3414.maximum-score-of-non-overlapping-intervals.cpp
3414.maximum-score-of-non-overlapping-intervals.py		3414.maximum-score-of-non-overlapping-intervals.py
3419.minimize-the-maximum-edge-weight-of-graph.cpp		3419.minimize-the-maximum-edge-weight-of-graph.cpp
3419.minimize-the-maximum-edge-weight-of-graph.py		3419.minimize-the-maximum-edge-weight-of-graph.py
3420.count-non-decreasing-subarrays-after-k-operations.cpp		3420.count-non-decreasing-subarrays-after-k-operations.cpp
3420.count-non-decreasing-subarrays-after-k-operations.py		3420.count-non-decreasing-subarrays-after-k-operations.py
3425.longest-special-path.cpp		3425.longest-special-path.cpp
3425.longest-special-path.py		3425.longest-special-path.py
3434.maximum-frequency-after-subarray-operation.cpp		3434.maximum-frequency-after-subarray-operation.cpp
3434.maximum-frequency-after-subarray-operation.py		3434.maximum-frequency-after-subarray-operation.py
3435.frequencies-of-shortest-supersequences.cpp		3435.frequencies-of-shortest-supersequences.cpp
3435.frequencies-of-shortest-supersequences.py		3435.frequencies-of-shortest-supersequences.py
3441.minimum-cost-good-caption.cpp		3441.minimum-cost-good-caption.cpp
3441.minimum-cost-good-caption.py		3441.minimum-cost-good-caption.py
3445.maximum-difference-between-even-and-odd-frequency-ii.cpp		3445.maximum-difference-between-even-and-odd-frequency-ii.cpp
3445.maximum-difference-between-even-and-odd-frequency-ii.py		3445.maximum-difference-between-even-and-odd-frequency-ii.py
3448.count-substrings-divisible-by-last-digit.cpp		3448.count-substrings-divisible-by-last-digit.cpp
3448.count-substrings-divisible-by-last-digit.py		3448.count-substrings-divisible-by-last-digit.py
3449.maximize-the-minimum-game-score.cpp		3449.maximize-the-minimum-game-score.cpp
3449.maximize-the-minimum-game-score.py		3449.maximize-the-minimum-game-score.py
3455.shortest-matching-substring.cpp		3455.shortest-matching-substring.cpp
3455.shortest-matching-substring.py		3455.shortest-matching-substring.py
3457.eat-pizzas.cpp		3457.eat-pizzas.cpp
3457.eat-pizzas.py		3457.eat-pizzas.py
3458.select-k-disjoint-special-substrings.cpp		3458.select-k-disjoint-special-substrings.cpp
3458.select-k-disjoint-special-substrings.py		3458.select-k-disjoint-special-substrings.py
3459.length-of-longest-v-shaped-diagonal-segment.cpp		3459.length-of-longest-v-shaped-diagonal-segment.cpp
3459.length-of-longest-v-shaped-diagonal-segment.py		3459.length-of-longest-v-shaped-diagonal-segment.py
3462.maximum-sum-with-at-most-k-elements.cpp		3462.maximum-sum-with-at-most-k-elements.cpp
3462.maximum-sum-with-at-most-k-elements.py		3462.maximum-sum-with-at-most-k-elements.py
3464.maximize-the-distance-between-points-on-a-square.cpp		3464.maximize-the-distance-between-points-on-a-square.cpp
3464.maximize-the-distance-between-points-on-a-square.py		3464.maximize-the-distance-between-points-on-a-square.py
3470.permutations-iv.cpp		3470.permutations-iv.cpp
3470.permutations-iv.py		3470.permutations-iv.py
3474.lexicographically-smallest-generated-string.cpp		3474.lexicographically-smallest-generated-string.cpp
3474.lexicographically-smallest-generated-string.py		3474.lexicographically-smallest-generated-string.py
3486.longest-special-path-ii.cpp		3486.longest-special-path-ii.cpp
3486.longest-special-path-ii.py		3486.longest-special-path-ii.py
3488.closest-equal-element-queries.cpp		3488.closest-equal-element-queries.cpp
3488.closest-equal-element-queries.py		3488.closest-equal-element-queries.py
3493.properties-graph.cpp		3493.properties-graph.cpp
3493.properties-graph.py		3493.properties-graph.py
3501.maximize-active-section-with-trade-ii.cpp		3501.maximize-active-section-with-trade-ii.cpp
3501.maximize-active-section-with-trade-ii.py		3501.maximize-active-section-with-trade-ii.py
3503.longest-palindrome-after-substring-concatenation-i.cpp		3503.longest-palindrome-after-substring-concatenation-i.cpp
3503.longest-palindrome-after-substring-concatenation-i.py		3503.longest-palindrome-after-substring-concatenation-i.py
3504.longest-palindrome-after-substring-concatenation-ii.cpp		3504.longest-palindrome-after-substring-concatenation-ii.cpp
3504.longest-palindrome-after-substring-concatenation-ii.py		3504.longest-palindrome-after-substring-concatenation-ii.py
3509.maximum-product-of-subsequences-with-an-alternating-sum-equal-to-k.cpp		3509.maximum-product-of-subsequences-with-an-alternating-sum-equal-to-k.cpp
3509.maximum-product-of-subsequences-with-an-alternating-sum-equal-to-k.py		3509.maximum-product-of-subsequences-with-an-alternating-sum-equal-to-k.py
3510.minimum-pair-removal-to-sort-array-ii.cpp		3510.minimum-pair-removal-to-sort-array-ii.cpp
3510.minimum-pair-removal-to-sort-array-ii.py		3510.minimum-pair-removal-to-sort-array-ii.py
3513.number-of-unique-xor-triplets-i.cpp		3513.number-of-unique-xor-triplets-i.cpp
3513.number-of-unique-xor-triplets-i.py		3513.number-of-unique-xor-triplets-i.py

Repository files navigation

LeetCodePro

Test repository for codespace creation

About

Test repository for codespace creation

0 stars

0 watching

Report repository

Releases

Packages

Contributors

Languages