{"id":26385293,"url":"https://github.com/gituser143/goleet","last_synced_at":"2025-03-17T07:41:31.590Z","repository":{"id":68544378,"uuid":"305799858","full_name":"Gituser143/GoLeet","owner":"Gituser143","description":"Solutions to LeetCode problems in GoLang!","archived":false,"fork":false,"pushed_at":"2021-07-23T12:41:03.000Z","size":368,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":3,"default_branch":"main","last_synced_at":"2024-06-21T17:55:55.503Z","etag":null,"topics":["competitive-coding","go","golang","leetcode","leetcode-solutions","solutions"],"latest_commit_sha":null,"homepage":"","language":"Go","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Gituser143.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2020-10-20T18:31:53.000Z","updated_at":"2021-07-23T12:41:06.000Z","dependencies_parsed_at":"2023-06-05T01:00:40.578Z","dependency_job_id":null,"html_url":"https://github.com/Gituser143/GoLeet","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Gituser143%2FGoLeet","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Gituser143%2FGoLeet/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Gituser143%2FGoLeet/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Gituser143%2FGoLeet/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Gituser143","download_url":"https://codeload.github.com/Gituser143/GoLeet/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":243996280,"owners_count":20380977,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["competitive-coding","go","golang","leetcode","leetcode-solutions","solutions"],"created_at":"2025-03-17T07:41:30.974Z","updated_at":"2025-03-17T07:41:31.581Z","avatar_url":"https://github.com/Gituser143.png","language":"Go","funding_links":[],"categories":[],"sub_categories":[],"readme":"GoLeet\n======\n\nMy collection of leet code problems solved in GoLang!\n\nLink to profile, [bhargavsnv100](https://leetcode.com/bhargavsnv100/)\n\n| [Easy](Easy/README.md) | [Medium](Medium/README.md) | [Hard](Hard/README.md) |\n|------------------------|----------------------------|------------------------|\n| 53                     | 89                         | 19                     |\n\nProblems finished\n=================\n\nEasy\n----\n\n- [average-of-levels-in-binary-tree.md](Easy/average-of-levels-in-binary-tree.md)\n- [backspace-string-compare.md](Easy/backspace-string-compare.md)\n- [best-time-to-buy-and-sell-stock.md](Easy/best-time-to-buy-and-sell-stock.md)\n- [binary-tree-level-order-traversal-ii.md](Easy/binary-tree-level-order-traversal-ii.md)\n- [binary-tree-paths.md](Easy/binary-tree-paths.md)\n- [can-place-flowers.md](Easy/can-place-flowers.md)\n- [check-if-two-string-arrays-are-equivalent.md](Easy/check-if-two-string-arrays-are-equivalent.md)\n- [climbing-stairs.md](Easy/climbing-stairs.md)\n- [convert-binary-number-in-linked-list-to-integer.md](Easy/convert-binary-number-in-linked-list-to-integer.md)\n- [find-the-town-judge.md](Easy/find-the-town-judge.md)\n- [flipping-an-image.md](Easy/flipping-an-image.md)\n- [goat-latin.md](Easy/goat-latin.md)\n- [implement-strstr.md](Easy/implement-strstr.md)\n- [increasing-order-search-tree.md](Easy/increasing-order-search-tree.md)\n- [isomorphic-strings.md](Easy/isomorphic-strings.md)\n- [kth-missing-positive-number.md](Easy/kth-missing-positive-number.md)\n- [length-of-last-word.md](Easy/length-of-last-word.md)\n- [license-key-formatting.md](Easy/license-key-formatting.md)\n- [longest-common-prefix.md](Easy/longest-common-prefix.md)\n- [lowest-common-ancestor-of-a-binary-search-tree.md](Easy/lowest-common-ancestor-of-a-binary-search-tree.md)\n- [majority-element.md](Easy/majority-element.md)\n- [max-consecutive-ones.md](Easy/max-consecutive-ones.md)\n- [maximum-ascending-subarray-sum.md](Easy/maximum-ascending-subarray-sum.md)\n- [maximum-depth-of-binary-tree.md](Easy/maximum-depth-of-binary-tree.md)\n- [maximum-depth-of-n-ary-tree.md](Easy/maximum-depth-of-n-ary-tree.md)\n- [maximum-subarray.md](Easy/maximum-subarray.md)\n- [merge-sorted-array.md](Easy/merge-sorted-array.md)\n- [merge-two-sorted-lists.md](Easy/merge-two-sorted-lists.md)\n- [minimum-depth-of-binary-tree.md](Easy/minimum-depth-of-binary-tree.md)\n- [palindrome-number.md](Easy/palindrome-number.md)\n- [pascals-triangle-ii.md](Easy/pascals-triangle-ii.md)\n- [pascals-triangle.md](Easy/pascals-triangle.md)\n- [path-sum.md](Easy/path-sum.md)\n- [range-sum-of-bst.md](Easy/range-sum-of-bst.md)\n- [remove-all-adjacent-duplicates-in-string.md](Easy/remove-all-adjacent-duplicates-in-string.md)\n- [remove-duplicates-from-sorted-array.md](Easy/remove-duplicates-from-sorted-array.md)\n- [remove-duplicates-from-sorted-list.md](Easy/remove-duplicates-from-sorted-list.md)\n- [remove-element.md](Easy/remove-element.md)\n- [reshape-the-matrix.md](Easy/reshape-the-matrix.md)\n- [reverse-integer.md](Easy/reverse-integer.md)\n- [reverse-linked-list.md](Easy/reverse-linked-list.md)\n- [reverse-string.md](Easy/reverse-string.md)\n- [roman-to-int.md](Easy/roman-to-int.md)\n- [squares-of-a-sorted-array.md](Easy/squares-of-a-sorted-array.md)\n- [symmetric-tree.md](Easy/symmetric-tree.md)\n- [tenth-line.md](Easy/tenth-line.md)\n- [trim-a-binary-search-tree.md](Easy/trim-a-binary-search-tree.md)\n- [two-sum-ii-input-array-is-sorted.md](Easy/two-sum-ii-input-array-is-sorted.md)\n- [two-sum.md](Easy/two-sum.md)\n- [unique-morse-code-words.md](Easy/unique-morse-code-words.md)\n- [valid-mountain-array.md](Easy/valid-mountain-array.md)\n- [valid-parentheses.md](Easy/valid-parentheses.md)\n- [valid-phone-numbers.md](Easy/valid-phone-numbers.md)\n\nMedium\n------\n\n- [3sum-closest.md](Medium/3sum-closest.md)\n- [3sum.md](Medium/3sum.md)\n- [4sum-ii.md](Medium/4sum-ii.md)\n- [4sum.md](Medium/4sum.md)\n- [add-two-numbers.md](Medium/add-two-numbers.md)\n- [binary-tree-inorder-traversal.md](Medium/binary-tree-inorder-traversal.md)\n- [binary-tree-level-order-traversal.md](Medium/binary-tree-level-order-traversal.md)\n- [binary-tree-postorder-traversal.md](Medium/binary-tree-postorder-traversal.md)\n- [binary-tree-preorder-traversal.md](Medium/binary-tree-preorder-traversal.md)\n- [binary-tree-pruning.md](Medium/binary-tree-pruning.md)\n- [boats-to-save-people.md](Medium/boats-to-save-people.md)\n- [clone-graph.md](Medium/clone-graph.md)\n- [container-with-most-water.md](Medium/container-with-most-water.md)\n- [count-servers-that-communicate.md](Medium/count-servers-that-communicate.md)\n- [course-schedule-ii.md](Medium/course-schedule-ii.md)\n- [course-schedule.md](Medium/course-schedule.md)\n- [custom-sort-string.md](Medium/custom-sort-string.md)\n- [decode-string.md](Medium/decode-string.md)\n- [decoded-string-at-index.md](Medium/decoded-string-at-index.md)\n- [diagonal-traverse.md](Medium/diagonal-traverse.md)\n- [domino-and-tromino-tiling.md](Medium/domino-and-tromino-tiling.md)\n- [evaluate-reverse-polish-notation.md](Medium/evaluate-reverse-polish-notation.md)\n- [find-k-closest-elements.md](Medium/find-k-closest-elements.md)\n- [find-peak-element.md](Medium/find-peak-element.md)\n- [find-the-most-competitive-subsequence.md](Medium/find-the-most-competitive-subsequence.md)\n- [game-of-life.md](Medium/game-of-life.md)\n- [gray-code.md](Medium/gray-code.md)\n- [increasing-triplet-subsequence.md](Medium/increasing-triplet-subsequence.md)\n- [integer-to-roman.md](Medium/integer-to-roman.md)\n- [kth-largest-element-in-an-array.md](Medium/kth-largest-element-in-an-array.md)\n- [kth-smallest-element-in-a-sorted-matrix.md](Medium/kth-smallest-element-in-a-sorted-matrix.md)\n- [letter-combinations-of-a-phone-number.md](Medium/letter-combinations-of-a-phone-number.md)\n- [linked-list-random-node.md](Medium/linked-list-random-node.md)\n- [longest-absolute-file-path.md](Medium/longest-absolute-file-path.md)\n- [longest-increasing-subsequence.md](Medium/longest-increasing-subsequence.md)\n- [longest-mountain-in-array.md](Medium/longest-mountain-in-array.md)\n- [longest-palindromic-substring.md](Medium/longest-palindromic-substring.md)\n- [longest-substring-without-repeating-characters.md](Medium/longest-substring-without-repeating-characters.md)\n- [lowest-common-ancestor-of-a-binary-tree.md](Medium/lowest-common-ancestor-of-a-binary-tree.md)\n- [lowest-common-ancestor-of-deepest-leaves.md](Medium/lowest-common-ancestor-of-deepest-leaves.md)\n- [max-consecutive-ones-iii.md](Medium/max-consecutive-ones-iii.md)\n- [max-number-of-k-sum-pairs.md](Medium/max-number-of-k-sum-pairs.md)\n- [maximal-network-rank.md](Medium/maximal-network-rank.md)\n- [maximum-length-of-repeated-subarray.md](Medium/maximum-length-of-repeated-subarray.md)\n- [merge-intervals.md](Medium/merge-intervals.md)\n- [minimum-height-trees.md](Medium/minimum-height-trees.md)\n- [mirror-reflection.md](Medium/mirror-reflection.md)\n- [multiply-strings.md](Medium/multiply-strings.md)\n- [network-delay-time.md](Medium/network-delay-time.md)\n- [number-of-matching-subsequences.md](Medium/number-of-matching-subsequences.md)\n- [out-of-boundary-paths.md](Medium/out-of-boundary-paths.md)\n- [pairs-of-songs-with-total-durations-divisible-by-60.md](Medium/pairs-of-songs-with-total-durations-divisible-by-60.md)\n- [partition-array-into-disjoint-intervals.md](Medium/partition-array-into-disjoint-intervals.md)\n- [path-sum-ii.md](Medium/path-sum-ii.md)\n- [path-sum-iii.md](Medium/path-sum-iii.md)\n- [populating-next-right-pointers-in-each-node-ii.md](Medium/populating-next-right-pointers-in-each-node-ii.md)\n- [populating-next-right-pointers-in-each-node.md](Medium/populating-next-right-pointers-in-each-node.md)\n- [pseudo-palindromic-paths-in-a-binary-tree.md](Medium/pseudo-palindromic-paths-in-a-binary-tree.md)\n- [push-dominoes.md](Medium/push-dominoes.md)\n- [range-sum-query-2d-immutable.md](Medium/range-sum-query-2d-immutable.md)\n- [reduce-array-size-to-the-half.md](Medium/reduce-array-size-to-the-half.md)\n- [redundant-connection.md](Medium/redundant-connection.md)\n- [remove-comments.md](Medium/remove-comments.md)\n- [remove-duplicates-from-sorted-array-ii.md](Medium/remove-duplicates-from-sorted-array-ii.md)\n- [remove-duplicates-from-sorted-list-ii.md](Medium/remove-duplicates-from-sorted-list-ii.md)\n- [remove-nth-node-from-end-of-list.md](Medium/remove-nth-node-from-end-of-list.md)\n- [restore-ip-addresses.md](Medium/restore-ip-addresses.md)\n- [reverse-linked-list-ii.md](Medium/reverse-linked-list-ii.md)\n- [rotate-image.md](Medium/rotate-image.md)\n- [same-tree.md](Medium/same-tree.md)\n- [search-in-rotated-sorted-array-ii.md](Medium/search-in-rotated-sorted-array-ii.md)\n- [search-in-rotated-sorted-array.md](Medium/search-in-rotated-sorted-array.md)\n- [shuffle-array.md](Medium/shuffle-array.md)\n- [simplify-path.md](Medium/simplify-path.md)\n- [smallest-range-ii.md](Medium/smallest-range-ii.md)\n- [smallest-subtree-with-all-the-deepest-nodes.md](Medium/smallest-subtree-with-all-the-deepest-nodes.md)\n- [sort-the-matrix-diagonally.md](Medium/sort-the-matrix-diagonally.md)\n- [string-to-integer-atoi.md](Medium/string-to-integer-atoi.md)\n- [subarray-sum-equals-k.md](Medium/subarray-sum-equals-k.md)\n- [sum-root-to-leaf-numbers.md](Medium/sum-root-to-leaf-numbers.md)\n- [swap-nodes-in-pairs.md](Medium/swap-nodes-in-pairs.md)\n- [the-kth-factor-of-n.md](Medium/the-kth-factor-of-n.md)\n- [top-k-frequent-elements.md](Medium/top-k-frequent-elements.md)\n- [valid-sudoku.md](Medium/valid-sudoku.md)\n- [valid-triangle-number.md](Medium/valid-triangle-number.md)\n- [validate-binary-search-tree.md](Medium/validate-binary-search-tree.md)\n- [validate-binary-tree-nodes.md](Medium/validate-binary-tree-nodes.md)\n- [word-frequency.md](Medium/word-frequency.md)\n- [zigzag-conversion.md](Medium/zigzag-conversion.md)\n\nHard\n----\n\n- [binary-tree-maximum-path-sum.md](Hard/binary-tree-maximum-path-sum.md)\n- [candy.md](Hard/candy.md)\n- [closest-subsequence-sum.md](Hard/closest-subsequence-sum.md)\n- [count-vowels-permutation.md](Hard/count-vowels-permutation.md)\n- [create-sorted-array-through-instructions.md](Hard/create-sorted-array-through-instructions.md)\n- [decode-ways-ii.md](Hard/decode-ways-ii.md)\n- [find-median-from-data-stream.md](Hard/find-median-from-data-stream.md)\n- [k-similar-strings.md](Hard/k-similar-strings.md)\n- [longest-valid-parenthesis.md](Hard/longest-valid-parenthesis.md)\n- [median-of-two-sorted-array.md](Hard/median-of-two-sorted-array.md)\n- [merge-k-sorted-lists.md](Hard/merge-k-sorted-lists.md)\n- [poor-pigs.md](Hard/poor-pigs.md)\n- [recover-binary-search-tree.md](Hard/recover-binary-search-tree.md)\n- [regular-expression-matching.md](Hard/regular-expression-matching.md)\n- [reverse-nodes-in-k-group.md](Hard/reverse-nodes-in-k-group.md)\n- [sliding-window-maximum.md](Hard/sliding-window-maximum.md)\n- [the-skyline-problem.md](Hard/the-skyline-problem.md)\n- [trapping-rain-water.md](Hard/trapping-rain-water.md)\n- [vertical-order-traversal-of-a-binary-tree.md](Hard/vertical-order-traversal-of-a-binary-tree.md)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgituser143%2Fgoleet","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fgituser143%2Fgoleet","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgituser143%2Fgoleet/lists"}