Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/ksw2000/leetcode-practice
Practice for leetcode.com
https://github.com/ksw2000/leetcode-practice
leetcode
Last synced: about 1 month ago
JSON representation
Practice for leetcode.com
- Host: GitHub
- URL: https://github.com/ksw2000/leetcode-practice
- Owner: ksw2000
- Created: 2019-11-16T15:49:13.000Z (about 5 years ago)
- Default Branch: master
- Last Pushed: 2023-10-09T20:10:07.000Z (about 1 year ago)
- Last Synced: 2024-06-22T17:06:21.531Z (6 months ago)
- Topics: leetcode
- Language: Go
- Homepage:
- Size: 212 KB
- Stars: 2
- Watchers: 0
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# LeetCode Practice
https://leetcode.com/
| # | Question | |
| :--: | :----------------------------------------------------------- | ------------------------------------------------------------ |
| 001 | [two-sum](https://leetcode.com/problems/two-sum) | [Go](./two-sum/two-sum.go), [C](./two-sum/two-sum.c), [JS](./two-sum/two-sum.js), [PHP](./two-sum/two-sum.php), [Rust](./two-sum/two-sum.rs), [Java](./two-sum/TwoSum.java) |
| 002 | [add-two-numbers](https://leetcode.com/problems/add-two-numbers) | [Go](./add-two-numbers/add-two-numbers.go), [C](./add-two-numbers/add-two-numbers.c), [JS](./add-two-numbers/add-two-numbers.js) |
| 003 | [longest-substring-without-repeating-characters](https://leetcode.com/problems/longest-substring-without-repeating-characters) | [Go](./longest-substring-without-repeating-characters/longest-substring-without-repeating-characters.go), [C](./longest-substring-without-repeating-characterslongest-substring-without-repeating-characters.c) |
| 004 | [median-of-two-sorted-arrays](https://leetcode.com/problems/median-of-two-sorted-arrays) | [Go](./median-of-two-sorted-arrays/median-of-two-sorted-arrays.go) |
| 005 | [longest-palindromic-substring](https://leetcode.com/problems/longest-palindromic-substring) | [Go](./longest-palindromic-substring/longest-palindromic-substring.go) |
| 006 | [zigzag-conversion](https://leetcode.com/problems/zigzag-conversion) | [Go](./zigzag-conversion/zigzag-conversion.go) |
| 007 | [reverse-integer](https://leetcode.com/problems/reverse-integer) | [Go](./reverse-integer/reverse-integer.go), [JS](./reverse-integer/reverse-integer.js) |
| 008 | [string-to-integer-atoi](https://leetcode.com/problems/string-to-integer-atoi) | [Go](./string-to-integer-atoi/string-to-integer-atoi.go) |
| 009 | [palindrome-number](https://leetcode.com/problems/palindrome-number) | [Go](./palindrome-number/palindrome-number.go), [C](./palindrome-number/palindrome-number.c) |
| 010 | [regular-expression-matching](https://leetcode.com/problems/regular-expression-matching/) | [Go](./regular-expression-matching/regular-expression-matching.go) |
| 011 | [container-with-most-water](./container-with-most-water) | [Go](./container-with-most-water/container-with-most-water.go) |
| 012 | [integer-to-roman](https://leetcode.com/problems/integer-to-roman) | [Go](integer-to-roman) |
| 013 | [roman-to-integer](https://leetcode.com/problems/roman-to-integer) |[Go](./roman-to-integer/roman-to-integer.go) |
| 014 | [longest-common-prefix](https://leetcode.com/problems/longest-common-prefix/) | [Go](./longest-common-prefix/longest-common-prefix.go)|
| 015 | [3sum](https://leetcode.com/problems/3sum/) | [Go](./3sum/3sum.go), [JS](./3sum/3sum.js) |
| 016 | [3sum-closest](https://leetcode.com/problems/3sum-closest/) | [Go](./3sum-closest/3sum-closest.go) |
| 017 | [letter-combinations-of-a-phone-number](https://leetcode.com/problems/letter-combinations-of-a-phone-number) | [Go](./letter-combinations-of-a-phone-number/letter-combinations-of-a-phone-number.go) |
| 018 | [4sum](https://leetcode.com/problems/4sum/) | [Go](./4Sum/4Sum.go) |
| 019 |[remove-nth-node-from-end-of-list](https://leetcode.com/problems/remove-nth-node-from-end-of-list) | [Go](./remove-nth-node-from-end-of-list/remove-nth-node-from-end-of-list.go), [C](./remove-nth-node-from-end-of-list/remove-nth-node-from-end-of-list.c) |
| 020 | [valid-parentheses](https://leetcode.com/problems/valid-parentheses/) | [Go](./valid-parentheses/valid-parentheses.go), [C](./valid-parentheses/valid-parentheses.c) |
| 021|[merge-two-sorted-lists](https://leetcode.com/problems/merge-two-sorted-lists/) |[Go](./merge-two-sorted-lists/merge-two-sorted-lists.go) |
| 022| [generate-parentheses](https://leetcode.com/problems/generate-parentheses/) |[Go](./generate-parentheses/generate-parentheses.go) |
| 023 | [merge-k-sorted-lists](https://leetcode.com/problems/merge-k-sorted-lists/) |[Go](./merge-k-sorted-lists/merge-k-sorted-lists.go) |
| 024|[swap-nodes-in-pairs](https://leetcode.com/problems/swap-nodes-in-pairs/)|[Go](./swap-nodes-in-pairs/swap-nodes-in-pairs.go), [C](./swap-nodes-in-pairs/swap-nodes-in-pairs.c)|
| 025 |[reverse-nodes-in-k-groups](https://leetcode.com/problems/reverse-nodes-in-k-group/)|[Go](./reverse-nodes-in-k-groups/reverse-nodes-in-k-groups.go)|
| 026 | [remove-duplicates-from-sorted-array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/) | [Go](./remove-duplicates-from-sorted-array/remove-duplicates-from-sorted-array.go), [C](./remove-duplicates-from-sorted-array/remove-duplicates-from-sorted-array.c)|
| 027 | [remove-element](https://leetcode.com/problems/remove-element/) | [Go](./remove-element/remove-element.go), [C](./remove-element/remove-element.c), [JS](./remove-element/remove-element.js) |
| 028 | [find-the-index-of-the-first-occurrence-in-a-string](https://leetcode.com/problems/find-the-index-of-the-first-occurrence-in-a-string/) | [Go](./find-the-index-of-the-first-occurrence-in-a-string/find-the-index-of-the-first-occurrence-in-a-string.go), [C](./find-the-index-of-the-first-occurrence-in-a-string/find-the-index-of-the-first-occurrence-in-a-string.c), [JS](./find-the-index-of-the-first-occurrence-in-a-string/find-the-index-of-the-first-occurrence-in-a-string.js) |
| 029 | [divide-two-integers](https://leetcode.com/problems/divide-two-integers/) | [Go](./divide-two-integers/divide-two-integers.go)|
| 030 | [substring-with-concatenation-of-all-words]() | [Go](./substring-with-concatenation-of-all-words/substring-with-concatenation-of-all-words.go) |
| 031 | [next-permutation](https://leetcode.com/problems/next-permutation/) | [Go](./next-permutation/next-permutation.go) |
| 032 | [longest-valid-parentheses](https://leetcode.com/problems/longest-valid-parentheses/) | [Go](./longest-valid-parentheses/longest-valid-parentheses.go) |
| | | |
| 034 | [find-first-and-last-position-of-element-in-sorted-array](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array) | [Go](./find-first-and-last-position-of-element-in-sorted-array/find-first-and-last-position-of-element-in-sorted-array.go) |
| | | |
| | | |
| 037 | [sudoku-solver](https://leetcode.com/problems/sudoku-solver/) | [Go](./sudoku-solver/sudoku-solver.go) |
| 038 | [count-and-say](https://leetcode.com/problems/count-and-say/) | [Go](./count-and-say/count-and-say.go) |
| 039 | [combination-sum](https://leetcode.com/problems/combination-sum/) | [Go](./combination-sum/combination-sum.go) |
| 040 | [combination-sum-ii](https://leetcode.com/problems/combination-sum-ii/) | [Go](./combination-sum-ii/combination-sum-ii.go) |
| 041 | [first-missing-positive](https://leetcode.com/problems/first-missing-positive/) | [Go](./first-missing-positive/first-missing-positive.go) |
| 042 | [trapping-rain-water](https://leetcode.com/problems/trapping-rain-water/) | [Go](./trapping-rain-water/trapping-rain-water.go) |
| 043 | [multiply-strings](https://leetcode.com/problems/multiply-strings/) | [Go](./multiply-strings/multiply-strings.go) |
| 044|[wildcard-matching](https://leetcode.com/problems/wildcard-matching/) |[Go](./wildcard-matching/wildcard-matching.go) |
| 045|[jump-game-ii](https://leetcode.com/problems/jump-game-ii/) |[Go](./jump-game-ii/jump-game-ii.go) |
| | | |
| | | |
| | | |
| 049 | [group-anagrams](https://leetcode.com/problems/group-anagrams/) | [Go](./group-anagrams/group-anagrams.go) |
| 053 | [maximum-subarray](https://leetcode.com/problems/maximum-subarray/) | [Go](./maximum-subarray/maximum-subarray.go), [C](./maximum-subarray/maximum-subarray.c) |
| 055 | [jump-game](https://leetcode.com/problems/jump-game/) | [Go](./jump-game/jump-game.go)|
| 059 | [spiral-matrix-ii](https://leetcode.com/problems/spiral-matrix-ii/) | [Go](https://leetcode.com/problems/spiral-matrix-ii/) |
| 060 | [permutation-sequence](https://leetcode.com/problems/permutation-sequence/) | [Go](./permutation-sequence/permutation-sequence.go) |
| 061 |[rotate-list](https://leetcode.com/problems/rotate-list/) | [Go](./rotate-list/rotate-list.go)|
| 064|[minimum-path-sum](https://leetcode.com/problems/minimum-path-sum/) | [Go](./minimum-path-sum/minimum-path-sum.go) |
| 070| [climbing-stairs](https://leetcode.com/problems/climbing-stairs/) | [Go](./climbing-stairs/climbing-stairs.go) |
| 071 | [simplify-path](https://leetcode.com/problems/simplify-path/) | [Go](./simplify-path/simplify-path.go) |
| 073 | [set-matrix-zeros](https://leetocde.com/problems/set-matrix-zeros/) | [Go](./set-matrix-zeros/set-matrix-zeros.go) |
| 082 |[remove-duplicates-from-sorted-list-ii](https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/) | [Go](./remove-duplicates-from-sorted-list-ii/remove-duplicates-from-sorted-list-ii.go)|
| 083| [remove-duplicates-from-sorted-list](https://leetcode.com/problems/remove-duplicates-from-sorted-list/) | [Go](./remove-duplicates-from-sorted-list/remove-duplicates-from-sorted-list.go)|
| 086|[partition-list](https://leetcode.com/problems/partition-list/) |[Go](./partition-list/partition-list.go)|
| 091 | [decode-ways](https://leetcode.com/problems/decode-ways/) |[Go](./decode-ways/decode-ways.go) |
| # | Question | |
| :--: | :----------------------------------------------------------- | ------------------------------------------------------------ |
| 101 | [symmetric-tree](https://leetcode.com/problems/symmetric-tree/) | [Go](./symmetric-tree/symmetric-tree.go) |
| 102 | [binary-tree-level-order-traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/) | [C](./binary-tree-level-order-traversal/binary-tree-level-order-traversal.c) |
| 105 | [construct-binary-tree-from-preorder-and-inorder-traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/) | [C](./construct-binary-tree-from-preorder-and-inorder-traversal/construct-binary-tree-from-preorder-and-inorder-traversal.c) |
| 106 | [construct-binary-tree-from-inorder-and-postorder-traversal](https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/) | [C](./construct-binary-tree-from-inorder-and-postorder-traversal/construct-binary-tree-from-inorder-and-postorder-traversal.c) |
| 109 | [convert-sorted-list-to-binary-search-tree](https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree/) | [C](./convert-sorted-list-to-binary-search-tree/convert-sorted-list-to-binary-search-tree.c)|
| 111 | [minimum-depth-of-binary-tree](https://leetcode.com/problems/minimum-depth-of-binary-tree/) | [C](./minimum-depth-of-binary-tree/minimum-depth-of-binary-tree.c) |
| 112 | [path-sum](https://leetcode.com/problems/path-sum/) | [Go](./path-sum/path-sum.go) |
| 115 | [distinct-subsequences](https://leetcode.com/problems/distinct-subsequences/) | [C](./distinct-subsequences/distinct-subsequences.c) |
| 118 | [pascals-triangle](https://leetcode.com/problems/pascals-triangle/) | [C](./pascals-triangle/pascals-triangle.c) |
| 119 | [pascals-triangle-ii](https://leetcode.com/problems/pascals-triangle-ii/) | [C](./pascals-triangle-ii/pascals-triangle-ii.c)|
| 138 | [copy-list-with-random-pointer](https://leetcode.com/problems/copy-list-with-random-pointer/) | [Go](./copy-list-with-random-pointer/copy-list-with-random-pointer.go) |
| 141 |[linked-list-cycle](https://leetcode.com/problems/linked-list-cycle/) | [Go](./linked-list-cycle/linked-list-cycle.go) |
| 143 | [gas-station](https://leetcode.com/problems/gas-station/) | [Go](./gas-station/gas-station.go) |
| 144 |[binary-tree-preorder-traversal](https://leetcode.com/problems/binary-tree-preorder-traversal/)|[Go](./binary-tree-preorder-traversal/binary-tree-preorder-traversal.go) |
| 147|[insertion-sort-list](https://leetcode.com/problems/insertion-sort-list/) | [Go](./insertion-sort-list/insertion-sort-list.go) |
| 148 | [sort-list](https://leetcode.com/problems/sort-list/) | [Go](./sort-list/sort-list.go) |
| 165 | [compare-version-numbers](https://leetcode.com/problems/compare-version-numbers/) | [Go](./compare-version-numbers/compare-version-numbers.go) |
| 338 | [counting-bits](https://leetcode.com/problems/counting-bits/) | [Go](./counting-bits/counting-bits.go), [C](./counting-bits/counting-bits.c) |
| 343 | [integer-break](https://leetcode.com/problems/integer-break/) | [Go](./integer-break/integer-break.go) |
| 392 | [is-subsequence](https://leetcode.com/problems/is-subsequence/)|[Go](./is-subsequence/is-subsequence.go)|
| 413 |[arithmetic-slices](https://leetcode.com/problems/arithmetic-slices/) | [Go](./arithmetic-slices/arithmetic-slices.go)|
| 542 | [01-matrix](https://leetcode.com/problems/01-matrix/) |[Go](./01-matrix/01-matrix.go)|
| 622 | [design-circular-queue](https://leetcode.com/problems/design-circular-queue/)|[Go](./design-circular-queue/design-circular-queue.go)|
| 623|[add-one-row-to-tree](https://leetcode.com/problems/add-one-row-to-tree/) | [Go](./add-one-row-to-tree/add-one-row-to-tree.go) |
| 658 | [find-k-closest-elements](https://leetcode.com/problems/find-k-closest-elements) | [Go](./find-k-closest-elements/find-k-closest-elements.go) |
| 948 | [bag-of-tokens](https://leetcode.com/problems/bag-of-tokens/) | [Go](./bag-of-tokens/bag-of-tokens.go)|
| 981 | [time-based-key-value-store](https://leetcode.com/problems/time-based-key-value-store/)|[Go](./time-based-key-value-store/time-based-key-value-store.go) |
| 990 | [satisfiability-of-equality-equations](https://leetcode.com/problems/satisfiability-of-equality-equations/) | [Go](./satisfiability-of-equality-equations/satisfiability-of-equality-equations.go) |
| 997| [find-the-town-judge](https://leetcode.com/problems/find-the-town-judge/) |[Go](./find-the-town-judge/find-the-town-judge.go), [C](./find-the-town-judge/find-the-town-judge.c) |
| 1328 | [break-a-palindrome](https://leetcode.com/problems/break-a-palindrome/) | [Go](./break-a-palindrome/break-a-palindrome.go)|
|1337| [the-k-weakest-rows-in-a-matrix](https://leetcode.com/problems/the-k-weakest-rows-in-a-matrix/) | [Go](./the-k-weakest-rows-in-a-matrix/the-k-weakest-rows-in-a-matrix.go) |
| 1578 | [minimum-time-to-make-rope-colorful]( https://leetcode.com/problems/minimum-time-to-make-rope-colorful/) | [Go](./minimum-time-to-make-rope-colorful/minimum-time-to-make-rope-colorful.go)|
|1680| [concatenation-of-consecutive-binary-numbers](https://leetcode.com/problems/concatenation-of-consecutive-binary-numbers/) | [Go](./concatenation-of-consecutive-binary-numbers/concatenation-of-consecutive-binary-numbers.go), [C](./concatenation-of-consecutive-binary-numbers/concatenation-of-consecutive-binary-numbers.c)|
| 2246|[longest-path-with-different-adjacent-characters](https://leetcode.com/problems/longest-path-with-different-adjacent-characters/)|[Go](./longest-path-with-different-adjacent-characters/longest-path-with-different-adjacent-characters.go)|