https://github.com/kakugirai/leetcode-go

LeetCode solutions primarily written in Go
https://github.com/kakugirai/leetcode-go
leetcode leetcode-golang
Last synced: 2 months ago
JSON representation
LeetCode solutions primarily written in Go
Host: GitHub
URL: https://github.com/kakugirai/leetcode-go
Owner: kakugirai
License: mit
Created: 2017-10-06T11:04:51.000Z (over 8 years ago)
Default Branch: master
Last Pushed: 2019-12-22T04:06:31.000Z (over 6 years ago)
Last Synced: 2024-06-19T06:55:57.727Z (almost 2 years ago)
Topics: leetcode, leetcode-golang
Language: Go
Homepage:
Size: 550 KB
Stars: 8
Watchers: 3
Forks: 3
Open Issues: 0
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project

README

          # leetcode-go

[![Go Report Card](https://goreportcard.com/badge/github.com/kakugirai/leetcode-go)](https://goreportcard.com/report/github.com/kakugirai/leetcode-go)

[![Build Status](https://travis-ci.org/kakugirai/leetcode-go.svg?branch=master)](https://travis-ci.org/kakugirai/leetcode-go)

My LeetCode solutions primarily written in Go.

Don't expect too much on those questions solved in other random languages.

## README Generator Usage

Copy the cookies from your browser and write them into a `cookies.json` file,

```

{

    "__cfduid": "",

    "_ga": "",

    "LEETCODE_SESSION": "",

    "_gid": "",

    "__stripe_mid": "",

    "c_a_u": ""

}

```

Run `readme-generator.py`. Here you ≡Go!

## My progress

| Solved | Easy | Medium | Hard |

| :----: | :--: | :----: | :--: |

|166|90|67|9|

## Solutions

| Question ID | Question | Difficulty | Solution |

| :---------: | -------- | :--------: | :------: |

|1|[Two Sum](https://leetcode.com/problems/two-sum)|Easy|[Go](src/two-sum/solution.go)|

|2|[Add Two Numbers](https://leetcode.com/problems/add-two-numbers)|Medium|[Go](src/add-two-numbers/solution.go)|

|3|[Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters)|Medium|[Go](src/longest-substring-without-repeating-characters/solution.go)|

|4|[Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays)|Hard|[Go](src/median-of-two-sorted-arrays/solution.go)|

|5|[Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring)|Medium|[Go](src/longest-palindromic-substring/solution.go)|

|7|[Reverse Integer](https://leetcode.com/problems/reverse-integer)|Easy|[Go](src/reverse-integer/solution.go)|

|9|[Palindrome Number](https://leetcode.com/problems/palindrome-number)|Easy|[Go](src/palindrome-number/solution.go)|

|11|[Container With Most Water](https://leetcode.com/problems/container-with-most-water)|Medium|[Go](src/container-with-most-water/solution.go)|

|12|[Integer to Roman](https://leetcode.com/problems/integer-to-roman)|Medium|[Go](src/integer-to-roman/solution.go)|

|13|[Roman to Integer](https://leetcode.com/problems/roman-to-integer)|Easy|[Go](src/roman-to-integer/solution.go)|

|14|[Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix)|Easy|[Go](src/longest-common-prefix/solution.go)|

|15|[3Sum](https://leetcode.com/problems/3sum)|Medium|[Go](src/3sum/solution.go)|

|17|[Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number)|Medium|[Go](src/letter-combinations-of-a-phone-number/solution.go)|

|19|[Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list)|Medium|[Go](src/remove-nth-node-from-end-of-list/solution.go), [Python](src/remove-nth-node-from-end-of-list/solution.py)|

|20|[Valid Parentheses](https://leetcode.com/problems/valid-parentheses)|Easy|[Go](src/valid-parentheses/solution.go)|

|21|[Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists)|Easy|[Go](src/merge-two-sorted-lists/solution.go)|

|22|[Generate Parentheses](https://leetcode.com/problems/generate-parentheses)|Medium|[Go](src/generate-parentheses/solution.go)|

|23|[Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists)|Hard|[Go](src/merge-k-sorted-lists/solution.go), [Java](src/merge-k-sorted-lists/solution.java)|

|24|[Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs)|Medium|[Go](src/swap-nodes-in-pairs/solution.go)|

|26|[Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array)|Easy|[Go](src/remove-duplicates-from-sorted-array/solution.go)|

|27|[Remove Element](https://leetcode.com/problems/remove-element)|Easy|[Go](src/remove-element/solution.go)|

|28|[Implement strStr()](https://leetcode.com/problems/implement-strstr)|Easy|[Go](src/implement-strstr/solution.go)|

|31|[Next Permutation](https://leetcode.com/problems/next-permutation)|Medium|[Go](src/next-permutation/solution.go)|

|33|[Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array)|Medium|[Go](src/search-in-rotated-sorted-array/solution.go)|

|34|[Find First and Last Position of Element in Sorted Array](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array)|Medium|[Go](src/find-first-and-last-position-of-element-in-sorted-array/solution.go)|

|35|[Search Insert Position](https://leetcode.com/problems/search-insert-position)|Easy|[Go](src/search-insert-position/solution.go)|

|36|[Valid Sudoku](https://leetcode.com/problems/valid-sudoku)|Medium|[Go](src/valid-sudoku/solution.go)|

|37|[Sudoku Solver](https://leetcode.com/problems/sudoku-solver)|Hard|[Go](src/sudoku-solver/solution.go)|

|38|[Count and Say](https://leetcode.com/problems/count-and-say)|Easy|[Go](src/count-and-say/solution.go)|

|39|[Combination Sum](https://leetcode.com/problems/combination-sum)|Medium|[Go](src/combination-sum/solution.go)|

|40|[Combination Sum II](https://leetcode.com/problems/combination-sum-ii)|Medium|[Go](src/combination-sum-ii/solution.go)|

|43|[Multiply Strings](https://leetcode.com/problems/multiply-strings)|Medium|[Go](src/multiply-strings/solution.go)|

|46|[Permutations](https://leetcode.com/problems/permutations)|Medium|[Go](src/permutations/solution.go)|

|48|[Rotate Image](https://leetcode.com/problems/rotate-image)|Medium|[Go](src/rotate-image/solution.go)|

|49|[Group Anagrams](https://leetcode.com/problems/group-anagrams)|Medium|[Go](src/group-anagrams/solution.go)|

|50|[Pow(x, n)](https://leetcode.com/problems/powx-n)|Medium|[Go](src/powx-n/solution.go)|

|51|[N-Queens](https://leetcode.com/problems/n-queens)|Hard|[Go](src/n-queens/solution.go)|

|52|[N-Queens II](https://leetcode.com/problems/n-queens-ii)|Hard|[Go](src/n-queens-ii/solution.go)|

|53|[Maximum Subarray](https://leetcode.com/problems/maximum-subarray)|Easy|[Go](src/maximum-subarray/solution.go)|

|55|[Jump Game](https://leetcode.com/problems/jump-game)|Medium|[Go](src/jump-game/solution.go)|

|62|[Unique Paths](https://leetcode.com/problems/unique-paths)|Medium|[Go](src/unique-paths/solution.go)|

|64|[Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum)|Medium|[Go](src/minimum-path-sum/solution.go)|

|66|[Plus One](https://leetcode.com/problems/plus-one)|Easy|[Go](src/plus-one/solution.go)|

|67|[Add Binary](https://leetcode.com/problems/add-binary)|Easy|[Go](src/add-binary/solution.go)|

|69|[Sqrt(x)](https://leetcode.com/problems/sqrtx)|Easy|[Go](src/sqrtx/solution.go)|

|70|[Climbing Stairs](https://leetcode.com/problems/climbing-stairs)|Easy|[Go](src/climbing-stairs/solution.go)|

|72|[Edit Distance](https://leetcode.com/problems/edit-distance)|Hard|[Go](src/edit-distance/solution.go)|

|73|[Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes)|Medium|[Go](src/set-matrix-zeroes/solution.go)|

|74|[Search a 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix)|Medium|[Go](src/search-a-2d-matrix/solution.go), [Python](src/search-a-2d-matrix/solution.py)|

|78|[Subsets](https://leetcode.com/problems/subsets)|Medium|[Go](src/subsets/solution.go)|

|79|[Word Search](https://leetcode.com/problems/word-search)|Medium|[Go](src/word-search/solution.go)|

|88|[Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array)|Easy|[Go](src/merge-sorted-array/solution.go)|

|91|[Decode Ways](https://leetcode.com/problems/decode-ways)|Medium|[Go](src/decode-ways/solution.go)|

|94|[Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal)|Medium|[Go](src/binary-tree-inorder-traversal/solution.go)|

|98|[Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree)|Medium|[Go](src/validate-binary-search-tree/solution.go)|

|100|[Same Tree](https://leetcode.com/problems/same-tree)|Easy|[Go](src/same-tree/solution.go)|

|101|[Symmetric Tree](https://leetcode.com/problems/symmetric-tree)|Easy|[Go](src/symmetric-tree/solution.go)|

|102|[Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal)|Medium|[Go](src/binary-tree-level-order-traversal/solution.go)|

|104|[Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree)|Easy|[Go](src/maximum-depth-of-binary-tree/solution.go)|

|108|[Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree)|Easy|[Go](src/convert-sorted-array-to-binary-search-tree/solution.go)|

|109|[Convert Sorted List to Binary Search Tree](https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree)|Medium|[Go](src/convert-sorted-list-to-binary-search-tree/solution.go)|

|110|[Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree)|Easy|[Go](src/balanced-binary-tree/solution.go)|

|112|[Path Sum](https://leetcode.com/problems/path-sum)|Easy|[Go](src/path-sum/solution.go)|

|113|[Path Sum II](https://leetcode.com/problems/path-sum-ii)|Medium|[Go](src/path-sum-ii/solution.go)|

|114|[Flatten Binary Tree to Linked List](https://leetcode.com/problems/flatten-binary-tree-to-linked-list)|Medium|[Go](src/flatten-binary-tree-to-linked-list/solution.go)|

|118|[Pascal's Triangle](https://leetcode.com/problems/pascals-triangle)|Easy|[Go](src/pascals-triangle/solution.go)|

|119|[Pascal's Triangle II](https://leetcode.com/problems/pascals-triangle-ii)|Easy|[Go](src/pascals-triangle-ii/solution.go)|

|121|[Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock)|Easy|[Go](src/best-time-to-buy-and-sell-stock/solution.go)|

|122|[Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii)|Easy|[Go](src/best-time-to-buy-and-sell-stock-ii/solution.go)|

|125|[Valid Palindrome](https://leetcode.com/problems/valid-palindrome)|Easy|[Go](src/valid-palindrome/solution.go)|

|133|[Clone Graph](https://leetcode.com/problems/clone-graph)|Medium|[C++](src/clone-graph/solution.cpp)|

|136|[Single Number](https://leetcode.com/problems/single-number)|Easy|[Go](src/single-number/solution.go)|

|137|[Single Number II](https://leetcode.com/problems/single-number-ii)|Medium|[Go](src/single-number-ii/solution.go)|

|144|[Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal)|Medium|[Go](src/binary-tree-preorder-traversal/solution.go)|

|145|[Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal)|Hard|[Go](src/binary-tree-postorder-traversal/solution.go)|

|146|[LRU Cache](https://leetcode.com/problems/lru-cache)|Medium|[Go](src/lru-cache/solution.go)|

|153|[Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array)|Medium|[Go](src/find-minimum-in-rotated-sorted-array/solution.go)|

|154|[Find Minimum in Rotated Sorted Array II](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii)|Hard|[Go](src/find-minimum-in-rotated-sorted-array-ii/solution.go)|

|160|[Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists)|Easy|[Go](src/intersection-of-two-linked-lists/solution.go)|

|162|[Find Peak Element](https://leetcode.com/problems/find-peak-element)|Medium|[Go](src/find-peak-element/solution.go)|

|167|[Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted)|Easy|[Go](src/two-sum-ii-input-array-is-sorted/solution.go)|

|169|[Majority Element](https://leetcode.com/problems/majority-element)|Easy|[Go](src/majority-element/solution.go)|

|173|[Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator)|Medium|[Go](src/binary-search-tree-iterator/solution.go)|

|187|[Repeated DNA Sequences](https://leetcode.com/problems/repeated-dna-sequences)|Medium|[Go](src/repeated-dna-sequences/solution.go)|

|189|[Rotate Array](https://leetcode.com/problems/rotate-array)|Easy|[Go](src/rotate-array/solution.go)|

|198|[House Robber](https://leetcode.com/problems/house-robber)|Easy|[Go](src/house-robber/solution.go)|

|199|[Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view)|Medium|[Go](src/binary-tree-right-side-view/solution.go)|

|200|[Number of Islands](https://leetcode.com/problems/number-of-islands)|Medium|[Go](src/number-of-islands/solution.go)|

|202|[Happy Number](https://leetcode.com/problems/happy-number)|Easy|[Go](src/happy-number/solution.go)|

|204|[Count Primes](https://leetcode.com/problems/count-primes)|Easy|[Go](src/count-primes/solution.go)|

|205|[Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings)|Easy|[Go](src/isomorphic-strings/solution.go)|

|206|[Reverse Linked List](https://leetcode.com/problems/reverse-linked-list)|Easy|[Go](src/reverse-linked-list/solution.go)|

|215|[Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array)|Medium|[Go](src/kth-largest-element-in-an-array/solution.go)|

|217|[Contains Duplicate](https://leetcode.com/problems/contains-duplicate)|Easy|[Go](src/contains-duplicate/solution.go)|

|219|[Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii)|Easy|[Go](src/contains-duplicate-ii/solution.go)|

|226|[Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree)|Easy|, [Go](src/invert-binary-tree/solution.go)|

|230|[Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst)|Medium|[Go](src/kth-smallest-element-in-a-bst/solution.go)|

|231|[Power of Two](https://leetcode.com/problems/power-of-two)|Easy|[Go](src/power-of-two/solution.go)|

|232|[Implement Queue using Stacks](https://leetcode.com/problems/implement-queue-using-stacks)|Easy|[Go](src/implement-queue-using-stacks/solution.go)|

|235|[Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree)|Easy|[Go](src/lowest-common-ancestor-of-a-binary-search-tree/solution.go)|

|237|[Delete Node in a Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list)|Easy|[Go](src/delete-node-in-a-linked-list/solution.go)|

|242|[Valid Anagram](https://leetcode.com/problems/valid-anagram)|Easy|[Go](src/valid-anagram/solution.go)|

|257|[Binary Tree Paths](https://leetcode.com/problems/binary-tree-paths)|Easy|[Go](src/binary-tree-paths/solution.go)|

|263|[Ugly Number](https://leetcode.com/problems/ugly-number)|Easy|[Go](src/ugly-number/solution.go)|

|268|[Missing Number](https://leetcode.com/problems/missing-number)|Easy|[Go](src/missing-number/solution.go)|

|278|[First Bad Version](https://leetcode.com/problems/first-bad-version)|Easy|[Java](src/first-bad-version/solution.java)|

|279|[Perfect Squares](https://leetcode.com/problems/perfect-squares)|Medium|[Go](src/perfect-squares/solution.go)|

|283|[Move Zeroes](https://leetcode.com/problems/move-zeroes)|Easy|[Go](src/move-zeroes/solution.go)|

|287|[Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number)|Medium|[Go](src/find-the-duplicate-number/solution.go)|

|303|[Range Sum Query - Immutable](https://leetcode.com/problems/range-sum-query-immutable)|Easy|[Go](src/range-sum-query-immutable/solution.go)|

|322|[Coin Change](https://leetcode.com/problems/coin-change)|Medium|[Go](src/coin-change/solution.go)|

|326|[Power of Three](https://leetcode.com/problems/power-of-three)|Easy|[Go](src/power-of-three/solution.go)|

|328|[Odd Even Linked List](https://leetcode.com/problems/odd-even-linked-list)|Medium|[Go](src/odd-even-linked-list/solution.go)|

|344|[Reverse String](https://leetcode.com/problems/reverse-string)|Easy|[Go](src/reverse-string/solution.go)|

|345|[Reverse Vowels of a String](https://leetcode.com/problems/reverse-vowels-of-a-string)|Easy|[Go](src/reverse-vowels-of-a-string/solution.go)|

|347|[Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements)|Medium|[Go](src/top-k-frequent-elements/solution.go)|

|349|[Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays)|Easy|[Go](src/intersection-of-two-arrays/solution.go)|

|350|[Intersection of Two Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii)|Easy|[Go](src/intersection-of-two-arrays-ii/solution.go)|

|367|[Valid Perfect Square](https://leetcode.com/problems/valid-perfect-square)|Easy|[Go](src/valid-perfect-square/solution.go)|

|374|[Guess Number Higher or Lower](https://leetcode.com/problems/guess-number-higher-or-lower)|Easy|[Java](src/guess-number-higher-or-lower/solution.java)|

|387|[First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string)|Easy|[Go](src/first-unique-character-in-a-string/solution.go)|

|389|[Find the Difference](https://leetcode.com/problems/find-the-difference)|Easy|[Go](src/find-the-difference/solution.go)|

|403|[Frog Jump](https://leetcode.com/problems/frog-jump)|Hard|[Go](src/frog-jump/solution.go)|

|404|[Sum of Left Leaves](https://leetcode.com/problems/sum-of-left-leaves)|Easy|[Go](src/sum-of-left-leaves/solution.go)|

|409|[Longest Palindrome](https://leetcode.com/problems/longest-palindrome)|Easy|[Go](src/longest-palindrome/solution.go)|

|412|[Fizz Buzz](https://leetcode.com/problems/fizz-buzz)|Easy|[Go](src/fizz-buzz/solution.go)|

|416|[Partition Equal Subset Sum](https://leetcode.com/problems/partition-equal-subset-sum)|Medium|[Go](src/partition-equal-subset-sum/solution.go)|

|419|[Battleships in a Board](https://leetcode.com/problems/battleships-in-a-board)|Medium|[Go](src/battleships-in-a-board/solution.go)|

|448|[Find All Numbers Disappeared in an Array](https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array)|Easy|[Go](src/find-all-numbers-disappeared-in-an-array/solution.go)|

|451|[Sort Characters By Frequency](https://leetcode.com/problems/sort-characters-by-frequency)|Medium|[Go](src/sort-characters-by-frequency/solution.go)|

|461|[Hamming Distance](https://leetcode.com/problems/hamming-distance)|Easy|[Go](src/hamming-distance/solution.go)|

|476|[Number Complement](https://leetcode.com/problems/number-complement)|Easy|[Go](src/number-complement/solution.go)|

|482|[License Key Formatting](https://leetcode.com/problems/license-key-formatting)|Easy|[Go](src/license-key-formatting/solution.go)|

|520|[Detect Capital](https://leetcode.com/problems/detect-capital)|Easy|[Go](src/detect-capital/solution.go)|

|538|[Convert BST to Greater Tree](https://leetcode.com/problems/convert-bst-to-greater-tree)|Easy|[Go](src/convert-bst-to-greater-tree/solution.go)|

|617|[Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees)|Easy|[Go](src/merge-two-binary-trees/solution.go)|

|621|[Task Scheduler](https://leetcode.com/problems/task-scheduler)|Medium|[Go](src/task-scheduler/solution.go)|

|657|[Robot Return to Origin](https://leetcode.com/problems/robot-return-to-origin)|Easy|[Go](src/robot-return-to-origin/solution.go)|

|658|[Find K Closest Elements](https://leetcode.com/problems/find-k-closest-elements)|Medium|[Go](src/find-k-closest-elements/solution.go)|

|680|[Valid Palindrome II](https://leetcode.com/problems/valid-palindrome-ii)|Easy|[Go](src/valid-palindrome-ii/solution.go)|

|693|[Binary Number with Alternating Bits](https://leetcode.com/problems/binary-number-with-alternating-bits)|Easy|[Go](src/binary-number-with-alternating-bits/solution.go)|

|695|[Max Area of Island](https://leetcode.com/problems/max-area-of-island)|Medium|[Go](src/max-area-of-island/solution.go)|

|733|[Flood Fill](https://leetcode.com/problems/flood-fill)|Easy|[Go](src/flood-fill/solution.go)|

|745|[Find Smallest Letter Greater Than Target](https://leetcode.com/problems/find-smallest-letter-greater-than-target)|Easy|[Go](src/find-smallest-letter-greater-than-target/solution.go)|

|768|[Partition Labels](https://leetcode.com/problems/partition-labels)|Medium|[Go](src/partition-labels/solution.go)|

|782|[Jewels and Stones](https://leetcode.com/problems/jewels-and-stones)|Easy|[Go](src/jewels-and-stones/solution.go)|

|792|[Binary Search](https://leetcode.com/problems/binary-search)|Easy|[Go](src/binary-search/solution.go)|

|822|[Unique Morse Code Words](https://leetcode.com/problems/unique-morse-code-words)|Easy|[Go](src/unique-morse-code-words/solution.go)|

|837|[Most Common Word](https://leetcode.com/problems/most-common-word)|Easy|[Go](src/most-common-word/solution.go)|

|860|[Design Circular Queue](https://leetcode.com/problems/design-circular-queue)|Medium|[Go](src/design-circular-queue/solution.go)|

|861|[Flipping an Image](https://leetcode.com/problems/flipping-an-image)|Easy|[Go](src/flipping-an-image/solution.go)|

|871|[Keys and Rooms](https://leetcode.com/problems/keys-and-rooms)|Medium|[Go](src/keys-and-rooms/solution.go)|

|874|[Backspace String Compare](https://leetcode.com/problems/backspace-string-compare)|Easy|[Go](src/backspace-string-compare/solution.go)|

|917|[Boats to Save People](https://leetcode.com/problems/boats-to-save-people)|Medium|[Go](src/boats-to-save-people/solution.go)|

|926|[Find and Replace Pattern](https://leetcode.com/problems/find-and-replace-pattern)|Medium|[Go](src/find-and-replace-pattern/solution.go)|

|932|[Monotonic Array](https://leetcode.com/problems/monotonic-array)|Easy|[Go](src/monotonic-array/solution.go)|

|940|[Fruit Into Baskets](https://leetcode.com/problems/fruit-into-baskets)|Medium|[Go](src/fruit-into-baskets/solution.go)|

|941|[Sort Array By Parity](https://leetcode.com/problems/sort-array-by-parity)|Easy|[Go](src/sort-array-by-parity/solution.go)|

|965|[Unique Email Addresses](https://leetcode.com/problems/unique-email-addresses)|Easy|[Go](src/unique-email-addresses/solution.go)|

|975|[Range Sum of BST](https://leetcode.com/problems/range-sum-of-bst)|Easy|[Go](src/range-sum-of-bst/solution.go)|

|978|[Valid Mountain Array](https://leetcode.com/problems/valid-mountain-array)|Easy|[Go](src/valid-mountain-array/solution.go)|

|1013|[Fibonacci Number](https://leetcode.com/problems/fibonacci-number)|Easy|[Go](src/fibonacci-number/solution.go)|

|1014|[K Closest Points to Origin](https://leetcode.com/problems/k-closest-points-to-origin)|Medium|[Go](src/k-closest-points-to-origin/solution.go)|

|1078|[Remove Outermost Parentheses](https://leetcode.com/problems/remove-outermost-parentheses)|Easy|[Go](src/remove-outermost-parentheses/solution.go)|

|1207|[Delete Nodes And Return Forest](https://leetcode.com/problems/delete-nodes-and-return-forest)|Medium|[Go](src/delete-nodes-and-return-forest/solution.go)|

|1369|[Minimum Swaps to Make Strings Equal](https://leetcode.com/problems/minimum-swaps-to-make-strings-equal)|Medium|[Go](src/minimum-swaps-to-make-strings-equal/solution.go)|
ecosyste.ms

Data

Tools

Indexes

Applications

Experiments

Awesome

https://github.com/kakugirai/leetcode-go

Awesome Lists containing this project

README
