{"id":37171969,"url":"https://github.com/sreejeet/leetcode","last_synced_at":"2026-01-14T20:03:41.561Z","repository":{"id":104605563,"uuid":"256712928","full_name":"sreejeet/leetcode","owner":"sreejeet","description":"My leetcode solutions. No PRs unless for improvement/corrections.","archived":false,"fork":false,"pushed_at":"2020-09-16T19:54:44.000Z","size":104,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2024-06-19T05:18:19.547Z","etag":null,"topics":["algorithms","competitive-programming","data-structures","exercises","leetcode","leetcode-solutions","solutions"],"latest_commit_sha":null,"homepage":"https://leetcode.com/sreejeet","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/sreejeet.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-04-18T09:19:11.000Z","updated_at":"2023-01-09T16:25:13.000Z","dependencies_parsed_at":null,"dependency_job_id":"d1ed2aca-5d48-419e-9299-c64139951806","html_url":"https://github.com/sreejeet/leetcode","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/sreejeet/leetcode","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sreejeet%2Fleetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sreejeet%2Fleetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sreejeet%2Fleetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sreejeet%2Fleetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/sreejeet","download_url":"https://codeload.github.com/sreejeet/leetcode/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sreejeet%2Fleetcode/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":28434149,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-01-14T18:57:19.464Z","status":"ssl_error","status_checked_at":"2026-01-14T18:52:48.501Z","response_time":107,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.6:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"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":["algorithms","competitive-programming","data-structures","exercises","leetcode","leetcode-solutions","solutions"],"created_at":"2026-01-14T20:03:40.834Z","updated_at":"2026-01-14T20:03:41.535Z","avatar_url":"https://github.com/sreejeet.png","language":"Go","funding_links":[],"categories":[],"sub_categories":[],"readme":"## LeetCode solutions\n\u003c!--\ntree --dirsfirst -I 'go\\.go|py.py|sql.sql' -trH ''\n--\u003e\n\u003ch4\u003eIt's not much, but it's honest work.\u003c/h4\u003e\n├── \u003ca href=\"/algorithms/\"\u003ealgorithms\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/algorithms/largest-time-for-given-digits.py\"\u003elargest-time-for-given-digits.py\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/algorithms/sliding-window-maximum.py\"\u003esliding-window-maximum.py\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/algorithms/minimum-depth-of-binary-tree.py\"\u003eminimum-depth-of-binary-tree.py\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/algorithms/binary-tree-level-order-traversal.py\"\u003ebinary-tree-level-order-traversal.py\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/algorithms/minimum-distance-between-bst-nodes.py\"\u003eminimum-distance-between-bst-nodes.py\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/algorithms/binary-tree-inorder-traversal.py\"\u003ebinary-tree-inorder-traversal.py\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/algorithms/letter-combinations-of-a-phone-number.py\"\u003eletter-combinations-of-a-phone-number.py\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/algorithms/3sum-closest.py\"\u003e3sum-closest.py\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/algorithms/3sum.py\"\u003e3sum.py\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/algorithms/insert-into-a-binary-search-tree.py\"\u003einsert-into-a-binary-search-tree.py\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/algorithms/move-zeroes.go\"\u003emove-zeroes.go\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/algorithms/palindrome-linked-list.go\"\u003epalindrome-linked-list.go\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/algorithms/invert-binary-tree.go\"\u003einvert-binary-tree.go\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/algorithms/sort-colors.go\"\u003esort-colors.go\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/algorithms/remove-nth-node-from-end-of-list.go\"\u003eremove-nth-node-from-end-of-list.go\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/algorithms/reverse-linked-list.go\"\u003ereverse-linked-list.go\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/algorithms/house-robber.py\"\u003ehouse-robber.py\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/algorithms/house-robber.go\"\u003ehouse-robber.go\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/algorithms/average-of-levels-in-binary-tree.go\"\u003eaverage-of-levels-in-binary-tree.go\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/algorithms/binary-tree-level-order-traversal.go\"\u003ebinary-tree-level-order-traversal.go\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/algorithms/majority-element.go\"\u003emajority-element.go\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/algorithms/intersection-of-two-linked-lists.go\"\u003eintersection-of-two-linked-lists.go\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/algorithms/binary-prefix-divisible-by-5.go\"\u003ebinary-prefix-divisible-by-5.go\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/algorithms/median-of-two-sorted-arrays.go\"\u003emedian-of-two-sorted-arrays.go\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/algorithms/min-stack.go\"\u003emin-stack.go\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/algorithms/linked-list-cycle.go\"\u003elinked-list-cycle.go\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/algorithms/single-number.go\"\u003esingle-number.go\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/algorithms/best-time-to-buy-and-sell-stock.go\"\u003ebest-time-to-buy-and-sell-stock.go\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/algorithms/fibonacci-number.go\"\u003efibonacci-number.go\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/algorithms/longest-substring-without-repeating-characters.go\"\u003elongest-substring-without-repeating-characters.go\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/algorithms/binary-tree-level-order-traversal-ii.go\"\u003ebinary-tree-level-order-traversal-ii.go\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/algorithms/climbing-stairs.go\"\u003eclimbing-stairs.go\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/algorithms/maximum-depth-of-binary-tree.go\"\u003emaximum-depth-of-binary-tree.go\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/algorithms/symmetric-tree.go\"\u003esymmetric-tree.go\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/algorithms/same-tree.go\"\u003esame-tree.go\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/algorithms/merge-sorted-array.go\"\u003emerge-sorted-array.go\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/algorithms/remove-duplicates-from-sorted-list-ii.go\"\u003eremove-duplicates-from-sorted-list-ii.go\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/algorithms/remove-duplicates-from-sorted-list.go\"\u003eremove-duplicates-from-sorted-list.go\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/algorithms/add-two-numbers.go\"\u003eadd-two-numbers.go\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/algorithms/valid-perfect-square.go\"\u003evalid-perfect-square.go\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/algorithms/sqrtx.go\"\u003esqrtx.go\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/algorithms/add-binary.go\"\u003eadd-binary.go\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/algorithms/valid-parentheses.go\"\u003evalid-parentheses.go\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/algorithms/two-sum.go\"\u003etwo-sum.go\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/algorithms/search-insert-position.go\"\u003esearch-insert-position.go\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/algorithms/roman-to-integer.go\"\u003eroman-to-integer.go\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/algorithms/reverse-integer.go\"\u003ereverse-integer.go\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/algorithms/remove-element.go\"\u003eremove-element.go\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/algorithms/remove-duplicates-from-sorted-array.go\"\u003eremove-duplicates-from-sorted-array.go\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/algorithms/reformat-the-string.go\"\u003ereformat-the-string.go\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/algorithms/plus-one.go\"\u003eplus-one.go\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/algorithms/palindrome-number.go\"\u003epalindrome-number.go\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/algorithms/merge-two-sorted-lists.go\"\u003emerge-two-sorted-lists.go\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/algorithms/maximum-subarray.go\"\u003emaximum-subarray.go\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/algorithms/longest-common-prefix.go\"\u003elongest-common-prefix.go\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/algorithms/length-of-last-word.go\"\u003elength-of-last-word.go\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/algorithms/implement-strstr.go\"\u003eimplement-strstr.go\u003c/a\u003e\u003cbr\u003e\n│   └── \u003ca href=\"/algorithms/count-and-say.go\"\u003ecount-and-say.go\u003c/a\u003e\u003cbr\u003e\n├── \u003ca href=\"/database/\"\u003edatabase\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/database/classes-more-than-5-students.sql\"\u003eclasses-more-than-5-students.sql\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/database/big-countries.sql\"\u003ebig-countries.sql\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/database/rising-temperature.sql\"\u003erising-temperature.sql\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/database/customers-who-never-order.sql\"\u003ecustomers-who-never-order.sql\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/database/duplicate-emails.sql\"\u003eduplicate-emails.sql\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/database/nth-highest-salary.sql\"\u003enth-highest-salary.sql\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/database/delete-duplicate-emails.sql\"\u003edelete-duplicate-emails.sql\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/database/employees-earning-more-than-their-managers.sql\"\u003eemployees-earning-more-than-their-managers.sql\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/database/second-highest-salary.sql\"\u003esecond-highest-salary.sql\u003c/a\u003e\u003cbr\u003e\n│   └── \u003ca href=\"/database/combine-two-tables.sql\"\u003ecombine-two-tables.sql\u003c/a\u003e\u003cbr\u003e\n├── \u003ca href=\"/shell/\"\u003eshell\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/shell/valid-phone-numbers.sh\"\u003evalid-phone-numbers.sh\u003c/a\u003e\u003cbr\u003e\n│   └── \u003ca href=\"/shell/tenth-line.sh\"\u003etenth-line.sh\u003c/a\u003e\u003cbr\u003e\n├── \u003ca href=\"/concurrency/\"\u003econcurrency\u003c/a\u003e\u003cbr\u003e\n│   ├── \u003ca href=\"/concurrency/print-foobar-alternately.py\"\u003eprint-foobar-alternately.py\u003c/a\u003e\u003cbr\u003e\n│   └── \u003ca href=\"/concurrency/print-in-order.py\"\u003eprint-in-order.py\u003c/a\u003e\u003cbr\u003e\n└── \u003ca href=\"/README.md\"\u003eREADME.md\u003c/a\u003e","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsreejeet%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsreejeet%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsreejeet%2Fleetcode/lists"}