https://github.com/gituser143/goleet
Solutions to LeetCode problems in GoLang!
https://github.com/gituser143/goleet
competitive-coding go golang leetcode leetcode-solutions solutions
Last synced: 4 months ago
JSON representation
Solutions to LeetCode problems in GoLang!
- Host: GitHub
- URL: https://github.com/gituser143/goleet
- Owner: Gituser143
- Created: 2020-10-20T18:31:53.000Z (over 4 years ago)
- Default Branch: main
- Last Pushed: 2021-07-23T12:41:03.000Z (almost 4 years ago)
- Last Synced: 2024-06-21T17:55:55.503Z (about 1 year ago)
- Topics: competitive-coding, go, golang, leetcode, leetcode-solutions, solutions
- Language: Go
- Homepage:
- Size: 359 KB
- Stars: 1
- Watchers: 3
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
GoLeet
======
My collection of leet code problems solved in GoLang!
Link to profile, [bhargavsnv100](https://leetcode.com/bhargavsnv100/)
| [Easy](Easy/README.md) | [Medium](Medium/README.md) | [Hard](Hard/README.md) |
|------------------------|----------------------------|------------------------|
| 53 | 89 | 19 |
Problems finished
=================
Easy
----
- [average-of-levels-in-binary-tree.md](Easy/average-of-levels-in-binary-tree.md)
- [backspace-string-compare.md](Easy/backspace-string-compare.md)
- [best-time-to-buy-and-sell-stock.md](Easy/best-time-to-buy-and-sell-stock.md)
- [binary-tree-level-order-traversal-ii.md](Easy/binary-tree-level-order-traversal-ii.md)
- [binary-tree-paths.md](Easy/binary-tree-paths.md)
- [can-place-flowers.md](Easy/can-place-flowers.md)
- [check-if-two-string-arrays-are-equivalent.md](Easy/check-if-two-string-arrays-are-equivalent.md)
- [climbing-stairs.md](Easy/climbing-stairs.md)
- [convert-binary-number-in-linked-list-to-integer.md](Easy/convert-binary-number-in-linked-list-to-integer.md)
- [find-the-town-judge.md](Easy/find-the-town-judge.md)
- [flipping-an-image.md](Easy/flipping-an-image.md)
- [goat-latin.md](Easy/goat-latin.md)
- [implement-strstr.md](Easy/implement-strstr.md)
- [increasing-order-search-tree.md](Easy/increasing-order-search-tree.md)
- [isomorphic-strings.md](Easy/isomorphic-strings.md)
- [kth-missing-positive-number.md](Easy/kth-missing-positive-number.md)
- [length-of-last-word.md](Easy/length-of-last-word.md)
- [license-key-formatting.md](Easy/license-key-formatting.md)
- [longest-common-prefix.md](Easy/longest-common-prefix.md)
- [lowest-common-ancestor-of-a-binary-search-tree.md](Easy/lowest-common-ancestor-of-a-binary-search-tree.md)
- [majority-element.md](Easy/majority-element.md)
- [max-consecutive-ones.md](Easy/max-consecutive-ones.md)
- [maximum-ascending-subarray-sum.md](Easy/maximum-ascending-subarray-sum.md)
- [maximum-depth-of-binary-tree.md](Easy/maximum-depth-of-binary-tree.md)
- [maximum-depth-of-n-ary-tree.md](Easy/maximum-depth-of-n-ary-tree.md)
- [maximum-subarray.md](Easy/maximum-subarray.md)
- [merge-sorted-array.md](Easy/merge-sorted-array.md)
- [merge-two-sorted-lists.md](Easy/merge-two-sorted-lists.md)
- [minimum-depth-of-binary-tree.md](Easy/minimum-depth-of-binary-tree.md)
- [palindrome-number.md](Easy/palindrome-number.md)
- [pascals-triangle-ii.md](Easy/pascals-triangle-ii.md)
- [pascals-triangle.md](Easy/pascals-triangle.md)
- [path-sum.md](Easy/path-sum.md)
- [range-sum-of-bst.md](Easy/range-sum-of-bst.md)
- [remove-all-adjacent-duplicates-in-string.md](Easy/remove-all-adjacent-duplicates-in-string.md)
- [remove-duplicates-from-sorted-array.md](Easy/remove-duplicates-from-sorted-array.md)
- [remove-duplicates-from-sorted-list.md](Easy/remove-duplicates-from-sorted-list.md)
- [remove-element.md](Easy/remove-element.md)
- [reshape-the-matrix.md](Easy/reshape-the-matrix.md)
- [reverse-integer.md](Easy/reverse-integer.md)
- [reverse-linked-list.md](Easy/reverse-linked-list.md)
- [reverse-string.md](Easy/reverse-string.md)
- [roman-to-int.md](Easy/roman-to-int.md)
- [squares-of-a-sorted-array.md](Easy/squares-of-a-sorted-array.md)
- [symmetric-tree.md](Easy/symmetric-tree.md)
- [tenth-line.md](Easy/tenth-line.md)
- [trim-a-binary-search-tree.md](Easy/trim-a-binary-search-tree.md)
- [two-sum-ii-input-array-is-sorted.md](Easy/two-sum-ii-input-array-is-sorted.md)
- [two-sum.md](Easy/two-sum.md)
- [unique-morse-code-words.md](Easy/unique-morse-code-words.md)
- [valid-mountain-array.md](Easy/valid-mountain-array.md)
- [valid-parentheses.md](Easy/valid-parentheses.md)
- [valid-phone-numbers.md](Easy/valid-phone-numbers.md)
Medium
------
- [3sum-closest.md](Medium/3sum-closest.md)
- [3sum.md](Medium/3sum.md)
- [4sum-ii.md](Medium/4sum-ii.md)
- [4sum.md](Medium/4sum.md)
- [add-two-numbers.md](Medium/add-two-numbers.md)
- [binary-tree-inorder-traversal.md](Medium/binary-tree-inorder-traversal.md)
- [binary-tree-level-order-traversal.md](Medium/binary-tree-level-order-traversal.md)
- [binary-tree-postorder-traversal.md](Medium/binary-tree-postorder-traversal.md)
- [binary-tree-preorder-traversal.md](Medium/binary-tree-preorder-traversal.md)
- [binary-tree-pruning.md](Medium/binary-tree-pruning.md)
- [boats-to-save-people.md](Medium/boats-to-save-people.md)
- [clone-graph.md](Medium/clone-graph.md)
- [container-with-most-water.md](Medium/container-with-most-water.md)
- [count-servers-that-communicate.md](Medium/count-servers-that-communicate.md)
- [course-schedule-ii.md](Medium/course-schedule-ii.md)
- [course-schedule.md](Medium/course-schedule.md)
- [custom-sort-string.md](Medium/custom-sort-string.md)
- [decode-string.md](Medium/decode-string.md)
- [decoded-string-at-index.md](Medium/decoded-string-at-index.md)
- [diagonal-traverse.md](Medium/diagonal-traverse.md)
- [domino-and-tromino-tiling.md](Medium/domino-and-tromino-tiling.md)
- [evaluate-reverse-polish-notation.md](Medium/evaluate-reverse-polish-notation.md)
- [find-k-closest-elements.md](Medium/find-k-closest-elements.md)
- [find-peak-element.md](Medium/find-peak-element.md)
- [find-the-most-competitive-subsequence.md](Medium/find-the-most-competitive-subsequence.md)
- [game-of-life.md](Medium/game-of-life.md)
- [gray-code.md](Medium/gray-code.md)
- [increasing-triplet-subsequence.md](Medium/increasing-triplet-subsequence.md)
- [integer-to-roman.md](Medium/integer-to-roman.md)
- [kth-largest-element-in-an-array.md](Medium/kth-largest-element-in-an-array.md)
- [kth-smallest-element-in-a-sorted-matrix.md](Medium/kth-smallest-element-in-a-sorted-matrix.md)
- [letter-combinations-of-a-phone-number.md](Medium/letter-combinations-of-a-phone-number.md)
- [linked-list-random-node.md](Medium/linked-list-random-node.md)
- [longest-absolute-file-path.md](Medium/longest-absolute-file-path.md)
- [longest-increasing-subsequence.md](Medium/longest-increasing-subsequence.md)
- [longest-mountain-in-array.md](Medium/longest-mountain-in-array.md)
- [longest-palindromic-substring.md](Medium/longest-palindromic-substring.md)
- [longest-substring-without-repeating-characters.md](Medium/longest-substring-without-repeating-characters.md)
- [lowest-common-ancestor-of-a-binary-tree.md](Medium/lowest-common-ancestor-of-a-binary-tree.md)
- [lowest-common-ancestor-of-deepest-leaves.md](Medium/lowest-common-ancestor-of-deepest-leaves.md)
- [max-consecutive-ones-iii.md](Medium/max-consecutive-ones-iii.md)
- [max-number-of-k-sum-pairs.md](Medium/max-number-of-k-sum-pairs.md)
- [maximal-network-rank.md](Medium/maximal-network-rank.md)
- [maximum-length-of-repeated-subarray.md](Medium/maximum-length-of-repeated-subarray.md)
- [merge-intervals.md](Medium/merge-intervals.md)
- [minimum-height-trees.md](Medium/minimum-height-trees.md)
- [mirror-reflection.md](Medium/mirror-reflection.md)
- [multiply-strings.md](Medium/multiply-strings.md)
- [network-delay-time.md](Medium/network-delay-time.md)
- [number-of-matching-subsequences.md](Medium/number-of-matching-subsequences.md)
- [out-of-boundary-paths.md](Medium/out-of-boundary-paths.md)
- [pairs-of-songs-with-total-durations-divisible-by-60.md](Medium/pairs-of-songs-with-total-durations-divisible-by-60.md)
- [partition-array-into-disjoint-intervals.md](Medium/partition-array-into-disjoint-intervals.md)
- [path-sum-ii.md](Medium/path-sum-ii.md)
- [path-sum-iii.md](Medium/path-sum-iii.md)
- [populating-next-right-pointers-in-each-node-ii.md](Medium/populating-next-right-pointers-in-each-node-ii.md)
- [populating-next-right-pointers-in-each-node.md](Medium/populating-next-right-pointers-in-each-node.md)
- [pseudo-palindromic-paths-in-a-binary-tree.md](Medium/pseudo-palindromic-paths-in-a-binary-tree.md)
- [push-dominoes.md](Medium/push-dominoes.md)
- [range-sum-query-2d-immutable.md](Medium/range-sum-query-2d-immutable.md)
- [reduce-array-size-to-the-half.md](Medium/reduce-array-size-to-the-half.md)
- [redundant-connection.md](Medium/redundant-connection.md)
- [remove-comments.md](Medium/remove-comments.md)
- [remove-duplicates-from-sorted-array-ii.md](Medium/remove-duplicates-from-sorted-array-ii.md)
- [remove-duplicates-from-sorted-list-ii.md](Medium/remove-duplicates-from-sorted-list-ii.md)
- [remove-nth-node-from-end-of-list.md](Medium/remove-nth-node-from-end-of-list.md)
- [restore-ip-addresses.md](Medium/restore-ip-addresses.md)
- [reverse-linked-list-ii.md](Medium/reverse-linked-list-ii.md)
- [rotate-image.md](Medium/rotate-image.md)
- [same-tree.md](Medium/same-tree.md)
- [search-in-rotated-sorted-array-ii.md](Medium/search-in-rotated-sorted-array-ii.md)
- [search-in-rotated-sorted-array.md](Medium/search-in-rotated-sorted-array.md)
- [shuffle-array.md](Medium/shuffle-array.md)
- [simplify-path.md](Medium/simplify-path.md)
- [smallest-range-ii.md](Medium/smallest-range-ii.md)
- [smallest-subtree-with-all-the-deepest-nodes.md](Medium/smallest-subtree-with-all-the-deepest-nodes.md)
- [sort-the-matrix-diagonally.md](Medium/sort-the-matrix-diagonally.md)
- [string-to-integer-atoi.md](Medium/string-to-integer-atoi.md)
- [subarray-sum-equals-k.md](Medium/subarray-sum-equals-k.md)
- [sum-root-to-leaf-numbers.md](Medium/sum-root-to-leaf-numbers.md)
- [swap-nodes-in-pairs.md](Medium/swap-nodes-in-pairs.md)
- [the-kth-factor-of-n.md](Medium/the-kth-factor-of-n.md)
- [top-k-frequent-elements.md](Medium/top-k-frequent-elements.md)
- [valid-sudoku.md](Medium/valid-sudoku.md)
- [valid-triangle-number.md](Medium/valid-triangle-number.md)
- [validate-binary-search-tree.md](Medium/validate-binary-search-tree.md)
- [validate-binary-tree-nodes.md](Medium/validate-binary-tree-nodes.md)
- [word-frequency.md](Medium/word-frequency.md)
- [zigzag-conversion.md](Medium/zigzag-conversion.md)
Hard
----
- [binary-tree-maximum-path-sum.md](Hard/binary-tree-maximum-path-sum.md)
- [candy.md](Hard/candy.md)
- [closest-subsequence-sum.md](Hard/closest-subsequence-sum.md)
- [count-vowels-permutation.md](Hard/count-vowels-permutation.md)
- [create-sorted-array-through-instructions.md](Hard/create-sorted-array-through-instructions.md)
- [decode-ways-ii.md](Hard/decode-ways-ii.md)
- [find-median-from-data-stream.md](Hard/find-median-from-data-stream.md)
- [k-similar-strings.md](Hard/k-similar-strings.md)
- [longest-valid-parenthesis.md](Hard/longest-valid-parenthesis.md)
- [median-of-two-sorted-array.md](Hard/median-of-two-sorted-array.md)
- [merge-k-sorted-lists.md](Hard/merge-k-sorted-lists.md)
- [poor-pigs.md](Hard/poor-pigs.md)
- [recover-binary-search-tree.md](Hard/recover-binary-search-tree.md)
- [regular-expression-matching.md](Hard/regular-expression-matching.md)
- [reverse-nodes-in-k-group.md](Hard/reverse-nodes-in-k-group.md)
- [sliding-window-maximum.md](Hard/sliding-window-maximum.md)
- [the-skyline-problem.md](Hard/the-skyline-problem.md)
- [trapping-rain-water.md](Hard/trapping-rain-water.md)
- [vertical-order-traversal-of-a-binary-tree.md](Hard/vertical-order-traversal-of-a-binary-tree.md)