LeetCode

Practice programming languages by solving LeetCode problems.

filename starts with numbers, url will be https://leetcode.com/problems/<the rest of the filename>/
filename starts with offer-, url will be https://leetcode.cn/problems/<the rest of the filename>/

Thanks to JetBrains.

Navigation Menu

Repository files navigation

LeetCode

About

Releases

Packages

Used by

Contributors

Languages

Name		Name	Last commit message	Last commit date
.gitignore		.gitignore
1-two-sum.go		1-two-sum.go
10-regular-expression-matching.go		10-regular-expression-matching.go
100-same-tree.go		100-same-tree.go
1000-minimum-cost-to-merge-stones.go		1000-minimum-cost-to-merge-stones.go
1001-grid-illumination.go		1001-grid-illumination.go
1005-maximize-sum-of-array-after-k-negations.go		1005-maximize-sum-of-array-after-k-negations.go
101-symmetric-tree.go		101-symmetric-tree.go
1012-numbers-with-repeated-digits.go		1012-numbers-with-repeated-digits.go
1017-convert-to-base-2.go		1017-convert-to-base-2.go
1018-binary-prefix-divisible-by-5.go		1018-binary-prefix-divisible-by-5.go
1019-next-greater-node-in-linked-list.go		1019-next-greater-node-in-linked-list.go
102-binary-tree-level-order-traversal.go		102-binary-tree-level-order-traversal.go
1020-number-of-enclaves.go		1020-number-of-enclaves.go
1021-remove-outermost-parentheses.go		1021-remove-outermost-parentheses.go
1022-sum-of-root-to-leaf-binary-numbers.go		1022-sum-of-root-to-leaf-binary-numbers.go
1023-camelcase-matching.go		1023-camelcase-matching.go
1026-maximum-difference-between-node-and-ancestor.go		1026-maximum-difference-between-node-and-ancestor.go
1027-longest-arithmetic-subsequence.go		1027-longest-arithmetic-subsequence.go
103-binary-tree-zigzag-level-order-traversal.go		103-binary-tree-zigzag-level-order-traversal.go
1031-maximum-sum-of-two-non-overlapping-subarrays.go		1031-maximum-sum-of-two-non-overlapping-subarrays.go
1032-stream-of-characters.go		1032-stream-of-characters.go
1033-moving-stones-until-consecutive.go		1033-moving-stones-until-consecutive.go
1034-coloring-a-border.go		1034-coloring-a-border.go
1036-escape-a-large-maze.go		1036-escape-a-large-maze.go
1037-valid-boomerang.go		1037-valid-boomerang.go
1039-minimum-score-triangulation-of-polygon.go		1039-minimum-score-triangulation-of-polygon.go
104-maximum-depth-of-binary-tree.go		104-maximum-depth-of-binary-tree.go
1040-moving-stones-until-consecutive-ii.go		1040-moving-stones-until-consecutive-ii.go
1041-robot-bounded-in-circle.go		1041-robot-bounded-in-circle.go
1042-flower-planting-with-no-adjacent.go		1042-flower-planting-with-no-adjacent.go
1043-partition-array-for-maximum-sum.go		1043-partition-array-for-maximum-sum.go
1044-longest-duplicate-substring.go		1044-longest-duplicate-substring.go
1048-longest-string-chain.go		1048-longest-string-chain.go
105-construct-binary-tree-from-preorder-and-inorder-traversal.go		105-construct-binary-tree-from-preorder-and-inorder-traversal.go
1051-height-checker.go		1051-height-checker.go
1053-previous-permutation-with-one-swap.go		1053-previous-permutation-with-one-swap.go
1054-distant-barcodes.go		1054-distant-barcodes.go
106-construct-binary-tree-from-inorder-and-postorder-traversal.go		106-construct-binary-tree-from-inorder-and-postorder-traversal.go
107-binary-tree-level-order-traversal-ii.go		107-binary-tree-level-order-traversal-ii.go
1078-occurrences-after-bigram.go		1078-occurrences-after-bigram.go
108-convert-sorted-array-to-binary-search-tree.go		108-convert-sorted-array-to-binary-search-tree.go
1081-smallest-subsequence-of-distinct-characters.go		1081-smallest-subsequence-of-distinct-characters.go
109-convert-sorted-list-to-binary-search-tree.go		109-convert-sorted-list-to-binary-search-tree.go
1092-shortest-common-supersequence.go		1092-shortest-common-supersequence.go
1094-car-pooling.go		1094-car-pooling.go
1096-brace-expansion-ii.go		1096-brace-expansion-ii.go
11-container-with-most-water.go		11-container-with-most-water.go
110-balanced-binary-tree.go		110-balanced-binary-tree.go
1103-distribute-candies-to-people.go		1103-distribute-candies-to-people.go
1105-filling-bookcase-shelves.go		1105-filling-bookcase-shelves.go
1106-parsing-a-boolean-expression.go		1106-parsing-a-boolean-expression.go
111-minimum-depth-of-binary-tree.go		111-minimum-depth-of-binary-tree.go
112-path-sum.go		112-path-sum.go
1124-longest-well-performing-interval.go		1124-longest-well-performing-interval.go
1125-smallest-sufficient-team.go		1125-smallest-sufficient-team.go
1129-shortest-path-with-alternating-colors.go		1129-shortest-path-with-alternating-colors.go
113-path-sum-ii.go		113-path-sum-ii.go
1138-alphabet-board-path.go		1138-alphabet-board-path.go
1139-largest-1-bordered-square.go		1139-largest-1-bordered-square.go
114-flatten-binary-tree-to-linked-list.go		114-flatten-binary-tree-to-linked-list.go
1140-stone-game-ii.go		1140-stone-game-ii.go
1144-decrease-elements-to-make-array-zigzag.go		1144-decrease-elements-to-make-array-zigzag.go
1145-binary-tree-coloring-game.go		1145-binary-tree-coloring-game.go
1147-longest-chunked-palindrome-decomposition.go		1147-longest-chunked-palindrome-decomposition.go
115-distinct-subsequences.go		115-distinct-subsequences.go
1154-day-of-the-year.go		1154-day-of-the-year.go
1157-online-majority-element-in-subarray.go		1157-online-majority-element-in-subarray.go
116-populating-next-right-pointers-in-each-node.go		116-populating-next-right-pointers-in-each-node.go
1163-last-substring-in-lexicographical-order.go		1163-last-substring-in-lexicographical-order.go
1169-invalid-transactions.go		1169-invalid-transactions.go
117-populating-next-right-pointers-in-each-node-ii.go		117-populating-next-right-pointers-in-each-node-ii.go
1172-dinner-plate-stacks.go		1172-dinner-plate-stacks.go
118-pascals-triangle.go		118-pascals-triangle.go
1185-day-of-the-week.go		1185-day-of-the-week.go
1186-maximum-subarray-sum-with-one-deletion.go		1186-maximum-subarray-sum-with-one-deletion.go
1187-make-array-strictly-increasing.go		1187-make-array-strictly-increasing.go
1189-maximum-number-of-balloons.go		1189-maximum-number-of-balloons.go
119-pascals-triangle-ii.go		119-pascals-triangle-ii.go
1192-critical-connections-in-a-network.go		1192-critical-connections-in-a-network.go
12-integer-to-roman.go		12-integer-to-roman.go
120-triangle.go		120-triangle.go
121-best-time-to-buy-and-sell-stock.go		121-best-time-to-buy-and-sell-stock.go
1210-minimum-moves-to-reach-target-with-rotations.go		1210-minimum-moves-to-reach-target-with-rotations.go
1219-path-with-maximum-gold.go		1219-path-with-maximum-gold.go
122-best-time-to-buy-and-sell-stock-ii.go		122-best-time-to-buy-and-sell-stock-ii.go
1220-count-vowels-permutation.go		1220-count-vowels-permutation.go
1223-dice-roll-simulation.go		1223-dice-roll-simulation.go
1224-maximum-equal-frequency.go		1224-maximum-equal-frequency.go
123-best-time-to-buy-and-sell-stock-iii.go		123-best-time-to-buy-and-sell-stock-iii.go
1233-remove-sub-folders-from-the-filesystem.go		1233-remove-sub-folders-from-the-filesystem.go
1234-replace-the-substring-for-balanced-string.go		1234-replace-the-substring-for-balanced-string.go
1235-maximum-profit-in-job-scheduling.go		1235-maximum-profit-in-job-scheduling.go
1237-find-positive-integer-solution-for-a-given-equation.go		1237-find-positive-integer-solution-for-a-given-equation.go
1238-circular-permutation-in-binary-representation.go		1238-circular-permutation-in-binary-representation.go
124-binary-tree-maximum-path-sum.go		124-binary-tree-maximum-path-sum.go
1247-minimum-swaps-to-make-strings-equal.go		1247-minimum-swaps-to-make-strings-equal.go
125-valid-palindrome.go		125-valid-palindrome.go
1254-number-of-closed-islands.go		1254-number-of-closed-islands.go
1255-maximum-score-words-formed-by-letters.go		1255-maximum-score-words-formed-by-letters.go

Latest commit

History

Folders and files

Repository files navigation

LeetCode

About

Resources

Stars

Watchers

Forks

Releases

Packages

Used by

Contributors

Languages