{"id":37144699,"url":"https://github.com/txfs19260817/leetcode-go","last_synced_at":"2026-01-14T16:59:07.652Z","repository":{"id":45959038,"uuid":"329824439","full_name":"txfs19260817/LeetCode-Go","owner":"txfs19260817","description":null,"archived":false,"fork":false,"pushed_at":"2026-01-11T01:19:37.000Z","size":17839,"stargazers_count":2,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2026-01-11T01:34:33.012Z","etag":null,"topics":["gitbook","go","leetcode"],"latest_commit_sha":null,"homepage":"https://txfs19260817.gitbook.io/leetcode-go-notes/","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/txfs19260817.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,"notice":null,"maintainers":null,"copyright":null,"agents":null,"dco":null,"cla":null}},"created_at":"2021-01-15T06:08:25.000Z","updated_at":"2026-01-04T03:47:04.000Z","dependencies_parsed_at":"2024-06-21T15:36:55.101Z","dependency_job_id":null,"html_url":"https://github.com/txfs19260817/LeetCode-Go","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/txfs19260817/LeetCode-Go","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/txfs19260817%2FLeetCode-Go","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/txfs19260817%2FLeetCode-Go/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/txfs19260817%2FLeetCode-Go/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/txfs19260817%2FLeetCode-Go/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/txfs19260817","download_url":"https://codeload.github.com/txfs19260817/LeetCode-Go/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/txfs19260817%2FLeetCode-Go/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":28427175,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-01-14T16:38:47.836Z","status":"ssl_error","status_checked_at":"2026-01-14T16:34:59.695Z","response_time":107,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.5: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":["gitbook","go","leetcode"],"created_at":"2026-01-14T16:59:06.785Z","updated_at":"2026-01-14T16:59:07.644Z","avatar_url":"https://github.com/txfs19260817.png","language":"Go","funding_links":[],"categories":[],"sub_categories":[],"readme":"# LeetCode-Go-Notes\n\n[![codecov](https://codecov.io/gh/txfs19260817/LeetCode-Go/branch/master/graph/badge.svg?token=49SB7LBG5P)](https://codecov.io/gh/txfs19260817/LeetCode-Go)\n[![Go Test](https://github.com/txfs19260817/LeetCode-Go/actions/workflows/go.yml/badge.svg?branch=master)](https://github.com/txfs19260817/LeetCode-Go/actions/workflows/go.yml)\n\n## Index\n\n### Array\n\n| No. | Title | Solution | Difficulty |\n| :--- | :--- | :--- | :--- |\n| 0031 | Next Permutation | [Go](solutions/31.-next-permutation.md) | Medium |\n| 0048 | Rotate Image | [Go](solutions/48.-rotate-image.md) | Medium |\n| 0073 | Set Matrix Zeroes | [Go](solutions/73.-set-matrix-zeroes.md) | Medium |\n| 0240 | Search a 2D Matrix II | [Go](solutions/240.-search-a-2d-matrix-ii.md) | Medium |\n| 0243 | Shortest Word Distance | [Go](solutions/243.-shortest-word-distance.md) | Easy |\n| 0245 | Shortest Word Distance III | [Go](solutions/245.-shortest-word-distance-iii.md) | Medium |\n| 0645 | Set Mismatch | [Go](solutions/645.-set-mismatch.md) | Easy |\n| 0667 | Beautiful Arrangement II | [Go](solutions/667.-beautiful-arrangement-ii.md) | Medium |\n| 1460 | Make Two Arrays Equal by Reversing Sub-arrays | [Go](solutions/1460.-make-two-arrays-equal-by-reversing-sub-arrays.md) | Easy |\n| 1539 | Kth Missing Positive Number | [Go](solutions/1539.-kth-missing-positive-number.md) | Easy |\n\n### Backtracking\n\n| No. | Title | Solution | Difficulty |\n| :--- | :--- | :--- | :--- |\n| 0131 | Palindrome Partitioning | [Go](solutions/131.-palindrome-partitioning.md) | Medium |\n| 0403 | Frog Jump | [Go](solutions/403.-frog-jump.md) | Hard |\n| 0784 | Letter Case Permutation | [Go](solutions/784.-letter-case-permutation.md) | Medium |\n| 1302 | Deepest Leaves Sum | [Go](solutions/1302.-deepest-leaves-sum.md) | Medium |\n| 1723 | Find Minimum Time to Finish All Jobs | [Go](solutions/1723.-find-minimum-time-to-finish-all-jobs.md) | Hard |\n\n### Binary Search\n\n| No. | Title | Solution | Difficulty |\n| :--- | :--- | :--- | :--- |\n| 0034 | Find First and Last Position of Element in Sorted Array | [Go](solutions/34.-find-first-and-last-position-of-element-in-sorted-array.md) | Medium |\n| 0069 | Sqrt\\(x\\) | [Go](solutions/69.-sqrt-x.md) | Easy |\n| 0074 | Search a 2D Matrix | [Go](solutions/74.-search-a-2d-matrix.md) | Medium |\n| 0153 | Find Minimum in Rotated Sorted Array | [Go](solutions/153.-find-minimum-in-rotated-sorted-array.md) | Medium |\n| 0154 | Find Minimum in Rotated Sorted Array II | [Go](solutions/154.-find-minimum-in-rotated-sorted-array-ii.md) | Hard |\n| 0367 | Valid Perfect Square | [Go](solutions/367.-valid-perfect-square.md) | Easy |\n| 0410 | Split Array Largest Sum | [Go](solutions/410.-split-array-largest-sum.md) | Hard |\n| 0436 | Find Right Interval | [Go](solutions/436.-find-right-interval.md) | Medium |\n| 1011 | Capacity To Ship Packages Within D Days | [Go](solutions/1011.-capacity-to-ship-packages-within-d-days.md) | Medium |\n| 1482 | Minimum Number of Days to Make m Bouquets | [Go](solutions/1482.-minimum-number-of-days-to-make-m-bouquets.md) | Medium |\n\n### Bit Manipulation\n\n| No. | Title | Solution | Difficulty |\n| :--- | :--- | :--- | :--- |\n| 0187 | Repeated DNA Sequences | [Go](solutions/187.-repeated-dna-sequences.md) | Medium |\n| 0231 | Power of Two | [Go](solutions/231.-power-of-two.md) | Easy |\n| 0320 | Generalized Abbreviation | [Go](solutions/320.-generalized-abbreviation.md) | Medium |\n| 0326 | Power of Three | [Go](solutions/326.-power-of-three.md) | Easy |\n| 0342 | Power of Four | [Go](solutions/342.-power-of-four.md) | Easy |\n| 0461 | Hamming Distance | [Go](solutions/461.-hamming-distance.md) | Easy |\n| 0477 | Total Hamming Distance | [Go](solutions/477.-total-hamming-distance.md) | Medium |\n| 0810 | Chalkboard XOR Game | [Go](solutions/810.-chalkboard-xor-game.md) | Hard |\n| 1310 | XOR Queries of a Subarray | [Go](solutions/1310.-xor-queries-of-a-subarray.md) | Medium |\n| 1318 | Minimum Flips to Make a OR b Equal to c | [Go](solutions/1318.-minimum-flips-to-make-a-or-b-equal-to-c.md) | Medium |\n| 1442 | Count Triplets That Can Form Two Arrays of Equal XOR | [Go](solutions/1442.-count-triplets-that-can-form-two-arrays-of-equal-xor.md) | Medium |\n| 1486 | XOR Operation in an Array | [Go](solutions/1486.-xor-operation-in-an-array.md) | Easy |\n| 1707 | Maximum XOR With an Element From Array | [Go](solutions/1707.-maximum-xor-with-an-element-from-array.md) | Hard |\n| 1720 | Decode XORed Array | [Go](solutions/1720.-decode-xored-array.md) | Easy |\n| 1734 | Decode XORed Permutation | [Go](solutions/1734.-decode-xored-permutation.md) | Medium |\n| 1738 | Find Kth Largest XOR Coordinate Value | [Go](solutions/1738.-find-kth-largest-xor-coordinate-value.md) | Medium |\n\n### Design\n\n| No. | Title | Solution | Difficulty |\n| :--- | :--- | :--- | :--- |\n| 0146 | LRU Cache | [Go](solutions/146.-lru-cache.md) | Medium |\n| 0225 | Implement Stack using Queues | [Go](solutions/225.-implement-stack-using-queues.md) | Easy |\n| 0232 | Implement Queue using Stacks | [Go](solutions/232.-implement-queue-using-stacks.md) | Easy |\n| 0244 | Shortest Word Distance II | [Go](solutions/244.-shortest-word-distance-ii.md) | Medium |\n| 0460 | LFU Cache | [Go](solutions/460.-lfu-cache.md) | Hard |\n\n### Dynamic Programming\n\n| No. | Title | Solution | Difficulty |\n| :--- | :--- | :--- | :--- |\n| 0087 | Scramble String | [Go](solutions/87.-scramble-string.md) | Hard |\n| 0091 | Decode Ways | [Go](solutions/91.-decode-ways.md) | Medium |\n| 0097 | Interleaving String | [Go](solutions/97.-interleaving-string.md) | Medium |\n| 0132 | Palindrome Partitioning II | [Go](solutions/132.-palindrome-partitioning-ii.md) | Hard |\n| 0303 | Range Sum Query - Immutable | [Go](solutions/303.-range-sum-query-immutable.md) | Easy |\n| 0304 | Range Sum Query 2D - Immutable | [Go](solutions/304.-range-sum-query-2d-immutable.md) | Medium |\n| 0329 | Longest Increasing Path in a Matrix | [Go](solutions/329.-longest-increasing-path-in-a-matrix.md) | Hard |\n| 0368 | Largest Divisible Subset | [Go](solutions/368.-largest-divisible-subset.md) | Medium |\n| 0377 | Combination Sum IV | [Go](solutions/377.-combination-sum-iv.md) | Medium |\n| 0474 | Ones and Zeroes | [Go](solutions/474.-ones-and-zeroes.md) | Medium |\n| 0494 | Target Sum | [Go](solutions/494.-target-sum.md) | Medium |\n| 0583 | Delete Operation for Two Strings | [Go](solutions/583.-delete-operation-for-two-strings.md) | Medium |\n| 0664 | Strange Printer | [Go](solutions/664.-strange-printer.md) | Hard |\n| 1035 | Uncrossed Lines | [Go](solutions/1035.-uncrossed-lines.md) | Medium |\n| 1139 | Largest 1-Bordered Square | [Go](solutions/1139.-largest-1-bordered-square.md) | Medium |\n| 1143 | Longest Common Subsequence | [Go](solutions/1143.-longest-common-subsequence.md) | Medium |\n| 1269 | Number of Ways to Stay in the Same Place After Some Steps | [Go](solutions/1269.-number-of-ways-to-stay-in-the-same-place-after-some-steps.md) | Hard |\n\n### Greedy\n\n| No. | Title | Solution | Difficulty |\n| :--- | :--- | :--- | :--- |\n| 0045 | Jump Game II | [Go](solutions/45.-jump-game-ii.md) | Medium |\n| 0135 | Candy | [Go](solutions/135.-candy.md) | Hard |\n| 0435 | Non-overlapping Intervals | [Go](solutions/435.-non-overlapping-intervals.md) | Medium |\n| 0455 | Assign Cookies | [Go](solutions/455.-assign-cookies.md) | Easy |\n| 0936 | Stamping The Sequence | [Go](solutions/936.-stamping-the-sequence.md) | Hard |\n\n### Hash Table\n\n| No. | Title | Solution | Difficulty |\n| :--- | :--- | :--- | :--- |\n| 0001 | Two Sum | [Go](solutions/1.-two-sum.md) | Easy |\n| 0036 | Valid Sudoku | [Go](solutions/36.-valid-sudoku.md) | Medium |\n| 0049 | Group Anagrams | [Go](solutions/49.-group-anagrams.md) | Medium |\n| 0205 | Isomorphic Strings | [Go](solutions/205.-isomorphic-strings.md) | Easy |\n| 0217 | Contains Duplicate | [Go](solutions/217.-contains-duplicate.md) | Easy |\n| 0219 | Contains Duplicate II | [Go](solutions/219.-contains-duplicate-ii.md) | Easy |\n| 0290 | Word Pattern | [Go](solutions/290.-word-pattern.md) | Easy |\n| 0325 | Maximum Size Subarray Sum Equals k | [Go](solutions/325.-maximum-size-subarray-sum-equals-k.md) | Medium |\n| 0525 | Contiguous Array | [Go](solutions/525.-contiguous-array.md) | Medium |\n| 0554 | Brick Wall | [Go](solutions/554.-brick-wall.md) | Medium |\n| 0560 | Subarray Sum Equals K | [Go](solutions/560.-subarray-sum-equals-k.md) | Medium |\n| 0575 | Distribute Candies | [Go](solutions/575.-distribute-candies.md) | Easy |\n| 0690 | Employee Importance | [Go](solutions/690.-employee-importance.md) | Easy |\n| 0692 | Top K Frequent Words | [Go](solutions/692.-top-k-frequent-words.md) | Medium |\n| 0953 | Verifying an Alien Dictionary | [Go](solutions/953.-verifying-an-alien-dictionary.md) | Easy |\n| 1074 | Number of Submatrices That Sum to Target | [Go](solutions/1074.-number-of-submatrices-that-sum-to-target.md) | Hard |\n| 1640 | Check Array Formation Through Concatenation | [Go](solutions/1640.-check-array-formation-through-concatenation.md) | Easy |\n\n### Heap\n\n| No. | Title | Solution | Difficulty |\n| :--- | :--- | :--- | :--- |\n| 0215 | Kth Largest Element in an Array | [Go](solutions/215.-kth-largest-element-in-an-array.md) | Medium |\n| 0347 | Top K Frequent Elements | [Go](solutions/347.-top-k-frequent-elements.md) | Medium |\n| 0703 | Kth Largest Element in a Stream | [Go](solutions/703.-kth-largest-element-in-a-stream.md) | Easy |\n\n### Linked List\n\n| No. | Title | Solution | Difficulty |\n| :--- | :--- | :--- | :--- |\n| 0002 | Add Two Numbers | [Go](solutions/2.-add-two-numbers.md) | Medium |\n| 0021 | Merge Two Sorted Lists | [Go](solutions/21.-merge-two-sorted-lists.md) | Easy |\n| 0082 | Remove Duplicates from Sorted List II | [Go](solutions/82.-remove-duplicates-from-sorted-list-ii.md) | Medium |\n| 0083 | Remove Duplicates from Sorted List | [Go](solutions/83.-remove-duplicates-from-sorted-list.md) | Easy |\n| 0445 | Add Two Numbers II | [Go](solutions/445.-add-two-numbers-ii.md) | Medium |\n| 1721 | Swapping Nodes in a Linked List | [Go](solutions/1721.-swapping-nodes-in-a-linked-list.md) | Medium |\n\n### Math\n\n| No. | Title | Solution | Difficulty |\n| :--- | :--- | :--- | :--- |\n| 0007 | Reverse Integer | [Go](solutions/7.-reverse-integer.md) | Easy |\n| 0029 | Divide Two Integers | [Go](solutions/29.-divide-two-integers.md) | Medium |\n| 0043 | Multiply Strings | [Go](solutions/43.-multiply-strings.md) | Medium |\n| 0066 | Plus One | [Go](solutions/66.-plus-one.md) | Easy |\n| 0067 | Add Binary | [Go](solutions/67.-add-binary.md) | Easy |\n| 0204 | Count Primes | [Go](solutions/204.-count-primes.md) | Easy |\n| 0263 | Ugly Number | [Go](solutions/263.-ugly-number.md) | Easy |\n| 0264 | Ugly Number II | [Go](solutions/264.-ugly-number-ii.md) | Medium |\n| 0470 | Implement Rand10\\(\\) Using Rand7\\(\\) | [Go](solutions/470.-implement-rand10-using-rand7.md) | Medium |\n| 0523 | Continuous Subarray Sum | [Go](solutions/523.-continuous-subarray-sum.md) | Medium |\n| 0781 | Rabbits in Forest | [Go](solutions/781.-rabbits-in-forest.md) | Medium |\n| 1006 | Clumsy Factorial | [Go](solutions/1006.-clumsy-factorial.md) | Medium |\n| 1551 | Minimum Operations to Make Array Equal | [Go](solutions/1551.-minimum-operations-to-make-array-equal.md) | Medium |\n| 1744 | Can You Eat Your Favorite Candy on Your Favorite Day? | [Go](solutions/1744.-can-you-eat-your-favorite-candy-on-your-favorite-day.md) | Medium |\n\n### Sort\n\n| No. | Title | Solution | Difficulty |\n| :--- | :--- | :--- | :--- |\n| 0220 | Contains Duplicate III | [Go](solutions/220.-contains-duplicate-iii.md) | Medium |\n\n### Stack\n\n| No. | Title | Solution | Difficulty |\n| :--- | :--- | :--- | :--- |\n| 0020 | Valid Parentheses | [Go](solutions/20.-valid-parentheses.md) | Easy |\n| 0084 | Largest Rectangle in Histogram | [Go](solutions/84.-largest-rectangle-in-histogram.md) | Hard |\n| 0150 | Evaluate Reverse Polish Notation | [Go](solutions/150.-evaluate-reverse-polish-notation.md) | Medium |\n| 0155 | Min Stack | [Go](solutions/155.-min-stack.md) | Easy |\n| 0456 | 132 Pattern  | [Go](solutions/456.-132-pattern.md) | Medium |\n| 1190 | Reverse Substrings Between Each Pair of Parentheses | [Go](solutions/1190.-reverse-substrings-between-each-pair-of-parentheses.md) | Medium |\n\n### String\n\n| No. | Title | Solution | Difficulty |\n| :--- | :--- | :--- | :--- |\n| 0012 | Integer to Roman | [Go](solutions/12.-integer-to-roman.md) | Medium |\n| 0013 | Roman to Integer | [Go](solutions/13.-roman-to-integer.md) | Easy |\n| 0032 | Longest Valid Parentheses | [Go](solutions/32.-longest-valid-parentheses.md) | Hard |\n| 0038 | Count and Say | [Go](solutions/38.-count-and-say.md) | Easy |\n| 0415 | Add Strings | [Go](solutions/415.-add-strings.md) | Easy |\n| 1332 | Remove Palindromic Subsequences | [Go](solutions/1332.-remove-palindromic-subsequences.md) | Easy |\n| 1614 | Maximum Nesting Depth of the Parentheses | [Go](solutions/1614.-maximum-nesting-depth-of-the-parentheses.md) | Easy |\n| 1704 | Determine if String Halves Are Alike | [Go](solutions/1704.-determine-if-string-halves-are-alike.md) | Easy |\n| 1796 | Second Largest Digit in a String | [Go](solutions/1796.-second-largest-digit-in-a-string.md) | Easy |\n\n### Tree\n\n| No. | Title | Solution | Difficulty |\n| :--- | :--- | :--- | :--- |\n| 0116 | Populating Next Right Pointers in Each Node | [Go](solutions/116.-populating-next-right-pointers-in-each-node.md) | Medium |\n| 0117 | Populating Next Right Pointers in Each Node II | [Go](solutions/117.-populating-next-right-pointers-in-each-node-ii.md) | Medium |\n| 0208 | Implement Trie \\(Prefix Tree\\) | [Go](solutions/208.-implement-trie-prefix-tree.md) | Medium |\n| 0331 | Verify Preorder Serialization of a Binary Tree | [Go](solutions/331.-verify-preorder-serialization-of-a-binary-tree.md) | Medium |\n| 0440 | K-th Smallest in Lexicographical Order | [Go](solutions/440.-k-th-smallest-in-lexicographical-order.md) | Hard |\n| 0450 | Delete Node in a BST | [Go](solutions/450.-delete-node-in-a-bst.md) | Medium |\n| 0623 | Add One Row to Tree | [Go](solutions/623.-add-one-row-to-tree.md) | Medium |\n| 0654 | Maximum Binary Tree | [Go](solutions/654.-maximum-binary-tree.md) | Medium |\n| 0872 | Leaf-Similar Trees | [Go](solutions/872.-leaf-similar-trees.md) | Easy |\n| 0897 | Increasing Order Search Tree | [Go](solutions/897.-increasing-order-search-tree.md) | Easy |\n| 0938 | Range Sum of BST | [Go](solutions/938.-range-sum-of-bst.md) | Easy |\n| 1469 | Find All The Lonely Nodes | [Go](solutions/1469.-find-all-the-lonely-nodes.md) | Easy |\n\n### Two Pointers\n\n| No. | Title | Solution | Difficulty |\n| :--- | :--- | :--- | :--- |\n| 0026 | Remove Duplicates from Sorted Array | [Go](solutions/26.-remove-duplicates-from-sorted-array.md) | Easy |\n| 0080 | Remove Duplicates from Sorted Array II | [Go](solutions/80.-remove-duplicates-from-sorted-array-ii.md) | Medium |\n| 0088 | Merge Sorted Array | [Go](solutions/88.-merge-sorted-array.md) | Easy |\n| 0202 | Happy Number | [Go](solutions/202.-happy-number.md) | Easy |\n| 0633 | Sum of Square Numbers | [Go](solutions/633.-sum-of-square-numbers.md) | Medium |\n| 0881 | Boats to Save People | [Go](solutions/881.-boats-to-save-people.md) | Medium |\n\n## Reference\n\n1. [https://books.halfrost.com/leetcode](https://books.halfrost.com/leetcode)\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftxfs19260817%2Fleetcode-go","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ftxfs19260817%2Fleetcode-go","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftxfs19260817%2Fleetcode-go/lists"}