{"id":15487092,"url":"https://github.com/theodesp/go-leetcode","last_synced_at":"2025-09-09T18:16:44.988Z","repository":{"id":97066534,"uuid":"169153296","full_name":"theodesp/go-leetcode","owner":"theodesp","description":"Solutions and implementations of Leetcode problems in Go.","archived":false,"fork":false,"pushed_at":"2019-10-23T20:36:15.000Z","size":135,"stargazers_count":5,"open_issues_count":0,"forks_count":1,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-04-22T17:50:39.204Z","etag":null,"topics":["go","leetcode"],"latest_commit_sha":null,"homepage":null,"language":"Go","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/theodesp.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE.md","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":"2019-02-04T21:33:33.000Z","updated_at":"2021-05-06T08:46:00.000Z","dependencies_parsed_at":"2023-04-22T21:13:14.987Z","dependency_job_id":null,"html_url":"https://github.com/theodesp/go-leetcode","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/theodesp/go-leetcode","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/theodesp%2Fgo-leetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/theodesp%2Fgo-leetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/theodesp%2Fgo-leetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/theodesp%2Fgo-leetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/theodesp","download_url":"https://codeload.github.com/theodesp/go-leetcode/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/theodesp%2Fgo-leetcode/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":274340841,"owners_count":25267295,"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","status":"online","status_checked_at":"2025-09-09T02:00:10.223Z","response_time":80,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"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":["go","leetcode"],"created_at":"2024-10-02T06:21:16.065Z","updated_at":"2025-09-09T18:16:44.957Z","avatar_url":"https://github.com/theodesp.png","language":"Go","funding_links":[],"categories":[],"sub_categories":[],"readme":"[![GolangCI](https://golangci.com/badges/github.com/golangci/golangci-lint.svg)](https://golangci.com/r/github.com/theodesp/go-leetcode)\n\ngo-leetcode\n---\nSolutions and implementations of Leetcode problems in Go.\nMay the code be with you.\n\n## Challenges completed\n\n- [x] **Tries**: [Link](https://leetcode.com/explore/learn/card/trie/150/introduction-to-trie/)\n    - [x] : Trie Representation\n    - [x] : Trie Operations\n    - [x] : Map Sum\n    - [x] : ReplaceWords\n    - [x] : AddSearch\n    - [x] : FindMaximumXOR\n    - [x] : WordSearch\n    \n- [x] **Binary Search**: [Link](https://leetcode.com/explore/learn/card/binary-search/138/background/)\n    - [x] : Binary Search\n    - [x] : Sqrt\n    - [x] : SearchRotated\n    - [x] : FindPeakElement\n    - [x] : FindMinInRotatedArray\n    - [x] : SearchRange\n    - [x] : Find K Closest Elements\n    - [x] : Pow\n    - [x] : IsPerfectSquare\n    - [x] : NextGreatestLetter\n    - [x] : FindMin\n    - [x] : ArrayIntersection\n    - [x] : ArrayIntersection2\n    - [x] : TwoSum\n    - [x] : FindDuplicateNumber\n    - [x] : FindMedianSortedArrays\n    - [x] : Find K-th Smallest Pair Distance\n    - [x] : Split Array Largest Sum\n    - [x] : Find Peak Element 2d\n    \n- [] **List**:\n    - [x] : Reverse a Linked List\n    - [x] : Find Middle Element\n    - [x] : Remove Duplicates from Unsorted/Sorted List\n    - [x] : Linked List Implementation\n    - [x] : Double Linked List Implementation\n    \n- [] **Array**:\n    - [x] : Find common elements in K sorted arrays\n    - [x] : Pascals Triangle\n    - [x] : Array permutations\n    - [x] : Find kth largest/smallest element in unsorted list\n    - [x] : K-th Element of Two Sorted Arrays\n    \n- [x] **Stack**:\n    - [x] : Implement Stack using Queue\n    - [x] : Sort Stack using temp stack\n    \n- [x] **Queue**:\n    - [x] : Implement Queue using Stack\n\n- [x] **Heap**:\n    - [x] : Implement a MinHeap\n\n- [x] **Searching**:\n    - [x] : Rabin-Karp Searching\n    \n- [x] **Graph**:\n    - [x] : Implement an UndirectedGraph\n    - [x] : Implement an DirectedGraph\n    - [x] : BFS\n    - [x] : DFS\n    - [x] : Topological sort\n\n- [x] **Cache**:\n    - [x] : Implement LFU Cache using Double List\n    - [x] : Implement LRU Cache using Double List\n     \n- [] **Tree**:\n    - [x] : Reverse a Binary Tree\n    - [x] : Preorder Traversal\n    - [x] : Inorder Traversal\n    - [x] : Postorder Traversal\n    - [x] : Levelorder Traversal\n    - [x] : Binary Search Tree Delete\n    - [x] : Binary Search Tree Search\n    - [x] : Binary Search Tree Lowest Common Ancestor\n    - [x] : Binary Search Tree Print nodes K distance from root\n    - [x] : Binary Search Tree Subtree of Another Tree\n    - [x] : Binary Search Tree Trees are mirror\n\n- [x] **Hash Table**:\n    - [x] : Hash table Implementation\n    \n- [x] **Sorting**:\n    - [x] : Counting Sort\n    - [x] : Radix Sort\n    - [x] : Merge Sort\n \n- [x] **Dynamic Programming**:\n    - [x] : Fibonacci Dynamic\n    - [x] : Knapsack\n    \n- [] **Uncategorized**:\n    - [x] : Add two numbers\n    - [x] : Length Of Longest Substring\n    - [x] : Defanging an IP Address\n    - [x] : First Unique Character in a String\n    - [x] : Longest prefix which is also suffix\n    - [x] : Best time to buy and sell stock - With explanation\n    - [x] : Add binary - With explanation\n    - [x] : Two Sum - With explanation\n    - [x] : Valid Palindrome\n    - [x] : Subarray Sum Equals K\n    - [x] : Check string chars can be rearranged to form palindrome\n\n## LICENCE\nCopyright © 2019 Theo Despoudis MIT license\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftheodesp%2Fgo-leetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ftheodesp%2Fgo-leetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftheodesp%2Fgo-leetcode/lists"}