{"id":18452400,"url":"https://github.com/tmzane/leetcode","last_synced_at":"2025-04-20T01:51:33.317Z","repository":{"id":132889643,"uuid":"494539661","full_name":"tmzane/leetcode","owner":"tmzane","description":"✍️ My LeetCode solutions written in Go","archived":false,"fork":false,"pushed_at":"2024-03-28T13:48:11.000Z","size":88,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-04-11T17:52:59.224Z","etag":null,"topics":["algorithms","data-structures","go","leetcode"],"latest_commit_sha":null,"homepage":"","language":"Go","has_issues":false,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mpl-2.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/tmzane.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","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}},"created_at":"2022-05-20T16:44:01.000Z","updated_at":"2024-03-18T17:12:20.000Z","dependencies_parsed_at":"2024-04-03T02:37:58.805Z","dependency_job_id":null,"html_url":"https://github.com/tmzane/leetcode","commit_stats":null,"previous_names":["junk1tm/leetcode"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tmzane%2Fleetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tmzane%2Fleetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tmzane%2Fleetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tmzane%2Fleetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/tmzane","download_url":"https://codeload.github.com/tmzane/leetcode/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":249565314,"owners_count":21292427,"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":["algorithms","data-structures","go","leetcode"],"created_at":"2024-11-06T07:31:06.814Z","updated_at":"2025-04-18T23:54:56.831Z","avatar_url":"https://github.com/tmzane.png","language":"Go","funding_links":[],"categories":[],"sub_categories":[],"readme":"# leetcode\n\n[![checks](https://github.com/tmzane/leetcode/actions/workflows/checks.yml/badge.svg)](https://github.com/tmzane/leetcode/actions/workflows/checks.yml)\n\nMy [LeetCode](https://leetcode.com) solutions written in Go.\n\n## Progress\n\n### Total\n\n| Easy | Medium | Hard |\n|:----:|:------:|:----:|\n|18|3|0|\n\n### Solutions\n\n|  #  | Title | Difficulty | Solution | Tests |\n|:---:|:------|:----------:|:--------:|:-----:|\n|1|[Two Sum](https://leetcode.com/problems/two-sum)|Easy|[👀](0001_two_sum.go)|[✅](solutions_test.go#L12)|\n|2|[Add Two Numbers](https://leetcode.com/problems/add-two-numbers)|Medium|[👀](0002_add_two_numbers.go)|[✅](solutions_test.go#L32)|\n|3|[Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters)|Medium|[👀](0003_longest_substring_without_repeating_characters.go)|[✅](solutions_test.go#L54)|\n|9|[Palindrome Number](https://leetcode.com/problems/palindrome-number)|Easy|[👀](0009_palindrom_number.go)|[✅](solutions_test.go#L73)|\n|13|[Roman to Integer](https://leetcode.com/problems/roman-to-integer)|Easy|[👀](0013_roman_to_integer.go)|[✅](solutions_test.go#L92)|\n|14|[Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix)|Easy|[👀](0014_longest_common_prefix.go)|[✅](solutions_test.go#L111)|\n|20|[Valid Parentheses](https://leetcode.com/problems/valid-parentheses)|Easy|[👀](0020_valid_parentheses.go)|[✅](solutions_test.go#L129)|\n|21|[Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists)|Easy|[👀](0021_merge_two_sorted_lists.go)|[✅](solutions_test.go#L148)|\n|26|[Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array)|Easy|[👀](0026_remove_duplicates_from_sorted_array.go)|[✅](solutions_test.go#L170)|\n|27|[Remove Element](https://leetcode.com/problems/remove-element)|Easy|[👀](0027_remove_element.go)|[✅](solutions_test.go#L190)|\n|28|[Implement strStr()](https://leetcode.com/problems/implement-strstr/)|Easy|[👀](0028_implement_strstr.go)|[✅](solutions_test.go#L211)|\n|35|[Search Insert Position](https://leetcode.com/problems/search-insert-position)|Easy|[👀](0035_search_insert_position.go)|[✅](solutions_test.go#L230)|\n|53|[Maximum Subarray](https://leetcode.com/problems/maximum-subarray)|Easy|[👀](0053_maximum_subarray.go)|[✅](solutions_test.go#L250)|\n|58|[Length of Last Word](https://leetcode.com/problems/length-of-last-word)|Easy|[👀](0058_length_of_last_word.go)|[✅](solutions_test.go#L269)|\n|66|[Plus One](https://leetcode.com/problems/plus-one)|Easy|[👀](0066_plus_one.go)|[✅](solutions_test.go#L288)|\n|67|[Add Binary](https://leetcode.com/problems/add-binary)|Easy|[👀](0067_add_binary.go)|[✅](solutions_test.go#L307)|\n|69|[Sqrt(x)](https://leetcode.com/problems/sqrtx)|Easy|[👀](0069_sqrtx.go)|[✅](solutions_test.go#L326)|\n|70|[Climbing Stairs](https://leetcode.com/problems/climbing-stairs)|Easy|[👀](0070_climbing_stairs.go)|[✅](solutions_test.go#L344)|\n|83|[Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list)|Easy|[👀](0083_remove_duplicates_from_sorted_list.go)|[✅](solutions_test.go#L362)|\n|88|[Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array)|Easy|[👀](0088_merge_sorted_array.go)|[✅](solutions_test.go#L382)|\n|1769|[Minimum Number of Operations to Move All Balls to Each Box](https://leetcode.com/problems/minimum-number-of-operations-to-move-all-balls-to-each-box)|Medium|[👀](1769_minimum_number_of_operations_to_move_all_balls_to_each_box.go)|[✅](solutions_test.go#L403)|\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftmzane%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ftmzane%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftmzane%2Fleetcode/lists"}