{"id":17039717,"url":"https://github.com/digitalcrab/leetcode-problems-go","last_synced_at":"2025-07-13T10:33:42.741Z","repository":{"id":69359200,"uuid":"155448941","full_name":"digitalcrab/leetcode-problems-go","owner":"digitalcrab","description":"Problems from leetcode with solutions in Go","archived":false,"fork":false,"pushed_at":"2025-05-19T10:45:37.000Z","size":220,"stargazers_count":3,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-05-19T11:42:42.724Z","etag":null,"topics":["go","golang","leetcode","leetcode-golang","leetcode-solutions"],"latest_commit_sha":null,"homepage":null,"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/digitalcrab.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,"zenodo":null}},"created_at":"2018-10-30T20:04:33.000Z","updated_at":"2025-05-19T10:45:42.000Z","dependencies_parsed_at":null,"dependency_job_id":"d01a73e9-5c19-47f2-a15a-9e399881c7e0","html_url":"https://github.com/digitalcrab/leetcode-problems-go","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/digitalcrab/leetcode-problems-go","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/digitalcrab%2Fleetcode-problems-go","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/digitalcrab%2Fleetcode-problems-go/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/digitalcrab%2Fleetcode-problems-go/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/digitalcrab%2Fleetcode-problems-go/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/digitalcrab","download_url":"https://codeload.github.com/digitalcrab/leetcode-problems-go/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/digitalcrab%2Fleetcode-problems-go/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":265128593,"owners_count":23715624,"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":["go","golang","leetcode","leetcode-golang","leetcode-solutions"],"created_at":"2024-10-14T09:07:16.789Z","updated_at":"2025-07-13T10:33:42.727Z","avatar_url":"https://github.com/digitalcrab.png","language":"Go","funding_links":[],"categories":[],"sub_categories":[],"readme":"# LeetCode solutions in Go\n\n### Data structures implemented in golang\n\n1. Linked Lists (insertion, deletion, search, reverse):\n    - [x] Singly linked list\n    - [x] Doubly linked list\n2. Stacks (push, pop, peek):\n    - [x] Using arrays/slices\n    - [x] Using linked lists\n3. Queues:\n    - [x] Using arrays/slices\n    - [x] Using linked lists\n4. Hash Tables (insert, delete, search)\n    - [x] Basic implementation\n5. Trees (insertion, deletion, traversal: inorder, preorder, postorder):\n    - [x] Binary tree\n    - [x] Binary Search Tree (BST)\n    - [x] AVL tree (self-balancing)\n6. Heaps (insert, delete, extract-min/max):\n    - [x] Min-Heap\n    - [x] Max-Heap\n7. Graphs (add edge, remove edge, search: DFS, BFS):\n    - [ ] Adjacency matrix\n    - [ ] Adjacency list\n\n### Algorithms implemented in golang\n\n1. Sorting Algorithms:\n    - [ ] Bubble sort\n    - [ ] Selection sort\n    - [ ] Insertion sort\n    - [ ] Merge sort\n    - [ ] Quick sort\n    - [ ] Heap sort\n2. Searching Algorithms:\n    - [ ] Linear search\n    - [ ] Binary search\n3. Graph Algorithms:\n    - [ ] Depth-First Search (DFS)\n    - [ ] Breadth-First Search (BFS)\n    - [ ] Dijkstra’s algorithm (shortest path)\n    - [ ] Floyd-Warshall algorithm (all pairs shortest path)\n4. Dynamic Programming:\n    - [ ] Fibonacci sequence\n    - [ ] Longest Common Subsequence (LCS)\n    - [ ] Knapsack problem\n    - [ ] Coin change problem\n5. Backtracking:\n    - [ ] N-Queens problem\n    - [ ] Sudoku solver\n    - [ ] Subset sum problem\n\n### LeetCode Problems and solutions\n\n| Number | Title                                              | Difficulty | Solution                                                                                                                    |\n|-------:|:---------------------------------------------------|:----------:|:----------------------------------------------------------------------------------------------------------------------------|\n|      1 | Two Sum                                            |    Easy    | [two-sum](leetcode-solutions/two-sum)                                                                                       |\n|      3 | Longest Substring Without Repeating Characters     |   Medium   | [longest-substring-without-repeating-characters](leetcode-solutions/longest-substring-without-repeating-characters)         |\n|     12 | Integer to Roman                                   |   Medium   | [integer-to-roman](leetcode-solutions/integer-to-roman)                                                                     |\n|     13 | Roman to Integer                                   |    Easy    | [roman-to-integer](leetcode-solutions/roman-to-integer)                                                                     |\n|     14 | Longest Common Prefix                              |    Easy    | [longest-common-prefix](leetcode-solutions/longest-common-prefix)                                                           |\n|     19 | Remove Nth Node From End of List                   |   Medium   | [remove-nth-node-from-end-of-list](leetcode-solutions/remove-nth-node-from-end-of-list)                                     |\n|     20 | Valid Parentheses                                  |    Easy    | [valid-parentheses](leetcode-solutions/valid-parentheses)                                                                   |\n|     22 | Generate Parentheses                               |   Medium   | [generate-parentheses](leetcode-solutions/generate-parentheses)                                                             |\n|     26 | Remove Duplicates from Sorted Array                |    Easy    | [remove-duplicates-from-sorted-array](leetcode-solutions/remove-duplicates-from-sorted-array)                               |\n|     27 | Remove Element                                     |    Easy    | [remove-element](leetcode-solutions/remove-element)                                                                         |\n|     28 | Find the Index of the First Occurrence in a String |    Easy    | [find-the-index-of-the-first-occurrence-in-a-string](leetcode-solutions/find-the-index-of-the-first-occurrence-in-a-string) |\n|     36 | Valid Sudoku                                       |   Medium   | [valid-sudoku](leetcode-solutions/valid-sudoku)                                                                             |\n|     49 | Group Anagrams                                     |   Medium   | [group-anagrams](leetcode-solutions/group-anagrams)                                                                         |\n|     58 | Length of Last Word                                |    Easy    | [length-of-last-word](leetcode-solutions/length-of-last-word)                                                               |\n|     80 | Remove Duplicates from Sorted Array II             |   Medium   | [remove-duplicates-from-sorted-array-ii](leetcode-solutions/remove-duplicates-from-sorted-array-ii)                         |\n|     88 | Merge Sorted Array                                 |    Easy    | [merge-sorted-array](leetcode-solutions/merge-sorted-array)                                                                 |\n|    121 | Best Time to Buy and Sell Stock                    |    Easy    | [best-time-to-buy-and-sell-stock](leetcode-solutions/best-time-to-buy-and-sell-stock)                                       |\n|    122 | Best Time to Buy and Sell Stock II                 |   Medium   | [best-time-to-buy-and-sell-stock-ii](leetcode-solutions/best-time-to-buy-and-sell-stock-ii)                                 |\n|    125 | Valid Palindrome                                   |    Easy    | [valid-palindrome](leetcode-solutions/valid-palindrome)                                                                     |\n|    128 | Longest Consecutive Sequence                       |   Medium   | [longest-consecutive-sequence](leetcode-solutions/longest-consecutive-sequence)                                             |\n|    136 | Single Number                                      |    Easy    | [single-number](leetcode-solutions/single-number)                                                                           |\n|    141 | Linked List Cycle                                  |    Easy    | [linked-list-cycle](leetcode-solutions/linked-list-cycle)                                                                   |\n|    142 | Linked List Cycle II                               |   Medium   | [linked-list-cycle-ii](leetcode-solutions/linked-list-cycle-ii)                                                             |\n|    150 | Evaluate Reverse Polish Notation                   |   Medium   | [evaluate-reverse-polish-notation](leetcode-solutions/evaluate-reverse-polish-notation)                                     |\n|    155 | Min Stack                                          |   Medium   | [min-stack](leetcode-solutions/min-stack)                                                                                   |\n|    160 | Intersection of Two Linked Lists                   |    Easy    | [intersection-of-two-linked-lists](leetcode-solutions/intersection-of-two-linked-lists)                                     |\n|    169 | Majority Element                                   |    Easy    | [majority-element](leetcode-solutions/majority-element)                                                                     |\n|    170 | Two Sum III - Data structure design                |    Easy    | [two-sum-iii-data-structure-design](leetcode-solutions/two-sum-iii-data-structure-design)                                   |\n|    189 | Rotate Array                                       |   Medium   | [rotate-array](leetcode-solutions/rotate-array)                                                                             |\n|    202 | Happy Number                                       |    Easy    | [happy-number](leetcode-solutions/happy-number)                                                                             |\n|    205 | Isomorphic Strings                                 |    Easy    | [isomorphic-strings](leetcode-solutions/isomorphic-strings)                                                                 |\n|    217 | Contains Duplicate                                 |    Easy    | [contains-duplicate](leetcode-solutions/contains-duplicate)                                                                 |\n|    219 | Contains Duplicate II                              |    Easy    | [contains-duplicate-ii](leetcode-solutions/contains-duplicate-ii)                                                           |\n|    238 | Product of Array Except Self                       |   Medium   | [product-of-array-except-self](leetcode-solutions/product-of-array-except-self)                                             |\n|    242 | Valid Anagram                                      |    Easy    | [valid-anagram](leetcode-solutions/valid-anagram)                                                                           |\n|    249 | Group Shifted Strings                              |   Medium   | [group-shifted-strings](leetcode-solutions/group-shifted-strings)                                                           |\n|    271 | Encode and Decode Strings                          |   Medium   | [encode-and-decode-strings](leetcode-solutions/encode-and-decode-strings)                                                   |\n|    288 | Unique Word Abbreviation                           |   Medium   | [unique-word-abbreviation](leetcode-solutions/unique-word-abbreviation)                                                     |\n|    347 | Top K Frequent Elements                            |   Medium   | [top-k-frequent-elements](leetcode-solutions/top-k-frequent-elements)                                                       |\n|    350 | Intersection of Two Arrays II                      |    Easy    | [intersection-of-two-arrays-ii](leetcode-solutions/intersection-of-two-arrays-ii)                                           |\n|    359 | Logger Rate Limiter                                |    Easy    | [logger-rate-limiter](leetcode-solutions/logger-rate-limiter)                                                               |\n|    380 | Insert Delete GetRandom O(1)                       |   Medium   | [insert-delete-getrandom-o1](leetcode-solutions/insert-delete-getrandom-o1)                                                 |\n|    383 | Ransom Note                                        |    Easy    | [ransom-note](leetcode-solutions/ransom-note)                                                                               |\n|    387 | First Unique Character in a String                 |    Easy    | [first-unique-character-in-a-string](leetcode-solutions/first-unique-character-in-a-string)                                 |\n|    412 | Fizz Buzz                                          |    Easy    | [fizz-buzz](leetcode-solutions/fizz-buzz)                                                                                   |\n|    454 | 4Sum II                                            |   Medium   | [4sum-ii](leetcode-solutions/4sum-ii)                                                                                       |\n|    599 | Minimum Index Sum of Two Lists                     |    Easy    | [minimum-index-sum-of-two-lists](leetcode-solutions/minimum-index-sum-of-two-lists)                                         |\n|    652 | Find Duplicate Subtrees                            |   Medium   | [find-duplicate-subtrees](leetcode-solutions/find-duplicate-subtrees)                                                       |\n|    707 | Design Linked List                                 |   Medium   | [design-linked-list](leetcode-solutions/design-linked-list)                                                                 |\n|    739 | Daily Temperatures                                 |   Medium   | [daily-temperatures](leetcode-solutions/daily-temperatures)                                                                 |\n|    771 | Jewels and Stones                                  |    Easy    | [jewels-and-stones](leetcode-solutions/jewels-and-stones)                                                                   |\n|    876 | Middle of the Linked List                          |    Easy    | [middle-of-the-linked-list](leetcode-solutions/middle-of-the-linked-list)                                                   |\n|   1342 | Number of Steps to Reduce a Number to Zero         |    Easy    | [richest-customer-wealth](leetcode-solutions/richest-customer-wealth)                                                       |\n|   1480 | Running Sum of 1d Array                            |    Easy    | [running-sum-of-1d-array](leetcode-solutions/running-sum-of-1d-array)                                                       |\n|   1672 | Richest Customer Wealth                            |    Easy    | [richest-customer-wealth](leetcode-solutions/richest-customer-wealth)                                                       |\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdigitalcrab%2Fleetcode-problems-go","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fdigitalcrab%2Fleetcode-problems-go","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdigitalcrab%2Fleetcode-problems-go/lists"}